Split (1)

train · 10.4k rows

entry_id stringlengths 33 33	published stringlengths 14 14	title stringlengths 10 200	authors list	primary_category stringlengths 5 18	categories list	text stringlengths 2 817k
http://arxiv.org/abs/2306.07326v1	20230612180002	Energy conditions for non-timelike massive thin shells	[ "Hideki Maeda" ]	gr-qc	[ "gr-qc" ]	July 31, 2023 =16pt Energy conditions for non-timelike massive thin shells 0.5cm 10.mm Hideki Maeda^a,b 1cm ^a Department of Electronics and Information Engineering, Hokkai-Gakuen University, Sapporo 062-8605, Japan. ^b Max-Plank-Institut für Gravitationsphysik (Albert-Einstein-Institut), Am Mühlenberg 1, D-14476 Potsdam, Germany. 0.2in Abstract We study energy conditions for non-timelike massive thin shells in arbitrary n(≥ 3) dimensions. It is shown that the induced energy-momentum tensor t_μν on a shell Σ is of the Hawking-Ellis type I if Σ is spacelike and either of type I, II, or III if Σ is null. Then, we derive simple equivalent representations of the standard energy conditions for t_μν. In particular, on a spacelike shell or on a null shell with non-vanishing surface current, t_μν inevitably violates the dominant energy condition. Those fully general results are obtained without imposing a spacetime symmetry and can be used in any theory of gravity. Lastly, several applications of the main results are presented in general relativity in four dimensions. 2.mm § INTRODUCTION In gravitation physics, a massive thin shell Σ is a junction hypersurface of two spacetimes on which there is a non-vanishing induced energy-momentum tensor t_μν. Possible embeddings of Σ in a given set of bulk spacetimes and the resulting t_μν are determined by the junction conditions. The first junction conditions require that the induced metrics on both sides of Σ are the same. Then, the second junction conditions relate t_μν and the jump of the extrinsic curvature (transverse curvature) of Σ if Σ is non-null (null). In general relativity, the second junction conditions are derived from the Einstein equations and referred to as the Israel junction conditions for non-null Σ <cit.> and the Barrabès-Israel junction conditions for null Σ <cit.>. The Barrabès-Israel junction conditions have been reformulated by Poisson to provide a simple characterization of the thin-shell energy-momentum tensor t_μν <cit.>. (The junction conditions in general relativity are summarized in Sec. 3 in the textbook <cit.>.) In fact, in order to grasp the essence of general relativistic gravitational phenomena, massive thin shells have been used to construct simple models in a very wide variety of contexts. It is not possible to list all the papers, but examples of such phenomena are gravitational collapse <cit.>, growth of cosmic voids <cit.> and bubbles <cit.>, and brane cosmology <cit.>. An exact model for the mass-inflation instability of the inner horizon of a charged black hole has also been constructed using a null shell <cit.>. The junction conditions have also been established in a large class of scalar-tensor theories of gravity for non-null Σ <cit.> as well as for general Σ <cit.> and in Einstein-Gauss-Bonnet higher curvature gravity for non-null Σ <cit.>. (See <cit.> for recent developments in the research of junction conditions.) For such a shell model to be physically reasonable, t_μν induced on the shell should satisfy at least some of the standard energy conditions <cit.>. (See <cit.> for a nice review of the energy conditions.) In arbitrary n(≥ 3) dimensions, an energy-momentum tensor T_μν is classified into the four Hawking-Ellis types (three types for n=2) <cit.> and equivalent representations of the standard energy conditions in terms of the orthonormal components of T_μν in the canonical frame are available for each type <cit.>. Even so, finding the canonical orthonormal frame by local Lorentz transformations is often not easy. Accordingly, we derived equivalent representations of the standard energy conditions in the case where the orthonormal components of T_μν admit only a single off-diagonal “space-time” component <cit.>. Relations between the first junction conditions and the energy conditions were discussed in <cit.> for a timelike Σ. If a shell Σ is timelike, due to the Lorentzian signature on Σ, the energy conditions for t_μν induced on the shell have to be examined in each case individually using those results. In contrast, if a shell is non-timelike, the situation is drastically simplified. In this paper, we will present simple representations of the standard energy conditions for t_μν on a non-timelike Σ embedding in an n(≥ 2)-dimensional spacetime. The present article is organized as follows. In the next section, after reviewing the standard energy conditions, the Hawking-Ellis classification of an energy-momentum tensor, and the junction conditions, we will present our main results. In Sec. <ref>, we will apply the main results in several physical situations in general relativity in four dimensions. Throughout this article, the signature of the Minkowski spacetime is (-,+,…,+), and Greek indices run over all spacetime indices. Other types of indices will be specified in the main text. We adopt the units such that c=1 and use κ_n:=8π G_n instead of the n-dimensional gravitational constant G_n. The conventions of curvature tensors such as [∇ _ρ ,∇_σ]V^μ =R^μ_νρσV^ν and R_μν=R^ρ_μρν. § ENERGY CONDITIONS FOR MASSIVE THIN-SHELLS We follow the definitions and notations adopted in <cit.> for the energy conditions and the Hawking-Ellis types. In n(≥ 2) dimensions, the standard energy conditions for an energy-momentum tensor T_μν are stated as follows: * Null energy condition (NEC): T_μν k^μ k^ν≥ 0 for any null vector k^μ. * Weak energy condition (WEC): T_μν v^μ v^ν≥ 0 for any timelike vector v^μ. * Dominant energy condition (DEC): T_μν v^μ v^ν≥ 0 and J_μ J^μ≤ 0 hold for any timelike vector v^μ, where J^μ:=-T^μ_μνv^ν is an energy-flux vector for an observer with its tangent vector v^μ. * Strong energy condition (SEC): (T_μν-1/n-2Tg_μν) v^μ v^ν≥ 0 for any timelike vector v^μ. The SEC is defined only for n≥ 3 and it is equivalent to the timelike convergence condition R_μνv^μv^ν≥ 0 for any timelike vector in general relativity without a cosmological constant. We note that, although n≥ 3 is assumed in <cit.>, the results there for the NEC, WEC, and DEC are also valid for n=2. §.§ Hawking-Ellis types An orthonormal frame is defined by a set of n orthonormal basis vectors {E^μ_(α)} (α=0,1,⋯,n-1) that satisfy E^μ_(α)E_(β)μ=η_(α)(β)=(-1,1,⋯,1), which is equivalent to g_μν=η_(α)(β)E^(α)_μE^(β)_ν. The Minkowski metric η_(α)(β) in the orthonormal frame and its inverse η^(α)(β) are respectively used to lower and raise the indices (α). Components of T_μν in the orthonormal frame are given by T_(α)(β)=T_μνE_(α)^μE_(β)^ν. Orthonormal frame has a degree of freedom provided by local Lorentz transformations E^μ_(α)→Ẽ^μ_(α):=L_(α)^ (β)E^μ_(β), where L_(α)^ (β) satisfies L_(α)^ (γ)L_(β)^ (δ)η_(γ)(δ)=η_(α)(β). T_(α)(β) behaves as a scalar under a diffeomorphism and as a two-tensor under a local Lorentz transformation. We refer to such a mathematical object as a Lorentz-covariant tensor. According to this terminology, a basis vector E^μ_(α) is a Lorentz-covariant vector. The Hawking-Ellis classification of T_μν is performed according to the properties of the Lorentz-invariant eigenvalues λ and eigenvectors n^μ (or Lorentz-covariant eigenvectors n^(α)=E^(α)_μ n^μ) that are determined by the following eigenvalue equations <cit.>: T^(α)(β) n_(β)=λη^(α)(β) n_(β) ⇔ T^μνn_ν=λ g^μν n_ν. The characteristic equation to determine λ is (T^(α)(β)-λη^(α)(β))=0. Since n_(α)n^(α)=n_μ n^μ holds, a Lorentz-covariant vector n^(α) is referred to as timelike, spacelike, and null if n_(α)n^(α) is negative, positive, and zero, respectively. In three or higher dimensions (n≥ 3), T_μν is classified into four types as summarized in Table <ref> <cit.>. In two dimensions (n=2), T_μν is classified into type I, II, or IV. By local Lorentz transformations, we can write each type of T^(α)(β) in a canonical form and then equivalent representations of the standard energy conditions are available <cit.>. Type I The canonical form of type I is T^(α)(β)=(ρ,p_1,p_2,⋯,p_n-1) for which the characteristic equation (<ref>) gives (λ+ρ)(λ-p_1)⋯(λ-p_n-1)=0, so that the eigenvalues are λ={-ρ,p_1,p_2,⋯,p_n-1}. The eigenvector of λ=-ρ is timelike and other eigenvectors are spacelike. The standard energy conditions are equivalent to the following inequalities: : ρ+p_i≥ 0 i=1,2,⋯,n-1, : ρ≥ 0, : ρ-p_i≥ 0 i=1,2,⋯,n-1, : (n-3)ρ+p_j≥ 0 Type II The canonical form of type II is T^(α)(β)=( [ ρ+ν ν 0 0 ⋯ 0; ν -ρ+ν 0 0 ⋯ 0; 0 0 p_2 0 ⋯ 0; 0 0 0 ⋱ ⋮ ⋮; ⋮ ⋮ ⋮ ⋯ ⋱ 0; 0 0 0 ⋯ 0 p_n-1 ]) with ν 0, for which the characteristic equation (<ref>) gives (λ+ρ)^2(λ-p_2)⋯(λ-p_n-1)=0, so that the eigenvalues are λ={-ρ,p_2,⋯,p_n-1}. The Lorentz-covariant eigenvector n_(α)=k̅_(α) of the doubly degenerate eigenvalue λ=-ρ is null, while the Lorentz-covariant eigenvectors n_(α)=w_i(α) (i=2,3,⋯,n-1) of the eigenvalues λ=p_i are spacelike. k̅_(α) and w_i(α) are given by k̅_(α)=( [ -1; 1; 0; 0; ⋮; 0 ]), w_2(α)=( [ 0; 0; 1; 0; ⋮; 0 ]), ⋯, w_n-1(α)=( [ 0; 0; 0; 0; ⋮; 1 ]), with which T^(α)(β) can be written as T^(α)(β)=νk̅^(α)k̅^(β)-ρ η_2^(α)(β)+∑_i=2^n-1p_iw_i^(α) w_i^(β), where η_2^(α)(β):=(-1,1,0,⋯,0). The standard energy conditions are equivalent to the following inequalities: : ν≥ 0ρ+p_i≥ 0 i=2,3,⋯,n-1, : ρ≥ 0, : ρ-p_i≥ 0 i=2,3,⋯,n-1, : (n-4)ρ+p_j≥ 0 Type III The canonical form of type III is T^(α)(β)=( [ ρ+ν ν ζ 0 0 ⋯ 0; ν -ρ+ν ζ 0 0 ⋯ 0; ζ ζ -ρ 0 0 ⋯ 0; 0 0 0 p_3 0 ⋯ 0; 0 0 0 0 ⋱ ⋮ ⋮; ⋮ ⋮ ⋮ ⋮ ⋯ ⋱ 0; 0 0 0 0 ⋯ 0 p_n-1 ]) with ζ 0, for which the characteristic equation (<ref>) gives (λ+ρ)^3(λ-p_3)⋯(λ-p_n-1)=0, so that the eigenvalues are λ={-ρ,p_3,⋯,p_n-1}. The eigenvector of the triply degenerate eigenvalue λ=-ρ is null and other eigenvectors are spacelike. Any type-III energy-momentum tensor violates all the standard energy conditions. We note that ν in Eq. (<ref>) can be set to zero by local Lorentz transformations if and only if ζ is non-zero <cit.>. Nevertheless, the expression (<ref>) with non-vanishing ν admits a limit ζ→ 0 to type II and may be useful to identify a type-III energy-momentum tensor in a given spacetime. Type IV The canonical form of type IV is T^(α)(β)=( [ ρ ν 0 0 ⋯ 0; ν -ρ 0 0 ⋯ 0; 0 0 p_2 0 ⋯ 0; 0 0 0 ⋱ ⋮ ⋮; ⋮ ⋮ ⋮ ⋯ ⋱ 0; 0 0 0 ⋯ 0 p_n-1 ]) with ν 0, for which the characteristic equation (<ref>) gives [(λ+ρ)^2+ν^2](λ-p_2)⋯(λ-p_n-1)=0, so that the eigenvalues are λ={-ρ+ iν,-ρ - iν,p_2,⋯,p_n-1}. The eigenvectors of the complex eigenvalues λ=-ρ± iν are complex and other eigenvectors are spacelike. Any type-IV energy-momentum tensor violates all the standard energy conditions. We note that a canonical form of T^(α)(β) in the textbook <cit.> is different from Eq. (<ref>). However, the expression (<ref>) may be more useful as pointed out in <cit.>. §.§ Energy-momentum tensor of massive thin-shells For junction conditions, we follow the definitions and notations adopted in <cit.>. We consider an (n-1)-dimensional junction hypersurface Σ between two n(≥ 2)-dimensional spacetime regions ( M_+, g_μν^+) and ( M_-, g_μν^-). The metric g_μν^± is expressed in the coordinates x_±^μ on ( M_±, g_μν^±). In the following subsections, we identify an n-dimensional spacetime ( M,g_μν) with the line element s_n^2= g_μν(x) x^μ x^ν as ( M_+, g_μν^+) or ( M_-, g_μν^-) and its boundary as Σ. Suppose that Σ is described by Φ(x)=constant in the bulk spacetime (<ref>). We set the same intrinsic coordinates y^a on both sides of Σ and introduce the standard notation [X] defined by [X]:= X^+-X^-, where X^± are X's evaluated either on the + or - side of Σ. §.§.§ Non-null shell Here we consider the case where Σ is non-null as shown in Fig. <ref>. A unit normal vector n^μ to Σ is given by n_μ:=ε∇_μΦ/(ε g^ρσ∇_ρΦ∇_σΦ)^1/2 and satisfies n^μ n_μ=ε, where ε=1 (-1) corresponds to the case where Σ is a timelike (spacelike) hypersurface. We choose n^μ to point from M_- to M_+. In the bulk spacetime ( M,g_μν), Σ is described by x^μ=x^μ(y) and the line element on Σ is given by s_Σ^2= h_ab(y) y^a y^b, where the induced metric h_ab on Σ is defined by h_ab(y):= g_μν e^μ_a e^ν_b, e^μ_a:=∂ x^μ/∂ y^a. h_ab and its inverse h^ab are used to raise or lower Latin indices, respectively. A projection tensor is defined by h_μν:=g_μν-ε n_μ n_ν which satisfies h_μνn^ν=0 and h_ab=h_μνe^μ_a e^ν_b (and therefore h_μν=h_abe^a_μ e^b_ν). The extrinsic curvature (or the second fundamental form) K_μν of Σ and its trace are defined by K_μν:= h^ ρ_μ h^ σ_ν∇_ρn_σ(≡1/2 L_nh_μν), K:= g^μνK_μν=∇_μ n^μ, where L_n is the Lie derivative with respect to n^μ. K_μν is symmetric and tangent to Σ, so that K_μνn^ν=0 holds. The first junction conditions at Σ are given by [h_ab]=0, which means that the induced metric on Σ is the same on both sides of Σ. Under the first junction conditions, one obtains the second junction conditions from the gravitational field equations[Independent second junction conditions may also be obtained from the field equations for matter fields in the bulk spacetime M. (See <cit.> in the case of a scalar field.)] that determine the induced energy-momentum tensor t_μν on Σ. t_μν is symmetric and tangent to Σ, so that t_μνn^ν=0 holds. In general relativity, the second junction conditions are obtained from the Einstein equations G_μν+Λ g_μν=κ_nT_μν and referred to as the Israel junction conditions <cit.>, which are given by -ε([K_μν]-h_μν[K])=κ_nt_μν ⇔ -ε([K_ab]-h_ab[K])=κ_n t_ab, where K_ab:=K_μνe^μ_a e^ν_b, K≡ K_abh^ab, and t_ab:=t_μνe^μ_a e^ν_b. We wil use the following expression K_ab= (∇_μ n_ν)e^μ_a e^ν_b = -n_μe_a,b^μ-Γ^κ_μνn_κ e_a^μ e_b^ν , where we have used n_μe_a^μ=0 at the last equality. §.§.§ Null shell In the case where Σ is null, our convention is such that M_- is in the past of Σ and M_+ is in the future as shown in Fig. <ref>. Since the unit normal vector (<ref>) cannot be used for null Σ, we introduce a null vector k^μ defined by k^μ=-∇^μΦ, which is tangent to the generators of Σ. (See Sec. 3.1 in the textbook <cit.> for the proof.) Here the minus sign is chosen so that k^μ is future-directed when Φ increases toward the future. We install intrinsic coordinates y^a=(λ, θ^A) (A=2,3,⋯,n-1) on Σ, where λ is an arbitrary parameter on the null generators of Σ and the other n-2 coordinates θ^A label the generators. λ can be an affine parameter on one side of Σ but it is in general not possible on both sides of Σ. The tangent vectors e^μ_a:=∂ x^μ/∂ y^a on each side of Σ are naturally segregated into a null vector k^μ that is tangent to the generators and spacelike vectors e^μ_A that point in the directions transverse to the generators. k^μ and e^μ_A are explicitly written as k^μ≡ e^μ_λ=(∂ x^μ/∂λ)_θ^A, e^μ_A=(∂ x^μ/∂θ^A)_λ, which satisfy k^μ k_μ=0=k_μe^μ_A. The line element on Σ is s_Σ^2=g_μνe^μ_ae^ν_b y^a y^b=σ_ABθ^A θ^B, where the induced metric σ_AB on Σ is defined by σ_AB:=g_μνe^μ_Ae^ν_B. A basis is completed by adding a transverse null vector N^μ which satisfies N_μ N^μ=0, N_μ k^μ=-1, N_μe^μ_A=0. The completeness relations of the basis are given as g^μν=-k^μ N^ν-N^μ k^ν+σ^AB e^μ_Ae^ν_B, where σ^AB is the inverse of σ_AB. The first junction conditions at Σ are given by [σ_AB]=0, which means that the induced metric on Σ is the same on both sides of Σ. Since k^μ is not normal but tangent to the generators of Σ, we introduce the transverse curvature C_ab that properly represents the transverse derivative of the metric: C_ab :=1/2 ( L_N g_μν)e^μ_a e^ν_b=(∇_μ N_ν)e^μ_ae^ν_b, where we have used that ∇_ν(N_μ e^μ_a)=0 and an identity (∇_ν e^μ_a)e^ν_b≡ (∇_ν e^μ_b)e^ν_a at the last equality. The jump in the transverse curvature [C_ab] is directly related to the induced energy-momentum tensor t_μν on Σ. In the reformulation by Poisson <cit.>, one needs to introduce an arbitrary congruence of timelike geodesics γ that arbitrarily intersect Σ, of which unit tangent vector is u^μ, in order to derive the expression of t_μν. Each member of the congruence corresponds to the world line of a geodesic observer that intersects Σ and performs measurements there. The congruence corresponds to a whole family of such observers and gives operational meaning to the distributional character of t_μν. We parametrize γ by the proper time τ such that τ=0 at Σ, τ<0 in M_-, and τ>0 in M_+. Then, a displacement along a member of the congruence is described by x^μ=u^μτ. Continuity of u^μ across Σ requires [-u_μ k^μ]=0, [u_μ e^μ_A]=0, while u_μ N^μ may be discontinuous across Σ. Then, under the first junction conditions (<ref>), one obtains the second junction conditions from the gravitational field equations, which determine the induced energy-momentum tensor t_μν on Σ. Generally, t_μν is obtained in the following form: t_μν= (-k_ηu^η)^-1S_μν, where S_μν:=μ k_μ k_ν +j_A(k_μ e_ν^A+e_μ^A k_ν)+pσ_ABe_μ^A e_ν^B. Here μ, j^A, and p are respectively interpreted as the shell's surface density, surface current, and isotropic surface pressure. Those quantities multiplied by (-k_ηu^η)^-1 are the quantities that the geodesic observer corresponding to γ measures. t_μν is symmetric and tangent to Σ, so that t_μνk^ν=0 holds. In general relativity, the second junction conditions are obtained from the Einstein equations G_μν+Λ g_μν=κ_nT_μν and referred to as the Barrabès-Israel junction conditions <cit.>, which are given by κ_nμ=-σ^AB[C_AB], κ_nj^A=σ^AB[C_λ B], κ_np=-[C_λλ]. §.§ Main results Now we are ready to present our main results. If Σ is timelike (ε=1), h_ab has the Lorentzian signature and consequently the induced energy-momentum tensor t^μν(=t^abe^μ_a e^ν_b) can be any of the Hawking-Ellis types I through IV. In contrast, on a spacelike Σ (ε=-1), as shown below, t^μν is of type I and simple equivalent representations of the standard energy conditions for t^μν are available. An induced energy-momentum tensor t_μν on a spacelike hypersurface Σ is of the Hawking-Ellis type I and a non-vanishing t_μν violates the DEC. The NEC, WEC, and SEC are all equivalent to that p_i≥ 0 are satisfied for all i(=1,2,⋯,n-1), where p_i are eigenvalues of the eigenvalue equations t_abv^b=λ h_abv^b. Proof: For ε=-1, we can choose E^μ_(0)=n^μ and set t_(a)(b)=t_μνE^μ_(a)E^ν_(b) (a,b=1,2,⋯,n-1) be diagonal without loss of generality by using degrees of freedom to rotate the spacelike basis vectors E^μ_(a). In this orthonormal frame, t_(α)(β) is given in the form of the Hawking-Ellis type I as t_(α)(β)=(0,p_1,p_2,⋯,p_n-1) and the proposition follows from Eqs. (<ref>)–(<ref>) because p_i are eigenvalues of the eigenvalue equations t_(a)(b)v^(b)=λδ_(a)(b)v^(b). By identifications E^μ_(a)≡ e^μ_a/\|e^μ_a\|, the eigenvalue equations are written as t_abv^b=λ h_abv^b, where v^b=v^μ e^b_μ is a vector on Σ. Next, we consider the case where Σ is null. The Hawking-Ellis type of t_μν and equivalent representations of the standard energy conditions for t_μν are given as follows. Define J^2 for an induced energy-momentum tensor t_μν in the most general form (<ref>) on a null hypersurface Σ by J^2:=j_A j_B σ^AB. For t_μν, the Hawking-Ellis type and equivalent representations of the standard energy conditions are as shown in the following table. Hawking-Ellis type NEC, WEC, SEC DEC J=0 II μ≥ 0, p≥ 0 μ≥ 0, p=0 J 0, p=0 III violated violated Jp 0, J^2μ p II μ p>J^2, p> 0 violated Jp 0, J^2= μ p I p>0 violated Proof. We introduce orthonormal basis vectors E^μ_(α) at the location of Σ such that a timelike basis vector E^μ_(0) and a spacelike basis vector E^μ_(1) are given by {[ E^μ_(0)=(k^μ+N^μ)/√(2); E^μ_(1)=(-k^μ+N^μ)/√(2) ]. ⇔ {[ k^μ=(E^μ_(0)-E^μ_(1))/√(2); N^μ=(E^μ_(0)+E^μ_(1))/√(2) ].. If j_A e_μ^A is non-vanishing, using degrees of freedom to rotate the spacelike basis vectors E^μ_(i) (i=2,3,⋯,n-1), we can set E_μ(2) point the direction of j_A e_μ^A such that j_A e_μ^A=-JE_μ(2) without loss of generality, where J satisfies Eq. (<ref>). If j_A e_μ^A is vanishing (and then J^2=0), we don't specify the direction of E_μ(2). Now Eq. (<ref>) is written as S^μν= 1/2μ(E^μ_(0)-E^μ_(1))(E^ν_(0)-E^ν_(1)) -1/√(2)J[(E^μ_(0)-E^μ_(1))E^ν_(2)+E^μ_(2)(E^ν_(0)-E^ν_(1))] +p[g^μν+1/2(E^μ_(0)-E^μ_(1))(E^ν_(0)+E^ν_(1)) +1/2(E^μ_(0)+E^μ_(1))(E^ν_(0)-E^ν_(1)) ], where we have used Eq. (<ref>). Then, we obtain orthonormal components of the induced energy-momentum tensor (<ref>) as t^(α)(β)=(-k_ηu^η)^-1S^(α)(β), where S^(α)(β):=( [ μ/2 μ/2 J/√(2) 0 0 ⋯ 0; μ/2 μ/2 J/√(2) 0 0 ⋯ 0; J/√(2) J/√(2) p 0 0 ⋯ 0; 0 0 0 p 0 ⋯ 0; 0 0 0 0 ⋱ ⋮ ⋮; ⋮ ⋮ ⋮ ⋮ ⋯ ⋱ 0; 0 0 0 0 ⋯ 0 p ]). Since the factor (-k_ηu^η)^-1 is positive, the Hawking-Ellis types and the energy conditions for t^(α)(β) and S^(α)(β) are the same. For J=0, S^(α)(β) is in the canonical type II form (<ref>) with ν=μ/2, ρ=0, and p_2=p_3=⋯=p_n-1=p. Then, the standard energy conditions are equivalent to : μ≥ 0p≥ 0, : μ≥ 0p=0 by Eqs. (<ref>)–(<ref>). For J 0 with p=0, S^(α)(β) is in the canonical type-III form (<ref>) with ν=μ/2, ρ=0, and ζ= J/√(2), and then all the standard energy conditions are violated. Hereafter we assume Jp 0. The characteristic equation of the eigenvalue equations gives λ^2(λ-p)^n-2=0 and hence the eigenvalues are λ={0,p}. For the eigenvalue λ=p( 0), the corresponding n-2 Lorentz-covariant eigenvectors are spacelike and their normalized forms are given by n_(α)={w_i(α)} (i=2,3,⋯,n-1), where w_2(α)=( [ J/(√(2)p); -J/(√(2)p); -1; 0; ⋮; 0 ]), w_3(α)=( [ 0; 0; 0; 1; ⋮; 0 ]),⋯, w_n-1(α)=( [ 0; 0; 0; 0; ⋮; 1 ]). Comparing S^(α)(β)-∑_i=2^n-1pw_i^(α) w_i^(β) =( [ (μ p-J^2)/(2p) (μ p-J^2)/(2p) 0 0 0 ⋯ 0; (μ p-J^2)/(2p) (μ p-J^2)/(2p) 0 0 0 ⋯ 0; 0 0 0 0 0 ⋯ 0; 0 0 0 0 0 ⋯ 0; 0 0 0 0 ⋱ ⋮ ⋮; ⋮ ⋮ ⋮ ⋮ ⋯ ⋱ 0; 0 0 0 0 ⋯ 0 0 ]) with Eqs. (<ref>) and (<ref>), we find that S^(α)(β) is of type II for μ p J^2 and of type I for μ p=J^2. For μ p J^2, the canonical form of S^(α)(β) is given by Eq. (<ref>) with ν=(μ p-J^2)/(2p), ρ=0, and p_2=p_3=⋯=p_n-1=p. Then, by Eqs. (<ref>)–(<ref>), the NEC, WEC, and SEC are equivalent to μ p>J^2 and p>0, while the DEC is violated. For μ p= J^2, the canonical form of S^(α)(β) is given by Eq. (<ref>) with ρ=0, p_1=0, and p_2=p_3=⋯=p_n-1=p. Then, by Eqs. (<ref>)–(<ref>), the NEC, WEC, and SEC are equivalent to p>0, while the DEC is violated. § APPLICATIONS IN GENERAL RELATIVITY IN FOUR DIMENSIONS Propositions <ref> and <ref> in the previous section are the main results in the present paper. Without imposing a spacetime symmetry, we have shown that the induced energy-momentum tensor t_μν on a shell Σ is of the Hawking-Ellis type I if Σ is spacelike and either of type I, II, or III if Σ is null. Then, we have derived equivalent representations of the standard energy conditions for t_μν. In particular, on a spacelike shell or on a null shell with non-vanishing surface current, t_μν inevitably violates the DEC. Those fully general results have been obtained without imposing a spacetime symmetry and can be used in any theory of gravity. In this section, as a demonstration, we apply Propositions <ref> and <ref> to several physical situations in general relativity in four dimensions (n=4). §.§ Shells in the Schwarzschild spacetime §.§.§ Black bounce with a spacelike shell As the first application, we consider a spacelike massive thin shell constructed by gluing two Schwarzschild bulk spacetimes. We write the bulk metric in the diagonal coordinates x^μ=(t,r,θ,ϕ) as s^2=g_μν x^μ x^ν=-f(r) t^2+f(r)^-1 r^2+r^2γ_AB z^A z^B, f(r) := 1-2M/r, γ_AB z^A z^B=θ^2+sin^2θϕ^2, where M is a positive mass parameter and z^A (A=2,3) are coordinates on the unit two-sphere S^2. Let r_0 be a constant satisfying 0<r_0<2M and consider two spacetimes which are described by the metric (<ref>) with the same positive mass M and defined in the domain r≥ r_0. We glue them at a spacelike hypersurface Σ described by r=r_0. In the resulting spacetime, the big bounce occurs at a spacelike bounce hypersurface Σ inside the event horizon of a black hole as shown in Fig. <ref>. Such a spacetime is referred to as a black bounce. Our model is a thin-shell version of the Simpson-Visser black-bounce model <cit.>, in which the metric is analytic everywhere. We will show that all the standard energy conditions are violated on Σ. As seen from M_+, the unit normal one-form to Σ is given by n^+_μ x^μ =-1/√(-f(r_0)) r . Note that the timelike vector n^μ=(0,√(-f(r_0)),0,0) points an increasing direction of r, which is consistent with the assumption in Sec. <ref> that n^μ points from M_- to M_+. The induced metric h_ab on the spacelike Σ is given by s_Σ^2=h_ab(y) y^a y^b= -f(r_0) t^2+r_0^2γ_AB z^A z^B , where a=1,2,3 and we have identified y^1≡ t and y^A≡ z^A. Since r_0=2M is the same on both sides of Σ, the first junction conditions [h_ab]=0 are satisfied. Using Eq. (<ref>) with Eq. (<ref>) and e^μ_t∂/∂ x^μ=∂/∂ t, e^μ_A∂/∂ x^μ=∂/∂ z^A, we obtain non-zero components of K_ab as seen from M_+ as K^+_tt= -1/2√(-f)f'\|_r=r_0 , K^+_AB=r√(-f)γ _AB\|_r=r_0 , which give K^+=K^+_abh^ab=(-f'/2√(-f)+2√(-f)/r)\|_r=r_0 , where a prime denotes differentiation with respect to r. As seen from M_-, the unit normal is given by n^-_μ x^μ =1/√(-f(r_0)) r instead of Eq. (<ref>), which points a decreasing direction of r. As a result, K_ab as seen from M_- is given by K_ab^-=-K_ab^+. Then, the Israel junction conditions (<ref>) with ε=-1 give κ_4t_ab=2(K_ab^+-h_abK^+), of which non-zero components are given by t_tt= -4(-f)^3/2/κ_4r\|_r=r_0=:λ_1, t_AB=r(rf'+2f)/κ_4√(-f)γ_AB\|_r=r_0=:λ_2γ_AB. Eigenvalues of t_abv^b=λ h_abv^b are given by λ={p_1,p_2}, where p_1:=-4√(-f)/κ_4r\|_r=r_0, p_2:=rf'+2f/κ_4r√(-f)\|_r=r_0. Since p_1 is negative, all the standard energy conditions are violated on Σ by Proposition <ref>. §.§.§ Lightlike impulse as a null shell Next, we study the energy conditions of a lightlike impulse in the Schwarzschild spacetime as a null shell, which has been studied in <cit.>. We write the bulk metric in the single-null coordinates (v,r,z^A) as s^2= g_μν x^μ x^ν=-f(r) v^2+2ϵ v r+r^2γ_AB z^A z^B, where f(r) and γ_AB are defined by Eq. (<ref>) and ϵ=± 1. Non-zero components of the inverse metric are given by g^vv=0, g^vr=ϵ, g^rr=f, g^AB=r^-2γ^AB, where γ^AB is the inverse of γ_AB. For a given ϵ, we consider a spacetime described by the metric (<ref>) with M=M_+(M_-) defined in the domain v≥(≤) v_0 as M_+( M_-), where v_0 is a constant. We glue them at a null hypersurface Σ defined by v=v_0 and the resulting spacetime describes a lightlike impulse in the Schwarzschild spacetime as shown in Fig. <ref>. We will derive the equivalent inequalities to the standard energy conditions on Σ. The null vector k^μ=-g^μν∇_ν v tangent to the null generators of Σ is given by k^μ∂/∂ x^μ=-ϵ∂/∂ r, which satisfies k_μ k^μ=0 and k^ν∇_ν k^μ=0. Hence, k^μ is parametrized by an affine parameter λ. By k^r= r/λ=-ϵ, we identify -ϵ r with λ. Since z^A are constant along the generators, we install coordinates y^a=(λ,θ^A) on Σ such that λ=-ϵ r and θ^A=z^A. Now the parametric equations x^μ=x^μ(λ,θ^A) describing Σ are v=v_0, r=-ϵλ, and z^A=θ^A, where θ^A label the generators of Σ. e^μ_a := ∂ x^μ/∂ y^a are given by e^μ_λ∂/∂ x^μ=k^μ∂/∂ x^μ, e^μ_A∂/∂ x^μ=∂/∂ z^A. By Eq. (<ref>), the induced metric on Σ is given by s_Σ^2= σ_ABθ^A θ^B=λ^2γ_AB z^A z^B. Since σ_AB is independent from M_±, the first junction conditions [σ_AB]=0 are satisfied. The transverse null vector N^μ completing the basis is given by N^μ∂/∂ x^μ=∂/∂ v+1/2ϵ f∂/∂ r. The expression N_μ x^μ=-(f/2) v+ϵ r shows N_μ N^μ =0, N_μ e^μ_λ=-1, and N_μ e^μ_A=0. Then, by Eq. (<ref>), nonvanishing components of the transverse curvature of Σ are computed to give C_AB=1/2ϵ rfγ_AB\|_r=-ϵλ. Now we have [C_λλ]=[C_λ A]=0 and [C_AB]= 1/2ϵ r(f_+-f_-)γ_AB\|_r=-ϵλ=-ϵ (M_+-M_-)γ_AB. Then, the Barrabès-Israel junction conditions (<ref>) give p=0, j^A=0, and μ=2ϵ(M_+-M_-)/κ_4λ^2. As p=0 and J=0 are satisfied, t^μν on Σ is of the Hawking-Ellis type II and all the standard energy conditions are satisfied (violated) for ϵ(M_+-M_-)≥(<) 0 by Proposition <ref>. §.§.§ Accretion of a slowly-rotating null shell As the third application, we consider a situation that a slowly-rotating null shell is collapsing in the Schwarzschild spacetime with its mass M-m. This system has been studied in <cit.>. The past (or interior) spacetime M_- of the shell is described by the Schwarzschild spacetime metric s_-^2=-F(r)t̅^2+F(r)^-1 r^2+r^2(θ^2+sin^2θφ^2), F(r):=1-2(M-m)/r in the coordinates x_-^μ=(t̅,r,θ,φ), where M and m are constant. The future (or exterior) spacetime M_+ is described by the slowly rotating Kerr metric: s_+^2=-f(r)t^2+f(r)^-1 r^2+r^2(θ^2+sin^2θϕ^2)-4Ma/rsin^2θ tϕ, f(r):=1-2M/r in the coordinates x_+^μ=(t,r,θ,ϕ), where a is a rotation parameter. Non-zero components of the inverse metric on M_+ are g^tt=-r^4/r^4f+4M^2a^2sin^2θ, g^tϕ=-2Mar/r^4f+4M^2a^2sin^2θ, g^rr=f, g^θθ=r^-2, g^ϕϕ=r^2f/sin^2θ(r^4f+4M^2a^2sin^2θ). The metric (<ref>) is a solution to the vacuum Einstein equations in the slow-rotation approximation, in which we consider up to the linear order of a. We will show that, due to the ambiguity to define a null vector, one cannot obtain a definite conclusion on the Hawking-Ellis type of the shell and the energy conditions for the null shell in this approximation. On M_+, we define v=v(t,r) and r_=r_(r) by v:=t+r_, r_:=r+2Mln\|r/2M-1\|(=∫ f(r)^-1 r) and let Σ be a hypersurface described by v=v_0=constant. A vector k^μ=-g^μν∇_ν v is given by k^μ∂/∂ x^μ= -g^tt∂/∂ t-∂/∂ r-g^tϕ∂/∂ϕ ≃ f^-1∂/∂ t-∂/∂ r+2Ma/r^3f∂/∂ϕ, which satisfies k_μ k^μ= 4M^2a^2sin^2θ/f(r^4f+4M^2a^2sin^2θ)≃ 0, k^ν∇_ν k^μ∂/∂ x^μ= -4M^2a^2sin^2θ[2r^3f^2+f'(r^4f+2M^2a^2sin^2θ)]/f(r^4f+4M^2a^2sin^2θ)^2∂/∂ r +4M^2a^2r^2sinθcosθ/(r^4f+4M^2a^2sin^2θ)^2∂/∂θ≃ 0. Hence, k^μ is null and affinely parametrized in the slow-rotation approximation. In this approximation, Σ is a null hypersurface and k^μ is tangent to the null generators of Σ. By k^r=-1 and k^θ=0, the generators are affinely parametrized by λ=-r and θ is constant on each generator. On M_+, we also define ψ=ψ(r,ϕ) by ψ:=ϕ+a/r(1+r/2Mln f). Along generators of Σ, we have ϕ/ r=k^ϕ/k^r≃-2Ma/r^3f, which is integrated to give ϕ-ϕ_0≃-a/r(1+r/2Mln f), where ϕ_0 is an integration constant. Therefore, ψ defined by Eq. (<ref>) is constant on the generators of Σ in the slow-rotation approximation. Thus, we install coordinates y^a=(λ,θ^A) on Σ, where θ^A=(θ,ψ). Now the parametric equations x^μ=x^μ(λ,θ^A) describing Σ as seen from M_+ are t=-r_(-λ)+v_0, r=-λ, θ=θ, ϕ=ψ+a/λ(1-λ/2Mln f(-λ)). Then, e^μ_a := ∂ x^μ/∂ y^a are given by e^μ_λ∂/∂ x^μ=k^μ∂/∂ x^μ, e^μ_θ∂/∂ x^μ=∂/∂θ, e^μ_ψ∂/∂ x^μ=∂/∂ϕ, which satisfy k_μ k^μ≃ 0 and k_μ e^μ_A=0. By Eq. (<ref>), the induced metric on Σ is given by s_Σ^2=σ_ABθ^A θ^B=λ^2(θ^2+sin^2θψ^2). The transverse vector N^μ completing the basis in the slow-rotation approximation is given by N_μ x^μ=1/2(-f t+ r), which satisfy N_μ k^μ=-1, N_μ e^μ_A=0, and N_μ N^μ=fM^2a^2sin^2θ/r^4f+4M^2a^2sin^2θ≃ 0. From Eq. (<ref>), the transverse curvature of Σ is computed to give C^+_λλ= 4M^2a^2sin^2θ[3r^3f^2+f'(r^4f+M^2a^2sin^2θ)]/f(r^4f+4M^2a^2sin^2θ)^2\|_r=-λ≃ 0, C^+_λθ= 2M^2a^2r^4f sinθcosθ/(r^4f+4M^2a^2sin^2θ)^2\|_r=-λ≃ 0, C^+_λψ= 3Mar^2fsin^2θ/r^4f+4M^2a^2sin^2θ\|_r=-λ≃3Masin^2θ/r^2\|_r=-λ, C^+_θθ= 1/2rf\|_r=-λ, C^+_ψψ=1/2rfsin^2θ\|_r=-λ. We can obtain the results on M_- by replacing such that M→ M-m, a→ 0, and (t,ϕ)→ (t̅,φ). Thus, as seen from M_-, we have s_Σ-^2=σ_ABθ^Aθ^B and C^-_λλ= 0, C^-_λθ=0, C^-_λψ=0, C^-_AB=F/2rσ_AB\|_r=-λ, where σ_AB is given by Eq. (<ref>), so that the first junction conditions [σ_AB]=0 are satisfied. Then, using the Barrabès-Israel junction conditions (<ref>) and [C_λλ]= [C_λθ]=0, [C_λψ]=3Masin^2θ/r^2\|_r=-λ, [C_AB]=-m/r^2σ_AB\|_r=-λ, we obtain μ= 2m/κ_4λ^2, j^θ=0, j^ψ=3Ma/κ_4λ^4, p=0. Since we have p=0 and J 0, the energy-momentum tensor t_μν on the shell Σ is of the Hawking-Ellis type III and violates all the standard energy conditions by Proposition <ref>. However, this conclusion under the slow-rotation approximation cannot be definite as shown below. Now t_μν on the shell Σ is given by t^μν= (-k_ηu^η)^-1[μ k^μ k^ν+j^ψ(k^μ e^ν_ψ+e^μ_ψ k^ν)]. This t^μν can be written in the slow-rotation approximation as t^μν= (-k_ηu^η)^-1μℓ^μℓ^ν, ℓ^μ:= k^μ+j^ψ/μ e^μ_ψ, where components of ℓ^μ in the coordinates (t,r,θ,ϕ) are given by ℓ^μ≃(f^-1,-1,0,2Ma/r^3f+3Ma/2mr^2)\|_r=-λ. Since ℓ_μℓ^μ≃ 0 is satisfied, ℓ^μ is null in the slow-rotation approximation. As a consequence, t^μν in the form of Eq. (<ref>) is of the Hawking-Ellis type II and all the standard energy conditions are satisfied (violated) for μ≥ (<)0 by Proposition <ref> in spite that t^μν in the form of Eq. (<ref>) is of type III and all the standard energy conditions are inevitably violated. Hence, due to the ambiguity to define a null vector, one cannot obtain a definite conclusion on the Hawking-Ellis type of t_μν and the energy conditions on Σ. To avoid this problem, higher-order effects of the rotation parameter a must be taken into account. We will see in the next subsection how the result in the full-order analysis is different from the one in the slow-rotation approximation. §.§ Cylindrically symmetric rotating null shell As the fourth application, we consider a rotating cylindrically symmetric null shell collapsing in the Minkowski spacetime. The past (or interior) spacetime M_- of the shell is described by the Minkowski metric s_-^2=- t^2+ρ^2+ρ^2φ^2+ z^2 in the cylindrical coordinates x_-^μ=(t,ρ,φ,z). The future (or exterior) spacetime M_+ of the shell is described by the following locally flat metric s_+^2=-( T+mΦ)^2+ C^2 r^2+r^2Φ^2+ z^2 in the coordinates x_+^μ=(T,r,Φ,z), where C(>0) and m are constants. Non-vanishing components of the inverse metric on M_+ are g^TT=-r^2-m^2/r^2, g^Tψ=-m/r^2, g^rr= C^-2, g^ΦΦ=r^-2, g^zz=1. Non-vanishing components of the Levi-Civitá connection on M_+ are Γ^T_rΦ=-m/r, Γ^Φ_rΦ=1/r, Γ^r_ΦΦ=-r/ C^2. The exterior metric (<ref>) describes a spinning cosmic string <cit.> and admits a closed timelike curve in the region r<\|m\| where v^μ(∂/∂ x^μ)=∂/∂Φ is timelike. The dynamics of a massive thin-shell Σ as a matching hypersurface between M_- and M_+ has been investigated for timelike Σ in <cit.> and for null Σ in <cit.>. Here we follow the argument in <cit.> in more detail. In order to identify the description of the null shell Σ, we first study the most general affinely parametrized ingoing null geodesic γ described by x_+^μ=x_+^μ(λ) with an affine parameter λ in the exterior spacetime M_+, of which tangent vector is given by k^μ(= x_+^μ/λ). Since the exterior spacetime (<ref>) admits the following Killing vectors ξ_1^μ∂/∂ x^μ=∂/∂ T, ξ_2^μ∂/∂ x^μ=∂/∂Φ, ξ_3^μ∂/∂ x^μ=∂/∂ z, there are three conserved quantities E:=-k_μξ_1^μ, K:=k_μξ_2^μ, and V_z:=k_μξ_3^μ along γ, which give k^T=E(r^2-m^2) - mK/r^2, k^Φ=mE + K/r^2, k^z=V_z. We assume E>0 so that γ is future directed in a far region r→∞. Then, the null condition s_+^2=0 along γ with Eq. (<ref>) gives the following master equation for r(λ): ( r/λ)^2=(E^2-V_z^2)(r^2-b^2)/ C^2r^2 → k^r= r/λ=-√((E^2-V_z^2)(r^2-b^2))/ Cr, where the minus sign is taken for ingoing γ and b is defined by b:=K+mE/√(E^2-V_z^2) for E^2 V_z^2. The master equation (<ref>) requires E^2-V_z^2≥ 0 and shows that r=\|b\| is the turning radius. The general solution of the master equation for E^2 V_z^2 is given by λ-λ_0=- C√(r^2-b^2/E^2-V_z^2) → r(λ)^2=E^2-V_z^2/ C^2(λ-λ_0)^2+b^2, where λ_0 is an integration constant and λ=λ_0 corresponds to the turning radius r=b. The null geodesic γ enters the region with closed timelike curves for \|b\|< \|m\|, or equivalently \|K+mE\|< \|m\|√(E^2-V_z^2). Using Eqs. (<ref>) and (<ref>), we obtain T/ r=- C(Er^2-mb√(E^2-V_z^2))/r√((E^2-V_z^2)(r^2-b^2)), Φ/ r=-b C/r√(r^2-b^2), z/ r=-V_z Cr/√((E^2-V_z^2)(r^2-b^2)) along γ. We define three functions as v(T,r):=T+r_(r), ψ(Φ,r):=Φ+r_Φ(r), Z(z,r):=z+r_z(r), where r_(r):=∫ C(Er^2-mb√(E^2-V_z^2))/r√((E^2-V_z^2)(r^2-b^2)) r, r_Φ(r):=∫b C/r√(r^2-b^2) r, r_z(r):=∫V_z Cr/√((E^2-V_z^2)(r^2-b^2)) r, and then v, ψ, and Z are constant along γ by Eqs. (<ref>)–(<ref>). By coordinate transformations T=v-r_(r), Φ=ψ-r_Φ(r), and z=Z-r_z(r), the exterior metric (<ref>) becomes s_+^2= - v( v-2 CEr/√((E^2-V_z^2)(r^2-b^2)) r+2mψ) -2 CKr/√((E^2-V_z^2)(r^2-b^2)) rψ-2V_z Cr/√((E^2-V_z^2)(r^2-b^2)) r Z +(r^2-m^2)ψ^2+ Z^2 in the coordinates (v,r,ψ,Z). Now we consider a hypersurface given by v=v_0=constant. Its normal vector l_μ x^μ=-(∇_μ v) x^μ=- v satisfies l_μ l^μ=g^vv=-V_z^2(r^2-m^2) + K^2/(K+mE)^2 - (E^2-V_z^2)r^2 and therefore v=v_0 is a null hypersurface for K=V_z=0. Hence, we identify k^μ with K=0 and V_z=0 (and then b=m and Z=z) as the tangent vector to the generators of the null shell Σ described by v=v_0. Then, the exterior metric (<ref>) and k^μ are given in the coordinates (v,r,ψ,z) as s_+^2=- v( v-2 Cr/√(r^2-m^2) r+2mψ)+(r^2-m^2)ψ^2+ z^2, k^μ∂/∂ x^μ=-E√(r^2-m^2)/ Cr∂/∂ r. Since ψ and z(=Z) are constant along the generators, we shall install intrinsic coordinates y^a=(λ,θ^A) on Σ as θ^A≡ (ψ,z), where λ=λ(r) is given by Eq. (<ref>) with V_z=0 and b=m. Then, e^μ_a:= x^μ/ y^a are given by e^μ_λ∂/∂ x^μ=k^μ∂/∂ x^μ, e^μ_ψ∂/∂ x^μ=∂/∂ψ, e^μ_z∂/∂ x^μ=∂/∂ z, which satisfy k_μ k^μ=0 and k_μ e^μ_A=0. The induced metric on Σ is given by s_Σ+^2=σ_AB^+θ^Aθ^B= (r^2-m^2)\|_Σψ^2+ z^2=E^2/ C^2(λ-λ_0)^2ψ^2+ z^2. The transverse null vector completing the basis is given by N_μ x^μ=-r^2/2E(r^2-m^2) v+ Cr/E√(r^2-m^2) r, which satisfies N_μ N^μ=0, N_μ k^μ=-1, and N_μ e^μ_A=0. Then, from Eq. (<ref>), non-vanishing components of the transverse curvature of Σ are computed to give C^+_λψ= C^+_ψλ=m/ C√(r^2-m^2)\|_Σ=-m/E(λ-λ_0), C^+_ψψ= r^2/2E C√(r^2-m^2)\|_Σ=-1/2E^2(λ-λ_0){E^2/ C^2(λ-λ_0)^2+m^2}. By setting m=0 and C=1 and replacing (T,r,Φ) by (t,ρ,φ), we can obtain the results on M_- described by the flat metric (<ref>). Equation (<ref>) with V_z=0 and b=0 gives ρ=-E̅(λ-λ_0), where we have used the same λ and λ_0 as those in M_+ without loss of generality by an affine transformation λ→ aλ+b. E̅ is a constant related to the conserved quantity along a null generator of Σ associated with the Killing vector ξ^μ(∂/∂ x^μ)=∂/∂ t. As seen from M_-, λ=λ_0 corresponds to the axis of symmetry ρ=0. From Eqs. (<ref>), we obtain the induced metric on Σ as s_Σ-^2=σ^-_ABθ^Aθ^B= ρ^2\|_Σψ^2+ z^2=E̅^2(λ-λ_0)^2ψ^2+ z^2. From Eq. (<ref>), we obtain the transverse curvature of Σ as C^-_λψ=C^-_ψλ=0, C^-_ψψ=ρ/2E̅\|_Σ=-1/2(λ-λ_0). By the first junction conditions [σ_AB]=0, we obtain E̅=E/ C. Then, using the Barrabès-Israel junction conditions (<ref>) and [C_λλ]=0, [C_λψ]=[C_ψλ]=-m/E(λ-λ_0), [C_ψψ]=-1/2E^2(λ-λ_0){E^2(1- C^2)/ C^2(λ-λ_0)^2+m^2}, we obtain μ= E^2(1- C^2)(λ-λ_0)^2+m^2 C^2/2κ_4E^4(λ-λ_0)^3, j^ψ=-m C^2/κ_4E^3(λ-λ_0)^3, j^z=0, p=0. Using λ-λ_0=- C√(r^2-m^2)/E from Eq. (<ref>), we can write those quantities in terms of r as μ= ( C^2-1)r^2- C^2m^2/2κ_4E C(r^2-m^2)^3/2\|_Σ, j^ψ=m/κ_4 C(r^2-m^2)^3/2\|_Σ, j^z=0, p=0. This result is consistent with the one in <cit.>, in which E̅=1 is assumed. Since we have p=0 and J 0, the induced energy-momentum tensor t_μν on the null shell is of the Hawking-Ellis type III and violates all the standard energy conditions by Proposition <ref>. Our result is conclusive because we have not used any approximation. t_μν on the shell is now given by t^μν= (-k_ηu^η)^-1[μ k^μ k^ν+j^ψ(k^μ e^ν_ψ+e^μ_ψ k^ν)]. For our interest, let us see what happens in the slow-rotation approximation up to the linear order of m/r. In this approximation, Eq. (<ref>) can be written as t^μν≃ (-k_ηu^η)^-1μℓ^μℓ^ν, ℓ^μ:=k^μ+j^ψ/μ e^μ_ψ. The components of ℓ^μ in the coordinates (v,r,ψ,z) are ℓ^μ∂/∂ x^μ= -E√(r^2-m^2)/ Cr∂/∂ r+2mE/( C^2-1)r^2- C^2m^2∂/∂ψ and its squared norm is given by ℓ_μℓ^μ=4m^2E^2(r^2-m^2)/[( C^2-1)r^2- C^2m^2]^2≃ 0. Since ℓ^μ is null in the slow-rotation approximation, one could misunderstand from Eq. (<ref>) that t^μν is of the Hawking-Ellis type II and all the standard energy conditions are satisfied (violated) for μ≥ (<)0. Of course, it is a wrong conclusion caused by the approximation. §.§ Cosmological phase transition As the last application, this subsection considers a sudden transition of the universe from the anisotropic Bianchi I expansion to the isotropic flat Friedmann-Lemaître-Robertson-Walker (FLRW) expansion. We consider the past spacetime M_- described by the following Bianchi-I metric s_-^2=-t^2+a(t)^2( x^2+ y^2)+ z_-^2 in the coordinates x_-^μ=(t,x,y,z_-) and the future spacetime M_+ described by the flat FLRW metric s_+^2=-t^2+a(t)^2( x^2+ y^2+ z_+^2) in the coordinates x_+^μ=(t,x,y,z_+) with the same scale factor a(t). We assume that the scale factor a(t) is the same both in M_- and M_+ as a solution to the Einstein equations G_μν+Λ g_μν=κ_4 T_μν. As the Einstein tensor in M_- and M_+ are given by G^μ_ν\|_-=(-ȧ^2/a^2,-ä/a,-ä/a,-ȧ^2+2aä/a^2), G^μ_ν\|_+=(-3ȧ^2/a^2,-ȧ^2+2aä/a^2,-ȧ^2+2aä/a^2,-ȧ^2+2aä/a^2), the matter fields in M_- and M_+ are different. In <cit.>, the author assumed a(t)=(t/t_0)^1/2 and Λ=0, where t_0 is a constant. Then, we have G^μ_ν\|_-=(-1/4t^2,1/4t^2,1/4t^2,1/4t^2), G^μ_ν\|_+=(-3/4t^2,1/4t^2,1/4t^2,1/4t^2). In this case, a matter field in M_- may be a stiff fluid, namely a perfect fluid obeying an equation of state p=ρ, while a matter field in M_+ may be a radiation fluid, namely a perfect fluid obeying an equation of state p=ρ/3. Hereafter we keep a(t) arbitrary. §.§.§ Transition at spacelike Σ First, we consider the case where the transition occurs at a spacelike hypersurface Σ given by t=t_0=constant both on M_- and M_+ and then the first junction conditions require a(t_0)^2=1. The induced metric on Σ is given by s_Σ^2=h_ab y^a y^b= x^2+ y^2+ z^2, where we have installed intrinsic coordinates y^a=(x,y,z) on Σ and the parametric equations x^μ=x^μ(y^a) describing Σ are given by t=t_0, x=x, y=y, z_-=z M_-, t=t_0, x=x, y=y, z_+=z M_+. The unit normal vector n^μ to Σ is given by n^μ∂/∂ x^μ=∂/∂ t both on M_- and M_+. Note that the timelike vector n^μ points in an increasing direction of t, which is consistent with the assumption in Sec. <ref> that n^μ points from M_- to M_+. Using e^μ_a=δ^μ_a in Eq. (<ref>), we obtain K_ab= Γ^0_ab and therefore non-zero components of K_ab on M_- and M_+ are given by K^-_xx=K^-_yy=aȧ\|_t=t_0, K^+_xx=K^+_yy=K^+_zz=aȧ\|_t=t_0, which give K^-=K^-_abh^ab=2ȧ/a\|_t=t_0, K^+=K^+_abh^ab=3ȧ/a\|_t=t_0. Thus, [K_ab] admits only a single non-zero component [K_zz]=aȧ\|_t=t_0. From the Israel junction conditions (<ref>) with ε=-1 and [K]=ȧ/a\|_t=t_0, we obtain non-zero components of t_ab as κ_4t_xx=κ_4t_yy=-aȧ\|_t=t_0. Since eigenvalues of t_abv^b=λ h_abv^b are given by λ={0,-ȧ/(κ_4a)\|_t=t_0}, the DEC is violated and the NEC, WEC, and SEC are satisfied (violated) for ȧ≤ (>)0 by Proposition <ref>. §.§.§ Transition at null Σ Next, we consider the case where the transition occurs at a null hypersurface Σ. The system with a(t)=(t/t_0)^1/2 and Λ=0 has been studied in <cit.> as a simplified version of the example in <cit.>, however, it contains an error that changes the conclusion. As seen from M_-, we describe the transition null hypersurface Σ by t-z_-=constant. The null vector k^μ=-g^μν∇_ν (t-z_-) is computed to give k^μ∂/∂ x^μ=∂/∂ t+∂/∂ z_-, which satisfies k^ν∇_ν k^μ=0. Hence, k^μ is tangent to the null generators of Σ which are parametrized by an affine parameter λ. By k^t=1, t is an affine parameter on this side of Σ. Since x and y are constant on the generators, we install intrinsic coordinates y^a=(λ,θ^A) on Σ as λ=t and θ^A=(x,y), and then e^μ_a:=∂ x^μ/∂ y^a are given by e^μ_λ=k^μ, e^μ_A=δ^μ_A, which satisfies k_μ e^μ_A=0 and g_μνe^μ_A e^μ_B=a^2δ_AB. From Eq. (<ref>), we obtain the induced metric on Σ as s_Σ-^2=σ_AB^-θ^Aθ^B=a(λ)^2( x^2+ y^2). The transverse null vector completing the basis is given by N_μ x^μ=-1/2( t+ z_-), which satisfies N_μ N^μ=0, N_μ k^μ=-1, and N_μ e^μ_A=0. From Eq. (<ref>), non-vanishing components of the transverse curvature of Σ are computed to give C^-_AB=ȧ/2aσ_AB^-\|_t=λ, where a dot denotes differentiation with respect to t. As seen from M_+, we describe Σ by ∫ a^-1 t-z_+=constant, which is obtained by integrating t=a(t) z_+. The null vector k^μ=-g^μν∇_ν (∫ a^-1 t-z_+) tangent to the null generators of Σ is given by[In <cit.>, k^μ is erroneously identified as k^μ∂/∂ x^μ=∂/∂ t+a^-1∂/∂ z_+, which affects the following argument.] k^μ∂/∂ x^μ=a^-1∂/∂ t+a^-2∂/∂ z_+, which satisfies k^ν∇_ν k^μ=0. Hence, the null generators of Σ are parametrized by an affine parameter λ also on this side of Σ. However, t is not an affine parameter on this side and k^t= t/λ=a(t)^-1 is integrated to give λ=∫ a t. We write the inverse function of λ=∫ a t as t=t_+(λ). Since x and y are constant on the generators, we install intrinsic coordinates y^a=(λ,θ^A) on Σ as λ=∫ a t and θ^A=(x,y), and then e^μ_a:=∂ x^μ/∂ y^a are given by e^μ_λ=k^μ, e^μ_A=δ^μ_A, which satisfies k_μ e^μ_A=0 and g_μνe^μ_A e^μ_B=a^2δ_AB. From Eq. (<ref>), we obtain the induced metric on Σ as s_Σ+^2=σ_AB^+θ^Aθ^B=a(t)^2\|_t=t_+(λ)( x^2+ y^2). Since the coordinate t is the same on M_- and M_+, the first junction conditions [σ_AB]=0 are satisfied. The transverse vector completing the basis is N_μ x^μ=-1/2(a t+a^2 z_+), which satisfies N_μ N^μ=0, N_μ k^μ=-1, and N_μ e^μ_A=0. From Eq. (<ref>), non-vanishing components of the transverse curvature of Σ are computed to give C^+_AB=1/2ȧσ_AB^+\|_t=t_+(λ). The jump of the transverse curvature at Σ is obtained in terms of t as [C_λλ]=[C_λ B]=0, [C_AB]=1/2(ȧ\|_t=t_+(λ)-ȧ/a\|_t=λ)σ_AB=ȧ/2(1-1/a)σ_AB, where σ_AB≡σ_AB^+(=σ_AB^-). Then, the Barrabès-Israel junction conditions (<ref>) give κ_4μ= -ȧ(1-1/a), j^A=0, p=0. As we have μ 0, p=J=0, the induced energy-momentum tensor t_μν on the null shell is of the Hawking-Ellis type II and all the standard energy conditions are satisfied (violated) for ȧ(1-a^-1)≤ (>)0 by Proposition <ref>. Thus, in the expanding universe with ȧ>0, such a phase transition of the cosmic expansion at null Σ is possible without violating any of the standard energy conditions if it occurs in the early stages of the universe where a≤ 1 holds. § ACKNOWLEDGMENTS The author is very grateful to Max-Plank-Institut für Gravitationsphysik (Albert-Einstein-Institut) for hospitality and support, where a large part of this work was carried out. 99 Israel:1966rt W. Israel, Nuovo Cim. B 44S10, 1 (1966) [Nuovo Cim. B 44, 1 (1966)] Erratum: [Nuovo Cim. B 48, 463 (1967)]. Barrabes:1991ng C. Barrabès and W. Israel, Phys. Rev. D 43, 1129 (1991). Poisson:2002nv E. Poisson, “A Reformulation of the Barrabès-Israel null shell formalism,” [arXiv:gr-qc/0207101 [gr-qc]]. Poisson E. Poisson, A Relativist's Toolkit (Cambridge University Press, Cambridge, UK, 2004). Hajicek:1992pu P. Hajicek, B. S. Kay and K. V. Kuchar, Phys. Rev. D 46 (1992), 5439-5448 doi:10.1103/PhysRevD.46.5439 Echeverria:1993wf F. Echeverria, Phys. Rev. D 47 (1993), 2271-2282 doi:10.1103/PhysRevD.47.2271 Crisostomo:2003xz J. Crisostomo and R. Olea, Phys. Rev. D 69 (2004), 104023 doi:10.1103/PhysRevD.69.104023 [arXiv:hep-th/0311054 [hep-th]]. Cardoso:2016wcr V. Cardoso and J. V. Rocha, Phys. Rev. D 93 (2016) no.8, 084034 doi:10.1103/PhysRevD.93.084034 [arXiv:1601.07552 [gr-qc]]. Sakai:1993vn N. Sakai, K. i. Maeda and H. Sato, Prog. Theor. Phys. 89 (1993), 1193-1202 doi:10.1143/PTP.89.1193 Maeda:2011yq K. i. Maeda, N. Sakai and R. Triay, JCAP 08 (2011), 026 doi:10.1088/1475-7516/2011/08/026 [arXiv:1103.2007 [astro-ph.CO]]. Sakai:1999xx N. Sakai and P. Haines, Astrophys. J. 536 (2000), 515 doi:10.1086/308965 [arXiv:astro-ph/9909183 [astro-ph]]. Berezin:1982ur V. A. Berezin, V. A. Kuzmin and I. I. Tkachev, Phys. Lett. B 120 (1983), 91-96 doi:10.1016/0370-2693(83)90630-5 Berezin:1987bc V. A. Berezin, V. A. Kuzmin and I. I. Tkachev, Phys. Rev. D 36 (1987), 2919 doi:10.1103/PhysRevD.36.2919 Blau:1986cw S. K. Blau, E. I. Guendelman and A. H. Guth, Phys. Rev. D 35 (1987), 1747 doi:10.1103/PhysRevD.35.1747 Sato:1981bf K. Sato, M. Sasaki, H. Kodama and K. i. Maeda, Prog. Theor. Phys. 65 (1981), 1443 doi:10.1143/PTP.65.1443 Maeda:1981gw K. i. Maeda, K. Sato, M. Sasaki and H. Kodama, Phys. Lett. B 108 (1982), 98-102 doi:10.1016/0370-2693(82)91151-0 Sato:1981gv K. Sato, H. Kodama, M. Sasaki and K. i. Maeda, Phys. Lett. B 108 (1982), 103-107 doi:10.1016/0370-2693(82)91152-2 Kodama:1981gu H. Kodama, M. Sasaki, K. Sato and K. i. Maeda, Prog. Theor. Phys. 66 (1981), 2052 doi:10.1143/PTP.66.2052 Randall:1999ee L. Randall and R. Sundrum, Phys. Rev. Lett. 83 (1999), 3370-3373 doi:10.1103/PhysRevLett.83.3370 [arXiv:hep-ph/9905221 [hep-ph]]. Randall:1999vf L. Randall and R. Sundrum, Phys. Rev. Lett. 83 (1999), 4690-4693 doi:10.1103/PhysRevLett.83.4690 [arXiv:hep-th/9906064 [hep-th]]. Shiromizu:1999wj T. Shiromizu, K. i. Maeda and M. Sasaki, Phys. Rev. D 62 (2000), 024012 doi:10.1103/PhysRevD.62.024012 [arXiv:gr-qc/9910076 [gr-qc]]. Kraus:1999it P. Kraus, JHEP 12 (1999), 011 doi:10.1088/1126-6708/1999/12/011 [arXiv:hep-th/9910149 [hep-th]]. Ida:1999ui D. Ida, JHEP 09 (2000), 014 doi:10.1088/1126-6708/2000/09/014 [arXiv:gr-qc/9912002 [gr-qc]]. Ori:1991zz A. Ori, Phys. Rev. Lett. 67 (1991), 789-792 doi:10.1103/PhysRevLett.67.789 Sakai:1992ud N. Sakai and K. i. Maeda, Prog. Theor. Phys. 90 (1993), 1001-1018 doi:10.1143/PTP.90.1001 Barcelo:2000js C. Barceló and M. Visser, Phys. Rev. D 63 (2001), 024004 doi:10.1103/PhysRevD.63.024004 [arXiv:gr-qc/0008008 [gr-qc]]. Padilla:2012ze A. Padilla and V. Sivanesan, JHEP 08 (2012), 122 doi:10.1007/JHEP08(2012)122 [arXiv:1206.1258 [gr-qc]]. Aviles:2019xae L. Avilés, H. Maeda and C. Martínez, Class. Quant. Grav. 37 (2020) no.7, 075022 doi:10.1088/1361-6382/ab728a [arXiv:1910.07534 [gr-qc]]. Davis:2002gn S. C. Davis, Phys. Rev. D 67 (2003), 024030 doi:10.1103/PhysRevD.67.024030 [arXiv:hep-th/0208205 [hep-th]]. Gravanis:2002wy E. Gravanis and S. Willison, Phys. Lett. B 562 (2003), 118-126 doi:10.1016/S0370-2693(03)00555-0 [arXiv:hep-th/0209076 [hep-th]]. j-conditions M. Mars and J.M.M. Senovilla, Class. Quant. Grav. 10, 1865 (1993); J.M.M. Senovilla, Phys. Rev. D 88, 064015 (2013); J.M.M. Senovilla, Class. Quant. Grav. 31, 072002 (2014); B. Reina, J.M.M. Senovilla, R. Vera, Class. Quant. Grav. 33, 105008 (2016); J.M.M. Senovilla, JHEP 1811, 134 (2018). Hawking:1973uf S. W. Hawking and G. F. R. Ellis, The Large Scale Structure of Space-Time (Cambridge University Press, Cambridge, UK, 1973). Maeda:2018hqu H. Maeda and C. Martinez, PTEP 2020 (2020) no.4, 043E02 doi:10.1093/ptep/ptaa009 [arXiv:1810.02487 [gr-qc]]. Curiel:2014zba E. Curiel, Einstein Stud. 13 (2017), 43-104 doi:10.1007/978-1-4939-3210-8_3 [arXiv:1405.0403 [physics.hist-ph]]. Santos:1994cs J. Santos, M. J. Rebouças and A. F. F. Teixeira, J. Math. Phys. 36, 3074 (1995). srt1995 J. Santos, M. J. Rebouças and A. F. F. Teixeira, Gen. Rel. Grav. 27, 989 (1995). hrst1996 G. S. Hall, M. J. Rebouças, J. Santos and A. F. F. Teixeira, Gen. Rel. Grav. 28, 1107 (1996). rst2004 M. J. Rebouças, J. Santos and A. F. F. Teixeira, Braz. J. Phys. 34, 535 (2004). Martin-Moruno:2017exc P. Martín-Moruno and M. Visser, Fundam. Theor. Phys. 189 (2017), 193-213 doi:10.1007/978-3-319-55182-1_9 [arXiv:1702.05915 [gr-qc]]. Maeda:2022vld H. Maeda and T. Harada, Class. Quant. Grav. 39 (2022) no.19, 195002 doi:10.1088/1361-6382/ac8861 [arXiv:2205.12993 [gr-qc]]. Marolf:2005sr D. Marolf and S. Yaida, Phys. Rev. D 72, 044016 (2005) doi:10.1103/PhysRevD.72.044016 [arXiv:gr-qc/0505048 [gr-qc]]. Simpson:2018tsi A. Simpson and M. Visser, JCAP 02 (2019), 042 doi:10.1088/1475-7516/2019/02/042 [arXiv:1812.07114 [gr-qc]]. Deser:1983tn S. Deser, R. Jackiw and G. 't Hooft, Annals Phys. 152 (1984), 220 doi:10.1016/0003-4916(84)90085-X Jensen:1992wj B. Jensen and H. H. Soleng, Phys. Rev. D 45 (1992), 3528-3533 doi:10.1103/PhysRevD.45.3528 Mena:2007dy F. C. Mena, J. Natario and P. Tod, Class. Quant. Grav. 25 (2008), 045016 doi:10.1088/0264-9381/25/4/045016 [arXiv:0710.4696 [gr-qc]]. Khakshournia:2011cj S. Khakshournia, Int. J. Mod. Phys. Conf. Ser. 03 (2011), 428-433 doi:10.1142/S2010194511000948 [arXiv:1108.0564 [gr-qc]]. Barrabes:1998rp C. Barrabès and P. A. Hogan, Phys. Rev. D 58 (1998), 044013 doi:10.1103/PhysRevD.58.044013 [arXiv:gr-qc/9806025 [gr-qc]].
http://arxiv.org/abs/2306.03842v1	20230606162931	Remarks on Utility in Repeated Bets	[ "Nimrod Megiddo" ]	cs.AI	[ "cs.AI", "math.PR" ]	=480pt =0pt 6pt corollaryCorollary definitionDefinition factFact exampleExample lemmaLemma propositionProposition remarkRemark theoremTheorem =0pt #1 1## ###1
http://arxiv.org/abs/2306.17814v1	20230630172400	On Numerical Methods for Stochastic SINDy	[ "Mathias Wanner", "Igor Mezić" ]	math.NA	[ "math.NA", "cs.NA", "math.DS", "37H99, 37M15, 60H35, 65C40, 93E12" ]
http://arxiv.org/abs/2306.06036v1	20230609170151	SNeL: A Structured Neuro-Symbolic Language for Entity-Based Multimodal Scene Understanding	[ "Silvan Ferreira", "Allan Martins", "Ivanovitch Silva" ]	cs.AI	[ "cs.AI" ]	Possible high T_c superconductivity in La_3Ni_2O_7 under high pressure through manifestation of a nearly-half-filled bilayer Hubbard model Kazuhiko Kuroki July 31, 2023 ============================================================================================================================================= In the evolving landscape of artificial intelligence, multimodal and Neuro-Symbolic paradigms stand at the forefront, with a particular emphasis on the identification and interaction with entities and their relations across diverse modalities. Addressing the need for complex querying and interaction in this context, we introduce SNeL (Structured Neuro-symbolic Language), a versatile query language designed to facilitate nuanced interactions with neural networks processing multimodal data. SNeL's expressive interface enables the construction of intricate queries, supporting logical and arithmetic operators, comparators, nesting, and more. This allows users to target specific entities, specify their properties, and limit results, thereby efficiently extracting information from a scene. By aligning high-level symbolic reasoning with low-level neural processing, SNeL effectively bridges the Neuro-Symbolic divide. The language's versatility extends to a variety of data types, including images, audio, and text, making it a powerful tool for multimodal scene understanding. Our evaluations demonstrate SNeL's potential to reshape the way we interact with complex neural networks, underscoring its efficacy in driving targeted information extraction and facilitating a deeper understanding of the rich semantics encapsulated in multimodal AI models. § INTRODUCTION The rapidly evolving field of artificial intelligence (AI) has seen a significant shift toward more complex, holistic, and integrated forms of understanding. The rise of multimodal AI, capable of processing and integrating information across various modalities such as images, audio, and text, has unlocked new possibilities for more sophisticated and nuanced system interactions. Concurrently, the Neuro-Symbolic AI paradigm has emerged, combining the power of neural networks with the interpretability of symbolic reasoning, thereby bridging the gap between high-level reasoning and low-level data processing. In the complex and highly semantic field of AI, the ability to recognize and engage with elements and their connections within a context is crucial. Entities, as the basic units of perception and understanding, form the cornerstone of our ability to make sense of complex environments. However, efficiently accessing, manipulating, and querying these entities within neural network models poses a significant challenge. The conventional methods of interaction with these models often lack the necessary granularity and flexibility, failing to fully exploit the rich semantics encapsulated within them. Therefore, there is a compelling need for a refined, more expressive language that can facilitate nuanced interactions with neural networks, particularly those handling multimodal data. Such a language should enable users to construct complex queries, targeting specific entities, specifying their properties, and limiting results, thereby allowing for targeted information extraction and in-depth scene understanding. This forms the primary motivation for our work, paving the way for the development of SNeL - the Structured Neuro-symbolic Language, designed to bring together the strengths of Neuro-Symbolic AI and multimodal deep learning. The general architecture of the proposed language can be seen in Figure <ref>. The proposed system is fundamentally grounded on the ontological concept of entities, which serve as the fundamental units of perception and comprehension across different modalities. This allows for the semantic range to encompass the use of complex queries, with the use of logical and arithmetic operators, comparators, and the capacity for query grouping. Additionally, the entity-centered approach extends to many modalities, including image, video, audio and text, thereby establishing it as a truly multimodal language. This versatility is facilitated by the integration of deep learning models that extract and score entities based on input text queries. These models process the data, identify potential entities, and evaluate their relevance based on the alignment between the query and the identified entities. Our contributions in this paper are anchored in the design and implementation of SNeL, a novel language purpose-built to facilitate nuanced and sophisticated interactions with multimodal neural networks in the context of scene understanding and entity detection. The proposed query language introduces an expressive interface that enables users to employ text prompts to construct complex queries targeting specific entities within a scene across different modalities. By aligning high-level symbolic reasoning with low-level neural processing, SNeL effectively bridges the Neuro-Symbolic divide and presents a novel tool for advanced AI scene understanding. The structure of this paper is organized as follows: In Related Work, we explore existing literature on multimodal and Neuro-Symbolic AI, entity detection, and query languages. This is followed by the Language Design Section, where we detail SNeL's syntax, semantics, support for complex queries and the clauses used to assembly queries. Next, in Language Components, we describe the integration of the proposed language with underlying neural networks. Then, in Use Cases and Examples Section, we provide examples of applications across multiple domains. Finally, the paper concludes with a summary of limitations, potential enhancements, and future research directions. § RELATED WORK The development of the SNeL system can be best understood in the context of substantial prior work across several interrelated fields. This encompasses methodologies for entity detection across multiple domains such as Computer Vision, Natural Language Processing, and Audio Processing, advances in cross-modal alignment and information retrieval and the application of context-free languages (CFL) in Neuro-Symbolic AI. Each of these components has contributed to the formation of SNeL's architecture, which effectively integrates these varying facets. In this Section, we provide an overview of the key contributions and methodologies in these areas that have influenced the design and capabilities of the proposed system. §.§ Entity Detection In the field of Computer Vision, entities can be distinct objects within an image or a video scene. Here, Entity Recognition can be associated with tasks like object detection, where the aim is to identify specific objects within a given image and determine their boundaries <cit.>. Notable work in this domain includes the R-CNN family of models, including the original R-CNN <cit.>, Fast R-CNN <cit.>, and Faster R-CNN <cit.>. These models employ an approach known as Region Proposal Networks (RPNs) to suggest potential object locations, before classifying and refining these locations with a separate network. Another significant advancement in the field is the You Only Look Once (YOLO) algorithm <cit.>. In stark contrast to the region proposal methodology, YOLO uses a single Convolutional Neural Network (CNN) that simultaneously predicts multiple bounding boxes and class probabilities for those boxes. In Natural Language Processing, Text segmentation is a technique that partitions a document into smaller, meaningful units, often termed as "segments". Segments could be delineated based on a variety of factors such as words, sentences, topics, phrases, or any relevant informational units, tailored to the specific requirements of the text analysis task at hand <cit.>. Recent years have seen the emergence of neural approaches for document and discourse segmentation. <cit.> suggested hierarchical Bi-LSTMs for document segmentation, <cit.> introduced an attention-based model for both document and discourse segmentation, and <cit.> achieved state-of-the-art results on discourse segmentation using pretrained contextual embeddings. Each segment obtained through text segmentation can be considered as an independent entity within the SNeL framework. This approach would enable the system to process these entities separately, enhancing the granularity of analysis and improving the system's ability to recognize, align, and interpret these entities in response to specific prompts or queries. In Audio Processing, entities can be conceived as distinct auditory components within an audio stream. This could involve distinct sounds, speech components, or identifiable sound events. The process of Entity Recognition in this domain can include tasks such as sound event detection <cit.>, speech recognition <cit.>, and speaker identification <cit.>. For instance, speaker identification methods aim to recognize an individual entity based on their unique voice characteristics, as explored by <cit.>. Similarly, in the field of sound event detection, algorithms have been developed to recognize entities like particular environmental sounds or musical instruments within an audio clip <cit.>. The recent advances in deep learning have contributed to significant improvements in these tasks, with CNNs, Recurrent Neural Networks (RNNs), and Transformers being commonly employed for feature extraction and temporal modelling. Each recognized entity, whether it be a specific speaker's voice or a distinct sound event, can be processed individually within our proposed framework, thereby increasing the granularity of analysis and improving the system's ability to interpret and interact with these entities. §.§ Cross-Modal Learning Humans integrate multiple sensory modes for information processing, facilitated by complex neural networks. To mimic this, artificial intelligence needs to proficiently fuse multi-modal information. In multi-modal research, data from more than one modality, like images, text, video, and audio, is incorporated. While multi-modal systems query one data mode for any modality output, cross-modal systems strictly retrieve information from a different modality <cit.>. The process of cross-modal alignment and information retrieval is a key aspect in SNeL's architecture, by allowing it to map textual prompts to entities in non-textual modalities. In the field of cross-modal alignment, where the objective is to correlate representations from distinct modalities such as text and images, several notable advancements have been made. ImageBERT <cit.> extends the BERT <cit.> model to jointly learn representations for images and text, enabling effective alignment between these two modalities. In a different approach, OpenAI's CLIP (Contrastive Language-Image Pretraining) <cit.> model aligns images and text in a shared latent space by optimizing the similarity of an image and its corresponding text caption, while minimizing the similarity with other captions. Google's ALIGN model <cit.> employs a dual-encoder architecture, comprising a text encoder and an image encoder that are trained in tandem on a large-scale dataset of text-image pairs. In a similar way, several models for cross-modal alignment between text and audio were proposed. CM-BERT <cit.> extends BERT to audio inputs for sentiment analysis. In a different approach, <cit.> uses metric learning to create joint representations of text and audio for retrieval. §.§ Neuro-Symbolic AI Neuro-Symbolic AI represents a fusion of symbolic and sub-symbolic (neural) methods, aiming to leverage the strengths of both approaches to overcome their respective limitations. Several significant works have emerged in this field, each proposing unique strategies to integrate symbolic reasoning with neural computation. The Neuro-Symbolic Concept-Learner <cit.> is a system that learns visual concepts and semantic parsing of sentences, translating input questions into executable programs and executing them on a latent space representation of the scene. DeepProbLog <cit.>, on the other hand, is a Neural Probabilistic Logic Programming system that extends ProbLog to process neural predicates, effectively combining the power of probabilistic logic programming with the learning capacity of neural networks. Logical Neural Networks <cit.> seek to create a correspondence between neurons and the elements of logical formulas, thereby embedding logical reasoning within the neural computation process. Lastly, Logical Tensor Networks <cit.> propose a formalism on first-order language, where truth-values are interpreted as feature vectors, enabling the system to integrate deductive reasoning with data-driven machine learning. These works collectively provide a rich landscape for the exploration and advancement of Neuro-Symbolic AI systems. The system proposed in this work is a manifestation of Neuro-Symbolic AI, a paradigm that synergistically integrates symbolic reasoning and connectionist learning. The symbolic components are embodied in the application of context-free languages, providing a structured, rule-based framework for decision-making and reasoning. On the other hand, the connectionist components are represented by its neural modules, which draw inspiration from advancements in entity detection across multiple modalities and cross-modal alignment. § LANGUAGE DESIGN This Section provides information about the principles and design of the proposed language, by covering the basic data types, as numbers and Booleans, and operations between them, as the arithmetical or logical operators. Additionally, a central component in SNeL's syntax are the prompts, that can be used to refer to entities in the scene using natural language. All these components can be used to form clauses and retrieve the desired information about the scene. §.§ Data Types and Operators SNeL supports three primary data types: Numbers, Booleans, and Prompts. Each data type can take on certain values and the operations applicable to them vary based on their type. Numbers can be real or integers, booleans can assume the values of true or false and prompts are a key aspect in the language and more details about it will be presented at Section <ref>. Table <ref> summarizes the data types in SNeL along with the possible values they can assume. The set of operations in SNeL encompasses arithmetic, logical, comparison operations, and mathematical functions. Arithmetic operations include addition, subtraction, multiplication, division, modulus, and exponentiation for the number data type, while logical operators like logical AND, OR, NOT, and XOR manipulate boolean and prompt literals. Comparison operators allow assessments of relative value, such as less than, greater than, less than or equal to, and greater than or equal to, as well as equality checks with equal to and not equal to operators. Defined in infix notation with operators used between operands, these operations adhere to a precedence order, where lower precedence values signify higher priority, assuring consistent and deterministic evaluation of complex expressions. In addition to the default operators, SNeL also incorporates a library of mathematical functions, broadening the capacity for expressive queries. This collection encompasses a wide range of functions, including those related to rounding operations, logarithmic computations, exponential calculations, and trigonometric evaluations, among others. These functions are invoked in prefix notation, where the function name precedes its arguments within parentheses. The supported operators, their descriptions, their operant types, and precedence levels are summarized in Table <ref>. Grouping complex expressions using parentheses is a also supported. By employing parentheses, one can establish the desired precedence and grouping of logical and arithmetic operations within their queries. This allows for the creation of complex expressions that combine multiple conditions, attributes, and operators. The use of parentheses enables users to explicitly specify the order in which operations should be evaluated, ensuring the desired outcome and avoiding any ambiguity. §.§ Single Prompts In SNeL, prompts play a pivotal role as they link the abstract language constructs with real-world entities via the underlying neural network models. They can be a simple, single word, or a more complex phrase or sentence that describes or references the scene's entities in natural language. Prompts may specify an entity's attributes, relationships with other entities, or dynamics within the scene. They are represented as a text in natural language between square brackets, e.g.: . Considering a scene that consists of an image where the n detected objects on it forms the set of entities, E={e_1,e_2,...,e_n}, for a given prompt p and an entity e_i, the neural modules will predict the alignment score, s_i=Align(p,e_i) for each entity e_i in the scene. The scores s_i quantifies the degree of alignment between the entities and the prompts, varying between 0 and 1. Furthermore, as the scene, as well as their detected objects, are fixed, we can consider the same list of objects to maintain consistence across multiple prompts. This way, for each prompt p_j, a tuple of scores S_j is produced, where S_j=(s_1,s_2,...,s_n). This process is illustrated through an example in Figure <ref>, where an object detector model detected 3 entities: A bird, a bench, and a cat. Therefore, for each prompt within the query, a tuple of size 3 will be predicted. For example, if the prompt 1 is , it is expected that the scores will have greater values on the positions 1 and 3, that refers to the bird and the cat, such as S_1=(0.8,0.1,0.9). If the prompt 2 is , it is expected to have values closer to 1 only on the position referring to the bird, such as S_2=(0.9,0.0,0.2). It's worth noting that the scoring mechanism hinges on the capabilities of the neural network model. The model's design, training data, and level of sophistication can influence the scoring outcomes. Thus, the effectiveness of prompts and the accuracy of scores in representing and querying scenes is closely tied to the underlying neural model's performance. §.§ Composite Prompts To address for limitations of neural models when the prompts becomes too complex by specifying in very details multiple characteristics and relations, we introduce the concept of composite prompts, which consists of methods for combining multiple prompts through logical and arithmetical operations. This process is evaluated using the scores of the entities for multiple prompts, which are aggregated in high level in a structured way. In a general case, considering a scene with n entities and two prompts within a given query, p_a and p_b, that produces two ordered sequence of scores S_a=(s^a_1,s^a_2,...,s^a_n) and S_b=(s^b_1,s^b_2,...,s^b_n), we can combine S_a and S_b through an arbitrary operation ⊙ to obtain a new group of scores S_c=(s^c_1,s^c_2,...,s^c_n), where each s^c_i is given by: s^c_i = s^a_i ⊙ s^b_i ∀ i ∈{1,2,...,n} When grouped operations are performed to produce another list of scores, S_d={s^d_1,s^d_2,...,s^d_n}, an operation is applied to the results of a previous operation and another set of scores s^c_i and the type of the operation ⊙ would depend on the specific grouped operations being performed. as follows: s^d_i = (s^a_i ⊙ s^b_i) ⊙ s^c_i ∀ i ∈{1,2,...,n} To illustrate, consider the scenario where the scene is an image featuring a diverse fauna. In this case, the detected entities would be the individual animals present within the image. In the case where one might want to filter red birds or animals with fur that are not near a tree, a composite prompt can be used to group those characteristics, as in: ([a bird] and [a red animal]) or ([an animal with fur] and not [near a tree]) Composite prompts allow for more granular and precise entity selection by combining various elementary prompts, while also alleviating issues related to model uncertainty and the lack of explicit reasoning capabilities. By combining multiple prompts, the system can better incorporate context and exploit the inherent structure in visual scenes. This allows for more refined and reliable outputs compared to what would be possible with a single, isolated prompt. More examples of composite prompts are presented in Section <ref>. §.§ Interpreting Scores The interpretation of scores within SNeL is a fundamental aspect of query execution and thus plays a central role in the overall system. As SNeL applies logical operations on these scores to derive final results, the interpretation approach dictates the behavior and results of these operations. We define three approaches for prompt scores interpretation: The Probabilistic, the Fuzzy and the Boolean. In the Probabilistic interpretation, scores are treated as probabilities. This approach utilizes operations commonly found in probability theory, such as the product rule for "and" operation and complement rule for "not" operation. In the Fuzzy interpretation, scores are treated as degrees of truth ranging from 0 to 1, and standard fuzzy logic operations are employed. Lastly, in the Discrete interpretation, scores are converted into Boolean values, true or false, according to a predetermined threshold, and traditional Boolean logic is employed. Table <ref> provides a summary of how each logical operation is defined under these three different interpretation methods. Each column corresponds to an interpretation approach and depicts the mathematical definition of each logical operation for that approach. The system designer can choose the appropriate interpretation based on the specific requirements of their use-case. §.§ Assembling Clauses In the SNeL language, clauses are assembled using a set of predefined keywords that dictate the type of operation to be performed. These keywords include "select", "get", "count", "any", and "all". Each keyword sets the structure for the query, defining what it returns. §.§.§ Select Clause The "" keyword is used to identify entities in a scene that match a given prompt. The output is a list of indices corresponding to the entities on the scene that were selected based on a score threshold. It must be followed by a simple or composite prompt and optional clauses for sorting, ordering and limiting the output. The general structure of a "select" query is: select [entity selection] sort by [sorting attribute] asc/desc limit N The "" prompt specifies the characteristics of the entities that must be selected. "" is an optional clause that sorts the selected entities based on the "" prompt, that refers to the characteristics of the attribute used for sorting. The output list can be in ascending or descending order, when using the clauses "" or "", respectively. In scenarios where no sorting prompt is provided, the "" clause can still be employed. However, in these cases, the sorting is conducted based on the scores corresponding to the entity selection prompt. Finally, the clause will limit the number of the entities in the output list by N. For instance, the query "" instructs the system to identify the three dogs possessing the darkest fur from the set of detected entities. §.§.§ Get Clause The "" keyword is used to retrieve specific attributes of entities that match a given prompt. The output of a "" query is a list of attribute values, corresponding to the entities on the scene that match the prompt. It must be followed by an attribute prompt, a "" clause indicating the target prompt, and optional clauses for sorting, ordering and limiting the output. The general structure of a "" query is: get [attribute request] from [entity selection] sort by [sorting attribute] asc/desc limit N The "" prompt refers to the desired attribute and the "" prompt specifies the entities that should be considered. The "", "" and clauses works the same way as in the "" keyword. As an example, the query "" instructs the system to identify the colors of the two birds closest to the tree from the set of detected entities. §.§.§ Count Clause The "" keyword is used to count the number of entities that match a given prompt. Therefore, it returns an interger. The structure of a "" query is: count [entity selection] Multiple "" clauses can be used within a single query, since they represent an integer value. Additionally, parenthesis can be used as in function notation to create a more readable query. For example, to return the ratio of red cars in a parking lot, we can use the following query: count([a red car] and [a car in a parking lot]) / count([a car in a parking lot]) §.§.§ All and Any Clauses The "" and "" keywords are used to check if all or any entities match a given prompt, respectively. The structures of "" and "" queries are similar to the "count" query: all [entity selection] limit N any [entity selection] limit N These queries return true or false. "all" query returns true if all entities match the prompt, and the "any" query returns true if at least one entity matches the prompt. As in the query " [a bird]" checks if all the entities in the scene are birds or in " [a cat]", that verifies if there is any cat among all entities. The "" clause is optional and is used to select N entities in the output. For example, verify that at least one of the three biggest birds are flying, we can use: any [a flying bird] sort by [a big bird] desc limit 3 Additionally, to verify if the two youngest persons are near the lake, we can use: all [a person near the lake] sort by [an old person] asc limit 2 The "" and "" clauses can also be used within a query among other expressions through the use of logical operators, as they represent a Boolean value. So for example, to check if all of the persons are wearing glasses and at least one of them is sitting on a chair, we can use the following: all([a person wearing glasses]) and any([a person sitting on a chair]) § LANGUAGE COMPONENTS The main architecture of the implementation of SNeL is composed of two main modules: The Neural Backend and the Language Interpreter. The Neural Backend stands as the sensory unit, responsible for interpreting the scene, discerning entities, associating them with the specified prompts, and predicting attributes when required. It transforms the raw data of the scene into a format primed for semantic processing, thus serving as the perceptive hub of the language. Conversely, the Interpreter operates as the cognitive unit, understanding and processing the semantics of the language through lexical analysis and parsing of queries. In the following Seciont more details about the components of SNeL will be detailed. §.§ Neural Backend The Neural Backend constitutes the perceptive component of the language. It is a system composed of neural modules that must be capable of executing a few tasks in order to extract the necessary information for the language queries. For handling prompts, it is necessary a detection of the entities of the scene and an alignment with the prompts given in the input query. For the "" clauses, the Neural Engine must also be capable of predicting the attributes for the entities based on a given prompt. This situation is the case of the operation of Question and Answer (Q&A) systems, wherein a neural model is tasked with generating an appropriate response to a specified inquiry within a given domain. In addressing the entity scoring based on the alignment with prompts, the Neural Backend must carry out entity detection and alignment. Regardless of the implementation, the functionality can be represented as a function f_ent: Ω→ E which extracts all the entities, E = (e_1, e_2, ..., e_n), of the scene Ω, and a function f_align: (E, p_ent) → S which captures the alignment scores, S = (s_1, s_2, ..., s_n), for each entity in a given scene with the entity selection prompt, p_ent. Each score s_i indicates the degree of alignment of entity e_i with the entity prompt p_ent, with a value in the range [0,1]. This setup allows the Neural Backend to understand the scene, identify and differentiate entities, and associate them with the input prompts in a quantitative manner, laying the foundation for the handling of complex queries. For handling "" clauses, the Neural Backend must also predict attributes of the entities based on an attribute prompt p_attr. This can be denoted as a function f_attr: E → A, where A is the set of possible attribute values. For each entity e_i, the function f_attr(e_i) predicts the attribute value of e_i based on the attribute prompt p_attr. §.§ Interpreter The Interpreter serves as the linguistic component of SNeL. This module is responsible for interpreting the input language queries, which involves transforming the raw input into a structured format that the Neural Backend can interpret and process. The Interpreter achieves this through a two-step procedure: Lexical Analysis and Parsing. The former involves tokenizing the input query into identifiable sequences or lexemes, and the latter is focused on structuring these tokens into a syntactic tree known as a Parse Tree. Together, these two steps allow the Interpreter to process the input query effectively and lay the groundwork for the neural processing carried out by the Neural Backend. This entire process ensures the proper translation of the language query into actions that can be understood and executed by the Neural Backend. The following sections provide a more detailed overview of the Lexical Analysis and Parsing stages involved in the interpretation of a SNeL query. §.§.§ Lexical Analysis The initial phase in the interpretation of a SNeL query is Lexical Analysis. This stage scans the input query string and transforms it into a series of meaningful sequences, known as lexemes. Each lexeme is classified and associated with a corresponding token, enabling the Interpreter to understand and process the query more effectively. Formally, a lexer, or tokenizer, can be viewed as a function L: Σ^* → T^, where Σ^ is the set of all possible strings over the alphabet of the language, in this case, the set of all possible SNeL queries, and T^* is the sequence of tokens that represent lexemes in the language. For each token is defined a regular expression to be used to extract it from the input text. The tokens in the SNeL language are broadly divided into several categories, as shown in Table <ref>. §.§.§ Parsing The second phase of the Interpreter module is Parsing, which takes the token sequence outputted by the lexical analysis and structures it into a syntactic tree known as a Parse Tree. This Parse Tree represents the syntactic structure of the input query as per the rules defined in the language's grammar and can be formally defined as a function P: T^* →Γ, where T^* is the sequence of tokens from the lexical analysis, and Γ is a Parse Tree representing the syntactic structure of the input as per the rules of the SNeL language's grammar. In the context of the SNeL language, the parsing is guided by a context-free grammar that dictates the valid structures of SNeL queries. For example, a simple rule in the grammar could be that a "" clause must be followed by an entity prompt and a "" clause must be followed by an attribute prompt. Therefore, the parser is in charge of checking the syntactic correctness of the input query. If the input does not conform to the grammar rules, the parser will raise an error, and the query will be rejected. § USE CASES AND EXAMPLES In this section, we provide examples of SNeL commands across multiple domains—images, audio, text, and videos—to underscore its broad applicability and versatility. Each domain has a dedicated subsection containing a hypothetical scene and a corresponding table of commands. These examples highlight the expressiveness of SNeL in diverse contexts, demonstrating its utility in facilitating nuanced interactions with AI models across different types of data. §.§ Image Domain Scene description: An image of a public park filled with people, animals, and various other objects. §.§ Video Domain Scene description: A video recording of a busy city traffic scene, showcasing various vehicles such as cars, trucks, buses, motorcycles, and bicycles, as well as pedestrians crossing streets, traffic signals, and audio cues like honks, sirens etc. §.§ Audio Domain Scene description: An audio recording of an orchestral performance, with various instruments such as violins, cellos, flutes, trumpets, and drums being played at different times. §.§ Text Domain Scene description: A collection of social media posts containing text and emojis from a public figure's account. § CONCLUSION AND FUTURE WORK In this paper, we introduced SNeL, a high-level query language model grounded in the ontological concept of entities for reasoning about a scene. This, together with the development of new multimodal deep learning models, allows for the idea to be extended for multiple domains, such as images, audio, video, and text. By integrating neural models with a Context-Free Grammar, our system forms a part of the wider ecosystem of Neuro-Symbolic AI. Through the diverse set of examples provided, we have shown the ability of SNeL to generate precise and granular queries, thereby allowing more efficient and targeted retrieval of information. However, a key consideration is that the effectiveness of SNeL is deeply contingent on the underlying models used to interpret the data. In essence, it is only as powerful as the models it interacts with. Therefore, the ability to accurately decipher the scene and process the commands in the SNeL language is largely dependent on the quality and capabilities of the models used in the different domains. Moreover, these models must be accurately tuned and trained for the specific tasks and domains for the proposed language to operate at its fullest potential. Looking forward, our future work will focus on testing SNeL with various models in different domains to explore and evaluate its performance and effectiveness more comprehensively. This will involve identifying the most suitable models in each domain, and training these models to optimize their performance when used in conjunction with SNeL. Another promising direction for future work is the expansion of SNeL's language constructs. The addition of more clauses and expressions to the language will enrich its expressiveness and flexibility, thereby broadening its potential application areas. This could include incorporating advanced semantic understanding and reasoning capabilities, which would significantly enhance SNeL's performance in tasks involving complex context understanding. unsrtnat
http://arxiv.org/abs/2306.01617v2	20230602152721	The Radio Parallax of the Crab Pulsar: A First VLBI Measurement Calibrated with Giant Pulses	[ "Rebecca Lin", "Marten H. van Kerkwijk", "Franz Kirsten", "Ue-Li Pen", "Adam T. Deller" ]	astro-ph.HE	[ "astro-ph.HE", "astro-ph.IM" ]	Radio Parallax of the Crab Pulsar 0000-0003-4530-4254]Rebecca Lin Department of Astronomy and Astrophysics, University of Toronto, 50 St. George Street, Toronto, ON M5S 3H4, Canada 0000-0002-5830-8505]Marten H. van Kerkwijk Department of Astronomy and Astrophysics, University of Toronto, 50 St. George Street, Toronto, ON M5S 3H4, Canada 0000-0001-6664-8668]Franz Kirsten Department of Space, Earth and Environment, Chalmers University of Technology, Onsala Space Observatory, 439 92, Onsala, Sweden 0000-0003-2155-9578]Ue-Li Pen Institute of Astronomy and Astrophysics, Academia Sinica, Astronomy-Mathematics Building, No. 1, Sec. 4, Roosevelt Road, Taipei 10617, Taiwan Canadian Institute for Theoretical Astrophysics, 60 St. George Street, Toronto, ON M5S 3H8, Canada Canadian Institute for Advanced Research, 180 Dundas St West, Toronto, ON M5G 1Z8, Canada Dunlap Institute for Astronomy and Astrophysics, University of Toronto, 50 St George Street, Toronto, ON M5S 3H4, Canada Perimeter Institute of Theoretical Physics, 31 Caroline Street North, Waterloo, ON N2L 2Y5, Canada 0000-0001-9434-3837]Adam T. Deller Centre for Astrophysics and Supercomputing, Swinburne University of Technology, John St., Hawthorn, VIC S1RR, Australia ARC Centre of Excellence for Gravitational Wave Discovery (OzGrav), Australia Rebecca Lin [email protected] We use four observations with the European VLBI network to measure the first precise radio parallax of the Crab Pulsar. We found two in-beam extragalactic sources just outside the Crab Nebula, with one bright enough to use as a background reference source in our data. We use the Crab Pulsar's giant pulses to determine fringe and bandpass calibration solutions, which greatly improved the sensitivity and reliability of our images and allowed us to determine precise positional offsets between the pulsar and the background source. From those offsets, we determine a parallax of π=0.53±0.06 mas and proper motion of (μ_α,μ_δ)=(-11.34±0.06,2.65±0.14) mas yr^-1, yielding a distance of d=1.90^+0.22_-0.18 kpc and transverse velocity of v_⊥=104^+13_-11 km s^-1. These results are consistent with the Gaia 3 measurements, and open up the possibility of far more accurate astrometry with further VLBI observations. § INTRODUCTION The Crab Pulsar (PSR B0531+21) is one of the youngest pulsars, situated at the heart of the Crab Nebula, the remnant of supernova SN 1054 <cit.>. One of the most observed pulsars, it has been continuously monitored by the 13 m dish at the Jodrell Bank Observatory since 1984 <cit.>. The mean radio profile of the pulsar shows multiple components, with the dominant ones being the main pulse (MP) and interpulses (IPs) which are made up of “giant pulses”, extremely narrow and bright pulses (for a review, see ). The pulse emissions are not only bright in radio but visible up to γ-ray energies with the MP and IPs showing strong alignment across the full electromagnetic spectrum <cit.>. The pulsar also undergoes glitches, discrete changes in the pulsar rotation rate, every few years[<http://www.jb.man.ac.uk/pulsar/glitches.html>] (e.g., ). This wealth of pulse phenomena offers a great opportunity for understanding the pulsar emission mechanism and possibly constrain the nuclear physics of neutron star interiors. Additionally, the young age of this system (∼1000 yr) makes it the ideal laboratory to study not only the evolution of young pulsars but also pulsar wind nebulae and supernova remnants. Since the discovery of the Crab Pulsar, there have been several attempts to constrain the distance and proper motion of the pulsar. For the distance, early attempts based on various lines of evidence including kinematic, spectroscopic and age-related considerations placed the pulsar between 1.4 and 2.7 kpc <cit.>. From galactic electron density distribution models, the distance to the pulsar can be estimated as ∼1.7 kpc with the NE2001 model <cit.> and ∼1.3 kpc with the YMW16 model <cit.>. While these estimates give a sense of the distance, none of them are precise and none are direct measurements. Indeed, many rely on assumptions one would like to test. For instance, the kinematic constraints implicitly assume a roughly spherical nebula, while the dispersion-measure based distances rely on electron density models. For the proper motion, similarly early measurements of the Crab Pulsar were relatively poor <cit.>. A first relatively precise measurement was derived from Hubble Space Telescope observations spanning over a decade, of (μ_α, μ_δ) = (-11.8±0.4±0.5, 4.4±0.4±0.5) mas yr^-1 <cit.>. While a precise parallax and proper motion measurement of the Crab Pulsar would be important, it is impeded by complications in doing astrometry at both radio and optical wavelengths; furthermore, due to the glitches, pulsar timing also cannot help (for a review, see ). In the optical, this changed with the Gaia mission, which presented the first precise astrometry in its second data release (Gaia DR2, ): π=0.27±0.12 mas and (μ_α, μ_δ) = (-11.8±0.2, 2.65±0.17) mas yr^-1, respectively. The precision was improved in the third data release, Gaia DR3 <cit.>: π=0.51±0.08 mas and (μ_α, μ_δ) = (-11.51±0.10, 2.30±0.06) mas yr^-1, respectively. While impressive, the difference in measured parallax between the two data releases is somewhat worrying. It might be related to the fact that the measurements are affected by the Crab Pulsar not being a typical optical source, being embedded in an optically bright nebula and producing variable emission near itself that would be only marginally resolved. Hence, it would be best to have an independent measurement. At radio wavelengths, Very Long Baseline Interferometry (VLBI) has been very successful in measuring accurate parallaxes and proper motions for pulsars both weaker and further away than the Crab Pulsar (e.g., ). For the Crab Pulsar, a difficulty is that it is embedded in a large, ∼6×4, radio-bright nebula. The high brightness effectively raises the overall system temperature in any observation, making the average emission of the Crab Pulsar hard to detect. This particularly affects observations at higher frequencies, where the angular resolution is better but the pulse emission fainter (f_ν∝ν^-3.1, ). But at lower frequencies, where the pulsar is brighter, the ionosphere hinders astrometry, especially in the absence of an extragalactic source that can be used as an in-beam calibrator – which has to be outside the nebula, since otherwise it would be severely broadened by scattering. The problem of a lack of an in-beam calibrator has recently been solved: the Wide-field VLBA Calibrator Survey (WFCS; ) lists a suitable nearby source (one which we also discovered independently; see Section <ref>). With such an in-beam extragalactic source, one avoids uncertainties in extrapolating phasing solutions for a phase calibrator that is multiple degrees away. And even if the in-beam calibrator is not very bright, a parallax measurement to within a 0.1 mas should be possible if one can self-calibrate on the pulsar <cit.>. For the Crab Pulsar, the bright nebula prevents self-calibration on the regular pulse emission (e.g., used an external phase calibrator for their VLBI imaging). In principle, the Crab Pulsar's giant pulses can help, as they are extremely bright and can be detected with single dishes. Because they occur randomly in time, however, even pulsar gating on the corresponding phase windows does not give very good signal-to-noise (S/N) ratios. In this paper, we present a technique using only the Crab Pulsar's giant pulses to model ionospheric and instrumentation variations for self-calibration, and show that with the newly found nearby extragalactic reference sources this enables precise parallax and proper motion measurements. In the following, we first describe in Section <ref> the VLBI data we took, as well as the archival Very Large Array (VLA) dataset we used to search for extragalactic references. In Section <ref>, we describe how we correlated our VLBI data to form visibilities, calibrated the visibility data with the giant pulses, and extracted positions of our sources. In Section <ref>, we derive the parallax and proper motion from the positions. We compare with the Gaia results in Section <ref>, and discuss ramifications and future prospects in Section <ref>. § OBSERVATIONS Our observations were taken with the European VLBI Network (EVN) at four epochs between 2015 Oct and 2017 May, using a total of 10 hr (see Table <ref>). Real-sampled data in left and right circular polarizations were recorded in either 2-bit MARK 5B or VDIF format at each telescope, except for the 70 m at the Robledo Deep Space Station (Ro) where only left circular was available. The frequency range of 1594.49–1722.49 MHz was covered, in either eight contiguous 16 MHz or four contiguous 32 MHz wide bands. Individual scans on the Crab Pulsar lasted ∼5 (EK036 C-D) to ∼25 min (EK036 A-B), and were interleaved with observations of J0530+1331 (∼5 to ∼10 min, bandpass calibrator source at 85 from the target) and/or J0518+2054 (∼0.5 to ∼1 min, phase calibrator source at 40 from the target). The unusually long integration times on the target (in particular in EK036 A and B) and short integrations on the phase calibrator were chosen because we only intended the phase calibrator to provide a first crude calibration, just enough to later perform self-calibration on the target; we realized phase calibration at the level required for accurate astrometry would be impossible given the large separation between target and phase calibrator and the bright emission from the Crab Nebula. After a first inspection of the data from EK036 A, however, it became clear that our initial approach led to phase errors that were too large to perform traditional self-calibration on the Crab Pulsar (see Figure <ref>). Hence, we reduced the integration times on the target in the subsequent EK036 C and D observations (e.g., were able to transfer phase solutions from J0518+2054 using a much shorter calibrator/target cycle of 2/5 min.). At the time of these observations, no extragalactic sources near the Crab Pulsar were known that would be suitable as in-beam calibrators. Therefore, the Crab Pulsar pointings were centered on the pulsar itself (see Table <ref>), in the hope that suitable in-beam references could be found within the field of view of the smaller participating stations. lllclccrr Observation and Giant Pulse Log 1 Observation Date MJD t_expa t_targetb Telescopes usedc DMd 2cGiant Pulsese code (h) (h) (pc cm^-3) N r (min^-1) EK036 A 2015 Oct 18 57313.96 4 3.27 Ef3Bd3Hh3Jb11Mc3O83Ro3Sv3T63Tr16Wb3Zc 56.7772 686 3.50 EK036 B 2016 Oct 31 57692.98 2 1.65 Ef3Bd3Hh22Mc3O821Sv45Wb3Zc 56.7668 1067 10.81 EK036 C 2017 Feb 25 57809.67 2 1.15 Ef3Bd3Hh3Jb12Mc3O821Sv32Ur3Wb3Zc 56.7725 281 4.08 EK036 D 2017 May 28 57901.40 2 1.24 Ef3Bd3Hh3Jb-II3Mc3O821Sv21Tr3Ur3Wb3Zc 56.7851 740 9.94 aTotal observing time, including telescope setup and calibration. bTotal exposure on target. c We omit telescopes where data were corrupt, where significant RFI occurred and/or where we were unable to determine reliable fringe solutions. Asterisks beside a telescope indicate that the telescope was unable to see the source for the full observing time; furthermore, Ro had left-circular polarization only. Abbreviations are: Ef: the 100 m Effelsberg telescope; Bd: the 32 m at Badary; Hh: the 26 m in Hartebeesthoek; Jb: the 76 m Lovell telescope; Jb-II: the 25 m Mark II Telescope at the Jodrell Bank Observatory; Mc: the 32 m at Medicina; O8: the 25 m at Onsala; Ro: the 70 m at the Robledo Deep Space Station; Sv: the 32 m at Svetloe; T6: 65 m at Tianma; Tr: the 32 m at Toruń; Wb: the 25 m RT1 telescope at Westerbork; and Zc: the 32 m at Zelenchukskaya. dInferred from the giant pulses. eTotal number and rate of giant pulses (including both MP and IP) found using a detection threshold of 50σ on incoherently summed data (for details, see ). cllc Target and Calibrator Scan Pointing Centers 2 Source Right Ascension Declination Sep. (α) (δ) () PSR B0531+21 05^h34^m31.934^s 220052.191 J0530+1331 05^h30^m56.4167465^s 133155.149516 8.5 J0518+2054 05^h18^m03.8245128^s 205452.497365 4.0 Coordinates listed here are in the J2000 FK5 frame. The separation between the calibrator sources and the Crab Pulsar is given in the last column. lllrr Candidate Extragalactic Sources from VLA Data 3 Source Right Ascension Declination Peak Sep. (α) (δ) S/Na () NE_CAND1 05^h34^m50.43^s 220337.58 16.3 5.1 NE_CAND2 05^h34^m50.93^s 220639.79 8.4 7.3 NE_CAND3 05^h34^m50.80^s 220446.41 4.9 5.9 NE_CAND4 05^h35^m14.05^s 220407.43 42.6 10.3 SE_CAND1 05^h34^m55.31^s 215518.94 14.8 7.8 SE_CAND2 05^h34^m40.74^s 215515.31 6.5 6.0 SE_CAND3 05^h35^m06.34^s 215649.11 463.0 8.9 NW_CAND1 05^h34^m07.34^s 220845.63 19.8 9.7 SW_CAND1 05^h34^m11.62^s 215853.38 18.7 5.1 SW_CAND2 05^h34^m15.14^s 215712.71 14.0 5.3 Coordinates listed here are in the J2000 FK5 frame. SE_CAND3 and NE_CAND4 where later confirmed to be visible in the EVN data. The separation between the candidate sources and the Crab Pulsar is given in the last column. aAs found in the VLA data. Given the high resolution of the EVN data, an untargeted search for in-beam sources is nearly intractable. Instead, we searched for candidates in an archival VLA dataset (project code 12B-380), taken in A-array configuration on 2012 Nov. 26 & 27 at 3 GHz (S band, covering 2–4 GHz). We used the standard Common Astronomy Software Applications VLA calibration pipeline ( 5.1.1, ) to perform automatic flagging and calibration of the two datasets. No careful flux calibration was applied. After inspection of the data, we decided to focus only on the later run, from 2012 Nov. 27. We used the task for imaging, limiting ourselves to the lower half of the frequency band, i.e., 2–3GHz. Moreover, we limited the uv range, excluding visibilities from baselines <75 kλ in order to filter out the extended emission from the Crab Nebula itself. Since our aim was to find compact sources within the field of view of the VLA, we generate an image of 8192×8192 pixels at an angular resolution of 0.15 arcsec/pixel, oversampling by about a factor 3 the 477×470 mas beam (position angle -60). The rms in the final image varies by a factor of up to 4 between the central region and the outer region of the image because of the Crab Nebula's emission. We exported the cleaned image as a FITS file and searched for radio sources by normalizing the image relative to a median-filtered version to pick out outliers. In this way, we found ten candidates, which we list in Table <ref> and show in Figure <ref>. For all of the candidates, we created images from our EVN data, finding that the two brightest ones were detected: SE_CAND3 and NE_CAND4 (see Section <ref> and Figure <ref>). We were able to find a source at the location of SE_CAND3 in the new Wide Field Very Long Baseline Array (VLBA) calibrator survey <cit.>, which lists it as the compact source WFCS J0535+2156, and in the Very Large Array Sky Survey (VLASS) <cit.> as VLASS1QLCIR J053506.32+215649.3. Candidate NE_CAND4 was also seen in VLASS as VLASS1QLCIR J053514.04+220407.7, but not in the VLBA catalogue. Looking through other catalogues, we found sources matching the position of SE_CAND3 in the Wide-field Infrared Survey Explorer Data Release <cit.> and in the UKIRT Infrared Deep Sky Survey <cit.>. It also has a counterpart in Gaia DR3 <cit.>, with a parallax and proper motion consistent with zero. Thus, it seems likely that SE_CAND3 is an active galactic nucleus. § CORRELATION, CALIBRATION, IMAGES, POSITIONS AND UNCERTAINTIES §.§ Visibilities We correlated the data from the different telescopes using the publicly available Super FX Correlator ( 5.1; ), which prior to preforming the correlations, corrects for station clock offsets and rates, as well as for geometric delays using CALC10[<https://space-geodesy.nasa.gov/techniques/tools/calc_solve/calc_solve.html>] <cit.>. At this stage, no additional station-specific delays or atmospheric distortions of the wavefront are taken into account. For each observation, two correlation passes were performed. The first pass correlated on the Crab Pulsar in pulsar gating mode (described below), and on the bandpass and phase calibrators in ungated mode. The correlation centers in this pass are the same as the antenna pointing centers given in Table <ref>. In the second correlator pass, we correlated all target scans again, but now ungated and centred on the locations of our candidate sources (see Table <ref>), using 's multi-phase center mode. For the pulsar gating, we created polyco files using Tempo2 <cit.> with the Crab Pulsar ephemeris, starting from the ephemeris provided by Jodrell Bank Observatory[<http://www.jb.man.ac.uk/ pulsar/crab.html>] <cit.> and then adjusting the phase and dispersion measure to values found in <cit.> for the same data (see Table <ref>). With these, we used to incoherently de-disperse[ version 5.1 does not have coherent de-dispersion capabilities.], fold, and gate the pulsar observations on the MP phase window (2.1% of the ∼33 ms pulse period). With the gated mode, we gain S/N by removing time ranges when little if any pulsar signal is present. However, since giant pulses are short in duration (most of the signal is within the scattering timescale of ∼5 μ s at our observing frequency, see <cit.> for examples of giant pulses from these datasets) and occur only in some pulse rotations, one could in principle get much better S/N ratio by only including pulse rotations in which giant pulses occur. Furthermore, one could also include IP giant pulses and possibly other pulse components. We did not pursue these potential improvements, since we find below (in Section <ref>) that the S/N ratio of the images created from the MP gated visibilities is much larger than that of the in-beam candidate sources, and thus does not limit the accuracy of the astrometry. For all correlations, we used a spectral resolution of 4096 channels across the total bandwidth, limiting any dispersive in-channel smearing to 3 μ s (of order a giant pulse width). We used a temporal resolution of 0.5 s to have the option of, in post-processing, select only time integrations where particularly bright giant pulses occurred (but we did not use this, as the S/N ratio sufficed). In total, for each observation eleven visibility sets were created, one for the Crab Pulsar and one each for our candidate sources. Calibrator visibility data were included in each visibility set, hence each set contained three sources. §.§ Calibration We calibrated our visibilities with the help of 6.5, writing custom calibration scripts to ensure that our calibrations are consistent across all observations and to help track our configurations. In preparation, we first converted visibility data to Measurement Sets using Joint Institute for VLBI in Europe (JIVE) post-processing tools, and set up antenna tables with diameters and axis offsets from the station summary files. We also set up amplitude calibration tables with system temperature, gain curve and primary beam corrections. Since system temperature and gain curve measurements from the telescope logs were affected by the bright Crab Nebula and thus unreliable (and some were simply missing), we instead used nominal values taken from the EVN status table[<http://old.evlbi.org/user_guide/EVNstatus.txt>] and included the flux density of the Crab Nebula S_CN=955ν^-0.27 Jy, where ν is our observing frequency in GHz <cit.>. As our goal is precise astrometry, the true flux density of our sources is of little importance and this flux scaling is sufficient for estimating which of the candidate sources will likely be visible in the EVN datasets. We flagged times and frequencies where the signal was poor (i.e., before the start and end of each scan, and at passband edges), as well as particularly strong radio frequency interference (RFI) previously detected in the baseband data (see ), taking care to ensure that giant pulse signals were not accidentally removed. Finally, to account for the reduced sensitivity away from the antenna pointings, we applied a primary beam correction for our in-beam candidate correlation centers (assuming an Airy disk with effective aperture sizes provided by the JIVE team, separately for each of our eight spectral windows). For calibration, we started by determining phase and delay corrections due to instrument and atmospheric variations towards our calibrator sources: we use 's task to determine solutions in 60 s intervals for each spectral window and polarization independently, with Effelsberg as the reference antenna. We attempted transferring the fringe solutions to the Crab Pulsar, but found relatively poor results (see Figure <ref> and Section <ref> below). This was not unexpected given that our calibrators are far from the Crab Pulsar and that the target scans are relatively long compared to the timescale of a few minutes of ionospheric variations. Since the Crab Pulsar is the brightest of the in-beam sources, we instead used it to self-calibrate. We first tried using the gated pulsar visibilities from , but these do not have sufficient S/N on short integrations and hence the resulting fringe solutions obtained using 's task were unreliable, showing extreme variations without any discernible pattern. Instead, we follow <cit.> and use giant pulses to model the delays, amplitude and phase rotations in each spectral window, and write these models to compatible fringe and amplitude tables. Specifically, we use all giant pulses (both MP and IP) detected with a S/N ratio of 50 in the incoherently summed telescope data (a cut-off that ensures no false detections; we find no pulses outside of the MP and IP phase windows, see for details on the data reduction giant and giant pulse detection). We show an example of an extreme fringe solution in Figure <ref> (for Badary in the EK036 A observation, where the Crab Pulsar is setting, causing a rapid increase in path length through the ionosphere thus a large increase in fringe rate). We applied these solutions to both the Crab Pulsar and the candidate in-beam source visibility sets. Since our detection rate is high, at ∼4-11 every minute (see Table <ref>), we can easily follow ionospheric variations towards the Crab Pulsar and thus, unlike many calibration pipelines, do not apply archival global ionosphere models such as the ionosphere vertical total electron content (TEC) maps from NASA's Crustal Dynamic Data Information System (CDDIS)[<https://cddis.nasa.gov/Data_and_Derived_Products/GNSS/atmospheric_products.html#iono>] to the pulsar. We thus avoid uncertainties associated with the coarse resolution of the TEC maps (5 in longitude by 2.5 in latitude and 2 hr temporal resolution), the accuracy of ∼2 to 8 TECU, and modeling assumptions required in using it (in , that the ionosphere is a thin shell at a constant height of 450 km). Indeed, unreliable TEC information can sometimes produce negative parallaxes with smaller errors (e.g. ), and recent analysis by <cit.> found that while TEC maps certainly can help improve measurements, corrections to the default values and implementation were needed to obtain the best absolute astrometry. Still, even for our close in-beam reference source, the ionospheric contributions will differ slightly between it and the Crab Pulsar. Thus, while for our main analysis described below we do not use the TEC maps, we describe a separate analysis applying a relative correction based on them in Appendix <ref>. We find that this gives consistent astrometric results with those of Section <ref> below. For bandpass calibration (i.e., time-independent frequency calibration), we again use our giant pulses, this time creating visibilities (for details, see ), which we then averaged across time to solve for the complex bandpass. As before, we use Effelsberg as our reference antenna. The complex bandpass was smoothed with a median filter to remove any remaining RFI contributions, then modeled with a simple cubic spline interpolation and normalized to unity to preserve the flux density scale. We wrote our solutions to compatible bandpass tables and applied the corrections to both the Crab Pulsar and the candidate in-beam source visibility sets generated by . We show a typical bandpass solution in Figure <ref>. To verify our solutions, we also determined bandpass solutions using 's task on the calibrator sources (using Effelsberg as the reference antenna). We found that there were no significant differences between these solutions and the ones determined from the giant pulses. Since we do not use the calibrators elsewhere in our analysis, we decided to stick with the giant-pulse bandpass solutions. Lastly, we used 's task with a solution interval of ∼5 mins to refine our amplitudes on the gated Crab Pulsar visibilities. Overall, we find that this final amplitude correction showed no variations related to scintillation as in <cit.>, as expected given that the Crab Pulsar's scintillation decorrelation bandwidth is much smaller that the width of our subbands. As before, this adjustment to the absolute flux density scaling should not affect positions (which we confirmed by omitting this step), but does improve the S/N of images slightly, by ≲5%. We again apply these solutions to both the Crab Pulsar and candidate reference sources. After calibration, we reduced the data to a more manageable size by lowering the spectral resolution to 1024 channels and the temporal resolution to 2 s. §.§ Images All imaging was done using 's task. For all sources, we started with our full bandwidth, and used natural weighting to optimize S/N. The synthesized beam is similar in all observation, with full width at half maximum of roughly 4 mas×12 mas, elongated in declination. To adequately sample this beam, we use a pixel size of 0.5 mas for our images. All our generated images are 4096×4096 pixels in size. We first formed dirty images for all our visibility sets. For the Crab Pulsar, after applying the initial calibrations to the visibilities, we applied further calibrations in two separate ways: one using only solutions inferred from the calibrator sources (i.e., phase-referencing), and one using the solutions obtained from giant pulses (i.e., self-calibration). We compare the resulting dirty images of the Crab Pulsar in Figure <ref>. One sees that our giant pulse self-calibration provides much better results. Thus, for the candidate reference sources, after applying the initial calibrations, we applied further calibrations using only solutions obtained from giant pulses (i.e., effectively phase-referenced relative to the Crab Pulsar). From these dirty images, we were only able to confidently see two of the in-beam candidate sources, SE_CAND3 and NE_CAND4. This is perhaps unsurprising, since the other candidate sources are much weaker (see Table <ref>) and our average sensitivity limit is quite poor: even away from the nebula, the rms is ∼0.25 mJy/beam. Another possibility is that some of these sources are extended beyond our largest angular scales (∼140 mas) and hence resolved out. For SE_CAND3, we measured fluxes between ∼13 and 24 mJy in our four epochs, while for NE_CAND4, we found fluxes between ∼3 and 5 mJy, For comparison, for SE_CAND3, <cit.> gives 4.3 and 7.6 GHz fluxes of ∼42 and ∼36 mJy, respectively, in the WFCS, while <cit.> finds 3 GHz fluxes of ∼39 and ∼4 mJy in VLASS for SE_CAND3 and NE_CAND4, respectively. These fluxes seem roughly consistent, taking into account our approximate flux calibration, differences in observing frequency and resolution, as well as possible source variability and structure. The positions of SE_CAND3 and NE_CAND4 are within 50 mas of their correlation centers (see Figure <ref>) and well within the uncertainties of positions measured in the VLA data. Thus, phase drifts resulting from the sources not being exactly at their correlation center are negligible <cit.> and we do not re-correlate any data. ccccc[ht] Relative Positions between the Reference Sources and the Crab Pulsar 4 Observation 2cSE_CAND3 2cNE_CAND4 code Δα^∗ (mas) Δδ (mas) Δα^∗ (mas) Δδ (mas) EK036 A -478472.866±0.013±0.00±0.04 243085.54±0.04±0.07±0.14 -585690.43±0.13 -195268.6±0.3 EK036 B -478484.651±0.020±0.02±0.04 243088.25±0.06±0.14±0.14 -585702.27±0.20 -195265.4±0.5 EK036 C -478489.143±0.030±0.03±0.04 243089.04±0.09±0.11±0.14 -585706.66±0.18 -195264.3±0.4 EK036 D -478491.763±0.020±0.03±0.04 243089.84±0.09±0.09±0.14 -585708.76±0.19 -195262.1±0.5 All right ascension offset are calculated at the declination of the pulsar. For SE_CAND3, we provide the measurement errors inferred from the fits to the cleaned images, and estimates of the intra-epoch (see Section <ref>) and inter-epoch errors (see Section <ref>) , respectively. These should be added in quadrature to obtain the total uncertainty. For NE_CAND4, we list only the errors from the position fit, since they are substantially larger than any systematic effects. To clean our images of the Crab Pulsar, SE_CAND3 and NE_CAND4, we apply a single elliptical mask the size and orientation of the synthesized beam centered on the peak flux in the dirty images to guide the cleaning. The cleaning was stopped when the residual reached an rms equal to that of a 4096×4096 pixel dirty map centered ∼2 West from the source (this is far enough away that there are no sources in the map and side-lobe effects do not affect the field significantly so the average rms measurement is more accurate; the noise level was measured using 's task). We show our clean images of the Crab Pulsar and the two in-beam candidates SE_CAND3 and NE_CAND4 in Figure <ref>. Since we self-calibrated on the pulsar, its position is fixed to the antenna pointing position (see Table <ref>). Assuming an extragalactic origin of the in-beam candidate sources, one expects them to move slightly between epochs. As can be seen in Figure <ref>, this is indeed the case. §.§ Positions and their Uncertainties We first tried fitting the cleaned source images with elliptical Gaussians using the task which is based on the procedure of <cit.>. However, we found that the position errors provided by were odd – we expected errors in right ascension and declination to scale with their respective beam sizes, but found that the ratio was substantially different (with errors in declination a factor 7-10 times larger than those in right ascension, instead of the expected factor of ∼3). We compared 's results with those from the task from the Astronomical Image Processing System (; ) which is also based on <cit.>. The fitted positions were consistent, but the uncertainties from 's do have the expected scaling with beam size. To investigate this discrepancy in position uncertainties, we implemented our own elliptical Gaussian fit routine in python. We discovered that the discrepancy between and comes from how the noise and restoring beams are used when determining S/N. We concluded that for a point source, the procedure of 's task is the logical one: calculate the S/N from the ratio of fitted peak amplitude and measured rms, and then estimate position uncertainties as usual for correlated noise, by dividing the fitted beam sizes by the S/N, and rotate to right ascension and declination (in our case, the beam is nearly aligned, so the effects of rotation are tiny). To derive our final positions, we used our fitting routine, taking a large 128×128 pixel window centered on the peak of each image to ensure a good fit. The rms fluctuations were measured from the whole image with the 128×128 pixel window centered on the peak removed. We confirmed that our fitted positions were in agreement with those from and and our errors were consistent with those from , but different from those of [Our final parallax value and uncertainty do not change if we use the uncertainties, since the differences in the error estimates end up being absorbed by the intra-epoch errors we add later.] From Figure <ref>, we see that both SE_CAND3 and NE_CAND4 are outside the FWHM of the Effelsberg beam. To confirm that we have applied our primary beam corrections correctly and Effelsberg does not affect the positions of the candidate sources, we remove visibilities with baselines involving Effelsberg and verified that the positions remain unchanged. As all images are calibrated to the pulsar, the positions are relative to it, and thus the inferred position of the pulsar should by definition be equal to the pointing center. We confirmed that this was indeed the case (to well within nominal uncertainties) by fitting the Crab Pulsar's cleaned images as well. The position uncertainties calculated this way may be slightly underestimated, since we are fitting a zero level offset instead of fixing one, and errors made in cleaning our images may not have fully propagated. In addition, errors from EK036 B-D may be underestimated a bit more than those of EK036 A because of their sparser coverage of the uv plane (EK036 A was twice as long as the other epochs and more EVN stations participated in the observation). Finally, beyond fitting errors, there could be other residual cleaning artifacts, as well as unmodeled ionospheric and instrumental effects. To estimate such errors for each epoch individually (“intra-epoch error”), we compare the position offsets of SE_CAND3 inferred from the full bandwidth with offsets measured across spectral windows (similar to ; we omitted NE_CAND4 as its S/N ratio in the images from the whole bands was already rather poor). For this purpose, we made cleaned images of the sources by splitting the total bandwidth into four, 32 MHz wide parts, and fitted those to infer positions[We tried making images for every spectral window (i.e., eight 16 MHz bands) but found the S/N to be too low for reliable position measurements.]. To account for this additional source of uncertainty, we added intra-epoch errors for SE_CAND3 by the amount, added in quadrature to each relative position measurement in an epoch, required to produce a χ^2_ red=1 (separately for right accession and declination; see Table <ref>). This is a somewhat more conservative approach than simply scaling the errors to obtain a χ^2_ red=1, but ignores that with only four measurements there is a reasonable probability to find either smaller or larger χ^2_ red values by chance. It would be worthwhile to explore this further for a larger data set. In order to check the effect of duration, we also tried splitting the EK036 A observation in half, such that the duration and uv coverage are similar to what we have in our other observations. We find that the intra-epoch errors in both halves of the EK036 A observation increase and become comparable to those in the other observations, suggesting that increased sampling in the uv plane helps minimize systematic errors. Our final adopted positions and the associated uncertainties are listed in Table <ref>. § ASTROMETRY We use the position offsets from Table <ref> to fit for the parallax (π), proper motion (μ_α^∗, μ_δ)[We denote differences in right ascension multiplied by cosδ with ∗.] in right ascension and declination respectively, and residual positional offset (Δα^∗_0, Δδ_0), again in right ascension and declination respectively. In terms of these parameters, the observed offsets are fit to, Δα^∗_i = π f_α^∗,i+ μ_α^∗(t_i-t_0) + Δα^∗_0, Δδ_i = π f_δ,i + μ_δ(t_i-t_0) + Δδ_0, where t_0 is a reference time – which we chose to be the average time over our observations (MJD 57680) to minimize covariance between the proper motion and the position offsets – and f_α^∗ and f_δ are the parallax factors, given by f_α^∗(t) = X(t)sin(α_0) - Y(t)cos(α_0), f_δ(t) = [X(t)cos(α_0) + Y(t)sin(α_0)]sin(δ_0) = - Z(t)cos(δ_0), where X(t), Y(t), and Z(t) are the components of the barycentric position of the Earth at time t, and α_0 and δ_0 are the approximate position of the Crab Pulsar (i.e., we neglect differences between the precise and approximate positions of the Crab Pulsar in the sine and cosine terms). We use astropy <cit.> to calculate the barycentric positions. As mentioned in Section <ref>, SE_CAND3 is identified also in the VLBA calibrator survey and is likely an active galactic nucleus. We compared the differences in relative positions of SE_CAND3 and NE_CAND4 between the epochs. We found these to be roughly consistent with zero and thus conclude NE_CAND4 likely also is extragalactic in origin. As NE_CAND4 is much weaker than SE_CAND3 and its position measurements are much less reliable, we will only use SE_CAND3 in our parallax and proper motion fits below. Our preliminary fit, including intra-epoch errors (see Section <ref> and Table <ref>), yielded a parallax π=0.54±0.03 mas and proper motion of (μ_α^∗, μ_δ) = (-11.31±0.03, 2.65±0.08) mas yr^-1. We find χ^2_ red=2.3, larger than the expected unity. This could simply reflect that we have very few degrees of freedom: in particular, the parallax fit is dominated by the four right ascension offsets, to which three parameters are fitted, leaving only a single degree of freedom. Indeed, <cit.> showed that with four epochs and one effective degree of freedom, the uncertainty on the uncertainty in the parallax can be significant. Still, we will assume conservatively that, instead, there are unmodeled systematic errors between epochs (“inter-epoch errors”). We estimate these at 0.04 mas and 0.14 mas, for right accession and declination respectively, the value that, added in quadrature to the measurement errors of both right ascension and declination in all epochs, gives a χ^2_ red=1 (see Table <ref>). The inter-epoch errors in right ascension and declination were taken to be roughly proportional to the beam size, as might be expected if the systematic effects are due to phasing errors[Our results suggest the error in declination may be overestimated. If we take errors that are the same in each coordinate, we find we require these to be 0.04 mas. With these, we find identical results except for a somewhat reduced final error in the proper motion in declination.]. With these, we derive the final fit results presented in Table <ref> and shown in Figures <ref> and <ref>. lrr[t] Astrometric Parameters 5 Parameter EVN Gaia DR3 π (mas) 0.53±0.06 0.51±0.08 μ_α^∗ (mas yr^-1)… -11.34±0.06 -11.51±0.10 μ_δ (mas yr^-1) 2.65±0.14 2.30±0.06 α_ J2000 5^h34^m31.93357^s 5^h34^m31.933561(5)^s δ_ J2000 220052.1927 220052.19236(6) d (kpc) 1.90^+0.22_-0.18 1.96^+0.36_-0.26 v_⊥ (km s^-1) 104^.0+13_.0-11 109^.0+21_.0-15 Shown are both our results and those from Gaia. Distances are calculated directly from the parallax measurements and the transverse velocity v_⊥ is inferred from the proper motion and inferred distance. Coordinates listed here are in the J2000 ICRS frame at MJD 57680 (our reference epoch), with the uncertainties in our EVN results dominated by the uncertainty in the position of our reference source (∼1 mas, see text), and those for Gaia given by the values in parentheses. We also split the EK036 A observation in half in time and use the source position fits obtained from each half as independent measurements in a new fit for the parallax and proper motion. We find no significant changes in our fit parameters; however, the error on the parallax reduces a little and there is less of a need for an inter-epoch contribution. Since this may just be a statistical fluke, we continue with our regular solution below. One possible cause of systematic errors between epochs might be residual ionospheric errors between the pulsar and SE_CAND3. To give a sense of the size of the error from differences between the mean path length through the ionosphere, we find from CDDIS TEC maps that the average residual vertical TEC between antennas for SE_CAND3 relative to the pulsar is ∼0.02 TECU. Though the resolution and accuracy of the TEC maps are poor, if we take the residual vertical TEC at face value, this translates to an extra path length of ∼0.3 cm, which, if systematic over all telescopes, might induce position offsets of up to ∼0.06 mas, comparable to the inter-epoch errors we infer. Indeed, in Appendix <ref>, we show that the inclusion of residual ionosphere correction from TEC map information results in shifts in position of this order of magnitude. We also find this leads to somewhat smaller inferred inter-epoch error and thus smaller uncertainties in the astrometric parameters, but do not feel confident enough in these results to use them (see Appendix <ref>). Another source of systematic error may come from refraction in the interstellar medium. This will affect both the calibrators and the pulsar, but differently. For an estimate, we use that <cit.> measured an scattering disk with full width at half maximum varying between 0.5-1.3 mas at 18 cm. The variability suggests that at times the screen is asymmetric, which would lead to position offsets if not accounted for. If this induces relative position shifts of order 10% of the width, which seems not unreasonable, it would induce offsets of ∼0.05 mas, the right order of magnitude to account for the possible systematic errors between epochs. Finally, in our source images we see no apparent jets or other structures that could induce positional errors. However, we note that <cit.> found that for SE_CAND3, the measured angular core size appeared to vary between ∼0.07 and 1.56 mas at 4-8 GHz for two observations separated by 2.6 yr. If real, this variability might also change the centroid by amounts comparable to the systematic errors we infer between epochs. § RESULTS We measure a parallax of π=0.53±0.06 mas for the Crab Pulsar and infer a distance of d=1.90^+0.22_-0.18 by taking the reciprocal of the measured parallax (we do not attempt to correct for <cit.> bias, as it is not clear what the prior likelihood of finding a supernova remnant at a given height above the galactic plane would be). From our best-fit proper motion and inferred distance, we also derive a transverse velocity of v_⊥=104^+13_-11 km s^-1. Using the coordinates of SE_CAND3 (WFCS J0535+2156; ), α_ J2000 = 5^h35^m06.34125^s, δ_ J2000 = 215649.1045, in the J2000 International Celestial Reference System (ICRS) frame, we determine the absolute position of the Crab Pulsar, in the same reference frame, at MJD 57680, as, α_ J2000 = 5^h34^m31.93357^s, δ_ J2000 = 220052.1927. The uncertainty in our position for the Crab Pulsar is dominated by the uncertainty in the position of SE_CAND3. The formal errors are ±0.6 mas in each coordinate, but those are for the positions measured at 4-8 GHz and we have not accounted for possible frequency dependent core-shifts, which typically are of order 1 mas <cit.>. Hence, we estimate the uncertainties in the position at ∼1 mas in each coordinate. Our measured and derived values are presented in Table <ref>. Comparing our results with those of Gaia DR3, listed also in Table <ref>, we find good agreement for the parallax but some tension for the proper motion. To investigate this further, we show confidence ellipses of our parallax and proper motion along with those from Gaia DR3 in Figure <ref>. One sees that the main discrepancy is for the proper motion in declination. Our measurements are less sensitive in declination, since most EVN telescopes are spread East-West, with most of the North-South constraint coming from Hartebeesthoek. Thus, we may still underestimate the uncertainty of the proper motion in declination. Fortunately, this should not affect the parallax: since the Crab Pulsar is near the ecliptic, the parallax barely correlates with the proper motion in declination. It has some correlation with proper motion in right ascension, and, taking our error ellipse and that of Gaia DR3 at face value, a slightly lower parallax might be inferred. We note that systematic effects may affect not just our measurement (see above), but also the Gaia DR3 astrometry of the Crab Pulsar. Indeed, the values for the proper motion presented in Gaia DR2 and DR3 differ significantly (see Section <ref>). For the parallax, there is a possible overall zero-point correction, but this is a small effect: applying the correction of -0.03 mas from <cit.> to the raw Gaia DR3 parallax from Table <ref>, yields π=0.54±0.08 mas (and an inferred distance of d=1.86_-0.24^+0.32), which still agrees well with our measured and inferred results. Another possible systematic effect is due to source color. In Gaia DR3, a 6-parameter fit including the pseudo-color was used for the astrometry, and the solution shows fairly strong covariance between the pseudo-color and the proper motion. According to <cit.>, for cases where strong correlation is seen, independent colour information may significantly improve precision and accuracy. Here, one would have to be somewhat careful, since the Crab Pulsar's spectrum is not like that of regular stars, for which the color corrections are calibrated. Finally, it also seems possible that the variable optical emission surrounding the Crab Pulsar, such as the wisp-like structures moving outwards from the pulsar, and halos and knots close to it <cit.>, might induce positional offsets that could affect the astrometry. We conclude that in both optical and radio it will be useful to analyze further observations and try to carefully account for potential biases and systematic effects. § FUTURE WORK Our pilot study shows that it is possible to measure the parallax of the Crab Pulsar with VLBI. It should be relatively straightforward to improve the measurement down to the ≲5% level with further VLBI observations. The EVN's extended East-West baseline is particularly useful for constraining the parallax of the Crab Pulsar as the synthesized beam is narrower in right ascension and the pulsar is very close to the ecliptic. More observations should be scheduled around October and March when the parallax signature would peak in right ascension. Future observations should try to include more small dishes to give maximum sensitivity for the in-beam extragalactic reference sources. Furthermore, the pointing center can be shifted towards SE_CAND3 and NE_CAND4 (e.g. centroid of all sources) to boost the signal of those sources. With the higher sensitivity, NE_CAND4 should become more useful in helping to constrain and verify the astrometry. The addition of NE_CAND4 may also allow one to use the MultiView technique <cit.>, or variants thereof (e.g. ), which has shown success in improving residual spatial ionospheric corrections. We have shown that our technique of using giant pulses to determine fringe and bandpass solutions works exceedingly well for self-calibration, removing the need to observe phase calibrators. Our estimates of systematic effects between epochs suggests it is better to have a larger number of observations rather than to have longer ones. However, since the intra-epoch error for EK036 A is quite a bit smaller than in EK036 B-D, one would not want to reduce the time too much. With more observations and better time coverage, the error analysis could be improved, e.g., using a bootstrap fit like was done by <cit.>. Overall, we suggest at least 8 to 9 observations, each lasting at least 2 hr in order to ensure sufficient uv coverage. If the detection rate of strong giant pulses remain high enough for self-calibration, it may be better to observe at slightly higher frequencies, say ∼2 GHz, to reduce the effects of ionospheric variations and interstellar scattering. Calibration of both scattering and residual ionospheric effects would be helped by simultaneous dual-frequency or wide-band (⪆350 MHz) observations <cit.>. These wider-band observations may allow for an alternative measurement of the small differences in contributions from the ionosphere between the Crab Pulsar and the in-beam calibrators and improve on the application of TEC maps described in Appendix <ref>. Of course, ionospheric errors can also be reduced by trying to schedule observations when the solar cycle is at its minimum. Our technique of self-calibration using giant pulses should also help future studies of the Crab Pulsar's environment, such as the flaring regions within the Crab Nebula studied by <cit.>. Furthermore, the technique may also be useful for measuring distances to other giant pulse emitters such PSR J1824-2452A <cit.> and PSR J1823-3021A <cit.>, as well as to bright rotating radio transients[<http://astro.phys.wvu.edu/rratalog/>] such as PSR J1819-1458 and PSR J1840-1419, which have bursts every ∼3.4 min and ∼1.3 min, respectively <cit.>. For PSR J1824–2452A and PSR J1823-3021A, which are both in globular clusters, using their pulses for phase calibration would also aid searches of further globular cluster pulsars and other radio emitters. Similarly, applying our technique to the Crab Pulsar twin PSR J0540-6919, which also exhibits giant pulses <cit.>, may help searches of new radio sources in the Large Magellanic Cloud. Our cleaned images in FITS format are made available as a dataset at[10.5281/zenodo.7910778]10.5281/zenodo.7910778. The raw baseband data along with our custom scripts are available upon request[As the baseband data were correlated by us and not by the JIVE team, the visibility products are not available on the EVN Data Archive.]. § ACKNOWLEDGEMENTS We thank Cees Bassa for his contribution to the EVN proposal and the anonymous referee for useful comments. R.L. thanks Aard Keimpena, Bob Campbell, Benito Marcote, and Marjolein Verkouter for useful advice on using and JIVE post-processing tools. R.L. thanks the National Radio Astronomy Observatory (NRAO) helpdesk for advice on using , including details of the structure of the various tables, and for providing access to the NRAO computing facilities. Computations were performed on the New Mexico Array Science Center (NMASC) cluster and the Niagara supercomputer at the SciNet HPC Consortium <cit.>. SciNet is funded by: the Canada Foundation for Innovation; the Government of Ontario; Ontario Research Fund - Research Excellence; and the University of Toronto. M.Hv.K. is supported by the Natural Sciences and Engineering Research Council of Canada (NSERC) via discovery and accelerator grants, and by a Killam Fellowship. F.K. acknowledges support from the Onsala Space Observatory for the provisioning of its facilities/observational support. The Onsala Space Observatory national research infrastructure is funded through Swedish Research Council grant No 2017-00648. U.-L.P. receives support from Ontario Research Fund-Research Excellence Program (ORF-RE), NSERC [funding reference Nos. RGPIN-2019-067, CRD 523638-18, 555585-20], Canadian Institute for Advanced Research (CIFAR), the National Science Foundation of China (grant No. 11929301), Alexander von Humboldt Foundation, and the National Science and Technology Council (NSTC) of Taiwan (111-2123-M-001, -008, and 111-2811-M-001, -040). The European VLBI Network is a joint facility of independent European, African, Asian, and North American radio astronomy institutes. Scientific results from data presented in this publication are derived from the following EVN project codes: EK036 A-D. The NRAO is a facility of the National Science Foundation operated under cooperative agreement by Associated Universities, Inc. astropy <cit.>, Baseband <cit.>, CALC10 <cit.>, CASA <cit.>, numpy <cit.>, matplotlib <cit.>, pulsarbat <cit.>, scipy <cit.>, SFXC <cit.>, tempo2 <cit.>. § DIFFERENTIAL IONOSPHERE CORRECTIONS USING TEC MAPS A source of error in our position measurements of the Crab Pulsar relative to our in-beam calibrators arises from slight differences in the total electron column (TEC) in the ionosphere between the different sources. Estimates of these differences can be made from TEC maps, as is becoming common in VLBI astrometry. While this use of TEC maps, including the underlying assumptions about the ionosphere, have not been fully validated (see ), we follow it to get a sense of the improvement that may be attainable. Since our giant-pulse based fringe solutions already include the contribution of the ionosphere towards the Crab Pulsar (along with delays introduced by antenna location, electronics, geometric models, etc.), we only need to apply a differential correction for the extragalactic sources. To determine the residual ionospheric corrections, we first download CDDIS TEC maps using 's function. We then use 's task to estimate the line-of-sight TEC from each antenna to each of our sources across each observation ( models the ionosphere as a thin shell at a constant height of 450 km). Using custom scripts, we then calculate the differential TEC between the Crab Pulsar and extragalactic sources for each antenna and write the residuals into our own compatible calibration tables. These new calibration tables are applied to the visibilities data of SE_CAND3 and NE_CAND4 using 's task (after applying the calibrations described in Section <ref>). We then create images and extract position offsets as in Sections <ref> and <ref>. We list the resulting offsets in Table <ref>, and fit these to our astrometric model (including intra- and inter-epoch errors estimated like in Sections <ref> and <ref>). We find a parallax of π=0.49±0.04 mas and proper motion of (μ_α,μ_δ)=(-11.41±0.05,2.54±0.11) mas yr^-1, i.e., values consistent with our results in Section <ref> and with Gaia DR3. We note that the uncertainties are slightly reduced, a consequence of the fit to the offsets being somewhat better, thus reducing the estimated inter-epoch error contribution to the uncertainties. While encouraging, we caution that with the small number of data points, a reduction by chance is not unlikely, in particular in the presence of possible other sources of systematic error such as refraction in the interstellar medium and source variability (see Section <ref>). As a further check on the reliability, we also tried applying TEC corrections when transferring calibrator solutions to the pulsar as above, but this time applying a differential correction for the pulsar. As the angular separations of the calibrator sources and pulsar are quite large and the calibrator/pulsar cycle is quite long, we also tried removing the ionospheric contributions towards the calibrators using the TEC maps before solving for the calibrator fringes (in the hopes that these new calibrator fringe solutions with slower time variations can be better extrapolated to the pulsar). We then applied TEC corrections towards the Crab Pulsar and the new calibrator fringe solution to the pulsar. Both methods resulted in similar quality images. If the corrections were good, we expect that with these solutions, the dirty images would improve, i.e., that we would see the Crab Pulsar becoming more point-like. However, we found that with the TEC corrections, the dirty images were of poorer quality (more smeared) than those shown in the top panels of Figure <ref>. Given this contradictory result, we concluded that without better understanding it was best not to use the above TEC-map assisted astrometry, even though it gave notionally better results. Since our “ionosphere corrected” SE_CAND3 and NE_CAND4 images may still be useful for future astrometry of the Crab Pulsar, we provide these (along with those from Figure <ref>) at [10.5281/zenodo.7910778]10.5281/zenodo.7910778. ccccc[t] Relative Positions between the Reference Sources and the Crab Pulsar, with Ionosphere Corrections applied. A.1 Observation 2cSE_CAND3 2cNE_CAND4 code Δα^∗ (mas) Δδ (mas) Δα^∗ (mas) Δδ (mas) EK036 A -478472.634±0.015±0.00±0.03 243085.61±0.04±0.08±0.09 -585690.03±0.14 -195268.3±0.3 EK036 B -478484.582±0.020±0.02±0.03 243088.27±0.06±0.14±0.09 -585702.12±0.20 -195265.3±0.5 EK036 C -478489.033±0.030±0.02±0.03 243088.92±0.09±0.10±0.09 -585706.43±0.18 -195264.2±0.4 EK036 D -478491.501±0.020±0.03±0.03 243089.78±0.09±0.09±0.09 -585708.26±0.19 -195261.8±0.5 Values and uncertainties are as for Table <ref>, except that here they were derived from data for which we tried to correct for differential ionospheric effects using TEC maps. aasjournal
http://arxiv.org/abs/2306.02527v1	20230605012349	Searching for Optimal Per-Coordinate Step-sizes with Multidimensional Backtracking	[ "Frederik Kunstner", "Victor S. Portella", "Mark Schmidt", "Nick Harvey" ]	math.OC	[ "math.OC", "cs.LG" ]	Using machine learning to find exact analytic solutions to analytically posed physics problems Sahel Ashhab July 31, 2023 ============================================================================================== The backtracking line-search is an effective technique to automatically tune the step-size in smooth optimization. It guarantees similar performance to using the theoretically optimal step-size. Many approaches have been developed to instead tune per-coordinate step-sizes, also known as diagonal preconditioners, but none of the existing methods are provably competitive with the optimal per-coordinate step-sizes. We propose multidimensional backtracking, an extension of the backtracking line-search to find good diagonal preconditioners for smooth convex problems. Our key insight is that the gradient with respect to the step-sizes, also known as hypergradients, yields separating hyperplanes that let us search for good preconditioners using cutting-plane methods. As black-box cutting-plane approaches like the ellipsoid method are computationally prohibitive, we develop an efficient algorithm tailored to our setting. Multidimensional backtracking is provably competitive with the best diagonal preconditioner and requires no manual tuning. When training machine learning models, tuning the hyperparameters of the optimizer is often a major pain point. For example, finding a reasonable step-size hyperparameter for gradient descent typically involves trial-and-error or a costly grid search. However, only so much improvement can be achieved by tuning the step-size. For ill-conditioned problems, per-coordinate step-sizes—or diagonal preconditioning—can drastically improve convergence. This has motivated a wide variety of approaches specific to machine learning problems to adaptively find per-coordinate step-sizes. However, the community lacks clear definitions of what adaptive step-sizes are. The most well-known definition of adaptivity comes from online learning, where methods such as AdaGrad adapt to problem specific-constants without user input while maintaining strong guarantees, even in the adversarial setting. However, this resilience to adversaries is a double-edged sword. To satisfy this definition of adaptivity, AdaGrad monotonically decreases its step-sizes. As a result, it performs poorly on non-adversarial problems, and many follow-up methods have focused on working around this decreasing property. Methods commonly used in deep learning, such as RMSProp and Adam, are often motivated by analogy to AdaGrad, but without decreasing step-sizes. This change is crucial for their practical performance but nullifies their adaptivity guarantees, indicating that the online-learning definition of adaptivity might not capture what we want it to. Alternative approaches to tune per-coordinate step-sizes during the course of optimization, such as adaptive gain and hypergradient methods, do not have a formal definition of what they are aiming to achieve, and are instead motivated from intuition alone. While showing promising practical performance in some settings, hypergradient methods are often unstable and can require as much babysitting as the original optimizer they are tuning. The lack of a well-defined objective makes comparison of those methods purely empirical, and the field lacks direction on how to improve on the state-of-the-art. However, there is an alternative definition of adaptivity in smooth optimization, where the standard approach to tuning the step-size is to do a backtracking line-search. Applied to gradient descent, this line-search guarantees that the step-size is within a constant factor of the best theoretical step-size. But this method is often overlooked as it only capture adaptivity of a single step-size. Contribution. We propose multidimensional backtracking, a method analogous to a backtracking line-search that automatically finds per-coordinate step-sizes while running gradient descent. The main difficulty in extending the line-search to higher dimensions is that the signal used to search for a good scalar step-size, that the step-size is “too big”, is insufficient to efficiently search over per-coordinate step-sizes. Our key insight is that the gradient with respect to the step-sizes can be used in conjunction with a cutting-plane method to make this search feasible in high dimensions, and we develop a cutting-plane method tailored to the problem with minimal overhead. We show that our method has a similar guarantee as line-search, in that its convergence rate is within a O(1/√(d)) factor of preconditioned gradient descent with the optimal, but unknown, diagonal preconditioner. § INTRODUCTION When training machine learning models, tuning the hyperparameters of the optimizer is often a major challenge. For example, finding a reasonable step-size hyperparameter for gradient descent typically involves trial-and-error or a costly grid search. In smooth optimization, a common approach to set the step-size without user input is a backtracking line-search: start with a large step-size, and decrease it when it is too big to make sufficient progress. For ill-conditioned problems, however, there are limits to the improvement achievable by tuning the step-size. Per-coordinate step-sizes —also known as diagonal preconditioners— can drastically improve performance. Many approaches have been developed to automatically tune per-coordinate step-sizes. Those are often described as “adaptive” methods, but the meaning of this term varies widely, from describing heuristics that set per-coordinate step-sizes, to ensuring performance guarantees as if a particular property of the problem were known in advance. Yet, even on the simplest case of a smooth and strongly convex deterministic problem where a good fixed diagonal preconditioner exists (i.e., one that reduces the condition number), none of the existing adaptive methods are guaranteed to find per-coordinate step-sizes that improve the convergence rate. We discuss approaches to adaptive methods in the next section. Contribution. We propose multidimensional backtracking, an extension of the standard backtracking line-search to higher dimension, to automatically find good per-coordinate step-sizes. Our method recovers the convergence rate of gradient descent with the optimal preconditioner for the problem, up to a √(2d) factor where d is the number of coordinates. This is a direct generalization of the line-search guarantee, with a penalty depending on dimension due to the extra degrees of freedom, as expected. The main difficulty in extending the line-search to higher dimensions is that when searching for a scalar step-size, all we can check is whether the step-size is “too big”. This is insufficient to efficiently search over per-coordinate step-sizes. Our key insight is that the gradient with respect to the step-sizes can be used in conjunction with a cutting-plane method to make this search feasible in high dimensions. §.§ Adaptive step-sizes and preconditioning methods Adaptive and parameter-free methods in online learning are an example where adaptive methods have a well-defined meaning. AdaGrad <cit.> and Coin Betting <cit.> can adapt to problem-specific constants without user input and have strong guarantees, even in the adversarial setting. However, this resilience to adversaries is a double-edged sword; to satisfy this definition of adaptivity, AdaGrad uses monotonically decreasing step-sizes. While AdaGrad still converges at the desired asymptotic rate on smooth, Lipschitz functions <cit.>, its performance can be worse than plain gradient descent. This motivated investigations of workarounds to avoid the monotonically decreasing updates, including augmenting the update with an increasing step-size schedule <cit.>, a line-search <cit.>, or modifying the update to the preconditioner <cit.>. Methods commonly used in deep learning, such as RMSProp and Adam <cit.>, are often motivated as adaptive by analogy to AdaGrad, but without decreasing step-sizes <cit.>. This change is crucial for their practical performance, but nullifies their online-learning adaptivity guarantees. Adaptive gain and hypergradient heuristics. Many heuristics that tune the hyperparameters of the optimization procedure use the gradient with respect to the hyperparameters, or hypergradients <cit.>. Methods have been proposed to tune the step-size <cit.>, a preconditioner <cit.>, any hyperparameter <cit.>, or to maintain a model of the objective <cit.>. “Stacking” such optimizers recursively has been shown to reduce the dependency on user-specified hyperparameters in practice <cit.>. This idea pre-dates the hypergradient nomenclature; <cit.> presents a method to update the step-size based on the sign of successive gradients, and <cit.> presents a control perspective for per-coordinate step-sizes, which can be cast as a hypergradient update to a diagonal preconditioner.[ The hypergradient with respect to a diagonal preconditioner =() is, by the chain rule, the element-wise product (⊙) of subsequent gradients, - ∇_ f( - () ∇ f()) = ∇ f() ⊙∇ f( - () ∇ f()). ] This approach has led to adaptive gain methods such as Delta-Delta and variants <cit.>, and further developed using the sign of the hypergradient <cit.>, full-matrix updates <cit.>, a larger history <cit.>, updates in log-space <cit.>, heuristics to adjust the outer step-size <cit.>, or multiplicative weight updates <cit.>. While showing promising practical performance in some settings, existing methods are often motivated from intuition rather than a formal definition of adaptivity, giving no guarantee that the tuned method will converge faster, if at all. Indeed, hypergradient methods are often unstable, and may require as much manual tuning as the original optimizer they are intended to tune. Second-order methods. A classical approach to preconditioning is to use second-order information, as in Newton's method or its regularized variants <cit.>. To avoid the load of computing and inverting the Hessian, quasi-Newton methods <cit.> such as L-BFGS <cit.> fit an approximate Hessian using the secant equation. Variants using diagonal approximations have also been proposed, framed as Quasi-Cauchy, diagonal BFGS, or diagonal Barzilai-Borwein methods <cit.>, while other methods use the diagonal of the Hessian <cit.>. Some second-order and quasi-Newton methods converge super linearly (although not the diagonal or limited memory variants used in practice), but those guarantees only hold locally when close to the minimum. To work when far from a solution, those methods require “globalization” modifications, such as regularization or a line-search. Unfortunately, analyses of second-order methods do not capture the global benefit of preconditioning and instead lead to worse rates than gradient descent, as in the results of <cit.>, <cit.>, <cit.>, <cit.>, <cit.>, or <cit.>. Line-searches. Adaptivity in smooth optimization is most closely related to line-searches. The standard guarantee for gradient descent on a L-smooth function requires a step-size of 1/L, but L is typically unknown. The backtracking line-search based on the Armijo condition <cit.> approximately recovers this convergence guarantee by starting with a large step-size, and backtracking; halving the step-size whenever it does not yield sufficient improvement. However, line-searches are often overlooked in the discussion of adaptive methods, as they do not provide a way to set more than a scalar step-size. While line-searches can be shown to work in the stochastic overparameterized setting and have been applied to train neural networks <cit.>, improvements beyond backtracking have been limited. Additional conditions <cit.>, non-monotone relaxations <cit.>, or solving the line-search to higher precision <cit.> can improve the performance in practice, but even an exact line-search cannot improve the convergence rate beyond what is achievable with a fixed step-size <cit.>. §.§ Summary of main result: adaptivity to the optimal preconditioner Our approach is inspired by the work discussed above, but addresses the following key limitation: none of the existing methods attain better global convergence rates than a backtracking line-search. Moreover, this holds even on smooth convex problems for which a good preconditioner exists. We generalize the backtracking line-search to handle per-coordinate step-sizes and find a good preconditioner. As in quasi-Newton methods, we build a preconditioner based on first-order information. However, instead of trying to approximate the Hessian using past gradients, our method searches for a preconditioner that minimizes the objective function at the next step. Our convergence result depends on the best rate achievable by an optimal diagonal preconditioner, similarly to how methods in online learning are competitive against the best preconditioner in hindsight. However, our notion of optimality is tailored to smooth strongly-convex problems and does not require decreasing step-sizes as in AdaGrad. Our update to the preconditioner can be interpreted as a hypergradient method, but instead of a heuristic update, we develop a cutting-plane method that uses hypergradients to guarantee a good diagonal preconditioner. Our main theoretical contribution is summarized below. On a smooth, strongly-convex function f in d dimensions, steps accepted by multidimensional backtracking guarantee the following progress f(_t+1) - f(_) ≤1-1/√(2d)1/κ_ (f(_t) - f(_)), where κ_ is the condition number achieved by the optimal preconditioner defined in <Ref>. The number of backtracking steps is at most linear in d and logarithmic in problem-specific constants. Multidimensional backtracking finds per-coordinate step-sizes that lead to a provable improvement over gradient descent on badly conditioned problems that can be improved by diagonal preconditioning, i.e., if the condition number of f is at least √(2d)·κ_. Moreover, this guarantee is worst-case, and multidimensional backtracking can outperform the globally optimal preconditioner by finding a better local preconditioner, as illustrated on an ill-conditioned linear regression problem in <Ref>. To find a competitive diagonal preconditioner, we view backtracking line-search as a cutting-plane method and generalize it to higher dimensions in <Ref>. In <Ref> we show how to use hypergradients to find separating hyperplanes in the space of preconditioners, and in <Ref> we develop an efficient cutting-plane methods tailored to the problem. In <Ref>, we illustrate the method through preliminary experiments and show it has consistent performance across problems. Notation. We use standard font weight d, n, α for scalars, bold , for vectors, and capital bold , for matrices. We use [i] for the i-th entry of , ⊙ for element-wise multiplication, and ^2 for ⊙. ⊙ for element-wise multiplication, and ^2 for ⊙. We use = () to denote the diagonal matrix with diagonal , and = () to denote the vector of diagonal entries of . We say is larger than , ≽, if - is positive semidefinite. If = (), = (), the ordering ≽ is equivalent to [i] ≥[i] for all i, which we write ≥. We use for the identity matrix and for the all-ones vector. § OPTIMAL PRECONDITIONING AND SUFFICIENT PROGRESS Consider a twice-differentiable function f ^d→ that is L-smooth and μ-strongly convex,[ While we use strong-convexity and twice-differentiability of f to define the optimal preconditioner, those assumptions can be relaxed to only rely on the PL inequality <cit.> (see <ref>).] i.e., μ1/2- ^2 ≤f() - f() - ∇f(), - ≤L 1/2- ^2, for all , , or μ≼∇^2 f() ≼ L for all . We measure the quality of a preconditioner by how tightly it approximates (∇^2 f())^-1. We define an optimal diagonal preconditioner for f as ∈_≽0, diagonal κ such that 1/κ^-1 ≼∇^2 f()≼^-1 for all , and denote by κ_ the optimal κ above. <ref> is equivalent to minimizing κ(^1/2∇^2f()^1/2), a known measure of the convergence rate of preconditioned methods <cit.>, and reduces to the definition of optimal preconditioning for linear systems <cit.> when f is quadratic. Alternatively, the optimal preconditioner can be viewed as the matrix such that f is 1-smooth and maximally strongly-convex in the norm ^2_^-1 = ,^-1, 1/κ_ 1/2- ^2_^-1 ≤f() - f() - ∇f(), - ≤1/2- ^2_^-1, for all , . Similar definitions of smoothness and strong-convexity relative to a matrix are common in coordinate descent methods <cit.>, where the matrices are assumed to be known a priori. If we knew , preconditioned gradient descent using would converge at the rate fx - ∇f() - f(_) ≤1 - 1/κ_ (f() - f(_)), where _ minimizes f. We do not know and will be searching for a good approximation. For the standard backtracking line-search on L-smooth functions, the goal is to find a step-size that works as well as 1/L without knowledge of L. To do so, we can start with a large step-size α≫1/L and check the Armijo condition: the step-size α makes progress as if f were 1/α-smooth, that is, f(- α∇f()) ≤ f() - α1/2∇f()^2. If the condition is satisfied, we take the step - α∇ f(). By the descent lemma, <cit.>, the condition is satisfied if α≤1/L. So if the condition fails, we know α is too large and can decrease α. For diagonal preconditioners, the Armijo condition checks whether the preconditioner makes sufficient progress in the norm induced by ^-1, as if f were 1-smooth in <ref>, that is, f(- ∇f()) ≤f() - 1/2∇f()^2_. As with a scalar step-size, sufficient progress holds for any matrix that satisfies ∇^2 f() ≼^-1. § MULTIDIMENSIONAL BACKTRACKING The typical presentation of the backtracking line-search maintains a step-size and decreases it when the Armijo condition fails <cit.>. We instead take the following non-standard view, which generalizes more naturally to high dimension; as maintaining a set containing the optimal step-size, and using bisection to narrow down the size of the set. Starting with an interval = [0, α_max] containing 1/L, we pick a candidate step-size α by “backtracking” by γ < 1 from the largest step-size in , taking α = γα_max to balance two properties; * Large progress: If the candidate step-size satisfies the Armijo condition and the step is accepted, the value of f decreases proportionally to α as in (<ref>). To maximize the progress, γ should be large. * Volume shrinkage: If the candidate step-size fails the Armijo condition, we learn that α > 1/L and can cut the interval to ' = [0, γα_max]. To ensure the interval shrinks fast, γ should be small. Taking γ = 1/2 balances both properties; α is at least 1/2 as large as any step-size in , and we can halve the interval if the Armijo condition fails. We do not use α_max as a candidate since, although the largest in , it would give no information to update the interval in case it failed the Armijo condition. For multidimensional backtracking, we can check whether a candidate preconditioner yields sufficient progress with <ref> instead of the Armijo condition, and replace the intervals by sets of diagonal preconditioners. The high-level pseudocode is given in <ref>, where each iteration either leads to an improvement in function value or shrinks the sets of potential step-sizes/preconditioners. To complete the algorithm, we need to define the steps marked as (†) to select preconditioners that lead to large progress when the step is accepted, while significantly reducing the search space when the preconditioner does not yield . For computational efficiency, we want methods that take O(d) time and memory like plain gradient descent. §.§ Guaranteed progress competitive with the optimal preconditioner We start by formalizing the progress guarantee. If satisfies the Armijo condition (<ref>) at _t, the function value decreases by at least ∇ f(_t)_^2. If we can guarantee that ∇ f(_t)_^2 ≥γ∇ f(_t)_^2 for some γ > 0, we can recover the convergence rate of gradient descent preconditioned with up to a factor of γ. However, we do not know , but know a set _t that contains preconditioners we have not yet ruled out, including . To guarantee that is competitive with , we can enforce that is competitive with all the preconditioners in _t, as captured by the following definition. A matrix ∈_t is γ-competitive in _t, for a gradient ∇ f(_t), if ∇ f(_t)_^2 ≥γ∇ f(_t)_^2 for any ∈_t. If is γ-competitive, then it is competitive with as max_∈_t∇ f(_t)_^2 ≥∇ f(_t)_^2. However, this is a strong requirement. To illustrate what competitive ratios are attainable, we show in <ref> that even the optimal preconditioner might only be 1/d-competitive, as other preconditioners can lead to more local progress depending on ∇ f(_t), whereas is a fixed global optimal preconditioner. This also suggests that selecting a preconditioner that guarantees more local progress may lead to better performance, which we take advantage of to ensure a γ = 1/√(2d) competitive ratio. To see how to ensure a competitive ratio, consider the case where contains diagonal preconditioners whose diagonals come from the box () ∈^d≤. To select a candidate preconditioner that is γ-competitive in , we can backtrack from the largest vector in () by some constant γ < 1, and take = γ(). While a large γ leads to more progress when the step is accepted, we will see that we need a small γ to ensure the volume shrinks when the step is rejected. We can obtain the convergence rate of <Ref> depending on γ and the optimal preconditioned condition number κ_ if we ensure ∈_t and that is γ-competitive for all t. Let , κ_* be an optimal preconditioner and condition number for f (<ref>). If the set _t from the algorithm in <Ref> contains , and ∈_t is γ-competitive (<Ref>), then f(_t+1) - f(_) ≤1 - γ/κ_ f(_t) - f(_) whenever the candidate step leads to sufficient progress and is accepted. The proof relies on three inequalities. (1) The iterate _t+1 yields sufficient progress (Eq. <ref>), (2) any accepted preconditioner is γ-competitive in _t and thus with , and (3) f is 1/κ_-strongly convex in ·_^-1, which implies κ_* 1/2∇ f(_t)^2_≥ f(_t) - f(_). Combining those yields f(_t+1) (1)≤ f(_t) - 1/2∇f(_t)_^2 (2)≤ f(_t) - γ1/2∇f(_t)_^2 (3)≤ f(_t) - γ/κ_* f(_t) - f(_). Subtracting f(_) on both sides yields the contraction guarantee. § SEPARATING HYPERPLANES IN HIGHER DIMENSIONS In one dimension, if the step-size α does not satisfy the sufficient progress condition (<ref>), we know α > 1/L and can rule out any α' ≥α. We are looking for a generalization to higher dimensions: if the queried preconditioner fails the condition, we should be able to discard all larger preconditioners. The notion of valid preconditioners formalizes this idea. A preconditioner is valid if ^1/2∇^2 f()^1/2≼ for all , which guarantees that satisfies the condition, and invalid otherwise. Validity is a global property: a preconditioner might lead to sufficient progress locally but still be invalid. Using the partial order, if is invalid then any preconditioner ' ≽ is also invalid. However, this property alone only discards an exceedingly small portion of the feasible region in high dimensions. Consider the example illustrated in <Ref>: if the diagonals are in a box (), the fraction of volume discarded in this way if (1/2)() is invalid is only 1/2^d. To efficiently search for valid preconditioners, we show that if f is convex, then the gradient of the condition gives a separating hyperplane for valid preconditioners. That is, it gives a vector ∈^d such that if ∈^d satisfies , > 1, then () is invalid, as illustrated in <Ref>. We use the following notation to denote normalized half-spaces: _>() ∈^d , > 1 and _≤() {∈^d : , ≤1}. Suppose =() ≻ 0 does not lead to at , and let h() be the gap in the sufficient progress condition, h() f(- ∇f()) - f() + 12∇f()_^2 > 0. Then () for any in the following half-space satisfies h() > 0 and is also , ∈^d ∇h(), > ∇h(), - h(), This half-space is equal to _>() with given by = ∇ h()/∇ h(), - h(), or (1/2- ^+) ⊙/ f() - ^+, - f(^+) , with { ^+ - ∇f(), (, ^+) (∇f(), ∇f(^+)). . If f is convex, then h also is. Convexity guarantees that h() ≥ h() + ∇ h(), - for any . A sufficient condition for h() > 0, which means is invalid, is whether h() + ∇ h(), - > 0 holds. Reorganizing yields <ref>, and <ref> expresses the half-space in normalized form, _>(), expanding h in terms of f, its gradients, and . The half-space in <ref> is however insufficient to find good enough cutting-planes, as it uses convexity to invalidate preconditioners but ignores the ordering that if is , any ' ≽ is also . If such preconditioners are not already ruled out by convexity, we can find a stronger half-space by removing them, as illustrated in <Ref>. We defer proofs to <ref>. If _>() is a half-space given by <ref>, then _>() where max{, 0} element-wise is a stronger half-space in the sense that _>() ⊆_>(), and _>() contains only invalid preconditioners. § CUTTING-PLANE METHODS The multidimensional backtracking method is in fact a cutting-plane method that uses separating hyperplanes (from <Ref>) to search for valid preconditioners. The canonical example is the ellipsoid method <cit.>, but its computational cost is Ω(d^2) in ℝ^d. We now describe cutting-plane methods with three desirable properties: the preconditioners have good competitive ratios, the feasible set shrinks significantly when backtracking, and the computational cost is O(d). There are many details, but the overall idea is similar to the ellipsoid method. A simple warm-up: boxes. Consider the case when _0 consists of diagonal matrices with diagonals in the box (_0) = ∈^d≤_0. We pick a candidate preconditioner by backtracking from the largest point in (_0) by some constant γ < 1, taking γ(_0). If satisfies the Armijo condition (<ref>), we take a gradient step. If it does not, we compute the vector _0 as in <ref>, and obtain a half-space _>(_0) that contains only invalid preconditioners. We then know we only need to search inside _0 ∩_≤(_0). However, maintaining the set _0 ∩_≤(_0) ∩⋯∩_≤(_t) would be too complex to fit in O(d) time or memory. To reduce complexity, we define _t+1 as the box (_t+1) of minimum volume containing (_t) ∩_≤(_t), as illustrated in <ref>. Due to this restriction, we might not be able to find a smaller set; the original box (_t) may already be the minimum volume box containing (_t) ∩_≤(_t) if _t does not cut deep enough, as illustrated in <ref>. However, with enough backtracking (γ < 1/d), we can show that the new box is smaller. This yields the following subroutines to fill in the gaps of <ref> (detailed in <ref>) (_t, γ, _t) γ(_t), (_t, ) ()_t ∈(_t+1), where _t = (_t) and _t+1min_t, 1/_t element-wise, which give the following guarantees. Consider the multidimensional backtracking from <Ref> initialized with a set _0 = ()∈(_0) containing , with the subroutines in <ref> with γ = 1/2d. Then: (a) ∈_t, (b) the candidate preconditioner is 1/2d-competitive in _t for any t, and (c) ((_t+1)) ≤1/d+1 ((_t)) when fails <ref>. In particular, is not called more than d log_d+1(L _0_∞) times. To guarantee that the box shrinks, we have to guarantee that the half-space _≤(_t) cuts deep enough. We know that the half-space has to exclude the query point , i.e. _t, _t≥ 1, by <ref> and that _t ≥ 0 by <ref>. Querying sufficiently close to the origin, by taking γ = 1/2d, is then enough to guarantee the decrease. To bound the total number of cuts, we note that the sets (_t) have a minimum volume _min, as they have to contain the valid preconditioners. The number of cuts is at most log_c((b_0))/_min for c = d+1. We then bound ((b_0)) ≤_0_∞^d and _min≥1/L^d as (1/L) is a valid preconditioner. §.§ Multidimensional Backtracking with Centered Axis-aligned Ellipsoids We now improve the competitive ratio from O(1/d) to O(1/√(d)) by switching from boxes to ellipsoids. Whereas general ellipsoids would require Ω(d^2) complexity (as they involve a d × d matrix), we consider centered, axis-aligned ellipsoids, defined by a diagonal matrix = (), of the form () {∈^d : _≤ 1}, where _^2 = ,. As preconditioners are non-negative, we consider only the positive orthant of the ellipsoid. For simplicity, we refer to those sets as ellipsoids. Candidate preconditioner. In the box example, we selected the candidate preconditioner by backtracking from the largest preconditioner in the box. With an ellipsoid, there is no largest preconditioner. We need to choose where to backtrack from. To ensure the candidate preconditioner is competitive (<Ref>), we backtrack from the preconditioner that maximizes the progress ∇ f()_^2, _∈() ∇f()_^2 = ^-1 ∇f()^2/∇f()^2_^-1, where ∇f()^2 ∇f() ⊙∇f(). This lets us pick the preconditioner that makes the most progress for the current gradient, and will let us improve the competitive ratio by allowing a backtracking coefficient of 1/√(d) instead of 1/d. Cutting. To complete the algorithm, we need to find a new set (_t+1) with smaller volume which contains the intersection of the previous set (_t) and the half-space _≤(_t). Unlike the box approach, the minimum volume ellipsoid has no closed form solution. However, if we backtrack sufficiently, by a factor of γ < 1/√(d), we can find an ellipsoid guaranteed to decrease the volume. Consider the ellipsoid () defined by = () for ∈^d. Let ∈() be a point sufficiently deep inside the ellipsoid, such that _≤1/√(2d), and _>() be a half-space obtained from <ref> at . The intersection () ∩()_≤ is contained in the new ellipsoid (^+(, )), where ^+(, ) = λ+ (1 - λ) ^2, λ= ℓ/d d-1/ℓ-1, ℓ= _^-1^2, which has a smaller volume, ((^+(, )) ≤ c (()), where c = √(e)/√(2)≈ 0.91. The new ellipsoid in (<ref>) is a convex combination between () and the minimum volume ellipsoid containing the set ∈^d, \|\|≤ 1 where \|\| is the element-wise absolute value of . The choice of λ in (<ref>) is not optimal, but suffices to guarantee progress as long as _ is small. A similar approach was used by <cit.> to approximate submodular functions, although they consider the polar problem of finding a maximum-volume enclosed ellipsoid. The full proof and discussion on the connections to the polar problem are deferred to <Ref>. To improve the cuts, we can refine the estimate of λ in <ref> by minimizing the volume numerically. We include this modification, detailed in <ref>, in our experiments in <ref>. Overall guarantees. We can now define the two subroutines for the ellipsoid method, and obtain the main result that we stated informally in <Ref>, by combining the guarantees of the ellipsoid approach with the convergence result of <ref>. Consider the multidimensional backtracking from <Ref> initialized with the set _0 = ()∈(_0) containing , given by some scaling α_0 > 0 of the uniform vector, _0 = α_0. For _t, let _t = (_t). Define the subroutines = (_t, γ, _t) γ_t^-1 ∇f(_t)^2∇f(_t)^2__t^-1, (_t, ) ()∈(^+(_t, _t)), where _t is the vector given by <Ref> when fails the Armijo condition at _t, and ^+ is computed as in (<ref>). If γ = 1/√(2d), then: (a) ∈_t for all t, (b) the candidate preconditioners are 1/√(2d)-competitive in _t, and (c) is called no more than 12 d log(L/α_0) times. § EXPERIMENTS To illustrate that multidimensional backtracking finds good preconditioners and improves over gradient descent on ill-conditioned problems even when accounting for the cost of backtracking, we run experiments on small but very ill-conditioned and large (d≈ 10^6) problems. As examples of adaptive gain and hypergradient methods, we include RPROP <cit.> and GD with a hypergradient-tuned step-size (GD-HD, with the multiplicative update). As examples of approximate second-order methods, we take diagonal BB <cit.> and preconditioned GD using the diagonal of the Hessian. We use default parameters, except for the hypergradient method GD-HD, where we use 10^-10 as the initial step-size instead of 10^-3 to avoid immediate divergence. We include AdaGrad (diagonal), but augment it with a line-search as suggested by <cit.>, to make it competitive in the deterministic setting. Line-searches and forward steps. For all methods that use a line-search, we include a forward step, a common heuristic in line-search procedures to allow for larger step-sizes when possible, although it can increase the number of backtracking steps. When a step-size or preconditioner is accepted, we increase the size of the set, allowing for larger (scalar or per-coordinate) step-sizes by a factor of 1.1. We measure performance per function and gradient evaluations to capture the cost of backtracking. On a small but extremely ill-conditioned problems, our method is the only one that gets remotely close to being competitive with preconditioning with the diagonal Hessian—while only using first-order information. The diagonal Hessian is very close to the optimal preconditioner for those problems. On the cpusmall dataset, it reduces the condition number from κ≈ 5· 10^13 to ≈ 300, while κ_* ≈ 150. All other methods struggle to make progress and stall before a reasonable solution is achieved, indicating they are not competitive with the optimal preconditioner. On large regularized logistic regression on News20 (d ≈ 10^6), gradient descent performs relatively better, suggesting the problem is less ill-conditioned to begin with (the regularized data matrix has condition number κ≈ 10^4). Despite the bound of O(d) backtracking steps, our methods finds a reasonable preconditioner within 100 gradient evaluations. Despite the high dimensionality, it improves over gradient descent when measured in number of oracle calls. Using plain gradient updates on the hyperparameters in GD-HD leads to unstable behavior, but diagonal BB and even RPROP, perform remarkably well on some problems —even outperforming preconditioning with the diagonal Hessian, which uses second-order information. However, they fail on other ill-conditioned problems, even when a good diagonal preconditioner exists. This pattern holds across other problems, as shown in <ref>. Multidimensional backtracking demonstrates robust performance across problems, a clear advantage of having worst-case guarantees. § CONCLUSION We designed multidimensional backtracking, an efficient algorithm to automatically find diagonal preconditioners that are competitive with the optimal diagonal preconditioner. Our work provides a definition of adaptive step-sizes that is complementary to the online learning definition. While online learning focuses on the adversarial or highly stochastic setting, we define and show how to find optimal per-coordinate step-sizes in the deterministic smooth convex setting. We show it is possible to build provably robust methods to tune a preconditioner using hypergradients. While our specific implementation uses cutting-planes, the general approach may lead to alternative algorithms, that possibly tune other hyperparameters, with similar guarantees. The main limitation of our approach is its reliance on the convex deterministic setting. The results might transfer to the stochastic overparametrized regime using the approach of <cit.>, but the non-convex case seems challenging. It is not clear how to get reliable information from a cutting-plane perspective using hypergradients without convexity. As the first method to provably find competitive preconditioners, there are likely modifications that lead to practical improvements while preserving the theoretical guarantees. Possible ideas to improve practical performances include better ways to perform forward steps, using hypergradient information from accepted steps (which are currently ignored), or considering alternative structures to diagonal preconditioners. We thank Aaron Mishkin for helpful discussions in the early stages of this work, and Curtis Fox and Si Yi (Cathy) Meng for providing comments on an early version of the manuscript. This research was partially supported by the Canada CIFAR AI Chair Program, the Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery Grants RGPIN-2022-03669, § REFERENCES [heading=none] height 4pt 0.25in - Supplementary Material 0.29in -height 1pt 0.09in Appendix Code available at https://github.com/fKunstner/multidimensional-backtrackinghttps://github.com/fKunstner/multidimensional-backtracking § FULL PSEUDOCODE OF THE ALGORITHMS We first give with a generic version using the subroutines , and , to be specialized for the backtracking line-search (<ref>), multidimensional backtracking using boxes (<ref>), and ellipsoids (<ref>). The generic pseudocode is written in terms of preconditioners, but also applies to the step-size version, which we can consider as looking for a preconditioner constrained to isotropic diagonal preconditioners, that is, preconditioners in the set {α : α∈}. Although we write the pseudocode maintaining at each iteration an abstract set of preconditioners , the only information the algorithm needs to maintain on each iteration for the implementation in the different cases is * For the line-search: the current maximum step-size α_max defining the interval of valid step-sizes, [0,α_max] such that the set of preconditioners is = {α : α∈ [0,α_max]}; * For multidimensional backtracking with boxes: the vector defining the maximum corner of the box () = {∈^d : ≤} used to define the candidate diagonals preconditioners in the set = {() : ∈()}; * For multidimensional backtracking with ellipsoids: the vector defining the axis-aligned ellipsoid () = {∈^d : , () ≤ 1} used to define the candidate diagonal preconditioners in the set = {() : ∈()}. The pseudocode in <ref> updates (_t, _t) to (_t+1, _t+1) at each iteration, and ensures that either the function value decreases, f(_t+1) < f(_t), or the volume decreases, (_t+1) < (_t). We give an alternative pseudocode in <ref>, which defines iterations as updates to the iterates _t that decrease the function value, and uses a -loop to backtrack. Since it more closely resemble standard ways backtracking line-search is described, some reader may find it easier to understand. We stress, however, that this is still the same algorithm as <ref> but written differently. The pseudocode in Figures <ref>–<ref>, are expressed in a modular form to highlight how the algorithm works and its similarity to a line-search. In <ref>, we give a more directly implementable pseudocode of multidimensional backtracking in both box and ellipsoid variants solely relying on vector notation. §.§ Subroutines for standard backtracking line-search Implementation of the subroutines for the standard backtracking line-search. Although written in terms of sets, the algorithm only needs to maintain the maximum step-size in the interval [0, α_max] at each iteration. The corresponding preconditioners are the matrices = {α : α∈ [0,α_max]}. §.§ Separating hyperplanes used by multidimensional backtracking Both versions of multidimensional backtracking need a direction to update the set of preconditioners in the subroutine. We define the subroutine in <ref>. The description of the separating hyperplane and their properties can be found in <ref> and <ref>. §.§ Multidimensional backtracking using boxes The implementation of multidimensional backtracking with boxes only needs to maintain a vector , representing the maximum step-size for each coordinate that has not been ruled out, in the box (). The associated sets of preconditioners are () = {∈^d : ≤}, = {() : ∈()}. The description of boxes and the theoretical guarantees when using them in multidimensional backtracking can be found in <ref> and <ref>. The subroutines used by the algorithm with boxes are: * : initializes to c_0 so that the diagonal preconditioner c_0 is in _0. * : backtracks from the largest diagonal in (), returning γ(). * : computes the vector defining the half-space of invalid preconditioners _>() obtained when the preconditioner fails the Armijo condition at as described in <ref> and <ref>. * : returns the minimum volume box (^+) containing the intersection () ∩_≤(). §.§ Multidimensional backtracking using ellipsoids The implementation only needs to maintain a vector representing the diagonal of the matrix defining the (centered, axis-alligned) ellipsoid () and the associated set of preconditioners given by () = {∈^d : , () ≤1}, = {() : ∈()}. The description of the ellipsoids and their properties can be found in <ref> and <ref>. The subroutines used by the algorithm with boxes are: * : initializes to (1/d c_0^2) so that c_0 ∈(), implying the diagonal preconditioner c_0 is in . * : backtracks from the diagonal preconditioner in that maximizes the gradient norm. Let () be the set of candidate diagonals and define = (). The subroutine returns γ_max, where _max _∈ ∇f()^2_. Writing this in terms of the diagonal vector _max(_max) yields _max = _∈() ∇f()^2_(), = _ ∇f()^2, : _ ≤1 = ^-1 ∇f()^2/∇f()_^-1, where ∇ f()^2 = ∇ f() ⊙∇ f(). * : computes the vector defining the half-space of invalid preconditioners _>() obtained when the preconditioner fails the Armijo condition at as described in <ref> and <ref>. * : returns an ellipsoid (^+) containing the intersection of () ∩_≤() with guaranteed volume decrease from (). As there is no closed-form solution for the minimum volume ellipsoid, we set ^+ as a convex combination between the original ellipsoid () and the minimum volume axis-aligned ellipsoid containing _≤(), given by (^2), that is, ^+ λ + (1-λ) ^2, where λℓ/dd-1/ℓ-1 and ℓ^2_^-1, where (). Although the above choice of λ has guaranteed volume decrease, we can find a better value of λ by solving the minimum volume ellipsoid as a function of λ numerically. Namely, approximating λ^* _0 < λ< 1 - log((λ() + (1-λ) (^2))).`' In our experiments, we start with λ as in (<ref>) and, starting from it, we solve the above minimization problem numerically using L-BFGS-B <cit.> in SciPy <cit.>. This preserves the theoretical guarantee while improving empirical performance. §.§ Implementable pseudocode The pseudocode in Figures <ref>–<ref> are expressed in a modular form to highlight how the algorithm works and its similarity to a line-search. In this section, we give a more directly implementable pseudocode of multidimensional backtracking, in both the box and ellipsoid variants, using mostly vector notation. Scalar operations on vectors such as /, √(), ^2 are understood to be taken element-wise. § OPTIMAL PRECONDITIONERS, VALID PRECONDITIONERS AND COMPETITIVE RATIOS In <Ref>, we defined the optimal preconditioner as the preconditioner that is the best overall approximation to the inverse Hessian. Formally, we define the optimal diagonal preconditioner as _≻0, diagonal κ such that 1/κ^-1≼∇^2 f() ≼^-1 for all . <ref> One way to interpret this definition is that ^-1 is the tightest diagonal approximation to ∇^2 f(). We remark that we do not need f to be (strongly-)convex to define the theoretically optimal step-size of 1/L for gradient descent. Thus, one may wonder why we need strong-convexity (although we relax this to requiring f to be PL in <ref>) to define what an optimal preconditioner is in (<ref>). The main difference between the scalar step-size and per-coordinate step-sizes settings is whether the “largest” step-size or preconditioner is well-defined. In the scalar setting, the largest step-size that is guaranteed to lead to progress everywhere (i.e., a step-size that satisfies the Armijo condition (<ref>) for all ) is well-defined and equal to α_* 1/L for L-smooth function f. Equivalently, α_* = sup* α> 0∇^2 f() ≼1/α = sup_∈^d λ_max(∇^2 f()), where λ_max(∇^2 f()) is the largest eigenvalue of ∇^2 f(). But in the case of preconditioners, the ordering on positive definite matrices is not complete, so there is no single “largest” preconditioner that satisfies ∇^2 f() ≼^-1. We can still describe “good” preconditioners, that are guaranteed to satisfy the Armijo condition (<ref>) everywhere; this is the notion of valid preconditioners defined in <ref>, which in set notation is {≻ 0: ∇^2 f() ≼^-1}. With this definition, we can consider the set of valid preconditioners for which there are no bigger valid preconditioners, that is, {∈ : ∄ ' ∈ s.t. ≺'}. However, contains incomparable preconditioners, that is, distinct matrices , ∈ that neither ≽ nor ≼ hold. Let us look at an example with a quadratic function (illustrated in <ref>) f() = 1/2, with Hessian = .5 .1 .1 1.0 . There are many preconditioners that are valid,[ Up to invertibility issues which we address in the next subsection. ] for example using the per-coordinate step-sizes _L ≈ .91 0 0 .91 , _1 = 2.0 0 0 0.0 , _2 = 0.0 0 0 1.0 , ≈ 1.75 0 0 0.87 . The preconditioner _L corresponds to the 1/L step-size, _1 and _2 take the largest possible step-size in each coordinate, and is the optimal preconditioner according to <ref>. Those preconditioners are not comparable to each other, as neither _L ≺ nor ≺_L hold. Instead of looking at the matrices themselves, we use in (<ref>) the condition number[Our definition is slightly different, but both notions are equivalent for positive definite .] of ^1/2∇^2 f() ^1/2 as a measure of quality of . This allows for a well-defined optimal preconditioner as this condition number can be maximized. §.§ Defining optimal preconditioners without twice-differentiability or strong-convexity Although we used twice-differentiability of f to define the optimal preconditioner, this is not necessary. If f is not twice-differentiable but still strongly-convex, the definition in <Ref> can be replaced by <ref>, as finding the -norm under which the function is most strongly-convex. = _≻0, diagonal κ such that { [ 1/κ 1/2- ^2_^-1 ≤f() - f() - ∇f(), - ,; f() - f() - ∇f(), - ≤1/2- ^2_^-1, ] . for all , . To avoid strong-convexity, we can instead use the PL inequality. A function f is μ-PL if 1/μ 1/2∇f()^2 ≥f() - f(_). This property is implied by μ-strong convexity. We refer to the work of <cit.> for the properties of PL functions and its relation to other assumptions. To adapt <ref> to our results, we can measure the PL constant μ in the norm induced by , and say that f is μ-PL in ·_ if 1/μ 1/2∇f()^2_ ≥f() - f(_). We use this inequality in the convergence proof in <ref> since it is a consequence of strong-convexity. As this property is the only property of strong-convexity needed for our results, we can adapt our results to be competitive with the optimal preconditioner defined using the PL inequality, using the definition ^pl := _≻0, diagonal κ such that { [ 1/κ ∇f()_^2 ≥f() - f(_) for all ,; f() - f() - ∇f(), - ≤1/2- ^2_^-1, for all , . ] . If f is μ-PL and L-smooth, <ref> has a feasible solution at = 1/L number κ = L/μ. The constraint based on the μ-PL condition in <ref> is weaker than the definition using strong-convexity, as strong-convexity implies the PL inequality. The optimal preconditioner defined using the PL inequality (<ref>) might thus achieve a lower condition number than the one using strong-convexity (<ref>). For example, the quadratic f() = (1/2), with a positive semi-definite is not strongly convex if the smallest eigenvalue of is 0. The optimal preconditioner in <ref> is ill-defined (or has condition number κ_ = ∞). In contrast, the optimal preconditioner defined using the PL inequality in <ref> has a finite condition number, as = 1/L is a feasible solution with condition number κ = L/λ_min^+() where λ_min^+() is the smallest non-zero eigenvalue of . As our proofs only use the properties guaranteed by <ref>, our results also apply to PL functions. §.§ Valid and optimal preconditioners with singular matrices In the main text, we defined valid preconditioners (<ref>) only for positive definite matrices for ease of presentation. The notion of valid preconditioners can be extended to general positive semidefinite matrices. In the diagonal case, the convention 1/0 = +∞ is a useful mental model but can cause inconsistencies (such as ∞· 0). To extend the notion of valid preconditioners to general positive semidefinite matrices, we can use the definition A preconditioner ≽ 0 is valid if ^1/2∇^2 f() ^1/2≼ I for all ∈^d. The above is well-defined for all positive semidefinite matrices. An alternative to arrive at a definition closer to <ref> is to consider the projection matrix Π_ onto the image of , given by Π_ = ^1/2(^1/2)^† where ^† is the Moore-Penrose pseudo-inverse of . Using that, one can show that is valid (according to <ref>) if and only if Π_∇^2 f() Π_≼^† for all ∈^d. An example of a valid preconditioner that is covered by <ref> but not <ref> is the all-zeroes matrix. <ref> can seamlessly replace <ref>, and all the results follow similarly. Moreover, notice that the optimization problem defining the optimal preconditioner (<ref>) may not attain its minima on positive definite matrices when f is not strongly convex. In this case, we can define an optimal preconditioner as a limit point of a sequence that attains in the limit the value in (<ref>) by replacing the minimum with an infimum. In this case, an optimal preconditioner may be singular, but the results in the main body also follow seamlessly using this definition. We decided to restrict our attention to non-singular preconditioners in the main paper for ease of exposition, since when f is strongly-convex, an optimal preconditioner is always non-singular. §.§ Best competitive ratio achievable by the optimal preconditioner In <ref>, we mentioned that the optimal preconditioner could be only 1/d-competitive. In fact, the competitive ratio of can be arbitrarily bad. The reason for this is that the competitive ratio γ does not compare against , but rather against any in the set of potentially valid preconditioners. Moreover, this definition only takes into account the norm ∇ f()_ at a fixed , while the optimal preconditioner needs to have large norm for all . For example, consider the scalar step-size case. If our current interval of candidate step-sizes to try is = [0,1] but the optimal step-size α_* is small, let us say α_* = 1/10, then α_* is only 1/10-competitive in . The motivation for this definition of competitive ratio is that we cannot check whether α is large compared to α_* (as we do not know α_) but we can more easily ensure that a candidate step-size α is γ-competitive in (for example α = 1/2 is 1/2-competitive in [0,1]). In the previous example, the bad competitive ratio of α_ in was mostly due to the fact that was large and that, for some , step sizes larger than α_* could satisfy the Armijo condition (<ref>). Even if α_* is globally optimal, we could make more progress by using a larger step-size if they were to be accepted, and we have not yet ruled out those step-sizes. However, as shrinks, it may eventually converge to the interval [0,1], in which case the optimal step-size α_* would be 1-competitive. In high dimensions however, the optimal preconditioner can have a competitive ratio of 1/d even when comparing only against valid preconditioners.[ How small the set _t can get is bounded by construction. The cutting plane procedure in <ref> only remove invalid preconditioners. The valid preconditioners contained in the initial set _0 will always be in _t, along with possibly more preconditioners that have not been deemed invalid over the course of optimization. ] This is because the competitive ratio is defined using the -norm of the gradient, and we need to take the direction of the gradient into account. For example, consider the quadratic function (illustrated in <ref>) f() = 1/2, where = 1 -1 -1 1 , with eigenvalues {2,0} as = [-1,1]^ [-1,1]. The following three preconditioners are all valid: _1 = 1 0 0 0 , _2 = 0 0 0 1 , and = 1/2 0 0 1/2 . The preconditioner _1 takes the largest possible step-size in the first coordinate and ignores the second, while _2 does the opposite. They are not good global preconditioners, as each ignores one coordinate. Yet, they can make much more progress (i.e., the objective value may decrease more) than the optimal preconditioner if the gradient is very skewed towards one coordinate. This implies that may be only 1/2-competitive in {_1, _2} for some since if ∇f() = 1 0, then ∇f()__1^2 = 1, ∇f()__2^2 = 0, ∇f()_^2 = 1/2, and if ∇f() = 0 1, then ∇f()__1^2 = 0, ∇f()__2^2 = 1, ∇f()_^2 = 1/2. The preconditioner is still a better choice globally (i.e, for all ) since it ensures optimal worst-case linear rate in preconditioned gradient descent. But there are better preconditioners that depend on the current gradient. We exploit this in the ellipsoid variant of multidimensional backtracking to improve our competitive ratio. We backtrack from the preconditioner that maximizes the local progress guarantees to ensure a 1/√(d) competitive ratio, while ensuring volume shrinkage of the set of candidate preconditioners when we call , if the preconditioner fails the Armijo condition. § SEPARATING HYPERPLANES In this section, we prove Propositions <ref> and <ref> on existence and strengthening of separating hyperplanes for valid preconditioners. General idea. Let us start with a summary of the separating hyperplanes used to search for good preconditioners as discussed in <Ref>. The goal of the separating hyperplanes is to give us ways to shrink the initial set of potential preconditioners to narrow in on valid preconditioners using the cutting-plane methods in <ref>. At each iteration we are looking for preconditioners that satisfy the Armijo condition at given by f(- ∇f()) ≤f() - 1/2∇f()^2_. If fails the Armijo condition, we conclude that is invalid. To obtain more information, we look at the condition as a function of the (diagonal of the) preconditioner, and define the gap function at , h() f(- ()∇f()) - f() + 1/2∇f()_()^2, ∀∈^d. Then, h() ≤ 0 if = () satisfies the Armijo condition at , and h() > 0 otherwise. Any preconditioner () such that h() > 0 is guaranteed to be invalid. We can use the gradient of h at and convexity to find a half-space such that one side contains only preconditioners with h() > 0. In this section, we show how to construct such half-space, and strengthen them using the partial order on matrices, which is needed to ensure volume shrinkage of our cutting plane methods. §.§ Stronger hyperplanes In the main body we presented the strengthening of separating hyperplanes via truncation (<ref>) after the result of existence of separating hyperplanes (<ref>). Here, we prove a more general lemma on strengthening half-spaces of invalid preconditioners first, as it is useful in simplifying the proof of <ref>. <ref> follows directly from the following lemma. Let _, α be the intersection of the non-negative orthant ^d and the half-space defined by the vector ∈^d and coefficient α > 0, _,α∈^d, > α. Define max{, 0 } and let _, α be defined similarly as above, that is, _, α∈^d, > α. If _,α only contains diagonals of invalid preconditioners, that is, () is invalid for any ∈_, Then _, α⊆_, α and _, α only contains diagonals of invalid preconditioners. Inclusion _,α⊆_,α. We have that , > α implies , > α for any ∈^d since , = ∑_i [i] ≥ 0[i] [i] + ∑_i [i] < 0[i] [i] ≤∑_i [i] ≥ 0[i] [i] = ∑_i [i] ≥ 0[i] [i] = , . _, α only contains invalid diagonals. Let _∈_, α. We can show that (_) is invalid by finding _∈_, α such that (_) ≼(_). Since (_) is invalid by assumption, this would imply that (_) is also invalid. To find _, we can truncate the entries of _ as _[i] _[i] if [i] ≥ 0 0 otherwise, ∀ i ∈{1, …, d}. Then _∈_, α since α < , _ = , _ = , _. [ One may worry that our original definition of valid preconditioners has a division by 0 if any entry of the preconditioner is 0 as a preconditioner is valid if ∇^2 f() ≼^-1 (<ref>). It is enough to use the convention that 1/0 = +∞, although this might lead to inconsistencies. In <ref> we discuss a more general definition without the use of infinities. ] and (_) ≽(_), as desired. §.§ Separating hyperplanes for invalid preconditioners We are now in position to prove <ref>. Throughout the proof, we shall denote by the matrix (). If f is convex, then h also is since the map ∈^d ↦ f( - ∇ f()) is the composition of an affine transformation and a convex function, and ∇ f()_^2 = ∇ f(), () ∇ f() is linear in . Convexity of h yields the inequality h() ≥ h() + ∇ h(), - , ∀∈^d. This implies that if is such that h() + ∇ h(), - > 0, then h() > 0, which implies that () is an preconditioner. Rearranging we conclude that () is invalid for all in the set in (<ref>), i.e., in ∈^d∇ h(), > ∇ h(), - h() We express the above half-space as _>() = {: , > 1} for ∇h()/∇h(), - h(). Yet, for _>() to be equivalent to the set in (<ref>) or even to be well-defined, we need to ensure ∇ h(), - h() > 0. To see that this holds, note first that by convexity of h and that fact that h(0) = 0 we have h(0) ≥ h() + ∇ h(), 0 - ∇ h(), - 0 - h() ≥ - h(0) = 0 To show that the last inequality is strict, assume that ∇ h(), - 0 - h() = 0 for the sake of contradiction. By <ref>, the half-space ∈^d[∇ h()]_+, > 0 contains only diagonals of invalid preconditioners, where [∇ h()]_+ max{∇ h(), 0} entry wise. However, (1/L)∈ as [∇ h()]_+ ≥ 0 and should be invalid, which is a contradiction since f is L-smooth and 1/L is valid. Therefore, ∇ h(), - 0 - h() > 0. Finally, we can write in terms of f and . To do so, first define ^+ - ∇ f(), and the gradients of f at different points by ∇ f() and ^+ ∇ f(^+). Then, by the chain-rule, ∇ h() = -∇ f( - ∇ f()) ⊙∇ f() + 1/2∇ f() ⊙∇ f() = - ^+ ⊙ + 1/2⊙, which implies ∇ h(), - h() = - ^+, + 1/2, - f(^+) + f() + 1/2, = f() - ^+, - f(^+). Plugging these equations in the definition of yields = ∇ h()/∇ h(), - h() = (1/2 - ^+) ⊙/ f() - ^+, - f(^+) . Remark on assumptions of <Ref>. One may have noticed that we never use the assumption that fails the Armijo condition (i.e., that h() > 0) in the proof of the proposition. In fact, the proposition holds for any ∈^d. However, and crucially for our application, we have that is in the half-space _>() of invalid diagonals from <Ref>. In multidimensional backtracking, is the diagonal of a preconditioner () that failed the Armijo condition h() > 0. Since is close to the origin in multidimensional backtracking, we can ensure the half-space _>() contains a significant portion of our current set of candidate preconditioners, leading to significant shrinkage of the set of candidate preconditioners whenever is invoked. § CUTTING-PLANE METHODS §.§ Boxes Given a box () for some ∈^d and a vector ∈^d, our cutting plane method needs to find a box (^+) that contains () ∩_>() which, hopefully, has smaller volume than (). The next lemma gives a formula for the minimum volume box for any , which is used in the main text to define in <ref>. Moreover, we show that if the half-space _>() is close enough to the origin (since otherwise we might have ^+ =), then we have a significant volume decrease. Let ∈^d and ∈(). Let ∈^d. Then the box (^+) with minimum volume that contains () ∩_≤() is given by (using the convention that 1/[i] = + ∞ if [i] = 0) ^+[i] min{[i], 1/[i]}, ∀ i ∈{1, …, d}, Moreover, if (1/2d) · is excluded by the half-space, that is, ∈_>(), then ((^+)) ≤ (1/(d + 1))((^+)). Formula for ^+. Finding the minimum volume box containing () ∩_≤(), ^+ = _∈^d(()) s.t. () ∩_≤() ⊆(), is equivalent to finding the solution to the following optimization problem: ^+ = _∈^d∏_i [i] s.t. max_∈() ∩_≤()[i] ≤[i] for each i ∈{1, …, d}. As the constraints separate over the coordinates, the minimization can be done for each coordinate separately. As the function is increasing in [i], the minimum is achieved by making all the constraints tight, which giver the formula for ^+ in the statement of the lemma. Volume decrease. Let us prove the second part of the statement. Thus, assume for the remainder of the proof that (1/2d) ·∈_>(). We first show that ((^+)) ≤ (1/(d + 1))((^+)) if we assume that the update from () to (^+) shrinks the box in only one coordinate, i.e., i ∈ [d][i] > 1/[i] = i ∈ [d]^+[i] ≠[i] has exactly one element. Assume the above holds and = {j}. Then, as (1/2d) ·∈_>() implies , (1/2d) > 1, 1 < , (1/2d)≤1/2d([j][j] + d - 1) (d + 1) 1/[j]≤[j]. This together with the fact that ^+[i] = [i] for all i ≠ j and ^+[j] = 1/[j] yields ((^+)) = ∏_i = 1^d ^+[i] = 1/[j]·∏_i ≠ j[i] ≤1/d+1∏_i = 1^d [i] = 1/d+1(()). To complete the proof, we only need to show we may assume (<ref>) holds. Assume the opposite, that is, that there are two distinct coordinates that shrink from ^+ to . We will show that the volume shrinks more, meaning the above bound also applies. Formally, assume there are j,k ∈ that are distinct. For this part, it will be useful to denote by ^+() the point defined in <ref> for a given vector . We will show we can construct ' ∈^d such that (^+()) ≤(^+(')) while maintaining the property (1/2d) ∈_>(') and such that ^+(')[i] ≠[i] for all i ∈∖{j}, which makes (<ref>) follow by induction. Indeed, define ' ∈^d by '[i] [i] for i ∉{j,k}, '[j] 1/[j], and '[k] [k] + [j]/[k][j] - 1/[j]. First, note that (1/2d)∈_>(') since ' - , = [j]('[j] - [j]) + ('[k] - [k]) [k] = [j](1/[j] - [j]) + ([j]/[k]( [j] - 1/[j])) [k] = 0 and, thus, 1 < , (1/2d) = ', (1/2d). Let us now show that ((^+())) ≤((^+('))). Since ^+()[i] = ^+(')[i] for i ∉{j, k}, we have ((^+()))/((^+('))) = ^+()[j]/^+(')[j]·^+()[k]/^+(')[k] = min([j], 1/[j])/min([j], 1/'[j])·min([k], 1/[k])/min([k], 1/'[k]) = 1/[j]/[j]·1/[k]/1/'[k] (since j,k ∈ and by (<ref>)) = 1/[j] [j]·1/[k]([k] + [j]/[k][j] - 1/[j]) = 1/[j] [j]·1/[k] [k]([k] [k] + [j] [j] - 1). To get that (^+()) ≤(^+(')), we can show that last line is bounded by <1. Using the substitution α[j] [j] and β[k] [k], we want to show that α + β -1/αβ < 1 αβ - α - β + 1 > 0 (α -1)(β -1) > 0. This holds if α > 1 and β > 1, is implied by j,k ∈ since α = [j] [j] > 1 and β = [k] [k] > 1. A simple induction shows we may assume (<ref>) holds. To see that (α + β - 1)/αβ < 1, note that Equipped with the above lemma, we are in position to prove <ref>. Property (a), holds by induction because, for any _t used in a call to , we have ^ ∈_≤(_t) since ^* is valid and since by <ref> the half-space _≤(_t) contains only diagonals of invalid preconditioners. For (b), fix t ∈{1, …, T} and recall that in this case we have _t = ()∈(_t) and = (1/2d) ·(_t). The competitive ratio of 1/2d follows since (_t) is the preconditioner that maximizes ∇ f(_t)_ for ∈(_t). Finally, for (c) by <ref> we have that every call to makes the volume of the set decrease by 1/c 1/(d+1). Moreover, one can easily verify that _t[i] ≥min{1/L, _0[i]} for all i ∈{1, …, d} since ((1/L)) contains only diagonals of valid preconditioners. Therefore, for _min[i] min{1/L, _0[i]}, the volume of (_t) cannot be smaller than (_min) for all iteration t. Therefore, the number of times is invoked is no more than log_c((_0))/((_min)) = log_c∏_i = 1^d _0[i]/_min[i]≤log_c((_0_∞ L)^d) = d log_c(_0_∞ L). as desired. §.§ Axis-aligned ellipsoids We now analyze the cutting-plane method using axis-aligned ellipsoids. Interestingly, the results that we prove in this sections are connected to some of the results from <cit.> via polarity theory. We defer a discussion on this connection to the end of this section. Different from the main body, it will be helpful for the analysis of the method and proofs of the results to not restrict ellipsoids to the non-negative orthant, as was done in the main text for ease of exposition. For any symmetric positive definite matrix ∈^d × d, define the ellipsoid given by by () {∈^d , ≤ 1 }. When is diagonal, we say that () is axis-aligned. Moreover, we may slightly overload our notation by defining () (()). General ellipsoids. Although we are ultimately interested in working solely with ellipsoids defined by diagonal matrices, we will start by looking at more general ellipsoids, and then exploit symmetry in our case to derive the result in <ref>. We start with an ellipsoid () where is a positive definite matrix. Then, given a vector ∈^d, we are interested in finding an ellipsoid the intersection of () with the half-spaces defined by and - that contain the origin, that is, the set () ∩∈^d, < 1∩∈^d- , < 1 =() ∩∈^d\|, \| < 1. The following theorem shows how to find an ellipsoid that contains the above intersection, and how to guarantee its volume is smaller than () if is large enough. Interestingly, note that ∈^d\|, \| < 1 = ∈^d(, )^2 < 1 = (^). The set (^) is a degenerate ellipsoid, in the sense that it is not a compact set, and any orthogonal to is contained in (^⊤). Still, the next theorem shows how to find a convex combination of () and (^)—which always contains () ∩(^)—that is guaranteed to have volume smaller than () if is large enough. The following result can be seen as the polar result of <cit.>. Let ∈^d × d be positive definite and let ∈^d. Let λ∈ (0,1) and define L(, ) λ + (1 - λ) ^. Then ()∩(^) ⊆(L(, )) and ((L(, ))) = √(λ/λ + (1 - λ)·ℓ·1/λ^d)·(()) In particular, if ℓ_^-1^2 > d and λ = ℓ/d·d-1/ℓ-1, then λ∈ (0,1) and ((L(, ))) = ν_d() (()) where ν_d() = √(1/λ^d·d-1/ℓ-1) = d/ℓ^d/2ℓ-1/d-1^(d-1)/2∈ (0,1). First, note that for any ∈()∩(^) and any λ∈ (0,1) we have , L(, ) = λ, + (1 - λ) , ≤λ + (1 - λ) = 1. Thus, (L(, )) ⊆() ∩(^). For the volume decrease, recall that for ellipsoids () we have (()) = V_d/√(()) where V_d is the volume of the unit sphere in ^d. By the matrix-determinant lemma, we have (L(, )) = 1 + 1 - λ/λ·, ^-1(λ) = 1 + 1 - λ/λ·ℓλ^d (). Therefore, ((L(, ))) = √(1/1 + 1 - λ/λ·ℓ·1/λ^d)·(()) = √(λ/λ + (1 - λ)·ℓ)·1/λ^d·(()). Finally, for λ defined as in (<ref>) we have 1 + 1 - λ/λ·ℓ = 1 + 1 - ℓ (d-1)/d (ℓ -1)d (ℓ -1)/ℓ (d-1)·ℓ = 1 + d (ℓ -1)/ℓ (d-1) - 1·ℓ, = 1 + d (ℓ -1) - ℓ(d-1)/ℓ (d-1)·ℓ = 1 + ℓ - d/d - 1 = ℓ -1/d -1, which yields the desired formula for ν_d(). On the norm of . The above theorem has a requirement on the norm of the vector that defines the half-space _≤(). However, in our cutting plane method we obtain from <ref> and <ref>, which do not have any guarantees on the norm of explicitly. Crucially, at any given iteration t of multidimensional backtracking with ellipsoids, we select a candidate preconditioner = (_t) such that _t_ = 1/√(2d). Then, if it fails the Armijo condition in (<ref>) and _t is as given by <ref>, then we have _t ∈_>(_t), that is, the separating hyperplane excludes _t. As we will show, this implies that _^-1 is large. Let ∈^d × d be positive definite and ∈^d be such that _≤γ for some γ > 0. Let ∈^d be such that ∈_>(). Then _^-1 > 1/γ. For the sake of contradiction, assume _^-1≤1/γ. Then _^-1·_≤ 1. Thus, by the Cauchy-Schwartz inequality, , = ^-1/2, ^1/2≤^-1/2·^1/2 = _^-1·_≤ 1. This is a contradiction since ∈_>() and, therefore, , > 1. On the volume decrease. Although the formula ν_d() in <ref> can be hard to interpret, we show a simple bound when _^-1^2 ≥ 2d. Let ∈^d × d be a positive definite matrix and ∈^d be such that _A^-1^2 > d. For c d/ℓ∈ (0,1) we have ν_d() ≤√(c · e^1 - c), where ν_d is defined as in (<ref>). In particular, if _A^-1^2 > d, then ν_d() ≤√(e)/√(2). Define ℓ_^-1^2 > d and c d/ℓ∈ (0,1). Then, 4ν_d()^2 = d/ℓ^dℓ-1/d-1^(d-1) = d/ℓ·d/ℓ·ℓ-1/d -1^(d-1) = c ·c ·d/c-1/d -1^(d-1) = c · d - c/d -1^(d-1) = c ·1 + 1 - c/d -1^(d-1) ≤ c · e^1 - c, where the last inequality follows since 1 + x ≤ e^x for all x ∈. In particular, note that c ∈ (0,1) ↦ c · e^1 - c is increasing since the derivative of the mapping is positive on (0,1). Thus, if _^-1≥ 2d, then c ≤1/2 and c · e^1-c≤ (1/2) · e^1/2. Exploiting symmetry. Let us now exploit symmetry to avoid using non-diagonal matrices in our ellipsoids. We use the notion of axis-aligned sets in the next few results. A set ⊆^d is axis-aligned if for any point ∈, the reflections of along the axes are also contained in . Formally, for any ∈{± 1}^d, we have that if ∈, then () ∈. Furthermore, with a slight abuse of notation define () (()). That is, () is the diagonal matrix whose diagonal entries match those of . The idea is that the set ∈^d() is valid of diagonals of valid preconditioners is contained in the non-negative orthant. Yet, we can extend it by reflecting it over each of the axes. Although this may seem counter-intuitive, this translates the structure of our problem into symmetry among all orthant, and this can be exploited elegantly. Formally, the set of diagonals of valid preconditioners reflected over each axis is given by set ∈^d() is valid, where is the entry-wise absolute value of ∈^d. The following lemma shows that when looking for low volume ellipsoids that contain an axis-aligned set, we can restrict out attention to axis-aligned ellipsoids, defined by a diagonal matrix. The following lemma can be seen as the polar statement of <cit.>, with the benefit of not requriring any matrix inversions. Let ⊂^d be an axis-aligned convex set and let ∈^d × d be positive definite matrix such that ⊆(). Then ⊆(()) and ((())) ≤(()). Let us start by showing that ⊆(()). We use the notation () · to denote the set () ·() ·∈. Since is axis-aligned, we have = () ·⊆() ·() = (() ()), ∀∈{± 1}^d. Therefore, is contained in each of the 2^d ellipsoids of the form (() ()). Thus, ⊆⋂_∈{± 1}^d(() ()) ⊆(1/ 2^d∑_∈{± 1}^d() () ), where the last inclusion follows since, for any set of positive definite matrices , one may verify that ∩_∈() ⊆((1/\|\|) ∑_∈). Finally, note that ∑_∈{± 1}^d() () = (). Indeed, let i,j ∈{1, ⋯, d}. If i = j, then (() ())_i,j = _i,j for any ∈{± 1}^d. If i ≠ j, then ∑_∈{± 1}^d (() ())_i,j = ∑_∈{± 1}^d [i] ≠[j] (() ())_i,j + ∑_∈{± 1}^d [i] = [j] (() ())_i,j = 2^d-1· (-_i,j) + 2^d-1·_i,j = 0. Let us now show that ((())) ≤(()). Note that log((())) = log((())) - 12log(). Since log(·) is concave over positive definite matrices, we have log (()) = log(1/ 2^d∑_∈{± 1}^d() () ) ≥1/ 2^d∑_∈{± 1}^dlog( () () ) = 1/ 2^d· 2^d log() = log(). Therefore, log(((()))) = log((())) - 12log(()) ≤log((())) - 12log() =log((())), which implies that ((())) ≤(()). We are now in position to prove <ref>, which follows directly from the previous two results. By the assumptions in <ref> we have that () fails the Armijo condition <ref> condition and, thus, ∈_>(). This together with the assumption that _≤1/√(2d) imply via <ref> that _^-1≥√(2d). This allows us to use <ref> to find a new ellipsoid containing () ∩_≤() with the required volume decrease by <ref>. Yet, this ellipsoid may not be axis-aligned. We shall exploit the symmetry described in <ref> to show that the axis-aligned ellipsoid (^+(, )) enjoys the same guarantees. Formally, we need (^+(, )) to contain ()∩_≤(). Since ≥ 0, we have _≤() ⊆() ∈() ·∈_≤() for all ∈{± 1}^d. Thus, it suffices for (^+(, )) to contain () ∩(). From <ref> we know that () ∩() is contained in the ellipsoid given by the matrix λ() + (1 - λ) ^ for any λ, in particular for λ as in (<ref>) since _^-1 > √(d). Since () is axis-aligned, we can exploit symmetry using <ref>, which tells that () ∩() is contained in the ellipsoid given by the matrix (λ() + (1 - λ) ^) = (^+(, )), as desired. Finally, the bound on the volume follows by <ref> and the bound on ν_d() given by <ref> since _^-1≥√(2d). Finally, we are in position to prove <ref>, which follows almost directly from <ref>. Note that (a) holds by induction and since, by <ref>, we have (^) ∈_≤(_t) for any _t used in a call to . For (b), fix t ∈{1, …, T} and recall that in this case we have _t = ()∈(_t). As described in (<ref>), one may verify that (_t^) for _t^* given by _t^* 1/∇ f(_t)^2__t^-1·_t^-1∇ f(_t)^2 maximizes ∇ f(_t)_ for ∈_t. Since = (_t, 1/√(2d), _t) = 1/√(2d)(_t^), we conclude that is 1/√(2d)-competitive. For (c), first note that we may assume (1/L)∈(α_0 I). To see that, assume (1/L) ∉(α_0 I), implying α_0 d > L^2. In this case, any candidate preconditioner computed by is always valid and, thus, we never call . To see this, let _0 α_0 be the matrix defining the initial ellipsoid. Then, by the definition of for ellipsoids we have that _0 = (_0) is such that _0__0^2 = α_0_0^2 = 1/2d < 1/2α_0/L^2. Therefore, _0[i] ≤1/L for all i ∈{1, …, d}, which implies that _0 is valid since _0 ≼1L. Let us look now at the case (1/L)∈(α_0 I). Therefore, (1/L) ⊆(_t) for all iterations t. Since the minimum volume ellipsoid containing the box ((1/L) ) is the unit sphere of radius 1/L, that is, ((L^2/d) ). Therefore, ((_t)) ≥(((L^2/d) )). Moreover, every time we call cut the volume of the ellipsoid goes down by 1/c √(e)/√(2). Therefore, the total number of calls to is no more than log_c((α_0 ))/(((L^2/d) )) = log_cL^d/d α_0^d/2≤d/log(c)logL/d α_0≤ 12 d logL/α_0 since log(c) ≥ 1/12. Refining the choice of λ. Although we have shown in <ref> a choice a λ that guarantees volume decrease, it may be sub-optimal. The choice of λ in <ref> is inherited from the non-symmetric case in <ref>. Although <ref> and <ref> match when has only one non-zero entry, we should expect better choices of λ, leading to more volume shrinkage, to be possible in <ref>. Although we have not found a choice of λ that is dependent on that generically improves upon (<ref>), in practice we can solve for a better λ numerically, by directly minimizing the volume of the resulting ellipsoid, min_0 < λ< 1 ((λ+ (1-λ) (^⊤))) = min_0 < λ< 1 -∑_i log(λ[i] + (1-λ)[i]^2). As the problem is one-dimensional, numerical solvers can often find near-optimal solutions. By warm-starting a numerical solver with the λ defined in (<ref>), we can guarantee that the resulting ellipsoid leads to a smaller volume and we do not lose our worst-case theoretical guarantees. Connection to the polar problem and related work. Our results have an interesting connection to some of the results from <cit.>, via the use of polarity theory. Here we give a quick overview of their work and the connection to our cutting plane methods. <cit.> shows techniques to approximate some polyhedron ⊆^d (a polymatroid being one of the main examples) from inside by some ellipsoid (). Their algorithm maintains an ellipsoid () ⊆ and tries to iteratively enlarge it. They assume access to an oracle such that, at each iteration, either finds a point ∈ that is sufficiently far from (), meaning _ > √(d) + ϵ for some ϵ > 0, or guarantees that () “approximates well” from inside in the sense that _≤ (√(n) + ϵ)/α for all ∈, where α > 0 is some approximation factor. In their algorithm, when the oracle finds a point ∈ such that _ > √(d) + ϵ the algorithm needs to find an ellipsoid (^+) such that (^+) ⊆conv(() ∪{, -}), where conv() is the convex hull of . Interestingly, the polar problem is exactly what we need for out cutting plane method. More precisely, the polar set ^ of a set is given by ^* z ∈^dz, x≤ 1. Then, by taking polars and using that ()^* = (^-1), we have that ^* ⊆(^-1). Moreover, taking polar on both sides of (<ref>) yields that an equivalent problem is finding (^+)^-1 such that ((^+)^-1) ⊇(^-1) ∩{-, }^* = (^-1) ∩ \|, \| ≤ 1. That is, the problem is the one of finding a smaller ellipsoid ((^+)^-1) that contains (^-1) ∩ \|, \| ≤ 1, which is broadly the goal of the subroutine . § EXPERIMENTS Objective functions We use L_2-regularized linear regression _linear and L_2-regularized logistic regression _logistic(), with a regularization coefficient of 1. Given a data matrix ∈^n× d, target y ∈^n for regression tasks and y ∈{0,1}^n for classification tasks, and parameters ∈^d, _linear() = 1/n 1/2 - ^2 + 1/2^2 . _logistic() = 1/n∑_i=1^n -[i] log(σ(_i, )) - (1-[i]) log(1-σ(_i, )) + 1/n1/2^2. where _i is the ith row of and σ is the sigmoid function, σ(z) = 1/1+exp(-z). For all datasets, we add a bias term by prepending a feature column of ones to . Datasets We use the datasets listed in <ref>, made available by LIBSVM <cit.>, Scikit-Learn <cit.> and the UCI repository <cit.>. Data rescaling We do not rescale, standardize or otherwise change any of the datasets beyond adding a bias term, as our goal is to check whether preconditioned methods can handle badly scaled data. Initializations We consider two types of initializations. The first approximates a “best-case” scenario where we start from an estimate with a reasonable loss value despite the bad scaling of the data. We set [i] = 0 except for the bias term [0] which is set at the MLE of the non-regularized problem, [0] = y̅ where y̅ = 1/n ∑_i=1^n [i] for linear regression, [0] = logy̅/1-y̅ where y̅ = 1/n ∑_i=1^n [i] for logistic regression. The results in the main text use this initialization. The second initialization takes ∼0,, giving a starting point with potentially large loss. We give results using both initializations in the appendix. Optimizers used * For the small linear regression problems, we use preconditioned gradient descent with the optimal preconditioner, pre-computed using the semidefinite formulation of <cit.>, solved using CVXPY <cit.> based on the Matlab implementation of . <https://github.com/Gwzwpxz/opt_dpcond> * Gradient descent with a backtracking line-search with backtracking parameter γ = 1/2. * RPROP <cit.> following the implementation and default hyperparameters in PyTorch <cit.> (starting step-size of 10^-1, increase step-size factor η^+ = 1.2, decreasing step-size factor η^- = 0.5, minimum step-size of 10^-6 and maximum step-size of 50). <https://github.com/pytorch/pytorch/blob/v2.0.1/torch/optim/rprop.py> * Hypergradient descent to set the step-size, using (S)GD-HD <cit.>. The hypergradient step-size is set to the default β = 0.02 <cit.>. The initial step-size is set to α_0 = 10^-10, as otherwise most runs diverged immediately. * The diagonal Barzilai-Borwein method of <cit.>, using their non-monotonic line-search. We use the default parameters suggested; a starting step-size of 10^-6, regularization factor on the previous diagonal approximation μ = 10^-6, a backtracking factor of 1/2 for the backtracking line-search and a window of 15 steps for the non-monotone line-search. This line-search does not use a forward step as the update can increase the preconditioner. * Preconditioned gradient descent using the diagonal Hessian, with a backtracking line-search. * AdaGrad <cit.> but augmented with a backtracking line-search as suggested by <cit.> to make it competitive in the deterministic setting, following the PyTorch <cit.> implementation. <https://github.com/pytorch/pytorch/blob/v2.0.1/torch/optim/adagrad.py> Line-search and forward steps For all methods, the backtracking line-search is augmented by a forward step. When a step-size is accepted, it is increased by a factor of 1.1 for the next step. For multidimensional backtracking, we increase the set uniformly, taking ' = 1.1 · for the box and ' = / √(1.1) for the ellipsoid. The ellipsoid uses a slightly smaller increase factor.[ To increase by a factor of 1.1 in the one-dimensional case, the update to the ellipsoid should be ' = / 1.1^2. ] Hyperparameters for the line-search and multidimensional backtracking For the backtracking line-searches used in gradient descent, preconditioned gradient descent and used to augment the other algorithms, we start the search at an initial step-size of 10^10 and backtrack by a factor of 1/2 when failing the Armijo condition, implemented generically as f(- ) ≤f() - 1/2∇f(), For multidimensional backtracking, we initialize the sets such that the first preconditioner is on the order of 10^10. Using the notation of <ref>, we use the scaling factor c_0 = d · 10^10 for the box variant and c_0 = √(d)· 10^10 for the ellipsoid variant. The first preconditioner tried by the box variant with backtracking factor γ = 1/2d is then 1/2· 10^10, and the first preconditioner tried by the ellipsoid variant (assuming the gradient is uniform, ∇ f(_0) ∝) is 1/√(2)· 10^10. §.§ Additional results Figures <ref>–<ref> give additional results on small linear and logistic regression problems and large logistic regression problems. Multidimensional backtracking has a consistent performance across problems and does not suffer from the extremely bad conditioning of cpusmall or california-housing (linear regression) or australian, breast-cancer, diabetes and heart (logistic regression).
http://arxiv.org/abs/2306.02831v1	20230605122722	MM-DAG: Multi-task DAG Learning for Multi-modal Data -- with Application for Traffic Congestion Analysis	[ "Tian Lan", "Ziyue Li", "Zhishuai Li", "Lei Bai", "Man Li", "Fugee Tsung", "Wolfgang Ketter", "Rui Zhao", "Chen Zhang" ]	stat.ML	[ "stat.ML", "cs.LG" ]	The work is done during the author's internship in SenseTime. 0009-0005-8331-1190 [email protected] Tsinghua University Beijing China 0000-0003-4983-9352 [email protected] University of Cologne Cologne Germany 0000-0003-3408-6300 [email protected] SenseTime Research Shanghai China 0000-0003-3378-7201 [email protected] Shanghai AI Laboratory Shanghai China 0000-0003-3701-7722 [email protected] Hong Kong University of Science and Technology Hong Kong 0000-0002-0575-8254 [email protected] Hong Kong University of Science and Technology Hong Kong 0000-0001-9008-142X [email protected] University of Cologne Cologne Germany 0000-0001-5874-131X [email protected] SenseTime Research China 0000-0002-4767-9597 Corresponding author. [email protected] Tsinghua University Beijing China This paper proposes to learn Multi-task, Multi-modal Direct Acyclic Graphs (MM-DAGs), which are commonly observed in complex systems, e.g., traffic, manufacturing, and weather systems, whose variables are multi-modal with scalars, vectors, and functions. This paper takes the traffic congestion analysis as a concrete case, where a traffic intersection is usually regarded as a DAG. In a road network of multiple intersections, different intersections can only have some overlapping and distinct variables observed. For example, a signalized intersection has traffic light-related variables, whereas unsignalized ones do not. This encourages the multi-task design: with each DAG as a task, the MM-DAG tries to learn the multiple DAGs jointly so that their consensus and consistency are maximized. To this end, we innovatively propose a multi-modal regression for linear causal relationship description of different variables. Then we develop a novel Causality Difference (CD) measure and its differentiable approximator. Compared with existing SOTA measures, CD can penalize the causal structural difference among DAGs with distinct nodes and can better consider the uncertainty of causal orders. We rigidly prove our design's topological interpretation and consistency properties. We conduct thorough simulations and one case study to show the effectiveness of our MM-DAG. The code is available under <https://github.com/Lantian72/MM-DAG>. <ccs2012> <concept> <concept_id>10002950.10003648.10003649.10003655</concept_id> <concept_desc>Mathematics of computing Causal networks</concept_desc> <concept_significance>500</concept_significance> </concept> <concept> <concept_id>10010147.10010178.10010187.10010192</concept_id> <concept_desc>Computing methodologies Causal reasoning and diagnostics</concept_desc> <concept_significance>500</concept_significance> </concept> <concept> <concept_id>10010147.10010257.10010258.10010262</concept_id> <concept_desc>Computing methodologies Multi-task learning</concept_desc> <concept_significance>500</concept_significance> </concept> </ccs2012> [500]Mathematics of computing Causal networks [500]Computing methodologies Multi-task learning MM-DAG: Multi-task DAG Learning for Multi-modal Data - with Application for Traffic Congestion Analysis Chen Zhang Received 21 February, 2023; accepted 5 June, 2023 ======================================================================================================= § INTRODUCTION Directed Acyclic Graph (DAG) is a powerful tool for describing the underlying causal relationships in a system. One of the most popular DAG formualtions is Bayesian Network (BN)<cit.>. It has been widely applied to the biological, physical, and social systems <cit.>. In a DAG, nodes represent variables, and directed edges represent causal dependencies between nodes. By learning the edges and parameters of the DAG, the joint distribution of all the variables can be analyzed. Urban traffic congestion becomes a common problem in metropolises, as urban road network becomes complicated and vehicles increase rapidly. Many factors will cause traffic congestion, such as Origin-Destination (OD) demand, the cycle time of traffic lights, weather conditions, or a road accident. Causal analysis of congestion has been highly demanded in applications of intelligent transportation systems. There is emerging research applying classical DAGs for modeling the probabilistic dependency structure of congestion causes and analyzing the probability of traffic congestion given various traffic condition scenarios <cit.>. When mining the causality for traffic congestion, as the classical DAG-based solution, a traffic intersection is usually regarded as a DAG, whereas different congestion-related traffic variables (e.g., lane speed and signal cycle length) are treated as nodes. However, there are still some challenges to be solved. (1) Multi-mode: First, so far, to our best knowledge, all the current DAGs consider each node as a scalar variable, which may deviate from reality: In complex systems such as transportation, variables are common in different modes, i.e., scalar, vector, and function, due to the variables' innate nature and/or being collected from different kinds of sensors, as shown in Fig. <ref>.(a)-(c). A scalar node is defined as a node that only has a one-dimensional value for each sample, e.g., the cycle time of traffic lights is usually fixed and scarcely tuned. So its signals are sampled at low frequency, and only one data point is fed back in one day. A vector node instead records a vector with higher but finite dimensions, e.g., the congestion indicator variable is calculated per hour, thus a fixed dimension of 24 per day. A functional node records a random function for each sample, with the function being high dimensional and also infinite, e.g., the real-time mean speed of lanes can be recorded every second and its dimension goes to infinity for one day. So far, there is no DAG modeling able to deal with multi-modal data. (2) Multi-task with Overlapping and Distinct Variables: We define a task as a DAG learning, e.g., for each intersection in the traffic case. In complex systems, different tasks can only have some overlapping variables, with some particular variables only distinctly occurring in some specific tasks. We define this officially as overlapping and distinct observations (variables). As such, each task can be regarded as only observing a unique subset of all possible variables. This may be due to their different experiences and hardware availability. For example: 1) Distinct: a signalized intersection (e.g., Task 3) has the node variable related to traffic light parameter (e.g., x_6), such as phase length, whereas a road segment (e.g., Task 1) and an unsignalized intersection (e.g., Task 2) do not have x_6; 2) Overlapping: Task 1-3 all have x_1, x_2, x_5 in Fig. <ref>.(d). The different availability of nodes in each task is the dissimilarity of our multi-task setting. In multi-task learning <cit.>, two important concepts are exactly the dissimilarity and similarity of tasks. (3) Consistent Causal Relations: Despite the different nodes on each task, we assume the causal relations of each DAG should be almost consistent and non-contradictory. For instance, x_1 is the cause of x_3 in Task 1, and this causal relation is not likely to be reversed in another task. This is because although with different subsets of the nodes, the DAGs are sharing and reflecting the similar fundamental and global causal reasoning of the system. This fundamental causal reasoning is usually consistent, usually due to the inherent physical, topological, biochemical properties, and so on. The consistent causal reasoning commonly shared by all the tasks is the similarity of our multi-task setting. However, it is worth mentioning that because nodes vary in each task, the corresponding causal relation structure will undoubtedly adapt, even with significant differences sometimes. For example, as illustrated in Task 1 and 2 in Fig <ref>.(d), because node x_3 is uninvolved in Task 2, all the edges from its predecessors {x_1, x_2, x_4 } will be transited to its successors (x_5) directly, rendering a big difference of edges (yet still consistent). The core challenge is thus to define structure differences between DAGs with different but overlapping sets of nodes, yet still learn the causal reasoning consistently. To this end, it is essential to learn these tasks jointly so that each DAG provides complementary information mutually and learns toward globally consistent causal relations. On the contrary, if separately learned, the causal structure of each task could be partial, noisy, and even contradicting. Motivated by the three challenges, this paper aims at constructing DAG for multi-modal data and developing a structure inference algorithm in a multi-task learning manner, where the node sets of different tasks are overlapping and distinct. To achieve it, three concrete questions need to be answered: (1) how to extract information for nodes with different dimensions and model their causal dependence? (2) how to measure the differences in causal structures of DAGs across tasks? (3) how to design a structural learning algorithm for DAGs of different tasks? Unfolded by solving the above questions, we are the first to construct multi-task learning for multi-modal DAG, named MM-DAG. First, we construct a linear multimode-to-multimode regression for causal dependence modeling of multi-modal nodes. Then we develop a novel measure to evaluate the causal structure difference of different DAGs. Finally, a score-based method is constructed to learn the DAGs across tasks with overlapping and distinct nodes such that they have similar structures. Our contributions are: * We propose a multimode-to-multimode regression to represent the linear causal relationship between variables. It can deal with nodes of scalar, vector, and functional data. * We develop a novel measure, i.e., Causality Difference (CD), to evaluate the structure difference between pairwise DAGs with overlapping and distinct nodes. It can better handle graphs with distinct nodes and consider the uncertainty of causal order. A differentiable approximator is also proposed for its better compatiblity with our learning framework. * We conduct a score-based structure learning framework for MM-DAGs, with our novelly-designed differentiable CD function to penalize DAGs' structure difference. Most importantly, we also prove theoretically the topological interpretation and the consistency of our design. * We apply MM-DAG in traffic condition data of different contexts to infer traffic congestion causes. The results provide valuable insights into traffic decision-making. It is to be noted that considering even for the most commonly used causal structural equation models (SEM), there is no work of multi-task learning for DAG with multimode data. Hence we focus on linear multimode-to-multimode regression, as the first extension of SEM to multi-modal data. We hope to shed light upon this research field since the linear assumption is easy to comprehend. However, our proposed CD measure and multi-task framework can be easily extended to more general causal models, including some nonlinear or deep learning models, with details in Sec. <ref>. The remainder of the paper is organized as follows. Section <ref> reviews the current work about DAG, multi-task learning, and traffic congestion cause analysis. Section <ref> introduces the model construction of MM-DAG in detail and discusses how to extend our model to nonlinear cases. Section <ref> shows the experimental results, including the synthetic data and traffic data by SUMO simulation. Conclusions and future work are drawn in Section <ref>. § RELATED WORK §.§ DAG Structure Learning Algorithm Structure learning for DAG, i.e., estimating its edge sets and adjacency matrix, is an important and well-studied research topic. The current methods can be categorized into constraint-based algorithms and score-based algorithms. (1) Constraint-based algorithms employ statistical hypothesis tests to identify directed conditional independence relationships from the data and construct a BN structure that best fits those directed conditional independence relationships, including PC <cit.>, rankPC <cit.>, and fast causal inference <cit.>. However, constraint-based algorithms are built upon the assumption that independence tests should accurately reflect the (in)dependence modeling mechanism, which is generally difficult to be satisfied in reality. As a result, these methods suffer from error propagation, where a minor error in the early phase can result in a very different DAG. (2) For score-based methods, a scoring function, such as fitting mean square error or likelihood function, is constructed for evaluating the goodness of a network structure. Then a search procedure for the highest-scored structure, such as stochastic local research <cit.> or dynamic programming <cit.>, is formulated as a combinatorial optimization problem. However, these methods are still very unpractical and restricted for large-scale problems. Some other algorithms for structure learning have been developed to reduce computation costs recently. The most popular one is NoTears <cit.>. It represents acyclic constraints by an algebraic characterization, which is differentiable and can be added to the score function. The gradient-based optimization algorithm can be used for structure learning. Most recent DAG structural learning studies follow the insights of NoTears <cit.>. Along this direction, there are also emerging works applying the Notears constraint into nonlinear models for nonlinear causality modeling. The core is to add the Notears constraint into original nonlinear model's loss function to guarantee the graph's acyclic property. For example, <cit.> proposes a general nonparametric modeling framework to represent nonlinear causal structural equation model (SEM). <cit.> proposes a deep graph convolution model where the graph represents the causal structure. §.§ Multi-task Learning Algorithm for DAG Multi-task learning is common in complex systems such as manufacturing and transport <cit.>. In DAG, multiple-task modeling is first proposed for tasks with the same node variables and similar causal relationships <cit.>. To learn different tasks jointly, it penalizes the number of different edges among tasks and uses a heuristic search to find the best structure. <cit.> further introduces a task-relatedness metric, allowing explicit control of information sharing between tasks into the learning objective. <cit.> proposes to penalize the number of edge additions which breaks down into local calculations, i.e., the number of differences of parent nodes for different tasks, to explore shared and unique structural features among tasks in a more robust way. <cit.> proposes to model multiple DAGs by encoding the relationships between different DAGs into an undirected network. As an alternative solution for multi-task graph learning, hidden structures are exploited to fuse the information across tasks. The idea is first to find shared hidden structures among related tasks and then treat them as the structure penalties in the learning step<cit.>. Later, to better address the situation that the shared hidden structure comes from different parts of different DAGs, <cit.> proposes to use a non-negative matrix factorization method to decompose the multiple DAGs into different parts and use the corresponding part of the shared hidden structure as a penalty in different learning tasks. However, these methods penalize graph differences based on their general topology structure, which yet does not represent causal structure. To better add a penalty from a causality perspective, <cit.> proposes to regularize causal orders of different tasks to be the same. However, all the above methods should assume different tasks share the same node set and cannot be applied for tasks with both shared and specific nodes. §.§ Congestion Causes Analysis Smart transport has been an essential chapter, yet with many works focusing on demand prediction <cit.>, trajectory <cit.>, or etc. Congestion root analysis instead should gain more attention since it is safety-related. It uses traffic variables to classify congestion into several causes. <cit.> uses linear regression to diagnose and assign observed congestion to various causes. <cit.> propose a real-time classification framework for congestion by vehicular ad-hoc networks. <cit.> uses BN to estimate the conditional probability between variables. <cit.> divides the nodes in BN into three groups, representing the environment, external events, and traffic conditions, and uses the discrete BN to estimate the causal relationships between nodes. However, the studies above did not involve the correlations between different congestion causes and just classified the congestion into several simple categories. Besides, BN <cit.> has also been applied to congestion propagation <cit.>. Other propagation models include the Gaussian mixture model <cit.>, congestion tree structure <cit.>, and Bayesian GCN <cit.>. Yet we focus on the root causes analysis instead of congestion propagation. § METHODOLOGY We assume there are in total L tasks. For each task l=1,…, L, we have P_l nodes, with the node set _l={1,…,P_l}. The node j in task l is denoted as x_j (l)∈ℝ^T_j(l) representing a variable with dimension T_j(l). Depending on T_j(l), a node x_j(l) can represent multi-modal data: x_j(l) is a scalar when T_j(l)=1, a vector when T_j(l)∈ [2,∞), and a function if T_j(l) = ∞. We aim to construct a DAG for task l, i.e., _l=(_l,_l), where the edge set _l∈ℝ^P_l× P_l and an edge (j, k) represents a causal dependence x_j(l)→ x_k(l). In Section <ref>, we temporarily focus on a single task and assume that the causal structure is known. We construct a probabilistic representation of multi-mode DAG by multimode to multimode regression, called mulmo2 for short. Then in Section <ref>, we consider all the L tasks and propose a score-based objective function for structural learning. Its core is how to measure and penalize the causal structure difference of different tasks. Here we provide a novel measure, CD, together with its differentiable variant DCD, which tries to keep the transitive causalities among overlapping nodes of different tasks to be consistent, as elaborated in Section <ref>. Finally, in Section <ref>, we give the optimization algorithm for solving the score-based multi-task learning. §.§ Multi-mode DAG with Known Structure We temporarily focus on single-task learning. For notation convenience, we remove the subscript l of _l in Section <ref>. Besides, we temporarily assume that causal structure , i.e., the parents of each node, are known. We denote the parents of the node j as pa_j={j'\| (j',j)∈)}. Thus, the joint distribution for sample n is the production of the conditional distribution of each node. p(x^(n)_1,…,x^(n)_P) = ∏_j=1^P p(x^(n)_j\|pa_j) When the multi-mode nodes have finite dimensions, the relationships among a multi-mode node j and its parent j'∈ pa_j can be represented by the following mulmo2 regression model: x^(n)_j = ∑_j' ∈ pa_jℓ_j'j(x^(n)_j') + e_j^(n) where ℓ_j'j is the linear transform of x_j' for (j',j) ∈, e_j^(n) is the noise of x_j^(n) with the expectation 𝔼[e_j^(n)]=0. We consider ℓ_j'j for four cases by whether T_j or T_j' is infinite, as shown in Fig. <ref>. If T_j or T_j' is infinite, we consider x_j or x_j' as a functional variable. From the following, by abuse of notation, we define a vector node as _j, a function node as x_j(t), t ∈Γ. Without loss of generality, we assume the Γ=[0,1] is a compact time interval for all the function nodes. Case 1: Both of two nodes have finite dimensions, i.e., T_j, T_j' < ∞. Then the transition equation is a normal regression: ( ℓ_j'j(_j'^(n)))_t = ∑_s=1^T_j' c_j'jst_j's^(n), t= 1,…, T_j. Here c_j'jst is the coefficient of component s of the vector _j' to component t of the vector _j and (j',j) ∈. Case 2: _j has finite dimensions (vector) and x_j'(t) has infinite dimensions (function), i.e., T_j < ∞, T_j' = ∞. Then ℓ_j'j is: (ℓ_j'j(x_j'^(n)(s)))_t = ∫_0^1 γ_j'jt(s) x^(n)_j'(s) ds,t= 1,…, T_j. Here γ_j'jt(s) is the coefficient function for component t in vector _j and (j',j) ∈. Case 3: x_j(t) has infinite dimensions (function) and _j' has finite dimensions (vector), i.e., T_j = ∞, T_j' < ∞. In this case, the linear regression between vector-to-function regression is: ℓ_j'j(_j'^(n))(t) = ∑_s=1^T_j'γ_j'js(t) ^(n)_j's, where γ_j'js(t) is the coefficient function for s-th component in vector _j' and (j',j) ∈. Case 4: Both of two nodes have infinite dimensions, i.e., T_j, T_j' = ∞, Then, the linear function-to-function (func2func) regression is: ℓ_j'j(x_j'^(n))(t) = ∫_0^1 γ_j'j(t,s) x^(n)_j'(s) ds, where γ_j'j(t,s) is the coefficient function for (j',j) ∈. For any node j∈{j∈\|T_j=∞}, x_j(t) is in infinite dimensions and hard to be estimated directly. It is common to decompose them into a well-defined continuous space for feature extraction: x_j^(n)(t) = ∑_k=1^K_jα_jk^(n)β_jk(t) + ε_j^(n)(t), where β_jk(t) is the orthonormal functional basis, with ∫_0^1 β_jk(t)^2 dt = 1 and ∫_0^1β_jk(t)β_jk'(t) dt = 0 for k,k'=1,… K_j and k k', α_jk^(n) is the corresponding coefficient. α_jk^(n) and β_jk(t) can be obtained by Functional Principal Component Analysis (FPCA) <cit.>, and ε_j^(n)(t) is the residual of FPCA. After decomposing the functional variables x_j(t), we describe transition γ in Cases 2, 3, and 4 using the corresponding basis set: γ_j'jt(s) =∑_k'=1^K_j' c_j'jtk'β_j'k'(s) γ_j'js(t) =∑_k=1^K_j c_j'jskβ_jk(t) γ_j'j(t,s) =∑_k=1^K_j∑_k'=1^K_j' c_j'jk'kβ_jk(t)β_j'k'(s). Plugging Eqs. (<ref>) and (<ref>) into Eqs. (<ref>), (<ref>), (<ref>), (<ref>) and (<ref>), we have the general expression of our mulmo2 regression: ^(n)_j = ∑_j' ∈ pa_j_j'j^T ^(n)_j' + ^(n)_j, where a^(n)_j = ^(n)_j ∈ℝ^T_j T_j < ∞ ^(n)_j ∈ℝ^K_j T_j = ∞ , _j^(n)=[α_j1^(n),…,α_jK_j^(n)] is the PC score of node j in sample n, and _j'j∈ℝ^d(_j') × d(_j) represents the transition matrix from node j' to node j, with (_j'j)_uv = c_j'juv and d(_j) as the dimensions of _j. _j^(n)∈ℝ^d(_j) is the noise, with 1) _j^(n) = _j^(n) if T_j<∞, and 2) (_j^(n))_k = ∫_0^1 e_j^(n)(t) β_jk(t) dt, if T_j=∞. We have 𝔼[_j^(n)] = 0 in these two cases. It is to be noted that we can also conduct PCA to perform dimension reduction for vector variables like _j^(n) = ∑_k=1^K_jα_jk^(n)_jk + _j^(n), and replace the finite cases in Eq. (<ref>) by _j^(n)=_j^(n)∈ℝ^K_j, K_j ≤ T_j. We assume noise _j follows Gaussian distribution independently and interpret Eq. (<ref>) as linear Structural Equation Model (SEM): ^(n) = ^T ^(n) + ^(n). Here ^(n) = [^(n)_1,…,^(n)_P]∈ℝ^M, ^(n)=[_1^(n),…,_j^(n)]∈ℝ^M is the noise vector, and = [_j'j] ∈ℝ^M× M is the combined matrix where M = ∑_j d(_j). §.§ Multi-task Learning of Multi-mode DAG Now we discuss how to estimate the DAG structures for all the tasks. First, we introduce the concept of causal order π(·), which informs possible “parents” of each node. It can be represented by a permutation over 1, 2, …, P. If we sort the nodes set by their causal orders, the sorted sequence satisfies that the left node is a parent or independent of the right node. A graph =(,) is consistent with a causal order π if and only if: (i,j) ∈⇒π(i) < π(j). In SEM of Eq. (<ref>), we focus on estimating the transition matrix and its causal order π. The non-zero entries of the matrix denote the edges of the graph =(,) that must consistent with π, i.e., _ij_F^2>0 ⇒π(i) < π(j). We denote _ij = _ij_F^2 to represent the weight of edge from node i to node j, where _ij>0 means (i,j)∈. Based on the acyclic constraint proposed by NoTears <cit.>, our score-based estimator of single-task is: = min1/2N - _F^2 + λ_1 subject to h() = tr(e^) - P = 0 . where =[^(1),…,^(N)]^T∈ℝ^N× M. For all the tasks l=1,…,L, we denote their corresponding SEMs as: _(l) = _(l)^T _(l) + _(l), where _(l)∈ℝ^N_l × M_l, _(l)∈ℝ^M_l × M_l, and _(l)=[_(l)^(1),…,_(l)^(N_l)]^T∈ℝ^N_l × M_l is the noise matrix of N_l samples of task l. The core of multi-task learning lies in how to achieve information sharing between tasks. To this end, we add the penalty term to penalize the difference between pairwise tasks and derive a score-based function of multi-task learning as follows: _(1),...,_(L) = _(1),...,_(L)min∑_l=1^L 1/2N_l_(l) - _(l)_(l)_F^2 + ρ∑_l_1,l_2 s_l_1,l_2 DCD(_(l_1), _(l_2)) + λ∑_l=1^L _(l)_1 s.t. h(_(l)) = tr(e^_(l)) - P_l = 0, ∀ l where _(l)ij = _(l)ij_F^2, s_l_1,l_2 is the given constant reflecting the similarity between tasks l_1 and l_2. The penalty term DCD(_(l_1), _(l_2)) is defined as Differentiable Causal Difference of the DAGs between task l_1 and task l_2 (discussed in Section <ref>). ρ controls the penalty of the difference in causal orders, where larger ρ means less tolerance of difference. λ controls the L_1-norm penalty of _(l) which guarantees that _(l) is sparse. §.§ Design the Causal Difference We propose a novel differentiable measure to quantify causal structure difference between two DAGs. First, we introduce the current most commonly used measures for graph structure difference. They are limited when formulating the transitive causality between two DAGs (details below). Then we introduce the motivation of Causal Difference measure CD and its definition. Finally, we propose DCD as the differentiable CD and discuss its asymptotic properties. Current metrics for graph structure difference include spectral distances, matrix distance, feature-based distance <cit.>. A simple idea is to directly count how many edges are different between two graphs, denoted as Δ(_u, _v). It is a special case of matrix distance _u - _v_0, and _u, _v is the adjacency matrix of graph _u, _v. Δ(_u, _v) defines the edge difference of _u and _v: Δ(_u,_v) = ∑_i ∈_u ∩_v∑_j ∈_u ∩_v𝕀(𝕀((i,j)∈_u) 𝕀((i,j) ∈_v) ) where _u, _v ⊆{1, 2, …, P } are the node sets of the graph _u, _v, respectively. 𝕀(·) is the indicator function. If node i and node j both appear in _u, _v, the difference is increased by one if the edge (i,j) appears in _u but not in _v and vice versa. However, Δ(_u, _v) does not consider the edges of distinct nodes of _u, _v. This is reasonable since, in our context of multi-task learning, we only need to penalize the model difference for the shared parts, i.e., the graph structure for the overlapping nodes. A novel measure considering transitive causality: Δ(_u, _v) performs well if we only focus on the graph structure difference. However, it cannot reveal the transitivity of causal relationships in graphs. We use the three graphs _a, _b, _c in Fig. <ref> to demonstrate this point. (1) Case I: The difference between _a and _b. In this case Δ(_a, _b) = 2 since the edges X → W, Y → W appear in _a, not in _b. But from another perspective, if we sort the nodes set by their causal orders, the sorted sequence in _a is X,Y,Z,W, and the sorted sequence in _b is X,Y,W. If we remove Z in _a, the sorted sequence of _a and _b are exactly the same. The edge difference between _a and _b is due to the transitive causality passing Z, which is excluded in _b. Thus, the ideal Causal Difference measure should be CD(_a, _b)=0, which is formally defined in Def. <ref>. (2) Case II: The difference between _a and _c. To solve the problem of Case I, at first glance, we can use causal order <cit.> and kernels for permutation <cit.> as a causal difference measure directly. However, it has an uncertainty problem, as shown in Fig. <ref>.(b). In _c, the sorted sequence is either X,Y,Z,W or Y,X,Z,W, which are equivalent. But in _a, the sorted sequence is unique X,Y,Z,W. This difference is caused by that there is an edge X → Y in _a, which determines the causal order that π(X)<π(Y), but not in _c. In this case, the causal difference measure between the two graphs should be considered, i.e., CD(_a,_c) > 0. Our design: The two cases mentioned above motivate us to propose a new measure to evaluate the causal difference. Instead of using causal order, which is a one-dimensional sequence, here we define a transitive causal matrix to better consider causal order with uncertainty. Define the transitive causal matrix ^() as: ^()_ij∈ℝ^\|\| × \|\| = 1 π(i)<π(j) for all π consistent with 0 π(i)>π(j) for all π consistent with 0.5 Otherwise We can see that when the causal order of nodes i and j is interchangeable, instead of randomly setting their orders either as i→ j or j → i, we deterministically set their causal relation ^()_ij= ^()_ji=0.5 symmetrically. Then we define our CD measure, which is the difference between the overlapping parts of the transitive causal matrices of two graphs: Define the Causal Difference between _u, _v as CD(_u, _v) with following formula: CD(_u, _v) = ∑_i ∈_u ∩_v∑_j ∈_u ∩_v (^(_u)_ij - ^(_v)_ij)^2. By Definitions <ref> and <ref>, we can see CD(_u, _v) describes the transitive causal difference between DAGs better. Fig. <ref> illustrates our design of ^_a, ^_b and ^_c, which can be viewed as “fully-connected” versions of _a, _b and _c. We obtain the causal effect behind the graph and obtain graph ^. From Fig. <ref>, we show that the edges X → W and Y → W appear in both ^_a and ^_b, which indicates CD(_a, _b)=0. Meanwhile, in _a^, the edge X → Y is directed with weight 1, but in graph _c^, this edge is bi-directed with weight 0.5. From Eq. (<ref>), CD(_a, _c) = 0.5^2 + 0.5^2 = 0.5. Topological Interpretation: We further give a topological interpretation of ^* and CD(_u, _v). By showing that ^* lies in a T_0 space (or Kolmogorov space <cit.>), we prove that CD is equivalently defined by the projection and a distance metric of T_0 spaces. Define _ is the set of ^* matrix generated by node set , i.e., _={^()\|=(,), ∀}. _ is a finite T_0 space with \|_\|=α(\|\|), where α(n) is the number of distinct T_0 topologies with n points, and ^() ∈_ corresponds to a unique T_0 topology. Since ^() is a bi-directed transitive causality on the set , Lemma <ref> is proved by <cit.>. Define D__(^(_1),^(_2))=^(_1)-^(_2)_F^2, ∀^(_1),^(_2) ∈_, which is a distance metric of space _. Define the projection function f_,':_→_' as f(^())= ^(') where ' ⊆, ' = (',') with '={(i,j) \| (i,j) ∈, i,j ∈' }. The causal difference CD in Eq. (<ref>) can be represented by the following formula: CD(_u,_v) = D__(f__u,(^(_u)), f__v,(^(_v))) where _u=(_u, _u), _v=(_v, _v), and =_u ∩_v, D__ means the distance metric in space _. D(f__u,(^(_u)), f__v,(^(_v))) = f__u,(^(_u)) - f__v,(^(_v)) _F^2 = ∑_i ∈∑_j ∈ (f__v,(^(_v))_ij - f__v,(^(_v))_ij)^2 = ∑_i ∈_u, _v∑_j ∈_u, _v (^(_u)_ij - ^(_v)_ij)^2 = CD(_u, _v) Lemma <ref> shows that our design ^() lies in a T_0 space _. Using Def. <ref> and <ref>, we define the distance metric in T_0 space and the projection function of two T_0 spaces. Finally, Theorem <ref> shows that our difference measure CD(_u,_v) can be represented by the distance in space _, where =_u ∩_v, as shown in Fig. <ref>. Continuous Trick : Although ^* and CD(_u,_v) have such good properties, they are incompatible with the current score-based algorithm in Eq. (<ref>) since ^* is discrete thus without gradient. To still guarantee our structure learning algorithm can be solved with gradient-based methods, we further derive a differentiable design as an approximation of ^* in Def. <ref>, and also prove the consistency for the conversion. Define the differentiable transitive causal matrix as () = S(c(l() - l()^T)), where l() = + ∑_i=1^P^i. c is a positive constant, is the adjacency matrix of graph =(,), _ij > 0 means (i,j) ∈, function S is the element-wise Sigmoid function for matrix with S()_ij = 1/1 + exp(-_ij). If is the adjacency matrix of graph =(,). The differentiable transitive relation matrix () converges to the transitive relation matrix ^() as c →∞. In Eq. (<ref>), l()=++^2+⋯, where the entries of matrix power ^k_ij are the sum of the weight products along all k-step paths from node i to node j. Therefore, l()_ij=0 means that node j cannot be reached from node i in graph , l()_ij > 0 means that node j can be reached from node i in graph . Since is acyclic, l()_ij and l()_ji have three cases: (1) l()_ij>0, l()_ji=0, representing the case π(i)<π(j): lim_c →∞()_ij = lim_c →∞ Sigmoid(cl()_ij) = 1 = ^()_ij (2) l()_ij=0, l()_ji>0, representing the case π(i)>π(j): lim_c →∞()_ij = lim_c →∞ Sigmoid(-cl()_ji) = 0 = ^()_ij (3) l()_ij=0, l()_ji=0, representing the case that the relationship between π(i) and π(j) is not sure, and ()_ij = Sigmoid(0)=^()_ij=0.5. Combining cases (1) to (3): lim_c →∞() = ^() Theorem <ref> proves the consistency of and ^ when c→∞. In the algorithm, c can be set to a relatively large constant and avoid floating point overflow. Therefore, the Differentiable Causal Difference DCD is given by: DCD(_u, _v) = ∑_i ∈_u, _v∑_j ∈_u, _v ((_u)_ij - (_v)_ij)^2, which is used in our multi-task score-based algorithm in Eq. (<ref>). §.§ Structural Learning Algorithm To solve Eq. (<ref>), following the algorithm proposed by <cit.>, we derive a structural learning algorithm based on the Lagrangian method with a quadratic penalty, which converts the score-based method in Eq. (<ref>) to an unconstrained problem: F(_(1),...,_(L)) = _(1),...,_(L)minmax_β>0 f(_(1),...,_(L)) + ∑_l=1^L β h(_(l)) + α^2/2 h(_(l))^2, where f = ∑_l=1^L 1/2N_l_(l) - _(l)_(l)_F^2 + ρ∑_l_1,l_2 s_l_1,l_2DCD(_(l_1), _(l_2)) + λ∑_l=1^L _(l)_1. β is dual variable, α is the coefficient for quadratic penalty. We solve the dual problem by iteratively updating f(_(1),...,_(L)) and β. Due to the smoothness of objective F, Adam <cit.> is employed to minimize F given β, and update β by β←β + α∑_l=1^L h(_(l)). The overall steps are summarized in Algorithm <ref> and the convergence property of our algorithm is fully discussed by <cit.>. The partial derivative function of F for _(1), …, _(L) are computed by the following three parts: (1) Derivative of _(l) - _(l)_(l)_F^2: ∂_(l) - _(l)_(l)_F^2/∂_(l) = -2 ^T_(l) (_(l) - _(l)_(l)). (2) Derivative of h(_(l)): ∂ h(_(l))/∂_(l)ij = ∂ h(_(l))/∂_(l)∂_(l)/∂_(l)ij. where ∂ h(_(l))/∂_(l) = e^_(l), ∂_(l)/∂_(l)ij can be obtained from the definition _(l)ij=_(l)ij_F^2. (3) Derivative of DCD(_(l_1), _(l_2)): ∂ DCD(_(l_1), _(l_2))/∂_(l)ij = ∂ DCD/∂ l(_(l_1))∂ l(_(l_1))/∂_(l_1)∂_(l_1)/∂_(l_1)ij ∂ DCD/∂ l(_(l_1))_ij = 2Q(cl(_(l_1))_ij-cl(_(l_1))_ji, cl(_(l_2))_ij-cl(_(l_2))_ji) where Q(x,y) = 2c e^x (e^x - e^y)/(1 + e^x)^3 (1 + e^y) ∂ l(_(l_1))_kl/∂_(l_1)ij = ∑_p=1^P ∑_r=1^p (_(l_1)^r_ij_(l_1)^(p-r-1))_kl where _ij is a P_l_1× P_l_1 matrix with (_ij)_ij=1 and 0 in other entries. Denote P=max P_l and M=max M_l, in each Adam iteration, the overall computation complexity is O(LNM+L^2P^2M^2+LP^6). The detailed math is in Appx. <ref>. §.§ Extension to nonlinear cases Our model can be extended to nonlinear models with ease. To model a nonlinear system, we would need to design two components. Firstly, we develop the transition function in DAG, which can be expressed as 𝔼(X_j\|X_pa_j)=g_j(f_j(X)), where f_j:ℝ^T→ℝ and g_j:ℝ→ℝ. In our design, we utilized mo2mo regression to construct f_j and g_j. However, these functions can also be constructed using kernel or deep methods such as graph neural network <cit.>. Secondly, we would need to construct an adjacency matrix of the causal graph, W, that satisfies the condition f_ij 0 → W_ij>0. An easy way to achieve this is by setting W_ij=\|\|f_ij\|\|_L^2. Then the objective loss function can be constructed and the Notears constraints can be added. By following this procedure, our multitask design with the CD constraints can also be added. Consequently, our multi-task learning framework can be easily extended to nonlinear models. § EXPERIMENTAL STUDY §.§ Synthetic Data The set of experiments is designed to demonstrate the effectiveness of MM-DAG. We first generate a “full DAG” _0 with P nodes: _0 ∈{0, 1}^P × P with [_0]_ij = 𝕀([e^]_ij>0), where is generated by Erdös-Rényi random graph model <cit.>. Nodes 1, 2, …, ⌊ P/2⌋ are set as scalar variables, and nodes ⌊ P/2+1⌋, …, P are functional variables with the same K Fourier bases ν_1(t), …, ν_K(t). Therefore, the node variables can be represented by: ^(n)_j = ^(n)_j for scalar nodes ∑_k=1^K a_jk^(n)ν_k(t) for functional nodes , Then, we sample L sub-graphs from _0 as different tasks. For task l with _(l), we randomly select node set _(l)⊆{1,2,...,P} with P/2 ≤ \|_(l)\| ≤ P, and denote node i in task l as node[l,i], that is, {node[l,i]\|i∈_(l)} = _(l). To generate N samples for L tasks, we first generate _(l)ij = c_(l)ij * _(l)ij * [_0]_node[l,i], node[l,j], where c_(l)ij is sampled from the uniform distribution 𝒰(-2, -0.5) ∪ (0.5,2) and _(l)ij is a matrix whose diagonal is 1, with the dimension the same as _(l)ij. Thus, we ensure the causal consistency of tasks _(l) generated by _0. Then we generate _j^(n) according to Eq. (<ref>) with _j^(n)∼ N(0,𝐈). For evaluation, F1-score (F1), false positive rate (FPR), and true positive rate (TPR) <cit.> are employed as the quantitative metrics. Higher F1 (↑) and TPR (↑) indicate better performance, whereas FPR is reversed (↓). We compare our MM-DAG with four baselines. (1) Separate based on NoTears <cit.> is to learn the multi-modal DAG for each task separately by optimizing Eqs. (<ref>) and (<ref>). (2) Matrix-Difference is to use the matrix distance Δ as the difference measure in the multi-task learning algorithm, which has limitations to handle Case I. (3) Order-Consistency is the multi-task causal graph learning of <cit.>, which assumes all the tasks have the same causal order. It has limitations in dealing with Case II (See Fig. <ref>). (4) MV-DAG: Instead of mo2mo regression, MV-DAG implements a preprocessing method for functional data by dividing the entire time length of the function into 10 intervals and averaging each interval. This transforms each functional data into a ten-dimensional vector. We show the difference between the five models in Table <ref>. Relationship between model performance and sample size: We first fix the number of tasks (DAGs) L=4. The evaluation metrics are shown in Fig. <ref> under different sample sizes. We see that MM-DAG outperforms the baselines, with the highest F1 score and a +2.95% gain than the best peers, i.e., order-consistency, when N=50, and +11.9% gain than Matrix-Difference when N=200, 400. The performance of the four methods improves as the number of samples N increases. Notably, we discover that the F1 score of baseline Matrix-Difference is stable at 0.83 even if we increase N from 100 to 400. This is attributed to biased estimates caused by the fact that the matrix difference incorrectly penalizes the correct causal structure of the task. This bias cannot be reduced by increasing the number of samples. Thus, the F1 score of Matrix-Difference cannot reach 100%. By comparing our proposed MM-DAG model to the MV-DAG model, we verify the contribution of the multi-modal design. Relationship between model performance and the number of tasks: We set the sample size N=10, and investigate the effect of task size L. The results are shown in Fig. <ref>, from which the salient benefits of our proposed MM-DAG can be concluded: As the number of tasks increases, the performance of our method improves the fastest, but the baseline Separate holds. Promisingly, our method gains a maximum +16.1% gain on F1 against its best peers, i.e., order-consistency, when L=32. It can successfully exploit more information in multi-task learning since it can better deal with the uncertainty of causal orders. All of those demonstrate the superiority of MM-DAG. Visualization: We also visualize the learned DAGs in Fig. <ref>, which shows the estimated adjacent matrix (edge weights) _l of MM-DAG, Order-Consistency, and Matrix-Difference. MM-DAG derives the most accurate results, which indicates that it achieves the best performance in estimating the DAG structure. Appx. <ref> shows the detailed experiments result in the case that N=20, L=10 and shows that our MM-DAG have best F1 score. Ablation study of CD penalty and L1-norm penalty: We conduct an ablation study with number of nodes N=20 and number of tasks L=10. The results of MM-DAG(λ=0.01,ρ=0.1), MM-DAG(λ=0,ρ=0.1) and MM-DAG(λ=0.01,ρ=0) are shown as follows. The result shows that the L_1 penalty imposed by λ can reduce overfitting and reduce FDR. The causal difference penalty imposed by ρ can combine task information to decrease FDR and increase TPR. §.§ Congestion Root Causes Analysis For the traffic scenario application, we apply our method to analyze the real-world congestion causes of five intersections in FenglinXi Road, Shaoxing, China, including four traffic light-controlled intersections and one traffic light-free intersection, as shown in Fig. <ref> in Appendix <ref>). The original flow is taken from the peak hour around 9 AM. We reconstruct the exact flow given our real data. According to reality, the scenario is reproduced in the simulation of urban mobility (SUMO) <cit.>. There are three types of variables in our case study, as summarized in Table <ref>: (1) The scalar variables X, such as Origin-Destination (OD) or intersection turning probability, represent the settings of SUMO environment and can be adjusted. (2) The functional variables Y(t) represent the traffic condition variables such as mean speed or occupation. (3) The vector variables R represent the congestion root cause. Since these types of variables are obtained at a lower frequency compared with the traffic condition variables, we can regard them as vectors. For each sample, we set different levels on each variable of X, then Ys are collected by the sensor in SUMO, and Rs are obtained with rule-based algorithms. The characteristics of five intersections are summarized in Table <ref>. The second intersection has no traffic light; thus, it has only six nodes without traffic light-related variables X_3, R_1, R_2, R_4. Since the number of lanes is different, the number of X varies across tasks, which leads to a different number of samples. Practically, traffic setting variables affect the congestion situations, and the different types of congestion can lead to changes in traffic condition variables. Therefore, it is assumed that there is only a one-way connection from X to R and from R to Y (This hierarchical order, i.e., scaler → vector → functional data, is only specific to this domain, which should not be generalized to other domains). Furthermore, considering the setting variables are almost independent, there are no internal edges between different Xs. Additionally, we assume that some congestion causes may produce others, which should be concerned about. To this end, the interior edges in R are retained when estimating its causal structure. In the multi-task settings, we assign the task similarity s_i,j as the inverse of the physical distance between intersection i and intersection j. For the functional PCA, the number of principal components is chosen as K=5. Fig. <ref> shows the results of our multi-task learning algorithm. One can figure out the results by analyzing the points of commonalities and differences in the 5 tasks. The variables (nodes) in each task (DAG) are divided into three hierarchies, i.e., X, R, and Y for better illustration. We can find some interesting insights from the results. For the four intersections with traffic lights, the causal relationships are similar to local differences. Generally, for edges from X → R, changes in OD demand affect traffic congestion, irrational phase sequences, and long cycle times. Turning probability adjustments can slightly result in congestion and irrational phase sequences with lower likelihoods, whereas traffic light adjustments may cause long signals or short signal times and irrational phase sequences. For edges from R → R, we can see both irrational phase sequences and congestion may lead to an irrational guidance lane. For edges from R → Y, congestion, irrational phase sequences, and irrational guidance lanes can cause high occupancy and yet low speed. It is to be noted that for tasks 4 and 5, the cycle time of the traffic light will not lead to its short cycle time. This might be because they are three-way intersections and have smaller traffic flows. Consequently, short cycle time may not occur. For the traffic light-free intersection Task-4, its causal relations are the same as the overlapping parts of the other four. We can draw some primary conclusions from Fig. <ref>(a) that: (1) The change of OD demand is the most critical cause for traffic congestion, whereas the impact of turning probability on it is slight (edge weight < 0.1). (2) Cycle time does not directly cause congestion, but sometimes it can produce irrational phase sequence and thus cause congestion indirectly. In Appendix <ref>, we further test our model when dealing with a more complex and realistic case where all the intersections are connected and interdependent. § CONCLUSION This paper presents the multi-task learning algorithm for DAG to deal with multi-modal nodes. It first conducts mulmo2 regression to describe the linear relationship between multi-modal nodes. Then we propose a score-based algorithm for DAG multi-task learning. We propose a new CD function and its differentiable form to measure and penalize the difference in causal relation between two tasks, better formulating the cases of unincluded nodes and uncertainty of causal order. We give important theoretical proofs about topological interpretation and the consistency of our design. The experiments show that our MM-DAG can fuse the information of tasks and outperform the separate estimation and other multi-task algorithms without considering the transitive relations. Thus, our design of causal difference has a strong versatility, which can be extended to other types of multi-task DAG in future work, such as federated multi-task DAG learning <cit.>. It is worth mentioning that we start the multi-task DAG learning for multi-modal data with a linear model first since this field is still unexplored and linear assumption is easy to comprehend. ACM-Reference-Format APPENDIX This appendix provides additional details on our paper. Appendix <ref> analyzes the complexity of our algorithm for each Adam iteration. Appendix <ref> presents detailed results from our numerical study. Appendix <ref> introduces a new SUMO scenario and compares the results with those from the old scenario. Appendix <ref> discusses the potential future work. § COMPUTATION OF THE COMPLEXITY The most computationally heavy part is computing the gradients in Section <ref>. We calculate the computation complexity of each iteration in the gradient-based algorithm as follows: * Derivative of 𝐀_(l) - 𝐀_(l)𝐂_(l)_F^2: the computation complexity is O(N_lM_l). Therefore, for all tasks, the computation complexity is O(∑ N_lM_l). * Derivative of h(W_(l)): the computation complexity is O(P_l^2M^2_l). Therefore, for all the tasks, the computation complexity is O(∑ P^2_lM^2_l). * Derivative of DCD(W_(l_1), W_(l_2)): We can preprocess ∂ l(W_(l_1))_kl/∂ W_(l_1)ij for all i, j, k, l ∈{1,…,P_(l_1)}. The complexity of this part is O(P_l_1^6). Then for all DCD(W_(l_1), W_(l_2)), we use O(P_l_1P_l_2M_l_1M_l_2) to compute its derivative. Therefore, for all pairs of tasks, the computation complexity is O(∑_l_1∑_l_2P_l_1P_l_2M_l_1M_l_2+∑_l P_l^6). Denote P=max P_l and M=max M_l; in each Adam iteration, the overall computation complexity is O(LNM+L^2P^2M^2+LP^6). § DETAILED RESULT OF NUMERICAL STUDY Table <ref> presents a comprehensive overview of the numerical study with N=20 and L=10. In the following analysis, we will delve into the results and draw a conclusion based on the performance presented in the table. Explanation of the difference between MV-DAG and MM-DAG: The MV-DAG approach cuts each functional data into a 10-dimensional vector by averaging the values within each of the 10 intervals. Compared to MM-DAG, MV-DAG has a 61.7% lower F1 score, and we believe the reasons are twofold: * This preprocessing approach, working as a dimension reduction technique, may result in the loss of critical information of functional data. * in MM-DAG, we delicately design a multimodal-to-multimodal (mulmo2) regression, which contains four carefully-designed functions, i.e., regular regression, func2vec regression, vec2func regression, and func2func regression (as shown in Fig. <ref>); whereas the MV-DAG only contains regular regression since all the function data have been vectorized. The contribution of CD design: The performance of these three baselines (order-consistency, Matrix-Difference, Separate) in the new settings as in Table <ref> above. It is worth mentioning that all three baselines underwent the same multimodal-to-multimodal regression and got the same matrix A. The table clearly indicates that our 'CD' design significantly contributed to improving the F1 score: MM-DAG has another +6.7% F1 gain compared to order-consistency, as well as another +23.8% F1-score gain compared to Matrix-Difference. These performance gains come purely from our CD design. The effectiveness of multitask learning: By comparing MM-DAG with the baseline Separate, we show that it is essential to train the multiple overlapping but distinct DAGs in our multitask learning manner. Conclusion: We compared our proposed MM-DAG model to the MV-DAG model to verify the contribution of the multi-modal design. Additionally, we compared MM-DAG to the Order-Consistence, Matrix-Difference, and Separate models to demonstrate the effectiveness of our Causal Difference design. By combining these two comparisons, we have shown the effectiveness of both designs. § NEW SUMO SCENARIO We constructed a more complex traffic scenario in SUMO, where 5 neighbor intersections in FengLinXi Road are used. In this case, the 5 intersections are not independent of the others. The detailed SUMO settings are as follows: * For the OD demand, we set OD demand as the number of total OD pairs in a scenario and randomly assign the origin and destination for each OD pair in the SUMO. * For the turning probability, we calculate the turning vehicles at each intersection and divide by the total number of vehicles. * The definition and collection of the remaining variables remain unchanged. * In this new scenario, there is a new cause of congestion: [sup-demand], corresponding to OD demand exceeds the capacity of the intersection, as shown in Task 2 of our new results in Fig. <ref>. Yet this cause of congestion never occurred in the old scenario, so we did not plot this node in the DAGs of the old case study. We have 96 samples in total, where each sample corresponds to a scenario in FengLinXi Road (Seeing Fig. <ref>). For each task, the data is collected by the sensors of the corresponding intersection. The result is shown in Fig. <ref>. We give an interpretation of the difference in DAGs between the old scenario and the new scenario. In the old scenario, the 5 intersections are independent. But in the new scenario, the 5 intersections are cascaded and dependent. The variable [OD-demand] is shared in all the DAGs since all the tasks used the same OD-demand. In the future revised manuscript, we will add both the independent case and dependent case, and the two cases have their own real-world applications. * Independent case: In the starting phase of deploying the traffic control systems, usually several single intersections are selected for the trial and cold-start. This trial period sometimes will last for more than one year and those intersections are usually scattered around different regions of a city. * Dependent case: When the traffic signal control systems scale up and more intersections are signaled, sub-areas will be set up where up to eight intersections will be connected. As we could observe in the Fig. <ref>: * The results of the two cases are different, which are reasonable given the two different assumptions. * But we could still observe that the two results share quite consistent causal relations. For example, the thickest edges with weight > 0.5 are quite consistent in both independent and dependent cases. * And we do admit that in the Dependent Case, the DAGs have unexpectedly better properties: (1) The DAGs are more sparse; (2) There are more shared edges across five different tasks. For example, the edge "Lane-Irrational" to "Congestion" appears in all five tasks. § POTENTIAL FUTURE WORK In future work, we may like to try some deep learning methods. For example, we can consider incorporating layers able to deal with functional data <cit.>, and then extracting nonlinear features for all the nodes using graph neural network <cit.>. § ACKNOWLEDGEMENTS This paper was supported by the SenseTime-Tsinghua Research Collaboration Funding, NSFC Grant 72271138 and 71932006, the BNSF Grant 9222014, Foshan HKUST Projects FSUST20-FYTRI03B and the Tsinghua GuoQiang Research Center Grant 2020GQG1014.
http://arxiv.org/abs/2306.10797v2	20230619093718	Variability of echo state network prediction horizon for partially observed dynamical systems	[ "Ajit Mahata", "Reetish Padhi", "Amit Apte" ]	eess.SY	[ "eess.SY", "cs.LG", "cs.SY", "math.DS" ]	[email protected] Department of Data Science, Indian Institute of Science Education and Research, IISER Pune, India 411008 [email protected] Department of Data Science, Indian Institute of Science Education and Research, IISER Pune, India 411008 [email protected] Department of Data Science, Indian Institute of Science Education and Research, IISER Pune, India 411008 International Centre for Theoretical Sciences (ICTS-TIFR), Bengaluru, India 560089 Study of dynamical systems using partial state observation is an important problem due to its applicability to many real-world systems. We address the problem by proposing an echo state network (ESN) framework with partial state input with partial or full state output. Application to the Lorenz system and Chua’s oscillator (both numerically simulated and experimental systems) demonstrate the effectiveness of our method. We show that the ESN, as an autonomous dynamical system, is capable of making short-term predictions up to a few Lyapunov times. However, the prediction horizon has high variability depending on the initial condition - an aspect that we explore in detail using the distribution of the prediction horizon. Further, using a variety of statistical metrics to compare the long-term dynamics of the ESN predictions with numerically simulated or experimental dynamics and observed similar results, we show that the ESN can effectively learn the system's dynamics even when trained with noisy numerical or experimental datasets. Thus, we demonstrate the potential of ESNs to serve as cheap surrogate models for simulating the dynamics of systems where complete observations are unavailable. Variability of echo state network prediction horizon for partially observed dynamical systems Amit Apte Received 29 October 2022 / Accepted 26 February 2023 ============================================================================================= Machine learning techniques have been widely used for forecasting and classification tasks for the dynamical system. Reservoir computing (RC) based techniques, and in particular, echo state networks (ESN), are gaining popularity due to their various advantages. Predicting the dynamical system using RC based on partial observations of a system is a problem of great practical interest and is the main focus of this article. We propose an ESN framework to capture the full-state dynamics where partial state observations of the dynamics are known. Our method is tested for numerical as well as experimental data for low-dimensional dynamical systems. We show that this method can predict the short-term chaotic time series and approximate the long-term statistical properties of the dynamics. Different metrics have been estimated to quantify the results. Further, we demonstrate that the prediction horizon using this method depends on its initial condition. The performance of our RC method has been checked with different noise levels. Our proposed method could be used to accurately approximate the full state dynamics of various real-world systems. § INTRODUCTION Prediction of chaotic dynamical systems is a challenging task due to exponential divergence of uncertainties in initial conditions. A variety of techniques have been developed to address this problem. <cit.> Machine learning and neural networks have become a popular choice for forecasting such systems due to the universal approximation properties as well as computational efficiency. <cit.> We first review these recent approaches to the study of dynamical systems before discussing the details and novelty of the present study which aims at addressing the problem of prediction and estimation of statistical properties of dynamical systems using partial observations with the use of echo state networks. There have been many recent attempts at studying chaotic dynamical systems using artificial neural networks (ANN), <cit.> recurrent neural networks (RNN) <cit.> and long short term memory networks (LSTM). <cit.> An exhaustive study of many of these and other machine learning approaches is provided in Ref. gilpin2021chaos. Reservoir computing (RC) <cit.> is one of the recent techniques that aims to address some of the problems related to requirements of large data or computational efforts and vanishing gradients <cit.> and has become an increasingly popular alternative. RC has been successfully used in various prediction tasks, namely, automatic speech recognition, <cit.> financial time series prediction, <cit.> natural language processing, <cit.> and image identification. <cit.> Over the years several modifications and improvements to the basic RC framework have also been proposed. <cit.> In the context of dynamical systems, RC has been used to replicate attractors of chaotic systems, <cit.> as well as for the problem of next-step prediction and to study the long term behaviour using correlation dimension, maximal Lyapunov exponent etc. <cit.> using full-state of the system. A natural variation is the use of partial state of a dynamical system to assess the performance of RC, vis-a-vis other techniques such as ANN or RNN, in capturing the system dynamics. <cit.>. Recent theoretical results <cit.> prove existence of an echo state map from a dynamical system’s phase space to the reservoir space of an appropriately constructed echo state network (ESN), leading to topologically conjugate description of the dynamics. Reconstruction or prediction of the full-state dynamics using partial observation based on the RC method has been studied extensively. Most studies <cit.> use time delay embedding techniques to achieve this. We note that the time delay embedding leads to a topologically equivalent description that is not in terms of the original coordinates and usually the mapping from the original coordinates to these topologically conjugate coordinates is not learned by these techniques. On the other hand, the prediction of `unobserved' variables of the Lorenz 63 system using partial state ESN has been studied as well. <cit.> Our work specifically builds on the ideas of Ref. lu2017reservoir, hart2020embedding, chattopadhyay2020data and presents a novel framework for reconstructing the dynamics of a system from partial observations. Since no time delay embedding techniques are used, we are able to obtain the dynamics of the system in the original coordinates. The present study is motivated by the following scenario which is commonly encountered in many applications, including those in earth sciences. Suppose we are interested in an n-dimensional dynamical system for which we have partial and noisy observations of m ≤ n variables, whereas we are interested in the prediction of a larger number l ≤ n of variables with l ≥ m. This is quite common in most systems in earth science, including the ocean and the atmosphere - for example, we may have temperature, rainfall, and other observations at a few locations but are interested in predictions of these variables at a larger number of locations. Thus the number m of observed variables is smaller than the number l of variables that we want to predict, both of which are smaller than the dimension n of the dynamical system itself: m ≤ l ≤ n. This is exactly the setup that we investigate in this paper as explained in detail in Sec. <ref>, in particular, in discussion around Eq. (<ref>)-(<ref>). Specifically, we use an ESN with an m-dimensional input vector and an l-dimensional output vector, in order to study an n-dimensional dynamical system, with m ≤ l ≤ n. The cases with l = n or l < n are called, respectively, the full state output or the partial state output. The cases with m = n (which of course, requires l = n) or m < n are called, respectively, the full state input (which requires full state output) or the partial state input. The main focus of this paper (see the results in Sec. <ref>) is on the case of partial state input and full state output, though we also provide brief comparisons with the other two cases, namely full-input, full-output (see Sec. <ref>) and partial-input, partial-output (see Sec. <ref>). Note that the requirement m ≤ l ≤ n implies that the fourth potential combination of full-input, partial-output is not feasible. We also note that in our setup, the ESN during the prediction phase is an autonomous dynamical system and can be used for prediction of time series of arbitrary length, instead of being restricted to making one-step predictions. This is described in detail in section <ref>. To summarize, our main objectives in this study are as follows: (a) Study chaotic dynamical systems using ESN with partial state input and full state output; (b) Evaluate the performance of ESN, with training data coming either from ODE simulation (Chua's oscillator and Lorenz 63 model) or from experimental observations (only for Chua's oscillator); (c) Use a variety of metrics that capture the performance of ESN either for a specific trajectory (mean squared error and prediction horizon) or for statistical quantities (maximal Lyapunov exponent, sample entropy, rate of growth of mean square displacement, kernel density estimates of the distributions); (d) Study of the variation of the prediction horizon with varying initial conditions; (e) Compare the performance of the ESN with partial or full state input or output. As far as we know, no previous studies have considered ESNs trained with experimental observations using partial state input to predict full state output, although there have been studies on ESNs that are trained on experimental data from Chua's oscillator. <cit.> In addition, one of the novelties of the present work is a detailed study of the distribution of the prediction horizon (that captures predictability) for an ensemble of different initial conditions. We note that this distribution is surprisingly wide, indicating that the predictability of the system using ESN is highly dependent on the initial conditions. This is compared with the prediction horizon obtained by perturbing the initial condition. The rest of the paper is organized as follows. In Sec. <ref>, we describe the specific architecture of ESN used in this paper followed by an introduction to the different metrics used to assess the performance of the ESN in Sec. <ref>. The specific dynamical systems used in this study are described in Sec. <ref>. The main results and discussion are presented in Sec. <ref>. Finally, we summarize in Sec. <ref> the main conclusion and indicate some directions of future research. § METHODS OF ANALYSIS We first give a general introduction to the reservoir computing framework in Sec. <ref>. This is followed in Sec. <ref> by the description of the specific way in which a part of the state vector of a dynamical system is used as input and output of the ESN in order to be able to emulate only the observed state variables using the ESN. In Sec. <ref>, we give a heuristic explanation for understanding why such a method may work. §.§ Reservoir computing Reservoir computing (RC) is a machine learning method that employs the dynamics of an internal system called the reservoir to transform one time-dependent signal (input signal) into another time-dependent signal (output signal). Often the output is just a time-delayed version of the input, thus converting RC into a tool for predicting or simulating autonomous dynamical systems. In this paper, we use the simplest form of RC architecture, the echo-state network (ESN) that was first introduced by Jaeger. <cit.> The general architecture of an ESN is depicted in Fig. <ref>, which comprises three layers: the input layer, the reservoir, and the output layer. The input weight matrix W^ projects the input 𝐮(t) ∈ℝ^m into a higher dimensional reservoir state 𝐱(t) ∈ℝ^N. The reservoir consists of a dynamical system on N nodes interconnected to form a randomly generated graph, described by the adjacency matrix, denoted by 𝐖. The reservoir state is updated at every step according to Eq. (<ref>). 𝐱(t) = (1-α) 𝐱(t-1) + ασ(𝐖^𝐮'(t)+𝐖𝐱(t-1)) , where 𝐮'(t)=(1,𝐮(t))^T∈ℝ^1+m is the combined bias and input vector at time t, and σ: ℝ→ℝ is a nonlinear function that acts on the argument component-wise. We choose σ(·) = tanh(·) throughout this paper. The weight matrix 𝐖^ and the adjacency matrix 𝐖 are initialized randomly from the uniform distribution 𝒰(-0.5, 0.5) and remain fixed for a specific ESN. The output of the ESN is a linear transformation of the reservoir state and the input vector under W^. 𝐲(t) = 𝐖^out (1,𝐮(t),𝐱(t))^⊺ . Thus given a sequence of T input-output pairs (𝐮(t), 𝐲^(t)) for t = 1, 2, …, T, and with a choice of 𝐱(0), we can think of the reservoir as a non-autonomous dynamical system that generates a sequence of states 𝐱(1), 𝐱(2), …𝐱(T) which can then be mapped to a sequence of T outputs 𝐲(1), 𝐲(2), …𝐲(T). The “training” of the ESN consists of finding the output weight matrix 𝐖^out such that this ESN output sequence {𝐲(t)}_t=1^T is “close” to the target output sequence {𝐲^(t)}_t=1^T. It is common to use the L_2 metric to measure the distance between 𝐲(t) and 𝐲^(t). This leads us to the cost function J_β(𝐖^out) = ∑_t=1^T 𝐲^(t) - 𝐲(t) ^2 + β𝐖^out^2 which is minimized with respect to 𝐖^out. The second term in the cost function is the Tikhonov regularizer used to ensure convexity. Note that the first term depends on 𝐖^out through the linear dependence of 𝐲(t) on 𝐖^out, as seen in Eq. (<ref>). Since J(·) is quadratic with respect to 𝐖^out, it has a unique minimum given below. (With slight abuse of notation, we denote the minimum by the same symbol 𝐖^out.) 𝐖^ = 𝐘^𝐗^⊺(𝐗𝐗^⊺+β𝐈)^-1 . In Eq. (<ref>), 𝐗 is the matrix with j^th column given by (1,𝐮(t),𝐱(t))^⊺ and 𝐘^ is the matrix with 𝐲^(t) as columns, for each 1 ≤ t ≤ T. Once the output layer is “trained,” we fix the optimal weight matrix 𝐖^ and use it for future predictions. For prediction, given just an input sequence 𝐮(t), the prediction time series sequence 𝐲̂(t) is obtained using Eq. (<ref>). 𝐲̂(t)=𝐖^(1,𝐮(t),𝐱(t))^⊺. Since the matrices 𝐖^ and 𝐖 are not part of the training process, it is desirable for the dynamics of the reservoir to satisfy the so-called “echo state property" which can be stated heuristically as follows: <cit.> The network state at any time t is a function of the left-infinite input sequence: 𝐱(t) = F(…, 𝐮(t-1), 𝐮(t)), i.e., the semi-infinite input sequence from the past determines the present reservoir state. A sufficient condition [Ref.[Proposition 3]jaeger2001echo] is that the largest singular value of the weight matrix 𝐖 be less than one. Thus, the matrix with entries chosen randomly is simply rescaled to set the spectral radius (maximum eigenvalue) to be some desired value less than one. The performance of the RC depends on the choice of the spectral radius ρ, reservoir size N, 𝐖^, 𝐖, and the parameter α. <cit.> The optimal values of these parameters will depend on the prediction task. We chose them through a trial and error process, so the choice is not optimal in any mathematically precise sense but rather in a heuristic sense. The problem of choosing hyperparameters in a systematic manner has been addressed in Ref. RACCA2021252. §.§ Using RC to reconstruct the system dynamics from partial observations When the output 𝐲(t) of the ESN, or some function of it, is fed back as the input 𝐮(t+1) at the next time, the ESN acts as an autonomous dynamical system and thus can be used to predict time series of arbitrary lengths. A natural question is how well it can “simulate” other dynamical systems. Indeed this idea has been investigated quite extensively since the introduction of ESN in the work of Jaeger. <cit.> Most of these studies have used ESN with both the input and output to be of the same dimension as the dynamical system being studied. The main aim of this paper is to study how well the ESN can approximate a given dynamical system in the case when we use only a part of the state space as an input and/or output to the ESN. These will be distinguished as full or partial state input and full or partial state output. We now describe the details of such a methodology in this section. Consider an autonomous dynamical system of dimension n given by Eq. (<ref>). 𝐩(t+1)=𝐠(𝐩(t)) , 𝐩(t) ∈ℝ^n In this system, suppose that only l out of the n variables are “observable” with l ≤ n and the remaining variables are unobserved. Our goal is to train an ESN that can predict the next state of these l observed variables using the current state of just m input variables, with m ≤ l. We assume that the observed variables correspond to the first l components of 𝐩(t) by relabeling indices of 𝐩(t). The ESN will be trained by using the observed variables of a trajectory 𝐩(0), 𝐩(1), …, 𝐩(T) of length T+1. In the framework introduced in the previous section, we will use the following input-output pairs for training: 𝐮(t) = [p_1(t-1), p_2(t-1), …, p_m(t-1)]^⊺∈ℝ^m , 𝐲^(t) = [p_1(t), p_2(t), …, p_l(t)]^⊺∈ℝ^l , for t = 1, 2, …, T , where p_i(t) is the i-th component of the state vector 𝐩(t). Once the output layer is “trained,” which corresponds to finding the optimal 𝐖^ as given in Eq. (<ref>), we can use the ESN for prediction of the observed variables using the following strategy. Suppose we want to predict the observed variables of a trajectory of the system (<ref>) with initial condition 𝐏 = 𝐩(T+1) ∈ℝ^n. Then we set the input of the ESN to be the first m components of 𝐏, i.e., 𝐮(T+1) = [P_1, P_2, …, P_m]^⊺ and we use 𝐱(T) as the state of the internal nodes. Then for every t > T, we can use the first m components of the l-dimensional output 𝐲̂(t) as the next input 𝐮(t+1). This is shown schematically below: [ [ 𝐮(t); 𝐱(t-1) ]] 𝐖,𝐖^,σ [ [ 𝐱(t) ]] , [ [ 𝐮(t); 𝐱(t) ]] 𝐖^𝐲̂(t) ≡[ [ 𝐮(t+1); p̂_m+1(t+1); ⋮; p̂_l(t+1) ]] ∈ℝ^l , where the boxed quantities are then used at the next time step and the loop continues. Denoting by π_m the projection map onto the first m coordinates, we notice that 𝐮(t+1)= π_m ∘𝐲̂(t). We also note that the whole vector 𝐲̂(t) is basically the ESN prediction of the l observed variables p̂_1(t+1), …, p̂_m+1(t+1), …, p̂_l(t+1) of the state vector 𝐩(t+1), i.e., they can be compared with π_l ∘𝐩(t+1). Thus, during this prediction phase, the ESN is an autonomous dynamical system and its properties can then be compared with the original dynamical systems which generated the data used for training. In the case when we want to use the reservoir (after training) to predict the trajectory of an initial condition different from the one that is the final training point, i.e., when 𝐏 is an arbitrary point in the state space, a few time steps (denoted by c) will be required to initialize the reservoir. Thus, in the prediction process described above, we initialize the reservoir state to be 𝐱(T) = 0 while the input is a part of the trajectory of 𝐏, i.e., 𝐮(T + t) = π_m( 𝐠^t (𝐏)) for t ≤ c. The comparisons with numerically generated trajectories shown below do not include the first few steps, i.e., the comparison is done for t > T + c for where c is around a couple of Lyapunov times of the system. §.§ Independance of the rows of 𝐖^out We recall from Eq. (<ref>) the expression for 𝐖^out: 𝐖^out =𝐘^target A , where A = 𝐗^⊺(𝐗𝐗^⊺+β𝐈)^-1 which depends only on the inputs and the reservoir states. Writing 𝐖^out as a matrix with rows 𝐰_j^out for 1≤ j ≤ l, we get, [[ 𝐰_1^out; ⋮; 𝐰_l^out ]] = [[ y^target_1(1) … y^target_1(T); ⋮ ⋮; y^target_l(1) … y^target_l(T) ]] A , we notice that the expression for 𝐰^out_i is independent of other components {y^target_j(t)}_t=1^T where j≠ i. In other words, we do not require the components {y^target_j}_t=1^T to calculate 𝐰^out_i if j≠ i. Consider the situation where we have two ESNs – ESN1 and ESN2 – both of which take a one-dimensional input 𝐮(t) ∈ℝ, but ESN1 gives output 𝐲_1(t) ∈ℝ^3, while ESN2 gives output 𝐲_2(t)∈ℝ. Suppose we also choose 𝐖^in, 𝐖, α, β to be the same value for both ESNs, it then follows from Eq. (<ref>) that 𝐖_1^out for ESN1 would match exactly with 𝐖^out of ESN2. This means that the predicted series generated by 𝐖_1^out of ESN1 and 𝐖^out should be the same. Indeed, we discuss the numerical comparison of two such ESNs in Sec. <ref>. From the above discussion, it is also clear that the prediction of the i-th variable p̂_i for i > m is not necessary for the ESN since only the first m variables are used as the next input. In other words, the case of l > m and the case of l = m, during the prediction phase, give the same results. §.§ ESN as polynomial approximation As shown in Ref. bollt2021explaining, an echo state network with a linear activation function can be expressed as a Vector Autoregression model (VAR). The reservoir state 𝐱(t) for a linear ESN can be written as a linear combination of 𝕌(t),𝕌(t-1),…,𝕌(t-k) where 𝕌(t)=𝐖^u'(t) as shown below, for the case σ(x) = x: 𝐱(t) = (1-α)𝐱(t-1) + α(𝕌(t) + 𝐖𝐱(t-1)) = 𝐌^k𝐱(t-k) + α∑_j=0^k-1𝐌^j 𝕌(t-j) , where 𝐌 is a matrix defined such that 𝐌=(1-α) 𝐈 + α𝐖. As shown in Ref. jaeger2001echo, a sufficient condition for the ESN to have the echo state property is that the spectral radius of 𝐌 is less than 1. In such a case, for a sufficiently large k, the term ϵ_t = 𝐌^k𝐱(t-k) ≈ 0 and 𝐱(t) can be written as: 𝐱(t) ≈α∑_j=0^k-1𝐌^j 𝕌(t-j). Eq. (<ref>) gives the expression for the ESN prediction 𝐲̂(t) for a target variable 𝐲(t) ∈ℝ^l, bias-input vector 𝐮'(t) ∈ℝ^1+m and 𝐖^=(a_0,A), where a_0 ∈ℝ^l×ℝ^1+m and A ∈ℝ^l×ℝ^N. ŷ(t) = a_0𝐮'(t)+A𝐱(t) = a_0𝐮'(t) + α∑_j=0^k-1 A 𝐌^j 𝕌(t-j). As shown in Eq. (<ref>), training the ESN is equivalent to finding optimal coefficients for a linear autoregression problem. However, most functions cannot be well approximated by a linear function of past inputs. Additionally, in practice, it is seen that ESNs with non-linear activation functions such as tanh perform much better than ESNs with a linear activation function. In Eq. (<ref>), we consider an ESN with x-x^3/3 (the third order power series approximation of tanh) as the activation function. Note: A∘ B and A^∘ b denote the elementwise (Hadamard) product and elementwise power of matrices respectively. 𝐱(t) = (1-α)𝐱(t-1) + α(𝐖^𝐮(t) + 𝐖𝐱(t-1)) +α/3 (𝐖^𝐮(t) + 𝐖𝐱(t-1))^∘ 3 = α𝕌(t) + α/3𝕌(t)^∘ 3 + α/3(3𝕌(t)^∘ 2∘𝕏(t-1) + 3𝕌(t)∘𝕏(t-1)^∘ 2 + 𝕏(t-1)^∘ 3 ) + 𝐌𝐱(t-1) = α𝕌(t) + α𝐌𝕌(t-1) + … + α/3𝕌(t)^∘ 3 + α/3𝐌𝕌(t-1)^∘ 3 + … + α^2𝕌(t)^∘ 2∘𝐖𝕌(t-1) + … + α^2𝕌(t)^∘ 2∘𝐖𝕌(t-1)^∘ 3 + … + other terms. The addition of the extra nonlinear x/3 term results in higher order polynomial terms of 𝕌(t) in the expression for 𝐱(t) as shown in Eq. (<ref>). It follows that as we take higher order polynomial terms of the tanh power series expansion, 𝐱(t) can be written as a linear combination of higher order polynomial terms of the form 𝕌(t-k)^∘ q and 𝕌(t-k)^∘ q'𝕌(t-k')^∘ q” for q,q'∈ℕ among many others. Analogous to the linear activation case, we obtain an expression for ŷ(t) in Eq. (<ref>). ŷ(t)= a_0𝐮'(t)+A[ [ ; 𝕌(t-k)^∘ q,𝕌(t-k)^∘ q'𝕌(t-k')^∘ q”; ]]. The rate at which the higher lag terms decay depends on the values of the spectral radius of 𝐌 and choice of α. From Eq. (<ref>) it is clear that the coefficients of 𝕌(t-k)^∘ q terms become progressively smaller as k increases whenever the echo state property is satisfied. By the above argument, we can expect an ESN to reasonably model the partial dynamics of the system mentioned in Sec. <ref> if given 𝐲(t) ∈ℝ^l there exist 𝐟_1,𝐟_2,…,𝐟_l and appropriate δ∈ℕ such that Eq. (<ref>) holds ∀ 0≤ i≤ l. y_i(t) =𝐟_i(𝐮(t), 𝐮(t-1),…,𝐮(t-δ)). Thus, the output weights of a sufficiently large network (N ≫ m) are computed such that the RHS of Eq. (<ref>) is a finite polynomial approximation, using 𝕌(t-k) terms, of the map 𝐟_i given in Eq. (<ref>). § COMPARISON MEASURES We use a variety of different quantities to quantify how well the ESN may capture the dynamics of a system. This section defines the various metrics used to compare the ESN predictions with the simulations of the system (using Runge-Kutta time discretization of the ODE) or with experimental data. These metrics are: prediction horizon; maximal Lyapunov exponent; asymptotic growth rate used in the 0-1 test for chaos; sample entropy; kernel density estimation. §.§ Prediction Horizon and Predictability Recall that the cost function defined in Eq. (<ref>) measures how far the ESN prediction is from the actual target trajectory. Considering it as a function of the two trajectories and dividing by the length of the time series and the number of dimensions, we define it as the mean squared error (recall 𝐲(t) ∈ℝ^m): _T(𝐲^(t), 𝐲(t)) ≡ J_0(𝐖^out) = 1/T m∑_t=1^T 𝐲^(t) - 𝐲(t) ^2 Using the , the prediction horizon PH_j(r) for a specific target trajectory indexed by j and with a tolerance parameter r is defined as, PH_j(r) = inf{T \|_T (𝐲_j^(t), 𝐲_j(t)) > r }. Simply put, the prediction horizon PH_j(r) is the first time at which the mean squared error between the j-th target 𝐲_j^ and ESN predicted series 𝐲_j exceeds a chosen threshold r. In this paper, the target series is either an orbit generated from an initial point by the ODE solver (RK45) or an experimentally observed time series. Since some regions on the attractor are `easier' to predict than others, it is clear that PH_j(r) depends on the initial condition chosen to generate 𝐲_j^. This means that the prediction horizon at a specific point on the attractor only describes the ESN's ability to predict the series from that point alone, making it a local quantity. To evaluate the performance of the ESN over the whole attractor, we need to consider the distribution of prediction horizon values, for a fixed value of r, over many initial points on the attractor. (See later Fig. <ref>, <ref> for examples of such distributions.) We calculate the median prediction horizon P(r) of the ESN for the attractor as the median of this distribution. P(r) = median{PH_j(r), 1 ≤ j ≤ n}. The reason for using the sample median and not the sample mean is that the PH_j(r) distribution tends to be skewed and the median is a more reliable measure of the central tendency not affected by outliers or tails. We note that this quantity P(r) is very similar to the quantity used in Ref. pathak2018hybrid called “valid time.” The prediction horizon of course depends on the tolerance parameter r. As r is arbitrary, we have calculated the prediction horizon with different values of r and the variation of PH is discussed in detail in Sec. <ref>. §.§ Maximal Lyapunov Exponent Lyapunov exponents for a dynamical system describe the rate of separation of two infinitesimally close trajectories. Heuristically, if δ x(0) is the initial separation between two nearby phase space trajectories, then their separation at time t would be δ x(t)≈δ x(0) e^λ t, where λ is the Lyapunov exponent. The rate of separation can vary depending on the orientation of the initial separation vector. As a result, there is a spectrum of Lyapunov exponents proportional to the dimensionality of the phase space. The largest of these exponents is commonly referred to as the maximal Lyapunov exponent (MLE). A positive MLE is an indication that the system is chaotic. The details of the method we use for estimating MLE can be found in Ref. rosenstein1993practical. It should be noted that an arbitrary initial separation vector will typically contain some component in the direction associated with the MLE, and the effect of the other exponents will be obliterated over time due to the exponential separation rate. The characteristic timescale of a dynamical system is measured in terms of its Lyapunov time which is equal to the inverse of the MLE. Consequently, the MLE of a dynamical system is a valuable metric for describing the long-term behaviour of a system. Hence we use the MLE of the ESN predicted and the original time series as one of the measures of the ESN performance. Further, all results (such as the prediction horizon) in the subsequent sections are reported in terms of the Lyapunov time since it allows us to compare results across different dynamical systems. §.§ 0-1 Test for Chaos The 0-1 test <cit.> is a binary test used to distinguish between regular and chaotic dynamics. In order to determine if a time series is chaotic or not, it can be used as a helpful confirmation test. Unlike the calculation of the Lyapunov exponent, this method does not require the use of reconstruction methods. The details of the test are discussed in Ref. gottwald2009implementation. We use the asymptotic growth rate K_c of the mean square displacement as another measure of evaluating the performance of the ESN. §.§ Sample Entropy The sample entropy (SE) of a time series is defined as the negative natural logarithm of the conditional probability that two sequences similar for N points remain identical at the next point, excluding self-matches. A lower SE value corresponds to a higher probability that two similar sequences remain similar at the next point. SE is a commonly used method to quantify the complexity and irregularity of time series data generated by dynamical systems. Therefore, it serves as a useful metric to compare the similarity of the predicted and original sequences. The details of the method of estimation of SE can be found in Ref. delgado2019approximate. §.§ Kernel density estimation A kernel density estimation (KDE) plot is a useful tool for visualizing the distribution of a data set. In our study, we used KDE for the comparison between the ESN-predicted time series and the simulated or experimental time series. The details of KDE can be found in Ref. vermeesch2012visualisation. § SYSTEMS SELECTED FOR THE STUDY We have selected Lorenz 63 and Chua's circuit for this study. We use the standard Lorenz 63 system given by the following system of equations: ẋ = σ(y-x) , ẏ = x(ρ - z) - y , ż = xy-β z . with the standard choice of parameters: σ=10,ρ=28,β=8/3. Fig. <ref> shows Chua's oscillator circuit that we use, both in the simulation and in the experiments. The circuit contains linear capacitors and inductor, and linear and nonlinear resistors, with the nonlinear resistor constructed using OP-AMP. The dynamics of the system can be written as follows: C_1 V'_1 = (V_2-V_1)/R-g(V_1) , C_2 V'_2 = (V_1-V_2)/R+I_L , L I'_L = -V_2-R_0I_L . where the prime denotes d/dτ with τ being time in seconds, g(V_R) is the current through the nonlinear resistor given by g(V_R) = G_bV_R+0.5(G_a-G_b)(\|V_R+B_p\|-\|V_R-B_p\|) . Here, G_b and G_a are the slopes of the outer and inner regions of the current-voltage graph. +B_p and -B_p are the breakpoints of the graph. We converted this equation into non-dimensional form by considering x=V_1/B_p, y=V_2/B_p, z=RI_L/B_p, and t = τ/RC_2. So, the non-dimensional form of the Chua's circuit is given by the following system of equations: ẋ = α(y-x-ϕ(x)) , ẏ = x - y + z , ż = -β y - γ z . where ϕ(x) is the non linear function given by ϕ(x) = m_1x + 1/2(m_0-m_1)(\|x+1\| - \|x-1\|) . The definitions and the values of the various non-dimensional parameters that we use are as follows: α=C_2/C_1 = 10.0, β=R^2C_2/L = 9.77, γ=RR_0C_2/L = 0.58, m_0=RG_a = -0.735 and m_1=RG_b = -1.301. §.§ Experimental setup of Chua's circuit We have constructed Chua's circuit in an experimental set-up with the schematic diagram shown on the left side in Fig. <ref>. TL082 OP-AMP and linear resistors R_0, R_1, R_2, R_3, R_5 and R_6 have been used to construct the nonlinear resistor N_R acting as Chua's diode, which is shown in the right side of Fig. <ref>. The values of the inductor, resistors and capacitors have been chosen in the following way: R_0=83 Ω, R_1=220 Ω, R_2=220 Ω, R_3=2.2 KΩ, R_4=22 KΩ, R_5=22 KΩ, R_6=3.3 KΩ, C_1=10 nF and C_2=100 nF. In the experimental setup, R is varied by using a 5 KΩ potentiometer in order to get different types of dynamics - chaotic or regular. The voltages V_1, V_2 across the capacitors C_1, C_2 are measured directly. To measure the current through the inductor, we measure the voltage across the inductor V_3, then calculate the voltage V_0 across the resistance R_0 to be V_0=(V_2-V_3), and finally, the current through the inductor is calculated as I_L=V_0/R_0. In this set-up, we observe that at R=1.398 KΩ, the dynamics show the double scroll attractor. In this condition, we collected the I_L, V_2, and V_1 time series to study the dynamics using reservoir computing. § RESULTS AND DISCUSSION As mentioned earlier, the main focus of this paper is on evaluating the performance of ESN with partial state input (namely, one-dimensional input) and full state output (namely, three-dimensional output). These results are discussed in the main Sec. <ref> below. We also implemented the variation of the ESN where the input is the three-dimensional full-state vector, and the comparison with the partial state input is discussed in Sec. <ref>. The other variation we discuss is the case when the output is a one-dimensional partial state, with the results in this case being discussed in Sec. <ref>. §.§ Study of Chua's oscillator and Lorenz 63 dynamics: ESN with full state output This section discusses all the results for the following setup: the ESN input is one-dimensional (partial state), while the output is three-dimensional (full state). The three systems studied are: Chua oscillator ODE simulations, Lorenz 63 ODE simulations, and experimental data from the Chua circuit setup described in Sec. <ref>. In the notation of Eq. (<ref>) or (<ref>), the network was trained to predict all three variables x(t+1), y(t+1), z(t+1) using just x(t) as input. Thus in the notation of Sec. <ref>, 𝐮(t) ∈ℝ is x(t) of Eq. (<ref>) or (<ref>) and 𝐲(t) ∈ℝ^3 is (x(t), y(t), z(t)). We note that the ODE simulations use the dimensionless form of equations and corresponding dimensionless data for ESN training and testing while in the case of the experimental system, the ESN is trained and tested against the dimensional variables of voltage and current (V_1, V_2, I_L) in the units of V and A, instead of (x, y, z). Chua's circuit equations were solved using RK45 with Δ t=0.05 to generate a dataset of 75000 datapoints (≈ 400 Lyapunov times). Similarly, Lorenz 63 equations were solved using RK45 with Δ t=0.01 to generate a dataset of 100000 datapoints (≈ 950 Lyapunov times). For ESN trained on experimental data, we used Δ t = 0.057 (non-dimensional, corresponding to Δτ = 8 × 10^-6 s and a dataset of 120000 datapoints (≈ 750 Lyapunov times). In all these cases, the ESN was trained on 80% of the dataset, while the rest was reserved for testing. After training, a single initial condition (one component of the full state vector) along with the reservoir state was used to generate, following the method shown in Eq. (<ref>), a series of predictions, which are then compared with the test series obtained by numerical solution of the ODE. We first present both qualitative (Sec. <ref>) and quantitative (Sec. <ref>) evaluation of the ESN performance, followed by a detailed discussion of the variability of the prediction horizon for different trajectories (Sec. <ref> and Sec. <ref>). We examine the effects of noisy data (section <ref>) and then the results of ESN trained with experimental data (Sec. <ref>). §.§.§ Forecasting of Chua and Lorenz 63 dynamics Fig. <ref> illustrates a typical numerically simulated (solid line) and ESN predicted (dashed line) time series of the non-dimensional form of x, y, and z variables of the Chua's oscillator. The ESN can make successful short-term predictions but eventually diverges, as expected for a chaotic system. The time up to which the ESN predictions are close to the original trajectory is very different for different trajectories. In other words, the prediction horizon, defined in Eq. (<ref>), is highly dependent on the trajectory. A more extensive discussion of the full distribution for the prediction horizon is presented in Sec. <ref>. It is found that the median prediction horizon, as defined in Eq. (<ref>), for the ODE simulated Chua's circuit data with a threshold of 0.01, i.e., P(0.01), is 1.87 Lyapunov times. (See also Table <ref>.) Fig. <ref>(a) and (b) (top row) show the double scroll attractor of Chua's oscillator projected to the x-y plane for the simulated and the ESN predicted series, respectively. We see that both attractors are very similar in nature. Fig. <ref> shows the simulated (solid) and predicted (thin dashed) time series of x, y and z of the Lorenz 63 system, respectively. The median prediction horizon P(0.01) for the Lorenz system is 4.105 Lyapunov times, very similar to the Chua oscillator case. Fig. <ref> shows that the x-y plot for the ODE simulated (left) and ESN predicted (right) series, respectively, have attractors that are very similar in nature. We note that the usual time-delay embedding methods, based on Takens' embedding theorem, can reconstruct a dynamical system up to a homeomorphism or diffeomorphism, i.e., the reconstructed coordinates are functions of the original dynamical system. In contrast, the ESN predicts coordinates that are identical to the original coordinates, specifically due to the fact that the training is done using the original coordinates. In summary, RC can predict the short-term time series, but it fails to predict in the long run, shown in Fig. <ref> and Fig. <ref>, as is expected for a chaotic system. However, RC can capture the long-term dynamics for both cases, which can be seen by a visual inspection of the simulated and predicted attractors in Fig. <ref> and Fig. <ref>. §.§.§ Statistical characteristics of Chua and Lorenz models The results of the previous section suggest that the network is able to capture the statistical characteristics of the dynamics of the system. In order to quantify this, we use the following metrics: maximal Lyapunov exponent, sample entropy, 0-1 test for chaos, and the KDE plots. Table. <ref> (top panel) shows the maximal Lyapunov exponent (MLE), sample entropy (SE), and the asymptotic growth rate K_c of the 0-1 test (see Ref. [Section 3]gottwald2009implementation) for the simulated and predicted series for Lorenz 63 and Chua's oscillator. We note that all these statistical properties of the simulated and predicted series are nearly equal. Fig. <ref> shows the KDE plots of the simulated (solid) and ESN predicted (thin dashed) time series of Chua's oscillator for each of the three components of the system. The figures show that the statistical distribution of the simulated and predicted time series are similar in nature. A qualitatively similar result is also seen for Lorenz 63 system (figure for KDE plots not shown). Thus, from these comparisons of various statistical measures, we see that the ESN can capture the long-term dynamics of the system accurately. §.§.§ Study of MSE with time The MSE is a commonly used metric to compare the performance of neural networks in time series prediction tasks. The MSE curve denotes the evolution of MSE with time. We have already defined the MSE in Eq. (<ref>). Fig. <ref> shows the MSE curve over 200 Lyapunov times for Lorenz 63 model, for a typical trajectory. The MSE is close to 0 for a short period and increases rapidly thereafter, indicating the chaotic nature of the system, and eventually saturates. The zoomed-in plot shows the MSE curve for the initial period. The dotted lines (from left to right) represent the prediction horizon for r= 0.01, 0.1, and 0.3, respectively, as defined in Eq. (<ref>). The two series diverge quite quickly once the MSE crosses 0.3, implying that the short-term predictions are accurate only until that point. Despite the rapid increase, the MSE still remains bounded because both the test data and the predictions made by the ESN are bounded. The qualitative behaviour of the MSE as a function of time is very similar for different trajectories. But the time at which the MSE crosses a threshold r varies quite a lot. We will discuss the details of this variation next. §.§.§ ESN predictability compared to uncertainty in initial condition Fig. <ref> (left side) shows the distributions of PH(r) for three values of the threshold r = 0.01, 0.1, 0.3 for the Lorenz 63 system, using a sample size of 1000. We note that the distributions shown in these violin-plots demonstrate the variation of the prediction horizon with respect to the initial condition, in contrast with the violin-plot of the `valid prediction time' (VPT) used in Ref. vlachas2020backpropagation that shows the variations of VPT for different hyperparameters of the ESN. We see that with varying initial conditions, the prediction horizon can range from values very close to 0 (trajectories that are very difficult to predict using the ESN) to as large as 15 or more Lyapunov times (for trajectories with very high predictability). One way to understand this distribution is to compare with the predictability of the original system itself, as we discuss below. As is well known, for chaotic systems, a small initial uncertainty δ(0) shows exponential growth asymptotically in time, with the average growth rate determined by the Lyapunov exponent λ. Heuristically, the expression for δ(t) is, on an average, given by the equation δ(t)≈δ(0)e^λ t . It is also well known that the actual (not average) behaviour of δ(t) shows substantial variation based on the initial condition in the phase space. The value of time at which δ(t)^2 crosses a predetermined threshold thus depends a lot on the initial condition. Fig. <ref> (right side, shaded violin plots) shows the distributions of these times for a sample of 1000 trajectories, with initial distance δ(0)=2.22× 10^-3. (With varying δ(0), the median of the shaded distributions on the left in Fig. <ref> varies but the shapes remain qualitatively similar.) As expected, we again see a wide distribution where some neighbouring trajectories do not diverge beyond the threshold r = 0.01 for as long as 15 or more Lyapunov time units, whereas some do so at times very close to 0. We note that the shape and importantly the support of both these distributions – one for the ESN prediction horizon and other for the divergence times as explained above – are very similar to each other. Indeed, the initial distance δ(0)=2.22× 10^-3 was chosen so that the two distributions (on the left and right) “match” closely. The interpretation is that the ESN predictions are equivalent to those of the true system (ODE solver) with an uncertainty of the order δ(0)≈10^-3 in the initial conditions. §.§.§ Effect of Noisy training data Finally, we test to see if the ESN is robust to noisy datasets, i.e., whether the ESN can pick up the essential dynamics of the system despite the noise. Fig. <ref> shows the variation of the prediction horizon for the cases when the datasets have different levels of Gaussian noise added to the training data, i.e., simulated trajectories of the Chua's and Lorenz 63 systems with noise added. Note that we are not simulating a stochastic differential equation but just adding noise to the deterministic trajectory, similar in spirit to the use of noisy observations of a deterministic system in many application areas such as the earth sciences. The left and right sides of each plot indicate the Chua's and Lorenz 63 systems, respectively. The median prediction horizon along with the 25th and 75th percentiles are shown by horizontal dashed lines in each plot in Fig. <ref>. We see the median remains nearly constant for small amounts of noise, but when the noise amplitude is large, the ESN finds it difficult to learn the dynamics. Thus, the study reveals that ESN can capture the essential dynamic with a certain amount of noise, but it fails with higher noise levels. §.§.§ ESN trained using experimental data for Chua's oscillator We now discuss the performance of ESN in emulating the dynamics of the Chua circuit when trained and tested with experimental data. We recall that the ESN input is one dimensional (the voltage V_1) while the output is three dimensional – V_1, V_2, I_L dimensional variables (no pun intended). As with the previous section, Fig. <ref> shows a sample trajectory of the experimental (solid) and ESN-predicted (thin dashed) time series of V_1, V_2, and I_L, respectively. Note that in this case, we use the dimensional variables instead of the dimensionless variables. Further, these are not scaled in any way and the numerical ranges of the voltage and current variables are vastly different. The median prediction horizon P(0.01) is 2.173 Lyapunov times, very similar to the case of ESN trained using ODE simulated data. Fig. <ref> (c) and (d) (bottom row) show the double scroll attractor (V_1-V_2) for the experimental and predicted series, respectively. The attractor from the experimental data is not only noisy but also clearly shows the effect of the low resolution (compared to numerics) of the experimental measurements. But a striking feature is that the ESN predicted attractor is, in fact, able to capture the details that are not visible in the experimental dataset. Table <ref>, bottom row of the top panel, lists the comparison of the various statistical measures, namely, the maximal Lyapunov exponent, sample entropy, and the asymptotic growth rate for the 0-1 test of chaos, while Fig. <ref> shows the KDE plots for the experimental (solid) and ESN predicted (dashed) time series. Very similar to the previous case of training using simulated data, we see that the ESN trained using experimental data is also able to capture the statistical properties of Chua circuit dynamics. Besides studying the double scroll attractor, we have also studied different dynamics - periods one, three, and single scroll of Chua's oscillator. Fig. <ref> (a), (c), (e), and (b), (d), (f) represent, respectively, the experimental and ESN predicted dynamics for period one, period three, and a single scroll. We again see the remarkable result that even though the experimental measurements are, as expected, noisy and of a low resolution, the ESN trained using these noisy measurements is able to capture and predict the Chua circuit dynamics with high fidelity. A thorough theoretical investigation of this property of ESN will be a fruitful avenue for further research. §.§ Comparison of partial state input ESN with full state input ESN As discussed extensively in the previous sections, the ESN trained with one-dimensional partial state input and three-dimensional full state output is indeed able to model the dynamics of the full system quite well. Thus it is expected that the ESN can accomplish the same task using the full state input, as we now discuss. Thus, in this case, 𝐮(t) = (x(t), y(t), z(t)) ∈ℝ^3 and 𝐲(t) = (x(t), y(t), z(t)) ∈ℝ^3. ESNs with such a setup have been discussed in detail in previous studies. <cit.>. Hence this section is very brief and only discusses the comparison of full-state vs. partial-state input ESN using the distribution of the prediction horizon which has not been considered in previous studies. Since more input data is being provided to the ESN when trained with full-state input, it may be expected that its predictions will be more accurate than the partial-state input case. Fig. <ref> and Fig. <ref> show a comparison between the prediction horizon distribution for partial state input ESN (left side) and full state input ESN (right side). We see that the predictability of the full state input ESN is superior to that of the partial state input ESN for the case of the Lorenz 63 system (Fig. <ref>), but there is very little improvement in the case of the Chua oscillator (Fig. <ref>). It will be an interesting avenue of future research to investigate which dynamical characteristics of the Chua oscillator and Lorenz 63 model lead to such a difference and to provide a precise characterization of the kind of systems for which the partial and full state input ESN perform equally well as compared to the systems for which they do not perform equally well. §.§ Comparison of partial state output ESN with full state output ESN The other natural variation of the ESN will be to consider the case when both the input and output are partial states and not full states. Note that all the results in both the previous Sec. <ref> and Sec. <ref> are for ESN with three-dimensional full state output, i.e., 𝐲(t) = (x(t), y(t), z(t)) ∈ℝ^3, while in this section, we consider the case of one-dimensional partial state output: 𝐲(t) = x(t) ∈ℝ. We report some of these comparisons below. * Panels (a) of Fig. <ref>, Fig. <ref>, and Fig. <ref> show the time series (thick dashed) of ESN predicted variable x (or V_1) of the Chua ODE, Lorenz 63 model, and the Chua experimental cases, respectively. Of course, in this case, we cannot compare the model attractor (without using some additional technique, such as time delay embedding, which is not the focus of this paper). * Similarly, panels (a) of Fig. <ref> and Fig. <ref> show the KDE plot (thick dashed) of the variable x of the ESN simulation of Chua ODE, and of V_1 of Chua's experimental system, respectively. * Further, the bottom panel of Table <ref> shows a comparison of other statistical quantities, namely, the maximal Lyapunov exponent, the sample entropy, and the asymptotic growth rate for the 0-1 test. * It is also found that the prediction horizon is 3.125 Lyapunov times for Lorenz 63 partial variable x, 2.29 Lyapunov times for Chua's partial variable x, and 1.44 Lyapunov times for Chua's experimental variable V_1. (Plots of distributions of prediction horizon are not shown here.) We see that in all these qualitative and quantitative metrics, the performance of the partial state output ESN is very similar to the case of full state output ESN. § CONCLUSION In this study, we propose an echo state network (ESN) based approach for reconstructing the full state of a dynamical system from its partial observation. We demonstrate effectiveness of this framework with two examples: the Lorenz system and Chua's oscillator, including the use of experimental data for the latter system. We also provide a heuristic justification for our paradigm. A major contribution is a thorough investigation of the variability of the prediction horizon of a dynamical system across several initial conditions. We have demonstrated that ESN can predict the short-term time series up to a few Lyapunov times but fails eventually. However, there is large variability in the prediction horizon for different initial conditions. The distribution of prediction horizon values over many initial conditions is studied in Sec. <ref>, which we believe is a better way of quantifying the short-term predictability of the ESN. The similarity of this distribution with that of the time for divergence of nearby trajectories, as shown in Fig. <ref>, shows that this variability is an inherent characteristic of chaotic systems and not just a consequence of or a property of the use of ESN. A comparison of the predicted attractor with the simulated attractor seems to suggest that the ESN successfully replicates the system's long-term statistics. Several metrics, namely, the maximal Lyapunov exponent, sample entropy, the asymptotic growth rate of the mean square displacement used in the 0-1 test of chaos, as well as the kernel density estimates of marginal distributions of the dynamical variables described in Sec. <ref> have been used to quantify the results. The estimated values of these metrics for the ESN dynamics match closely with those obtained from the simulated or experimental data, providing strong evidence that the ESN can accurately capture the long-term dynamics, even when trained on noisy data. In Sec. <ref>, we compare our framework with the more commonly studied full-state input, full-state output schemes and we observe that the prediction horizon distribution and statistical measures are comparable for the two schemes. As we mentioned earlier, the performance of the ESN depends on the choice of the spectral radius ρ, reservoir size N, 𝐖^, 𝐖, and are chosen through a trial and error process. A detailed mathematical study of the effect of these choices on the performance of the ESN and ways to optimise these choices would be an interesting direction of future research. Finally, in Sec. <ref>, we observe that the ESN is able to capture the dynamics of the system very well with low noise levels, but as expected, with increasing magnitude of the noise, the prediction horizon reduces significantly. We also use noisy experimental data to train the ESN. In this case, the ESN is indeed able to capture the experimental attractor's dynamical characteristics quite well. This aspect of the ESN makes it an invaluable tool for application in the prediction of real-world datasets, at least in low-dimensional settings that we have studied. Applications of our framework to study high-dimensional dynamics as well as developing a theoretical understanding of the ability of ESN to `filter' the noise will be fruitful directions of future research. § ACKNOWLEDGMENT We would like to acknowledge the UG-Physics and Atomic Physics and Quantum Optics Lab, IISER Pune, for allowing us to conduct the experiments and would like to thank Korak Biswas for helping with the experimental work.
http://arxiv.org/abs/2306.02173v2	20230603183351	Time-reversible dynamics in a system of two coupled active rotators	[ "Oleksandr Burylko", "Matthias Wolfrum", "Serhiy Yanchuk", "Jürgen Kurths" ]	math.DS	[ "math.DS", "math.CA", "nlin.AO", "37C80, 34C15" ]	TransRUPNet for Improved Out-of-Distribution Generalization in Polyp Segmentation Debesh Jha1, Nikhil Kumar Tomar1, Debayan Bhattacharya2, Ulas Bagci1 1 Machine and Hybrid Intelligence Lab, Department of Radiology, Northwestern University, Chicago, USA 2 Institute of Medical Technology and Intelligent System, Hamburg University of Technology & Clinic for Ears, Nose and Throat, University Medical Center Hamburg-Eppendorf, Germany ========================================================================================================================================================================================================================================================================================================================================================================== We study two coupled active rotators with Kuramoto-type coupling and focus our attention to specific transitional regimes where the coupling is neither attractive nor repulsive. We show that certain such situations at the edge of synchronization can be characterized by the existence of a time-reversal symmetry of the system. We identify two different cases with such a time-reversal symmetry. The first case is characterized by a non-reciprocal attractive/repulsive coupling. The second case is a reciprocal coupling exactly at the edge between attraction and repulsion. We give a detailed description of possible different types of dynamics and bifurcations for both cases. In particular, we show how the time-reversible coupling can induce both oscillation death and oscillation birth to the active rotators. Moreover, we analyse the coexistence of conservative and dissipative regions in phase space, which is a typical feature of systems with a time-reversal symmetry. We show also, how perturbations breaking the time-reversal symmetry and destroying the conservative regions can lead to complicated types of dissipative dynamics such as the emergence of long-period cycles showing a bursting-like behavior. § INTRODUCTION Collective dynamics of weakly interacting oscillatory systems can be effectively described by coupled phase oscillators <cit.>. The classical Kuramoto system of coupled phase oscillators is based on the assumption that without coupling each subsystem has oscillatory (periodic) dynamics and hence, for weak coupling, can be reduced to the simple phase equation ϕ̇_j = ω_j with some internal frequency ω_j. In particular, it has been used extensively for the study of various forms of synchronization <cit.>. Systems of coupled active rotators have already been introduced by Shinomoto and Kuramoto in 1986 <cit.> to study a more general class of interacting units, where each unit is governed by a non-homogeneous oscillator ϕ̇_j= ω_j - a_j cosϕ_j. In particular such units undergo for \|a_j\|=\|ω_j\| a so-called SNIC (saddle-node on invariant circle) bifurcation such that the oscillator is transformed into an excitable unit. In this sense, coupled active rotators provide a substantial extension compared to the classical Kuramoto system of phase oscillators and are suitable for the modeling of collective dynamics of neuronal and, in general, excitable systems. The active rotator of this form is also known as the theta-neuron model <cit.>, and it is equivalent to the quadratic integrate-and-fire neuron <cit.>. Systems of coupled active rotators and their extensions have been also studied in <cit.>. The onset of various forms of synchronization and collective dynamics is usually studied in the context of attractive global or non-local coupling. However, many interesting and unexpected dynamical effects can be observed close to the transition from attractive to repulsive coupling <cit.> and also units with different types of non-reciprocal coupling can lead to new dynamical phenomena <cit.>. In this work, we consider a minimal network motif of two coupled active rotators with Kuramoto-type coupling and focus our attention to specific transitional regimes where the coupling is neither attractive nor repulsive. It turns out that certain situations at the edge of synchronization can be characterized by an additional structural property of the system, the existence of a time-reversal symmetry. Systems with this property are known to exhibit rich and unexpected dynamical behavior and have been studied extensively from a mathematical point of view <cit.>. A specific feature of such systems is the possibility of a coexistence of regions with conservative dynamics (e.g. families of neutrally stable closed orbits) with dissipative regions in phase space. In our setting of two coupled rotators we identify two different cases with such a time-reversal symmetry. The first case is characterized by a non-reciprocal coupling where one oscillator couples attractive and the other repulsive. The second case is a reciprocal coupling with a Kuramoto type coupling exactly at the edge between attractive and repulsive coupling. For both cases we describe in detail the different dynamical scenarios and the bifurcation transitions between them. In particular, we show how the coupling can lead to coexistence of rotations in opposite directions, to the birth and death of oscillations, and to the coexistence of a dissipatively stable synchronous equilibrium with regions of conservative oscillatory motions in the form of both rotations and librations. In section <ref>, we also consider the influence of generic perturbations. Such perturbations can induce a drift along the families of periodic solutions in the conservative regions of the reversible regime. We show that in some cases this can lead to long-period limit cycles with a bursting-like dynamics. Additionally, we study the effects of the higher Fourier modes that can lead to even higher multistablity of conservative and dissipative regions. A general system of two coupled rotators has the form ϕ̇_1 = f_1(ϕ_1)+g_1(ϕ_1-ϕ_2), ϕ̇_2 = f_2(ϕ_2)+g_2(ϕ_2-ϕ_1), where ϕ_1, ϕ_2∈𝕋^1=ℝ/2πℤ are phase variables, and the local dynamics f_1,2 as well as the coupling functions g_1,2 are smooth and 2π-periodic. We mainly restrict ourselves to the case ϕ̇_1 = ω_1 + a_1cosϕ_1 + κ_1sin(ϕ_2 - ϕ_1 + α), ϕ̇_2 = ω_2 + a_2cosϕ_2 + κ_2sin(ϕ_1 -ϕ_2 + α), where both the local dynamics and the coupling functions contain only the leading Fourier component. In this way we get the natural frequencies ω_i, the phase inhomogeneities a_i the coupling strengths κ_i and the phase shift α as parameters. More complicated functions f_i and g_i will be also shortly discussed, and they will be specified at the corresponding places. The inhomogeneity a_i is an important ingredient of the system, since otherwise the dynamics is very simple. Indeed, if a_1=a_2=0, we obtain two coupled oscillators of Kuramoto-Sakaguchi type <cit.>, which have a phase-shift symmetry (ϕ_1,ϕ_2)↦(ϕ_1+δ,ϕ_2+δ) for any δ∈𝕋^1. As a result, the system can be reduced to a single equation for the phase difference ψ=ϕ_1-ϕ_2 ψ̇ =Δ-Acos(ψ-σ), where Δ=ω_1-ω_2, tanσ=κ_1+κ_2/κ_2-κ_1α, and A=√((κ_2-κ_1)^2sin^2σ+(κ_1+κ_2)^2cos^2σ). This is again an active rotator with stable and unstable equilibria for \|Δ/A\|<1 and the SNIC bifurcation for Δ/A=±1. The stable and unstable equilibria for the system in the phase differences correspond to stable and unstable phase-locked limit cycles for the original two-dimensional Kuramoto-Sakaguchi system. For \|Δ/A\|>1, the phase-locking is lost, and the system of two coupled Kuramoto-Sakaguchi oscillators possesses families of neutral periodic or quasi-periodic orbits depending on the relationship between ω_1 and ω_2. The dynamics of system (<ref>)–(<ref>) becomes more complicated when the inhomogeneity a_i is present. The phase-shift symmetry is broken and the transition to the excitable regime of the single unit induces new dynamical regimes. As we will see, the dynamics are particularly rich are in the cases of time-reversible coupling as discussed in the following section. § TIME-REVERSIBLE DYNAMICS OF TWO COUPLED OSCILLATORS §.§ What is time-reversibility? A system ẋ = F(x) has a time-reversal symmetry <cit.> if there exists an involution R of the phase space X satisfying F(R(x))=-R(F(x)) and R^2=Id, with Id being the identity transformation. The existence of such a time-reversing symmetry action R, which is typically linear or affine, implies that for a solution x(t) also Rx(-t) is a solution. An important role for the characterization of the dynamics of a reversible systems plays the subspace FixR={x∈ X: R(x)=x}. In contrast to invariant subspaces of symmetries without time reversal, this subspace is not dynamically invariant. Instead, a trajectory can cross FixR, which then implies that the whole trajectory is mapped by R onto a time reversed copy of itself. In this way one can distinguish between intersecting trajectories connecting an attractor-repellor pair related by R, and trajectories intersecting more than once, which induces locally conservative dynamics. This coexistence of conservative and dissipative dynamics in different regions of the phase space is a typical property of systems with time-reversibility <cit.> that distinguishes them from generic dissipative dynamical systems. In systems with time-reversal symmetry one has to distinguish between equilibria within and outside FixR. In the first case, an equilibrium has to have the same number of stable and unstable directions, since these are related by R. In the second case equilibria come in pairs, related by R, with opposite stability properties. Moreover, there can be bifurcations with a spontaneous symmetry breaking, where from a branch of equilibria within FixR a branch containing pairs of equilibria outside FixR bifurcates, see e.g. <cit.>. Due to the possibility of locally conservative dynamics, reversible systems can have structurally stable homoclinic orbits and heteroclinic cycles, which together with their specific bifurcations have been studied extensively, see <cit.>. §.§ Reversible cases in the system of coupled rotators We identify two cases, for which system (<ref>)–(<ref>) is time-reversible. First, note that the single rotator has a time reversal symmetry (ϕ, t)⟼(-ϕ_, -t) as soon as f is an even function. A coupled system of two identical such units, i.e. with f_1(ϕ)=f_2(ϕ) =f(ϕ) , f(ϕ)=f(-ϕ), can become time-reversible in two different ways. Case (I) is characterized by an anti-reciprocal coupling with an odd coupling function g_1(ϕ)=-g_2(ϕ)=g(ϕ), g(-ϕ)=-g(ϕ). The second time-reversible case (II) appears for if the coupling functions are identical and even. g_1(ϕ)=g_2(ϕ)=g(ϕ), g(ϕ)=g(-ϕ), which corresponds to a conservative coupling at the edge between attraction and repulsion. In both cases, the time-reversible symmetry is given by the action R: (ϕ_1, ϕ_2, t)⟼(-ϕ_2, -ϕ_1, -t) with the subspace FixR={ (ϕ_1, ϕ_2): ϕ_1=-ϕ_2}. For the system (<ref>)–(<ref>) of active rotators with Kuramoto-Sakaguchi type coupling we obtain for case (I) with anti-reciprocal and odd coupling the system ϕ̇_1 = ω + acosϕ_1-κsin(ϕ_1-ϕ_2), ϕ̇_2 = ω + acosϕ_2+κsin(ϕ_2-ϕ_1), while in case (II) with even and reciprocal coupling we get ϕ̇_1 = ω + acosϕ_1-κcos(ϕ_1-ϕ_2), ϕ̇_2 = ω + acosϕ_2-κcos(ϕ_2-ϕ_1). In the following Sec. <ref>, we describe the dynamics and bifurcations in the above two cases. § TIME-REVERSIBLE DYNAMICS OF THE COUPLED ROTATOR MODEL §.§ Case (I): coupled rotators with anti-reciprocal coupling We first consider the case (I) reversible system (<ref>)–(<ref>). This system possesses additional symmetries that involve parameters; these symmetries are generated by the actions γ_1: (ϕ_1, ϕ_2,ω, t) ⟼(ϕ_2+π, ϕ_1+π, -ω, -t), γ_2: (ϕ_1, ϕ_2,κ, t) ⟼(ϕ_2+π, ϕ_1+π, -κ, t), γ_3: (ϕ_1, ϕ_2,a, t) ⟼(ϕ_1+π, ϕ_2+π, -a, t). Note that γ_1 induces for ω=0 a second time-reversing symmetry action, while γ_2,3 for κ=0 and a=0, respectively, induce ℤ_2-symmetries without time reversal. As a result of the parametric symmetries γ_1,2,3 the resulting bifurcation diagrams will be mirror symmetric with respect all the parameters ω, κ, a. Also the synchrony subspace ϕ_1=ϕ_2 is flow invariant for system (<ref>)–(<ref>). However, this invariance is not induced by a symmetry of the system, but the diffusive nature of the coupling. The regions in the bifurcation diagrams in Fig. <ref> correspond to qualitatively different structurally stable phase portraits. Panel (a) shows the parameter plane (κ,ω) with fixed a=1 and panel (b) the plane (κ,a) with fixed ω=1. Note that one can fix a=1 without loss of generality as soon as a 0. To study the situation in a vicinity of a=0, we can fix ω=1, instead. The region a≈ 0 is interesting from the point of view of perturbing the Kuramoto system with its phase shift symmetry to a rotator system with inhomogeneous rotation speed. Note that the diagram in panel (b) can be obtained from the diagram in panel (a) by the transformation (κ,ω) ↦ (κ/ω,1/ω). This explains, why the blue and brown bifurcation curves, which are mapped from or to infinity, are present only in one of the two diagrams. The black line in panel (b) is not visible in panel (a) because its preimage lies outside the plotted region. In the remaining part of this section we will describe in detail the different types of bifurcations indicated in the two diagrams by curves of different color. Examples of the different generic phase portraits are depicted in Fig. <ref>. In Fig. <ref> we show examples of structurally unstable phase portraits on the different bifurcation curves and Fig. <ref> gives the phase portraits at the codimension-two points. The different dynamical regimes are distinguished by the number and type of the fixed points and also by homoclinic and heteroclinic connections that organize the dissipative and conservative regions. The fixed points have the following general properties: * Depending on the parameter values, the system has up to six fixed points. * There can be up to four fixed points in Fix R; they are saddles, centers or, at bifurcations, degenerate saddles. * Outside of Fix R, there can be only one pair of sink and source. They are always located in the synchrony subspace and therefore do not depend on the coupling strength κ. They are related by R, which on the synchrony subspace induces also a time-reversal symmetry of the single uncoupled rotator. The bifurcations of the equilibria will be discussed in detail below. The local bifurcations of the equilibria induce also changes of the configuration of the dissipative and conservative regions. Note that the regions can change also by global bifurcations given by a reconnection of the saddle separatrices. The regions have the following general properties: * Each conservative region is filled with one-parametric family of neutral periodic orbits. * Periodic orbits can have two different topological types: Rotations, where the curve closes after a full round trip of both oscillators such that both phases increase unboundedly, and librations, where both oscillators perform a small oscillatory motion whithout a full round trip in one of the phases. * The conservative regions are bounded by homoclinics or heteroclinic cycles, which can also be of rotation or libration type. * Each dissipative region consists of heteroclinic orbits, connecting a source and a sink equilibrium. The yellow and orange areas in Figs. <ref>–<ref> indicate conservative regions filled with librations (different colors correspond to clockwise and counter-clockwise motion), cyan and blue regions are filled with rotations. Dissipative regions can exist only in the presence of a source/sink pair of equilibria related by R (white regions in Figs. <ref>–<ref>). We give now a detailed description of the different types of local and global bifurcations occuring in this system. Saddle-center bifurcation. The red and magenta curves in the bifurcation diagram in Fig. <ref> indicate a saddle-center bifurcation. At this bifurcation a saddle and a center equilibrium, both in FixR, merge and disappear, see also Refs. <cit.>. The Jacobian at the degenerate equilibrium has an algebraically double zero eigenvalue. The resulting bifurcation condition for a=1 is given by ω=±(√(1+32κ^2)± 3)√(2(16κ^2 -1-√(1+32κ^2)))/32\|κ\| and provides the red and magenta curves in Fig. <ref>(a). An example of a phase portrait with such a degenerate equilibrium is given in Fig. <ref>(k). Together with the new equilibrium of center type there emerges also a conservative region, in this case filled with a family of periodic orbits of librations around this point. Also, a structurally stable homoclinic to the new saddle equilibrium emerges, giving the boundary of the conservative region, see e.g. the phase portrait in Fig. <ref>(b). In Fig. <ref> there are several pairs of structurally stable phase portraits related by this type of bifurcation: (b)–(a), (c)–(d), (e)–(f), (g)–h). Reversible pitchfork (sink/source) bifurcation. The green curves in Fig. <ref> indicate a reversible pitchfork bifurcation, where in a spontaneous symmetry breaking a pair of a sink and a source equilibrium outside FixR bifurcate from an equilibrium within FixR that, at the same time, changes its type from a saddle to a center <cit.>. The bifurcation condition is here a geometrically double zero eigenvalue. This bifurcation happens at the bifurcation of the single uncoupled oscillator at ω=± a, where we have degenerate equilibria at (ϕ_1,ϕ_2)=(-π/2,π/2) and (π/2,-π/2), respectively, that are independent on κ. Corresponding degenerate phase portraits are given in Figs. <ref>(n),(o). The bifurcation of the equilibria induces also a reorganization of the homoclinic and heteroclinc connections and the conservative and dissipative regions. With the transformation of the center equilibrium in FixR into a saddle, the corresponding conservative region with periodic orbits surrounding the center vanishes. As for the usual pitchfork bifurcation, the bifurcating pair of a source and sink equilibrium emerges with heteroclinic connections to the primary saddle equilibrium in FixR. Moreover, as a consequence of the phase space being here the compact manifold 𝕋^2, the source and sink equilibrium inherit global heteroclinic connections to another saddle in FixR, which, before the bifurcation, was carrying the homoclinic loop defining the boundary of the vanishing conservative region. Note that, obstructed by the new heteroclinic connections, also a conservative region of rotations vanishes. The pairs of structurally stable phase portraits related by this type of bifurcation in Fig. <ref> are (c)–(e) and (d)–(f). Heteroclinic saddle-saddle connections. We have two instances of structurally unstable heteroclinic connections between saddle equilibria in FixR, given by the orange and black curves in the bifurcation diagrams in Fig. <ref>. The orange curves indicate such a global bifurcation shown by the degenerate phase portraits in Figs. <ref>(l),(m). This bifurcation induces the appearance/disappearance of conservative regions with rotations in between dissipative regions. Pairs of structurally stable phase portraits related by this type of bifurcation in Fig. <ref> are (b)–(c) and (a)–(d). The black curves in Fig. <ref>(b) correspond to heteroclinic saddle-saddle connections with a degenerate phase portrait as shown in Fig. <ref>(p) and connects the two structurally stable phase portraits (e) and (h) in Fig. <ref>. The mechanism how this global bifurcation leads to restructuring of the invariant regions is schematically shown in Fig. <ref>. A region of undulating rotations (panel (a)) disappears and a new region of straight rotations in opposite direction appears (panel (c)). In the degenerate situation in between we see how two structurally stable homoclinics, which delineate the region of the rotations form two libration regions with opposite direction of motion, are reconnected through two heteroclinic saddle-saddle connections forming a heteroclinic cycle of rotational type. The bifurcation curves of such global bifurcation curves can typically be found only numerically. In our case of a planar flow this can be done by a simple shooting method. For the numerical treatment of more general cases, see <cit.>. Second time-reversal symmetry. As already mentioned above, for ω=0 the parametric symmetry γ_1 turns into a second time reversal symmetry R_2 with fixed space FixR_2={ (ϕ_1, ϕ_2): ϕ_1=ϕ_2+π}. This enables a homoclinic orbit to a saddle equilibrium in FixR to turn into a heteroclinic connection between two saddle equilibria in FixR as soon as both saddles are related by R_2 and happens along the blue line in Fig. <ref>(a). There are two qualitatively different degenerate phase portraits of this type given in Figs. <ref>(i),(j), corresponding to the case of a bifurcating homoclinc orbit of libration and rotation type, respectively. Note that in the case of the rotation, there appears also a homoclinic to a saddle in FixR_2, which is structurally unstable with respect to perturbations that break the reversibility R_2. This type of global bifurcation mediates the transition of the structurally stable phase portraits (b) and (c) in Fig. <ref> to their respective images under R_2. For ω=0 we find also two codimension-two bifurcations. For a=±2 κ one of the two equilibria in FixR ∩ FixR_2= {(π/2,-π/2),(-π/2,π/2)} has a fully degenerate Jacobian, see phase portrait in Figs. <ref>(q). At this point, two curves of saddle-center bifurcations that exist for ω≠ 0 meet in a cusp point. Also the blue curve, indicating the heteroclinic connection between two saddle equilibria in FixR, ends at this codimension-two point since the two saddles merge with the center in between them and vanish together with the enclosed conservative region. The second codimension-two bifurcation, with a degenerate phase portrait shown in Figs. <ref>(r), is a pair of saddle-saddle connections between a saddle in FixR ∩ FixR_2 and a pair of saddles in FixR which are related by R_2. At this point meet two curves of saddle-saddle connections, which exist for ω≠ 0. Rotational symmetry. In the case of a=0 we have two coupled Kuramoto oscillators with phase shift symmetry, which can be reduced to a single equation for the phase difference. However, due to the special form of the coupling in the case (I) time-reversible system (<ref>)–(<ref>), the phase difference ψ=ϕ_1-ϕ_2 stays always constant such that all trajectories are straight diagonal lines ϕ_1(t)=ϕ_2(t)+ψ(0) with constant velocity ϕ̇_i=ω+κsin(ψ(0)). For \|κ\|>\|ω\| there are two diagonal lines ϕ_2=ϕ_1±arcsin(ω/κ) with velocity zero. These lines of equilibria, existing along the brown bifurcation line in Fig. <ref>(b), give rise to a global bifurcation in the following way. Breaking the phase shift symmetry with small a≠ 0, from each of the two lines of equilibria remains only a saddle and a center equilibrium while two narrow conservative regions of librations emerge, as shown in Fig. <ref>. All other trajectories still form two regions of rotations with opposite directions, which are no straight lines any more but slightly modulated. The brown line ends in a codimension-two situation where the two lines of equilibria disappear together with region of rotations in opposite direction. The corresponding phase portrait is shown in Fig. <ref>(t). Note that at this codimension two bifurcation points there emerge also curves of saddle-center bifurcations and heteroclinic saddle-saddle connections, see Fig. <ref>(b). This bifurcation is described in more detail in Ref. <cit.>. The uncoupled case. For κ=0 the two rotators are decoupled. In this case the only bifurcation happens at a=±ω, where both rotators simultaneously undergo the SNIC from excitable to rotating behavior. Note that the unfolding of this codimension-two point (see degenerate phase portrait in Fig. <ref>(s) for κ≠ 0 gives rise to the reversible pitchfork bifurcation, where the stable synchronous equilibrium emerges, and, additionally, to curves of heteroclinic saddle-saddle connections and saddle-center bifurcations. Summary of case (I). Having clarified all the details of the bifurcation scenario in the time-reversible case (I) of two rotators with anti-reciprocal coupling (<ref>)–(<ref>) we can interpret the bifurcation scenario as follows. The transition of the single rotator from excitable to oscillatory motion at \|κ/ω\|=1 plays the main role. If the single rotator is in the oscillatory regime, the coupled system has only conservative behavior. For weak coupling it consists of unidirectional rotation of both units. Stronger coupling leads to the coexistence of bidirectional rotation and also to regions of libration, which can be seen as a conservative version of a partial oscillation death, i.e. for certain initial conditions the coupling prevents the rotating units from rotation or even reverses their rotation. For coupled rotators in the excitable regime we have always a pair of source/sink equilibria that induces a dissipative region, which is identical to the basin of the sink. But only for small coupling this basin covers a set of full measure in phase space. For strong coupling there appear step by step conservative regions with both rotation and libration. In contrast to the oscillation death in the oscillatory regime, this can be seen as a partial oscillation birth, where – again only for a certain open set of initial conditions – non-oscillatory units start to oscillate as a consequence of the coupling. §.§ Case (II): coupled rotators with reciprocal coupling We consider now the case (II) of time reversibility given by system (<ref>)–(<ref>). As above, we show in Fig. <ref> two bifurcation diagrams with respect to (κ,ω) with fixed a=1 (panel (a)) and with respect to (κ,a) with fixed ω=1 (panel (b)). In addition to the time-reversal symmetry R, given by (<ref>), the system (<ref>)–(<ref>) possesses the following ℤ_2-equivariance γ_m: (ϕ_1, ϕ_2)⟼(ϕ_2, ϕ_1), which is a mirror symmetry with the invariant subspace Fixγ_m={ (ϕ_1, ϕ_2): ϕ_1=ϕ_2}, corresponding to complete synchronization. Note that the composition Rγ_m=γ_mR: (ϕ_1, ϕ_2,t)⟼(-ϕ_1, -ϕ_2,-t) of the time-reversal symmetry and the ℤ_2-equivariance provides another time-reversal symmetry. This map has two invariant points {(0,0),(π,π)}, which will become important for the sink/source bifurcation discussed below. Moreover, system (<ref>)–(<ref>) has a time-reversal symmetry involving the parameters ω and κ: γ_4: (ϕ_1, ϕ_2, κ, ω, t)⟼(ϕ_1+π, ϕ_2+π, -κ, -ω, -t). According to this symmetry the bifurcation diagram in Fig. <ref>(a) is invariant under the reflection of both κ and ω together. The parametric symmetry γ_3: (ϕ_1, ϕ_2,a, t)⟼(ϕ_1+π, ϕ_2+π, -a, t) that was already present in case (I) induces the reflection symmetry of the bifurcation diagram in Fig. <ref>(b) with respect to a, while there is no reflection with respect to κ alone, as in case (I). The system can have up to four fixed points, either two pairs of a saddle and a center, all in FixR, or two saddles in FixR and a sink/source pair in the synchronization subspace Fixγ_m. We encounter here the similar types of reversible bifurcations as in the case (I) scenario described above. However, some of them are modified by the additional ℤ_2-equivariance γ_m. Saddle-center bifurcation. The red line of the saddle-center bifurcation in Fig. <ref>(a) is given by ω=-1/8κ-κ, \|κ\|>1/4. According to the mirror symmetry, we have now a pair of symmetry related degenerate equilibria (ϕ_1^,-ϕ_1^) and (-ϕ_1^,ϕ_1^), as seen in the degenerate phase portrait Fig. <ref>(m). Recall that together with the centers there appear also conservative regions of libration type, see Fig. <ref>(c). However, in contrast to case (I) where this bifurcation may induce the coexistence of conservative and dissipative regions, we find it here only in the purely conservative region, where it induces regions librations in a fully rotating scenario Fig. <ref>(f). Reversible equivariant sink/source bifurcation. Similar as the reversible pitchfork bifurcation discussed in case (I), this bifurcation gives rise to a pair of sink/source equilibria outside FixR. However, in case (II) it includes an interplay of the time reversal symmetry R with the ℤ_2-equivariance γ_m and is given by a degenerate equilibrium with double zero eigenvalue that lies in FixR∩Fixγ_m={(0,0),(π,π)}. The corresponding bifurcation condition ω± a=κ provides the green lines in Fig. <ref>. This bifurcation comes here in two different versions that can not be distinguished on the linear level. The first type has a degenerate phase portrait as given in Fig. <ref>(g). The degenerate equilibrium connects a folded branch with two center equilibria in FixR, which are related by γ_m, with another folded branch in Fix γ_m containing a source and a sink equilibrium, which are related by R. The branches are organized as in a complex fold of the form z^2+μ=0, z∈ℂ. The structurally stable phase portraits related by this type of bifurcation are Fig. <ref>(b) and (c). Note that this bifurcation connects a fully dissipative phase portrait with a fully conservative one. In the conservative phase portrait there are two further saddle equilibria in FixR, which each have gained in the conservative situation a structurally stable homoclinic orbit, delineating two regions of librations around the center equilibria from two regions of rotation. In the second type has a degenerate phase portrait as given in Fig. <ref>(l). The degenerate fixed point connects a pair of branches with saddle equilibria in FixR, which are related by γ_m, with the branch of the sink/source pair. In this situation both folded branches extend to the same side of the bifurcation such that all four involved equilibria coexist on one side of the bifurcation and have all disappeared on the other side (Fig. <ref>(f)). The two types change at a codimension-two point on the green curve where the curve of saddle-center bifurcations (red) ends and the corresponding degenerate phase portrait is given in Fig. <ref>(p). Note that there is a second codimension-two point along the green curve where another curve of global bifurcations (heteroclinic saddle-saddle connections) ends. This induces global change in the dissipative phase portraits emerging at the green line, showing beyond this point also a coexisting conservative region with rotations. Heteroclinic saddle-saddle connections We have two instances of structurally unstable heteroclinic saddle-saddle connections, given by the blue and black curves in the bifurcation diagrams in Fig. <ref>. At the blue curve a conservative region of backward rotations appears. Fig. <ref>(h) shows how this happens from a purely dissipative situation (Fig. <ref>(b)) where it leads to mixed-type dynamics (Fig. <ref>(e)). After the codimension-two point (Fig. <ref>(o)), the transition happens from a fully conservative situation (Fig. <ref>(c)), where the heteroclinic saddle-saddle connection (Fig. <ref>(j)) induces a second region of rotations in opposite direction (Fig. <ref>(d). This type of transition occurs also along the black curve and has been described schematically in Fig. <ref>. Note that this bifurcation occurs for a=1 only at very large values of ω such that it is out of the range of Fig. <ref>(a). Rotational symmetry. As in case (I), for a=0 we obtain two Kuramoto oscillators with a rotational symmetry. The two intervals of the straight magenta line a=0, \|κ\|≥1 in the bifurcation diagram in Fig. <ref>(b) correspond to the situation shown schematically in Fig. <ref>, where the forced breaking of the rotational symmetry induces a global bifurcation and small libration regions emerge from a line of equilibria (Fig. <ref>(k)). Summary of case (II). Similar to case (I), the dynamics in the synchronization subspace plays a central role for the dynamics. The SNIC bifurcation in this subspace, which comes here in the full system as the reversible equivariant sink/source bifurcation, induces together with the sink/source pair the dissipative dynamics. However, this bifurcation depends here also on the coupling strength, i.e. it does not coincide with the SNIC of the uncoupled unit. In the dissipative regime large values of ω can lead to rotations coexisting with the dissipative region. But in contrast to case (I) there are no librations coexisting with a dissipative region.In the fully conservative regime we have again situations with rotations, librations, and additional rotations in opposite directions. Comparing the dynamics with and without coupling, we find again both situations, where the coupling enables rotations of excitable units (oscillation birth) or prevents rotations of rotating units (oscillation death). While this happens in most cases only for a part of the phase space, we have here also a case, where for increasing coupling two non-oscillating but excitable units make transition from a fully dissipative regime without any oscillations to a fully rotating regime. § GENERIC PERTURBATIONS OF THE REVERSIBLE CASES For the general system (<ref>)–(<ref>) of two coupled rotators, the reversible regimes studied above represent degenerate situations, which can be perturbed in different ways. Already for identical oscillators, i.e. a_1=a_2, ω_1=ω_2, and anti-reciprocal or reciprocal coupling κ_1=±κ_2 a phase lag parameter α≠ 0 or α≠π/2, corresponding to case (I) and case (II), respectively, will destroy the time-reversal symmetry. Other types of generic perturbations are non-identical oscillators or identical oscillators with different coupling strengths κ_1≠±κ_2. Only the purely dissipative regimes close to the uncoupled non-oscillatory situation have phase portraits that are structurally stable also under all such generic perturbations. As soon as there are conservative regions, all perturbations that break the time-reversal symmetry will lead to structural changes in the dynamics. * Center equilibria will turn into stable or unstable foci. * There will be a slow drift along families of neutrally stable periodic orbits in the conservative regions. * Structurally stable homoclinic orbits, which constitute the boundaries of the conservative regions, will break. In this way, there can appear isolated stable and unstable periodic orbits from the families in the conservative regions. They can be both of rotation and libration type, see Fig. <ref>. In particular, in the cases of perturbations of conservative dynamics with dissipative and conservative regions, this can lead to multistability, where new stable objects of different type emerge in addition to the structurally stable attracting equilibrium in the dissipative region as in panel (d). Note that for non-identical oscillators, there can be additional topologial types of periodic orbits, where both units perform a different number of round trips during one period. Such an example will be discussed in detail in the next section. §.§ Bursting-like orbits A specific example of non-trivial dynamics emerging from a small perturbation of the reversible dynamics in case (I), Fig. <ref>(f) is shown in Figs. <ref>–<ref>. In the time reversible case we have two conservative regions, one with librations and the other with rotations. A small perturbation to non-identical oscillators with slightly detuned frequencies ω_1≠ω_2 induces a slow drift across the conservative region of rotations without stabilizing any of these rotations. At the same time, the center equilibrium within the other conservative region of librations is transformed into an unstable focus. The resulting dynamics are shown in the phase portrait in Fig. <ref>. We observe a stable periodic solution (blue) that performs a bursting-like behavior with many rotations during the slow passage through the conservative region of rotations until it comes close to the saddle equilibrium, where it can stay for an arbitrary long time interval. For varying detuning of the frequencies the globally stable periodic orbits of this type are organized in a complicated bifurcation scenario, where close to the conservative situation periodic solutions with arbitrarily long period and an increasing number of rotations within one burst appear. In Fig. <ref> we show how the branches of periodic solutions are organized for varying the detuning ε from the reversible case at ε=0. Panel (a) shows a self-similar sequence of branches with increasing winding number (n, n+1), n=1,…,∞. Each of these branches ends at a homoclinic bifurcation, where the period grows unboundedly. However, at each of these transitions, we observe another self-similar cascade of transitions to orbits of more complicated structure existing only in increasingly small parameter windows. Panel (b) shows the parameter region around the first transition in panel (a), where the branch with winding numbers (1,2) disappears and a new branch with (2,3) appears. On the zoomed scale in panel (b) in between these two major branches a new branch with winding numbers (3,5) becomes visible. Zooming into the transition between this branch and the (2,3) branch, we find a branch with winding numbers (5,8), see panel (c). Zooming in yet another time, we find a branch with winding numbers (7,11), see panel (d). Examples of time traces of bursting orbits with different detuning values ε and resulting winding numbers are given in Fig. <ref>. §.§ Nonlinearities with higher harmonics As explained in subsection <ref>, the general system (<ref>)–(<ref>) has a time-reversal symmetry in two different cases, where the functions f_1,2(ϕ), governing the local dynamics are identical and even, while the coupling functions g_1,2(ϕ) have to be also identical but can be either odd and have opposite signs (case (I)) or even and identical (case (II)). In section <ref> we investigated the case where both functions are restricted to the leading term in the Fourier expansion. In the general case where both functions contain higher-order harmonics, the system can possess more fixed points and, as a result, a much more complex structure of the invariant manifolds of the saddles, which provide the global structure of the dissipative and conservative regions in the regimes of mixed-type dynamics. We will now briefly indicate how in the case (I) of a system with anti-reciprocal coupling the presence of higher-order harmonics in the local function of the local dynamics f(ϕ)=f_1,2(ϕ) and in the coupling function g(ϕ)=g_1(ϕ)=-g_2(ϕ) can lead to more complex time-reversible dynamics. First, note that already a single rotator ϕ̇=f(ϕ) with an even function f(ϕ) containing the n-th harmonic cos(nϕ) can have up to 2n different fixed points. For a system of two such units with small coupling this gives rise to 4n^2 fixed points, which are sinks, sources, and saddles outside FixR and also saddles inside FixR. At the other hand, for two Kuramoto oscillators, i.e. f(ϕ)=ω, a coupling function g(ϕ) containing the m-th harmonic sin(ϕ) can induce up to 2m lines of equilibria ψ_j=ϕ_1-ϕ_2, j=1,… ,2m, where g(ψ_j)-ω=0. Breaking the rotational symmetry by a slightly non-constant f(ϕ), this leads to 2m saddle/center pairs in FixR and corresponding conservative regions of rotations and librations, compare Fig. <ref>. Hence, we can say that in a general system (<ref>)–(<ref>) with case(I) time reversibility, the higher harmonics of f(ϕ) can induce multiple equilibria outside FixR and hence a more complex structure in the dissipative part, while functions higher harmonics of g(ϕ) are responsible for the emergence of multiple equilibria inside FixR, leading to multiple conservative regions. We illustrate this in Fig. <ref> by two examples of functions of the form f(ϕ)= ω-cosϕ-pcos(nϕ) g(ϕ)= κ(sinϕ+rsin(mϕ)). Note that in panel (a) and (c) we have chosen ω=0 such that we have the second time reversibility R_2, such that there are heteroclinic saddle-saddle connections, compare corresponding phase portraits in Figs. <ref>(i),(j). In panel (b), where we have chosen ω≠ 0, all saddles in FixR have structurally stable homoclinics. Moreover, there are saddle equlibria outside FixR. They come in pairs related by R and can have structurally stable heteroclinic connections between them. They can be involved in a second type of reversible pitchfork bifurcation (saddle-saddle type), where an equilibrium inside FixR changes from saddle to center, while a branch with two saddles outside FixR emerges, cf Fig. <ref>(b). Fig. <ref>(c) shows also the result of a third type (center-center) of the reversible pitchfork bifurcations: the emergence of two centers outside FixR from a center inside FixR that, at the same time, transforms from a center into a saddle. We see that some of the structural restrictions, which we encountered in the system (<ref>)–(<ref>) of case (I) time-reversibility with only first harmonics are no more present for higher order harmonics. In particular, * there can be a large number of equilibria, in particular pairs of saddle equilibria outside FixR and sink/source pairs outside the synchrony subspace. * there can appear multiple nested regions of conservative regions of different type and nested regions of conservative and dissipative dynamics. However, the general observation remain true: The anti-reciprocal coupling of case (I) can induce a partial oscillation death, i.e. for certain initial conditions the coupling prevents the rotating units from rotation or even reverses their rotation. Also the effect of partial oscillation birth, where non-oscillatory units start to oscillate as a consequence of the coupling. § DISCUSSION AND OUTLOOK We have demonstrated that already for a fairly simple two-dimensional system of two coupled rotators in the transitional regimes between attractive and repulsive coupling there can arise quite complex dynamics. Particularly rich dynamics occur for parameter choices where the system has a time-reversal symmetry. In this case we also encounter the somewhat unusual types of bifurcations of time-reversible systems. Additionally, such systems can switch between dissipative and conservative dynamics, and also display the coexistence of different regions with such dynamics in phase space, which are governed by complex heteroclinic and homoclinic structures connecting the fixed points within and outside the symmetry subspace. Note that certain interesting regimes and properties described in this work for the system of two connected active rotators also exist for more complex networks of rotators. In particular, a system of 2N globally connected active rotators ϕ̇_k=f_k(ϕ_k)+∑_j=1^2Ng_kj(ϕ_k-ϕ_j), where f_k(x)=f_k(-x)=f_k+N(x), g_kj(x)=± g_kj(-x)=± g_k+N,j+N(x), can display a time-reversal symmetry similar to the cases given here, e.g. with a symmetry action of the form ϕ_i↦-ϕ_i+N, i=1,…,N. A system of 2N+1 globally coupled active rotators with even coupling functions can have a time-reversal symmetry with symmetry action ϕ_i↦-ϕ_i+N+1, i=1,…,N, ϕ_N+1↦-ϕ_N+1. Also other symmetry actions, based on other permutations or phase shift symmetries, are possible. In all these cases, the system can have a coexistence of conservative and dissipative dynamics over wide regions in the parameter. Our preliminary numerical investigation indicates quite complex structures in a 4-dimensional system. We observe there conservative regions of multi-parameter families of neutral periodic orbits are bounded by sets of homo/heteroclinic cycles. Despite the apparent complexity of global bifurcations in multidimensional systems, certain of their properties are similar to the bifurcations described above. Also the destruction of conservative regions by small symmetry breaking perturbations and the emergence of trajectories slowly drifting along the families of former neutral periodic orbits occurs in a somewhat similar way. § ACKNOWLEDGEMENTS Funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany's Excellence Strategy – The Berlin Mathematics Research Center MATH+ (EXC-2046/1, project ID: 390685689). O.B. acknowledges financial support of the Potsdam Institute for Climate Impact Research (PIK) and National Research Foundation of Ukraine (Project No. 2020.02/0089). S.Y. was supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation), Project No. 411803875. 2pc RS
http://arxiv.org/abs/2306.12511v2	20230621184922	Semi-Implicit Denoising Diffusion Models (SIDDMs)	[ "Yanwu Xu", "Mingming Gong", "Shaoan Xie", "Wei Wei", "Matthias Grundmann", "kayhan Batmanghelich", "Tingbo Hou" ]	cs.LG	[ "cs.LG", "cs.CV" ]	Semi-Implicit Denoising Diffusion Models (SIDDMs) Yanwu Xu^1,2, Mingming Gong^3, Shaoan Xie^4, Wei Wei^1, Matthias Grundmann^1, Kayhan Batmanghelich^2[], Tingbo Hou^1[] ^1 Google {yanwuxu,weiwei,grundman,tingbo}@google.com ^2Electrical and Computer Engineering, Boston University, {yanwuxu,kayhan}@bu.edu ^3School of Mathematics and Statistics, The University of Melbourne [email protected] ^4Carnegie Mellon University [email protected]. July 31, 2023 ==================================================================================================================================================================================================================================================================================================================================================================================================================================================== Despite the proliferation of generative models, achieving fast sampling during inference without compromising sample diversity and quality remains challenging. Existing models such as Denoising Diffusion Probabilistic Models (DDPM) deliver high-quality, diverse samples but are slowed by an inherently high number of iterative steps. The Denoising Diffusion Generative Adversarial Networks (DDGAN) attempted to circumvent this limitation by integrating a GAN model for larger jumps in the diffusion process. However, DDGAN encountered scalability limitations when applied to large datasets. To address these limitations, we introduce a novel approach that tackles the problem by matching implicit and explicit factors. More specifically, our approach involves utilizing an implicit model to match the marginal distributions of noisy data and the explicit conditional distribution of the forward diffusion. This combination allows us to effectively match the joint denoising distributions. Unlike DDPM but similar to DDGAN, we do not enforce a parametric distribution for the reverse step, enabling us to take large steps during inference. Similar to the DDPM but unlike DDGAN, we take advantage of the exact form of the diffusion process. We demonstrate that our proposed method obtains comparable generative performance to diffusion-based models and vastly superior results to models with a small number of sampling steps. Work done at Google. † Equal Contribution. § INTRODUCTION Generative models have achieved significant success in various domains such as image generation, video synthesis, audio generation, and point cloud generation <cit.>. Different types of generative models have been developed to tackle specific challenges. Variational autoencoders (VAEs) <cit.> provide a variational lower bound for training models with explicit objectives. Generative adversarial networks (GANs) <cit.> introduce a min-max game framework to implicitly model data distribution and enable one-step generation. Denoising diffusion probabilistic models (DDPMs) <cit.>, also known as score-based generative models, recover the original data distribution through iterative denoising from an initial random Gaussian noise vector. However, these models face a common challenge known as the “TRILEMMA” <cit.>, which involves ensuring high-quality sampling, mode coverage, and fast sampling speed simultaneously. Existing approaches, such as GANs, VAEs, and DDPMs struggle to address all three aspects simultaneously. This paper focuses on tackling this TRILEMMA and developing models capable of effectively modelling large-scale data generation. While diffusion models excel in generating high-quality samples compared to VAEs and demonstrate better training convergence than GANs, they typically require thousands of iterative steps to obtain the highest-quality results. These long sampling steps are based on the assumption that the reversed diffusion distribution can be approximated by Gaussian distributions when the noise addition in the forward diffusion process is small. However, if the noise addition is significant, the reversed diffusion distribution becomes a non-Gaussian multimodal distribution <cit.>. Consequently, reducing the number of sampling steps for faster generation would violate this assumption and introduce bias in the generated samples. To address this issue, DDGANs propose a reformulation of forward diffusion sampling and model the undefined denoising distribution using a conditional GAN. This approach enables faster sampling without compromising the quality of the generated samples. Additionally, DDGANs exhibit improved convergence and stability during training compared to pure GANs. However, DDGANs still face limitations in generating diverse large-scale datasets like ImageNet. We propose a hypothesis that the effectiveness of implicit adversarial learning in capturing the joint distribution of variables at adjacent steps is limited. This limitation arises from the fact that the discriminator needs to operate on the high-dimensional concatenation of adjacent variables, which can be challenging. In order to achieve fast sampling speed and the ability to generate large-scale datasets, we introduce a novel approach called Semi-Implicit Denoising Diffusion Model (SIDDM). Our model reformulates the denoising distribution of diffusion models and incorporate implicit and explicit training objectives. Specifically, we decompose the denoising distribution into two components: a marginal distribution of noisily sampled data and a conditional forward diffusion distribution. Together, these components jointly formulate the denoising distribution at each diffusion step. Our proposed SIDDMs employ an implicit GAN objective and an explicit L2 reconstruction loss as the final training objectives. The implicit GAN objective is applied to the marginal distribution, while the explicit L2 reconstruction loss is adopted for the conditional distribution, where we name the process of matching conditional distributions as auxiliary forward diffusion AFD in our obejctives. This combination ensures superior training convergence without introducing additional computational overhead compared to DDGANs. To further enhance the generative quality of our models, we incorporate an Unet-like structure for the discriminator. Additionally, we introduce a new regularization technique that involves an auxiliary denoising task. This regularization method effectively stabilizes the training of the discriminator without incurring any additional computational burden. In summary, our method offers several key contributions. Firstly, we introduce a novel formulation of the denoising distribution for diffusion models. This formulation incorporates an implicit and an explicit training objectives, enabling fast sampling while maintaining high-generation quality. Lastly, we propose a new regularization method specifically targeting the discriminator. This regularization technique enhances the overall performance of the model, further improving its generative capabilities. Overall, our approach presents a comprehensive solution that addresses the challenges of fast sampling, high generation quality, scalability to large-scale datasets, and improved model performance through proper regularization. § BACKGROUND Diffusion models contain two processes: a forward diffusion process and the reversion process. The forward diffusion gradually generates corrupted data from x_0∼ q(x_0) via interpolating between the sampled data and the Gaussian noise as follows: q(x_1:T\|x_0):= ∏^T_t=1 q(x_t\|x_t-1), q(x_t\|x_t-1) := 𝒩(x_t; √(1-β_t)x_t-1, β_tI) q(x_t\|x_0)=𝒩(x_t;√(α_t)x_0, (1-α_t)I), α_t := ∏^t_s=1 (1-β_s), where T denotes the maximum time steps and β_t∈ (0,1] is the variance schedule. The parameterized reversed diffusion can be formulated correspondingly: p_θ(x_0:T):= p_θ(x_T)∏^T_t=1 p_θ(x_t-1\|x_t), p_θ(x_t-1\|x_t) := 𝒩(x_t-1; μ_θ(x_t, t), σ_t^2I), where we can parameterize p_θ(x_t-1\|x_t) as Gaussian distribution when the noise addition between each adjacent step is sufficiently small. The denoised function μ_θ produces the mean value of the adjacent predictions, while the determination of the variance σ_t relies on β_t. The optimization objective can be written as follows: ℒ=-∑_t>0𝔼_q(x_0)q(x_t\|x_0)D_KL(q(x_t-1\|x_, x_0)\|\|p_θ(x_t-1\|x_t)), which indirectly maximizes the ELBO of the likelihood p_θ(x_0). When x_0 is given, the posterior q(x_t-1\|x_t,x_0) is Gaussian. Thus, the above objective becomes L_2 distance between the sampled x_t-1 from the posterior and the predicted denoised data. However, if we want to achieve fast sampling with several steps, The assumption that p_θ(x_t-1\|x_t) follows Gaussian does not hold, and the L_2 reconstruction cannot be applied to model the KL divergence. To tackle this, DDGANs propose an adversarial learning scheme to match the conditional distribution between q(x_t-1\|x_t) and p_θ(x_t-1\|x_t) via a conditional GAN and enable random large noise addition between adjacent diffusion steps for few-steps denoising. Their formulation can be summarized as follows: min_θmax_D_adv∑_t>0𝔼_q(x_t)D_adv(q(x_t-1\|x_t)\|\|p_θ(x_t-1\|x_t)), where D_adv tries to distinguish the difference between the predicted and sampled denoising distribution, while the predicted model tries to make them less distinguishable. The objective above can be rewritten as the following expectation: min_θmax_D_ϕ∑_t>0𝔼_q(x_0)q(x_t-1\|x_0)q(x_t\|x_t-1)[ [ -log(D_ϕ(x_t-1, x_t, t))] + 𝔼_p_θ(x_t-1\|x_t)[-log(1-D_ϕ(x_t-1, x_t, t))] ] . While this formulation allows more flexible modeling of p_θ(x_t-1\|x_t), the pure implicit adversarial learning on the concatenation of x_t-1 and x_t is statistically inefficient, especially when x_t is high-dimensional. We hypothesize that this is a major reason why DDGANs cannot scale up well on the large-scale dataset with more complex data distributions. In contrast, we will explore the inherent structure in the forward difussion process to develop a more efficient semi-implicit method, which is detailed in the following section. § SEMI-IMPLICIT DENOISING DIFFUSION MODELS This section will present our proposed semi-implicit denoising diffusion models (SIDDMs). We first discuss how we reformulate the denoising distribution, which enables fast sampling as DDGANs and high-quality generation as DDPMs. Then, we will introduce how we optimize our model in the training time. At last, we introduce a free discriminator regularizer to boost the model performance further. We show the simplified model structure in Figure <ref>. §.§ Revisiting Denoising Distribution and the Improved Decomposition Let us reconsider the training objective presented in Equation <ref>, which can be reformulated as follows: min_θmax_D_adv𝔼_q(x_0)q(x_t-1\|x_0)q(x_t\|x_t-1)D_adv(q(x_t-1,x_t)\|\|p_θ(x_t-1,x_t)), where DDGANs' formulation indirectly matches the conditional distribution of q(x_t-1\|x_t) and p_θ(x_t-1\|x_t) via matching the joint distribution between q(x_t-1,x_t) and p_θ(x_t-1,x_t) under the sampling strategy of 𝔼_q(x_0)q(x_t-1\|x_0)q(x_t\|x_t-1). Starting from this, we can factorize the two joint distributions in the reverse direction and get q(x_t-1,x_t)=q(x_t\|x_t-1)q(x_t-1) and p_θ(x_t-1,x_t)=p_θ(x_t\|x_t-1)p_θ(x_t-1). The conditional distributions are forward diffusion; we name them auxiliary forward diffusion (AFD) in our distribution matching objectives. In this decomposition, we have a pair of marginal distributions of denoised data q(x_t-1),p_θ(x_t-1) and a pair of conditional distribution q(x_t\|x_t-1), p_θ(x_t\|x_t-1). Because the marginal distributions do not have explicit forms, we can match them implicitly by minimizing the Jensen–Shannon divergence (JSD) via adversarial learning. For the conditional distribution of forward diffusion, since q(x_t\|x_t-1) has an explicit form of Gaussian, we can match them via KL. The following theorem states that matching these two pairs of distributions separately can approximately match the joint distribution. Let q(x_t-1,x_t) and p_θ(x_t-1, x_t) denote the data distribution from forward diffusion and the denoising distribution specified by the denoiser G_θ, respectively, and we have the following inequality: (q(x_t-1,x_t), p_θ(x_t-1,x_t)) ≤2c_1√(2(q(x_t-1), p_θ(x_t-1))) + 2c_2 √(2(p_θ(x_t\|x_t-1)\|\|q(x_t\|x_t-1))), where c_1 and c_2 are upper bounds of 1/2∫ \|q(x_t\|x_t-1)\|μ(x_t-1,x_t) and 1/2∫ \|p(x_t-1)\|μ(x_t-1) (μ is a σ-finite measure), respectively. A proof of Theorem <ref> is provided in Section II of the Supplementary. §.§ Semi-Implicit Objective Based on the above analysis, we formulate our SIDDMs distribution matching objectives as follows: min_θmax_D_adv𝔼_q(x_0)q(x_t-1\|x_0)q(x_t\|x_t-1) [D_adv(q(x_t-1)\|\|p_θ(x_t-1)) + λ_AFD(p_θ(x_t\|x_t-1)\|\|q(x_t\|x_t-1))], where the λ_AFD is the weight for the matching of AFD. In Equation <ref>, the adversarial part D_adv is the standard GAN objective. To match the distributions of AFD via , we can expand it as: (p_θ(x_t\|x_t-1)\|\|q(x_t\|x_t-1)) = ∫p_θ(x_t\|x_t-1)logp_θ(x_t\|x_t-1) - ∫p_θ(x_t\|x_t-1)logq(x_t\|x_t-1) = -H(p_θ(x_t\|x_t-1)) + H(p_θ(x_t\|x_t-1), q(x_t\|x_t-1)), which is the combination of the negative entropy of p_θ(x_t\|x_t-1) and the cross entropy between p_θ(x_t\|x_t-1) and q(x_t\|x_t-1). In our scenario, optimizing the cross-entropy term is straightforward because we can easily represent the cross-entropy between the empirical and Gaussian distributions using mean square error. This is possible because the forward diffusion, denoted as q(x_t\|x_t-1), follows a Gaussian distribution. However, the negative entropy term -H(p_θ(x_t\|x_t-1)) is intractable. However, p_θ(x_t\|x_t-1) can be estimated on samples from the denoiser G that models p_θ(x_t-1\|x_t). Thus we need another parametric distribution p_ψ(x_t\|x_t-1) to approximately compute -H(p_θ(x_t\|x_t-1)). In the following formulation, we show the maximizing of the conditional entropy can be approximated by the following adversarial training objective: θmin ψmax𝔼_p_θ(x_t\|x_t-1)logp_ψ(x_t\|x_t-1). We can give a simple proof of this proposition by considering the maximizing step and minimizing steps separately. We first consider p_θ is fixed, then, ψmax𝔼_p_θ(x_t\|x_t-1)logp_ψ(x_t\|x_t-1) = ψmax-H(p_θ(x_t\|x_t-1), p_ψ(x_t\|x_t-1)), when p_θ(x_t\|x_t-1)= p_ψ(x_t\|x_t-1), this negative cross entropy comes to the maximum. For the minimizing step, we set ψ to be fixed, then, θmin 𝔼_p_θ(x_t\|x_t-1)logp_ψ(x_t\|x_t-1) = θmin-H(p_θ(x_t\|x_t-1), p_ψ(x_t\|x_t-1)) = θmin-H(p_θ(x_t\|x_t-1)). Thus, this iterative min-max game between the generator p_θ and the conditional estimator p_ψ can minimize this negative conditional entropy -H(p_θ(x_t\|x_t-1)) that we mentioned in the decomposition of Equation <ref>. This adversarial process can perform as long as we can access the likelihood to p_ψ(x_t\|x_t-1). In our case, it is forward diffusion and follows the Gaussian distribution. Similar to DDGANs, we also define p_θ(x_t-1\|x_t):=q(x_t-1\|x_t,x_0=G_θ(x_t,t)) via the posterior distribution. In the distribution matching objective above, we apply the GANs to minimize the JSD of marginal distributions and the L_2 reconstruction to optimize the cross entropy. We also define x'_t-1 as the data sampled from the newly defined distribution, and x'_t are sampled from x'_t-1 via forward diffusion. Our final training objective can be formulated as follows: min_θmax_D_ϕ, C_ψ∑_t>0𝔼_q(x_0)q(x_t-1\|x_0)q(x_t\|x_t-1)[ [-log(D_ϕ(x_t-1, t))] + [-log(1-D_ϕ(x'_t-1, t))] + λ_AFD(1-β_t)‖ x'_t-1- x_t-1‖^2 - ‖ C_ψ(x'_t-1)- x'_t‖^2/β_t] , where C_ψ denotes the regression model that learns to minimize this negative conditional entropy. In the implementation, we share the most layers between the discriminator and the regression model. We put the detailed derivation of the following training objective in Section I of the supplementary. Compared with DDGANs, our model abandons the purely adversarial training objective and decomposes it into a marginal and one conditional distribution, where the conditional distribution can be optimised with a less complex training objective and leads to stable training for updating the denoising model. Secondly, our model can share the same model structure as DDPMs and be improved based on the advanced DDPMs network structure. Thirdly, our decomposition does not bring any overhead compared to DDGANs and can achieve steady performance improvement. §.§ Regularizer of Discriminator The UnetGANs <cit.> proposes adopting an Unet structure for the discriminator, demonstrating more details in the generated samples. Unlike the common design of discriminators, which only output a global binary logit of "True/Fake", an Unet-like discriminator can distinguish details from different levels. The denoising process in the diffusion models can also benefit from pixel-level distribution matching. Thus, our paper shares the same network structure between the denoiser G_θ and the discriminator D_ϕ. Inspired by our decomposition formulation, the reconstruction term provides better gradient estimation and boosts the model performance. We also apply the same strategy to the discriminator as a stand-alone contribution. That is, getting the denoising output from the discriminator and reconstructing it with the ground truth x_0. We formulate the regularizer as follows: min_D_ϕ𝔼_q(x_0)q(x_t-1\|x_0)L_2(D_ϕ(x_t-1,t), x_0), where this regularization only applies to the sampled data q(x_t). Different from the commonly used spectral norm <cit.>, Wasserstein GANs <cit.> and R1 regularization <cit.>, our regularization does not bring any side effect, such as restriction to model capacity, requiring additional overhead or grid search of the hyper-parameters on each dataset. Our regularizer can be easily plugged into our model and DDGANs and does not require extra network design, which is specifically designed for boosting diffusion models with GANs. § RELATED WORKS The pioneer works <cit.> of the diffusion models introduce the discrete time-step diffusion models and the parameterized reversal process for generating novel data. Later, the score-based perspective <cit.> proposes the continuous-time diffusion models and unifies the denoising diffusion model and the denoising score matching models <cit.>. The adversarial score matching <cit.> utilizes the extra adversarial loss to improve the unimodal Gaussian distribution matching, which differs from the goal of DDGANs and ours. Another branch of works introduces some inductive biases for improving the diffusion models further, the ADM, UDM and EDM <cit.> propose the classifier guidance, unbounded score matching and better sampling strategy for diffusion-based models respectively. Although diffusion-based models achieve better quality and diversity, it still suffers from the sampling speed, which usually takes thousands of steps to achieve the best quality. Several methods also boost the sampling speed via knowledge distillation <cit.>, learning the nosing schedule of forward diffusion <cit.>. The DDIM <cit.> and FastDPM <cit.> propose non-Markovian diffusion processes for the sampling boosting. For the score-based continuous-time diffusion models, <cit.> provides faster SDE solvers. The DDGANs <cit.> is most related to our proposed methods, which proposed an adversarial formulation for the denoising diffusion distribution and enable a few sampling steps without compromising the generated quality too much. Unlike DDGANs, we propose a new decomposition for the denoising distribution and achieve better results. From the perspective of better distribution decomposition, we share a similar insight with the related works of conditional GANs (cGANs) <cit.>. AC-GAN <cit.> proposes to model the conditional distribution of conditional generative models via decomposing the joint between the label and the data to a marginal and the conditional distribution via an auxiliary classifier. TAC-GAN lately fix the missing term of the AC-GAN decomposition. These two works can only be applied to the conditional generation while our proposed decomposition can be applied to both unconditional and conditional generation. Thus, their works are fundamentally different from ours. The other related GANs propose to enhance GANs with data argumentation <cit.> or diffusion noise <cit.>, which would also explain why GAN-ehanced denoising diffusion process can function well in practical. § EXPERIMENTS In our experiments, we evaluate our proposed method in the simulated Mixture of Gaussians and several popular public datasets, Cifar10-32 <cit.>, CelebA-HQ-256 <cit.> and the ImageNet1000-64<cit.>. To study the effects of our model components, we also conduct the ablations to identify their sensitivity and effectiveness. For the model architectures, we apply the Unet <cit.> as the ADM <cit.>, and we follow the same efficient strategy as Imagen <cit.> to change the order of downsampling and upsampling layer in the Unet blocks. In our method, we also design our discriminator as an Unet. Thus, we apply the identical structure for the generator G and the discriminator D. The only difference between them is the input and output channels for fitting in different inputs and outputs in our formulations. §.§ MOG Synthetic Data r0mm 0.7 Model / steps 1 2 4 8 16 vanilla GANs 12.04 - - - - DDGAN <cit.> - 7.27 0.99 0.49 0.53 SIDDMs(ours) - 0.14 1.21 0.30 0.23 SIDDMs w/o AFD (ours) - 21.19 53.22 7.04 14.37 MOG 5x5 results, FID↓ Identifying the effectiveness of generative models in high-dimensional data is tricky, and we cannot directly visualize the mode coverage of the generated data. Also, popular metrics like FID and Inception Score can only be referred as quality evaluation. Thus, we test our models and the baseline DDGANs on generating a Mixture of Gaussians. To generate the data, we sample 25 groups of data from the Gaussians independently and each distribution has a different mean but with the same variance. In Figure <ref>, we show the synthesized results of different models and the denoising steps and the quantitative results are shown in Table <ref>. We can observe that for the extremely few denoising steps of 2 and many as 16 steps, DDGANs fail to converge to real data distribution, and our proposed method can recover well on the different steps. Also, to identify if the adversarial term takes the main job in the generation, we remove the auxiliary forward term and find that our model cannot recover the original distribution, proving the proposed decomposition's effectiveness. r0mm 0.7 Model FID↓ SIDDMs (ours) 3.13 DDGANs (<cit.>) 20.63 CT <cit.> 11.10 ADM <cit.> 2.07 EDM <cit.> 2.44 Improved DDPM <cit.> 2.90 CD (<cit.>) 4.07 Generative results on ImageNet1000 To evaluate our model's effectiveness on real-world generation tasks, we test our models on the tiny image dataset CIFAR10, the fine-grained generation task on the Celeb-HQ, and the large-scale challenging dataset Imagennet. We pick a small amount of generated images from our model and show them in the Figure <ref>. We also quantitatively evaluate the quality of the generated samples and collect all of the results in Table <ref>,<ref> and <ref>. Visually, our model generates samples with high fidelity and rich diversity. For the evaluation metric, we choose the Fréchet inception distance (FID) <cit.> and Inception Score <cit.> for sample fidelity and the improved recall score <cit.> to measure the sample diversity. Compared with the GANs-based method, our method achieves better sample quality and diversity, identifying the benefit of enhancing GANs with the diffusion formulation. Compared with the baseline DDGANs, our model shows superior quantitative results than the baseline DDGANs. Although our method does not reach the same quality as the diffusion-based (or score-based) models with a small gap, our model still has the large advantage of fast sampling. To be notified, we apply four denoising steps for the CIFAR10 and two steps for the CelebA-HQ generation, identical to the DDGANs' main results. §.§ Generation on Real Data For the ImageNet, we choose four denoising steps to get the best sample quality on the ImageNet. ImageNet has 1000 categories, each containing thousands of images and distinguishing itself as a large-scale dataset with diversity. To train a generative model with high fidelity on the dataset, we usually require other inductive biases such as regularizers or model scaling-up methods <cit.>. The DDGANs fail to retain the high-fidelity samples on this dataset without additional inductive bias. However, with the same model capacity, our proposed method can achieve comparable results w.r.t. the diffusion-based models. This result shows that our model can handle large-scale generation and potentially be applied to boost the sampling speed of large-scale text2image models. § ABLATIONS To identify the function of the components in our formulation, we conduct controlled experiments on the effects of the adversarial and the AFD term. We set the weights of AFD to be [0.0, 0.1, 0.5, 1.0, 5.0, ∞], where 0.0 represents only the adversarial term and ∞ denotes only the AFD term in our training. We apply the same sampling strategy as our full models and adopt four denoising steps. The FID scores are reported in Table <ref>, and the generated samples are shown in Figure <ref>. We can see that if missing any of these two terms in our formulation, we cannot recover the original image distribution. In addition, we found that our model is not sensitive to the weights between these two components w.r.t. the FID scores when both terms participate in the training, which further identifies the effectiveness of our formulation. Also, we train the model without the regularizer for the discriminator, and we also identify that the proposed auxiliary tasks for the discriminator further enhance the model performance for our full formulation. § CONCLUSION In conclusion, the quest for fast sampling with diverse and high-quality samples in generative models continues to pose a significant challenge. Existing models, such as Denoising Diffusion Probabilistic Models (DDPM), encounter limitations due to the inherent slowness associated with their iterative steps. On the other hand, Denoising Diffusion Generative Adversarial Networks (DDGAN) face scalability issues when dealing with large-scale datasets. To address these challenges, we propose a novel approach that effectively addresses the limitations of previous models by leveraging a combination of implicit and explicit factors. Specifically, we introduce an implicit model that enables us to match the marginal distribution of random variables in the reverse diffusion process. Additionally, we model explicit distributions between pairs of variables in reverse steps, which allows us to effectively utilize the Kullback-Leibler (KL) divergence for the reverse distribution. To estimate the negative entropy component, we incorporate a min-max game into our framework. Moreover, we adopt the L2 reconstruction loss to accurately represent the cross-entropy term in the KL divergence. Unlike DDPM but similar to DDGAN, we do not impose a parametric distribution for the reverse step in our approach. This design choice empowers us to take larger steps during the inference process, contributing to enhanced speed and efficiency. Additionally, similar to DDPM, we effectively leverage the exact form of the diffusion process to further improve our model's performance. Our proposed approach exhibits comparable generative performance to DDPM while surpassing models with fewer sampling steps. unsrt § SUPPLEMENTARY § S 1. DERIVATION OF TRAINING OBJECTIVE Before getting the final training objective, we formulate the forward posterior following <cit.>. Via Bayes' rule, we can rewrite the forward posterior given _0: q(_t-1 \| _t, _0)=q(_t \| _t-1, _0) q(_t-1 \| _0)/q(_t \| _0) = q(_t \| _t-1) q(_t-1 \| _0)/q(_t \| _0), where all the components of the very right equation are forward diffusion and follow Gaussian distribution. Thus the forward posterior can be rewritten as Gaussian with mean and standard deviation as follows: q(_t-1 \| _t, _0)=𝒩(_t-1 ; μ̃_t(_t, _0), β̃_t𝐈). Here we do not give redundant derivation and give the firm of the forward posterior given x_t,x_0. μ̃_t(_t, _0):=√(α̅_t-1)β_t/1-α̅_t_0+√(α_t)(1-α̅_t-1)/1-α̅_t_t and β̃_t:=1-α̅_t-1/1-α̅_tβ_t. And we parameterize our denoised x'_t-1 given the predicted x'_0 and the input x_t via simply replacing the x_0 with the predicted x'_0 in the above equation. Then, given the parameterized x'_t-1. To get our final training objective, We can rewrite the distribution matching objective of Equation (7) as: min_θmax_D_adv𝔼_q(x_0)q(x_t-1\|x_0)q(x_t\|x_t-1)[ D_adv(q(x_t-1)\|\|p_θ(x_t-1)) + λ_AFD[ -H(p_θ(x_t\|x_t-1)) + H(p_θ(x_t\|x_t-1), q(x_t\|x_t-1))]] = min_θmax_D_adv,ψ𝔼_q(x_0)q(x_t-1\|x_0)q(x_t\|x_t-1)[ D_adv(q(x_t-1)\|\|p_θ(x_t-1)) + λ_AFD[H (p_θ(x_t\|x_t-1), q(x_t\|x_t-1))-H(p_θ(x_t\|x_t-1), p_ψ(x_t\|x_t-1))]], where the first GAN matching objective can be written as: min_θmax_D_ϕ∑_t>0𝔼_q(x_0)q(x_t-1\|x_0)q(x_t\|x_t-1)[-log(D_ϕ(x_t-1, t))] + [-log(1-D_ϕ(x'_t-1, t))]. In the first cross-entropy of our distribution matching objective, the q(x_t\|x_t-1) is the forward diffusion with the mean √(1-β_t)x_t-1 and variance β_tI. Thus the likelihood can be written as: H (p_θ(x_t\|x_t-1), q(x_t\|x_t-1)) = 𝔼_q(x_0)q(x_t-1\|x_0)q(x_t\|x_t-1)(1-β_t)‖ x'_t-1- x_t-1‖^2/β_t, To solve the second cross-entropy between the denoised distribution and the parameterized regression model, we define p_ψ(x_t\|x_t-1) := 𝒩(x_t; √(1-β_t)x_t-1, β_tI) as forward diffusion for the regression model. And we also define x't are sampled from the x'_t-1 via the forward diffusion. Similar to the above likelihood of cross-entropy, we can write the following likelihood for the second cross-entropy as follows: H (p_θ(x_t\|x_t-1), p_ψ(x_t\|x_t-1)) = 𝔼_q(x_0)q(x_t-1\|x_0)q(x_t\|x_t-1)‖ C_ψ(x'_t-1)- x'_t‖^2/β_t, Finally, we can get the final training objective of our proposed method. min_θmax_D_ϕ, C_ψ∑_t>0𝔼_q(x_0)q(x_t-1\|x_0)q(x_t\|x_t-1)[ [-log(D_ϕ(x_t-1, t))] + [-log(1-D_ϕ(x'_t-1, t))] + λ_AFD(1-β_t)‖ x'_t-1- x_t-1‖^2 - ‖ C_ψ(x'_t-1)- x'_t‖^2/β_t] , In the main paper formulation, we mistakenly exchange the position of the β_t and 1-β_t, it is a typo, we will correct it later. § S 2. DERIVATION OF THEOREM 1 For simplicity, we denote q via Q, p_θ via P and x_t-1, x_t via X,Y. According to the triangle inequality of total variation (TV) distance, we have d_TV(Q_XY, P_XY) ≤d_TV(Q_XY, Q_Y\|XP_X) + d_TV(Q_Y\|XP_X, P_XY).E11 Using the definition of TV distance, we have d_TV(Q_Y\|XQ_X, Q_Y\|XP_X) =1/2∫\|Q_Y\|X(y\|x)Q_X(x)-Q_Y\|X(y\|x)P_X(x)\|μ(x,y) (a)≤ 1/2∫\|Q_Y\|X(y\|x)\|μ(x,y)∫\|Q_X(x)-P_X(x)\|μ(x) ≤c_1 d_TV(Q_X, P_X),E12 where P and Q are densities, μ is a (σ-finite) measure, c_1 is an upper bound of 1/2∫ \|Q_Y\|X(y\|x)\|μ(x,y) , and (a) follows from the Hölder inequality. Similarly, we have d_TV(Q_Y\|XP_X, P_Y\|XP_X)≤ c_2 d_TV(Q_Y\|X,P_Y\|X),E13 where c_2 is an upper bound of 1/2∫ \|P_X(x)\|μ(x) . Combining (<ref>), (<ref>), and (<ref>), we have d_TV(Q_XY, P_XY) ≤c_1 d_TV(Q_X, P_X)+c_2 d_TV(Q_Y\|X,P_Y\|X)E14 According to he Pinsker inequality d_TV(P,Q)≤√(KL(P\|\|Q)/2) <cit.>, and the relation between TV and JSD, 1/2d_TV(P,Q)^2≤ JSD(P,Q)≤ 2d_TV(P,Q) <cit.>, we can rewrite (<ref>) as JSD(Q_XY, P_XY) ≤2c_1√(2JSD(Q_X, P_X))+2c_2 √(2KL(P_Y\|X\|\|Q_Y\|X)).E15 § S 3. SOCIETAL IMPACT With the increasing utilization of generative models, our proposed SSIDMs will improve the diffusion-based generative model while maintaining the highest level of generative quality. The incorporation of SSIDMs enhances the capabilities of generative models, particularly in the domain of text-to-image generation and editing. By integrating SSIDMs into the existing generative model framework, we could unlock new possibilities for generating realistic and visually coherent images from textual descriptions. One of the key advantages of our SSIDMs is their ability to accelerate the inference process, even though our model takes more time and more resources to train because of the additional adversarial training objectives. With faster inference, we eliminate the time-consuming barriers previously associated with text-to-image generation. As a result, real-time applications of generative models become feasible, enabling on-the-fly image generation or instant editing. § S 4. MORE IMPLEMENTATION DETAILS For the time steps, we apply the continuous time setup with the cosine noise schedule for all the experiments. We also apply a similar network structure as <cit.> and the downsampling trick as <cit.>, where we put the downsampling layer at the beginning of each ResBlock. As mentioned, we design the discriminator as UNet, which adopts the symmetric network structure as the generator. For the regression model C_ψ and the discriminator regularizer, we share most of the layers with the discriminator except that we put a different linear head for the marginal, conditional and regularizer outputs. To be notified, the C_ψ only works on the denoised data, and the regularizer only works on the sampled x_t-1 from the real data via forward diffusion. By this design, our model does not bring obvious extra overhead than our baseline DDGANs, which only has two more linear head in the final output for the discriminator network. We also describe the detailed model hyperparameters in the following table. We train all the models until they converges to the best FID score. § S 5. MORE GENERATED RESULTS
http://arxiv.org/abs/2306.01479v1	20230602120717	Reconciling Governmental Use of Online Targeting With Democracy	[ "Katja Andric", "Atoosa Kasirzadeh" ]	cs.CY	[ "cs.CY" ]	The University of Edinburgh Edinburgh United Kingdom [email protected] The University of Edinburgh & The Alan Turing Institute Edinburgh United Kingdom [email protected] The societal and epistemological implications of online targeted advertising have been scrutinized by AI ethicists, legal scholars, and policymakers alike. However, the government's use of online targeting and its consequential socio-political ramifications remain under-explored from a critical socio-technical standpoint. This paper investigates the socio-political implications of governmental online targeting, using a case study of the UK government's application of such techniques for public policy objectives. We argue that this practice undermines democratic ideals, as it engenders three primary concerns — Transparency, Privacy, and Equality — that clash with fundamental democratic doctrines and values. To address these concerns, the paper introduces a preliminary blueprint for an AI governance framework that harmonizes governmental use of online targeting with certain democratic principles. Furthermore, we advocate for the creation of an independent, non-governmental regulatory body responsible for overseeing the process and monitoring the government's use of online targeting, a critical measure for preserving democratic values. <ccs2012> <concept> <concept_id>10003456.10003462.10003588</concept_id> <concept_desc>Social and professional topics Government technology policy</concept_desc> <concept_significance>500</concept_significance> </concept> <concept> <concept_id>10002978.10003029.10003032</concept_id> <concept_desc>Security and privacy Social aspects of security and privacy</concept_desc> <concept_significance>300</concept_significance> </concept> </ccs2012> [500]Social and professional topics Government technology policy [300]Security and privacy Social aspects of security and privacy Reconciling Governmental Use of Online Targeting With Democracy Atoosa Kasirzadeh July 31, 2023 =============================================================== § INTRODUCTION Online targeting, a fundamental aspect of the modern digital economy, involves customizing online products and services based on users' psychological profiles. These profiles are derived from algorithmic analysis of personal data, primarily acquired through the online monitoring and processing of data <cit.>. Targeted ads, which have become an omnipresent feature of our online experiences, extend beyond merely displaying personalized ads for commercial items we have recently searched. As the Cambridge Analytica scandal revealed, online targeting has also permeated the political sphere, raising concerns about its broader implications <cit.>. In this paper, we explore the socio-political implications of the government's use of online targeting by examining a case study conducted by Collier et al. <cit.>. This study uncovers that, since at least 2015, the UK government and law enforcement agencies have been employing targeted online advertising in various campaigns. Examples of such campaigns include a fire safety campaign ran by the Home Office that utilised Amazon data and targeted particular citizens through their Alexa speakers, or a National Crime Agency campaign, targeting young video gamers in their online environments with a goal of decreasing online crime activity. These campaigns aim to influence citizens' behavior by tailoring personalized online advertisements according to their psychological profiles. Prior to Collier et al.'s research <cit.>, civil society in the UK was largely unaware of the prevalence and scope of such practices. Apart from the work by Collier et al. <cit.>, there is a notable gap in research regarding the socio-political implications of governments' use of online targeting.[Some discussions of similar practices can be found within the field of strategic communication. However, much of how governments employ online targeting remains implicit. For example, see <cit.> for a good overview of the field of strategic communication in the era of Big Data and <cit.> for a discussion of governmental communication during the COVID-19 pandemic, which included some online targeting.] Given the unique relationship between governments' use of online targeting, legitimate power, and the vast number of individuals affected by this contentious practice, there is an urgent need for interdisciplinary research to address the socio-political implications of governmental use of online targeting. In this paper, we present a critical and philosophical analysis of the socio-political challenges posed by the UK government's use of online targeted advertising to achieve public policy objectives. We investigate the contested relationship between this practice and the fundamental principles of democracy. We explore potential strategies to reconcile the government's use of online targeting with the core values and tenets of a democratic society. We emphasize that this issue warrants significant attention in terms of designing appropriate regulatory and governance mechanisms, particularly as generative artificial intelligence (e.g., large language models) has the potential to significantly enhance online targeting by accelerating the process, reducing costs, and improving the quality of content production <cit.>. This underscores the need for a timely and thorough examination of the implications of such governmental use of online targeting within the context of democracy and public policy. Thus far, the majority of philosophical literature on online targeting within the political domain has primarily concentrated on its influence on personal autonomy during voting and the negative repercussions for democracy <cit.>. Nevertheless, several other essential democratic values and principles, including equality, transparency, and privacy, frequently remain underexplored in this context. This paper endeavors to examine and highlight the often-neglected impacts of the governmental use of online targeting on these values and principles, thereby offering a more comprehensive perspective on the subject. The paper will proceed as follows. In Section 2, we define online targeting and briefly delve into its history and applications. In Section 3, we present Collier et al.'s study <cit.> of the UK government's use of online targeting, analyzing various past campaigns undertaken by the government. In Section 4, we highlight three key problems posed by governments utilizing online targeting: the Transparency Problem, the Privacy Problem, and the Equality Problem. We will demonstrate that each of these concerns conflicts with at least one fundamental aspect of democracy, as outlined by Lever <cit.>: (i) enabling citizens to be informed participants in law-making and electing representatives; (ii) upholding citizens' civil, socioeconomic, and political rights; and (iii) safeguarding citizens' equality and freedom. In Section 5, we argue that online targeting by governments can still be reconciled with democratic principles and values. Drawing on Züger and Asghari's AI governance framework <cit.>, we advocate for the establishment of an independent institution to oversee campaign design and deployment, serving as a check on government power. We show that this solution can, in principle, effectively address the three problems raised in Section 4. The final section concludes the paper. § WHAT IS ONLINE TARGETING? In today's digital world, an immense volume of personal data is accessible, encompassing not only basic details like names, email addresses, and birth dates but also extending to information derived from social media activity, sexual orientation, health records, search history, and purchasing habits. This data is collected, generated, stored, and managed by various entities, including commercial companies like Google, Facebook, and Amazon, as well as data brokers who specialize in aggregating and selling data to third parties <cit.>.[Data brokers often operate behind the scenes, amassing information from numerous sources to create comprehensive psychological profiles of individuals, which are then traded within the data market for various purposes.] Psychological profiles in online targeting refer to the comprehensive digital representation of an individual's personality, preferences, and behaviors, derived from their online activities <cit.>. These profiles are generated using data mining and machine learning algorithms that analyze various data points, such as browsing history, social media interactions, and online purchases, to infer users' interests, habits, and tendencies. The profile-building process often involves combining data from multiple sources, employing machine learning techniques to identify patterns, and categorizing individuals based on shared characteristics. These profiles are designed to forecast users' behavior and decision-making processes in various situations <cit.>. By constructing such detailed portraits of users, advertisers and commercial companies can tailor their content, messages, or campaigns to resonate with specific target audiences, ultimately enhancing the effectiveness of their online engagement <cit.> and advancing their business goals <cit.>. This process of adapting online content to align with the psychological profiles of users is known as online targeting. While online targeting is a relatively recent development, its offline counterpart has a more extensive history. The practice of influencing individual or group behavior by appealing to their psychology predates the advent of the internet or algorithm-driven profiling. A notable example, as described by Halpern <cit.>, occurred in the 18^th century when Frederick the Great successfully promoted the consumption of potatoes — a formerly unpopular and bland vegetable — in order to stave off famine. He accomplished this by establishing a guard around the royal potato fields and publicly expressing his admiration for the crop. This strategy piqued public interest and facilitated the widespread popularity of potatoes throughout Prussia. Later, in the 20^th century, Edward Bernays leveraged psychological principles to influence public opinion and behavior, making him a key historical figure in the practice of manipulating individual or group behavior by appealing to their psychology <cit.>. Today, such behavior can be examined through the lens of social and cognitive psychology, disciplines that were first combined with economics in the early 20th century to give rise to the field of behavioral economics. Behavioral economics investigates the consequences of human cognitive limitations on decision-making within markets <cit.>. Classical economics traditionally portrays individuals as rational decision-makers who consistently select the optimal choice after conducting thorough cost-benefit analyses, uninfluenced by extrinsic factors or emotions. In contrast, insights from various disciplines have revealed the impact of cognitive biases, emotions, perceptions, heuristics, and social contexts on rationality <cit.>. Consequently, economists have come to acknowledge that the way the choice options are presented can significantly influence the choices we make. In 2008, renowned scholars Richard H. Thaler and Cass R. Sunstein, the former having been awarded a Nobel Prize for his significant contributions to behavioral economics, introduced the concept of choice architecture <cit.>. This idea pertains to the environments in which we make decisions, encompassing the range of options available to us, the manner in which they are presented, and the entities presenting them. Thaler and Sunstein maintain that these choice architectures inherently influence the decisions we make. As a result, if we aim to guide someone towards a specific choice, we can modify their choice architecture through the application of nudges. As defined by <cit.>, a nudge is an aspect of the choice architecture that predictably alters people's behavior without forbidding any options or significantly changing their economic incentives. This concept suggests that subtle changes in choice architecture can have a significant impact on decision-making. A prime example of this would be strategically placing healthy food options at eye level in a grocery store, while positioning unhealthy alternatives out of sight, in order to boost sales of healthier choices. Online targeting operates on a principle similar to that of its non-digital counterparts, such as grocery stores, wherein choice structures are manipulated to guide user behavior towards a desired outcome. What sets online targeting apart, however, is the capacity to accurately segment audiences based on their algorithmically generated profiles. Furthermore, it allows for dynamic adjustments to choice structures tailored to each individual user, taking into account their personal preferences <cit.>. User-facing platforms, which serve as primary channels for online targeting, are meticulously optimized through extensive user experience (UX) testing methods and the application of behavioral insights. This optimization aims to maximize user attention, resulting in heightened engagement with targeted content and the conversion of this attention into revenue or other desired behaviors <cit.>. This characteristic sets online targeting apart from offline targeting, as it enables the deliberate and strategic delivery of customized nudges to each user, informed by an understanding of the nudge's impact on that specific individual. As a result, these personalized nudges prove more potent, allowing those employing targeting tactics to accomplish their business objectives with greater efficiency and effectiveness. The pervasive use of online targeting, especially in targeted advertising — which constitutes 79% of all online advertising <cit.> — is hardly surprising in today's digital landscape. Internet companies frequently employ Chief Behavioral Officers and Choice Architecture Engineers to shape their customers' behavior <cit.>. As a foundational component of the modern internet economy <cit.>, online targeting contributes to enhanced sales of goods and services. Additionally, it enables numerous apps and websites, ranging from Facebook to The Guardian, to provide low-cost or free services by relying on revenue generated through targeted ads <cit.>. Online targeting techniques, which have proven effective in shaping behavior, are not only confined to the commercial realm. These methods have infiltrated the political sphere, where they have been employed in political campaigns to sway voters' decisions <cit.>. The infrastructure of online targeting has thereby enriched the longstanding practice of political marketing, which dates back to the 1980s <cit.>. The tactics of online political targeting were reported during Barack Obama's groundbreaking 2008 presidential campaign which involved identifying supporters and persuading undecided voters <cit.>, but gained even greater notoriety during Donald Trump's 2016 presidential campaign <cit.>. In the latter campaign, the Trump team enlisted the expertise of Cambridge Analytica, a British political consultancy firm. This company harvested data from an astonishing 87 million Facebook users through a seemingly innocuous personality quiz <cit.>. With this wealth of information, Cambridge Analytica crafted intricate psychological profiles of users and deployed emotionally manipulative, personalized advertisements to influence their voting behavior in favor of Trump <cit.>. This striking example underscores the pervasive reach of online targeting techniques. It also highlights their potentially profound impact on political outcomes. Online political targeting is not limited to the United States, as political parties across Europe have also utilized these techniques <cit.>. The UK's House of Commons Select Committee on Digital, Culture, Media and Sport has described online political targeting as a "democratic crisis" <cit.>. As we intend to show in this paper, this crisis has deepened, with the government now using the online targeting infrastructure for public policy purposes, which can undermine fundamental principles of democracy if used inappropriately. In the following section, we examine a case study that demonstrates how the UK government's utilization of online targeting can potentially compromise certain democratic principles. § GOVERNMENTAL USE OF ONLINE TARGETING A recent study by Collier et al. <cit.> has uncovered a striking finding - the UK government and law enforcement agencies are utilizing online targeted advertising to influence citizens' behavior and achieve public policy objectives. This use of online targeting presents unique socio-political implications that warrant further exploration. To understand the potential consequences, it is essential to first grasp the nature of the UK government's employment of online targeted advertising. The UK government has a history of attempting to change the behavior of its citizens in order to achieve public policy goals. Following the establishment of the Behavioural Insights Team (also known as Nudge Unit) in 2010, the government has been openly applying nudge theory to public policy <cit.>. The Team's objective is to influence people's choices by designing appropriate incentives or obstacles, thereby encouraging the desired options, all while incorporating insights from behavioral economics <cit.>. The Nudge Unit's inception was fueled by the growing popularity of behavioral change techniques combined with social marketing practices among UK public policy makers, who had been experimenting with the application of commercial marketing principles to promote public goods since 2004 <cit.>. Examples of the Team's initiatives include adjusting tobacco prices to deter individuals from purchasing it or incorporating carefully crafted tax prompts in letters to taxpayers to encourage prompt payments (e.g., "most people pay their tax on time") <cit.>. While influencing citizens' behaviour for the purpose of achieving public policy objectives is not a new practice for the UK government, what is a new practice is combining these behaviour change strategies with the infrastructures of online targeted advertising.[Adapting commercial marketing technologies, such as online targeted advertising, to programs that are designed to influence the behaviour of targeted individuals for their benefit as well as wider social benefit, is what Andreasen <cit.> terms social marketing.] As explained in Section 2, those infrastructures involve data gathering and processing by machine learning algorithms to create profiles of individuals and groups so that messages specifically tailored to each profile can be created and delivered to those deemed susceptible. Collier et al.'s research <cit.> shows that government departments are combining operational data gathered and produced by state institutions and the associated systems of classification and profiling of social groups (e.g. the needs, risks and vulnerabilities of groups such as patients, immigrants and welfare recipients) with data gathered and produced by commercial companies and the internet economy (e.g. clicks, page visits, shopping habits, social media activity, and online social interactions). The hybridisation of the two categories of data and their algorithmic processing allows for both a wide and a deep insight into UK's communities and individuals. During the past decade, the UK government ran numerous campaigns at the heart of which was online targeting. Collier et al. <cit.> map those into three distinct modes of operation, which we term (i) the minimally targeted mode, (ii) the maximally targeted mode, and (iii) the outsourced mode for ease of reference. The first two modes are delivered by government and law enforcement agencies and differ in the level of sophistication of the targeting used. In contrast, the last mode involves outsourcing the services of private sector companies but is on par with the maximally targeted mode in terms of targeting sophistication. The first and the least sophisticated mode, i.e., the minimally targeted mode, amounts to simply extending the advertising scope to online spaces through online advertisement buys. As the name suggests, this mode is minimally targeted as it does not involve much audience segregation or reliance on individuals' profiles but is targeted at entire population groups. It involves actions such as running advertisements on Tiktok to reach younger audiences. The second and significantly more sophisticated mode of operation, which we term the maximally targeted mode, leverages targeting to reach specific groups or individuals and informs the design of the run adverts. This mode employs algorithms that enhance personalization and relies on a network of government entities led by the Government Communication Service to develop nationwide behavior change strategies. In addition to implementing multi-site and single-site campaigns to change behavior through tailored messages, this mode also includes countering misinformation online and protecting the government's reputation from negative messages. One notable example cited by <cit.>. is a fire safety campaign by the Home Office, where the department utilized purchasing data from individuals who recently bought candles on Amazon and targeted them with fire safety messages through their smart speakers, such as Alexa. The maximally targeted mode also involves leveraging the maximally targeted technologies and methods employed by law enforcement for preventive purposes. A prime example of this is the CYBER CHOICES preventative diversion program ran by the UK National Crime Agency (NCA) in collaboration with behavioral psychologists <cit.>. This initiative utilized Google and YouTube advertisements targeted towards UK adolescents between the ages of 14 and 20 who were identified through NCA surveillance as potentially interested in gaming. The ads would appear whenever they searched for cybercrime services and warn them of the illegal nature of purchasing such services and the consequences they could face if they did so. As a part of this campaign, NCA officers also visited the identified "targets" at their homes, discussed their online behaviour with their parents, and invited them to workshops organised and ran by NCA. The goal of those workshops was twofold. Firstly, the individuals were taught the skills required to turn their illegitimate interests into a legitimate career. Secondly, NCA used the workshops to gather data to optimise the design of further targeted ads. There is evidence that this particular campaign was successful in reducing the rate of cybercrime <cit.>. The third and final mode of operation, the outsourced mode, entails entrusting the entire process of designing, developing, and executing campaigns to private sector companies <cit.>. One instance is SuperSisters, a Muslim online lifestyle platform established by J-Go Media in 2015, aimed at young British Muslim girls. Although marketed as a platform for sharing and creation of empowering content, the project sparked controversy when it was revealed that it was covertly funded by a government counter-extremism arm and that the content on the website was carefully curated to counteract what the state deemed to be "overtly Islamic" <cit.>. Another example includes a UK Home Office-supported knife prevention campaign, targeting young Black individuals residing in London's deprived neighborhoods, created by FCB Inferno and All City Media <cit.>. The campaign's offline component included messages displayed on takeout boxes in fried chicken restaurants, based on police data which indicated that Black individuals commit more knife crimes and perpetuated a racist stereotype that they consume fried chicken <cit.>. The online component aimed at young Black males living in impoverished areas of London drew upon the same data and stereotype. § SOCIO-POLITICAL ISSUES AND ONLINE TARGETING'S CONTESTED RELATIONSHIP WITH DEMOCRACY Some of the examples outlined in the previous section may cause discomfort. In this section, we will pinpoint some of the social and political issues that arise from the use of online targeted advertising by democratic governments to achieve public policy goals. Clearly formulating these issues will not only concretize the discomfort, but it will also lay the groundwork for a deliberation on the legitimacy of such practices and, if necessary, their proper form. The examination of these questions will be the focal point of the upcoming section. For the moment, our attention will be directed toward highlighting the challenges associated with this procedure. In the context of governmental use of online targeted advertising, the primary socio-political concern is the potential for abuse of power and erosion of democratic values.[Additional ethical issues and potential solutions surrounding the practice of targeted advertising have been extensively explored in literature, including works by Thaler and Sunstein <cit.>, Hansen and Jespersen <cit.>, Wilkinson <cit.>, and Nys and Engelen <cit.>. It is important to note that some of these issues are not exclusive to online targeting or governmental use of it, as non-digital nudging also raises similar concerns. For the lack of space, we will not be covering the non-digital instances in this paper.] According to Susser <cit.>, autonomy refers to a person's ability to make decisions based on their own personal values and beliefs. Online targeted advertising undermines autonomy by intentionally and covertly manipulating individuals through exploiting their decision-making vulnerabilities and cognitive biases <cit.>. This manipulation often goes unnoticed, as individuals are unaware of the influence on their decision-making. In line with this concern and as a result of governmental online targeting, individuals are left open to being molded into the ideal citizens according to the government's preferences. While we acknowledge the negative impacts on autonomy through manipulation, governmental use of online targeting raises additional and novel socio-political issues that have not yet been thoroughly analyzed. This paper will focus specifically on such socio-political concerns. At the core of the socio-political concerns specific to governmental online targeting is the practice's contested relationship with democracy and democratic values. So far, philosophical literature tackling the relationship between online targeting and democracy has focused almost solely on the detrimental effect online targeting has on one's autonomy during voting, the manipulative nature of this practice and the dangers it poses for democratic elections <cit.>. However, governmental use of online targeting for public policy goals brought to light by Collier et al.'s research <cit.> expands the known scope of online targeting in the political domain beyond using targeted adverts on citizens during election campaigns. This novel use of online targeted advertising undermines other, overlooked, features central to democracy besides voting. These are the ones we will tackle. According to Lever <cit.>, democracy comprises three key elements: (1) allowing citizens to be informed participants in decision-making processes, including the creation of laws and the election of representatives; (2) guaranteeing and preserving civil, socioeconomic, and political rights; and (3) ensuring equality and freedom for all citizens. However, the UK government's practice of using tailored online advertisements, particularly through maximally targeted and outsourced methods, violates — to a certain degree — all three of these democratic principles. We argue that this practice raises three major issues - the Transparency Problem, the Privacy Problem, and the Equality Problem - that directly challenge one or more of the key elements of democracy. §.§ The Transparency Problem Transparency is generally understood to be one of the central principles of democracy <cit.>. If citizens do not have the ability to freely access information, they cannot keep the government accountable for their actions and decisions. Moreover, they cannot make informed decisions at the ballot box or actively participate in other democratic processes, such as publicly questioning and criticising the government's decisions. The lack of transparency about the governmental use of online targeting undermines the feature (1) of democracy mentioned above: enabling its citizens to participate in the determination of laws and the election of their representatives. In this subsection, we will show that the UK government's use of online targeting suffers from a lack of transparency. We call this the Transparency Problem. The Transparency problem can be viewed from different angels. Firstly, there is a general lack of governmental transparency about the practice of online targeted advertising. The government has never published a comprehensive list of online targeting campaigns it has created itself or outsourced from the private sector. While some scarce information is available on different governmental bodies' websites, most of the information about the campaigns comes from the documentation submitted to various industry awards by third-party agencies hired by the government to develop and run the campaigns.[We confirmed this through personal communication with Ben Collier, 2022.]. From government records only, it is uncertain how many campaigns the government has run so far, who the campaigns targeted, or what the content of those campaigns was. Apart from the former lack of transparency concerning the practice, online targeted advertising suffers from an inherent lack of widespread transparency. As Collier et al. <cit.> argue, targeted adverts are normally only seen and intended to be seen by those targeted, meaning that most of the population will never encounter them. In contrast, non-targeted governmental campaigns delivered either online or offline are, in principle, visible to the entire population (including the press) who can scrutinize and challenge them. The lack of extensive visibility of targeted adverts reduces the capability for broader scrutiny. Consequently, it reduces the public's ability to hold the government accountable for its actions. Moreover, determining the effectiveness of targeted governmental advertisements is challenging since it cannot be measured by directly observable outcomes, such as sales conversion, as is the case with commercial targeting <cit.>. This not only makes it difficult to justify the measure, but also reduces the citizens' ability to hold the government accountable, as they must not only know what the government is doing, but also whether it is achieving satisfactory results.[The field of public relations also faces the challenge of determining the success of its campaigns due to the lack of readily quantifiable metrics for success. Some efforts have been made to establish a framework for tracking and measuring the impact of public relations campaigns in the field, which could be relevant to governmental online targeting. For example, see <cit.>, <cit.> and <cit.>] A final blow to transparency is delivered by the fact that machine learning algorithms underpinning the structure of targeted advertising suffer from an inherent opacity problem. This means that it is not always possible to know why and how — in non-mathematical terms — an algorithm reached a specific prediction <cit.>. The implication is that citizens are often unable to obtain an explanation for why they were targeted with a specific advert. This issue is exacerbated by Collier's assertion that, even upon request, the government will not disclose targeting data, which is the data used to identify individuals for a particular advert.[This was revealed to us in a personal conversation with Ben Collier in August 2022.] Without sufficient information being provided to the relevant stakeholders about the algorithmic systems that make decisions about them, it is challenging to envision any meaningful discussion of the ethical concerns raised by the behavior of the system <cit.>. §.§ The Privacy Problem The concept of privacy carries various interpretations <cit.>. A significant definition posits privacy as the capacity to control our personal information. This control enables us to manage others' knowledge about us, thereby establishing varying degrees of intimacy with different individuals or groups <cit.>. Crucially, the freedom to disclose our personal details at our discretion and to chosen recipients safeguards our autonomy and dignity. In instances where our personal data is collected and analyzed, the exercise of informed consent ensures we retain control. Conversely, data collection and analysis conducted without our informed consent infringes upon our right to privacy. The right to privacy is a fundamental human right recognised by democratic countries <cit.>. To illustrate, in the UK, this right is protected by the . This right offers protection to citizens from undue and illegal governmental surveillance. Moreover, it fosters an environment where individuals feel secure to explore, express their beliefs, and cultivate their interests. In this subsection, we will make the argument that the UK government has, in some instances, collected data on its citizens without obtaining informed consent. This action can be seen as an infringement on the citizens' right to privacy, a concern we refer to as the Privacy Problem. This problem not only conflicts with Lever's second principle of democracy - the preservation of citizens' civil, socioeconomic, and political rights - but also compromises the citizens' capacity to make genuinely independent political decisions, contradicting the first principle. Let us unpack this problem. Privacy and consent are closely interrelated. The act of consenting to data collection and analysis allows you to exert control over your personal data. Consent, viewed as a normative concept, can make an act that would otherwise be impermissible, permissible by facilitating the transfer of rights and obligations between involved parties <cit.>. For consent to be morally transformative, it must be informed. In the context of data, this necessitates the provision of the following: (i) an explicit description of the potential uses and restrictions of your data, (ii) a specific definition of the scope within which your data can be utilized, (iii) ample information for the consenting party to comprehend what they are agreeing to, (iv) a range of free-to-choose options, and (v) a mutually equitable treatment between both parties <cit.>. In the UK, the personal information of individuals is safeguarded by the , which outlines six principles of data protection that all parties responsible for using personal data must adhere to. For example, the first data protection principle requires that consent is obtained from the individual for the information to be collected and processed.[Notably, the Act lists certain exceptions, but a full interpretation of these is beyond the scope of this paper.] If a party plans to use your data in a way that was not disclosed during the initial consent process, this original consent becomes invalid and a fresh consent is required. For example, if a party intends to use your postal code for a different purpose than the one you initially agreed to, such as determining insurance rates, they must seek your permission again <cit.>. Similarly, if a party intends to combine your data with another dataset (for both of which you have given individual consents), they must ask for your renewed consent. This is because the merger could generate new information that was not anticipated when you initially gave consent. The UK government's use of targeted advertising raises concerns regarding the validity of consent due to not disclosing relevant information in both of above senses. While the government has sought permission from citizens to gather administrative data, it neglected to disclose that this data could be utilized for profiling and online targeted advertising. It is probable that the surveys used to collect such data contained a clause explicitly stating the data would not be used for marketing purposes. As a result, the consent previously acquired is flawed and fresh consent must be obtained. Additionally, the lack of transparency surrounding this practice leaves many unaware that their online activity, such as Facebook likes and Amazon purchases, could be leveraged to fulfill public policy objectives. This data, when merged with census data, generates new information for which proper consent was not sought. Consequently, this practice seems to be illegitimate. The Privacy Problem, besides raising questions about consent validity, also impedes UK citizens' full participation in democratic processes. Here is why. The erosion of privacy harms not only those whose privacy is at stake, but also democracy itself <cit.>. Privacy creates a safe space for individuals, facilitating the growth of their opinions, the exploration and pursuit of diverse interests, and the freedom to make decisions without fear of judgment or backlash. Being constantly monitored, with the potential of being categorized into risk groups by the government or targeted with intimidating adverts, and in extreme cases, even receiving home visits for merely searching certain terms (as seen in the CYBER CHOICES campaign), can instigate self-censorship and make people feel unsafe in their own country. This is especially true for historically disadvantaged groups, who may feel particularly unsafe and skeptical towards the government <cit.>. Governments have long engaged specific subsets of the population through various forms of offline advertising and public policy campaigns. For instance, public health campaigns have often targeted smokers, warning them of smoking dangers via pamphlets distributed in healthcare facilities and television commercials. However, there is a distinct contrast between such campaigns and those founded on the framework of online targeting. In the case of offline campaigns, individuals are aware they are the target because they identify with the group in question. On the other hand, when it comes to online governmental targeting, individuals receive specific advertisements because they have been personally identified by the government as relevant recipients. This identification process is made possible by continuous governmental monitoring of the individual's online activities, to which they likely did not consent. Furthermore, this kind of targeting grants governments access to previously inaccessible areas — private homes. For example, whereas in the past, you might have encountered a fire safety poster while commuting to work, now, you might be greeted by a message about fire safety from Alexa when you return home because you purchased a candle on Amazon the previous week. Online targeting by government agencies is significantly more invasive than traditional methods, largely due to the opaque nature of the data collection process. This lack of transparency can exacerbate feelings of paranoia and vulnerability. The core of the chilling effect we are discussing lies in this disparity. Persistent surveillance fosters an environment of constraint, where individual autonomy is violated <cit.>. For a democracy to thrive, it necessitates independent and autonomous decision-makers, a condition which becomes challenging to fulfill in the absence of privacy. Consequently, privacy appears to be a crucial component in exercising our democratic rights, including political choice <cit.>. §.§ The Equality Problem The third socio-political concern central to our discussion is what we call the Equality Problem. This problem relates to the possibility that government-led targeted advertising may undermine the principles of equality and justice upheld by democracy, thereby violating the third democratic feature outlined by Lever. In an effort to identify the target audience for a campaign, the UK government and law enforcement construct a profile of the ideal target and advertise to individuals who fit this profile. This profile is created using available data and is generated algorithmically. However, it has become increasingly clear that AI algorithms have the potential to perpetuate existing wrongful social inequalities <cit.>. This is largely due to the data used to develop these algorithms often reflecting the biases and disparities inherent in society. The algorithms look for patterns in the data, but if the data reflects wrongful inequalities, such as over-policing of Black neighborhoods, then the output of these algorithms risks perpetuating existing social hierarchies. Consequently, this approach has the potential to exacerbate the marginalization of already disadvantaged groups. It could erroneously place these individuals into risk categories, not because of their actions, but due to systemic discrimination. This sort of bias, targeting protected characteristics like race, sex, gender, and disability, is not only unethical but also unlawful according to the authors of . A notable instance of this is the targeting of young Black males residing in economically disadvantaged areas of London in a knife crime prevention campaign, a topic elaborated upon in Section 3. Algorithmic bias can lead to discrimination, but it's not the only source. As AI algorithms unearth patterns within data sets, novel forms of discrimination can arise, not necessarily linked to traditionally protected attributes <cit.>. People can be placed into "ad hoc" categories, like dog owners or video gamers, and subsequently face unfair treatment compared to those outside these groups. This is because the algorithm had detected a correlation between owning a dog or playing video games and certain behaviors. However, owning a dog or playing video games may not be a normatively acceptable basis for forming a group around them if the formation occurred as a result of a spurious correlation found in the data or if the statistical correlation is insufficiently significant <cit.>. The use of online targeting by the government is not only leading to unfair and discriminatory outcomes for individuals, but it also poses a deeper problem with regards to equality. It creates a shift in power dynamics within society, giving the government more control over its citizens than is desirable in a democratic society <cit.>. The connection between knowledge and power cannot be ignored. The government's collection and analysis of individuals' data gives them a greater ability to influence and control their citizens <cit.>. This raises concerns about potential misuse of such power, as warned by Königs <cit.>. Furthermore, it raises questions about who has the authority to shape society and determine its priorities <cit.>. The question therefore persists: Can the practice of targeted governmental advertising ever align with democratic principles and values? The following section outlines steps towards answering this inquiry. § RECONCILING ONLINE TARGETING WITH DEMOCRACY In light of our previous discussions, it is clear that online targeting can be an effective strategy for achieving certain goals. This approach allows the government to identify and engage with specific subgroups more effectively, offer tailored resources to address public issues, and optimise the use of their limited resources. However, its employment by the UK public sector has provoked serious questions about transparency, privacy, and equality. In order to align its use with democratic principles, the government must address these concerns. While we acknowledge there is no easy fix, we propose a few steps towards a potential solution. First, we suggest requirements for the design and execution of online governmental targeting campaigns that are in alignment with democratic values. We will reference the recent AI governance framework developed by Züger and Asghari <cit.> as our initial guideline. Second, we propose the creation of an independent body to monitor the development and implementation of these campaigns. This institution will ensure compliance with the defined requirements and provide guidance to government officials. The use of AI for social benefits has been gaining momentum in recent years. Numerous applications of AI are now directed towards addressing issues that impact human life and well-being <cit.>. Considering that public policy should embody public interests <cit.>, utilizing AI-powered online targeting to achieve these policy goals is another way in which AI can serve the public interest and contribute to societal good. This usage of AI-powered online targeting to fulfill public policy objectives falls within the ambit of an AI governance framework that prioritizes public interest. According to Züger and Asghari <cit.>, there are five prerequisites for a system to align with the public interest: (1) public justification, (2) focus on equality, (3) inclusion of a deliberation/co-design process, (4) implementation of technical safeguards, and (5) commitment to openness for validation. To successfully address the three problems we highlighted in the previous section, all five requirements must be met. The first three requirements are context-sensitive and their fulfillment will differ depending on the project. Requirements 4 and 5, being technical supplements, are less dependent on the specific nature of the project. §.§ Public Justification Züger and Asghari <cit.> propose that for an AI-based solution to be recognized as serving the public interest, it must possess a normative democratic justification that is widely accepted by the public. This justification should include a lucid explanation of the issue that the AI solution seeks to address and why it is superior to alternative solutions. This stipulation is anchored in the philosophical views of public interest presented by Habermas <cit.>, Held <cit.>, and Bozeman <cit.>, who assert that the public should determine what is in their best interest on an individual case basis. In terms of the UK government's approach to online targeting, it is crucial for the government to maintain transparency. This involves disclosing any online targeting campaigns to the public, clarifying why this particular method was chosen, and detailing the operational aspects of the campaign, such as the ad content and target demographic. By doing so, the government can counteract the prevalent lack of transparency in this practice. To further enhance accountability, the government should also consistently update and provide a predictive measure of the campaign's efficacy, as well as quantifying interactions with the ads. Nevertheless, while conducting these processes, it is of utmost importance to safeguard individual identities by anonymising the data. Finally, the justification should also provide easily understandable information about opaque algorithms. By adequately fulfilling these requirements, the Transparency Problem can be avoided. §.§ Equality Züger and Asghari <cit.> assert that serving equality (and at the very least not hurting it) must be the most important normative goal of a solution that aims to promote public interest. Thus, they argue that any public interest AI-based solution must find a way to solve the problem of algorithmic bias and not create unwanted power imbalances in society. The second requirement is also based on previous scholarship. More precisely, the work of a legal scholar Feintuck <cit.>, who argues that something can be in the public interest only if it promotes equality of citizenship. To satisfy this requirement, the UK government should not run any campaigns that discriminate against its citizens (whether based on some protected characteristic stemming from algorithmic bias or on spurious correlations found in the data), reproduce harmful social hierarchies or create new power imbalances. By fulfilling this requirement, the government would solve the first part of the Equality Problem - discrimination by the government. There remains the second part of the problem - unwanted power asymmetry. The proposed preliminary solution for this issue will be presented at the end of this section, where we suggest the formation of an independent institution tasked with monitoring these practices. §.§ Deliberation/Co-Design Process Züger and Asghari <cit.> argue that to determine what is in the public interest for a public at a given time, the public must be involved in the system's design through the process of deliberation. The process can take any form, from online documentation to interviews with citizens. Without public deliberation about the public's interests, the team of developers will have to assume the interests of others which can easily lead to harmful mischaracterisation, unintended consequences and public rejection of the project <cit.>. Therefore, they argue that those who will be affected by the system must have their say. As with the previous two requirements, Züger and Asghari root this requirement in an existing philosophical theory. According to Bozeman <cit.>, who draws from Dewey <cit.>, the individuals who form the public can only determine what is in the public interest through public deliberation by expressing their personal views, listening empathetically to others and reaching a compromise which benefits everybody. Such a highly democratic approach is available to the UK government, although it is rarely followed since it requires significant resources. However, a 2021 outsourced campaign by Police Scotland called Breaking the Cycle of Fear, whose goal was to reduce violence in the most deprived areas of Glasgow and Dundee, showed why such a process is desirable, despite the required resources. During the design process, interviews were conducted with individuals from targeted areas who had managed to escape the cycle of violence. The interviews aimed to understand what life in such areas looks like, how one gets involved with violence, and how one escapes it. Data gathered through these interviews informed the design of a targeted advert - in this case, a short movie[The movie can be viewed here: <https://www.youtube.com/watch?v=APUfXvepLQQ&t=3s>]- which was assessed for credibility and realism by the interviewees. In three months, almost 500 targeted people reached out to the Scottish Violence Reduction Unit asking for help in escaping the cycle of violence themselves. Moreover, the campaign received only positive criticism from the targeted population, who did not report feeling marginalised. Had the previously discussed knife crime reduction campaign followed a similar approach, it could have avoided relying on harmful stereotypes and further marginalising the communities they were trying to reach. Therefore, governments should follow this approach in future online targeting-based campaigns as this will significantly help solve the Equality Problem. §.§ Technical Safeguards and Openness to Validation Züger and Asghari <cit.> argue that AI-based systems need to implement technical safeguards, including data quality and system accuracy, data privacy, and safety and security. That is, the data fed into the AI systems needs to be free of bias and of high quality so that the outcomes are accurate, can be validated and serve equality. Satisfying this technical safeguard would take us closer to solving the Equality Problem. Further, data protection and privacy laws must be complied with. This includes obtaining informed consent from everyone whose data is being used, which would solve the consent part of the Privacy Problem. Finally, it must be ensured that the system is secure and robust to eliminate malfunctions, unintended functionalities and security breaches. The next requirement Züger and Asghari <cit.> propose amounts to having the entire system, including the design process, open to validation of others. They note two main reasons for this requirement. Firstly, any system that impacts the public at large may cause unintended harm, regardless of the good intentions of its makers. Secondly, any system that claims to be in the public interest should follow the basic democratic norm of transparency, allowing those impacted by the system to review all decisions made by the systems' makers and the workings of the technology to ensure that its mechanisms are democratic <cit.>. This would help with the explainability of the system and, consequently, people's trust in the system. Thus, if the UK government satisfied this requirement, it would take another step toward solving the Transparency Problem. §.§ Independent Institution In theory, satisfying these five requirements could be left entirely to the government's discretion while trusting that they will behave ethically. However, there would be no way of ensuring that the government is sincere in following the guidelines without an independent organization overseeing the entire process and serving as a check on the government's power. Moreover, the government officials who currently run these campaigns do not always possess the necessary knowledge to understand the harms a campaign may cause, the technical workings of the algorithms behind the campaigns or the regulation that needs to be followed. Interviews with UK public officials reveal that online targeting campaigns, especially at a local level, are often designed without much consideration of the ethical issues they may raise, prior research or planning. For example, Collier and Wilson <cit.> report an insider to a UK government-led counter-radicalisation campaign describe their approach as "throwing things at a wall to see what sticks". Similarly, Wilson's conversations with an employee from the UK's Foreign, Commonwealth and Development Office reveal that online targeting of citizens identified as being at risk of turning to religious extremism is often done because it can be used to show that something is being done, despite evidence that such campaigns have no positive effects or even have negative effects <cit.>. Thus, an independent, interdisciplinary team of experts whose purpose would be to ensure that the government is fulfilling Züger and Asghari's requirements and educate the public officials wishing to use the infrastructure of online targeting for public policy goals is needed. Such an institution would also reduce the unwanted shift in the power balance to the government's favour since the institution would serve to ensure that the government is not abusing its power. This would increase the public's trust in the system and make them less likely to fear judgement or retribution from the government for what they do in the privacy of their online spaces, thereby making them less likely to self-censor their behaviour. Therefore, an institution imagined in this way would contribute to solving both the Equality and the Privacy Problems. In the end, as we have argued, it seems possible to reconcile governmental use of online targeting with democratic principles and values. To do so, the government must satisfy Züger and Asghari's five requirements, while being overseen by an independent organisation yet to be established. § CONCLUSION This paper addresses the socio-political implications of a previously overlooked governmental practice: the use of online targeted advertising for public policy objectives. Our discussion is anchored on a particular case involving the UK government's use of this practice, as explored in the study by Collier et al. <cit.>. We argued that this practice, as characterized in this paper, is strikingly undemocratic and raises three major anti-democratic concerns: the Transparency Problem, the Privacy Problem, and the Equality Problem. To reconcile this practice with democratic principles, we sketch the outline of a solution: that the governmental use of online targeting should adhere to an AI governance framework, such as the one developed by Züger and Asghari <cit.>, and be monitored by an independent organization comprising interdisciplinary experts. In order to provide a comprehensive understanding of the topic, it is important to acknowledge the limitations of this paper. Firstly, our analysis is based on Lever's formulation of democratic principles <cit.>; future work should consider and test other desirable socio-political principles in relation to the use of online targeting by governments. Secondly, we focused exclusively on a single AI governance framework proposed by Züger and Asghari <cit.>; future research should explore alternative frameworks and assess their applicability to this context. Lastly, our investigation primarily centers on the practices of the UK government; conducting further studies to examine the use of online targeting in other democratic countries would be beneficial to better understand the generalizability of our findings and recommendations. While this paper sheds light on the issue of governmental use of online targeting, numerous questions still remain unanswered. For example, is it appropriate for governments to employ these technologies for national security purposes when transparency may not be feasible? Should they also utilize it to counter misinformation and disinformation within online communities? Our objective in writing this paper is to contribute to the ongoing discourse and provide preliminary insights into these complex questions. We would like to thank Ben Collier and James Stewart for their comments on an earlier draft of this paper. We are also thankful to the three anonymous reviewers for their helpful suggestions and feedback. ACM-Reference-Format
http://arxiv.org/abs/2306.03815v1	20230606160207	Visible quasihyperbolic geodesics	[ "Vasudevarao Allu", "Abhishek Pandey" ]	math.CV	[ "math.CV", "math.MG", "Primary 30F45, 30L10, 30L99, 30C65. Secondary 51F99, 53C22" ]	arrows shapes patterns equationsection plain thmTheorem[section] cor[equation]Corollary lem[equation]Lemma prop[equation]Proposition CorCorollary claimClaim conjConjecture definition defnDefinition[section] exampleExample[section] prob[equation]Problem remRemark[section] observationObservation innercustomthmTheorem minutes by 60 hours by 60 minutes- own .own alphabet tmp
http://arxiv.org/abs/2306.07528v2	20230613034622	Unified Off-Policy Learning to Rank: a Reinforcement Learning Perspective	[ "Zeyu Zhang", "Yi Su", "Hui Yuan", "Yiran Wu", "Rishab Balasubramanian", "Qingyun Wu", "Huazheng Wang", "Mengdi Wang" ]	cs.LG	[ "cs.LG", "cs.IR" ]	LAMOST J2043+3413 - a Fast Disk Precession SW Sextans Candidate in Period Gap Cheng Liu (刘成) June 12, 2023 ============================================================================= Off-policy Learning to Rank (LTR) aims to optimize a ranker from data collected by a deployed logging policy. However, existing off-policy learning to rank methods often make strong assumptions about how users generate the click data, i.e., the click model, and hence need to tailor their methods specifically under different click models. In this paper, we unified the ranking process under general stochastic click models as a Markov Decision Process (MDP), and the optimal ranking could be learned with offline reinforcement learning (RL) directly. Building upon this, we leverage offline RL techniques for off-policy LTR and propose the Click Model-Agnostic Unified Off-policy Learning to Rank (CUOLR) method, which could be easily applied to a wide range of click models. Through a dedicated formulation of the MDP, we show that offline RL algorithms can adapt to various click models without complex debiasing techniques and prior knowledge of the model. Results on various large-scale datasets demonstrate that CUOLR consistently outperforms the state-of-the-art off-policy learning to rank algorithms while maintaining consistency and robustness under different click models. § INTRODUCTION Learning to Rank (LTR) is a core problem in Information Retrieval (IR) with wide applications such as web search and recommender systems <cit.>. Traditional LTR methods require high-quality annotated relevance judgments for model training, which is expensive, time-consuming, and may not align with actual user preferences <cit.>. As a result, learning to rank with implicit user feedback, such as logged click data, has received a huge amount of attention in both academia and industry <cit.>. Despite its low cost, learning to rank directly from implicit user feedback could suffer from the intrinsic noise and bias in user interactions, e.g., position bias, where an item displayed at a higher position receives a higher click-through rate (CTR) than its relevance <cit.>. To mitigate the bias in the click data, off-policy learning to rank methods have been proposed under different bias assumptions such as position bias <cit.>, selection bias <cit.> and trust bias <cit.>. A major branch of off-policy learning to rank called counterfactual learning to rank achieves unbiasedness by re-weighting the samples using the inverse propensity scoring (IPS) method <cit.>. To estimate the propensity from logged click data, existing works require explicit assumptions about how users examine the rank list and generate the click data, i.e., click models <cit.>. For example, position-based model (PBM) <cit.> assumes the probability of examining a result only depends on the position; while cascade model (CASCADE) <cit.> assumes each click depends on the previous click, and dependent click model (DCM) <cit.> considers both. Different debiasing methods have been proposed to cator to specific click models, including PBM <cit.>, CASCADE; and DCM <cit.>. However, prior knowledge of the click model is usually unknown and the correct click model needs to be identified from user behavior data before applying an off-policy algorithm, which is challenging in complex real-world environments. Besides, many popular and powerful click models have not been studied in counterfactual learning to rank such as the click chain model (CCM) <cit.> and the user browsing model (UBM) <cit.>. It requires a significant amount of work to study debiasing methods for every popular click model. To overcome these issues, we propose to study a unified approach of off-policy learning to rank adaptable to general click models. Our key insight is that the user's examination and click behavior summarized by click models has a Markov structure; thus off-policy LTR under general click models can be formulated as a Markov Decision Process (MDP). Specifically, the learning to rank problem now can be viewed as an episodic RL problem <cit.>, where each time step corresponds to a ranking position, each action selects a document for the position, and the state captures the user's examination tendency. This formulation allows us to view off-policy LTR from the perspective of offline reinforcement learning <cit.>, where we can leverage off-the-shelf offline RL algorithms <cit.> to optimize the ranking list. Importantly, our formulation bridges the area of off-policy learning to rank and offline RL, allowing for the integration of ideas and solutions from offline RL to enhance the solution of the off-policy LTR problem. Inspired by the formulation, we propose the Click Model-Agnostic Unified Off-policy Learning to Rank (CUOLR) method. We first construct each logged query and ranking data as an episode of reinforcement learning following the MDP formulation. Our dedicated structure for state representation learning can efficiently capture the dependency information for examination and click generation, e.g. ranking position in PBM and previous documents in CM and DCM. The algorithm jointly learns state representation and optimizes the policy, where any off-the-shelf offline RL algorithm can be applied as a plug-in solver. Specifically, we adapt the popular CQL algorithm <cit.> as an instantiation, which applies the conservative (pessimism) principle to Q function estimate. We evaluate our algorithm on real-world learning to rank datasets <cit.> under various click models. Compared with off-policy LTR methods that are dedicated to specific click models, our click model-agnostic method consistently outperforms the best-performing baselines in all click models. The contributions of this paper are summarized as follows: * We formulate the off-policy LTR with biased feedback under general click model as a Markov Decision Process, and bridge the area of off-policy learning to rank and offline reinforcement learning. * We propose CUORL, a Click model-agnostic Unified Off-policy LTR method that could utilize any offline RL algorithm as a plug-in solver, and we instantiate it using CQL. * We conduct extensive empirical experiments to validate the effectiveness of our algorithm using real-world LTR datasets under different click models. § RELATED WORK Off-policy Learning to Rank. Off-policy Learning to Rank aims to optimize the ranking function from logged click data <cit.>. The majority of the works aim to mitigate the bias in logged click data, known as counterfactual learning to rank or unbiased learning to rank. The debiasing methods mainly follow inverse propensity scoring strategy <cit.>, while there are also recent works applying doubly robust estimator to reduce variance <cit.>. <cit.> proposed pessimistic off-policy optimization for learning to rank that also mitigates bias but not in an unbiased way. All these methods rely on prior knowledge of the click model <cit.>, while our algorithm is agnostic to general click models. Offline Reinforcement Learning. Offline RL algorithms <cit.> learn policy from large logged datasets where the distributional shift between the logging policy and the learned policy imposes a major challenge. In this setting, different algorithms are proposed, from value-based ones (e.g. <cit.>) to policy-based ones (e.g. <cit.>). Among the vast literature on offline reinforcement learning, the principle of pessimism/conservatism <cit.> is an important line and has inspired many algorithms from empirical and theoretical perspective <cit.>. While all the aforementioned methods can be plugged into our algorithm, we choose the classic CQL algorithm <cit.> with a conservative Q function on top of soft actor-critic algorithm <cit.>. Reinforcement Learning to Rank. Wei et al. <cit.> first model ranking problem as an MDP, where the state is the candidate document set at current rank and the action is the selected document. <cit.> have been studied under similar MDP formulation. However, <cit.> requires relevance labels as feedback and cannot mitigate bias in click data; <cit.> is an online learning algorithm that learns from user interactions instead of logged data. Compared to these studies, we characterize the MDP formulation from a different perspective, i.e., capture bias in the click model, and propose the offline RL algorithm with logged click feedback. § REINFORCEMENT LEARNING TO RANK: A UNIFIED FORMULATION As the majority of existing works in unbiased learning to rank focused on inferring documents' relevance from the click models, these methods are tied to specific click models adopted. In this section, we formulate learning to rank with general click feedback as a Markov decision process, offering a unified and comprehensive modeling of possibly complicated user behavior. This formulation unifies LTR problems associated with different click models, under which the underlying click model is translated into the environment setup of MDP such as state transitions and rewards. It opens up the possibility to employ a rich class of reinforcement learning algorithms for solving LTR, which we will give greater details in the next section. §.§ Preliminary Click model. A key challenge of off-policy LTR lies in learning the document's attractiveness/relevance from the implicit feedback that is biased by the user's examination behavior. To address this challenge, a range of click models have been proposed to accommodate user's various click behavior <cit.>. In this study, we focus on a general family of click models <cit.>, which is marked by two characteristics: (1) Most of the mainstream click models have a "two-step" flavor that breaks user's click behavior towards some document down into the user's examination and the document's relevance. For each document d, the user first decides whether to examine it in the ranking list, based on the specific behavior. Mathematically the user behavior is modeled as the examination probability, which generally depends on the ranking list ℛ and the position of the document k, denote as χ(ℛ, k). Once the document is examined, the user will choose whether to click it, based on the attractiveness α(d) [We simplify the notation and assume d captures (query, document) pair information on given query.]. (2) Any documents under the k-th position do not have an effect on χ(ℛ, k). For any rank list ℛ and position k, the attractiveness and examination probability are independent. P(C_k=1\|ℛ, k) = χ(ℛ, k)α(ℛ(k)) where C_k is the click indicator at rank k, and χ(ℛ, k) is the examination probability of position k in the rank list ℛ. For each document d, the attractiveness α(d) only depends on the document itself. And the attractiveness is mutually independent. We show that classic click models such as PBM, CASCADE, DCM, and CCM are instances of Definition <ref>, with details listed in Appendix <ref>. §.§ Learning to Rank as Markov Decision Process In Reinforcement Learning (RL), the interactions between the agent and the environment are often described as an finite-horizon discounted Markov Decision Process M=(S, A, T, r, γ, H). The goal of the RL problem is to find a policy π that maximizes the value function, i.e. the discounted cumulative reward 𝔼[∑_t=0^Hγ^t r(s_t, a_t)\|π, s_0 = s]. In what follows, we formulate each of the (S,A,T,r,γ, H) components in the ranking scenario. Our formulation essentially differs from the existing MDP formulation of ranking <cit.>, where the state at position k is defined as remaining documents that are yet to rank following the k-1 ranked ones on the top, instead <cit.> has a limited capturing of user's click behavior as a result of being ignorant of the ordering within the top k-1 documents. From here on, we use k ∈ [K] to denote the k-th position top down on a list of total length K. It serves as the counterpart of the time step t in (<ref>) for the ranking setting. State 𝒮 For each position k ∈ [K], state s_k should include and represent the current status of the ranking that the agent is faced with. Thus, we define the state at rank k as: s_k = [(d_1, d_2, …, d_k-1), k], which is a concatenation of the established sub-ranking list up to k, denoted by (d_1, d_2, …, d_k-1), and the position k. Here d_i refers to the document presented at rank i with s_0 is initialized as =[(),0]. Together with the action a_k as to select document d_k presenting at rank k, defining s_k as (<ref>) fully captures the user's click behavior C_k at this point. Recall (<ref>) that P(C_k=1\|ℛ, k) = χ(ℛ, k)α(ℛ(k)), where χ(ℛ, k) is determined by (d_1, d_2, …, d_k-1). To better capture the rich information in the observed state, we discuss how to attain the effective state embedding from the raw representation in Section <ref>. Action 𝒜 Action a_k is naturally defined as the document to present at rank k given state s_k. In our experiments, each action is represented by a feature vector associated with the query. It is worth mentioning that the available action set 𝒜_k at each k is related to state s_k as well as the specific query, unlike the common case where the action space is fixed. There are two main differences here compared with the fixed action space: (1). the available actions vary under different queries; and (2). once an action is chosen, it is removed from the candidate set _k. Transition 𝒯(s'\|s, a) Transition maps a state-action pair to the probability distribution over possible next states. Given our formulation of state and action, the next state s_k+1 is deterministic given s_k = [(d_1, d_2, ⋯, d_k-1), k] and a_k. Formally, 𝒯(s_k+1\|s_k,a_k) = 1 if and only if s_k+1 = [(d_1, d_2, ⋯, d_k-1, a_k), k+1]. Reward r(s,a) Aligned with the goal of LTR to maximize total clicks, we adopt the binary click as a reward at each position, i.e. r(s_k, a_k) = C_k. It is easily checked this is a well-defined reward from (<ref>) that the distribution of r is fully determined by s and a, i.e., 𝔼[r(s_k, a_k)] = χ(s_k)α(a_k). Putting the components together we have formally built up our MDP formulation of LTR, which we name as "MDP for Ranking" and denote by ℳℛ(𝒮, 𝒜, 𝒯, r, γ, H) with components defined as above. The rich RL literature has the convention to solve the optimal policy π^* that maximizes the cumulative reward, which in our proposed MDP translates to π^* = _π𝔼(∑_k=1^Kγ^k-1r(s_k, π(·\| s_k))), where the expectation is taken over the stochasticity in both environment ℳℛ and policy π. Before leveraging any RL algorithms for ranking, it is necessary to validate good policies of ℳℛ(𝒮, 𝒜, 𝒯, r, γ, K) yields good ranking lists. In the following subsection, we give a rigorous theorem for this validation. §.§ Optimizing Rank List by Optimizing Policy Constructing a rank list given policy π. With the definition of MDP, we can construct a rank list with any given policy sequentially. At each position k, the state is constructed based on previous document features (manually or by sequential models). Then a document (action) is chosen by the policy π and placed at position k, where the next state is determined accordingly. Repeat this process at each position until all the documents are set or the list reaches its end (K=10 for example). Given a policy π(·\| s) of ℳℛ(𝒮, 𝒜, 𝒯, r, γ), construct the induced rank list ℛ^π as ℛ^π(k) ← a_k ∼π( ·\| s_k). To investigate whether the optimal rank list can be captured by optimal policy π^, we start with defining the optimality of rank list. A rank list ℛ is optimal if and only if all documents are sorted in descending order in terms of their attractiveness, i.e. α(ℛ(1)) ≥…≥α(ℛ(K)) and {ℛ(1), ⋯, ℛ(K)} are the K most attractive documents among all, where K is the length of the list and it is also called the top-K ranking. [Optimality of optimal ranking] Let V_ℛ(s_1)=𝔼[∑_k=1^Kγ^k-1r(s_k, ℛ(k))] be the value of rank list ℛ, and let ℛ^⋆ be the optimal rank list by Definition <ref>. Then max_ℛ V_ℛ(s_1) = V_ℛ^⋆(s_1). Assumption <ref> is adopted from Assumption 2 in <cit.>, which suggests optimal rank list sorted by decreasing attractiveness of documents leads to optimal rewards, which will be covered by optimal policy learned from our MDP formulation. This is a mild assumption as classic click models such as PBM and cascade model all satisfy the assumption <cit.>. § UNIFIED OFF-POLICY LEARNING TO RANK The formulation of off-policy learning-to-rank (LTR), when viewed from the perspective of offline reinforcement learning, presents an opportunity to leverage off-the-shelf RL algorithms to address off-policy LTR problems. In this section, we introduce a novel and unified off-policy LTR algorithm that is agnostic to the underlying click model used to generate the offline training data. Our algorithm is composed of three key components: (1) episodes constructed from the logged ranking data; (2). state representation learning; and (3). policy optimization via offline RL algorithms. In the following, we provide a detailed exposition of each component. Episodes Construction. Given any logged ranking dataset, the first step is to construct a series of episodes from the ranking data, making it compatible with the off-the-shelf RL algorithms. Specifically, our original ranking data {(_i, _i, _i_i, _i)}_i=1^n is composed of n tuples with contextual query feature q_i, a ranked list _i with K documents and a corresponding click vector _i_i, _i∈{0,1}^K. From the perspective of RL, this tuple can be conceptualized as one episode, following the established MDP formulation of the ranking process. In particular, for each tuple (_i, _i, _i_i, _i), we transform it to a length K episode τ_i := {(s^i_k, a^i_k, r^i_k)}_k=1^K with s^i_k := ϕ(_i[: k], k), a^i_k:= _i[k], r^i_k:= _i_i, _i[k] for ∀ k ∈ [K] Here we use _i[: k] to denote the concatenation of the document feature vectors before position k and _i[k] represents the document feature at position k, similarly for _i_i, _i[k]. In particular, the episode τ_i is constructed by going through the ranked list from top to the bottom. Each state s^i_k contains all the document information before position k and the position information k, represented as a function of _i[: k] and k with ϕ being a learned embedding function that we will discuss shortly. The action at step k is the document placed at position k, i.e., _i[k], with the reward at current timestep is the binary click for the corrpsonding action at position k, i.e., _i_i, _i[k]. Given this, we have constructed an offline RL dataset with n episodes with length K each. State Representation Learning. In RL, state representation learning offers an efficient means of managing large, raw observation spaces, enhancing the generalization performance when encountering previously unseen states. In our particular setting, the observation space consists of raw document features up to position k. As we will show in Section <ref>, utilizing raw observations as the state representation in the RL algorithm can lead to highly sub-optimal performance, due to both unscalability with respect to k and limitations in the representation power. Rather than incorporating additional auxiliary tasks to explicitly learn state representations, we propose to jointly learn the state representations together with the policy optimization algorithm, which aims to automatically learn state representation ϕ that will benefit the downstream policy optimization task. For example, DQN uses multiple layers of nonlinear functions to encode the map perceptual inputs to a state embedding that could be linearly transformed into the value function. To this end, we introduce the implicit state representation learning component our off-policy learning to rank algorithm, which is composed of the following key components: Positional Encoding: To effectively inject the position information in s^i_k, we utilize the positional encoding technique <cit.>, ensuring the model make use of the position information when generating clicks. Specifically, positional encoding represents each position k in the ranked list by the sinusoidal function with different frequencies such that P E(k)_2 i=sin(k/10000^2 i / d_model), P E(k)_2 i +1 =cos(k/10000^2 i / d_model), Here PE(k) ∈ℝ^d with d being the dimension of document feature and 2i and 2i+1 being the even and the odd entries of PE(k) with 2i, 2i+1 ∈ [d]. Multi-head Self-attention: The other challenge in our case is to find a specific architecture for the state representation learning that tailored for the learning to rank task. As the ranked list of document features is inherently sequential, we leverage the multi-head self-attention mechanism to learn the state embedding ϕ. Specifically, the state s^i_k is defined as: s^i_k := ϕ(_i[: k], k) = Concat(head_1, …, head_I)W^O where head_i = Attention(s_k· W_i^Q, s_k· W_i^K, s_k· W_i^V), with W_i^Q, W_i^K, W_i^V∈ψ_i are learnable parameters for the i^th head and W^O is the learnable parameter of the output layer after concatenating the results of all the I heads; At each position k, we concatenate the document features _i[: k] along with the position embedding for position k, passing them as the input for the multi-head self-attention. Joint Representation Learning and Policy Optimization. Given the constructed offline dataset and a dedicated structure for learning efficient state representations, we now demonstrate how we leverage any off-the-shelf RL algorithm as the plug-in solver for finding the optimal policy. We use the popular offline RL algorithm: CQL, as an instantiation, which learns a conservative Q function and utilizes the classical soft actor-critic algorithm on top of it. Specifically, it optimizes the following lower bound of the critic (Equation <ref>): θ̂← _θα𝔼_s ∼𝒟[log∑_aexp (Q_θ(s, a))-𝔼_a ∼π_β(a \| s)[Q_θ(s, a)]] +1/2𝔼_s, a, s^'∼𝒟[(Q_θ-ℬ̂^πQ̂_θ')^2] where ℬ̂^πQ = r + γ P^π Q is the estimated Bellman operator, π_β is the logging policy. Here we use θ' to emphasize that the parameters in the target Q network is different from policy Q network. The conservative minimizes the expected Q value for out-of-distribution (state, action) pairs and prevents the Q-function's over-estimation issue. Built upon SAC, the algorithm improves the policy π_ξ (i.e., the actor) based on the gradient of the estimated Q function, with entropy regularization. Compared with the original CQL algorithm, we also add the state representation learning component, and we jointly optimize the state embedding, the critic and actor parameters, with a detailed algorithm included in Algorithm <ref>. Once we have obtained the learned optimal policy π_ξ^, we extract the optimal ranking policy following Definition <ref>. § EXPERIMENTS We empirically evaluate the performance of our proposed method CUOLR on several public datasets, compared with the state-of-the-art off-policy learning-to-rank methods. Specifically, we aim to assess the robustness of our method across different click models and showcase the effectiveness of our unified framework. Beyond this, we perform the ablation study to examine the efficacy of our proposed state representation learning component. [The code can be found in <https://github.com/ZeyuZhang1901/myLTR>]. §.§ Setup Datasets. We conduct semi-synthetic experiments on two traditional learning-to-rank benchmark datasets: MSLR-WEB10K and Yahoo! LETOR (set 1). Specifically, we sample click data from these real-world datasets, which not only increases the external validity of the experiments but also provides the flexibility to explore the robustness of our method over different click models. For both datasets, it consists of features representing query and document pairs with manually judged relevance labels ranging from 0 (irrelevant) to 4 (perfectly relevant). We provide the statistics of all datasets in Appendix <ref>. Both datasets come with the train-val-test split. The train data is used for generating logging policy and simulating clicks, with the validation data used for hyperparameter selection. And the final performance of the learned ranking policy is evaluated in the test data. Click Data Generation. We follow <cit.> to generate partial-information click data from the full-information relevance labels. Specifically, we first train a Ranking SVM <cit.> using 1% of the training data as our logging policy π_β to present the initial ranked list of items. For each query q_i, we get a ranking _i and simulate the clicks based on various click models we use. As discussed in Section <ref>, there are two components for the click generation, examination probability and attractiveness of the document for the query. All click models differ in their assumptions on the examination probability. For PBM, we adopt the examination probability ρ = {ρ_k}_k=1^K estimated by Joachims et al. <cit.> through eye-tracking experiments: χ(ℛ^q, k) = χ(k) = ρ_k^η where η∈ [0, +∞] is a hyper-parameter that controls the severity of presentation biases and in our experiment, we set η = 1.0 as default. For CASCADE, the examination probabilities are only dependent on the attractions of each previous document. For DCM, the λs are also simulated by the same parameters as PBM examination probability. We use the same attraction models for all click models, as defined following: α(d) = ϵ + (1-ϵ)2^r(d)-1/2^r_max - 1 where r(d)∈ [0,4] is the relevance label for document d and r_max=4 is the maximum relevance label. We also use ϵ to model click noise so that irrelevant documents have a non-zero probability to be treated as attractive and being clicked. Baselines and Hyperparameters. We compare our CUOLR method with the following baselines: (1). Dual Learning Algorithm (DLA) <cit.> which jointly learns an unbiased ranker and an unbiased propensity model; (2). Inverse Propensity Weighting (IPW) Algorithm <cit.> which first learns the propensities by result randomization, and then utilizes the learned probabilities to correct for position bias; and (3). Cascade Model-based IPW (CM-IPW) <cit.> which designs a propensity estimation procedure where previous clicks are incorporated in the estimation of the propensity. It is worth mentioning that (1) and (2) are designed for PBM and (3) is tailored for cascade-based models. Besides, we train a LambdaMart <cit.> model with true relevance labels as the upper bound for the ranking model, ORACLE for short. The performance of the logging policy (LOGGING) is also reported as the lower bound of the ranking model. For baselines, we use a 2-layer MLP with width 256 and ReLU activation according to their original paper and codebase <cit.>. For the embedding model in our method, we use multi-head attention with 8 heads. And for actors and critics in CQL and SAC algorithms, we utilize a 2-layer MLP with width 256 and ReLU activation. The conservative parameter α (marked red in Equation (<ref>)) in CQL is set to 0.1. We use Adam for all methods with a tuned learning rate using the validation set. More details are provided in Appendix <ref>. Metrics. We evaluate all the methods using the full-information test set. We use the normalized Discounted Cumulative Gain (nDCG) <cit.> and the Expected Reciprocal Rank (ERR) <cit.> as evaluation metrics and report the results at position 5 and 10 to demonstrate the performance of models at different positions. §.§ Results How does CUOLR perform across different click models, compared to the baselines? To validate the effectiveness of our CUOLR method, we conducted performance evaluations across a range of click-based models, including PBM, CASCADE, DCM, and CCM. We compared our approach with state-of-the-art baselines specifically designed for these click models, namely DLA, IPW, and CM-IPW. Due to space limitation, we only show results of PBM, CASCADE, and DCM in Table <ref>, with the full table shown in Appendix <ref>. For the position-based model, IPW demonstrates the best performance among the baselines, which is expected as it is tailored for position-based methods. Similarly, CM-IPW yielded the best performance for the cascade-based methods, which aligns with its incorporation of previous document information in the propensity estimation. Remarkably, across all click models, our method, whether combined with SAC or CQL, consistently achieves the best performance in most cases. This validates the effectiveness of our unified framework and the robustness of our CUOLR algorithm. Furthermore, it is noteworthy that our method demonstrated consistent performance across different RL algorithms, verifying its resilience and adaptability to various underlying RL solvers. How effective is the state representation learning component in CUOLR? In this experiment, we examine different approaches for state representation learning and study how it affects the overall performance of our proposed method. We compare with the following state embeddings: (1). position-only embedding (POS), which only utilizes the position information using positional encoding; (2). previous-document-based embedding (PREDOC), which takes a simple average of all the document features in [:,k]; (3). the concatenation of the position and the average document features up to position k (POS + PREDOC), as well as the proposed learnable state representations based on multi-head self-attention (ATTENTION). ORACLE here is used to show the gap from the upper bound. The results of our experiments are presented in Table <ref> (with a full table including other click models is shown in Appendix <ref>). For the PBM click model, it is evident that state embeddings utilizing position-based information, such as POS and POS+PREDOC, outperform other state embeddings. In contrast, for the CASCADE click model, state embeddings utilizing previous document features exhibit significantly stronger performance compared to those utilizing position information. Notably, our method, CUOLR, which dynamically learns the state embeddings during policy optimization, consistently achieves comparable performance compared to using hard-coded fixed state embeddings. This highlights the necessity of leveraging state representation in off-policy LTR and underscores the effectiveness of our proposed approach. § CONCLUSION In this paper, we present an off-policy learning-to-rank formulation from the perspective of reinforcement learning. Our findings demonstrate that under this novel MDP formulation, RL algorithms can effectively address position bias and learn the optimal ranker for various click models, without the need for complex debiasing methods employed in unbiased learning to rank literature. This work establishes a direct connection between reinforcement learning and unbiased learning to rank through a concise MDP model. Specifically, we propose a novel off-policy learning-to-rank algorithm, CUOLR, which simultaneously learns efficient state representations and the optimal policy. Through empirical evaluation, we show that CUOLR achieves robust performance across a wide range of click models, consistently surpassing existing off-policy learning-to-rank methods tailored to those specific models. These compelling observations indicate that the extensive research conducted on offline reinforcement learning can be leveraged for learning to rank with biased user feedback, opening up a promising new area for exploration. plainnat § EXPERIMENT DETAILS §.§ Dataset Statistics We conducted experiments on MSLR-WEB10K [<https://www.microsoft.com/en-us/research/project/mslr/>] and Yahoo! LETOR (set 1) [<https://webscope.sandbox.yahoo.com/>] with semi-synthetic generated click data. Yahoo! LETOR comes from the Learn to Rank Challenge. It consists of 29,921 queries and 710K documents. Each query-document pair is represented by a 700-dimensional feature and annotated with a 5-level relevance label ranging from 0 to 4. MSLR-WEB10K dataset contains 10,000 queries and 125 retrieved documents on average. Each query-document pair is represented by a 136-dimensional feature vector and a 5-level relevance label. The dataset is partitioned into five parts with about the same number of queries, denoted as S1, S2, S3, S4, and S5, for five-fold cross-validation. All statistics of the used datasets are summarized in Table <ref>. §.§ Implementation Details Before introducing the hyperparameters required for each algorithm, we first describe some global hyperparameters that are used commonly across all algorithms. We use batch size B=256 queries per epoch, and use nDCG@10 as the training objective for all baselines. We use Adam optimizer to train all the networks. Dual Learning Algorithm (DLA) <cit.>. For DLA, two sub-models are being implemented: the ranking (scoring) model which is used to score each document; and the propensity model which is used to estimate the propensity for each document in the rank list. We use the MLP with two hidden layers of 256 units for both of them, and other hyperparameters are shown in Table <ref>. Inverse Propensity Weighting (IPW) <cit.> & Cascade Model-based IPW (CM-IPW) <cit.>. For IPW and CM-IPW, we need to get the propensities from Result Randomization. In total, there are 10M random rank lists with different searching queries shown to the user (click model), and the parameters of each click model are estimated by Maximize Likelihood Estimation (MLE). Estimation details are shown in Table <ref>, where C_k and C_<k indicate the click at rank k and before rank k respectively. The superscript ·^(s) denotes the click of some click session s. Besides, we implement the ranking model the same way as that for DLA. Other hyperparameters are shown in Table <ref>. ORACLE. For ORACLE, we train a LambdaMART ranker <cit.> with true labels on the training dataset and evaluate its performance on the test set. We leverage the RankLib[<https://sourceforge.net/p/lemur/wiki/RankLib/>] learning to rank library, and set the hyperparameters shown in Table <ref>. This utilizes the full-information data and serves as an upper bound of the performance for all algorithms utilizing the partial-information data, such as the generated clicks. CUOLR. For our algorithm CUOLR, there are three sets of hyperparameters used by the following sub-models: parameters for state embedding model, RL policy, as well as RL critic, where we use a 256-256 MLP to implement all the networks. Detailed hyperparameters are shown in Table <ref>. § ADDITIONAL RESULTS In this section, we present the complete results for all five click models (PBM, CASCADE, UBM, DCM, and CCM) on the two datasets: Yahoo! LETOR set 1 and MSLR-WEB10K. For the first two studies in Section <ref> and <ref>, we run 5 runs with different random seeds for the Yahoo! dataset. For the MSLR-WEB10K dataset which naturally comes with 5 folds, we take 1 run for each fold and aggregate the results. In the ablation experiment of conservatism for the offline RL algorithm in Section <ref>, we only run 3 runs on Yahoo! due to the time limit. In all of our experiments, we use nDCG and ERR at positions 3,5,10 as evaluation metrics. §.§ Performance across Different Click Models In this section, we present a comprehensive comparison between our proposed method, CUOLR, and various baseline approaches. Specifically, we examine the efficacy of DLA and IPW, which have been specifically designed for position-based models, as well as CM-IPS, which has been tailored for cascade-based models. The comparative results are presented in Table <ref>. In the case of position-based models such as PBM and UBM, it is evident that IPW demonstrates the most superior performance among all the considered baselines. Conversely, when evaluating cascade models such as cascade and DCM, the utilization of CM-IPW yields improved performance, as it takes into account the propensity estimation considering prior examinations and clicks. Among the diverse click models examined, our unified algorithm, CUOLR, consistently achieves the highest level of performance in terms of the ERR metrics across different positions. Furthermore, it consistently outperforms the other models in the majority of cases in terms of nDCG@10. This provides empirical verification of the effectiveness of our unified framework and the robustness of the CUOLR algorithm. §.§ State Representation Ablation Experiments In this section, we present an ablation study focusing on the state embedding utilized in our algorithm, CUOLR. We compare the effectiveness of our proposed multi-head self-attention, augmented with positional embedding, against several heuristic hard-coded baselines for state embedding. These baselines include utilizing only positional information (POS), concatenating previous document information (PREDOC), and a combination of positional and document information (POS+PREDOC). The evaluation is performed on the Yahoo dataset, and the results are summarized in Table <ref>. Consistent with expectations, for position-based models (PBM), the most effective approach is utilizing only the positional information. Conversely, for cascade models (CASCADE), only considering the previous document information gives the best performance. In the case of more complicated models, such as DCM, CCM, and UBM, where the click model relies on both position and previous examinations, it becomes evident that incorporating a combination of positional information and previous document information yields the highest performance. Among all of them, it is worth to point out that our proposed state representation learning consistently attains comparable performance to the best baseline. Notably, our method possesses the advantage of automatically learning the optimal state representation, irrespective of the underlying assumptions of the click models. §.§ Conservatism for Offline RL Ablation Experiments In this section, we conduct an ablation study to investigate the influence of the hyperparameter α, which governs the conservatism, in the CQL algorithm. Specifically, we examine its effects on the Yahoo! dataset by varying α across a range of values: {0, 1e-3, 5e-3, 1e-2, 5e-2, 1e-1, 5e-1, 1e0, 5e0, 1e1, 5e1}. It is noteworthy that when α is set to 0, the CQL algorithm simplifies to the SAC algorithm <cit.>. Remarkably, we find that the performance of CUOLR remains consistently robust across the diverse α values, as long as they are not being restricted to be too close to the logging policy (i.e., large α values). This consistency underscores the effectiveness of our method, which demonstrates its ability to adapt to different underlying reinforcement learning (RL) algorithms. Interestingly, in contrast to classical offline RL datasets studied in <cit.>, where the conservatism parameter plays a substantial role, we observe that its impact is comparatively minor in the offline learning to rank dataset. This observation is worth further investigation for better understanding the impact of conservatism in offline LTR setting. § CLICK MODEL AND MDP FORMULATION In this section, we present a comprehensive overview of different click models employed in the paper, namely PBM, CASCADE, DCM, CCM, and UBM. Additionally, we demonstrate the graphical models associated with each click model and how they could be unified into the Markov Decision Process (MDP) framework, as depicted in Figure <ref>. PBM <cit.>. The position-based model is a model where the probability of clicking on an item depends on both its identity and rank. The examination probability is rank-dependent only, i.e., χ(ℛ, k) = χ(k). CASCADE <cit.>. The cascade model assumes that the user scans a rank list ℛ from top to bottom. If a document at rank k is examined and clicked, the user stops browsing the remaining documents. Otherwise, the user goes on to the next rank k+1 with probability one. The first document d_1 is always examined. The document at rank k will be examined if and only if the previous k-1 documents are not clicked. Therefore we have: χ(ℛ, k) = Π_i=1^k-1(1 - α(ℛ(i))). DCM <cit.>. The dependent click model assumes that the user examines the results from top to bottom until an attractive result is found, P(E_k+1=1\| E_k=1, C_k=0) = 1, where E_k is the examination indicator at rank k. After each click, there is a rank-dependent chance that the user is unsatisfied, P(E_k+1=1\| C_k=1) = λ_k. Therefore, we have: χ(ℛ, k) = Π_i=1^k-1(1 - α(ℛ(i))·(1-λ_i)). CCM <cit.>. The click chain model (CCM) is a generalization of the dependent click model where continuing to examine the results before a click is not deterministic, i.e. P(E_j+1 = 1\| E_j = 1, C_j = 0) = α_1. The probability of continuing after a click is not position dependent, but relevance dependent, P(E_j+1\| C_j = 1) = α_2 (1-R_i) + α_3 R_i, where R_i is the relevance of the i^th document in the rank list. Therefore, the examination probability at each position can be written as: χ(ℛ, k) = Π_i=1^k-1 (1-α(ℛ(i))·(1 - α_2 (1-ℛ(i)) - α_3ℛ(i)) UBM <cit.>. The user browsing model (UBM) is an extension of the PBM model with some elements of the cascade model. The whole model is position-based, but for the examination probability, it considers previous clicks. Specifically, the examination probability depends not only on the rank of the document k, but also on the rank of the previously clicked document k', which is modeled by a set of parameters γ_kk', i.e. P(E_k=1\| C_1 = c_1, …, C_k-1 = c_k-1) = γ_kk', where k' is the rank of the previous clicked document or 0 if none of them was clicked, i.e. k' = max{r∈{0, …, k-1}}: c_r=1 χ(ℛ, k) = γ_kk' <cit.> showed that PBM and CM satisfied Assumption <ref> where optimal ranking list leads to optimal total clicks. In our future work, it would be interesting to show that other click models also satisfy this assumption.
http://arxiv.org/abs/2306.10390v1	20230617165248	Determinantal expressions of certain integrals on symmetric spaces	[ "Salem Said", "Cyrus Mostajeran" ]	math.DG	[ "math.DG" ]	Salem Said and Cyrus Mostajeran CNRS, Laboratoire Jean Kuntzmann (UMR 5224) School of Physical and Mathematical Sciences, NTU Singapore Determinantal expressions of certain integrals on symmetric spaces Salem Said1 Cyrus Mostajeran2 Accepted 16 June 2023 ==================================================================== The integral of a function f defined on a symmetric space M ≃ G/K may be expressed in the form of a determinant (or Pfaffian),when f is K-invariant and, in a certain sense, a tensor power of a positive function of a single variable. The paper presents a few examples of this idea and discusses future extensions. Specifically, the examples involve symmetric cones, Grassmann manifolds, and classical domains. § INTRODUCTION Riemannian symmetric spaces were classified by É. Cartan, back in the 1920s. A comprehensive account of this classification may be found in the monograph <cit.>. In the 1960s, a classification of quantum symmetries led Dyson to introduce three kinds of random matrix ensembles, orthogonal, unitary, and symplectic <cit.>. These three kinds of ensembles are closely related to the symmetric spaces known as symmetric cones, and also to their compact duals, which provide for so-called circular ensembles. More recently, Dyson's classification of quantum symmetries has been extended to free fermionic systems. It turned out that this extended classification is in on-to-one correspondance with Cartan's old classification of symmetric spaces <cit.>. This correspondance has motivated the notion that the relationship between random matrices and symmetric spaces extends well beyond symmetric cones, and is of a general nature (for example <cit.> or <cit.>). The present submission has a modest objective. It is to show how the integral of a function f, defined on a symmetric space M ≃ G/K, can be expressed in the form of a determinant or Pfaffan, when f is K-invariant and satisfies an additional hypothesis, formulated in Section <ref> below. This is not carried out in a general setting, but through a non-exhaustive set of examples, including symmetric cones, Grassmann manifolds, classical domains, and their duals (for the case of compact Lie groups, yet another example of symmetric spaces, see <cit.>). The determinantal expressions obtained here, although elementary, are an analytic pre-requisite to developing the random matrix theory of Riemannian symmetric spaces. This long-term goal is the motivation behind the present work. Unfortunately, due to limited space, no proofs are provided for statements made in the following. These will be given in an upcoming extended version. § INTEGRAL FORMULAS Let M be a Riemannian symmetric space, given by the symmetric pair (G,K). Write 𝔤 = 𝔨 + 𝔭 the corresponding Cartan decomposition, and let 𝔞 be a maximal abelian subspace of 𝔭. Then, denote by Δ a set of positive reduced roots on 𝔞 <cit.>. Assume that 𝔤 = 𝔷(𝔤) + 𝔤_ ss where 𝔷(𝔤) is the centre of 𝔤 and 𝔤_ ss is semisimple and non-compact (𝔤_ ss is a real Lie algebra). The Riemannian exponential Exp maps 𝔞 isometrically onto a totally flat submanifold of M, and any x ∈ M is of the form x = k·Exp(a) where k ∈ K and a ∈𝔞. Let f:M →ℝ be a K-invariant function, f(k· x) = f(x) for k∈ K and x ∈ M. There is no ambiguity in writing f(x) = f(a) where x = k·Exp(a). With this notation, there exists a constant C_ M such that <cit.> ∫_M f(x)vol(dx) = C_ M∫_𝔞f(a)∏_λ∈Δsinh^m_λ\|λ(a)\|da where da is the Lebesgue measure on 𝔞. The dual M̂ of M is a symmetric space given by the symmetric pair (U,K), where U is a compact Lie group, with the Cartan decomposition 𝔲 = 𝔨 + i𝔭(i = √(-1)). Now, Exp maps i𝔞 onto a torus T which is totally flat in M̂, and any point x ∈M̂ is of the form x = k·Exp(ia) where k ∈ K and a ∈𝔞. If f:M̂→ℝ is K-invariant, there is no ambiguity in writing f(x) = f(t) where x = k· t, t = Exp(ia). In this notation <cit.>, ∫_M̂ f(x)vol(dx) = C_ M∫_Tf(t)∏_λ∈Δsin^m_λ\|λ(t)\|dt where dt is the Haar measure on T. Here, sin\|λ(t)\| = sin\|λ(a)\| where t = Exp(ia), and this does not depend on the choice of a. § DETERMINANTAL EXPRESSIONS Let μ be a positive measure on a real interval I. Consider the multiple integrals, z_β(μ) = 1/N!∫_I…∫_I \|V(u_ _1,…,u_ N)\|^β μ(du_ 1)…μ(du_ N) where V denotes the Vandermonde determinant and β = 1,2 or 4. Consider also the following bilinear forms, (h,g)_(μ,1) = ∫_I∫_I (h(u)ε(u-v)g(v)) μ(du)μ(dv) (h,g)_(μ,2) = ∫_I h(u)g(u) μ(du) (h,g)_(μ,4) = ∫_I (h(u)g^'(u) - g(u)h^'(u)) μ(du) Here, ε denotes the unit step function and the prime denotes the derivative. In the following proposition, denotes the determinant and pf the Pfaffian. The following hold for any probability measure μ as above. (a) if N is even, z_ 1(μ) = pf{(u^k,u^ℓ)_(μ,1)}^N-1_k,ℓ=0 (b) on the other hand, if N is odd, z_ 1(μ) = pf{[ (u^k,u^ℓ)_(μ,1) (1,u^k)_(μ,2); -(u^ℓ,1)_(μ,2) 0 ]}^N-1_k,ℓ=0 (c) moreover, z_ 2(μ) = {(u^k,u^ℓ)_(μ,2)}^N-1_k,ℓ=0 (d) and, finally, z_ 4(μ) = pf{(u^k,u^ℓ)_(μ,4)}^2N-1_k,ℓ=0 On the other hand, if μ is a probability measure on the unit circle S^1, and z_β(μ) = 1/N!∫_S^1…∫_S^1 \|V(u_ _1,…,u_ N)\|^β μ(du_ 1)…μ(du_ N) consider the bilinear form ( h,g)_(μ,1) = ∫^2π_0∫^2π_0 (h(e^ix)ε(x-y)g(e^iy)) μ̃(dx)μ̃(dy) where μ̃ is the pullback of the measure μ through the map that takes x to e^ix, and let (h,g)_(μ,2) and (h,g)_(μ,4) be given as in (<ref>) and (<ref>), with integrals over S^1 instead of I. The following hold for any probability measure μ on S^1. (a) if N is even, z_ 1(μ) = (-i)^N(N-1)/2 × pf{(g_k,g_ℓ)_(μ,1)}^N-1_k,ℓ=0 where g_k(u) = u^k-(N-1)/2. (b) on the other hand, if N is odd, z_ 1(μ) = (-i)^N(N-1)/2 × pf{[ (g_k,g_ℓ)_(μ,1) (1,g_k)_(μ,2); -(g_ℓ,1)_(μ,2) 0 ]}^N-1_k,ℓ=0 with the same definition of g_k(u). (c) moreover, z_ 2(μ) = {(u^k,u^-ℓ)_(μ,2)}^N-1_k,ℓ=0 (d) and, finally, z_ 4(μ) = pf{(h_k,h_ℓ)_(μ,4)}^2N-1_k,ℓ=0 where h_k(u) = u^k-(N-1). Both of the above Propositions <ref> and <ref> are directly based on <cit.>. § MAIN IDEA An additional hypothesis is made on the function f(a) (in (<ref>)) or f(t) (in (<ref>)) : that there exists a natural orthonormal basis (e_j;j=1,…,r) of 𝔞, such that f(a) = ∏^r_j=1w(a_j) f(t) = ∏^r_j=1 w(t_j) where w is a positive function of a single variable, and a_j are the components of a in the basis (e_j;j=1,…,r), while t_j = Exp(ia_je_j). In this sense, it may be said that f is the r-th tensor power of w. What is meant by natural is that (<ref>) will imply that the integral (<ref>) or (<ref>) can be transformed into a multiple integral of the form (<ref>) or (<ref>), respectively. Thus, in the case of (<ref>), there exists a measure μ on an interval I, which satisfies ∫_M f(x)vol(dx) = C̃_ M× z_β(μ) (C̃_ M is a new constant) and, in the case of (<ref>), there is a measure μ on S^1, which yields a similar identity. It should be noted that this measure μ will depend on the function w from (<ref>). Then, Propositions <ref> and <ref> provide a determinantal (or Pfaffian) expression of the initial integral on the symmetric space M or M̂. At present, this is not a theorem, but a mere idea or observation, supported by the examples in the following section. § EXAMPLES §.§ Symmetric cones Consider the following Lie groups (in the usual notation, as found in <cit.>). [ β G_β U_β K_β; 1 GL_N(ℝ) U(N) O(N); 2 GL_N(ℂ) U(N) × U(N) U(N); 4 GL_N(ℍ) U(2N) Sp(N) ] Then, M_β≃ G_β/K_β is a Riemannian symmetric space, with dual M̂_β = U_β/K_β. In fact, M_β is realised as a so-called symmetric cone : the cone of positive-definite real, complex, or quaternion matrices (according to the value of β=1,2 or 4). Each x ∈ M_β is of the form kλ k^† where k ∈ K_β and λ is a positive diagonal matrix († denotes the transpose, conjugate-transpose, or quaternion conjugate-transpose). If f:M_β→ℝ is K_β-invariant, and can be written f(x) = ∏ w(λ_j), ∫_M_β f(x)vol(dx) = C̃_β× z_β(μ) where μ(du) = (w(u)u^- N_β)du, with N_β = (β/2)(N-1)+1, on the interval I = (0,∞). The constant C̃_β is known explicitly, but this is irrelevant at present. The dual M̂_β can be realised as the space of symmetric unitary matrices (β = 1), of unitary matrices (β = 2), or of antisymmetric unitary matrices with double dimension 2N, (β = 4). If β = 1,2, then x ∈M̂_β is of the form ke^iθ k^† where k ∈ K_β and θ is real diagonal. However, if β = 4, there is a somewhat different matrix factorisation, x = k ([ -e^iθ; e^iθ ]) k^tr(tr denotes the transpose) where k ∈ Sp(N) is considered as a 2N× 2N complex matrix (rather than a N× N quaternion matrix). If f:M̂_β→ℝ is K_β-invariant, f(x) = ∏ w(e^iθ_j), ∫_M̂_β f(x)vol(dx) = C̃_β× z_β(μ) where μ(du) = w(u)\|du\| on the unit circle S^1 (\|du\| = dφ if u = e^iφ). Remark : in many textbooks, M̂_ 1 is realised as the space of real structures on ℂ^N, and M̂_ 4 as the space of quaternion structures on C^2N. The alternative realisations proposed here seem less well-known, but more concrete, so to speak. §.§ Grassmann manifolds Consider the following Lie groups (again, for the notation, see <cit.>). [ β G_β U_β K_β; 1 O(p,q) O(p+q) O(p)× O(q); 2 U(p,q) U(p+q) U(p)× U(q); 4 Sp(p,q) Sp(p+q) Sp(p) × Sp(q) ] Then, M_β≃ G_β/K_β is a Riemannian symmetric space, with dual M̂_β = U_β/K_β. The M_β may be realised as follows <cit.> (𝕂 = ℝ,ℂ or ℍ, according to β), M_β = { x : x is a p-dimensional and space-like subspace of 𝕂^p+q} Here, x is space-like if \|ξ_p\|^2-\|ξ_q\|^2 > 0 for all ξ∈ x with ξ = (ξ_p,ξ_q), where \|·\| denotes the standard Euclidean norm on 𝕂^p or 𝕂^q. Moreover, for each x ∈ M_β, x = k(x_τ) where k ∈ K_β and x_τ∈ M_β is spanned by the vectors cosh(τ_j)ξ_j + sinh(τ_j)ξ_p+j j = 1,…, p with (ξ_k;k=1,…,p+q) the canonical basis of 𝕂^p+q, and (τ_j;j=1,…, p) real (p ≤ q throughout this paragraph). If f:M_β→ℝ is K_β-invariant, f(x) =f(τ), the right-hand side of (<ref>) reads (the positive reduced roots can be found in <cit.>) C_β∫_ℝ^pf(τ)∏^p_j=1sinh^β(q-p)\|τ_j\|sinh^β-1\|2τ_j\|∏_i<j\|cosh(2τ_i) - cosh(2τ_j)\|^β dτ and this can be transformed into the form (<ref>), by introducing u_j = cosh(2τ_j). This will reappear, with β = 2 and p = q, in the following paragraph. Now, the duals M̂_β are real, complex, or quaternion Grassmann manifolds, M̂_β = { x : x is a p-dimensional subspace of 𝕂^p+q} For each x ∈M̂_β, x = k(x_θ) where k ∈ K_β and x_θ is spanned by the vectors cos(θ_j)ξ_j + sin(θ_j)ξ_p+j j = 1,…, p with (θ_j;j=1,…, p) real. If f:M̂_β→ℝ is K_β-inariant, f(x) =f(θ), the right-hand side of (<ref>) reads C_β∫_(0,π)^pf(θ)∏^p_j=1sin^β(q-p)\|θ_j\|sin^β-1\|2θ_j\|∏_i<j\|cos(2θ_i) - cos(2θ_j)\|^β dθ which can be transformed into the form (<ref>), by introducing u_j = cos(2θ_j). In <cit.>, this is used to recover the Jacobi ensembles of random matrix theory. Remark : the angles θ_j may be taken in the interval (-π/2,π/2) instead of (0,π). In this case, \|θ_j\| are the principal angles between x_θ and the subspace x_o spanned by (ξ_j;j=1,…,p). By analogy, it is natural to think of \|τ_j\| as the `principal boosts' (using the language of special relativity) between x_τ and x_o. §.§ Classical domains Consider, finally, the following Lie groups (again, for the notation, see <cit.>). [ β G_β U_β K_β; 1 Sp(N,ℝ) Sp(N) U(N); 2 U(N,N) U(2N) U(N)× U(N); 4 O^*(4N) O(4N) U(2N) ] Then, M_β≃ G_β/K_β is a Riemannian symmetric space, with dual M̂_β = U_β/K_β. The M_β are realised as classical domains, whose elements are N× N complex matrices (if β = 1, 2) or 2N × 2N complex matrices (if β = 4), with operator norm < 1, and which are in addition symmetric (β = 1) or antisymmetric (β =4). If β = 1,2, then any x ∈ M_β may be written x = k_ 1(tanh(λ))k_ 2 where k_ 1 and k_ 2 are unitary (k^tr_ 2 = k^tr_ 1, in case β = 1), and λ is real diagonal. However, if β = 4, x = k ([ -tanh(λ); tanh(λ) ]) k^tr where k is 2N × 2N unitary. If f:M_β→ℝ is K_β-invariant, and f(x) = ∏ w(λ_j), ∫_M_β f(x)vol(dx) = C̃_β∫_ℝ^N∏^N_j=1 w(λ_j)sinh\|2λ_j\|∏_i<j\|cosh(2λ_i) - cosh(2λ_j)\|^β dλ After introducing u_j = cosh(2λ_j), this immediately becomes ∫_M_β f(x)vol(dx) = C̃_β× z_β(μ) where μ(du) = w(acosh(u)/2)du on the interval I = (1,∞). Remark : the domain M_2 is sometimes called the Siegel disk. As an application of (<ref>), consider a random x ∈ M_2 with a Gaussian probability density function p(x\|x̅,σ) = (Z(σ))^-1exp[-d^ 2(x,x̅)/2σ^2] with respect to vol(dx), where d(x,x̅) denotes Riemannian distance and σ > 0. Then, following the arguments in <cit.>, (<ref>) can be used to obtain Z(σ) = C̃_ 2×{ m_k+ℓ(σ)}^N-1_k,ℓ=0 m_j(σ) = ∫^∞_1exp(-acosh^2(u)/8σ^2)u^jdu The integrals m_j(σ) are quite easy to compute, and one is then left with a determinantal expression of Z(σ). The starting point to the study of the random matrix x is the following observation. If x is written as in (<ref>) and u_j = cosh(2λ_j), then the random subset { u_j;j=1,…,N} of I=(1,∞) is a determinantal point process (see <cit.>). By writing down its kernel function, one may begin to investigate in detail many of its statistical properties, including asymptotic ones, such as the asymptotic density of the (u_j), or the asymptotic distribution of their maximum, in the limit where N →∞ (of course, with suitable re-scaling). § FUTURE DIRECTIONS The present submission developed determinantal expressions for integrals on symmetric spaces on a case-by-case basis, only through a non-exhaustive set of examples. Future work should develop these expressions in a fully general way, by transforming (<ref>) and (<ref>) into (<ref>) or (<ref>), for any system of reduced roots. The long-term goal is to understand the random matrix theory of symmetric spaces. One aspect of this is to understand the asymptotic properties of a joint probability density (in the notation of (<ref>)) f(a)∏_λ∈Δsinh^m_λ\|λ(a)\|da and analyse how these depend on the set of positive reduced roots Δ. It is worth mentioning that, in previous work <cit.>, it was seen that a kind of universality holds, where different root systems lead to the same asymptotic properties. Random matrix theory (in its classical realm of orthogonal, unitary, and symplectic ensembles) has so many connections to physics, combinatorics, and complex systems in general. A further important direction is to develop such connections for the random matrix theory of symmetric spaces. 8 helgasson Helgason, S.: Differential geometry and symmetric spaces. Academic Press, (1962) dyson Dyson, F.: The threefold way. Algebraic structures of symmetry groups and ensembles in quantum mechanics. Journal of Mathematical Physics 3(6), 1199–1215 (1962) zirnbauer Zirnbauer, M.: Symmetry Classes. The Oxford Handbook of Random Matrix Theory (Editors, G. Akemann, J. Baik, P. Di Francesco), (2018) edelman Edelman, A., Jeong, S.: On the Cartan decomposition for classical random matrix ensembles. Journal of Mathematical Physics 63(6), (2022) tierz Santilli, L., Tierz, M.: Riemannian Gaussian distributions, random matrix ensembles, and diffusion kernels. Nuclear Physics B 973, (2021) said3 Said, S., Heuveline, S., Mostajeran, C.: Riemannian statistics meets random matrix theory: towards learning from high-dimensional covariance matrices. IEEE Transactions on Information Theory 69(1), 472–481 (2023) meckes Meckes, E.S.: The random matrix theory of the classical compact groups. Cambridge University Press, (2019) mehta Mehta, M.L.: Random Matrices (Third Edition). Elsevier, (2004) huang Huang, Y.: A uniform description of Riemannian symmetric spaces as Grassmannians using magic square. PhD Thesis, The Chinese University of Hong Kong (2007) sakai Sakai, T.: On cut loci of compact symmetric spaces. Hokkaido Mathematical Journal 6, 136–161 (1977) kj Johansson, K.: Random matrices and determinantal processes. arXiv:match-ph/0510038 (2005)
http://arxiv.org/abs/2306.05504v1	20230608185144	Mean-field models for the chemical fueling of transient soft matter states	[ "Sven Pattloch", "Joachim Dzubiella" ]	cond-mat.soft	[ "cond-mat.soft", "physics.chem-ph" ]	Applied Theoretical Physics - Computational Physics, Physikalisches Institut, Albert-Ludwigs-Universität Freiburg, D-79104 Freiburg, Germany Cluster of Excellence livMatS @ FIT - Freiburg Center for Interactive Materials and Bioinspired Technologies, Albert-Ludwigs-Universität Freiburg, D-79110 Freiburg, Germany Applied Theoretical Physics - Computational Physics, Physikalisches Institut, Albert-Ludwigs-Universität Freiburg, D-79104 Freiburg, Germany Cluster of Excellence livMatS @ FIT - Freiburg Center for Interactive Materials and Bioinspired Technologies, Albert-Ludwigs-Universität Freiburg, D-79110 Freiburg, Germany The chemical fueling of transient states (CFTS) is a powerful process to control the nonequilibrium structuring and the homeostatic function of adaptive soft matter systems. Here, we introduce a mean-field model of CFTS based on the activation of metastable equilibrium states in a tilted `Landau' bistable energy landscape along a coarse-grained reaction coordinate (or `order parameter') triggered by a nonmonotonic two-step chemical fueling reaction. Evaluation of the model in the quasi-static (QS) limit - valid for fast system relaxation - allows us to extract useful analytical laws for the critical activation concentration and duration of the transient states in dependence of physical parameters, such as rate constants, fuel concentrations, and the system's distance to its equilibrium transition point. We apply our model in the QS limit to recent experiments of CFTS of collapsing responsive microgels and find a very good performance with only a few global and physically interpretable fitting parameters, which can be employed for programmable material design. Moreover, our model framework also allows a thermodynamic analysis of the energy and performed work in the system. Finally, we go beyond the QS limit, where the system's response is slow and retarded versus the chemical reaction, using an overdamped Smoluchowski approach. The latter demonstrates how internal system time scales can be used to tune the time-dependent behavior and programmed delay of the transient states in full nonequilibrium. Mean-field models for the chemical fueling of transient soft matter states Joachim Dzubiella July 31, 2023 ========================================================================== § INTRODUCTION The transient assembly and ordering of active materials fueled by a chemical reaction is a key process in the nonequilibrium structuring and function of biomolecular systems, e.g., to perform work or reach homeostatic mechanical responses <cit.>. These versatile and adaptive material features have triggered plenty of research recently, on one hand, to understand the fundamental physical properties of nonequilibrium transient states, but also, on the other hand, to develop synthetic active materials which display biomimetic or other novel useful behavior, driven by fuel consumption through chemical reaction networks <cit.>. Experimental examples are the fuel-driven self-assembly of synthetic molecules into fibers <cit.> or gels <cit.> with variable and controllable lifetime and stiffness, the fueled nucleation and coacervation <cit.> and spinodal decomposition <cit.> in phase separating systems, as well as the fueled collapse of functional macromolecules such as hydrogel colloids <cit.>. The desired goal of the ongoing research efforts is to establish rational design principles that enable a generic access to nonequilibrium soft matter systems with adaptive and predicable dynamics <cit.>, for example, to demonstrate programmable hydrogel-based model systems <cit.>. Hydrogels are soft, responsive and deformable, and thus of special interest for the development, e.g., of chemically fueled mechanical actuators <cit.>. However, realizing programmable or even adaptive structural dynamics has proven challenging because it requires harmonization of the chemical energy uptake and dissipation events within the steady states <cit.>. The full nonequlibrium is even more difficult to control due to the intricate coupling of the time-dependent chemical, thermodynamic, as well as mechanical degrees of freedom of the supramolecular systems <cit.>. The theoretical modeling is therefore often either too complex to derive simple laws, or relies only on the numerical solution and phenomenological interpretation of the underlying chemical networks <cit.> without coupling to low-dimensional emerging mechanical or structural (order) parameters during the spatiotemporal evolution of the whole system. Here, we make a first step towards a simple theoretical treatment of the coupling of the chemical fueling to the emerging structure, thermodynamics and mechanics of the system within a generic model framework. The latter is motivated by a Landau-type of mean-field model to access the qualitative behavior of phase transitions, e.g., as of magnetic systems in external fields <cit.>. In particular, we assume that the fueled system is bistable (two-state), featuring a stable state and a highly unstable state, the latter of which is then activated by the external field. In other words, fueling increases the probability of the unlikely `hidden' state over the initial state for a certain time, thus stabilizing a transient state with variable lifetime. In contrast to the classical Landau model, the external field enters in our approach through the action of a time-dependent chemical reaction (or chemical network). As a first approximation, the field enters linearly into our model analogous to the popular m-value approach to describe biomolecular state transitions, such as 2-state protein unfolding/denaturation by cosolute addition <cit.>. Although simple and mean-field, we demonstrate that many useful scaling laws can be drawn from such a model already in the quasi-static limit (where system relaxation is fast compared to the chemical reaction), in particular, for the relations between fuel concentration, chemical rates, and the duration of the transient states. Moreover, we show that, like in the Landau framework <cit.>, such a Hamiltonian-based model can then also be employed by using simple diffusive relaxational dynamics to study a full nonequilibrium fueling process. This is relevant in situations when the chemical and the system time scales are comparable and temporal effects like delay and retarded response come into play. We discuss further possible applications and extensions of these models in the final outlook section of this work. § GENERAL MODEL §.§ Coarse-grained bistable Hamiltonian In our model, the fueled system is described by a coarse-grained one-dimensional reaction coordinate, Q, e.g., the radius of a single responsive particle, cf. Fig. 1, or, in general, any meaningful structural (order) parameter. In order to allow for state transitions of the system (as, e.g., in the hydrogel volume transition <cit.>), the coordinate is assumed to live in a bimodal energy landscape, H_0(Q)=A(Δ Q)^2+B(Δ Q)^4, which we model by a simple quartic form as put forward in the simplest case by Landau to model phase transitions <cit.>. Here, Δ Q = Q-Q_c, and A, B, and Q_c describe the intrinsic energy landscape, with Q_c being the center of the symmetric quartic form. For A<0 and B>0 it exhibits two local minima at Q_1 and Q_2. If Q is, for example, a particle volume or size, then the interpretation of such an Hamiltonian would be that it essentially represents a nonlinear elastic energy including a volume transition. The action of the chemical fuel is considered by a time-dependent contribution H_p(Q,t)=m ·(p(t)-p^* )Δ Q, which constitutes a perturbation of H_0 linear in both Q and in the product concentration p(t), like an external magnetic field in the Landau picture. The total form of the Hamiltonian is thus H(Q,t) = H_0(Δ Q)+ H_p(Δ Q,t) = A(Δ Q)^2+B(Δ Q)^4+ m ·(p(t)-p^* )Δ Q. The value of m defines the strength of the action of the chemical products p. For the critical concentration p^* the chemical contribution H_p(Q) vanishes and the two coarse-grained states are equally probable. In other words, p^* describes the initial bias (tilt) of the bimodal landscape in the unperturbed equilibrium. The Hamiltonian (<ref>) is explicitly time-dependent because of the time-dependent product concentration p(t). The increase of the latter leads to large tilts of the landscape, activating metastable states into transient probable states, cf. Fig. 1. We note that a linear perturbation of thermodynamic two-state energies is not always justified but it is simple and can almost always be derived from a Taylor expansion as weak perturbation. It is thus quite established within the `m-value' framework for the action of simple cosolutes on the coil-to-globule (or folding/unfolding) transition in bio- and polymer physics <cit.>). In that sense mp^* can also be interpreted as a thermodynamic distance to the (coil-to-globule or volume) transition temperature T_ crit and is essentially related to a temperature difference ∝ T-T_ crit times transition entropy <cit.>. In other words, for a certain responsive system with a thermodynamic transition temperature, the initial tilt p^* can be pre-designed by temperature, transition entropy, and the chemistry specific m-value, which are often known or measurable quantities. §.§ Chemical fueling reaction The chemical fueling is assumed to follow a two-step reaction process. Here, the fuel, f(t), is converted in the homogeneous solution to a product, p(t), with a rate constant k̃_+, following the rate equations ḟ = -k̃_+ f (p_sat - p ) ṗ = -k̃_+ f (p_sat - p ) - k_-p with the starting conditions f(t=0 ) = f_0 (i.e., the initial fuel concentration) and no product initially, p(t=0 )= p_0 = 0. The product is the species that is active, in the sense that it changes the system by interacting or physically/chemically binding to it. Typically, the product has only a certain lifetime and decays with a first order rate k_-. Note that the k̃_+ is a second order rate, which we denote by the tilde symbol. Moreover, we have to impose a saturation concentration, p_ sat for the action of the fuel to consider the possibility of a finite number of products because of, e.g., limited binding partners/sites. In equilibrium, ṗ=0, we recover the Langmuir isotherm for the function p(f) with equilibrium constant k̃_+/k_- <cit.>. During time evolution, the products reach a single maximum, p_ max := max(p) ≤ p_ sat, as further exemplified below. Generally, we can distinguish various regimes depending on whether the ratio of fuel to p_ sat and the ratio of k̃_+ p_ sat to k_- is low/high. In a related discussion by Sharko et al. <cit.> it is shown that to activate the transient state, we need either very high fuel concentrations, or higher activation than deactivation rates in order to obtain sufficiently many active products. We will quantify this more in the following for our model. Since we focus on systems with controllable lifetime we restrict ourselves to the activation dominant case k̃_+ p_ sat > k_-. Analytic solutions for p(t ) we only obtain for the unsaturated case p_sat≫ p for all times, where we can approximate p_ sat -p ≃ p_ sat and introduce a new pseudo first order rate constant k_+ = k̃_+p_ sat. The analytical solution is then analogous to the double-exponential two chain reaction of radioactive decay <cit.> p(t ) = k_+f_0/ k_+-k_-(e^-k_-t - e^- k_+t). In this case, the time evolution of products p(t) shows an exponential rise with rate k_+ at the beginning, a maximum at p_ max at t=t_ max, following a decay with rate k_- for long times. This is exemplified in Fig. <ref>, where we compare different fueling situations. The time where the product concentration is maximal in the unsaturated (us) case is given by t_max^( us) = lnκ/k_-- k_+ with the corresponding maximum product concentration p_ max^( us) = p(t_ max^( us)) = f_0/1-κ(κ^κ/1-κ - κ^1/1-κ), where we introduced κ = k_-/ k_+, the ratio of the rates with 0<κ<1. The analytical solutions for the unsaturated case are compared to numerical solution of eq. (2) for saturated situations in Fig. 2. The saturated cases in these examples show suppressed peaks and plateau-like behaviors where p≤ p_ max < p_ sat and always p_ max < p_ max^( us). §.§ Quasi-static (QS) chemical fueling §.§.§ Equilibrium averages If the reaction coordinate Q relaxes much faster than the chemical timescales, the dynamics are quasi-static (QS), i.e., the Boltzmann distribution of Q P(Q,t) = exp(-β H(Q,t))/Z(t) according to the Hamiltonian (<ref>) holds for every time t. The normalizing partition sum is Z(t) = ∫ e^-β H(Q, t)dQ. The average value of a function X(Q,t) then directly follows from the Boltzmann average ⟨ X(t)⟩ = ∫ X(Q,t) P(Q,t) dQ. Hence, in the QS limit we can straightforwardly consider also thermodynamic quantities such as energy U(t) = ⟨ H⟩, free energy F(t)=-k_Bln Z(t)), entropy S(t) =(U(t)+F(t))/T, and the power P=dF/dt. Using the exact relation dF/dt = ⟨d H/dt⟩, one can derive the useful relation for our model that the power is P = m (dp/dt) ⟨Δ Q(t)⟩, i.e., given by the change of time evolution of the product times the time-dependent mean of the order parameter. The initial fueling power is then provided by P(t=0) ≃ m f_0 k_+ (Q_2-Q_c) if we use ⟨Δ Q(t=0)⟩≃ Q_2-Q_c. §.§.§ Separation of the energy contributions The time-dependent work and energy can be deeper analyzed by considering the contributions to the Hamiltonian, eq. (<ref>). It consists of two parts. First, we have the intrinsic part H_0 (Q,t) = A(Δ Q)^2+B(Δ Q)^4- m p^Δ Q, which does not depend on the external field, and then a second part creating the time-dependent linear chemical perturbation H_pert(Q,t) = m p(t)Δ Q. By calculating the average values U_0(t) = ∫ H_0 (Q,t) P(Q,t) dQ and U_pert(t) = ∫ H_pert (Q,t) P(Q,t) dQ, respectively, we can thus divide the energy in its intrinsic and external contributions. For many experimentally relevant systems we can interpret them as mechanical (U_0) and chemical (U_ pert) contributions, respectively. For Q being, for example, the particle size, the first one describes the elastic energy which changes over time only by variations of the particle distributions, while the second one depends directly on the time caused by the variable chemical product concentration p(t). §.§.§ Duration of transient states We now estimate the duration of transient states for our 2-state model in the QS limit. We can call the transient state `activated' if its probability of occurrence is larger than the other, initial state. We recognize that in the QS limit a minimum threshold of fueling concentration is needed to activate the transient state, given by the condition p_ max≥ p^. This leads to the threshold (or `critical') concentration for successful fueling f_0, crit = p^( k_+-k_-)/ k_+[( k_+/k_-)^k_-/k_-- k_+ - ( k_+/k_-)^ k_+/k_-- k_+]^-1 = p^(1-κ)(κ^κ/1-κ - κ^1/1-κ)^-1 which in the typical limit of k_- ≪ k_+ reduces to the simple relation f_0, crit = p^. As discussed above, p^ signifies the important initial thermodynamic distance of the system to the transition point and can in principle be a priori designed. Once fixed, it directly defines the threshold concentration for successful fueling. We see that naturally also p_ sat>p^* should hold for successful activation. If we are above the threshold concentration for fueling, we can analytically estimate the duration of the times of the transient states. This we can do in two ways: (i) Symmetry definition of the transient time: In the case of a sufficiently high saturation limit, p_ sat>p^, and the condition p(t) >p^ holds, the stability bounds of the transiently stable state are very well defined by the times t_1 and t_2 > t_1 where p(t)= p^, i.e., where the two states are equally likely. (Note again that in our simple two-step chemical reaction the condition p(t)= p^ is met only twice, during on-fueling and decay). The duration of the transient state can then be formally defined as τ_ trans = [t_2-t_1]_p=p^* where the notation means that the two times are evaluated if p(t)=p^. We find through the slow-decay approximation e^-k_-t_1≈ 1, that t_1 = -1/ k_+ln(1-p^( k_+ -k_- )/ k_+f_0), and the fast-fueling assumption e^-k_+t_2≈ 0, that t_2 = 1/k_-ln( k_+f_0/p^( k_+-k_-)), the duration of the transient state is essentially (and not surprisingly) determined by the on and off-rates of fueling, while there are logarithmic corrections depending on all rates and densities f_0 and p^. Interestingly, we can show that for a bistable Hamiltonian of form (1) the times defining the transient states at p(t ) = p^* are extrema of thermodynamic state functions, such as the free energy. Taking the derivative of the partition function Z with respect to p, we find dZ/dp = -∫_-∞^∞ mQ e^-(AQ^2 + BQ^4 + m(p(t ) -p^* )Q)dQ. Obviously, the integrand becomes an antisymmetric function if p(t ) = p^* so that the integral vanishes and Z has an extreme point, more precisely, leading to a maximum of the free energy F(t)=-k_BTln Z(t). Using the modified Bessel functions of the second kind K_α(x ), we can write the extremum of the free energy: F_max = F(p^) = -k_BT [A^2/8B +ln( K_1/4(A^2/8B)/2√(-B/A)) ] which in the QS limit constitutes the maximum work the system can perform. (ii) Plateau definition of the transient time: In the case of strong saturation (that is, small p_ sat<p_ max^ (us)), we obtain a longer period of a plateau behavior, for which p(t)≃ p_ sat=p_ max. Then the duration period of the transient state is mostly given by the time spent in the plateau. This we can estimate by the following: at the plateau we have p≃ p_ sat= constant and thus ṗ = ḟ -k_-p ≃ 0, cf. eq. (2), and a linear decrease of the remaining fuel f(t) ≃ f_0 - k_- p_ satt. The plateau decays when most of the fuel is consumed f(t)≪ f_0. Hence, we find for the duration of the plateau approximately τ_ trans∝τ_ plateau≃f_0/k_-p_sat, constituting a useful law in dependence of the initial fuel concentration, decay rate, and saturation concentration. Noteworthy the transient time is now simply linear in f_0, if a plateau (i.e., saturation) behavior dominates the system. Due to the approximations made, however, a constant offset in this formula is generally plausible. Note also that for saturating systems, the symmetry definition (i) should lead to values very close to the plateau definition (ii). The symmetry definition is more general and holds also for non-saturating systems, while for both p>p^. Only the plateau regime (ii) leads to the clear linear scaling given by eq. (<ref>). §.§ Slow system relaxation: Smoluchowski approach If the system relaxation is slow compared to the chemical reaction, its response to the time-dependent Hamiltonian will be retarded. As a simple start, we can assume the system is following an overdamped diffusive dynamics following the Smoluchowski (drift-diffusion) equation <cit.>: ∂ P/∂ t = D ∂^2 P/∂ Q^2 - D β[∂^2 H/∂ Q^2 P +∂ H/∂ Q∂ P/∂ Q] where P=P(Q,t) is the time-dependent probability distribution, D=k_BT/ξ the diffusivity which we assume Q-independent, and ξ the friction coefficient. We solve this equation numerically using the fplanck python package <cit.>. Note that time-dependent averages in the system can be still evaluated with general eq. (<ref>). For an interpretation of the results during slow dynamics we need to briefly discuss the timescales in this problem: A diffusion timescale can now be defined by τ_D = (Q_2 - Q_c) / D, where Q_2 is the position of the initial global minimum of H(Q). Note, that this position changes slightly over time as the linear term of the Hamiltonian does. For our definition, we thus use the symmetric situation at p(t ) = p^* where it holds that τ_D = -A/2BD. This time expresses how long the system needs to diffuse from the minimum to the barrier position. Such a diffusive time can be readily related to the typical fueling time through the dimensionless parameter α = τ_D k_+ If α≪ 1, we are in the QS limit. For α≳ 1 the system relaxes slow and significantly retarded to the chemical reaction. In the extreme case of α≫ 1, the system never relaxes during fueling and essentially does not change in time. Another relevant timescale in this bistable system, if energy barriers are significant (Δ H≳ k_BT), is the so-called Kramers time for diffusive barrier crossing <cit.>. There are several expressions for it depending on the approximations made. We define the Kramers time with τ_D as a prefactor to the important exponential Arrhenius-factor to have it consistent in the vanishing barrier limit, hence, τ_ Kramers = τ_D e^βΔ H, with energy barrier Δ H. For large barriers, the Kramers time is limiting for the distribution to flood the metastable state once activated by the fuel, and also for the reverse process. Note that Δ H(t) as well as the location of the extrema are themselves time-dependent, hence the barrier crossing effects are not uniquely to quantify. For simplicity, we follow the rule that we calculate the Kramers time using Δ H = H(Q_c)- H(Q_2) from the symmetric, non-skewed energy landscape at p=p^. The ratio between Kramers time and the chemical fueling time, we denote then by α_K = τ_ Kramersk_+. § CASE STUDY: CHEMICAL FUELING OF HYDROGEL COLLAPSE We now apply our model in the QS limit to explicitly fit the experimental data of chemical fueling of hydrogel collapse recently put forward by Heckel et al. <cit.>. In these experiments, the chemical fuel N-Ethyl-N'-(3-dimethy- laminopropyl)carbodiimide (EDC) was used to trigger the volume phase transition (VPT) for poly(methacrylic acid) (PMAA) microgels, to demonstrate that the collapsed hydrophobic state can be programmed in time using the fuel concentration in a cyclic reaction network. The EDC addition enables two neighboring carboxylic acid groups to form a cyclic carboxylic anhydride which increases the hydrophobicity of the hydrogel. The measured observable was the finite hydrogel radius R(t), see Fig. 3, averaged over many particles for fixed time t. We assume R(t) = ⟨ Q(t) ⟩ as a an ensemble average over a hypothetically infinitely large sample of spheres. §.§ Fitting procedure Our fit is based on the numerical solution of the coupled eqs. (<ref>) and (<ref>) including saturation. The EDC fuel concentration is translated to f_0 in units of 1 mmol/l. In Heckel et al. we find several measurement curves for two pH-values, pH = 6.1 and pH = 7.2, with differing initial fuel concentration f_0. We reconcile our model and the experimental data by minimizing the total mean squared deviations (MSD) between theory curves and experimental data for a fixed pH (details in the Supporting Information, ESI). The model takes the initial fuel concentration f_0 as an input, while the other parameters listed in Table <ref> are fitting parameters, now with real experimental units assigned. However, all of the fitting parameters are kept constant for a fixed pH value. When a fitting parameter is called global, it means that it is constant also for both pH values. We treat the parameters for the energy landscape A, B and Q_c as global parameters, because we expect them to be intrinsic properties of the hydrogel colloids, which do not depend on the pH-value. We also globally fix p_sat, which should be constant because pH-dependent side reactions changing the amount of microgels are not included in our model. In contrast, the chemical reaction rates <cit.> and also the m-value describing their impact on the energy landscape may depend on the pH-value. (We note that removing the constraints of pH-independent energy landscape parameters we obtain slightly improved fits, but because the improvement is only little (see ESI Fig. S<ref>), we consider a pH-dependent m-value as sufficient. Moreover, we observe some arbitrariness (i.e., some insensitivity) of the fits regarding the precise magnitude of the energy barrier. We avoid this problem by fixing the energy barrier for a fixed pH through the exact expression in the symmetric landscape, Δ H = A^2/4B. Interestingly, unimodal potentials of the simple form ∝Δ Q ^2n with n=1,2 were not able to reproduce the relatively fast sigmoidal transitions from one state to the other (see Supporting Information Fig. S<ref> and S<ref>). Improved fits were achieved by broader n=3 and a square-well `box' potential. But here the distribution functions become relatively broad, in contrast to the experiments <cit.>, with unrealistically unbound values of the radius R. Hence, a Landau-like quartic potential including the presence of transition barriers (Δ H≳ k_BT) was most adequate to fit the data. Note that hydrogel charge content tunes the location and width of the VPT <cit.>. Further modifications of the fitting constraints are conceivable. For example, we can pre-fix p_sat to the number of available reaction partners, allow an offset for f_0, or change pH-dependent variables to global ones. Similarly, we tested purely unsaturated equations for p, eq. (3), but dropped them due to the following reasons. Without saturation, the maximum value of p is not bounded but can exceed the (experimentally roughly known) number of reaction partners. In addition, the pronounced peaks in p(t) without saturation make it hard to reproduce the flat plateaus we observe in R(t ) for large f_0 (see Fig. <ref>). Finally, without saturation the fast conversion to p and thus enhanced fuel consumption leads to a sublinear scaling between f_0 and the transient time, which is in contrast to the fully linear experimental observation, cf. Fig. <ref> later. §.§ Fitting results The results of an exemplary best fit are displayed in Fig. <ref>. Here, we fixed the energy barrier to 2 k_BT. We obtain comparable results using other energy barriers (see Fig. S<ref> for Δ H = 5 k_BT), which confirms that the exact choice of the barrier height is of minor importance in the QS case, as long as is it not vanishing (Δ H≳ 1 k_BT). Later we will see, however, that the precise value of Δ H makes a substantial difference in the full nonequilibrium when the system relaxation is comparable to the chemical reaction times. The parameters of this fit are summarized in Table <ref>. The fits themselves are not quantitative, but considering the relatively large error in the time domain of the experiments of a few hours (cf. Fig. 2b in <cit.>), they are satisfactory, in particular, they agree very well in several qualitative aspects: They describe the fast drop of R(t) in the experiments down to 236 nm and 224 nm for pH = 6.1 and 7.2, respectively (compared to the values obtained by our fits: 236 nm and 249 nm), the plateau behavior, the slow rise of the radius, and, in particular, the trends and magnitudes of the transient times, as in detail discussed later. Note that our model fits allow to reversely calculate the time evolution of fuel f(t) and/or products p(t) in the system. For the parameter set of Fig. <ref> and the exemplary choices pH =6.1 and f_0 = 0.99 mmol/l, we show the temporal evolution of the products p(t) together with the corresponding time evolution of the energy landscape H(Q,t) in Fig. <ref>. One can nicely compare the features of products and mechanical response at different characteristic times, including the saturation behavior and the symmetric states at p=p^. More conclusions can be drawn from the fitting numbers in Table <ref>. Since f_0/p_sat≤2.5, we expect high k_+/k_- ratios because of the pronounced plateaus. Indeed, our k_+ are about three orders of magnitude larger than k_-. This means, with respect to Sharko et al. <cit.>, we are moving through different fueling regimes depending on the initial fuel concentration f_0. In particular, our model captures the transition from small dips (minima) to ever-widening plateaus. Furthermore, we find that the expected pH-dependent reactivity changes with our parameters: When pH increases, we expect slower anhydride formation <cit.> and faster hydrolysis <cit.>, which is expressed in smaller k_+ and lower k_- for pH = 7.2 than for 6.1. This change in reactivity explains in turn, why we need more fuel for the same drop in radius for pH = 7.2. Moreover, we find excellent agreement between the saturation concentration p_sat when compared to the experimental numbers <cit.>. Of special interest is the behavior of the duration of the transient times and how they are controlled by the physical and chemical parameters in the system. In the experimental paper <cit.> the transient times were defined as the timespans between R^* = (R(t=0 ) + R_min) /2, where R_min is the minimum radius for each individual curve. In the following, we call this time half collapse time, denoted by τ_1/2. This definition we can in principle also apply to the data generated by our model. However, we evaluate the transient times, τ_ trans, in our model according to our well-defined symmetry definition eq. (<ref>), which is similar but not exactly the same as τ_1/2. The definition is applied to the fitting curves in Fig. 3 and plotted vs. f_0 in Fig. <ref>, in which we compare also to the experimental definition τ_1/2. There is overall very good agreement. In particular, this plot suggests a linear connection between τ and f_0, as predicted from our analysis of the transient times in the saturated plateau regime, eq. (<ref>). Using the fitted values in Table <ref> we obtain slopes of 1.01·10^5 and 3.59·10^4 h l mmol^-1 for pH=6.1 and 7.2, respectively. They are shown as straight lines in Fig. <ref> where the y-intercept is chosen consistently from our fits where τ(p^* ) = 0, i.e. where activation of the transient state starts. Linear fits of the experimental τ_1/2 provide 9.83·10^4 and 3.70·10^4 h l mmol^-1 (dotted lines) underlining the agreement between experiment and theory. Hence, we understand the linear relation between τ_1/2 and f_0 described by Heckel et al. <cit.> in a mathematical framework, which facilitates lifetime tuning of the transient state. §.§ Thermodynamic analysis in the QS limit In the QS limit, thermodynamic quantities such as energy, entropy, etc., are time-dependent but still well defined. For selected parameters (cf. Table <ref>, at pH = 6.1, f_0=0.99 mmol/l) we show U(t), S(t) and the free energy F(t) in Fig. <ref>. We have already discussed F(p) and found that it has a maximum at p(t)=p^* where the Hamiltonian is symmetric and which is realized two times in the system: at very short times (t≃ 0 on this scale) where F(t) jumps up and down in a δ-peak like fashion and again at about t≃ 30 h. (Note that if we do not reach the transient state because p_max<p^, then F would only have one maximum.) The behavior of F(t) looks complex, since F drops to a local minimum between the two maxima, at which we have the transient plateau behavior, during which p ≃ p_ sat = p_max. After the second maximum F(t) relaxes back to the initial state. The apparently complexity essentially arises from the mapping of the asymmetric chemical kinetics p(t) on the behavior of F(p) according to the bistable Hamiltonian, eq. (1). As one can see in Fig. <ref>(a), U and S have similar functional forms than F. For an unimodal Hamiltonian less complex behavior can be expected. The inset of Fig. <ref>(a) shows the derivative of the free energy, P=dF/dt, which we can interpret as the thermodynamic power. It has its largest absolute values immediately at the addition of the fuel at t=0, meaning that the system is most active initially. This makes sense given the high k_+ to k_- ratio. It can also be understood from the analytical results, eq. (<ref>) which is largest at the beginning where the radius is biggest and products massively produced, P(t=0) ≃ m f_0 k_+ (Q_2-Q_c). For later times during relaxation then broader and flatter peaks in the power develop at around t≃ 30 h, when F(t) peaks again and the system transitions back to the initial state. Hence, most work is performed chemically and elastically at the transitions to and from the transient state in a bistable system. Part b) of Fig. <ref> displays the course of the total energy U(t) and its mechanical and chemical contributions, U_0 and U_ pert, respectively. The most intuitive is the mechanical energy U_0. By addition of the fuel we force the hydrogel very quickly to the collapsed state whereby energy is stored (increased) elastically. Its time of maximum coincides with that of maximum products, p=p_sat, and then we observe relaxation, where the stored energy is released again. For the total U, the shape is different. Here, we observe the maxima as in F(t) where p=p^, otherwise the energy is always lower. To understand this, let us consider the chemical (or external) part U_pert, being the difference of U and U_0: It increases δ-peak like in the very beginning (t≃ 0 on this scale) when chemical energy is quickly pumped into the system and converted to mechanical one. When the mechanical energy starts relaxing, U_pert rapidly decreases and turns negative. Subsequently, the process is reversed but not chemically fueled, driven by the stored elastic energy. Note that U_pert has zeros at short times p(t) ≃ 0 (on this scale) and at p(t) = p^*. This is accompanied with maxima in the entropy, cf. Fig. 6(a), indicating heat exchange with the bath along the evolution of the internal energy. §.§ Effects of slow system relaxation We finally discuss the effects of slow relaxation, such as possible delays in the system's response <cit.>, in the context of the just discussed case of chemically fueled hydrogel collapse. For this, we fix the parameters according to Table <ref>, for pH=6.1 and f_0=0.99 mmol/l. We now tune the timescale separation parameter α in eq. (<ref>) from 0.1 to 10 and solve numerically the Smoluchowski equation (<ref>) for the distribution P(Q,t) to calculate averages, such as R(t). The results are shown in Fig. <ref>(a). For α=0.1 we are still very close to the QS limit because the diffusive system relaxation is still 10-fold faster than the fast rate k_+. However, moving to α=0.5 or 1, we observe clear retardation effects, involving less collapse and a delay of the minimum in time. For α=5 and larger, the system becomes quite inert and the response effects very small. The chemical powers transform mostly into dissipative losses and cannot be used to perform work. Clearly, a change of internal timescales can change the nonequilibrium time evolution and thermodynamics massively. In the just described system we have still a relatively small barrier of Δ H = 2 k_BT. If we raise the barrier, the system relaxation time should be more adequately described by the Kramers crossing time, eq. (<ref>), leading to the time scale ratio α_K = τ_ Kramerk_+. This is exemplified in Fig. <ref>(b) where we use the alternative fit with a barrier height of Δ H = 5 k_BT. The Kramers time is now about 150 times larger than τ_D resulting, for example, in α_K = 15 for α=0.1 for a response which is already clearly non-QS (brown curve in Fig. <ref>(b)). Hence, the Kramers time is naturally more appropriate to characterize delayed systems involving internal barriers. § CONCLUDING REMARKS In this contribution, we have put forward a Landau type of mean-field model to describe the quasi-static and nonequilibrium chemical fueling of transient soft matter states in a bistable system. Already the analysis of the quasi-static (QS) limit led to useful scaling laws and relations between chemical and mechanical parameters, which could serve for future material design. We demonstrated their usefulness explicitly for the case study of the chemically fueled volume (collapse) transition of a responsive hydrogel colloid. Moreover, we provided a thermodynamic (energy, work, and power) analysis in the QS limit and also showed how internal (diffusive) relaxation times scales can substantially alter the time evolution if they compete with the chemical timescales of fueling. Several extensions of this model shall be interesting in future studies. By including more complex order parameters, higher dimensions of the reaction coordinate, or structural gradients in the Hamiltonian, the extension to self-assembling <cit.> and phase separating systems <cit.> could be attempted. From the chemical side, higher order reaction networks <cit.> than only two-step reactions could be envisioned. Finally, further increasing complexity could be obtained by imposing a negative feedback cycle within the system, e.g., by coupling the mechanical response back to the chemical reaction <cit.>. Here, much more intricate transient dynamics and responses, including regimes of mono- and bistability, excitability, damped oscillations, as well as sustained oscillatory states can be expected during the time evolution <cit.>. § ACKNOWLEDGMENTS The authors thank Andreas Walther for useful discussions and sharing details of the fueling experiments on hydrogels. The authors also thank Nils Göth and Sebastian Milster for a critical reading of the manuscript. The authors further acknowledge support by the state of Baden-Württemberg through bwHPC and the German Research Foundation (DFG) through grant no INST 39/963-1 FUGG (bwForCluster NEMO) and funding from the DFG under Germany's Excellence Strategy - EXC-2193/1 - 390951807 (`LivMatS'). apsrev4-2-no-url.bst 45 fxundefined [1] ifx#1 fnum [1] #1firstoftwo secondoftwo fx [1] #1firstoftwo secondoftwo noop [0]secondoftwo ref[1]@startlink#1@href href[1]#1@endlink anitize@url [0]` 12`$12`&12`#12`1̂2`_12`%12 startlink[1] endlink[0] rl [1]href #1 @bib@innerbibempty [Desai and Mitchison(1997)]desai author author A. Desai and author T. J. Mitchison, 10.1146/annurev.cellbio.13.1.83 journal journal Annual Review of Cell and Developmental Biology volume 13, pages 83 (year 1997)NoStop [Whitesides and Grzybowski(2002)]whitesides author author G. M. Whitesides and author B. Grzybowski, 10.1126/science.1070821 journal journal Science volume 295, pages 2418 (year 2002)NoStop [Yashin et al.(2009)Yashin, Van Vliet, and Balazs]Balazs author author V. V. Yashin, author K. J. Van Vliet, and author A. C. Balazs, 10.1103/PhysRevE.79.046214 journal journal Phys. Rev. E volume 79, pages 046214 (year 2009)NoStop [Dhanarajan et al.(2002)Dhanarajan, Misra, and Siegel]Siegel author author A. P. Dhanarajan, author G. P. Misra, and author R. A. Siegel, 10.1021/jp026086v journal journal The Journal of Physical Chemistry A volume 106, pages 8835 (year 2002)NoStop [Merindol and Walther(2017)]Merindol_2017 author author R. Merindol and author A. Walther, http://dx.doi.org/10.1039/C6CS00738D journal journal Chem. Soc. Rev. volume 46, pages 5588 (year 2017)NoStop [Walther(2020)]Walther_Roadmap author author A. Walther, https://onlinelibrary.wiley.com/doi/abs/10.1002/adma.201905111 journal journal Advanced Materials volume 32, pages 1905111 (year 2020)NoStop [Wang et al.(2021)Wang, Qi, Chen, and Qu]Wang_2021 author author Q. Wang, author Z. Qi, author M. Chen, and author D.-H. Qu, https://onlinelibrary.wiley.com/doi/abs/10.1002/agt2.110 journal journal Aggregate volume 2, pages e110 (year 2021)NoStop [Straube et al.(2021)Straube, Winkelmann, Schütte, and Höfling]Hoefling author author A. V. Straube, author S. Winkelmann, author C. Schütte, and author F. Höfling, 10.1021/acs.jpclett.1c03016 journal journal The Journal of Physical Chemistry Letters volume 12, pages 9888 (year 2021)NoStop [Busiello et al.(2021)Busiello, Liang, Piazza, and De Los Rios]Piazza author author D. M. Busiello, author S. Liang, author F. Piazza, and author P. De Los Rios, 10.1038/s42004-021-00454-w journal journal Communications Chemistry volume 4, pages 16 (year 2021)NoStop [Sharko et al.(2022)Sharko, Livitz, De Piccoli, Bishop, and Hermans]Sharko_2022 author author A. Sharko, author D. Livitz, author S. De Piccoli, author K. J. M. Bishop, and author T. M. Hermans, https://doi.org/10.1021/acs.chemrev.1c00958 journal journal Chemical Reviews volume 122, pages 11759 (year 2022)NoStop [Boekhoven et al.(2015)Boekhoven, Hendriksen, Koper, Eelkema, and van Esch]Boekhoven_2015 author author J. Boekhoven, author W. Hendriksen, author G. Koper, author R. Eelkema, and author J. van Esch, @noop journal journal Science volume 349, pages 1075 (year 2015)NoStop [Heuser et al.(2015)Heuser, Weyandt, and Walther]heuser author author T. Heuser, author E. Weyandt, and author A. Walther, https://doi.org/10.1002/anie.201505013 journal journal Angewandte Chemie International Edition volume 54, pages 13258 (year 2015)NoStop [Panja et al.(2019)Panja, Patterson, and Adams]Panja_2019 author author S. Panja, author C. Patterson, and author D. J. Adams, https://onlinelibrary.wiley.com/doi/abs/10.1002/marc.201900251 journal journal Macromolecular Rapid Communications volume 40, pages 1900251 (year 2019)NoStop [Deng and Walther(2020)]deng author author J. Deng and author A. Walther, https://doi.org/10.1016/j.chempr.2020.09.022 journal journal Chem volume 6, pages 3329 (year 2020)NoStop [Heckel et al.(2021a)Heckel, Batti, Mathers, and Walther]heckel author author J. Heckel, author F. Batti, author R. T. Mathers, and author A. Walther, 10.1039/D1SM00515D journal journal Soft Matter volume 17, pages 5401 (year 2021a)NoStop [Heckel et al.(2021b)Heckel, Loescher, Mathers, and Walther]Heckel_2021 author author J. Heckel, author S. Loescher, author R. T. Mathers, and author A. Walther, https://doi.org/10.1002/anie.202014417 journal journal Angewandte Chemie International Edition volume 60, pages 7117 (year 2021b)NoStop [Nakamoto et al.(2022)Nakamoto, Kitano, and Matsusaki]Nakamoto_2022 author author M. Nakamoto, author S. Kitano, and author M. Matsusaki, https://onlinelibrary.wiley.com/doi/abs/10.1002/anie.202205125 journal journal Angewandte Chemie International Edition volume 61, pages e202205125 (year 2022)NoStop [Heinen and Walther(2019)]Heinen_2019 author author L. Heinen and author A. Walther, @noop journal journal Science Advances volume 5, pages eaaw0590 (year 2019)NoStop [Zhang et al.(2019)Zhang, Zeng, Priimagi, and Ikkala]Zhang_2019 author author H. Zhang, author H. Zeng, author A. Priimagi, and author O. Ikkala, https://doi.org/10.1038/s41467-019-11260-3 journal journal Nature Communications volume 10, pages 3267 (year 2019)NoStop [Klemm et al.(2022)Klemm, Lewis, Piergentili, and Eelkema]Klemm_2022 author author B. Klemm, author R. W. Lewis, author I. Piergentili, and author R. Eelkema, https://doi.org/10.1038/s41467-022-33810-y journal journal Nature Communications volume 13, pages 6242 (year 2022)NoStop [Ionov(2014)]Ionov_2014 author author L. Ionov, https://www.sciencedirect.com/science/article/pii/S1369702114002521 journal journal Materials Today volume 17, pages 494 (year 2014)NoStop [Fusi et al.(2023)Fusi, Del Giudice, Skarsetz, Di Stefano, and Walther]Fusi_2023 author author G. Fusi, author D. Del Giudice, author O. Skarsetz, author S. Di Stefano, and author A. Walther, https://doi.org/10.1002/adma.202209870 journal journal Advanced Materials volume 35, pages 2209870 (year 2023)NoStop [He et al.(2012)He, Aizenberg, Kuksenok, Zarzar, Shastri, Balazs, and Aizenberg]Aizenberg author author X. He, author M. Aizenberg, author O. Kuksenok, author L. D. Zarzar, author A. Shastri, author A. C. Balazs, and author J. Aizenberg, 10.1038/nature11223 journal journal Nature volume 487, pages 214 (year 2012)NoStop [Postma et al.(2017)Postma, Vialshin, Gerritsen, Bao, and Huck]Postma_2017 author author S. G. J. Postma, author I. N. Vialshin, author C. Y. Gerritsen, author M. Bao, and author W. T. S. Huck, https://onlinelibrary.wiley.com/doi/abs/10.1002/anie.201610875 journal journal Angewandte Chemie International Edition volume 56, pages 1794 (year 2017)NoStop [Hohenberg and Krekhov(2015)]Landau author author P. Hohenberg and author A. Krekhov, https://doi.org/10.1016/j.physrep.2015.01.001 journal journal Physics Reports volume 572, pages 1 (year 2015)NoStop [Pace(1975)]Pace_1975 author author C. N. Pace, @noop journal journal CRC Crit Rev Biochem volume 3, pages 1 (year 1975)NoStop [Schellman(1978)]Schellman_1978 author author J. A. Schellman, https://onlinelibrary.wiley.com/doi/abs/10.1002/bip.1978.360170515 journal journal Biopolymers volume 17, pages 1305 (year 1978)NoStop [Heyda and Dzubiella(2014)]Heyda_2014 author author J. Heyda and author J. Dzubiella, https://doi.org/10.1021/jp5041635 journal journal The Journal of Physical Chemistry B volume 118, pages 10979 (year 2014)NoStop [Elancheliyan et al.(2022)Elancheliyan, Del Monte, Chauveau, Sennato, Zaccarelli, and Truzzolillo]Emanuela author author R. Elancheliyan, author G. Del Monte, author E. Chauveau, author S. Sennato, author E. Zaccarelli, and author D. Truzzolillo, 10.1021/acs.macromol.2c00995 journal journal Macromolecules volume 55, pages 7526 (year 2022)NoStop [Fernandez-Rodriguez et al.(2023)Fernandez-Rodriguez, Orozco-Barrera, Sun, Gámez, Caro, García-Martín, and Rica]Fernandez-Rodriguez_2023 author author M. A. Fernandez-Rodriguez, author S. Orozco-Barrera, author W. Sun, author F. Gámez, author C. Caro, author M. L. García-Martín, and author R. A. Rica, https://doi.org/10.1002/smll.202301653 journal journal Small volume n/a, pages 2301653 (year 2023)NoStop [Langmuir(1918)]langmuir author author I. Langmuir, 10.1021/ja02242a004 journal journal Journal of the American Chemical Society volume 40, pages 1361 (year 1918)NoStop [Bateman(1910)]Bateman_1910 author author H. Bateman, @noop journal journal Proc. Cambridge Philos. Soc volume 15, pages 423 (year 1910)NoStop [Doi and Edwards(1988)]doi author author M. Doi and author S. F. Edwards, @noop title The Theory of Polymer Dynamics (publisher Oxford University Press, year 1988)NoStop [Risken(1996)]risken author author H. Risken, @noop title The Fokker-Planck equation (publisher Springer, year 1996)NoStop [Holubec et al.(2019)Holubec, Kroy, and Steffenoni]Holubec_2019 author author V. Holubec, author K. Kroy, and author S. Steffenoni, https://doi.org/10.1103 journal Physical Review E volume 99 (year 2019)NoStop [Kramers(1940)]Kramers_1940 author author H. Kramers, https://doi.org/10.1016/S0031-8914(40)90098-2 journal journal Physica volume 7, pages 284 (year 1940)NoStop [Hänggi et al.(1990)Hänggi, Talkner, and Borkovec]RevModPhys.62.251 author author P. Hänggi, author P. Talkner, and author M. Borkovec, 10.1103/RevModPhys.62.251 journal journal Rev. Mod. Phys. volume 62, pages 251 (year 1990)NoStop [Kariyawasam et al.(2020)Kariyawasam, Kron, Jiang, Sommer, and Hartley]Kariyawasam_2020 author author L. S. Kariyawasam, author J. C. Kron, author R. Jiang, author A. J. Sommer, and author C. S. Hartley, https://doi.org/10.1021/acs.joc.9b02746 journal journal The Journal of Organic Chemistry volume 85, pages 682 (year 2020)NoStop [Williams and Ibrahim(1981)]Williams_1981 author author A. Williams and author I. T. Ibrahim, https://doi.org/10.1021/ja00414a011 journal journal Journal of the American Chemical Society volume 103, pages 7090 (year 1981)NoStop [Woodruff et al.(1972)Woodruff, Peck, and Banker]Woodruff_1972 author author C. W. Woodruff, author G. E. Peck, and author G. S. Banker, https://www.sciencedirect.com/science/article/pii/S0022354915387694 journal journal Journal of Pharmaceutical Sciences volume 61, pages 1916 (year 1972)NoStop [Deng and Walther(2021)]Deng_2021 author author J. Deng and author A. Walther, https://doi.org/10.1038/s41467-021-25450-5 journal journal Nature Communications volume 12, pages 5132 (year 2021)NoStop [Li and Siegel(2000)]Li2000 author author B. Li and author R. A. Siegel, 10.1063/1.1286998 journal journal Chaos volume 10, pages 682 (year 2000)NoStop [Bell et al.(2021)Bell, Felder, von Westarp, and Wessling]Bell2021a author author D. J. Bell, author D. Felder, author W. G. von Westarp, and author M. Wessling, 10.1039/D0SM01548B journal journal Soft Matter volume 17, pages 592 (year 2021)NoStop [Jain and Ravoo(2021)]Jain_2021 author author M. Jain and author B. J. Ravoo, https://onlinelibrary.wiley.com/doi/abs/10.1002/anie.202107917 journal journal Angewandte Chemie International Edition volume 60, pages 21062 (year 2021)NoStop [Milster et al.(2023)Milster, Göth, Darwish, and Dzubiella]Abeer author author S. Milster, author N. Göth, author A. Darwish, and author J. Dzubiella, @noop journal journal preprint volume xx, pages xxxxxx (year 2023)NoStop
http://arxiv.org/abs/2306.05964v1	20230609153320	Low-temperature Holographic Screens Correspond to Einstein-Rosen Bridges	[ "Marco Alberto Javarone" ]	hep-th	[ "hep-th" ]	Quantum Calculation of Classical Kinetic Equations: A Novel Approach for Numerical Analysis of 6D Boltzmann-Maxwell Equations in Collisionless Plasmas Using Quantum Computing A. Yoshikawa July 31, 2023 ============================================================================================================================================================================== § INTRODUCTION Eternal black holes <cit.> contain Einstein-Rosen bridges (ERB), i.e. wormholes able to connect very distant universes. Such property makes wormholes particularly fascinating, as reflected in an interest not limited to the scientific community, e.g. plots of some fantasy novels mention ERBs and similar structures. These bridges, anchored to entangled surface areas, are likely related to the phenomenon of entanglement, as suggested by the ER = EPR conjecture <cit.>. The latter states that an ERB underlies the connection between entangled particles —see also <cit.>. In addition, recent investigations <cit.> claim that ERBs are deeply related to the computational complexity (hereinafter just complexity) of black holes. As known in Information Theory and related domains, complexity measures quantify the resources required to accomplish a task, e.g. the time an algorithm takes to complete a computation. Studying black holes via the GaugeGravity duality framework <cit.>, their complexity can be identified by looking at their dual (i.e. holographic) quantum systems. Accordingly, given two systems dual to each other, e.g. a Qubit collection and a black hole, an increase in complexity in one system is accompanied by an increase in complexity in the other. The complexity of the Qubit collection can increase by processing Qubits through a quantum circuit. Instead, the complexity of a black hole is supposed to grow during its evolution. Therefore, a measure of complexity describing the quantum system should have a corresponding (i.e. dual) complexity measure in the Anti-de-Sitter (AdS) space, which must relate to the evolution of the black hole. Among the possible AdS candidates for manifesting such complexity, we find some properties of the ERB, e.g. the ERB length <cit.>, the ERB volume <cit.>, and the Wheeler-DeWitt (WDW) action <cit.>. Now, the evolution of a physical system occurs during a time interval, typically ranging from a given instant, say t_0, to another time t > t_0 that, for some systems, may correspond to an equilibrium (or steady) state. Yet, to study the evolution of black holes, we need to go beyond the classical perspective, which describes them as static objects and find a suitable time interval. In these objects, the definition of a state of equilibrium is far from trivial thus, to find a meaningful time interval for studying their evolution, we may refer to the scrambling process <cit.>. The latter constitutes a sort of thermalisation process, albeit the two processes are different. Accordingly, we can study black hole dynamics from their formation to the end of the scrambling process. In this regard, authors of <cit.> suggest that, since black holes are the fastest scramblers in the universe, they are also the fastest computers. Such a remarkable claim aligns with the core message of the 'It from Qubit' slogan <cit.> at the base of a fruitful research direction. In this work, we focus on the complexity of ERBs, aiming to shed light on their nature. To this end, we start analysing three possible classes of ERBs, defined according to computational properties. Such preliminary analysis, performed to get some insights into the considered system, is followed by the definition of a holographic description of the formation and growth of an ERB. The resulting model has a heuristic nature and assumes ERBs are responsible for entanglement <cit.> and transmission of information. More specifically, the proposed model refers to the dynamics of information encoded in a holographic screen, which is assumed to be composed of square cells as 'pixels' <cit.>, containing information about phenomena and structures manifesting in an AdS space. In doing so, we consider mapping the dynamics of correlated patterns emerging in the holographic screen to dynamics occurring in an Ising-like model. Following this idea, we describe the holographic screen as a structure endowed with a bi-dimensional lattice containing spins. Accordingly, in this picture, the spatial spin correlations emerging at low temperatures correspond to the formation of an ERB and support the related entanglement. Before proceeding, let us remark that assuming the holographic information gets encoded in the mentioned screen does not prevent the existence of additional screens carrying more copies of the same AdS phenomenon, albeit even encoded differently or related to other properties of the same system. Moreover, going to the behaviour of the spins, arranged in the holographic screen that we study, uncorrelated configurations dominate at high temperatures, under specific conditions <cit.>, both in the classical and quantum domain. Likewise, spins form configurations that minimise the free energy at low temperatures. Interestingly, the resulting dynamics allow us to relate the complexity of the spin model with the ERB volume, recovering the conjecture proposed in <cit.>. It is worth specifying that our attempt to represent ERB dynamics in terms of an Ising-like model relies on the plethora of phenomena this class of models allows studying, from phase transitions to information processing <cit.>. In addition, we remark that both scrambling and thermalisation lead to a system transformation, albeit at different time scales. Regarding this point, we show how to face this relevant criticality in the next sections. In summary, in light of the similarities and differences we identify between the (dual) ERB dynamics and an Ising model, we try to report relevant strengths and weaknesses of the proposed correspondence. To conclude, the remainder of the work is organised as follows. Section <ref> summarises essential concepts of quantum complexity and fundamental conjectures at the base of our model. Section <ref> presents some computational properties of ERBs. Then, Section <ref> describes our heuristic model. The manuscript ends with observations and potential developments in Section <ref>. § COMPLEXITY AND EVOLUTION In general, complexity quantifies the difficulty of a task, e.g. in performing a transformation. Considering a physical system whose possible states (or configurations) form a phase space, a transformation traces a path in such space and the related complexity is proportional to the length of the path. Taking two points of phase space, the higher the distance between them, the higher the complexity of the transformation connecting them <cit.>. Typically, in spontaneous transformations, paths correspond to geodesics between the initial and the final state. Also, the complexity of a transformation corresponds to the complexity of the final state, defined by taking as a reference the initial state. In this sense, complexity is a relative measure which allows us to compare more states by taking one as a reference —see <cit.> for additional details. These considerations also apply to black holes, namely their evolution must be accompanied by a growth of their complexity. Yet, computing the complexity of a black hole is far from trivial. Notwithstanding, a series of recent works (e.g. <cit.>) that rely on the gauge/gravity duality framework identify fascinating correspondences to perform this calculation. More in detail, these approaches consider quantum systems, described by state vectors, dual to black holes whose transformations can be realised via generic operators, e.g. quantum gates. For instance, a state vector \|phi⟩ representing a system with K Qubits evolves under the time operator U(t) = e^-iHt, i.e. \|ϕ_t⟩ = U\|ϕ_0⟩. In turn, the operator U can be decomposed into more simple operators, as U = g_x...g_1. Each simple operator g_i belongs to the collection of operators G, which we can use to build U, and may correspond to a quantum gate. For clarity, if an operator O_T can be decomposed as O_T = o_1 · o_0, then we assume that o_0 and o_1 are simpler than O_T. Given that U is a unitary transformation, the number of operators g_i we can use to build U has an upper bound. Accordingly, under this operator, a state vector \|ϕ⟩ has an upper bound in the complexity (i.e. C_max). By mapping operators to quantum gates, we can study quantum circuits able to transform collections of Qubits and measure the related growth in complexity. Hence, given a system with K Qubits, a quantum circuit has a computation rate C_r = K/Δ t. This rate corresponds to the number of quantum gates that can be processed in one interval of time (that can also be expressed as a thermal time Δ t = 1/T). Thus, after a time interval of length t, the complexity of the final quantum state reads C(t) = C_r t. A fundamental question addressed by Lloyd <cit.>, and adapted to the specific context in <cit.>, relates to the limits of computation of physical systems. These limits can, for instance, interest storage, resources, and processing units. For a quantum circuit with an energy E, there is a limit in the number of operations (i.e. gates) per second equal to d NrGates/dt≤2E/πħ. Interestingly, equation <ref> can be used even for studying the evolution of a quantum system dual to an eternal AdS-Schwarzschild black hole. To this end, we take two instants of time t_L and t_R, writing the state \|ϕ(t_L,t_R)⟩ as \|ϕ(t_L,t_R)⟩ = e^-i(H_Lt_L + H_Rt_R)\|TFD⟩ so that this state originates from \|TFD⟩ defined as \|TFD⟩ = Z^-1/2∑_α e^-β E_α/2\|E_α⟩_L\|E_α⟩_R where Z denotes the partition function, and TFD denotes the Thermofield-Double State (which is convenient to have two identical quantum mechanical systems <cit.>). In this system, the time evolution operator e^-i(H_Lt_L + H_Rt_R), in function of t_L and t_R (see Figure <ref>), allows \|TFD⟩ to evolve and such evolution gets reflected in the complexity of \|ϕ(t_L,t_R)⟩. Eventually, equation <ref> and the bound <ref> allow us to identify a black hole quantity dual to the complexity of the holographic quantum system. For more details see <cit.>. §.§ Complexity of Black Holes Recent works <cit.> present various correspondences for identifying the complexity of black holes. In these investigations, authors assume that at t=0, i.e. at the instant of formation, black holes are in the simplest possible state. The simplest quantum state corresponding to the newly formed black hole is \|ϕ(t_0)⟩ = \|000…0⟩. A suitable time interval for studying the evolution of the black hole goes from its formation (t_0) to the end of the scrambling process (t_s). Looking at the dual quantum system composed of K Qubits, once scrambling is completed, the complexity is C(t_s) = K log K. Assuming K is equal to S, i.e. the number of degrees of freedom of a black hole (namely its entropy), the complexity of the quantum system is C(t_s) = S log S. Notice that, according to equation <ref>, the complexity grows linearly <cit.> as C(t) = STt, and this trend can be approximated to C(t) ∼ St for low temperatures. These relationships, as briefly presented here, allow us to compute the complexity of black holes. In <cit.>, authors propose a conjecture named C = V, i.e. 'Complexity equals Volume' of the ERB, deriving the following equation C = V/l with l corresponding to some radius, such as the AdS radius and Schwarzschild radius. Here, we report only a few equations for connecting later our model to this discussion. In addition, from now on, if not stated otherwise, quantities are written adopting the natural units convention so that G= ħ = c = 1. Let us begin with the volume of the ERB V that, in a Schwarzschild metric, reads ds^2 = -f(r)dτ^2 + f(r)^-1dr^2 + r^2 dΩ_D-2^2 with f(r) = r^2 + 1 - 16 π M/(D-2)ω_D-2 r^D-3 and M mass of the black hole. As shown in <cit.>, the temporal variation of V is equal to dV/dτ = ω_D-2r^D-2√(\|f(r)\|) and the above quantity is maximised at a value of r defined as r_m, identified by a term v_D = ω_D-2r^D-2√(\|f(r_m)\|). Then, the volume V becomes V = v_D Δ t with an interval of time, Δ t, having a spacelike behaviour since related to the time 'inside' the black hole. Given the time variables t_R and t_L, related to the two universes I and III, respectively, the above time interval is Δ t = \|t_R + t_L\|. Eventually, the volume of the ERB connecting the sectors I and III in Figure <ref> reads V = v_D \|t_R + t_L\|. The v_D term contains the connection between the complexity of the dual quantum system and the ERB volume. In some conditions its value is v_D = 8π M l/D-2. Since M ∼ ST, i.e. the mass of the black hole is proportional to the product between its entropy S and temperature T, the correspondence C = V (see equation <ref>) is realised by equation <ref> as one can see comparing with equation <ref> and equation <ref>. A refinement to this correspondence led to the conjecture C = A, i.e. 'Complexity equals Action', introduced to reduce, as much as possible, the arbitrariness adopted for deriving the correspondences between complexity and physical quantities such as volumes or lengths. Finally, let us report a brief comment about the conjecture C=A. The latter is interesting as, in classical mechanics, the action is highly related to a transformation (or an evolution). For example, a classical action A_c for a simple Lagrangian L, composed only of a kinetic term T, is equivalent to A_c = ∫ dt L = ∫ dt T. So, a complexity growth corresponding to the evolution of a system described by the Lagrangian L can intuitively be associated with A_c/dt, since dA_c/dt = T. In light of this observation, the bound in equation <ref> could find its roots in foundational relationships of mechanics. § COMPLEXITY OF EINSTEIN-ROSEN BRIDGES In this section, we present some observations on the computational complexity of Einstein-Rosen bridges. Let us recall that these structures are supposed to connect distant locations, and their surface areas are entangled. Accordingly, information should get transmitted through them. Now, since the Gauge/Gravity duality plays a fundamental role in computing the complexity of objects in the AdS spacetime, we need to identify a suitable dual quantum system for an ERB. Such a dual system, whose evolution must reflect the growth of the associated structure (i.e. the ERB), has to support the transmission of information, i.e. to work like a circuit or communication channel. Before proceedings, let us observe that, in principle, any path in an AdS space could have a dual quantum system. Yet, exceptions may show up for those paths that cannot be traversed by particles, e.g. due to causal structure constraints. Studying whether a dual system can or cannot exist is beyond the scope of this work. Here, we consider only paths related to ERBs —see the diagram in figure <ref>, i.e. paths corresponding to quantum systems connecting the configuration a black hole area has in the universe I with that a black hole area has in the universe III. Then, as mentioned, these quantum systems are represented as circuits. §.§ Complexity of ERB Circuits As mentioned before, computing the complexity of a state requires identifying a reference state <cit.>. So, taking as reference the Qubit configuration dual to an eternal black hole at the instant of formation (i.e. t = t_0), we can classify an ERB according to the following classes: * Paths of decreasing complexity; * Paths whose complexity remains invariant; * Paths of increasing complexity. Note that at t > 0, from the point of view of the black hole surface in the universe I, the ERB corresponds to a circuit whose complexity is always C > 0. That is motivated once we relate the complexity of a path with its length. Also, in mapping paths to circuits, a path with no complexity (i.e. C = 0) corresponds to a circuit composed of buffers, as the input is equivalent to the output. Then, in light of these three classes, we aim to find the most suitable one for an ERB able to support the entanglement. §.§.§ ERB case (1) In geometrical terms, an ERB path of decreasing complexity corresponds to a path going towards the black hole's origin (i.e. at t = t_0). Thus, assuming that the back hole evolution occurs only along the time direction, getting closer to its origin is equivalent to travelling back in time. Remarkably, particles as electrons can do that <cit.>. Consequently, a quantum observer could, in principle, accept such an implication. Let us identify the following quantum circuits: c_erb, c_I, and c_III. The first one, i.e. c_erb, corresponds to an ERB. The two additional circuits correspond to the paths from the black hole origin (at t_0) to the black holes in the universe I and III, respectively. All these circuits are reversible <cit.>, so we can write the following equivalences: c_III = c_erb∘ c_I c_III∘ c_I^-1 = c_erb∘ c_I∘ c_I^-1 c_erb = c_III∘ c_I^-1 where c_I^-1 denotes the inverse circuit c_I. Therefore, as \|ϕ_0⟩ = c_I^-1(\|ϕ_t⟩), with \|ϕ⟩ representing the Qubit collection dual to a black hole, an ERB of decreasing complexity entails travelling back to the origin and then evolving to the opposite equivalent black hole in the other universe. §.§.§ ERB case (2) Here, we consider an ERB path whose complexity does not change over time, namely dC/dt = 0. We recall that, inside the black hole, time has a space-like nature, and the complexity is computed by taking as reference the state of black hole formation. The circuit dual to such path generates a sequence of quantum configurations having the same complexity as those corresponding to the black holes in universes I and III, respectively. Indeed, the input, output and intermediate configurations along the path do not need to be the same. Yet, these have the same complexity in relation to the state of reference. To clarify this point, black hole configurations can be thought of as leaves of an evolutionary tree, so having the same complexity from the root (i.e. black hole at t=t_0) entails being at same the level in the tree <cit.>. In geometrical terms, this path goes along an arc of the circumference at a fixed distance from the origin —see <ref>. The black hole complexity, as computed in <cit.>, is proportional to C ∼ (t_L + t_R) · S. In the middle of this hypothetical ERB, assuming t = t_L = t_R, the complexity is about C_1/2ERB∼ t · S, with t the time the black hole has evolved since its formation (by setting t_0 = 0). Moreover, the 'external observer' located in the universe I (or III) would measure an increase of complexity along the ERB, though along a path which is not geodesic towards the entangled black hole. As we mentioned, the ERB would be along the arc of circumference connecting the two black hole areas, so the rope between them is shorter than such an arc. Therefore, assuming the principle of minimum action holds in this physical system, no spontaneous evolution may occur along an ERB whose complexity does not change from the point of view of the observer located at the origin. To conclude, this path may exist even if, given the reason above-mentioned and further considerations below discussed, we discard this possibility. §.§.§ ERB case (3) Finally, before considering an ERB path of increasing complexity, we recall that the C=V conjecture <cit.> states that the increase in the black hole complexity is proportional to the growth of its ERB. Thus, a constant surface area of the black hole implies the ERB becomes longer. Consequently, a quantum circuit dual to this special ERB is a circuit of increasing length. For instance, we can imagine a circuit whose amount of gates increases over time. Interestingly, this scenario can be described as a sort of thermodynamic limit for getting out from such an ERB due to a continuously growing length. In addition, after a huge time interval, the configuration processed by this quantum circuit would reach a maximum value so, as described in <cit.>, its complexity would drop down. The time scale for completing this process is proportional to e^e^S (where S denotes the black hole entropy). To conclude, a thermodynamic limit in the traversability of an ERB would not be too surprising. However, we discard this option since the time scales for connecting the two areas are so high that the path could be similar to the one connecting universes I and III travelling outside the black hole. After discussing these three possibilities, we suggest that the case (1), i.e. paths of decreasing complexity constitutes the more suitable option for representing an ERB. Also, we remark that paths (2) and (3) are affected by an additional physical constraint, i.e. they would cross the coordinate r=0 shown in figure <ref> and, in addition, would entail travelling in the future and then going back to the present time. Eventually, in agreement with the above observations, we propose a heuristic model to describe the emergence of entangled surface areas in the AdS space from an eternal black hole. Our model shows the formation of an ERB whose structure cannot be preserved forever, i.e. it has a temporary nature, in line with the phenomenon of entanglement. For these reasons, the proposed model is complementary to that proposed in <cit.>, which refers to a quantum circuit. Notice that the proposed model aims to represent the dynamics of information encoded in one holographic screen located at the boundary of an AdS space, among the others which contain information about AdS Physics. § TOWARDS A HOLOGRAPHIC ERB MODEL As described before, according to <cit.>, the complexity of a black hole increases while scrambling. That seems intuitive in light of <cit.>, considering that this process entails a transformation. Notably, any transformation changing (the state vector of) a quantum system implies a variation in complexity. Hence, if a quantum system constitutes the holographic dual of a black hole, any complexity growth in the former leads to a complexity growth in the latter and vice versa. Moreover, the scrambling of a black hole, from the point of view of a dual Qubit collection starting in the state \|ϕ⟩ = \|000...0⟩, resembles an order-disorder phase transition from an ordered configuration to a disordered one. Similarly, in some spin systems, such as the Ising model with ferromagnetic interactions, the above transition occurs when the temperature initially low heats up to values higher than the critical one (T_c). For clarity, scrambling is not an order-disorder phase transition. Yet, considering a dual Qubit collection, the latter and the Ising model may describe different properties of the same phenomenon. More specifically, scrambling is related to a transformation occurring in the dual quantum system, leading simple configurations to become (more) complex configurations. Also, according to the central dogma of black holes, it takes place inside them. For that reason, in the time interval going from black hole formation t_0 to the end of the scrambling t_s, we suggest that a phenomenon similar to order-disorder phase transition takes place on a holographic screen. In this regard, we propose an Ising-like model with a complexity equivalent to that computed in <cit.>, whose spin correlation may be related to the entanglement between surfaces anchored to an ERB. We finally remark that the proposed model agrees with the hypothesis (1), previously discussed, concerning the complexity classes of ERBs. §.§ Structure of the Holographic Screen As hypothesised in <cit.>, a holographic screen contains information related to the physics occurring in an AdS space. The holographic encoding is redundant and non-local, so building a whole system requires more screens. Here, we focus on the properties of a single screen, assuming it contains only the information related to some properties of an ERB as those to support the black hole entanglement. The considered screen is composed of cells, as pixels, each of size l_p · l_p (l_p Planck length), and contains an amount of information corresponding to that of a spin particle σ. For simplicity, we place a spin on each cell of the screen. The emerging structure resembles a bi-dimensional spin-lattice, corresponding to an Ising model in dimension D=2 —see panel a) in Figure <ref>. We assume the screen can be described as a thermodynamic system, so we identify variables such as temperature. In agreement with that, spins fluctuate and form various patterns. Here, a holographic screen with ferromagnetic interactions and a non-uniform temperature can show clusters of aligned spins. Yet, an overall high temperature would result in a global spin distribution showing mostly disordered patterns. Including non-ferromagnetic interactions, ordered patterns cannot form. Yet, at low temperatures, those patterns minimising the free energy of the system show up. In this picture, we consider a subset of spins organised into a column on the screen whose interactions are ferromagnetic. These spins constitute the dual of an AdS eternal black hole and, for being congruent with the dynamics of the Qubit collection in <cit.>, at t=t_0, they are in the state of minimum energy (e.g. all spins equal σ = +1) —see Figure <ref>. At this point, to observe correlated spins across the screen, the temperature must be lower than the critical one T_c. If that condition is non-permanent, the black hole configuration and the dual ERB we are building cannot last forever. That seems coherent with the non-permanent nature of entanglement (see e.g. <cit.>). Following this description, the dynamics of the information encoded as spin patterns, dual to the ERB, can be studied via an Ising model. The latter, for clarity, here includes both ferromagnetic and non-ferromagnetic interactions. §.§ Spin Lattice - ERB Duality We consider an Ising model with the following Hamiltonian H = - ∑_i,j^N,N J σ_i σ_j where J denotes the interaction term between spins σ_i and σ_j. For simplicity, in equation <ref>, additional terms such as external fields are omitted. The holographic dual of the black hole, i.e. the collection of spins, is identified via a spatial coordinate (x_0) on the screen. Thus, starting from x_0, at low temperatures, a growing set of correlated spins spreading on both sides of the screen emerges —see panel b of Figure <ref>). Also, as the temperature approaches the critical value T_c, the correlation length ζ grows till diverging at infinity, following a behaviour described by ζ = \|τ\|^-ν where ν denotes the critical exponent and a τ dimensionless parameter defined τ = T - T_c/T_c. The spatial correlation between spin pairs reads ⟨σ_0 σ_x ⟩∼ e^-x/ζ where x represents the spatial distance on the lattice between spins. We recall that cells, or pixels, which contain spins have a size proportional to l_p, equal to a discrete time interval. Therefore, the amount of time the (column of) spins needs to correlate in both directions can be derived by dividing the maximum spatial distance reached at time t, say L_max obtained via equation <ref> by l_p, so that t_max = L_max / l_p where L_max is obtained for the highest x such that ⟨σ_0 σ_x ⟩∼ 1. Following the above description, we argue that the spatial correlation of spins propagating through the two sides of a screen corresponds to the formation of the ERB volume. As defined in equation <ref>, this volume results from the surface entropy S correlated with an increasing amount of patterns (in both directions, i.e. left and right) over a time of duration \|t_L + t_R\|. At this point, there are some aspects to clarify. Firstly, we assume the temperature fluctuation on the screen involves an increasing number of spins. That is possible by a fluctuation spreading at a given speed over the screen. That can fix a fundamental issue, i.e. thermalisation is faster than scrambling. The former occurs within a time proportional to 1/T <cit.>. However, here, thermalisation takes place on an increasing spatial scale. In doing so, uncorrelated spins on the lattice thermalise to correlated patterns as soon as the portion of the screen where they are localised is affected by the temperature fluctuation. For clarity, we assume that the mentioned temperature fluctuation, responsible for reducing the average screen temperature, spreads according to a time scale compatible with the time scale of scrambling. Hence, after that amount of time, high temperatures restore the thermodynamic conditions on the screen, and the spin correlations vanish. Eventually, assuming a quantum Ising-like model on the holographic screen, the entanglement entropy can be quantified by a universal formula <cit.>: EE = q/3log (ζ/l_p) that applies to one-dimensional spin chains. In this regard, note that by considering only the entanglement between pairs of spins forming the two entangled black holes <cit.>, i.e. that in the universe I and that in III, equation <ref> might also work for the system we are considering. Following the above assumption and elaborating equation <ref> with some fixed numerical values (q = l_p = 1, where q denotes the central charge), we get an entanglement entropy proportional to the logarithm of ζ, i.e. EE = 1/3log(ζ), such that EE > 0 at low temperatures. In doing so, if each pattern on the screen corresponds, i.e. constitutes the holographic dual, to a black hole surface, according to the described Ising-like mechanism an 'external observer' can measure non-local correlations. §.§ Complexity of the Dual Spin Model As reported, complexity quantifies the minimum number of transformations required for obtaining a specific state or configuration starting from one of reference. In our case, the latter lies on the screen and has spatial coordinate x_0. So, we can calculate the number of transformations occurring from x_0 to L_max on both sides due to the spreading of the temperature fluctuation that reduces the screen temperature locally. The column pattern located at L_max contains the sequence of spins {σ_0,L_max,...,σ_S,L_max}, whose indices denote the spatial coordinates of cells in the lattice. The spin collection at L_max, initially in a random configuration, fluctuates from one state to another. All these variations are not related to the final sequence. However, once the low-temperature fluctuation gets closer and the nearest spin column correlates with that at the origin x_0, spins at L_max align according to the related interactions. Here, calculating the number of transformations is recursive and leads to a complexity equal to C = 2S · t_max. The factor 2 in the above equation <ref> reflects the complexity or the number of transformations required to cover both sides of the screen from x_0 to L_max. According to the conjecture C = V, the ERB volume reads V = S \|t_L + t_R\|. Thus, we obtain a perfect match with V by setting \|t_L\| = \|t_R\| = t(T;v_T). More in detail, we find that equation <ref> is equivalent with equation <ref>. The time t(T;v_T) is related to the number of patterns correlating with the original one. In addition, t(T;v_T) depends on the screen temperature (or of a portion of it) T that is reached by the spreading of the fluctuation at a speed v_T. The closer the temperature to the critical value T_c, the longer the time interval and then the higher the volume of the ERB. At a specific instant and temperature, the time \|t_L\|+\|t_R\| reflects the length spanned by the spatial correlation from the beginning of the process. Also, as mentioned, the low temperature does not remain fixed and tends to increase hence, at some point, the spatial correlation reduces. That implies the entanglement between the two surface areas vanishes as well as the ERB. These special paths would allow travelling between very distant universes in an extremely brief time. That consideration holds for an 'external observer' whose spatial length of the entanglement encodes in the spatial correlation on the holographic spin lattice. An 'inner observer' (i.e. inside the black hole) has a time interval equal to the spatial correlation divided by l_p, whereas an 'external observer' only measures, in one instant of time, a spatial correlation up to a distance 2 L_max. To summarise, the complexity of the spin model on the holographic screen equals the volume of the ERB (once parameters are converted as described). In particular, the whole complexity grows as C(t) = S · t, i.e. from t_0 until the maximum t allowed by the screen temperature fluctuation. Eventually, in <cit.>, authors state that when a black hole forms, 'it does not begin its life in a random state'. Similarly, we start with a simple ordered spin configuration assuming that, in that area, the temperature is much lower than the T_c. To conclude, we highlight that the proposed model performs a thermalisation beyond describing the emergence of a spatial correlation dual to the ERB entanglement. A thermalisation occurs as spin columns close to the one in x_0 tend to correlate with it (according to the sign of interactions) by undergoing a process that conceptually resembles scrambling, i.e. expected to happen in the AdS black hole. Also, looking at the correlated patterns emerging during the process, we observe a transition from order, identified at x_0, to disorder, then recovering the Qubit dynamics described in <cit.>. § DISCUSSION AND CONCLUSION The evolution of eternal black holes is associated with the emergence of Einstein-Rosen bridges that, according to recent investigations <cit.>, reflect the complexity of these massive objects. More in detail, the growth of complexity <cit.> in black holes, identified via the GaugeGravity duality, describes their evolution. As conjectured in <cit.>, ERBs could be responsible for entanglement at a more general level, e.g. between two particles. Therefore, understanding the holographic conditions and mechanisms underlying their formation and growth is of paramount relevance. Here, we focus on the computational properties of ERBs. To this end, we start with a preliminary analysis for studying the complexity of paths connecting two entangled black holes. Resulting observations suggest that these paths should have a decreasing complexity (with reference to the black hole origin). Then, in accordance with that and the related implications, we propose a heuristic model for the formation and evolution of an ERB. More specifically, our model represents the dynamics of information on a holographic screen. Before proceeding, we highlight that ERBs of decreasing complexity should have a holographic dual able to process and restore the configurations of a state vector, resembling the dynamics of travelling backwards in time <cit.>. Moreover, we recall that models exploiting quantum circuits may benefit from the fact quantum gates are reversible <cit.>, albeit that is far from trivial. Thus, to address the described phenomenon, we study the dynamics of an Ising-like model assuming a collection of spins arranged in the cells which compose a holographic screen. In doing so, the overall system resembles a bi-dimensional lattice, whose dynamics model information is encoded in a screen. Then, we define some conditions, such as specific thermodynamic properties, to let the spin model evolve at low and high temperatures, forming correlated patterns of various sizes. Interestingly, we find that the complexity of the process underlying the formation of the correlated spin patterns is the same as the volume of the ERB. That connects our work with previous investigations as <cit.>. Also, the model dynamics can be related to those described in <cit.>, suggesting that the information on holographic screens reflects into the AdS space and may act as memory storage. Notwithstanding, our proposal has some points requiring clarification. To cite a few, the mechanism underlying the screen temperature, especially its fluctuations and how these propagate, the topological spin organisation, and the distribution of interactions. Shortly, additional work is mandatory to corroborate the validity of our model that, as shown in figure <ref>, can be seen as complementary with that proposed in <cit.>. In addition, we remark on the connection of the dynamics here illustrated with entanglement since, as suggested in <cit.>, this phenomenon could rely on wormholes. More specifically, the proposed model could connect entanglement with low-temperature holographic screens. Yet, as above-mentioned, these observations and speculations require further attention. Before concluding, we recall one of our initial questions in this work relates to the suitability of an Ising-like model for describing a dual holographic system of an ERB. Beyond any required additional investigation, some observations suggest a positive answer. To motivate the above comment, we highlight the following points. Firstly, we emphasise that the complexity of the proposed model, i.e. equation <ref>, corresponds to the complexity in equation <ref> and are both identified at low temperatures. That confirms our model agrees with the C=V conjecture. Going further, the emerging correlation in the Ising model may reflect the emerging entanglement in the eternal black hole, both with a temporary nature (i.e. cannot last forever). Then, although scrambling and Ising thermalisation are different processes and occur at different time scales, they resemble each other. Also, here we try to fix this issue by assuming a temperature fluctuation spreading and lasting for an amount of time compatible with the time scale of scrambling. Eventually, the Qubit transformation described in <cit.> resembles an order-disorder phase transition. In our model, we can obtain a similar outcome by constraining positive interactions between spins at x_0 while allowing both ferromagnetic and non-ferromagnetic interactions among all the other screen cells. More specifically, while the spin pattern in x_0 is ordered, correlated patterns, showing up (at low temperatures) on both sides, are disordered due to the mixture of positive and negative interactions. We conclude by mentioning the dualities between some Ising models and gravity, reported in <cit.>, that corroborate the relevance of mappings like that we propose. In summary, in light of the above observations and limits, we deem our model deserves further attention, as it captures relevant aspects of ERBs and could stimulate novel ideas in this direction. MAJ wishes to thank Sebastian De Haro for his useful comments, Jay Armas for his advice, and Dominik Neuenfeld for the interesting discussions. The author is supported by the PNRR NQST (Code: PE23). 99 maldacena01 Maldacena, J.: Eternal black holes in Anti-de-Sitter. Journal of High Energy Physics, 04, 021, 2003 susskind06 Maldacena, J., Susskind, L.: Cool horizons for entangled black holes. Fortschritte der Physik, 61(9), 781-811, 2013 susskind05 Susskind, L.: Computational complexity and black hole horizons. Fortschritte der Physik, 64(1), 24-43, 2014 jensen01 Jensen, K, Karch, A.: Holographic dual of an Einstein-Podolsky-Rosen pair has a Wormhole. Physical Review Letters, 111, 211602, 2013 nogueira01 Nogueira,F.S., Banerjee, S., Dorband, M., Meyer, R., van den Brink, J., Erdmenger, J.: Geometric phases distinguish entangled states in wormhole quantum mechanics. Physical Review D, 105, L081903, 2022 susskind03 Susskind, L.: Addendum to computational complexity and black hole horizons. Fortschritte der Physik, 64(1), 44-48, 2016 susskind09 Stanford, D., Susskind, L.: Complexity and shock wave geometries. Physical Review D, 90, 126007, 2014 witten01 Witten,E.: Anti De Sitter Space And Holography. Adv.Theor.Math.Phys., 2, 253–291, 1998 witten02 Susskind, L., Witten, E.: The holographic bound in anti-de Sitter space. arxiv:hep-th/9805114, 1998 ramallo01 Ramallo, A.V.: Introduction to the AdSCFT correspondence. In Lectures on Particle Physics, Astrophysics and Cosmology, Springer, Cham, 411-474, 2015 susskind10 Brown, A.R., Roberts, D.A., Susskind, L., Swingle, B., Zhao, Y.: Holographic complexity equals bulk action? Physical Review Letters, 116, 191301, 2016 susskind11 Brown, A.R., Roberts, D.A., Susskind, L., Swingle, B., Zhao, Y.: Complexity, action, and black holes. Physical Review D, 93, 086006, 2016 lashkari01 Lashkari, N., Stanford, D., Hastings, M., Osborne, T., Hayden, P.: Towards the fast scrambling conjecture. Journal of High Energy Physics, 4, 1–33, 2013 deutsch01 Deutsch, D.: It from Qubit. Science & Ultimate Reality, Cambridge, 2003 maldacena02 Almheiri, A., Hartman, T., Maldacena, J., Shaghoulian, E., Tajdini, A.: The entropy of Hawking radiation. Reviews of Modern Physics, 93(3) 035002 2021 verlinde01 Verlinde, E.: On the Origin of Gravity and the Laws of Newton. Journal of High Energy Physics, 4, 1–27, 2011 zhang01 Zhang, G., Song, Z.: Topological characterization of extended quantum Ising models. Physical review letters, 115(17), 177204, 2015 vecsei01 Vecsei, P. M., Lado, J. L., Flindt, C.: Lee-Yang theory of the two-dimensional quantum Ising model. Phys. Rev. B, 106, 054402, 2022 nishimori01 Nishimori, H.: Statistical physics of spin glasses and information processing: an introduction. Clarendon Press, 111, 2001 javarone02 Javarone, M.A.: Complexity is a Matter of Distance. Physics Letters A, 479, 128926, 2023 haferkamp01 Haferkamp, J., Faist, P., Kothakonda, N.B., Eisert, J., Yunger Halpern, N.: Linear growth of quantum circuit complexity. Nature Physics, 18(5), 528–532, 2022 susskind12 Susskind, L., Zhao, Y. Complexity and momentum. Journal of High Energy Physics, 2021(3), 1–13, 2021 lloyd01 Lloyd, S.: Ultimate physical limits to computation. Nature, 406, 1047–1054, 2000 jefferson01 Jefferson, R. A., Myers, R. C.: Circuit complexity in quantum field theory. Journal of High Energy Physics, 10, 1–81, 2017 cottrell01 Cottrell, W., Freivogel, B., Hofman, D. M., Lokhande, S.F.: How to build the thermofield double state. Journal of High Energy Physics, 2, 1–43, 2019 chapman01 Chapman, S., Heller, M. P., Marrochio, H., Pastawski, F.: Toward a definition of complexity for quantum field theory states. Physical review letters, 120(12), 121602, 2018 khan01 Khan, R., Krishnan, C., Sharma, S. : Circuit complexity in fermionic field theory. Physical Review D, 98(12), 126001, 2018 susskind02 Brown, A. R., Susskind, L.: Second law of quantum complexity. Physical Review D, 97:8, 086015, 2018 banerjee01 Banerjee, R., Majhi, B.R.: Quantum tunneling beyond semiclassical approximation. Journal of High Energy Physics, 2008(06), 095, 2088 nielsen01 Nielsen, M.A., Chuang,I.: Quantum computation and quantum information. Cambridge University Press, 2010 wille01 Wille, R., Lye, A. Drechsler, R.: Considering nearest neighbor constraints of quantum circuits at the reversible circuit level. Quantum Inf Process, 13, 185–199, 2014 javarone01 Javarone, M.A., O' Connor J.A.: Dynamics of one-dimensional spin models under the line-graph operator. Proceedings of the Royal Society A, 477(2250), 20210282, 2021 nielsen02 Nielsen, M. A., Dowling, M. R., Gu, M., Doherty, A. C.: Quantum computation as geometry. Science, 311(5764), 1133–1135, 2006 lin01 Lin, S.Y., Hu, B.L.: Entanglement creation between two causally disconnected objects. Physical Review D, 81(4), 045019, 2010 calabrese01 Calabrese, P., Cardy, J.: Entanglement entropy and conformal field theory. Journal of physics a: mathematical and theoretical, 42(50), 504005, 2009 susskind_tele Susskind, L.: Copenhagen vs Everett, teleportation, and ER= EPR. Fortschritte der Physik, 64(6-7), 551–564, 2016 castro01 Castro, A., Gaberdiel, M. R., Hartman, T., Maloney, A., Volpato, R.: Gravity dual of the Ising model. Physical Review D, 85(2), 024032, 2012
http://arxiv.org/abs/2306.03933v2	20230606180103	High-dimensional and Permutation Invariant Anomaly Detection	[ "Vinicius Mikuni", "Benjamin Nachman" ]	hep-ph	[ "hep-ph", "cs.AI", "cs.LG", "hep-ex" ]	[email protected] National Energy Research Scientific Computing Center, Berkeley Lab, Berkeley, CA 94720, USA [email protected] Physics Division, Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA Berkeley Institute for Data Science, University of California, Berkeley, CA 94720, USA Methods for anomaly detection of new physics processes are often limited to low-dimensional spaces due to the difficulty of learning high-dimensional probability densities. Particularly at the constituent level, incorporating desirable properties such as permutation invariance and variable-length inputs becomes difficult within popular density estimation methods. In this work, we introduce a permutation-invariant density estimator for particle physics data based on diffusion models, specifically designed to handle variable-length inputs. We demonstrate the efficacy of our methodology by utilizing the learned density as a permutation-invariant anomaly detection score, effectively identifying jets with low likelihood under the background-only hypothesis. To validate our density estimation method, we investigate the ratio of learned densities and compare to those obtained by a supervised classification algorithm. High-dimensional and Permutation Invariant Anomaly Detection Benjamin Nachman July 31, 2023 ============================================================ § INTRODUCTION Anomaly detection (AD) has emerged as a complementary strategy to classical model-dependent searches for new particles at the Large Hadron Collider and elsewhere. These tools are motivated by the current lack of excesses and the vast parameter space of possibilities <cit.>. Machine learning (ML) techniques are addressing these motivations and also allowing for complex particle physics data to be probed holistically in their natural high dimensionality <cit.>. Nearly all searches for new particles begin by positing a particular signal model, simulating the signal and relevant Standard Model (SM) backgrounds, and then training (with or without ML) a classifier to distinguish the signal and background simulations. Machine learning–based AD tries to assume as little as possible about the signal while also maintaining the ability to estimate the SM background. Two main classes of ML approaches are unsupervised and weakly/semi-supervised. Unsupervised methods use `no' information about the signal in training while weakly/semi-supervised methods use limited or noisy labels. The `no' is in quotes because there is often implicit signal information used through event and feature selection. At their core, unsupervised methods select events that are rare, while weakly/semi supervised methods focus on events that have a high likelihood ratio with respect to some reference(s). The first ML-based AD proposals in high energy physics explored both weakly/semi-supervised classifiers <cit.> as well as unsupervised learning via a type of ML tool called an autoencoder <cit.>. Since that time, there have been many proposals in the literature (see e.g. Ref. <cit.>), community challenges comparing a large number of approaches <cit.>, and first physics results using a variety of methods <cit.>. Even though a number of weakly supervised methods have statistical guarantees of optimality that unsupervised method lack <cit.>, there has been significant interest in unsupervised AD because of its flexibility. The flexibility of unsupervised learning leads to a number of challenges. There is no unique way to estimate the probability density of a given dataset, with some methods offering only an implicit approximation through proxy quantities like the reconstruction fidelity of compression algorithms. The probability density itself is not invariant under coordinate transformations, so the selected rare events will depend on the feature selection <cit.>. Even though particle physics data are often described by high- (and variable-)dimensional, permutation-invariant sets (`point clouds'), there has not yet been a proposal to use explicit density estimation techniques for AD that account for all of these properties. Implicit density estimation has been studied with a variety of high-dimensional, but mostly fixed-length representations, such as (variational) autoencoders and related approaches <cit.>. Since our validation protocol requires access to the density, we focus only on explicit methods. So far, the only[Except for Ref. <cit.>, which discretize the phase space and turn the problem into a multi-class classification task.] high-dimensional explicit density estimators in particle physics <cit.> have been based on normalizing flows <cit.>. These works process fixed-length and ordered inputs, but recent work has shown with higher-level observables how to accommodate variable-length and permutation invariance with normalizing flows <cit.>. However, variable-length is not a natural property for normalizing flows which are built on bijective maps from the data space to a fixed-length latent space. In contrast, a newer class of methods called score-matching or diffusion models do not have this restriction. These techniques estimate the gradient of the density instead of the density itself, and therefore have fewer restrictions than normalizing flows. Diffusion models have been shown to accurately model both high- <cit.> and/or variable- <cit.> dimensional feature spaces. Despite these early successes, such models have not been used yet for explicit density estimation in particle physics. We propose to use point cloud diffusion models combined with explicit density estimation for AD. Our approach is based on Ref. <cit.>, and inherits the ability to process variable-length and permutation-invariant sets. From the learned score function, we estimate the data density and provide results for two different diffusion models; one trained with standard score-matching objective and one trained using maximum likelihood estimation. Since the true density is not known, we quantify the performance of the density estimation with likelihood ratios. Finally, we demonstrate the performance of the density as an anomaly score for top quark jets as well as jets produced from dark showers in a hidden valley model. Other tasks that require access to the data density could also benefit from our method. This paper is organized as follows. Section <ref> introduces the methodology of maximum likelihood-based diffusion modeling for permutation-invariant density estimation. The datasets used for our numerical examples are presented in Sec. <ref> and the results themselves appear in Sec. <ref>. The paper ends with conclusions and outlook in Sec. <ref>. § SCORE MATCHING AND MAXIMUM LIKELIHOOD TRAINING OF DIFFUSION MODELS Score-based generative models are a class of generative algorithms that aim to generate data by learning the score function, or gradients of the logarithm of the probability density of the data. The training strategy presented in Ref. <cit.> introduces the idea of denoising score-matching, where data can be perturbed by a smearing function and matching the score of the smeared data is equivalent to matching the score of the smearing function Ref. <cit.>. Given some high-dimensional distribution ∈ℝ^D, the score function we want to approximate, ∇_𝐱log p_data, with ∼ p_data, is obtained by minimizing the following quantity 1/2𝔼_t𝔼_p_t() [ λ(t)𝐬_θ(_𝐭,t) - ∇__𝐭log p_t(_t\|x_0) ^2_2 ]. The goal of a neural network 𝐬_θ(_𝐭,t) with trainable parameters θ and evaluated with data _t that have been perturbed at time t is to give a time-dependent approximation of the score function. The time dependence of the score function is introduced to address the different levels of perturbation used in each time step. At times near 0, at the beginning of the diffusion process ((0) := _0 :=), the smearing applied to data is small, gradually increasing as time increases and ensures that at longer time scales the distribution is completely overridden by noise. Similarly, the positive weighing function λ(t) can be chosen independently and determines the relative importance of the score-matching loss at different time scales. The score function of the perturbed data is calculated by using a Gaussian perturbation kernel p_σ(x̃\|x):=𝒩(,σ^2) and p_σ():=∫ p_data()p_σ(𝐱̃\|𝐱)𝐝𝐱, simplifying the last term of Eq. <ref> ∇_log p_σ(\|) = -/σ^2∼𝒩(0,1)/σ. The learned approximation to the score function can then be used to recover the data probability density by solving the following equation: log p_0(_0) = log p_T(_T) + ∫_0^T ∇·𝐟̃_θ(_t,t)dt, with 𝐟̃_θ(_t,t) = [f(t)_t -1/2g(t)^2s_θ(_t,t)]. The drift (f) and diffusion (g) coefficients are associated with the parameters of the Gaussian perturbation kernel. In our studies, we use the VPSDE <cit.> framework that defines f(t) = -1/2β(t) and g(t) = √(β(t)) with the parameter β(t) = β_min + t ( β_max - β_min) with β_min = 0.1 and β_max=20, resulting in the induced perturbation kernel 𝒩((0)e^-1/2∫_0^t β(s) ds, 1 - e^-∫_0^t β(s) ds) with (T):=(1)∼𝒩(0,1). To solve Eq. <ref>, we need to calculate the divergence of 𝐟̃_θ(_t,t), which is computationally expensive in high dimensions. Instead, we use the Skilling-Hutchinson trace estimation method <cit.>, reducing the overall computation to near linear complexity. While the estimation of the data probability density is independent from the choice of the weighing function λ(t) described in Eq. <ref>, different choices can enforce different properties to the learned score function. For example, a common choice is to set λ(t) = σ(t)^2, which avoids the last ratio in Eq. <ref> that diverges as σ(t)→ 0 at times near 0. On the other hand, Ref. <cit.> shows that choosing λ(t) = g(t)^2 turns the training objective in Eq. <ref> into an upper bound to the negative log-likelihood of the data, effectively allowing the maximum likelihood training of diffusion models and leading to more precise estimates of the data probability density. The negative aspect of this choice is that the lack of the multiplicative σ^2 term can lead to unstable training. This issue can be mitigated by using an importance sampling scheme that reduces the variance of the loss function. During the training of the likelihood weighted objective we implement the same importance sampling scheme as used in Ref. <cit.> while in the standard implementation the time component is sampled from an uniform distribution. § TOP QUARK TAGGING DATASET AND SEMI-VISIBLE JETS The top quark tagging dataset is the widely-used community standard benchmark from Ref. <cit.>. Events are simulated with Pythia 8 <cit.> and Delphes <cit.> (ATLAS card). The background consists of dijets produced via Quantum Chromodynamics (QCD) and the signal is top quark pair production with all-hadronic decays. The default energy flow algorithm in Delphes is used to create jet consituents, which are clustered using the anti-k_T algorithm with R=0.8. <cit.>. All jets in the range 550 GeV < p_T < 650 GeV and \|η\| < 2 are saved for processing. Each jet is represented with up to 200 constituents (zero-padded if fewer; truncated if more). In practice, supervised learning should be used to look for top quark jets[Top quark jet modeling has known inaccuracies, so there still may be utility in training directly with (unlabeled) data, but since it is possible to isolate relatively pure samples of top quark jets in data, this is far from `anomaly detection'.]. To illustrate the anomaly detection abilities of our approach, we also simulate jets produced from a dark shower within a hidden valley model <cit.>. Our dark showers are motivated by[In contrast to Ref. <cit.>, our mesons have much higher masses, which makes the substructure more non-trivial.] Ref. <cit.>, and consist of a Z' with a mass of 1.4 TeV that decays to two dark fermions charged under a strongly coupled U(1)'. These fermions have a mass of 75 GeV and hadronize into dark pion and ρ mesons, each of which can decay back to the Standard Model. The meson masses are 150 GeV, resulting in two-prong jet substructure. § RESULTS The network implementation and training scheme used to train the diffusion model are the same ones introduced in Ref. <cit.>, based on the DeepSets <cit.> architecture with Transformer layers <cit.>. This model is trained to learn the score function of the jet constituents in (Δη,Δϕ,log) coordinates, while conditioned to the overall jet kinematics described by (η_jet,mass,N_part), with the relative particle coordinates Δη = η_part - η_jet and Δϕ = ϕ_part - ϕ_jet, calculated with respect to the jet axis. The overall jet kinematic information is learned (simultaneously) by a second diffusion model as done in Ref. <cit.> using a model based on the ResNet <cit.> architecture. All features are first normalized to have mean zero and unit standard deviation before training. The probability density is calculated with Eq. <ref> using the Skilling-Hutchinson approximate trace estimation with random samples drawn from a normal distribution. The integral is solved using SciPy <cit.> with explicit Runge-Kutta method of order 5(4) <cit.> with absolute and relative tolerances of 10^-5 and 10^-4, respectively. Lower and higher values of the absolute and relative tolerances were tested with results remaining unchanged. First, we demonstrate the permutation invariance of the probability density by evaluating the estimated negative log-likelihood (nll) of the data, trained using exclusively QCD jets. We show a single jet using different permutations of the input particles. These results are presented in Figure. <ref>. Uncertainties are derived from the standard deviation of 10 independent estimations of the nll. Since the model was trained only on QCD jet events, the estimated nll tends to be lower for QCD jets compared to the other classes. This observation motivates the use of the nll as an anomaly score to identify jets with low likelihood. On the other hand, the varying particle multiplicity makes the comparison between jets with different number of constituents misleading. Since the densities are expected to be correctly normalized for each fixed value of the particle multiplicity, jets with higher number of particles will yield low probability densities regardless of the sample used during training. To account for this issue, we define the anomaly score as the negative log-likelihood divided by the particle multiplicity, similarly to the metric `bits per dimension', often used in the comparison of density estimation methods. We show the distribution of the anomaly score in Fig. <ref> for diffusion models trained exclusively on QCD jets and provide the distributions of the nll without the normalization factor in App. <ref>. The diffusion model training using maximum likelihood (λ(t) = g(t)^2) also presents, on average, lower anomaly score compared to the standard diffusion approach (λ(t) = σ(t)^2). With this choice of anomaly score, we investigate the the significance improvement characteristic curve (SIC), shown in Fig. <ref>. For both classes of anomalies we observe maximum values for the SIC curve above 1, supporting the choice of metric for anomaly detection. Conversely, the maximum-likelihood training results in slightly lower SIC curve for anomalous jets containing the decay products of top quarks. Similarly, we can train the diffusion model on a dataset containing only top quark initiated jets and evaluate the estimated anomaly score using different jet categories. The result is shown in Fig. <ref>. In this case, the anomaly score values for top quark initiated jets are lower on average compared to the other categories. A key challenge with unsupervised AD is how to compare different methods. Weakly supervised methods based on likelihood ratios can be compared with an optimal classifier using the same noisy label inputs <cit.> and they converge to the fully supervised classifier in the limit of large signal, independent of the signal properties. Unfortunately, there is no analog for this in the unsupervised case. The existing papers on unsupervised AD compare methods by demonstrating the performance on a (usually small) set of benchmark signal models, as we have also done in Fig. <ref>. However, this is a model-dependent comparison whose conclusions can easily be altered by simply changing the physics model(s) considered <cit.>. As the unsupervised AD hypothesis is that the new physics, if it exists, is rare given some set of coordinates, then one could instead directly compare the fidelity of the density estimation in the background-only case. Since the true probability density is unknown, this can be achieved using likelihood-ratio methods. Recent studies have used classifier-based likelihood ratio estimation to assess and/or improve deep generative models <cit.>. These classifiers are trained using samples drawn from the generative model and from the target dataset. As with the training of a Generative Adversarial Network (GAN) <cit.>, when the classifier is not able to distinguish the generative model and the target, then the generative model is accurate. Density estimators are a subclass of generative models and could be evaluated in this way. However, being able to effectively produce samples and being able to estimate the probability density are often at odds with each other and so it is desirable to have a comparison method that uses the probability density without relying on sampling. Following Ref. <cit.>, we use another approach that directly assesses the quality of explicit density-based AD methods. Given two samples (e.g. top quark and QCD jets), we take the ratio of learned densities (see also Ref. <cit.>) and compare the resulting score to a fully supervised classifier trained to distinguish the same two samples. The likelihood ratio is the optimal classifier <cit.> and if the density estimation is exactly correct and the classifier is optimal, then these two approaches should have the same performance. Training a supervised classifier is an easier problem (Ref. <cit.> versus Ref. <cit.>), so a reasonable approximation is that the classifier can be made nearly optimal. For the top-tagging dataset, this problem has already been studied extensively (see e.g. Ref. <cit.> and papers that cite it). This approach does depend on the samples used to estimate the likelihood ratio, but it is still a sensitive test to the density across the phase space. In Fig. <ref>, we calculate the receiver operating characteristic (ROC) curves obtained in the anomaly detection task using the anomaly score metric (nll divided by the number of particles). We also provide the ROC curves obtained using the log-likelihood ratio between two dedicated diffusion models, trained exclusively on QCD or top quark jets, and the one obtained from the outputs of a classifier. The classification network is trained using the same network architecture as the diffusion model for particle generation, with additional pooling operation after the last transformer layer, followed by a fully connected layer with LeakyRelu activation function and 128 hidden nodes. The output of the classifier is a single number with a Sigmoid activation function. The ROC curve obtained using the log-likelihood ratio has similar area under the curve (AUC) as the dedicated classifier, even though the performance still differs significantly in the whole true positive range. Similar results are found in Ref. <cit.>. This suggests that even though we are using a state-of-the-art density estimation strategy, there is still plenty of room to innovate in order to close the performing gap. Additionally, this illustrates the danger of relying only on AUC, since it may not be sensitive to tails of phase space relevant for AD. Similarly to the previous study, we only observe marginal differences between the results obtained from the different strategies used to train the diffusion model. In Table <ref>, we present a summary of the results consisting of the maximum SIC value, AUC for the anomaly detection task and supervised density estimation. § CONCLUSIONS AND OUTLOOK In this work we presented an unsupervised anomaly detection methodology based on diffusion models to perform density estimation. Our method approximates the score function to estimate the probability density of the data. The diffusion model is trained directly on low-level objects, represented by particles clustered inside jets. The model for the score function is equivariant with respect to permutations between particles, leading to a permutation invariant density estimation. We test different strategies to train the diffusion model, including a standard implementation and a maximum-likelihood training of the score model. The maximum-likelihood training presents on average a lower negative-log-likelihood, indicating improved probability density estimation. However, when applied for anomaly detection, we do not observe notable improvements. Additionally, we evaluate the density estimation performance by studying the log-likelihood ratio for two density estimators; one trained on QCD jet events and the other exclusively on top quark jet events. The dedicated classifier shows a better performance compared to the individual estimation of the log-likelihood ratio, indicating room for improvement. For future studies, we plan to investigate alternative diffusion strategies beyond our implementation to improve the density estimation. Those include high-order denoising score-matching <cit.> or using a learnable reweighing scheme presented in Ref. <cit.>, both showing promising density estimation performance. There may also be additional applications of high-dimensional, permutation-invariant density estimation beyond anomaly detection. § CODE AVAILABILITY The code for this paper can be found at <https://github.com/ViniciusMikuni/PermutationInvariantAD.git>. § ACKNOWLEDGMENTS We thank Julia Gonski and Manuel Sommerhalder for feedback on the manuscript. VM and BN are supported by the U.S. Department of Energy (DOE), Office of Science under contract DE-AC02-05CH11231. This research used resources of the National Energy Research Scientific Computing Center, a DOE Office of Science User Facility supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231 using NERSC award HEP-ERCAP0021099. apsrev4-1 § NEGATIVE LOG-LIKELIHOOD DISTRIBUTIONS We introduced the anomaly score used in this work as the negative log-likelihood normalized by the number of particles clustered in a jet. This normalization factor is used to improve the robustness of the anomaly detection task and avoid over-selecting jets with higher particle multiplicity as anomalous. In this section we show the distributions of the negative log-likelihood (nll) without the normalization factor. In Fig. <ref>, we show the nll for a model trained exclusively on QCD jets (left) or exclusively on top quark initiated jets (right). We observe that, without the normalization factor, QCD jets are always identified with lower nll while top-quark initiated jets always present higher nll and would be considered anomalous in both training scenarious.
http://arxiv.org/abs/2306.08992v1	20230615093611	On a kinematic proof of Andoyer variables canonicity	[ "Anatoly Neishtadt" ]	math.DS	[ "math.DS", "70E15, 70E17" ]	On a kinematic proof of Andoyer variables canonicity Anatoly Neishtadt ===================================================== We present a kinematic proof that the Andoyer variables in rigid body dynamics are canonical. This proof is based on the approach of “virtual rotations” by H. Andoyer. The difference from the original proof by Andoyer is that we do not assume that the fixed in body frame is the frame of principal moments of inertia, and do not use explicit formulas for the kinetic energy of the body. The proof implies that Andoyer variables are canonical for any fixed in body Cartesian coordinate frame. § INTRODUCTION The canonical Andoyer variables in rigid body dynamics were introduced by H. Andoyer in <cit.>. Wide use of these variables started after works of V.V. Beletskii <cit.>, who invented closely related variables, and A. Deprit <cit.>, who re-discovered the Andoyer variables and used them to represent the free rotation of rigid body in the phase plane. Andoyer proved that these variables are canonical using a kinematic approach based on “virtual rotations”. Deprit used formulas of spherical geometry in his proof that the variables are canonical. In this note we present a proof based on the original approach by Andoyer. Unlike <cit.> we do not assume that the fixed in body frame is the frame of principal moments of inertia. The proof implies that Andoyer variables are canonical for any fixed in body Cartesian coordinate frame. A review of works on canonical variables in rigid body dynamics prior to Andoyer's studies (F. J. Richelot (1850), J. A. Serret (1866), R. Radau (1869), F. Tisserand (1889)) is given in <cit.>. § COORDINATE FRAMES. DEFINITION OF THE ANDOYER VARIABLES Consider the classical problem of motion of a rigid body about a fixed point (e.g., <cit.>). Let OXYZ be an absolute Cartesian frame of references, Fig. <ref>, a. Let Oxyz be a fixed in body Cartesian frame (e.g., the frame of principal moments of inertia of the body for the point O as in <cit.>), Fig. <ref>, b. Denote G⃗ the angular momentum of the body. Define a Cartesian frame of reference Oξηζ as follows, Fig.1, a, b. Axis Oζ is directed along G⃗. Axis Oξ is in the plane OZζ. Axis Oη is orthogonal to the plane Oξζ. The canonical Andoyer variables are L,G,Θ, l,g, (we a use slightly modified notation from <cit.>). Angles l,g, are shown in Fig. <ref>, a, b, L is the projection of G⃗ onto axis Oz, G is the absolute value of G⃗, Θ is the projection of G⃗ onto axis OZ. Denote e⃗_X,e⃗_Y, e⃗_Z, e⃗_x,e⃗_y, e⃗_z and e⃗_1,e⃗_2, e⃗_3 unit coordinate vectors of frames OXYZ, Oxyz and Oξηζ, respectively. We denote a⃗·b⃗ and a⃗×b⃗ the scalar (“dot”) and the vector (“cross”) products of a⃗ and b⃗. § CANONICITY CONDITION Let q_1,q_2, q_3 be any generalised coordinates that characterise position of the frame Oxyz with respect to the absolute frame OXYZ (e.g., q_1,q_2, q_3 could be the Euler angles). The kinetic energy of the body T is a function of these coordinates and their velocities: T=T( q_1,q_2, q_3, q̇_1,q̇_2, q̇_3). Denote p_1,p_2, p_3 the momenta canonically conjugate to these coordinates, p_j= T/q̇_j, j=1,2,3. Then q_1,q_2, q_3,p_1,p_2, p_3 is a system of canonical variables for the considered problem. Express the Andoyer variables via q_1,q_2, q_3,p_1,p_2, p_3. To prove that this transformation is canonical we should check that (e.g., <cit.>, p. 241) p_1dq_1+p_2dq_2+p_3dq_3= Ldl+Gdg+Θ d . This would prove that the Andoyer variables are canonical. As it is traditional in Analytical Dynamics, consider the rigid body as a system of N material points. Let m_i, r⃗_i, i=1,2,…, N be masses and position vectors in the absolute frame of these points. Express position vectors via coordinates q_1,q_2, q_3: r_i=r_i(q_1,q_2, q_3). Then d r_i=∑_j=1^3r_i/ q_jd q_j, ṙ_̇i̇=∑_j=1^3r_i/ q_jq̇_j . and ṙ_̇i̇/q̇_j= r_i/ q_j (this is a standard relation used in derivation of the Lagrange equations from the D'Alembert principle, e.g., <cit.>, p. 20). The angular momentum G⃗ and the kinetic energy of the body T are G⃗= ∑_i=1^N m_i (r⃗_i ×ṙ_̇i̇), T=1/2∑_i=1^N m_i (ṙ_̇i̇·ṙ_̇i̇). Consider identities ∑_i=1^N m_i ṙ_̇i̇· d r_i=∑_i=1^N m_i ṙ_̇i̇·∑_j=1^3r_i/ q_jd q_j= ∑_i=1^N m_iṙ_̇i̇·∑_j=1^3ṙ_̇i̇/q̇_jd q_j =∑_j=1^3(∑_i=1^N m_i ṙ_̇i̇·ṙ_̇i̇/q̇_j)d q_j =∑_j=1^3/q̇_j (1/2∑_i=1^N m_i (ṙ_̇i̇·ṙ_̇i̇) )d q_j =∑_j=1^3 T/q̇_jd q_j= p_1dq_1+p_2dq_2+p_3dq_3. In view of (<ref>) this implies that to prove the canonicity of the Andoyer variables we have to show that ∑_i=1^N m_i ṙ_̇i̇· d r_i =Ldl+Gdg+Θ d . § THE CHECK OF CANONICITY CONDITION (<REF>) Express position vectors of material points via the Andoyer variables. Note that r_i depend on L, G,Θ via angles χ, ρ, L=Gcosχ, Θ=Gcosρ. Thus r_i=r_i (l,g,, χ, ρ), i=1,2. …, N. Calculate d r_i and substitute the obtained expressions into the left hand side of (<ref>). We get ∑_i=1^N m_i ṙ_̇i̇· d r_i =k_ldl+k_gdg+k_ d + k_χdχ+k_ρdρ with some coefficients k_l, k_g, …, k_ρ. Calculate these coefficients. Put dl=1 and give value 0 to all other differentials in the right hand side of (<ref>). Then dr⃗_i should be equal to the velocity of the point with the position vector r⃗_i when the rigid body rotates (counterclockwise) about the axis Oz with the angular speed 1: d r⃗_i=e⃗_z×r⃗_i. Then k_l=∑_i=1^N m_i ṙ_̇i̇· (e⃗_z×r⃗_i)= (∑_i=1^N m_i r⃗_i ×ṙ_̇i̇)·e⃗_z=G⃗·e⃗_z=L because L is the projection of G⃗ onto the axis Oz. Put dg=1 and give value 0 to all other differentials in the right hand side of (<ref>). Then dr⃗_i should be equal to the velocity of the point with the position vector r⃗_i when the rigid body rotates (counterclockwise) about the axis Oζ with the angular speed 1: d r⃗_i=e⃗_3×r⃗_i. Then k_g=∑_i=1^N m_i ṙ_̇i̇· (e⃗_3×r⃗_i)= (∑_i=1^N m_i r⃗_i ×ṙ_̇i̇)·e⃗_3=G⃗·e⃗_3=G because e⃗_3 is directed along G⃗. Put d=1 and give value 0 to all other differentials in the right hand side of (<ref>). Then dr⃗_i should be equal to the velocity of the point with the position vector r⃗_i when the rigid body rotates (counterclockwise) about the axis OZ with the angular speed 1: d r⃗_i=e⃗_Z×r⃗_i. Then k_=∑_i=1^N m_i ṙ_̇i̇· (e⃗_Z×r⃗_i)= (∑_i=1^N m_i r⃗_i ×ṙ_̇i̇)·e⃗_Z=G⃗·e⃗_Z=Θ because Θ is the projection of G⃗ onto the axis OZ. Put d χ=1 and give value 0 to all other differentials in the right hand side of (<ref>). Then dr⃗_i should be equal to the velocity of the point with the position vector r⃗_i when the rigid body rotates (counterclockwise) about the node line Oκ in Fig. <ref>, b with the angular speed 1: d r⃗_i=n⃗×r⃗_i, where n⃗ is the unit vector of the axis Oκ. Then k_χ=∑_i=1^N m_i ṙ_̇i̇· (n⃗×r⃗_i)= (∑_i=1^N m_i r⃗_i ×ṙ_̇i̇)·n⃗=G⃗·n⃗=0 because n⃗ is orthogonal to G⃗. Put d ρ=1 and give value 0 to all other differentials in the right hand side of (<ref>). Then dr⃗_i should be equal to the velocity of the point with the position vector r⃗_i when the rigid body rotates (counterclockwise) about the axis Oη with the angular speed 1: d r⃗_i=e⃗_2×r⃗_i. Then k_ρ=∑_i=1^N m_i ṙ_̇i̇· (e⃗_2 ×r⃗_i)= (∑_i=1^N m_i r⃗_i ×ṙ_̇i̇)·e⃗_2=G⃗·e⃗_2=0 because e⃗_2 is orthogonal to G⃗. Thus we have k_l=L, k_g=G, k_=Θ, k_χ=k_ρ=0. This proves the canonicity condition (<ref>). § CONLUSION A kinematic proof is given that the Andoyer variables in rigid body dynamics are canonical. The proof is based on the approach of “virtual rotations” by Andoyer. The difference from the original proof by Andoyer is that we do not assume that the fixed in body frame is the frame of principal moments of inertia, and do not use explicit formulas for the kinetic energy of the body. The proof shows that the Andoyer variables can be used for any fixed in body frame. Constructions by Andoyer and Deprit assume that the fixed in body frame is the frame of the principal moments of inertia. 99 andoyer_2015 Andoyer H. Sur les problèmes fondamenteaux de la mécanique céleste. Bull. Astron. Ser. I, 32, 5–18 (1915) andoyer_2023 Andoyer H. Cours de Mécanique Céleste, vol. I. Gauthier-Villars, Paris (1923) arn_1 Arnold V. I. Mathematical Methods of Classical Mechanics: Graduate Texts in Mathematics 60. Springer-Verlag, New York (1978) beletskii Beletskii V.V. Motion of an Artificial Satellite About Its Center of Mass. NASA TTF-429 (1966) deprit Deprit A. Free rotation of the rigid body studied in the phase plane. American Journal of Physics, 35, 424–428 (1967) efr Gurfil P., Elipe A., Tangren W., Efroimsky M. The Serret-Andoyer formalism in rigid-body dynamics: I. Symmetries and perturbations. Regular and Chaotic Dynamics, 12, 389–425 (2007) goldsteinGoldstein H., Poole C. P., Safko J. L. Classical Mechanics (3rd ed.). Addison-Wesley, Boston (2001) 5mm Anatoly Neishtadt Department of Mathematical Sciences Loughborough University, Loughborough LE11 3TU, United Kingdom E-mail: [email protected]
http://arxiv.org/abs/2306.17641v1	20230630133029	Molecular Dynamics Study of the Sonic Horizon of Microscopic Laval Nozzles	[ "Helmut Ortmayer", "Robert E. Zillich" ]	cond-mat.stat-mech	[ "cond-mat.stat-mech" ]	^1Institute for Theoretical Physics, Johannes Kepler University, Altenbergerstrasse 69, 4040 Linz, Austria ^2Primetals Technologies Austria GmbH, Turmstrasse 44, A-4031 Linz, Austria A Laval nozzle can accelerate expanding gas above supersonic velocities, while cooling the gas in the process. This work investigates this process for microscopic Laval nozzles by means of non-equilibrium molecular dynamics simulations of statioary flow, using grand canonical Monte-Carlo particle reservoirs. We study the expansion of a simple fluid, a mono-atomic gas interacting via a Lennard-Jones potential, through an idealized nozzle with atomically smooth walls. We obtain the thermodynamic state variables pressure, density, and temperature, but also the Knudsen number, speed of sound, velocity, and the corresponing Mach number of the expanding gas for nozzles of different sizes. We find that the temperature is well-defined in the sense that the each velocity components of the particles obey the Maxwell-Boltzmann distribution, but it is anisotropic, especially for small nozzles. The velocity auto-correlation function reveals a tendency towards condensation of the cooled supersonic gas, although the nozzles are too small for the formation of clusters. Overall we find that microscopic nozzles act qualitatively like macroscopic nozzles in that the particles are accelerated to supersonic speeds while their thermal motion relative to the stationary flow is cooled. We find that, like macroscopic Laval nozzles, microscopic nozzles also exhibit a sonic horizon, which is well-defined on a microscopic scale. The sonic horizon is positioned only slightly further downstream compared to isentropic expansion through macroscopic nozzles, where the sonic horizon is situated in the most narrow part. We analyze the sonic horizon by studying spacetime density correlations, i.e. how thermal fluctuations at two positions of the gas density are correlated in time and find that after the sonic horizon there are indeed no upstream correlations on a microscopic scale. Molecular Dynamics Study of the Sonic Horizon of Microscopic Laval Nozzles Helmut Ortmayer^1,2, Robert E. Zillich^1 July 31, 2023 ========================================================================== dsmcname=DSMC, description=Direct Simulation Monte Carlo: a probabilistic method for solving the Boltzmann equation for rarefied gas flows mdname=MD, description=Molecular Dynamics: Simulation method for N-body atomic simulations according to Newton's equation of motion lammpsname=LAMMPS, description=Large-scale Atomic/Molecular Massively Parallel Simulator: an open source classical glsmd molecular dynamics code <http://lammps.sandia.gov/> <cit.> ljname=LJ, description=Lennard-Jones potential: a simple approximation of the potential of neutral atoms proposed by John Lennard-Jones nemdname=NEMD, description=Non-Equilbrium Molecular Dynamics: Same method as md but applied on systems which are not in a equilibrated state gcmcname=GCMC, description=Grand Canonical Monte Carlo exchange of particles: Combined Monte Carlo and molecular dynamics method to simulate a grand canonical ensemble, implemented in lammps <cit.> vacfname=VACF, description=Velocity Auto Correlation Function: A self correlation function of velocities as function of the time. mcname=MC, description=Monte Carlo is a simulation method relying on random sampling and specifies a brought class of algorithms. § INTRODUCTION The Laval nozzle converts thermal kinetic energy into translational kinetic energy and was invented by Gustaf de Laval in 1888 for actuating steam turbines with steam accelerated by expansion. The goal was to achieve the highest possible velocity of an expanding gas, made possible with the convergent-divergent nozzle shape. The left panel of Fig. <ref> schematically shows the cross section of such a nozzle. When the gas reaches the most narrow part, the nozzle throat, the flow can become supersonic. The surface where this happens is called sonic horizon (or acoustic horizon) <cit.> because no information carried by sound waves can travel upstream through the sonic horizon. The expansion of gas in a Laval nozzle has interesting thermodynamic properties. While the gas acceleration of macroscopic Laval nozzles is exploited for propulsion purposes in rocket engines, the temperature drop during expansion through a nozzle with a diameter in the tenth of μm range is exploited in supersonic jet spectroscopy to freeze out translational, rotational and vibrational degrees of freedom of molecules, leading to spectra that are not complicated by too many thermally populated excited states <cit.>. The studied molecules can be kept in a supercooled gas phase, far below the condensation temperature, with a high density compared to a conventionally cooled equilibrium vapor. Under appropriate conditions, weakly bound van der Waals cluster can be formed <cit.>. The molecules of interest are typically co-expanded with a noble gas. In case of ^4He as carrier the cooling effect is also greatly enhanced by the unique quantum effects of ^4He at low temperatures. Especially the helium-droplet beam technique takes additional advantage from the superfluidity of ^4He<cit.>. The typical orifice used for molecular beams has only a convergent part and the divergent nozzle part is realized by the ambient pressure in the expansion chamber. During expansion the surrounding gas in the chamber provides a pressure boundary to the jet and the jet temperature itself keeps decreasing after exiting the orifice. <cit.>. Macroscopic Laval nozzles are well understood and can be approximately described by simple thermodynamic considerations, under assumptions that are reasonable for macroscopic nozzles: isentropic flow without dissipation (inviscid gas and smooth slip boundaries); the flow velocity v depends only on the position x along the axis of the nozzle; the nozzles cross section varies only gradually with x; the flow is stationary; and continuum fluid dynamics is valid, i.e. each fluid element is in local thermodynamic equilibrium. Then the relative velocity change with x and the relative change of the cross section area A follow the simple relation <cit.> dv/v = - 1/1-( v c)^2 dA/A where c is the speed of sound, which can be expressed in terms of the isentropic or isothermic derivative of the pressure with respect to the density, c=√((∂ p/∂ρ)_S) = √(c_p/c_v(∂ p/∂ρ)_T) where c_p and c_v is the heat capacity at constant pressure and volume, respectively. The ratio M=v/c is called Mach number, and M=1 defines the sonic horizon. The usual situation is a gas in a reservoir or a combustion chamber producing gas to the left in our figures of the nozzle. Hence the flow velocity is small when it enters the nozzle, in particular it is subsonic, M<1. Eq. (<ref>) tells us that, with decreasing cross section A (e.g. moving downstream in the convergent part), the flow velocity v must increase. In the nozzle throat, i.e. where A has a minimum and dA=0, v either stays below M, in which case v must decelerate in the divergent part. Or the gas flow attains M=1 in the nozzle throat, and then accelerates further in the divergent part (if the pressure difference between inlet and outlet is large enough). Hence for supersonic flow, v increases with increasing A. Note that Eq. (<ref>) implies that the transition to supersonic flow can happen only where the cross section area has a minimum. The goal of this work is to understand the physics of microscopic Laval nozzles on the nanoscale of the atoms of the gas flowing through a constriction which is only nanometers wide. We want to answer the following questions: How do the transport properties of a Laval nozzle depend on its size, and does it even have the typical characteristic of a convergent-divergent nozzle, i.e. converting thermal energy into translational energy? If yes, how efficiently does a nanoscale Laval nozzle cool the expanding gas? Do we obtain supersonic flow? Is there a well-defined sonic horizon, and if yes, where in the nozzle is it located? Is there even local thermodynamic equilibrium such that we can define a local speed of sound and thus can speak of a sonic horizon and supersonic flow? Since we are interested in the fundamental mechanism of a microscopic Laval nozzle we study a rather idealized nozzle with atomically flat surfaces corresponding to slip boundaries. This simplifies the problem since it eliminates the boundary layer close to the nozzle walls. Boundary effects are of course essential in a real microscopic nozzle, and they would be easy to model with rough walls, but they would complicate the analysis and interpretation of our results. A common method to study microscopic nozzles is the direct simulation Monte Carlo (dsmc) method <cit.>, which solves the Boltzmann equation. However, we want to make as few approximations as possible, apart from the idealization of a atomically smooth nozzle walls. Therefore we use molecular dynamics (md) simulations, which accounts for each atom or molecule of the gas, and collisions are described by realistic intermolecular interactions. Atomistic (md) simulations have been shown to be useful for the understanding of fluid dynamic phenomena <cit.>. The only underlying assumption of the md method is that quantum physics plays no role and classical mechanics is sufficient. This is usually a valid assumption, with the exception of expansion of ^4He under conditions where the ^4He gas cools to superfluid nanodroplets<cit.>. Because of the non-equilibrium nature of this expansion process through a Laval nozzle we perform non-equilibrium md (nemd) simulations <cit.>. The right panel of Fig. <ref> shows the trajectories 30 randomly chosen particles of a simulation in a convergent-divergent nozzle that contained on average about 790000 particles. The speed of the particles is color-coded. Fig. <ref> gives an impression how a Laval nozzle converts thermal energy (temperature) to ordered translation energy: close to the inlet the motion is predominantly thermal; close to the outlet the velocities are higher and tend to point in x-direction, but the temperature, i.e. the kinetic energy after subtracting the flow velocity, is in fact much lower as our results will show. Averaging over all particles and over time leads to the thermodynamic notion of a gas that accelerates and cools as is expands through the nozzle. With md we can obtain, with microscopic resolution, both thermodynamic quantities like temperature, pressure, or density, and microscopic quantities like the velocity autocorrelation function vacf, velocity distribution, or density fluctuation correlations: we will investigate whether the expanding gas has a well-defined temperature, characterized by an isotropic Maxwell-Boltzmann distribution of the thermal particle velocities. The vacf exhibits features related to the metastability of the accelerated gas cooled below condensation temperature. We calculate spatio-temporal density auto-correlations, i.e. correlations between fluctuations of the density at different times and different locations, to study the propagation of information upstream and downstream and pinpoint the location of the sonic horizon (if it exists). In a macroscopic nozzle, upstream propagation of information carried by density fluctuations is not possible in the supersonic region. On the microscopic scale, e.g. on the scale of the mean free path of the atoms, a unidirectional information flow is not so obvious. For instance, if we assume a Maxwell-Boltzmann distribution of random particle velocities, fast particles from the tail of the distribution could carry information upstream. We remark that, in a seminal paper by W. G. Unruh et al. <cit.>, a mathematical analogue between the black hole evaporation by Hawking radiation and the fluid mechanical description of a sonic horizon is found. This analogue has brought significant attention to sonic horizons <cit.>, but in this work we will not study analog Hawking radiation. § MOLECULAR DYNAMICS SIMULATION OF EXPANSION IN LAVAL NOZZLE The gas flow through the microscopic Laval nozzle is simulated with the molecular dynamics (md) method which solves Newton's equation of motion for all particles of the gas. Unlike in continuum fluid dynamics, which solves the Navier-Stokes equation, md contains thermal fluctuations of the pressure and density, also in equilibrium. Furthermore, unlike the continuum description, md does not assume local thermodynamic equilibrium, which may not be fulfilled in a microscopic nozzle. The price for an accurate atomistic description afforded by md simulations is a high computational cost compared to Navier-Stokes calculations or dsmc simulations. In the present case, we simulate up to several hundred thousand particles. Larger md simulations are possible, but our focus is the microscopic limit of a Laval nozzles on the nanometer scale. A challenge for md is to implement effective reservoirs to maintain a pressure differential for a steady flow between inlet and outlet of the nozzle. An actual reservoir large enough to maintain its thermodynamic state during the md simulation would be prohibitively computationally expensive. We approximate these reservoirs by defining small inlet and outlet regions where we perform a hybrid md and mc Monte-Carlo simulation (gcmc) <cit.>, with grand canonical Monte-Carlo exchange of particles <cit.>. As the name implies, this method simulates a grand canonical ensemble for a given chemical potential μ, volume V and temperature T by inserting and removing particles. The nozzle itself is simulated in the microcanonical ensemble, i.e. energy is conserved. This ensemble represents a nozzle with perfect thermally insulating walls. Fig. <ref> shows the geometry of the nozzle simulated with the inlet and outlet colored in blue and yellow, respectively, with the convergent-divergent nozzle in between. To keep the simulation simple and the computational effort in check we simulate a slit Laval nozzle, translationally invariant in z-direction (perpendicular to the plane of the figure) and realized with periodic boundaries in this direction. Since our focus is a microscopic understanding of supersonic flow and the sonic horizon, we simulate a nozzle with atomically smooth walls. Simulating rough walls would have significantly complicated the analysis of the flow, because of the nontrivial spatial dependence of the flow field in the direction perpendicular to the general flow direction, requiring significantly longer simulations to resolve all measured quantities in both x and y direction. In a smooth-walled nozzle, we can restrict ourselves to studying only the x-dependence of the quantities of interest. The gas particles are atoms interacting via a pair-wise Lennard-Jones (lj) potential. Thus we simulate the expansion of a noble gas through the nozzle. Molecules with vibrational and rotational degrees of freedom seeded into the noble gas would be an interesting subject for further investigation, but this exceeds the scope of this work. The (lj) potential between a pair of particles with distance r is given by V_LJ(r)=4ϵ[ (σ/r)^12-(σ/r)^6 ] The smooth walls are also modelled via a (lj) potential with, V_LJ(s)=4ϵ[ (σ/s)^12-(σ/s)^6 ] where s is the normal distance between atom and wall. We use the common reduced units for simulations of LJ particles if not otherwise stated, see table <ref>. Thus with the atom mass m, and the lj parameters σ and ϵ for a specific noble gas, the results can be converted from reduced units to physical units. Atoms are inserted and deleted in the inlet (blue) and outlet (yellow) by running the md simulation in these regions as a hybrid (gcmc) simulation <cit.>. The two grand canonical ensembles are characterized by their chemical potential, the volume, and the temperature, (μ_1, V_1, T_1) and (μ_2, V_2, T_2), respectively. A proper choice of these thermodynamic variables ensures that on average, an excess of particles are inserted in the inlet and particle are eliminated in the outlet, such that a stationary gas flow is established after equilibration. There are alternative insertion method, such as the insertion-deletion method, where the mass flow is specified <cit.>. The temperature and chemical potential of the inlet reservoir is set to T_1=2.0 and μ_1=-32, which would correspond to a density ρ_1=0.86 and ensures that the pressure is not too high and the LJ particles remain in the gas phase. The particle insertion region in the nozzle is not in equilibrium with the grand canonical reservoir defining the (μ_1, V_1, T_1) ensemble, because the inlet volume is not closed on the side facing the nozzle. The outflow must be compensated by additional insertions, which makes the insertion rate higher than the elimination rate. Indeed we observed that the average density in the insertion region is approximately half the density ρ_1. Also the temperature in the inlet region is lower than the set value T_1=2.0. The resulting pressure in the insertion region is p≈ 0.06 in our reduced units. For Argon with ϵ=1.65· 10^-21 J and σ=3.4 Å <cit.> this translates to a temperature of T=179K and a pressure p≈2.5· 10^6 Pa in SI units. This is in the pressure range for molecular beam spectroscopy experiments <cit.>. The inlet conditions will converge to the specified reservoir variables if the number of gcmc moves is significantly larger than the number of md moves, or if the size of the inlet region is increased; both increases computational cost. Alternatively, the inlet conditions may be matched to the desired pressure and temperature by fine-tuning the reservoir variables and running many equilibration simulations, which again requires a high computational effort. In this work we refrain from perfectly controlling the thermodynamic state of the inlet although it leads to effectively different inlet conditions in differently sized nozzles. In the convergent-divergent part of the nozzle, between the two grand canonical ensembles, the atoms are propagated in the microcanonical ensemble (i.e. energy and particle number are conserved), which is the most suitable ensemble for dynamic studies since the dynamics is not biased by a thermostat. Since we want to simulate expansion into vacuum, instead of choosing a very negative chemical potential, we simply set the pressure in the outlet to zero, such that particles entering the outlet region are deleted immediately. For comparisons of different nozzle sizes, we scaled the slit nozzle in both x and y directions, while keeping the simulation box length z_max in the translationally invariant z-direction, perpendicular to the figure plane in Fig. <ref>, fixed. In the z-direction, we apply periodic boundary conditions. We compared different simulation box lengths z_max in z-direction to quantify unwanted finite size effects in z-direction. Ideally, we want to keep z_max larger than the mean free path. Especially for the dilute gas at the end of the divergent part, a sufficiently large z_max is required to avoid such effects. For most simulations, we found z_max=86.18 σ or z_max=43.09 σ to be adequate, as shown below. We initialize the nemd simulations with particles only in the inlet region. Equilibration is achieved when the total number of particle in the simulation does not increase anymore but just fluctuates about an average value. When this steady state is reached, we start measurements by averaging velocities, pressure, density etc. The equilibrium equation of state for LJ particles is well known <cit.>. The equation of state is not needed for the md simulations, but it is helpful for the analysis of the results, particularly for the calculation of the speed of sound and the Mach number. Specifying the Mach number, temperature, or pressure rests on the assumption of local thermodynamic equilibrium, and thus on the validity of a local equation of state. In a microscopic nozzles where the state variables of the LJ gas changes on a very small temporal and spatial scale local thermodynamic equilibrium may be violated. All simulation were done with the open source md software lammps <cit.>. § THERMODYNAMIC PROPERTIES In this section we present thermodynamic results of our molecular dynamic simulations of the expansion through slit Laval nozzles: density, pressure, temperature, and Mach number. We check whether a microscopic nozzle exhibits the transition to supersonic flow and where the sonic horizon is located in nozzles of various sizes, and we compare to ideal gas continuum dynamics. The atomistic nemd simulation also allows us to investigate if the gas attains a local equilibrium everywhere in the nozzle, with a well-defined temperature. §.§ Very small nozzle Fig. <ref> shows results for a very small Laval nozzle, with a throat width of only 3.9 σ, i.e. only a few atoms wide. Panel a) shows the nozzle geometry. The temperature is shown in panel c). The kinetic temperature is the thermal motion of the atoms after the flow velocity at r, v( r) is subtracted 3 2k_B T = ∑_i m 2( v_i - v( r_i))^2 Unlike in equilibrium, the temperature in a non-equilibrium situation such as stationary flow varies spatially, T=T( r), provided that local equilibrium is fulfilled. If there is no local equilibrium, there is no well-defined temperature. Although the right hand side of eq.(<ref>) can still be evaluated, the notion of a “temperature” is meaningless if the thermal parts of the atom velocities do not follow a Maxwell-Boltzmann distribution. Here we assume that eq.(<ref>) provides a well-defined local temperature T(x) at position x along the flow direction in our Laval nozzles. Further below we investigate whether this assumption is justified. The subtleties of the calculation of v( r) and T(x), and how to subtract the flow velocity from the particle velocities can be found in appendix <ref> and <ref>, respectively. Fig. <ref> shows that T(x) indeed drops after the gas passes the nozzle throat, but there is a small increase before it reaches the throat. We attribute this to the wall potential: the constriction is dominated by the attractive well of the LJ potential (<ref>). The associated drop in potential energy is accompanied by an increase of the temperature, i.e. kinetic energy. Panel g) shows the flow speed v(x)=\| v(x)\|. v(x) increases monotonously over the whole length of the nozzle. For comparions, we also show the speed of sound of the LJ gas c(x) and of the ideal gas c_id(x), which are very similar, even in the convergent part where the density is higher. For a monatomic ideal gas, the speed of sound (<ref>) becomes c_id(x)=√(5 3k_B T(x) /m). The speed of sound c(x) of the LJ fluid is calculated from its equation of state given in Ref. <cit.> and the specific residual heat capacities <cit.>, using the expression with the isothermal derivative in Eq. (<ref>) and the values of ρ(x) and T(x) measured in the MD nozzle simulations. ρ(x) is shown in panel i), together with the pressure. The heat capacities c_p and c_v appearing in eq.(<ref>) are also obtained from the equation of state of the LJ fluid. Note that applying the equation of state at position x in the nozzle again assumes local equilibrium, which is not necessarily true. Panel e) shows the Mach number M(x) obtained from the simulation and the Mach number M_id(x) for an ideal gas continuum. For the ideal gas, we can derive from eq. (<ref>) a relation between the cross section areas A(x) and Mach numbers M_id(x) at two different positions x_1 and x_2 in the nozzle <cit.> A(x_1)/A_(x_2) = M_id(x_2)/M_id(x_1)(1+γ -1/2M_id^2(x_1)/1+γ -1/2M_id^2(x_2))^γ+1/2(γ-1 ) M_id(x) can now be obtained by setting x_1=x and x_2=x_c, the position of the sonic horizon, where M_id(x_c)=1 by definition. Panel e) shows that the Mach number M(x) obtained from the simulation stays below the ideal gas approximation M_id(x), with the difference growing in the divergent part of the nozzle. At the end of the nozzle M is approximately half the value of the ideal gas continuum approximation M_id. In particular, the sonic horizon predicted by the MD simulation is located after the throat of the nozzle, not at the point of smallest cross section predicted by the continuum description of isentropic flow, see eq. (<ref>). The Knudsen number is a characteristic quantity for flow in confined geometries. It is the mean free path length λ divided by a characteristic length d of confinement Kn(x)=λ(x) d(x) In our slit Laval nozzle d(x) is the width at position x. We estimate the mean free path λ(x) using a hard sphere approximation <cit.> λ(x)=(√(2)ρ(x) π)^-1 under the assumption of a Maxwell-Boltzmann distribution of the velocities which which check to be fulfilled in the nozzle, see section <ref> and Fig. <ref>. For Kn≪1 the mean free path is much smaller than the nozzle width and a continuum description of the flow is appropriate. For Kn≈ 1 or Kn≫ 1 a continuum description is is not possible and the transport becomes partly ballistic. For the smallest nozzle results, the Knudsen number Kn(x) shown in panel k) in Fig. <ref>, is significantly larger than unity in the supersonic regime. §.§ Small nozzles Fig. <ref> shows results for two nozzles twice and four times as large as the smallest nozzle presented in Fig.<ref>, with throat widths 7.8 σ and 15.6 σ, respectively. The small temperature increase seen for the smallest nozzle is not present anymore. T is almost constant in the convergent part and then decreases monotonously. Note that for each nozzle, the flow starts from slightly different thermodynamics conditions in the inlet region, for reasons explained above. As the nozzle size increases, the Mach number M reaches a higher value for the larger nozzle despite the slightly lower T in the inlet, and it follows the ideal gas approximation M_id more closely. The sonic horizon moves closer to the minimum of the cross section. Of course the Knudsen number Kn(x) is smaller for larger nozzles. Due to the wider nozzle throat, the pressure is significantly lower in the convergent part. For Fig. <ref>, we increase the nozzle size again twofold and fourfold. We find the same trends as in Fig. <ref>. For the nozzle with throat width 62.5σ, the Mach number M is close to the ideal gas approximation M_id. M falls below M_id only towards the end of the nozzle, where the collision rate presumably becomes too low for efficient cooling. The sonic horizon is essentially in the center, indicated by the vertical dashed line. For these two largest nozzles, we examined whether local equilibrium is fulfilled. The direction-dependent temperature, see appendix <ref>, is shown in panel c) and d) of Fig. <ref>. The temperature is not quite isotropic, i.e. there is insufficient local equilibration between the motion in x-, y, and z-direction. The three respective temperatures differ. In the convergent part the temperature in the y-direction, T_y, is highest, while in the divergent part T_y is lower than T_x and T_z. T_z is only influenced by collisions between particles because there is no wall in z-direction. Comparing the two nozzles presented in Fig. <ref>, we observe the expected trend that the temperature anisotropy decreases with increasing nozzle size. At the end of the nozzles in Fig. <ref> the temperature anisotropy grows because the collision rate between particles drops as the density drops. Whether the random particle velocities are Maxwell-Boltzmann distributed will be studied in section <ref> about microscopic properties. In table <ref> we compare the difference Δ x_c=x_c-x_c^0 between the calculated position x_c of the sonic horizon and the position x_c^0 of minimal cross section area predicted by isentropic flow in the continuum description. In all cases the sonic horizon is “delayed” and shifted downstream, Δ x_c>0. With growing nozzle size characterized by the throat width d_m, the dimensionless difference falls in relation to the nozzle size, quantified by the ratio Δ x_c d_m shown in the right column. In abolute numbers, Δ x_c grows with size (middle column), until it actually drops for the largest nozzle. Surprisingly, our atomistic simulations indicate that for a sufficiently large nozzle the sonic horizon is situated right in the middle, with atomistic precision. §.§ Phase diagram Does the gas undergo a phase transition and condense into droplets at the end of the nozzle as it cools upon expansion? Fig. <ref> shows the phase diagram of the LJ equation of state in the (T, ρ) plane as determined form Ref. <cit.>. The saturation density curve shown in yellow is associated with the phase transition, but up to the critical density, shown as blue curve, a supersaturated vapor phase or a superheated liquid phase is possible. This supersaturated and superheated phases are metastable. The green curve in Fig. <ref> shows the path of density and temperature values, shown in panels c) and i) of Fig. <ref>, of the gas expansion in the nozzle with throat width d_m=31.25. Strictly speaking, only an adiabatically slow evolution of a LJ fluid has a well-defined path in diagram Fig. <ref>, which shows equilibrium phases. But plotting the state during expanding through the microscopic nozzle in Fig. <ref> at least provides a qualitative description of the fluid at a particular position in the nozzle. The path would extend to about T=0.4, but the equation of state from ref. <cit.> does not reach below T=0.7. We note that the triple point, obtained from molecular simulations studies in Ref.<cit.> lies at T_tr=0.661, below which the gas-liquid coexistence region becomes a gas-solid coexistence region. From the path traced by the expanding gas we see that the LJ fluid starts in the gas phase in the inlet. As temperature and density fall upon expansion, the fluid enters the gas-liquid coexistence region. In this region the fluid can remain in a metastable supersaturated gas phase. Below the triple point, even the gas-solid coexistence region is reached at the end of the nozzle. Our simulations show no evidence of a liquid or even a solid phase in our simulations, which would appear as small liquid or solid clusters; the LJ particles remain unbound until reaching the outlet region of the nozzle. Either the gas remains metastable or it is to far out of local thermal equilibrium that the discussion in terms of the phase diagram is meaningless. The anisotropy of the temperature discussed in the previous section indicates that thermal equilibrium is not completely fulfilled. The absence of nucleation of clusters is not a surprise, because there is simply not enough time in a microscopic nozzle for nucleation under such dilute conditions before the gas reaches the outlet. § MICROSCOPIC PROPERTIES Molecular dynamics simulation allows to measure properties which are inaccessible in a macroscopic continuum mechanical description. We already have seen in the previous section the temperature is slightly anisotropic, which is inconsistent with local equilibrium. In this section we take a closer look at quantities defined on an atomistic level: the velocity probability distribution (in equilibrium the Maxwell-Boltzmann distribution) and the velocity autocorrelation function. Furthermore we study the propagation of density waves by calculating the upstream and downstream time-correlations of thermal density fluctuations of the stationary flow before, at, and after the sonic horizon. The goal is to check if the sonic horizon, found in the previous section by thermodynamic consideration, is also a well-defined boundary for upstream information propagation on the microscopic level. §.§ Velocity Distribution We have observed a temperature anisotropy, see panel c) and d) in Fig.<ref>. This raises the question whether the particle velocities even follow a Maxwell-Boltzmann distribution. If the velocities are not Maxwell-Boltzmann distributed, we do not have a well-defined kinetic temperature. This question is important for the interpretation of the results, for example when we discussed the temperature drop during expansion in the previous section. We now clarify whether it is meaningful to talk about temperature in microscopic nozzles. We calculate the velocity distribution for the two largest nozzles (see Fig.<ref>). shown in Fig. <ref> by separately sampling the histograms for the x, y, and z-components of the velocity, where we subtract the steady flow velocity from the particle velocities, see appendix <ref>. Since the velocity distribution depends on the location x in the nozzle, the histograms are two-dimensional, which requires a lot of data to sample from. Therefore we split x into only three regions x_1, x_2 and x_3, depicted in the nozzle illustrations at the top of Fig. <ref>. The velocity distributions f(v_x,x_j) for the x-component of the velocity are shown in panels c) and d) for the two respective nozzles, each panel showing f(v_x,x_j) for all three regions x_j=x_1,x_2,x_3 in blue, yellow, and green. Of course, the distributions become more narrow for larger x_j, consistent with a downstream drop of temperature in a Laval nozzle. We fit the histograms with Gaussian functions, i.e. the Maxwell-Boltzmann distribution, also shown in the panels. The corresponding results f(v_y,x_j) and f(v_z,x_j) for the other two velocity directions are shown in panels e)–h). It is evident that, apart from small statistical fluctuations, the Maxwell-Boltzmann distribution is a good fit in all cases. Thus the notion of temperature in these microscopic non-equilibrium systems makes sense. The width of the velocity distributions (i.e. the temperature) is not quite the same in the three directions, however, in particular in region x_3, the diverging part of the nozzle. In order to see this better, we compare the fits to f(v_i,x_3) for i=x,y,z in panels i) and j). The distribution of the y-component of the velocity is narrower than the other two directions. In other words the temperature according to v_y is lower, thus the temperature is not isotropic. This means there is insufficient equilibration between the three translational degrees of freedoms. The effect is more pronounced for the smaller nozzle because particles undergo fewer collisions before they exit the nozzle, as quantified by the larger Knudsen number, see Fig.<ref>. The spatial binning into just three region x_j is rather coarse-grained as it neglects the temperature variation within a region. With more simulation data a finer spatial resolution would be possible, however we feel that the presented results are convincing enough that the thermal kinetic energy can be well-characterized by a temperature, albeit slighly different in each direction. §.§ Velocity Autocorrelation Function The velocity auto-correlation function, vacf, quantifies the “memory” of particles about their velocity. The VACF is defined as VACF(τ)=⟨_p(t)·_p(t+τ)⟩_t,p with _p(t) the velocity of particle p at time t. ⟨…⟩_t,p denotes an average over time and over all particles. An ideal, i.e. non-interacting particle has eternal memory, VACF_u(τ)= const. But due to interactions with the other particles, VACF_u(τ)→ 0 within microscopically short times. In the case of stationary flow, we need to subtract the flow velocity from particle velocities in eq (<ref>). Furthermore, the VACF will depend on the x-coordinate in the nozzle. Therefore we generalize eq. (<ref>) to a form which is suitable for stationary flow in a nozzle that depends on x and is not biased by the flow velocity. We also normalize the VACF such that is is unity at τ=0: VACF(x,τ) =⟨Δ_p(t)·Δ_p(t+τ) δ(x-x_p(t))⟩_t,p⟨Δ_p(t)^2 δ(x-x_p(t))⟩ where Δ_p(t)≡_p(t)-(x_p(t)) is the thermal part of the velocity, after subtraction of the flow velocity at the particle coordinate x_p(t). Note that we define VACF(x,τ) such that the spatial coordinate x coincides with the starting point x_p(t) at time t of the time correlation; at the final time t+τ, the particle has moved to x_p(t+τ) downstream. When we sample (<ref>) with a MD simulation, the coordinate x and the correlation time τ are discretized, and δ(x-x_p(t)) is replaced by binning a histogram in the usual fashion, see the appendix. Fig. <ref> shows the vacf for various positions x in the nozzle. The calculations were done for two different nozzle sizes (left and right panels). The vacfs cannot be shown for x all the way to the end of the nozzles because particles leave the simulation before the velocity correlation can be evaluated. For example, if a particle in the smaller of the two nozzles in Fig. <ref> is located at x=437 at τ=0 it will have moved with the flow on average to x=537 at τ=50, where the outlet region starts and particles are removed from the simulation. For x close to the outlet, the VACF would be biased because the average in eq. (<ref>) would contain only particles which happen to travel slow, e.g. slower than the flow average. The vacf decays monotonously for all x (in fact, the vacf for only the y-component of the velocity (not shown) slightly overshoots to a negative correlations in the divergent part of the nozzle, which is a trivial effect of wall collisions). The decay is slower further downstream because the density drops. Towards the ends of the nozzles, the mean free path becomes large, see Fig. <ref>, reaching the length z_max of the simulation box in z-direction, where periodic boundary conditions are applied. We demonstrate that the finite size bias in z-direction is negligible by comparing the VACFs for different choices of z_max. If z_max were too small, two particles might scatter at each other more than once due to the periodic boundaries, which would lead to a spurious oscillation in the VACF. Panels e) and f) in fig. <ref> show VACF(x,τ) for z_max=86.2σ, twice as large as in panels c) and d), corresponding to twice as many particles. Apart from the smaller statistical noise for larger z_max, the VACFs for z_max=43.1σ and z_max=86.2σ are identical. This confirms that z_max=43.1σ is large enough to obtain reliable results. An interesting feature in the VACF for both nozzle sizes shown in Fig. <ref> is a small shoulder around τ≈ 4 in the divergent part, i.e. a small additional velocity correlation. The inset in panel f) of Fig. <ref> shows a close-up of the shoulder. Since this happens only at the low density in the divergent part of the nozzle, where the three-body collisions rate is low, the shoulder can be expected to be a two-body effect. It is consistent with pairs of particles orbiting around each other a few times. We test this conjecture by estimating the orbit period of two bound atoms in thermal equilibrium. The orbit speed v shall be determined by the temperature T. We further assume a circular stable orbit with diameter d. The orbiting particles have two rotational degrees of freedom but also two times the mass of a single particle: 1/2 k_B T = 1/2 m v^2. The centrifugal force F_c and the attractive lj force F_LJ must be balanced, F_c+F_ LJ = m 2 v^2/d - 4 ϵ m(-12/d^13 +6/d^7)=0, The orbit period t_rot can now be calculated from eq. (<ref>) and eq. (<ref>) t_ rot=πd/v =π( 6 ϵ m^4±√(36ϵ^2 - 24 k_B T/m)/k_B^4 T^4)^1/6. which expresses t_ rot as function of the temperature. When we plug in a typical temperature towards the end of the nozzles of T≈ 0.5, we obtain an orbit time t_ rot≈ 5, which is similar to the time when the shoulder in the VACF appears, see Fig. <ref>. This does not mean that bound dimers form in the supercooled flow near the exit of the nozzle, which requires three-body collisions. But the estimate based on bound states is applicable also to spiral-shaped scattering processes where two particles orbit each other. The good agreement between the t_ rot and the shoulder indicates that such scattering processes occur, and may be a seeding event for the nucleation of van der Waals clusters and condensation in larger nozzles. §.§ Density fluctuation correlations and the sonic horizon The calculation of the speed of sound c according to eq.(<ref>), using the equation of state from Ref.<cit.>, assumes local thermal equilibrium. However, the anisotropy of the temperature, see Fig. <ref>, shows that not all degrees of freedom are in local equilibrium during the fast expansion through a microscopic nozzle. Therefore, locating the sonic horizon may be biased by non-equilibrium effects. It's not even clear if a sonic horizon, the definition of which is based on macroscopic fluid dynamics, is microscopically well-defined. While the thermal velocities of the atoms follow Maxwell-Boltzmann distributions, there are always particles in the tails of the distribution that travel upstream even after the sonic horizon. So maybe information can travel upstream on the microscopic scale of our nozzles, negating the existence of a sonic horizon. The md methods provides the microscopic tools to answer this question by calculating spacetime correlations of density fluctuations: if density fluctuations propagate upstream even in the divergent part of the nozzle, there is no sonic horizon. We quantify the density fluctuation correlations before, at, and after the sonic horizon predicted from the calculation of the speed of sound. The instantaneous density ρ(x,t) at position x and time t is evaluated according to eq. (<ref>). The density fluctuation, i.e. the random deviation at time t from the average density at position x, is obtained by subtracting the time-averaged density (shown in Figs. <ref>, <ref>, and <ref>) from ρ(x,t), Δρ(x,t)= ρ(x,t)-⟨ρ(x,t)⟩_t. Note that fluctuations of the density depend also on y and z, but we are interested in the fluctuations relative the the sonic horizon, and thus fluctuations between different positions x in the nozzle. The correlation between a density fluctuation at x and t and a density fluctuation at x+δ x and t+τ is given by the time average S(τ,x,δ x) = ⟨Δρ(x,t) Δρ(x+δ x,t+τ) ⟩_t/⟨Δρ(x,t) Δρ(x,t) ⟩_t S is normalized such that it is unity for zero spatial and temporal shifts, S(0,x,0)=1. In Fig. <ref> we show the density fluctuation correlations S(τ,x,δ x) in a nozzle with throat width 31.25σ, evaluated at 6 different positions x in the nozzle and for three relative position offsets δ x=p σ with p∈{-1,0,1}. The position x in the nozzle is indicated in an inset in each panel. The density binning, with bin size σ, is illustrated at the top of Fig. <ref>, which shows three adjacent bins at x, x+σ and x-σ, corresponding to p/σ=-1,0,1 in the figure labels. The self correlation S(τ,x,0) (yellow curves), correlating only the temporal decay of the density correlations at x, is mainly influenced by the flow velocity and decays faster for higher flow velocities because density fluctuation are transported away more quickly. The upstream correlations S(τ,x,-σ) (blue curves) and the downstream correlations S(τ,x,σ) (green curves) are more interesting. Both correlations are small at zero delay time τ=0, because a density fluctuation at x needs some time to disperse to neighboring density bins. At position x=10, where the flow speed is still small, there is no noticable difference between upstream and downstream correlation. For larger x, hence for larger flow speed, the forward correlation increases and the backward correlation decreases, because the density fluctuation disperses with the flow or against the flow, respectively. According to the local speed of sound calculated in the previous section, see table <ref>, there is a sonic horizon at x=306 for the nozzle size in Fig. <ref>. Indeed, for x=300, the backward correlation has no peak anymore, but decreases monotonously from a small non-zero value at τ=0. For even larger x, the upstream correlation decays more rapidly, yet it never completely vanishes at t=0. The reason for this apparent contradiction to the existence of a sonic horizon is that the distance between bins and the width of the bins are both σ. The finite value at τ=0 is an artifact caused by the density bins being directly adjacent to each other, see the illustration in Fig. <ref>: a density fluctuation at x will immediately have an effect on the adjacent bins at x+σ and x-σ since they share a boundary. In order to remove this bias, we also calculated the correlations with offsets δ x=± 2σ, S(τ,x,2σ) and S(τ,x,-2σ), such that the upstream and downstream bins do not share a boundary with the bin at x. In Fig. <ref> we compare the two choices of offsets. The left panels are take from Fig. <ref> where δ x∈{-σ,0,σ}; the right panels show S(τ,x,δ x) with δ x∈{-2σ,0,2σ}, with a twice as large τ range, because density fluctuations have to travel twice as far. The upstream and downstream correlations now vanish for zero time delay τ=0. The upstream correlation S(τ,x,-2σ) right at the throat at x=300σ is very small but does not quite vanish, which is consistent with a location of the sonic horizon predicted at x=306σ according to the speed of sound. Further downstream at x=350σ, however, S(τ,x,-2σ) indeed vanishes within the error bars. This means that information about density fluctations cannot travel backwards beyond the sonic horizon even on the microscopic scale of just a distance of 2σ. A microscopic Laval nozzle does have a sonic horizon. We also calculated the density fluctuation correlations for a nozzle twice as large (length L=1250 σ and throat width d=62.5σ). Fig. <ref> compares the correponding results with those shown in Fig. <ref>. For the comparison, we scaled all lengths by two: the bins are 2 σ wide, separated by 4 σ, see illustration at the top of Fig. <ref>. We compare S(τ,x,δ x) of the smaller nozzle with S(2τ,2x,2δ x) of the larger one, i.e. at the same relative positions with the same relative upstream and downstream offset, and showing twice the time window for the larger nozzle. According to the speed of sound, the sonic horizon for the larger nozzle is located at x=603 σ (see table <ref>), very close to the throat at x=600 σ. The comparison in Fig. <ref> shows that the density fluctuation correlations are very similar for equal relative positions for both nozzles. Also for the larger nozzle, the correlations are very small at the throat. Further downstream at x=350σ and x=700σ, respectively, both nozzles exhibit no upstream correlations. Our calculations confirm that the thermodynamic determination of a sonic horizon, based on the equation of state, is valid, although the anisotropy of the temperature indicates that the rapid expansion through the nozzles hinder complete local thermal equilibrium. The location of the sonic horizon is consistent with the vanishing of upstream time correlations of density fluctuations. The existence of a microscopically narrow sonic horizon is a non-trivial result, considering the large estimated Knudsen numbers. § CONCLUSION We studied the expansion of a gas of Lennard-Jones particles and its transition from subsonic to supersonic flow through microscopic Laval slit nozzles into vacuum. Our goal was to assess to what extent Laval nozzles with throat widths down to the scale of a few atom diameters still follow the same mechanisms as macroscopic nozzles where, given a sufficiently low outlet pressure, the gas flow becomes supersonic in the nozzle throat. For our study we used non-equilibrium molecular dynamics (MD) simulations. MD is computationally demanding but makes the fewest approximations. We considered idealized nozzles with atomically flat surfaces with perfect slip to avoid boundary layer effects. We introduced three thermodynamic regions for the non-equilibrium molecular dynamic simulation: an inlet region, the nozzle region and the outlet region. In the inlet and outlet region, particle insertions and deletions are realized by grand canonical Monte Carlo sampling <cit.>. After equilibration this allows to study stationary flows. We obtained the thermodynamic state variables temperature, density, flow velocity, and pressure and their spatial dependence, as well as the Knudsen number, Mach number, velocity auto-correlation, and velocity distribution of the gas for nozzles of different sizes. We found a well-defined sonic horizon, i.e. the surface where the flow becomes supersonic, and analyzed it via spacetime correlations of density fluctuations. We studied how the expansion dynamics depend on the nozzle size. Lower temperatures and correspondingly higher velocities and Mach numbers of the expanding gas are reached for larger nozzles, converging to predictions for isentropic expansion of an ideal gas continuum. With non-equilibrium molecular dynamics we can observe phenomena which cannot be studied in continuum fluid dynamics, which assumes local thermodynamic equilibrium. We found that this assumption is violated for microscopic nozzles. The kinetic energy in the three translational degrees of freedom cannot equilibrate completely and is slightly different for each individual translational degree of freedom. The velocity components are still Maxwell-Boltzmann distributed, with a different width for each direction, which corresponds to an anisoptropic temperature. The phase of the LJ fluid in the inlet is in a vapor phase, but upon expansion through the nozzle becomes supersaturated. At the end of the nozzle it is in the vapor-solid coexistence phase. Indeed, in the velocity auto-correlation function, vacf, we see indications of metastable pairs of particles. Since the expanding gas does not reach equilibrium in our microscopic nozzles, no clusters are formed. Cluster formation could be studied by enlarging the simulation and including the low density region after the nozzle, giving the fluid enough time to equilibrate. The investigation of the sonic horizon with the help of spacetime-dependent correlations of density fluctuations showed that the position of the sonic horizon obtained from calculating the local speed of sound matches the position where density correlations practically cannot propagate against the flow. A microscopic distance on the order to the LJ particle size σ is already enough to completely suppress the backward correlations. The vanishing of backward time correlations does of course not happen abruptly at the sonic horizon, instead the backward correlations decrease gradually with the increasing flow velocity toward the sonic horizon. At the same time the forward correlations increase with the flow velocity. For larger microscopic nozzles, the simple macroscopic description relating the cross section to the Mach number is quite accurate. For smaller nozzles the position of the sonic horizon is shifted downstream. In future work, it will be interesting to study nozzles with rough walls. The gas expansion through microscopic nozzle will be strongly affected by the boundary layer near the walls. Another topic of practical interest is the co-expansion of a carrier noble gas seeded with molecules to investigate the cooling efficiency of rotational and vibrational degrees of freedom of the molecules. This models the cooling of molecules for molecular beam spectroscopy. We note that nozzles for molecular beam spectroscopy are significantly larger than those studied here, with nozzle diameters of the order of tens of μ m, instead of tenths of nm. Increasing the outlet region will allow to study not only the condensation of the gas into clusters, but also the effect of a finite exit pressure on the position of the sonic horizon <cit.>. We acknowledge inspiring discussions with Stefan Pirker. § DENSITY CALCULATION The density ρ(x) as function of position x in the nozzle is calculated by binning the x-coordinate of all particles. Since we are interested in stationary flow situations, we can take time averages of the number of particles in the bin of volume V_bin(x). The binning volumes are slices, usually of thickness σ, which are centered at x, as illustrated in Fig. <ref>. This average can be written as ρ(x)=<1/V_bin(x)∑_i:p_i ∈ V_bin(x) 1>_t ≡< 1 >_t,V_bin(x) with the sum counting all particles p_i in the volume of bin V_bin(x), and the bracket denoting the time average. For calculations of spacetime density correlations we need the instantaneous density at x at time t, which we obtain by omitting the time average in eq. (<ref>) ρ(x,t)=1/V_bin(x)∑_i:p_i ∈ V_bin(x) 1 The determination of V_bin(x) is not trivial, since the wall is not a well-defined hard boundary, but realized by the LJ potential (<ref>). Choosing z=0 in eq. (<ref>) for the volume calculation would overestimate the real volume effectively available for the particles, because it neglects the thickness of the “skin” due to the finite value of σ. We determined that z=0.8 σ is the most suitable choice in the following way: we simulated a small nozzle (the size depicted in Fig. <ref>) with a constriction so narrow that almost no particle pass through in the course of a simulation. The wall position z, and hence the effective volume V_bin(x), is determined such that the density ρ(x) in the left half of the nozzle, obtained from (<ref>), is constant as expected for an equilibrium simulation in a closed geometry. If the skin thickness were over- or underestimated, we would obtain a density increase or decrease towards the constriction, respectively. § PRESSURE CALCULATION The pressure is calculated from the diagonal elements of the stress tensor which is calculated for each individual particle i as <cit.> S_i a b=-m_i v_i a v_i b - 1/2∑_j: p_j ∈ V_i j≠ i( r_ia F_ijb - r_ja F_ijb) with a,b ∈{x,y,z} the Cartesian components. The first term is the ideal gas contribution and is biased by the collective flow speed. Since only the thermal motion should contribute to S_i a b, the flow velocity must be subtracted from v⃗_i, see section <ref> below for the calculation of the flow velocity. The second term is the virial contribution from the lj-interaction. The summation is over all particles j within r_c from particle i, where r_c is the cut-off radius of the LJ potential. This defines the cut-off volume V_i of particle i. r_ia is component a∈{x,y,z} of the coordinate of particle i and F_ijb the component b of the force of the pairwise interaction between particle i and j. We calculate the pressure p(x) at position x in the nozzle by averaging the diagonal elements of the stress tensor S_i a b over all particles i within the bin volume V_bin(x), p(x)= -<ρ(x)/3(S_i x x+S_i y y+S_i z z)>_t,V_bin(x) with < >_V_bin(x) denoting the average over V_bin(x). We also average over the three diagonal elements because we assume an isotropic stress tensor. Remembering that the temperature is not isotropic in the nozzle, the assumption of an isotropic stress tensor may not be valid. Inserting the stress tensor (<ref>) into the expression (<ref>) for the local pressure, we obtain p(x) = ρ(x) k_B T(x) + 1/3<∑_j:p_j ∈(V_i ∩ V_bin(x)) j≠ ir_iF_ij>_ t,V_bin(x) + 1/6<∑_j:p_j ∈(V_i ∖ V_bin(x)) j≠ ir_jF_ji>_ t,V_bin(x) where in the calculation of the local virial we have to distinguish between neighbor particles p_j which are also in the same binning volume V_bin(x) as particle p_i (giving rise to the first virial expression with the common prefactor 1 3) and those which which are not (the second virial expression with the prefactor 1 6). For the first virial expression we could use F_ij=-F_ji and swap the summation index i and j leading to a factor 2. For the particles p_j which are not in volume V_bin(x) this cannot be done, and each force F_ij contributes just once. § CALCULATION OF VELOCITY The velocity field v(x,y) in the nozzle depends on both the x and y-coordinate. The velocity is not only a key quantity for Laval nozzles, but also required for obtaining the temperature T, because v(x,y) needs to be subtracted from the particle velocities for the calculation of T, see next section. Fig. <ref> illustrates the bin volumes V_bin(x,y) for the calculation of v(x,y), as opposed to the bin slices in Fig. <ref>. The time averaged flow velocity v in a bin volume V_bin(x,y) can be calculated as v_a(x,y)=< 1 N(x,y)∑_i:p_i ∈ V_bin(x,y) v_a i>_ t with a∈{x,y,z}, v_a i is the velocity component a of particle p_i, and N(x,y) the number of particles in V_bin(x,y) at a given time. The magnitude of the flow velocity is v(x)=√(<v_x(x,y)>^2_y+<v_y(x,y)>^2_y) On average there is no flow in z-direction, v_z(x,y)=0. § TEMPERATURE CALCULATION In order to investigate how the gas cools upon expanding supersonically through the nozzle, we need to calculate the position-dependent temperature T(x). The microscopic definition of the temperature is the kinetic energy of the random part of the particle velocity, hence we need to subtract the flow velocity v(x,y) discussed in the previous section: k_B T(x,y)=m < 1 3N(x,y)-3∑_i:p_i ∈ V_bin(x,y)(v_i - v(x,y))^2>_ t We are interested only in the x-dependence of the temperature and therefore we average over y T(x) = <T(x,y)>_y Note that subtracting the flow velocity removes three translational degrees of freedom, which we account for by subtracting 3 from the number of degrees of freedom of the N(x,y) particles in binning volume V_bin(x,y). In Eq. (<ref>) we average over the contribution of the three velocity components, which is fine in an isotropic system. In order to test whether the temperature is isoptropic or not (and indeed we find it is not), we calculate the direction-dependent kinetic temperature k_B T_a(x,y)=m < 1 N(x,y)-1∑_i:p_i ∈ V_bin(x,y)(v_ia - v_a(x,y))^2>_ t with a∈{x,y,z}. Again, we are interested only in how T_a varies with position x along the nozzle, hence we average over y, T_a(x) = <T_a(x,y)>_y.
http://arxiv.org/abs/2306.04014v2	20230606205957	Evaluating the Potential of Disaggregated Memory Systems for HPC applications	[ "Nan Ding", "Pieter Maris", "Hai Ah Nam", "Taylor Groves", "Muaaz Gul Awan", "LeAnn Lindsey", "Christopher Daley", "Oguz Selvitopi", "Leonid Oliker", "Nicholas Wright", "Samuel Williams" ]	cs.DC	[ "cs.DC" ]	1]Nan Ding* 3]Pieter Maris 2]Hai Ah Nam 2]Taylor Groves 2]Muaaz Gul Awan 2]LeAnn Lindsey 2]Christopher Daley 1]Oguz Selvitopi 1]Leonid Oliker 2]Nicholas Wright Nan Ding. et al [1]Computational Research Division, Lawrence Berkeley National Laboratory, CA, USA [2]National Energy Research Scientific Computing Center, Lawrence Berkeley National Laboratory, CA, USA [3]Department Of Physics and Astronomy, Iowa State University, IA, USA Nan Ding [email protected] 1 Cyclotron Road, Berkeley, CA 94720, USA Nan Ding et al [Summary] Disaggregated memory is a promising approach that addresses the limitations of traditional memory architectures by enabling memory to be decoupled from compute nodes and shared across a data center. Cloud platforms have deployed such systems to improve overall system memory utilization, but performance can vary across workloads. High-performance computing (HPC) is crucial in scientific and engineering applications, where HPC machines also face the issue of underutilized memory. As a result, improving system memory utilization while understanding workload performance is essential for HPC operators. Therefore, learning the potential of a disaggregated memory system before deployment is a critical step. This paper proposes a methodology for exploring the design space of a disaggregated memory system. It incorporates key metrics that affect performance on disaggregated memory systems: memory capacity, local and remote memory access ratio, injection bandwidth, and bisection bandwidth, providing an intuitive approach to guide machine configurations based on technology trends and workload characteristics. We apply our methodology to analyze thirteen diverse workloads, including AI training, data analysis, genomics, protein, fusion, atomic nuclei, and traditional HPC bookends. Our methodology demonstrates the ability to comprehend the potential and pitfalls of a disaggregated memory system and provides motivation for machine configurations. Our results show that eleven of our thirteen applications can leverage injection bandwidth disaggregated memory without affecting performance, while one pays a rack bisection bandwidth penalty and two pay the system-wide bisection bandwidth penalty. In addition, we also show that intra-rack memory disaggregation would meet the application's memory requirement and provide enough remote memory bandwidth. Evaluating the Potential of Disaggregated Memory Systems for HPC applications [ July 31, 2023 ============================================================================= § INTRODUCTION As disaggregated memory systems become increasingly practical and performant for deployment in the cloud <cit.>, they have garnered attention as a solution to improve memory utilization while reducing costs for High-Performance Computing (HPC) systems. Over the decades, HPC system architects have been forced to overprovision systems to meet long-tail memory requirements, deploying various node architectures that lead to inflexible resource usage or demanding that applications restructure themselves to fit within a smaller memory footprint. This results in computing nodes whose resource utilization can vary greatly from one application to another within a workload. For instance, NERSC's Cori supercomputer observed that only 15% of scientific workloads utilize over 75% of available memory per node <cit.>. At Lawrence Livermore National Laboratory, 90% of jobs use less than 15% of node memory capacity <cit.>. Furthermore, up to 83% of memory can be underutilized on tightly-coupled resources that are over-provisioned for workloads with the highest demands <cit.>. Recent improvements in interconnect technology <cit.> have reinvigorated memory disaggregation as a viable solution to both the memory and file system stranded resource problems, as many applications and workflows leverage high-performance distributed file systems for rather mundane tasks — holding read-only or private files — resulting in an overprovisioning of file system performance and degrading QoS for the applications that truly need a high-performance distributed file system. Memory disaggregation decouples compute and memory resources. Compute nodes would contain only a limited amount of local memory, but could access a large pool of remote memory available via the network. This design enables HPC systems to scale memory capacity and allocate memory more flexibly. Physically, this large pool of memory would be partitioned among several smaller “memory nodes” each containing DRAM and a NIC in order to maximize bandwidth, capacity, and reliability. Computer architects have continuously added more levels of caching to the memory hierarchy to bridge the performance gap for applications with significant temporal and spatial locality. Even modern GPU-accelerated systems have a hierarchy of faster and smaller memories, including CPU-attached DDR high-capacity memory, GPU-attached HBM high-performance memory, and multiple levels of on-GPU SRAM cache memories. Such design patterns will persist in systems like NVIDIA's Hopper H100 GPU <cit.> but in a more tightly integrated and efficient form. Ultimately, this will enable single-chip CPU-GPU architectures called Accelerated Processing Units (APUs). This work substantially expands our previous work <cit.>, which developed a methodology for modeling the performance implications of adding disaggregated memory to an APU-only HPC system. Whereas the previous paper bounded performance of 11 applications using only local (HBM) and network injection bandwidth, in this paper, we add two memory-intensive applications and examine the performance impact from the projected intra-rack and system-side bisection bandwidth limits of future HPC systems. The new contributions of this paper include: Expanding our methodology to incorporate the effects of bisection bandwidth on disaggregated memory performance. The bisection bandwidth is often used for an upper bound on collective communications, e.g., all-to-all. Its impact can be amplified on a disaggregated memory system because users can load data from anywhere in the entire memory pool, and both inter-process communication and loading data from remote memory contend for the available memory node NIC bandwidth. * Addition of the direct sparse linear solver SuperLU_DIST from M3CD1 <cit.> (Fusion) and an iterative eigensolver from MFDn <cit.> (atomic nucle) to the eleven applications in our original paper. These two workloads represent two different traditional HPC workloads: sparse triangular solves with sparse LU factorization in SuperLU_DIST and sparse matrix-matrix multiply in eigensolver. * Release of profiling and plotting capabilities<cit.> including system architecture design space, application performance potentials, and profiling scripts. Readers should be able to apply our methodology and analysis to their own kernels or applications with the scripts and Python 3.10. § RELATED WORK The growing interest and maturity of Compute Express Link (CXL) <cit.>, a standardized protocol for memory pooling, has been contributing to this renewed interest in memory disaggregation. CXL provides memory coherency and semantics over the PCIe physical layer. Pond <cit.>, the first full-stack disaggregated memory system using CXL in cloud platforms, shows that it can reduce DRAM needs by 7% with a memory pool of 16 sockets, which corresponds to hundreds of millions of dollars for a large cloud provider. The study also shows that 21% of 158 workloads have more than a 25% slowdown. Utilization analysis for HPC systems report the average memory utilization of a job can be as small as 11.9% and 74.6% of individual jobs never use more than 50% of on-node memory. Approximately three-quarters of the time, each compute node uses only 0.3% of memory bandwidth and 0.5% of available NIC bandwidth <cit.>. Often resources are idle, since HPC system node design is based on the peak usage, i.e., the maximum memory usage. It is worth mentioning that DRAM consumes static power even when idle, so unused memory still contributes to the HPC system operating cost <cit.>. Over the years, it has become a common state of practice for memory resources on HPC systems to be over-provisioned and have on-average low utilization. Recent advancements in interconnect technology have led to the proposal of Network-Attached Disaggregated Memory for HPC systems <cit.>. Peng et al. further designed a user-space remote paging library to allow applications to explore the potential of throughput scaling on disaggregated memory <cit.>. Jacob el al. developed an emulator to evaluate a memory subsystem design leveraging CXL-enabled memory pooling and demonstrated that a disaggregated memory system can effectively support bandwidth-intensive unstructured mesh-based applications like OpenFOAM <cit.>. Debendra discussed the potential and limitations of using CXL to build composable and scale-out systems spanning the rack through the pod at the data center <cit.>. Furthermore, many studies focus on efficient memory management <cit.>, as the implementation of memory disaggregation typically involves a concern about bandwidth and latency penalties over the network, which may adversely affect application performance <cit.>. To date, previous research lacks a structured analytical method that can demonstrate which applications are performance constrained on the disaggregated memory system, how much the network performance penalty affects application performance, and what are essential metrics to assess the application performance impacts of a disaggregated memory system. This paper provides a structured system design model to explore the architecture design space, and its constraints. We provide several methods to visualize the design space and a methodology that could be adapted for a broader range of users, including vendors and application developers, to help to design new architectures or purchase future systems. § SYSTEM ARCHITECTURE DESIGN Understanding the emerging technology trends and capabilities in a future disaggregated memory system is necessary to assess the potential benefits and pitfalls. Fig. <ref> presents a basic network-attached disaggregated memory system schematic. We consider that such a system could have C compute nodes and M memory nodes. Each compute node consists of an accelerated processing unit (APU) with its own local high-bandwidth memory (HBM). An APU combines a CPU with a GPU onto a single silicon die, and both CPU and GPU share a common path to the remote memory. Future processor trends favor the APU because it addresses the bottleneck of data transfers between CPU and GPU <cit.>. Each memory node is equipped with DDR memory as the remote memory. The compute nodes and memory nodes are connected via a network and is assumed to have one PCIe NIC. Thus, when data exceeds HBM capacity, data must be loaded from DDR via the network. Fig. <ref> charts the memory bandwidth trends of HBM, DDR, and PCIe from today to the year 2026. Our assumptions for HBM3 include eight 16-Hi stacks, each with 64 GB capacity. We use the maximum capacity and bandwidth per DIMM (DDR4: 32 GB/DIMM and 25.6 GB/s/DIMM; DDR5: 256 GB/DIMM and 51.2 GB/s/DIMM) with a total of 16 DIMMs for DRAM memory. One can immediately notice that PCIe would eventually be the performance bottleneck on a disaggregated system since data needs to be loaded from DDR via the network. In this section, we first propose a structured system architecture design methodology using the above assumptions to explore the potential and pitfalls of disaggregated memory. Secondly, we analyze the implication of bisection bandwidth, with two state-of-the-art network topologies – Dragonfly and three-level fat tree, on disaggregated memory systems. §.§ Available remote memory resources Fig.<ref> visualizes three use cases that highlight the impact of system architecture on available remote memory capacity and memory bandwidth. Fig. <ref> highlights the simplest case (C/M=1/1), where each compute node is paired with one memory node to run the job. Each compute node would theoretically have access to the memory nodes full capacity and 100% of the NIC's bandwidth as remote memory bandwidth. Unsurprisingly, in the case of C/M=2/1 in Fig. <ref>, each compute node has half the capacity and half the remote memory bandwidth. Interestingly, if C/M=1/2 as in Fig. <ref>, each compute node could access 200% of a memory node's capacity but still only attain 100% of the NIC bandwidth for remote memory bandwidth as bandwidth is constrained by the APU's NIC rather than the two memory node NICs. Following this method, we can build a design space with various ratios to describe the system constraints in terms of memory capacity and available remote memory bandwidth. We scale the building blocks to a modern-day HPC system and assume we have 10K compute nodes. The heat maps in Fig. <ref> present the (a) available remote memory capacity and (b) available remote memory bandwidth per compute node under different compute and memory node ratios, assuming one memory node capacity of 4TB. For the fixed number of compute nodes, Fig. <ref> shows the available DDR5 remote memory capacity (TB) to the compute nodes with growing numbers of memory nodes (100 to 20K). The vertical axis is binned into the percentage of compute nodes that will require more resources than the local HBM memory and use the remote DDR memory, a value that will be specific to each HPC system and its workload. The available remote memory capacity per compute node becomes larger as we increase the number of memory nodes (moving left to right of Fig. <ref>). That is to say, there is less contention as we increase the number of memory nodes. Similarly, we can reduce contention as the number of compute nodes requiring remote memory decreases (moving top to bottom of Fig. <ref>). For example, the first row represents the scenario where all the compute nodes require remote memory. If we focus on the sixth column where we have 10K DDR5 memory nodes (C/M=1/1), we see each compute node can access one memory node's capacity of 4TB. When decreasing the demand of the compute nodes for remote memory (moving down the column), at 50% (5K) of the compute nodes requiring the remote memory, each compute node can then access 8TB of remote memory, which equals the capacity of two memory nodes. Correspondingly, Fig. <ref> presents the available remote memory bandwidth for the cases in Fig. <ref>. Unlike memory capacity in Fig. <ref>, memory bandwidth in Fig. <ref> will saturate at the compute node's peak NIC bandwidth regardless if one decreases the C/M ratio (moving to the right) or one decreases the fraction of compute nodes requiring remote memory (moving down). Determining an optimal system configuration relies on multiple factors specific to the HPC system workload (demand) and available budget (supply of memory nodes). Fig. <ref> suggests in the 2026 time frame, HBM3 could provide 0.5TB of local memory per node. Thus, in planning for the next machine, as a guiding principle, there should be enough memory nodes to provide more remote memory capacity per node than local memory capacity. As such, configurations in the upper left region of Fig. <ref> where memory node capacity is smaller than 0.5TB are wasteful architectures. Conversely, configurations on the right of the figure can be quite expensive as there are as many or more memory nodes than compute nodes (the network has 2-3× more endpoints). Finally, although configurations in the bottom right provide 100s of TB per compute node, they can only access it at 100GB/s. As such, it will take minutes to hours to read all of remote memory once. Such architectural configurations may become impractical given the number of times an application might desire to read memory coupled with finite job run time limits. §.§ Bisection Bandwidth Implication The bisection bandwidth is the bandwidth available between two equal partitions of the network. It is used as an upper bound on collective communications, e.g., all-to-all. It also has been considered one of the key metrics that can affect applications' performance as HPC systems continue to increase in size <cit.>. Such impact can be amplified on a disaggregated memory system because users can load data from anywhere in the entire memory pool rather than be confined to a single node. That being said, both inter-process communication (point-to-point and collective operations) and loading data from remote memory will contend for the PCIe NIC bandwidth. However, for cost and performance trade-offs, the bisection bandwidth of today's machines usually maintains only 28% of the injection bandwidth. Thus, a critical decision in disaggregated memory system design is the interconnection resources, which determine the bisection bandwidth. In this section, we analyze the bisection bandwidth of two state-of-the-art network topologies, the three-hop Dragonfly topology (Perlmutter <cit.> and Frontier <cit.>) and the three-level Fat-tree topology (Summit <cit.>) to explore the bisection bandwidth. We then demonstrate the hardware limitation for intra-rack disaggregation and system-wide disaggregation. The intra-rack disaggregation <cit.> (rack disaggregation) represents that applications can directly access all available memory inside its rack but would rely on RDMA for more memory beyond the rack. Similarly, system-wide disaggregation (global disaggregation) means that users can load data from anywhere across the entire system. For a switch radix k, full-bandwidth three-level Fat-tree networks can scale to k^3/4 endpoints, and Dragonfly networks can scale to k^4/64 endpoints <cit.>. For our analysis, we consider using a 64-port switch since its scalability is sufficient for the expected number of endpoint links into the network on a 2026 disaggregated memory system for both topologies. We use a system size of 11,000 nodes (10,000 compute nodes and 1,000 memory nodes) as an example to predict the impact of bisection bandwidth. We assume that 10% of the compute nodes will require remote memory for our machine configuration. Referencing the third column and seventh row of Fig <ref>, our machine configuration's maximum memory bandwidth per compute node is 100 GB/s. Table <ref> presents the characteristics of the three-level Fat-tree and the three-hop Dragonfly using 64-port switches. According to the design discipline of the three-level Fat-tree on Summit, we can build a topology with 762 switches at the leaf level, of which forty-six ports per switch are used to connect the root level, and the rest of the sixteen ports are used to connect the endpoints. At the root level, we combine sixteen switches as one core switch and have sixteen core switches that are fully connected with each other. Thus, each core switch uses sixteen ports connecting to each other at the root level and uses the remaining forty-six ports connecting to the leaf-level switches. Ultimately, the three-level Fat-three topology requires 1018 switches (762+16×16) with full bisection bandwidth. Note that the bisection of the three-level Fat-tree always achieves 100% of the injection bandwidth. For the three-hop Dragonfly, we can either scale the number of groups or switches per group to build a larger dragonfly network. Throughout the paper, we refer to the intra-group bisection bandwidth as the available remote memory bisection bandwidth for rack disaggregation, and inter-group bisection bandwidth as the available remote memory bisection bandwidth for global disaggregation. Specific to our machine configuration, we consider two choices: 24 groups with 32 switches each and 48 groups with 16 switches each. Even though the two settings have the same number of switches, they have very different intra- and inter-group bisection bandwidths and incur different costs. For example, in the 24-group setting, one can only achieve 9% of the injection bandwidth if it keeps a similar cost to Perlmutter. Another choice is to triple the number of inter-group links to maintain the 28% bisection bandwidth tapering as Perlmutter <cit.>. Undoubtedly, one can achieve high bisection bandwidth with more link costs, i.e., 100% of the PCIe6 NIC, but the cost is extremely high — four times higher than the 28% configuration. The 48-group setting has a similar cost for 28% tapering, while it can only achieve 50% intra-group bisection bandwidth if it is limited to one link per intra-group pair. The implication of bisection bandwidth can be immediately noticed: the bisection network will reduce the available remote memory bandwidth, and the degree of reduction varies with different configurations. Figure <ref> highlights the bisection bandwidth implications on the disaggregated memory system design space, assuming the bisection bandwidth is 100%, 50% and 28% of the injection bandwidth. Note that each system size (x-axis) may require a different network configuration. A bigger system size will need a more expensive network, e.g., a system with 30K nodes (C:M=10K:20K, 74 groups×32 switches = 2368 switches) needs 3× higher cost than 11K nodes (C:M=10K:1K, 768 switches), and 165× more links to maintain 28% taper. One would imagine an intra-rack disaggregated memory system will see its available remote memory bandwidth halved by the bisection network (50% taper) in Fig <ref>. Fig.<ref> shows that a globally disaggregated memory system's available remote memory bandwidth is less than 28% of its injection bandwidth. Like the system architecture design, determining the network configuration relies on multiple factors specific to the HPC system workload (demand) and available budget (supply of switches and links). The guiding principle is that there should be enough remote memory bandwidth to support collective operations through the network with a minimal negative impact on its workloads. § APPLICATION CHARACTERIZATION In this section, we propose a memory Roofline model to evaluate and visualize the performance bottlenecks of applications running on a disaggregated memory system. Disaggregated memory promises to improve system-wide memory utilization, but individual application performance is of equal concern. Prior work argues that disaggregation comes with substantial bandwidth and latency penalties to applications <cit.>. However, such conclusions are derived assuming current technologies and lack consideration of emerging technologies in the future. To analyze the impact on individual applications in the near future, we introduce the local-to-remote memory access ratio (L:R) metric to characterize application performance on a disaggregated memory system. We then correlate the metrics using a memory Roofline plot to provide a generalized framework to evaluate and visualize the performance bottlenecks of applications running on a disaggregated memory system. The traditional Roofline model <cit.> characterizes an application's performance (GFLOP/s) as a function of its arithmetic intensity (FLOPs executed per Byte moved). It provides a quick visual comparison of the application performance compared against the bounds set by the peak compute performance (GFLOP/s) and the peak memory bandwidth of the target architecture (GB/s) to determine what is limiting performance: memory or compute. Following the methodology of the traditional Roofline model, our new memory Roofline model characterizes an application's sustained memory performance (GB/s) as a function of its local and remote memory access ratio (L:R), the peak local memory bandwidth, and the peak remote memory bandwidth. An application's L:R on a disaggregated memory system could be considered as the ratio of HBM data movement (local) to the DDR data movement (remote over PCIe) or even the HBM to file size ratio when examining applications using memory nodes as a private file system. Applications with an L:R data movement ratio greater than the system's local:remote bandwidth ratio can effectively hide the slow remote (disaggregated) memory bandwidth behind a multitude of fast, local memory accesses. Fig. <ref> presents the memory Roofline model using future HBM (local) and PCIe (remote) bandwidths. One quickly observes the visual similarity to the traditional Roofline model with local bandwidth replacing the traditional peak GFLOP/s plateau and remote bandwidths replacing the traditional memory diagonals. We observe an HBM3:PCIe6 machine balance of 65.5 — the ratio of data movement that results in equal time for local and remote transfers. This ratio is very close to today's HBM2:PCIe4 machine balance of 62.2. This suggests future hardware trends will not detract from the efficacy of disaggregated memory. Applications like ADEPT with an L:R ratio of nearly 500 (far greater than 65.5) are insensitive to memory disaggregation, dominated by on-node performance, and will use less than 14% of the available PCIe bandwidth (green diagonal line). Conversely, applications like STREAM with a theoretical L:R ratio of 2 will see their performance limited and degraded by disaggregated memory bandwidth. Figure <ref> shows performance as a function of the bisection bandwidth tapering relative to injection bandwidth. Bisection bandwidth shifts the machine balance to the right, e.g., a 50% tapering increases the machine balance from 65.5 to 131 local words per remote word. One could imagine building an intra-rack disaggregated memory system with 50% tapering (pink in Figure <ref>) and a global disaggregated system with 28% tapering (blue in Figure <ref>). A hypothetical GEMM with matrix dimension of about 300K × 300K will be limited by bisection bandwidth and unable to even use the full local HBM bandwidth. Conversely, applications like ADEPT with a high L:R are insensitive to reasonable rack- and global bisection bandwidths. Ultimately, the applications with L:R ratio less than 131 will see rack bisection bandwidth as a larger bottleneck that local memory bandwidth, while applications with an L:R ratio less than 234 running on a globally disaggregated memory will see global bisection bandwidth as bigger performance impediment than local bandwidth. Ultimately, increases in network bandwidth shift the machine balance to the left (decreasing the number of applications penalized by disaggregation), while increases in HBM bandwidth shift the machine balance to the right (increasing the number of applications penalized by disaggregation). Whereas the latter simply scales the cost of each node, increasing bisection bandwidth can scale superlinearly with the number of nodes. As such, shifting the local:global balance to the left can be cost prohibitive for large HPC and cloud systems. § APPLICATION CASE STUDIES In this section, using our methodology, we evaluate the efficacy of our proposed disaggregated memory system on a variety of application workloads. §.§ Disaggregated System Configurations Recall the HPC system described in Section <ref> to select a machine configuration. A with 10,000 compute nodes with 512 GB of HBM3 local memory capacity, accessing DDR5 remote memory nodes via PCIe6-connected NICs. As previous studies showed only 15% of the workloads use 75% of the node memory <cit.>, we conservatively assume that at any instant, 10% of the compute nodes will require remote memory for our machine configuration. Referencing Fig <ref>, at 10%, we could choose 500 memory nodes or more with DDR5 memory (x-axis) to ensure each compute node has access to remote memory greater than the local HMB3 memory. Including the memory bandwidth information from Fig <ref>, the maximum memory bandwidth per compute node peaks at 1000 memory nodes. Purchasing more memory nodes would only add additional capacity and cost, not additional memory bandwidth. For the configuration of 10,000 compute nodes accessing an aggregate four petabytes of DDR5 memory on 1000 memory nodes, we see from Fig.<ref> that each of the compute nodes requiring remote memory can access, on average, four terabytes of remote memory with a peak remote memory bandwidth of 100 GB/s. §.§ Application Characteristics The examined case studies needed various approaches to measure or estimate the local and remote memory accesses (L:R) due to the diversity of their applications as Table <ref> presents. This section summarizes the high-level methods for calculating L:R for each workload. It's important to note that throughout the paper, we assume that each application will maintain its current conceptual approach to leveraging data locality and expressing data movement even if the mechanisms are expressed differently in a disaggregated memory architecture. Artificial intelligence (AI) training workloads. AI is an area of increasing scientific interest with growing computational demands <cit.> and drives future DOE investments in HPC platforms <cit.>. We focus on training workloads, which are more computationally expensive and require a larger memory capacity than inference. We demonstrate the benefit of a disaggregated memory system using three AI training workloads: CosmoFlow <cit.> and DeepCAM <cit.> from the MLPerf HPC benchmark suite <cit.>, and a well-established image classification model, ResNet-50 <cit.> from the MLPerf Training benchmark suite <cit.>. The actual computation and memory characteristics of the three AI training workloads come from Ibrahim <cit.> and listed in Table <ref>. The local:remote memory ratio is calculate by dividing the measured FLOP:Sample Byte by the measured FLOP:HBM Byte. All the numbers reported in Table <ref> refer to the memory per job. Data analysis workloads. Data analysis applications are a growing workload in HPC facilities <cit.>. To showcase disaggregated memory benefits, we use two data analysis software frameworks, DASSA <cit.> and TOAST <cit.>. DASSA <cit.> is a distributed acoustic sensing (DAS) data storage and analysis framework for geophysicists to perform DAS data analysis on HPC systems. We use a real DAS data analysis case for earthquake detection via local similarity. We use analytical modeling to estimate the L:R and refer its input file size as the remote memory capacity requirement. TOAST <cit.> is a software framework designed for simulation and data reduction from telescope receivers that acquire time streams of individual detector responses. Here we use a satellite telescope benchmark as an example to show the implication of memory disaggregation. The core computation in the satellite telescope benchmark is the PCG solver. We profile its DRAM data movement using Intel VTune on one Cori Haswell <cit.> node as its local memory accesses and refer its input file size as the remote memory capacity requirement. Genomics workloads. With the rapid development of genome sequencing technologies, it is now possible to sample and study genomes at an unprecedented scale. MetaHipMer <cit.> is a large-scale metagenome assembler that can leverage the large memory and compute capacities of supercomputers to co-assemble terabase-scale datasets. We use three important kernels in MetaHipMer, ADEPT <cit.> with and without traceback and EXTENSION <cit.> to understand their potential on a disaggregated memory system. We use analytical modeling to calculate the L:R of ADEPT with and without traceback kernels. We use NVIDIA NSight compute <cit.> to collect the HBM data movement for single extension on Cori GPU <cit.>, and then multiply that with 45 million extensions as its local memory access. We use analytical modeling to estimate the remote memory capacities for all three kernels. Protein similarity search workloads. Bioinformatics applications have increasingly turned to HPC solutions for solving big problems with reasonable time-to-solution. Especially in metagenomics research, the scale of the data often requires memory and compute resources that are beyond what serial systems can provide. An important task that forms the backbone of many bioinformatics workflows is the alignment of a set of given sequences against a reference database. PASTIS <cit.> is a distributed-memory many-against-many search tool specifically developed for protein sequences. This search requires a lot of memory and its memory complexity grows quadratically with the number of sequences while being compute-intensive. For batch pairwise alignments required by the protein similarity search, PASTIS uses SeqAn <cit.> for CPUs and ADEPT <cit.> for GPUs. We use NVIDIA NSight compute <cit.> to collect the HBM data movement as the local memory access and use analytical modeling to estimate the remote memory capacities. FUSION workload. SuperLU_DIST is a distributed memory sparse direct solver for large sets of linear equations. It is used as a preconditioner within an iterative solver in fusion simulation applications <cit.>. In practice, one factors the system (SpLU) and performs a pair of triangular solves (SpTS) for each of the 100+ iterations of the iterative solver. These two components dominate the run time. To amortize SpLU time, one can factor the system once and then use those factors (as a preconditioner) over the course of multiple time steps (the system didn't change much). We use analytical modeling <cit.> to estimate the L:R, and refer to the factored matrix size as its memory requirement. MFDn workload. The LOBPCG eigensolver dominates the run time of the 2-body forces Many-body Fermion Dynamics for nuclear (MFDn) application <cit.>. MFDn is application used to simulate the properties of atomic nuclei. LOBPCG performs a sparse matrix–matrix multiplication (SpMM) with a varied number of right-hand sides. We use analytical modeling to estimate the L:R, and refer to half the input matrix size as its memory requirement because the input matrix is symmetric. Traditional HPC Workload Bookends. Traditional HPC workloads are designed for distributed-memory systems. They can sometimes scale to thousands of and even millions of cores <cit.>. They can distribute the memory footprint, and can fit in the 512 GB HBM3 in a 2026 disaggregated system which is larger than the currently provided node-local DDR (256 GB DDR on a 2021 HPC system). We use GEMM <cit.> and STREAM <cit.> as two representative benchmarks to show the implications as the data size grows. We use analytical modeling to estimate the L:R for GEMM and STREAM. Note that STREAM can be a proxy for giant AI=O(1) linear solvers (stencil/sparse) without any multiphysics/AMR. §.§ Application Analysis Fig. <ref> and Fig. <ref> visualizes a summary of all the tested applications in this section on a rack- and global- disaggregated memory system, respectively. Both figures combine the two critical metrics, the local and remote memory access ratio (L:R) from Fig. <ref> and the per-node memory capacity to provide an intuitive way to visualize the performance of applications on a future disaggregated memory system and assess individual application potential and pitfalls. Our system assumes 2026 memory technologies with each compute node having 512 GB HBM3 local memory, two times larger than a 2021 machine's node-local DDR capacity <cit.>. Thus, applications that can fit in 2021 machine's node-local DDR can undoubtedly fit in future local memory. We characterize the applications into four categories. Blue: required memory footprint can fit in local HBM memory. Thus, applications in this region would be HBM bound, e.g., ResNet-50. Green: required memory footprint does not fit in local memory, but applications could achieve HBM3 bandwidth due to a high L:R ratio (larger than 65.5) and would thus not incur a performance penalty from disaggregation, e.g., DeepCAM. Note applications in the green region are ultimately HBM bound but can still be impacted by the PCIe NIC bandwidth due to inefficient data movement and bandwidth contention, forcing them to fall into the orange zone. Orange: required memory footprint cannot fit in local memory, and they will be bound by the injection bandwidth due to the low L:R ratio (smaller than 65.5), e.g., STREAM (>512GB). Grey: required memory footprint does not fit in local memory, and applications (65.5 < L:R < 234) will pay a performance penalty due to the bisection bandwidth, e.g., SuperLU. Red: only for rack disaggregation. It represents taht there's not enough intra-rack remote memory. The antidiagonal line connecting L:R=524 to L:R=65.5 in Fig. <ref> shows the implications of network contention. If the memory capacity the application needs is between 512 GB and 4 TB, there are two design possibilities. The first is to use one memory node per compute node (L:R=65.5, one memory node), which guarantees all 100 GB/s of the PCIe6 NIC bandwidth but wastes memory capacity. The other possibility is to share memory nodes across compute nodes (upper left region in Fig. <ref> and Fig. <ref>). In this case, memory is not wasted, but compute nodes must contend for memory node NIC bandwidth (L:R=524, 0.125 memory node). Such contention leads to an antidiagonal boundary between the green and orange zones. Following the same methodology, one could imagine disaggregating today's system can shrink the blue region to the 40GB HBM vertical dotted line. The green and orange zones expand to the left accordingly. The antidiagonal boundary moves to lower left, and the L:R boundary moves down a little to 62.2. ResNet-50: The ResNet-50 v1.5 is a 50-layer deep convolutional neural network. ResNet-50 has been implemented in both TensorFlow and PyTorch with numerous implementations and optimizations that prevent direct comparisons of system performance. The actual computation and memory characteristics of ResNet-50 come from Ibrahim <cit.>. ResNet-50 on Imagenet data requires 0.15 TB memory to store the training data set, and its L:R ratio is 3993. On the selected system configuration, the L:R ratio has no impact because the training data can easily fit into local memory. DeepCAM: The DeepCAM climate benchmark is based on the 2018 work of Kurth <cit.> which was awarded the ACM Gordon Bell Prize. It uses deep learning to identify extreme weather phenomena from background images. Unlike ResNet-50, DeepCAM has a large memory requirement, 8.8 TB, to store the training size <cit.>. It requires 2.2 memory nodes using our selected system configuration. As its L:R is 1927, which is higher than 65.5 (on the left of the orange dotted wall in Fig. <ref>), DeepCAM can operate at HBM3 speed on a disaggregated system that uses HBM3 as local memory and PCIe6 NIC for the network. CosmoFlow: CosmoFlow uses a 3D convolutional neural network with five convolutional layers and three fully connected layers. For the training run in Table <ref>, we can replicate the 5.1TB training data over 1.25 memory nodes per APU <cit.> in the disaggregated memory system. It has an L:R of 399. As the AI model size grows exponentially <cit.>, it pushes the AI training workloads to have even larger memory requirements in the future. Therefore, AI training workloads with dense activation layers will result in a high L:R ratio and benefit from memory disaggregation (green zone). Alternatively, AI training workloads with shallow networks will pay the network bandwidth performance penalty on a disaggregated memory system (orange zone). DASSA: The local similarity method is a time-domain data analysis algorithm developed to detect earthquakes in array seismic datasets <cit.>. Each input file contains a 2D array (30,000 time samples and 11,648 channels). For each cell in that 2D array, it calculates two correlations and each correlation needs to refer the other cells in a different channel in the window. With a typical window size of five hundred cells, one cell needs to access one thousand cells for its computation. Thus, the number of local memory accesses per cell is one thousand cells. The remote memory access is to stream the input data to the local memory once. As such, the number of remote memory accesses equals the total number of cells. This leads to an L:R ratio of 1,000. TOAST: The L:R ratio is calculated by profiling the DRAM data movement using the Intel VTune on one Cori Haswell <cit.> node and dividing the input size. Thus, the L:R ratio is 278 and the required memory capacity is 1TB. ADEPT (no-traceback): The core computation of ADEPT is to perform Smith-Waterman (SW) alignments <cit.>. SW is a dynamic programming algorithm that constructs an m× n matrix A given two sequences of lengths m and n. The matrix A is used to find the optimal local alignment between the two sequences by listing all possible alignments. When operating in no-traceback mode, ADEPT is able to discard most of the matrix A except the cells needed for the next iteration. When computing the matrix A, the score of any element A(i, j) depends on elements A(i, j-1), A(i-1, j) and A(i-1, j-1). The whole score matrix (m· n) is maintained in the local memory. This leads to the number of local memory access to 3· m· n, and the number of remote memory access to m+n. In this paper, we use a data set of about 31 million DNA reads and corresponding reference pairs with upper limits of m=200 and n=780 leading to the 63 GB total remote memory requirements with a L:R ratio of 477. ADEPT (traceback): When operating in traceback mode, ADEPT kernel traces a path connecting the matrix cell with the highest score (i,j), i>i_0,j> j_0 back to the starting point (i_0, j_0) in the matrix. For this, the full matrix must be available in the GPU's HBM therefore, this along with increasing total HBM requirements also requires additional memory accesses for traceback. The traceback step usually follows pointers starting from the highest scoring cell and ending when a cell with zero score is found, leading to additional l memory accesses where l represents the longest possible alignment. The longest alignment can at most be of the length 200, i.e. longest possible read in the dataset. This also leads to an approximate L:R ratio of 477. EXTENSION: MetaHipMer's <cit.> local assembly phase performs local extensions on sections of DNA with the help of DNA reads. We use the Arctic synth data set <cit.> with four typical kmer size: 21, 33, 55 and 77 with 45 million extensions for four application runs. As such, one can observe that the L:R ratios vary from 314 to 3,402 with increasing kmer sizes. PASTIS: We use a dataset that performs around 840 million pairwise alignments. This results in 158TB of local and 363GB of remote memory data movement (an L:R of 435). SuperLU: Fusion simulations use SuperLU as a preconditioner. It usually performs multiple iterations of sparse triangular solves per sparse LU factorization with one right-hand side. We define the sparsity of the input matrix as the number of non-zeros divided by the matrix size, and the matrix sparsity is 1e-3. The factored matrix (N× N) is a thousand times larger than the input matrix. Therefore, the memory requirement equals the total bytes of nonzeros in the LU factored matrix. Specifically, the number of nonzeros of the LU factored matrix in Figure <ref> is 640 billion with N=25 million. We apply the I/O model from Grigori et al. <cit.>to estimate the local data movement per local factorization using a 512GB HBM3 memory and a 40MB cache. For each local factorization (n × n), the data movement to/from cache is n^2/3/√(M) word, where M is the cache size and n equals 5.5million. The data movement in remote memory is to read the input matrix block for each local factorization and to write back the factored results. Thus the L:R for factorization (LR_f) equals to one. Each solve-iteration computes two triangular matrix-vector multiplications: Lx=b and Ux=b. Triangular solves have two load operations for each non-zero (non-zero itself and the corresponding b) in L and U and a store to remote memory for the solution x. Thus, the L:R for one solve iteration is nnz+n+2nnz/nnz+n≈ 3 as n ≪ nnz. The L:R for multiple solve iterations is nnz+n+iter× (2nnz)/nnz+n which scales with the number of solve iterations per factorization. Following this method, the L:R for the entire SuperLU is 4, 101, and 201 with 1, 50, and 100 solve iterations per factorization. Thus, applications with 50 solve iterations per factorization will be bound by rack bisection as Fig. <ref> shows. Alternatively, applications with 100 solve iterations per factorization will pay global bisection as presented in Fig. <ref>. Eigensolver: The MFDn eigensolver performs sparse matrix-matrix multiplication (SpMM). We refer to the I/O model for SpMM <cit.> to estimate our local memory data movement, (k× N)× (1 + log_M ((k× N)/M)), where N is the matrix dimension, k × N gives the total number of non-zeros, and M is the cache size. Again, we consider the cache size is 40MB. The remote memory data movement (R) reads the input matrix and stores the results. Thus, it gives a constant L:R ratio of 3.2 as the matrix size varies from 0.2 billion by 0.2 billion to 37 billion by 37 billion, and the sparsity (total number of nonzeros divided by the matrix size) varies from 1e-6 to 1e-7. Since the input matrix is symmetric, the memory requirement equals the size of half the number of nonzeros in the input matrix. GEMM: The general matrix multiplication (GEMM) kernel is defined as the operation C = A· B, with A and B as matrix inputs and C as the output. We assume all three matrices are square double-precision matrices (N × N) with N being the maximum dimension that fits in DDR memory. Using estimates derived from the Holder-Brascamp-Leib (HBL) inequality <cit.>, we may estimate the data movement (R) to/from remote memory as 2· N^3/√(M)+N^2-3· M elements where M is the local memory (cache) capacity in elements (64G). We apply this model recursively to estimate the local data movement per local GEMM using a 512GB memory and a 40MB cache <cit.>. This number is scaled by the requisite number of local GEMMs ((DDR/HBM)^3/2) to produce the L:R ratio which we observe varies from about 50 to 90. It is worth noticing that a bigger GEMM, e.g., matrix size is 400K×400K, can help to eliminate the injection bandwidth penalty. However, GEMM will ultimately pay the rack bisection bandwidth penalty (Fig. <ref>) because its L:R remains close to 90 no matter how big the matrix is. STREAM: STREAM TRIAD is a benchmark that measures sustainable memory bandwidth. It computes a vector operation C(i) = A(i) + α· B(i). This operation involves two loads (A(i) and B(i)) and one store (C(i)) in the remote memory. Reads from (writes to) remote memory incur writes(reads) in local memory on top of nominal reads/writes in local memory. Thus, the L:R equals 2. §.§ Application Analysis Summary The case studies represent a diverse array of memory access patterns and memory capacity needs across multiple domains. This trend will likely continue as scientific workloads evolve over time. For the exemplar disaggregated memory system configuration consisting of 10,000 compute nodes and 1,000 memory nodes, we see that nine out of thirteen workloads fall into the blue and green zones, which will not suffer penalties from bisection bandwidth. The SuperLU_DIST with 100 solves per factorization pays global bisection but is not sensitive to rack bisection. Only the STREAM and the Eigensolver fall into the orange zone and could see a penalty from injection bandwidth. Although we proxied future L:R ratios using today's problem sizes, we believe future L:R ratios will be at least as big as surface to volume ratios never shrink. Ultimately, these applications are unlikely to see any performance loss from disaggregated memory over the existing state of the practice. Assuming these applications represent a workload and the applications falling into the green and orange zones constitute less than 10% of the total workload node hours, then the disaggregate system discussed here could result in significant cost savings, eliminating 40PB of node-local DDR memory (10K compute nodes×4TB) of memory in exchange of 1000 memory nodes of 4TB each without hurting performance. § DISCUSSION AND CONCLUSIONS In this paper, we focused on architecture, bottlenecks, and characterization of applications running on disaggregated memory system architectures in the 2024-2026 time frame. As visualized in Fig. <ref>, 9 out of 13 of the applications we examined either have sufficiently low memory requirements that they can comfortably fit in a future APU's HBM memory or have a sufficiently high local:remote data movement ratio that the architected local:remote bandwidth tapering will not impede performance. Nevertheless, it is imperative HPC system architects and vendors follow a few design principles lest the potential remote bandwidth be underutilized. Rack- and Global Disaggregation: System architects need to decide whether to do intra-rack disaggregation or system-wide disaggregation. Our examined applications in Fig. <ref> suggest that intra-rack disaggregation can meet the applications' memory requirement and provide sufficient remote memory bandwidth. It also avoids the increased memory controller overhead of full-system disaggregation <cit.>. However, the impact of memory controller overhead still needs to be explored. Memory Extension: System architects must decide whether remote memory is exposed as a second NUMA node with data movement affected via RDMA (e.g. SHMEM put/get) or uncacheable load/store instructions – or – whether HBM should be viewed as either a hardware-controlled line cache or OS-controlled page cache. The nuance arises in whether applications and processors can express concurrency greater than remote memory's latency-bandwidth product <cit.> given a latency comparable to the 2us observed on a 2021 HPC system and bandwidth varying from PCIe4's 25GB/s to PCIe6's 100GB/s. Inspired by the Roofline model <cit.>, Figure <ref> plots the impact of Little's Law on memory bandwidth for varying access quanta (diagonals) and concurrency (vertical lines). System architects must choose a quanta that attains available bandwidth at an application concurrency less than the processor/system concurrency upper bound. For example, an OS cache sustaining only one outstanding page fault (concurrency≤1) will never be able to sustain even PCIe4 bandwidth with 4KB pages. Similarly, an A100 GPU has insufficient load/store concurrency to sustain PCIe5 bandwidth using coalesced 32B cache lines. Ultimately, vendors must provide either larger pages (e.g ≥256KB), ≥64B cache lines, twice as many load/store units as an A100 GPU, or demand applications continually initiate hundreds of KB-sized asynchronous RDMAs (spread across multiple processes). Lustre Replacement: Lustre is superfluous for applications requiring either private or read-only file access (e.g. AI training data). Vendors wishing to leverage remote memory nodes as a replacement for distributed file systems must provide a file system interface and guarantee durability for the life of a job (more than an individual executable). Our Roofline-inspired Little's Law analysis (Fig. <ref>) still applies. That is, assuming file system software overhead is far less than network latency, applications must both continually read/write 256KB blocks in order to sustain PCIe6 bandwidths whilst ensuring the local to file I/O data movement ratio exceeds 65. Inter-Process Communication: Whereas memory and inter-process communication (e.g. MPI) were traditionally architected with dedicated bandwidths, in disaggregated systems, they will contend for finite PCIe bandwidth. Moreover, collective and point-to-point communication will also contend for the bisection and inject bandwidth. As such, applications with even a modest inter-process to remote memory ratio may see PCIe bandwidth emerge as a bottleneck. Applications with heavy collective communications may be sensitive to the bisection bandwidth. Future Portents: Historically, latency lags bandwidth <cit.>, and to a lesser degree, one expects remote bandwidth to lag local bandwidth. As such, beyond 2026 we expect the latency-bandwidth product (requisite concurrency) to increase nearly as fast as remote bandwidth. Systems in that time frame with require even larger pages, even more concurrent RDMAs (easily realized with more processes per node), or GPUs with even more concurrency (almost guaranteed). Similarly, the hardware local:remote ratio will increase slowly, implying some applications may become remote memory-limited. As such, memory disaggregation will likely continue to be a viable approach so long as network bandwidth increases. Workload Analysis: Whereas this paper focused on analyzing individual applications in a system with disaggregated memory, the ultimate efficacy of such a system is premised on the specific workload requirements. Practitioners wishing to leverage our methodology should characterize their applications along the lines of Fig. <ref> and ratio their compute to memory nodes as: the sum of the node hours of all the applications falling into the blue region divided by the sum of the node hours of all the applications falling into the green and orange regions (scaled by memory capacity/4TB). If the scaled node hours of the green and orange regions dominate, then it indicates that as such a ratio will demand more memory nodes than compute nodes. Similarly, if the scaled node hours of the orange region dominate, the workload is better served with node-local DDR unencumbered by limited PCIe bandwidths. For amenable workloads and collaborative vendors, memory disaggregation will provide a cost-effective means of mitigating the dynamic and highly variable memory requirements found in HPC centers. § ACKNOWLEDGMENTS This material is based upon work supported by the Advanced Scientific Computing Research Program in the U.S. Department of Energy, Office of Science, under Award Number DE-AC02-05CH11231 and used resources of the National Energy Research Scientific Computing Center (NERSC), which is supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC02-05CH11231. Pieter Maris is supported by the US Department of Energy, Office of Science, under Grant DE-SC0023495. Khaled Ibrahim and Tan Nguyen were especially helpful in answering questions on AI workloads. John Wu and Bin Dong were very helpful in providing their knowledge on DASSA.
http://arxiv.org/abs/2306.01946v2	20230602230457	Linearly convergent adjoint free solution of least squares problems by random descent	[ "Dirk A. Lorenz", "Felix Schneppe", "Lionel Tondji" ]	math.NA	[ "math.NA", "cs.NA", "math.OC", "65F10, 68W20, 15A06" ]	Excitations of quantum Ising chain CoNb_2O_6 in low transverse field: quantitative description of bound states stabilized by off-diagonal exchange and applied field Radu Coldea June 2, 2023 ====================================================================================================================================================================== We consider the problem of solving linear least squares problems in a framework where only evaluations of the linear map are possible. We derive randomized methods that do not need any other matrix operations than forward evaluations, especially no evaluation of the adjoint map is needed. Our method is motivated by the simple observation that one can get an unbiased estimate of the application of the adjoint. We show convergence of the method and then derive a more efficient method that uses an exact linesearch. This method, called random descent, resembles known methods in other context and has the randomized coordinate descent method as special case. We provide convergence analysis of the random descent method emphasizing the dependence on the underlying distribution of the random vectors. Furthermore we investigate the applicability of the method in the context of ill-posed inverse problems and show that the method can have beneficial properties when the unknown solution is rough. We illustrate the theoretical findings in numerical examples. One particular result is that the random descent method actually outperforms established transposed-free methods (TFQMR and CGS) in examples. randomized algorithms, least squares problems, stochastic gradient descent 65F10, 68W20, 15A06 § INTRODUCTION §.§ Problem statement We consider the basic problem of solving linear least squares problems min_v∈^m12Av-b^2 with a linear map A from ^d to ^m and b∈^m. We revisit this classical problem under the assumption that A is not given as a matrix, but only an implementation is available that takes as input a vector v∈^d and returns the output Av∈^m. Moreover, we will assume that it is not feasible to store many vectors of either size d and m due to memory constraints (especially we assume that it is not possible to build large parts of the full matrix by computing Ae_i for all standard basis vectors e_i). We do not make any structural assumptions on the linear map A. Especially we consider the over-, under-, and square cases and the cases of full rank and rank deficient maps. If only a program for the evaluation of the linear map A is available, one can not immediately calculate the gradient of the least square function, as this also involves the application of the adjoint linear map (i.e. the transposed matrix A^T) and we assume that no implementation for this is available. We remark that the automatic calculation of gradients can in principle be done by automatic differentiation by taking the derivative of yAx with respect to x. However, this requires that the programming language allows for automatic differentiation and that the program is written in a suitable way. Hence, we work under the assumption, that automatic calculation of the gradient of the least squares function and also any application of A^T to any input (besides the zero vector) is not possible. In this paper we will derive randomized methods which do provable converge to a solution of the least squares functional (in expectation) under our restrictive assumptions formulated above. The idea behind these algorithms is a simple observation: There is a simple way to get an unbiased -sample of the gradient A^T(Av-b) which only uses evaluations of A: Let x∈^d be a random vector such that (xx^T) = I_d. Then it holds that (Av-bAxx) = A^T(Av-b), in other words, Av-bAxx is an unbiased estimator for the gradient of 12Av-b^2. We rewrite Av-bAxx = xAxAv-b = xx^TA^T(Av-b) and see that the result follows from linearity of the expectation. This observation motivates the use of the stochastic gradient method for the minimization of the least squares functional (<ref>) which we state in Algorithm <ref>. We will analyze the convergence of this algorithm in Section <ref> and especially treat the question of suitable choices of the stepsizes τ_k. One observes that the SGDAS method takes a step in a fairly random direction x (it is a simple observation that the coefficient Av^k-bAx turns this direction). This motivates to consider an even simpler method where we omit the coefficient and let the choice of the stepsize do the work to guarantee descent. This method is given in Algorithm <ref>. §.§ Related work Methods for the solution of linear least squares problems or linear equations that only need evaluations of A are known as “transpose-free methods” and an early such method for the case of general square linear systems of equations have been proposed Freund in <cit.> as a generalization of the quasi-minimal residual method named transpose free quasi-minimal residual method (TFQMR).[note that methods for symmetric linear systems often do not make use of the transpose as in this case Ax-b is already the gradient of the objective x^TAx - x^Tb] Slightly later Brezinski and Redivo-Zaglia <cit.> and Chan et al. <cit.> proposed a method of Lanczos type which lead to the conjugate gradient squared method (CGS) proposed by Sonneveld <cit.>. The above methods TFQMR and CGS are available in current software (e.g. in Scipy) and are deterministic. Early randomized methods, again for square linear systems, are based on the idea to reformulate the system Av=b as v = Gb + (I-GA)v for some square matrix G and then consider the solution expressed by the Neumann series v = ∑_r=0^∞(I-GA)^rGb (which converges to the solution if the spectral radius of I-GA is smaller than one). Then an approximate solution is obtained by using a specific random walk to approximate the truncated series, see <cit.>. Since least squares problems are convex optimization problems, also optimization methods can be used, although gradient based methods are usually not applicable since the evaluation of the gradient of Av-b^2 needs the evaluation of A^T. One exception are coordinate descent methods <cit.> which will be a special case of the Random descent method. Another related method is the random search method (see <cit.>). This is a derivative free method for the minimization of a convex objective Φ:^d→ and the iterates are v^k+1 = v^k - γ_kα_k[ Φ(v^k+α_k u) - Φ(v^k) ]u for stepsizes γ_k and discretization length α_k and where u is sampled uniformly from the unit sphere. As discussed in <cit.>, this method converges if Φ has Lipschitz continuous gradient, γ_k is small enough and α_k→ 0. Applied to the objective Φ(v) = 12Av-b^2 we obtain v^k+1 = v^k - γ_kα_k[ 12Av^k+α_kAu - b^2 - 12Av^k-b^2]u = v^k - γ_kAv^k-bAuu - γ_kα_k2Au^2u and if we set α_k=0 in the final expression we obtain the update Algorithm <ref> (but with u being uniformly distributed on the unit sphere). While convergence of the random search method is known, we are not aware of known rates for this method and, to the best of our knowledge, only the case of sampling from the unit sphere has been analyzed. An extension of random search with exact and inexact linesearch (similar to Algorithm <ref>) has been studied in <cit.>. There, the authors obtain convergence rates in the strongly convex case for directions x uniformly distributed on the unit sphere and random coordinate vectors. Later <cit.> studied a related method based on smoothing: For μ>0 the authors consider f_μ(x) = _u(f(x+μ u)) which amounts to a convolution of f with the scaled probability density of u (in <cit.> the authors consider normally distributed search directions). It is observed that ∇ f_μ(x) = 1μ((f(x+μ u) - f(x))u) i.e. that the expectation of the random search step is a gradient step for a smoothed function. The authors derive convergence rates and also an accelerated method. Our method can also be derived from the framework by Gower and Richtarik <cit.>: Their class of methods read as v^k+1 = v^k - B^-1A^TS(S^TAB^-1A^TS)^†S^T(Av^k-b) where S∈^l× m is a random sketching matrix and B∈^d× d is a positive definite matrix. If A has linearly independent columns one can set B = A^TA and use S=Ax∈^m with x∈^d being a random vector one ends up with the random descent method. Finally, note that SGDAS and RD are fundamentally different from the randomized Kaczmarz method <cit.> (which can also be obtained from (<ref>) by choosing B=I_d and S=e_k being a random coordinate vector). The iterates of the Kaczmarz iteration always operate in the range of A^T while SGDAS and RD operate in the full space. §.§ Contribution * We derive transpose free methods that minimize the linear least squares functional which only use applications of A (i.e. no applications of A^T are done and no other data like knowledge of A is used). These methods can be seen as special cases of previously known random search methods, but we obtain more refined convergence results. * We illustrate that these adjoint methods can outperform established methods for least squares problems like TFQMR and CGS. * We do a detailed analysis of the random descent method (Algorithm <ref>) for a class of distributions of the search direction and obtain results on the influence of the distribution of the search direction on the rate. * Without any assumptions on A we show that the residual of the normal equations converges (in expectation) at a sublinear rate. * We analyze the semi-convergence property of the method in the case of inconsistent problems and illustrate that random descent may be beneficial (in comparison to other iterative methods like the Landweber method) for the solution of linear ill-posed inverse problems when the solution is rough. § NOTATION AND BASIC RESULTS We use x to denote the Euclidean norm, write ρ(M) for the spectral radius of a square matrix M, i.e. the maximum magnitude of the eigenvalues of M. With λ_max(M) and λ_min(M) we denote the largest and smallest eigenvalue of a real symmetric matrix M, respectively and σ_min(A) is the smallest singular value of a matrix A. The range of matrix A is denoted by (A) and the kernel by (A). Moreover, denotes the expectation over all involved randomness (if not stated otherwise). § CONVERGENCE RESULTS We start our convergence analysis of SGDAS and RD by stating the standing assumption on the random directions. We assume that our random vector x ∈^d is isotropic, i.e. that is fulfills (xx^T) = I_d. Moreover, we assume that and (xx^Tx^2) = cI_d for some c. Note that by linearity of the expectation we get (x^2) =(x^Tx) = ((xx^T)) = ((xx^T)) = d for random vectors satisfying Assumption <ref> (cf. <cit.>. Examples for random vectors that fulfill Assumption <ref> are: * Vectors that are uniformly distributed on the sphere with radius √(d), i.e. x∼(√(d)^d-1). Here we have x^2=d deterministically and hence (xx^Tx^2) = dI_d which means that c=d. * Normally distributed random vectors, i.e. x∼(0,I_d). In this case one calculates c = (xx^Tx^2) = d+2. * Rademacher vectors, i.e. vectors with entries which are ±1, each with probability 1/2 i.e. (x_k= ± 1) = 12, independently. Here we also have x^2=d deterministically and hence c=d as well. * Random coordinate vectors, i.e. x = √(d)e_k with k being selected uniformly at random from { 1,…,d }, i.e. (x=√(d)e_k) = 1d. Since it holds x^2=d deterministically, it again holds that c=d in this case. §.§ Stochastic gradient descent with adjoint sampling §.§.§ Convergence of the iterates In these paragraphs we are going to investigate convergence of the iterates of Algorithm <ref> similar to the analysis in <cit.>. Let Av=b be a consistent system with solution v̂ and let the sequence (v^k)_k be generated by Algorithm <ref>, where the x are sampled according to Assumption <ref>. Then it holds that (v^k+1-v̂^2) ≤v^k - v̂^2 - τ_k (2-τ_k c A^2) A v^k - b^2 and hence is strictly decreasing and thus convergent when 0<τ<2/(cA^2). Defining g^k as g^k = Av^k-bAxx the update step can be formulated as v^k+1 = v^k - τ_k g^k. Therefore, we get v^k+1 - v̂^2 = v^k - τ_k g^k - v̂^2 = v^k - v̂^2 - 2 τ_k v^k - v̂g^k + τ_k^2 g^k^2. The summands can be rewritten as v^k-v̂g^k = Av^k - bAx·v^k-v̂x = Av^k-bAx·xv^k-v̂ = (Av^k - b)^T A x x^T (v^k -v̂) and g^k^2 = Av^k - bAx^2 x^2 = Av^k - bAxx^2AxAv^k -b = (Av^k - b)^T Axx^Tx^2 A^T(Av^k -b). Hence it follows from Assumption <ref> that (v^k+1-v̂^2) = v^k - v̂^2 - 2 τ_k ( v^k - v̂g^k) + τ_k^2 (g^k^2) = v^k - v̂^2 - 2 τ_k A(v^k-v̂)Av^k-b + τ_k^2 c A^T(Av^k -b)^2 ≤v^k - v̂^2 - 2 τ_k Av^k - b^2 + τ_k^2 c A^2 Av^k-b^2 = v^k - v̂^2 - τ_k (2-τ_k c A^2) Av^k-b^2. Let Av = b be a consistent system with solution v̂ and let the sequence (v^k)_k be generated by Algorithm <ref> where the x are sampled according to Assumption <ref> and where the τ_k fulfill 0 < τ < 2/c A^2. If λ = ρ(I-τ A^T A (2I-τ c A^T A)) ∈ [0,1) is fulfilled, it holds that the iterates converge linearly with (v^k+1-v̂^2) ≤λ^k+1v^0-v̂^2. As in the proof of Theorem <ref> we get (v^k+1 - v̂^2) = v^k - v̂^2 - 2 τ((v^k-v̂)^T A^T A x x^T (v^k - v̂) ) + τ^2 ((v^k-v̂)^T A^T A x x^T x^2 A^T A (v^k - v̂) ) = v^k - v̂^2 - 2 τA(v^k - v̂)^2 + τ^2 c A^TA(v^k - v̂)^2 = v^k- v̂(I- τ A^T A (2 I - τ c A^T A)) (v^k - v̂) ≤ λv^k - v̂^2. Iterating this result obtains the convergence result. To determine the spectral radius λ, we note that A^TA and I-τ A^T A (2I-τ c A^T A) share the eigenvectors and that if μ is an eigenvector of A^TA,then (1- τμ (2 - τ c μ) is an eigenvalue of I-τ A^T A (2I-τ c A^T A). Since the derivative of the right hand side fulfills ∂/∂μ (1- τμ (2 - τ c μ)) = τ (-2 + 2 τ c μ), the function Θ_τ(μ) = (1- τμ (2 - τ c μ)) is convex. Hence, λ is given by λ = max{Θ_τ(λ_min(A^TA)), Θ_τ(λ_max(A^TA))}. Note that λ∈ [0,1) if λ_min(A^TA)>0 and 0 < τ < 2/(cA^2). Hence, we get convergence of the iterates of SGDAS if the system Av=b is overdetermined, has full column rank and is consistent. To determine the optimal stepsize τ, we minimize λ over τ and to do so we set Θ_τ(λ_min(A^TA)) = Θ_τ(λ_max(A^TA)), which results in 1- τλ_min(A^TA) (2-τ c λ_min(A^TA)) = 1- τλ_max(A^TA) (2-τ c λ_max(A^TA)) ⇔λ_min(A^TA) (2-τ c λ_min(A^TA)) = λ_max(A^TA) (2-τ c λ_max(A^TA)) Hence, we get as optimal stepsize τ = 2/cλ_max(A^TA) - λ_min(A^TA)/λ_max(A^TA)^2 - λ_min(A^TA)^2 = 2/c1/λ_max(A^TA) + λ_min(A^TA) Plugging this in we get that the optimal convergence rate is λ = 1 - 4/cλ_max(A^TA)λ_min(A^TA)/(λ_max(A^TA) + λ_min(A^TA))^2. With κ(A) = λ_max(A^TA)/λ_min(A^TA) this is λ = 1 - 4/cκ(A)/(κ(A)+1)^2. Now we consider the inconsistent case, in which we do not assume the existence of a solution. We model this as an additive error and assume that the right hand side is b+r with b ∈(A). Let v̂ fulfill A v̂ = b and let the sequence (v^k)_k be generated by Algorithm <ref> with x are sampled according to Assumption <ref>, stepsizes 0 < τ < 2/c A^2, and where the right hand side is changed to b+r with b ∈(A) and r = r' + r” with r' ∈(A) and r”∈(A)^. Then with λ from (<ref>) it holds that (v^k+1-v̂^2) ≤( 1+λ/2)^k+1v^0-v̂^2 + τ^2 2 ( (1-λ) c + 2 I-τ c A^T A^2 )/(1- λ)^2A^T r'^2 Following the proof of Theorem <ref>, we observe v^k+1 - v̂^2 = v^k - τA v^k - (b+r)Ax x - v̂^2 = v^k - v̂^2 - 2 τ( A(v^k-v̂)Ax - rAx) ·v^k-v̂x + τ^2 A(v^k-v̂)-rAx^2 x^2 As in Theorem <ref> taking the expected value and using Young's inequality with ε>0 results in (v^k+1 - v̂^2) = v^k - v̂^2 - 2 τ((v^k-v̂)^T A^T A x x^T (v^k - v̂) ) + τ^2 (((v^k-v̂)^T A^T) A x x^T x^2 A^T (A (v^k - v̂)) ) + 2 τ(r^T Ax x^T (v^k - v̂)) - 2 τ^2 (r^T Ax x^T x^2 A^T A(v^k-v̂)) + τ^2 (r^T Axx^Tx^2 A^T r) = v^k - v̂^2 - 2 τA(v^k - v̂)^2 + τ^2 c A^TA(v^k - v̂)^2 + 2 τA^T rv^k - v̂ - 2 τ^2 c A^T rA^T A(v^k-v̂) + τ^2 c A^T r^2 = v^k- v̂(I- τ A^T A (2 I - τ c A^T A)) (v^k - v̂) + v^k-v̂2 τ (I - τ c A^T A) A^T r + τ^2 c A^T r^2 ≤ (λ + 1/2 ε) v^k - v̂^2+ τ^2 ( c + 2 εI-τ c A^T A^2 )_=: ΛA^T r^2 , Now we choose ε = 1/1-λ, which yields (v^k - v̂^2) ≤(1+λ/2)^k v^0 - v̂^2 + τ^2 ∑_j=0^k-1(1+λ/2)^j ΛA^T r^2 = (1+λ/2)^k v^0 - v̂^2 + τ^2 ΛA^T r∑_j=0^k-1(1+λ/2)^j ≤(1+λ/2)^k v^0-v̂^2 + τ^2 2 Λ/1- λA^T r^2, where the last inequality is due to the geometric series. Since (A)^ = (A^T), we attain A^Tr” = 0 and hence the result. §.§.§ Convergence of the residual In the results in the previous section we needed λ_min(A^TA)>0 to get that λ <1 and hence, the results are not useful for problems where A^TA is rank deficient, i.e. especially not in the case of underdetermined systems. In this case we do not have unique solutions of Av=b, but a nontrivial solution subspace (in the case of a consistent system). We first show convergence properties of the residual. The following result holds for any linear system Av=b. Let Av=b be a linear system and let the sequence (v^k)_k be generated by Algorithm <ref>, where the x are sampled according to Assumption <ref> and the τ_k fulfill 0 < τ_k < 2/c A^2. Then the residual fulfills (Av^k+1-b^2) ≤Av^k - b^2 - τ_k (2-τ_k c A^2) A^T(A v^k - b)^2 and hence is strictly decreasing and thus convergent. Taking the expected value of Av^k+1-b^2 = Av^k - b^2 - 2 τ_k Av^k-bA g^k + τ_k^2 Ag^k^2 = Av^k - b^2 - 2 τ_k (Av^k-b)^T A xx^T A^T(Av^k-b) + τ_k^2 (Av^k-b)^T A x x^T A^T A x x^T A^T (Av^k -b) and using Assumption <ref> results in (Av^k+1-b^2) =Av^k-b^2 - 2 τ_k A^T(Av^k-b)^2 + τ_k^2 (Axx^T A^T(Av^k-b)^2) ≤Av^k-b^2 - 2 τ_k A^T(Av^k-b)^2 + τ_k^2 A^2(xx^T A^T(Av^k-b)^2) ≤Av^k-b^2 - 2 τ_k A^T(Av^k-b)^2 + τ_k^2 A^2((Av^k-b)^TAxx^Txx^TA^T(Av^k-b)) ≤Av^k-b^2 - 2 τ_k A^T(Av^k-b)^2 + τ_k^2 A^2c A^T(Av^k-b)^2. This leads to (Av^k+1-b^2) ≤Av^k-b^2 - τ_k (2 - τ_k c A^2) A^T(Av^k-b)^2, which leads to the results. Without any assumption in the shape of A, rank or consistency we always get sublinear convergence of the residual of the normal equations: The sequence (v^k)_k be generated by Algorithm <ref> with constant step size τ_k = τ = 1/c A^2, where the x are sampled according to Assumption <ref>. Then it holds that min_0 ≤ k ≤ N-1(A^T(Av^k-b)^2) ≤c A^2 b^2/N. Under the given conditions, Theorem <ref> provides (A^T(Av^k-b)^2) ≤ c A^2 ((Av^k-b^2) - (Av^k+1-b^2)). Hence summing up yields to N ·min_0 ≤ t ≤ N-1(A^T(Av^k-b)^2) ≤∑_k=0^N-1(A^T(Av^k-b)^2) ≤ c A^2 ( (Av^0-b^2) - (Av^N-b^2)) Since v^0 = 0, this becomes N ·min_0 ≤ t ≤ N-1(A^T(Av^k-b)^2) ≤ c A^2 b^2 and thus the result is proven. Let Av = b be a linear system and let the sequence (v^k)_k be generated by Algorithm <ref> with 0 < τ < 2/c A^2, where the x are sampled according to Assumption <ref>. Then it holds that (Av^k+1-b^2) ≤βAv^k-b^2. with β = 1-τσ_min(A)^2 (2 - τ c A^2). If σ_min(A)>0 we have 0<β<1 and hence we have linear convergence (Av^k+1-b^2) ≤β^k+1Av^0-b^2. Similar to the proof of Theorem <ref> we calculate Av^k+1 - b^2 = Av^k - τA v^k - bAx Ax - b^2 = Av^k - b^2 - 2 τAv^k-bAx·Av^k-bAx + τ^2 Av^k-bAx^2 Ax^2 ≤ Av^k - b^2 - 2 τAv^k-bAx^2 + τ^2 A^2 Av^k-bAx^2x^2 Considering (xx^T) = I, taking the expectation leads to (Av^k+1 - b^2) ≤Av^k - b^2 - 2 τ(Av^k-bAx^2) + τ^2 A^2 (Av^k-bAx^2x^2) = Av^k - b^2 - 2 τ(Av^k-bAx^2) + τ^2 A^2 (Av^k-bAx^2x^2) = Av^k - b^2 - 2 τA^T(Av^k-b)^2 + τ^2 A^2 c A^T(Av^k-b)^2 = Av^k - b^2 - τ (2- τ c A^2 ) A^T (Av^k - b)^2 = Av^k-b^2 - τ(2-τ cA^2) σ_min(A)^2Av^k-b^2 = βAv^k - b^2. This proves the first statement. By induction, the second result follows. Minimizing β over τ leads to the optimal stepsize τ = 1/(cA^2) and β = 1 - σ_min(A)^2cA^2. This shows: Let Av = b be a linear system with σ_min(A)>0 and let the sequence (v^k)_k be generated by Algorithm <ref> with τ = 1/c A^2, where the x are sampled according to Assumption <ref>. Then it holds that (Av^k-b^2) ≤(1-σ_min(A)^2/c A^2)^k Av^0-b^2 In conclusion, we have shown that the stochastic gradient method with adjoint sampling leads to a linear converge rate in terms of distance to the solution (if it is unique) and the residual (if the system is consistent). For systems which are not full rank we still get sublinear convergence of the least squares residual. However, all our results have at least two drawbacks: * The convergence is slow due to the factor c which is, in all cases of our random sampling, larger than the input dimension d. * The stepsize conditions depend on the operator norm A, which is usually not known under our assumptions. Both problems can be circumvented by random descent as we show in the next section. §.§ Random descent Now we turn to the analysis of the random descent algorithm (Algorithm <ref>). While this algorithm just takes steps in random directions, we will be able to show linear convergence towards minimizers by using optimal stepsizes. Hence, as a first step, we calculate the optimal stepsize for minimizing the least squares functional in some search direction. The minimum of τ↦12A(v^k+τ x) - b^2 is attained at τ_k = {[ - Av^k - bAx/Ax^2 Ax ≠ 0,; 0 Ax = 0. ]. If Ax = 0, the objective does not depend on τ at all. Otherwise the objective is convex and the minimizer is provided by the solution of 0 = ∂/∂τ1/2A(v^k+τ x) - b^2 = A^T(Av^k + τ A x - b)x = Av^k-bAx + τAx^2, i.e. τ = - Av^k-bAx/Ax^2. Note that this stepsize may be positive or negative. Most notably, we can evaluate this stepsize under our restrictive assumptions stated in the introduction: We only need to evaluate A two times (once at the direction x and once at the current iterate). Moreover, no knowledge of the operator norm of A is needed to use this stepsize in practice. Since this step is optimal in direction x, we immediately get linear convergence of random descent (Algorithm <ref>) with this stepsize by comparison with our results for the stochastic gradient descent (Algorithm <ref>). If v^k+1 = v^k - τ_kx from the random descent with optimal stepsize and ṽ^k+1 = v^k - τAv^k-bAxx with some τ between zero and 2/(cA^2) we always have Av^k+1-b^2≤Aṽ^k+1-b^2, i.e. random descent does decrease the residual faster than stochastic gradient descent with adjoint sampling. Thus, we can transfer some results from the previous section to random descent: Let Av=b be a linear system and let the sequence (v^k)_k be generated by Algorithm <ref>, where the x are sampled according to Assumption <ref> and the τ_k are given by τ_k = - Av^k - bAxAx^2 Then we have min_0 ≤ k ≤ N-1(A^T(Av^k-b)^2) ≤c A^2 b^2/N. Moreover, the sequence (Av^k-b)_k of the residuals is decreasing. If furthermore λ_min(AA^T)>0, then the sequence of expected residuals ((Av^k-b^2))_k does converge at least linearly, i.e. we have (Av^k-b^2) ≤(1- λ_min(AA^T)c A^2)^kAv^0 - b^2. The first result follows directly from Lemma <ref>, while the second is an immediate result of the comparison with Theorem <ref>, Corollary <ref>, in which linear convergence is proven for non-optimal fixed step sizes. We would expect a better convergence rate due to the optimal stepsize. It turns out that the refined convergence analysis differs for different sampling schemes for the random vectors x. The central object is the matrix M := ( xx^TAx^2)∈^d× d where we have to assume that the expectation exists (see Remark <ref> below). One sees that M only depends on the marginal distribution on the unit sphere, so all results that we obtain for the standard normal distribution also apply to the uniform distribution on the sphere. The next theorem shows the role of the matrix M: Let v^k be generated by Algorithm <ref> and assume that M exists. Then it holds * For the expectation with respect to the choice of x in the k-th step we have (Av^k-1-b^2) = Av^k-b^2 - A^T(Av^k-b)M(A^T(Av^k-b). * If λ_min(M)>0 it holds that min_0≤ k≤ N-1A^T(Av^k-b)^2≤b^2λ_min(M)N. * It holds that (Av^k+1-b^2)≤ (1-λ_min(M)σ_min(A)^2)(Av^k-b^2). and (Av^k+1-b^2)≤ (1-λ_min(AMA^T))(Av^k-b^2). For the claim we calculate Av^k-1-b^2 = A(v^k-Av^k-bAxAx^2x)-b^2 = Av^k-b^2 - 2Av^k-bAx^2Ax^2 + Av^k-bAx^2Ax^2Ax^4 = Av^k-b^2 - Av^k-bAx^2Ax^2 = Av^k-b^2 - A^T(Av^k-b)xx^TAx^2A^T(Av^k-b), and taking the expectation over the random choice of x proves the claim. For the second claim we estimate (Av^k-1-b^2) ≤(Av^k-b^2) - λ_min(M)A^T(Av^k-b)^2 and rearranging, summing up and estimating by the minimum gives the claim (similar as in the proof of Theorem <ref>). For the third claim we further estimate A^T(Av^k-b)≥σ_min(A)Av^k-b and get (Av^k+1-b^2) ≤Av^k-b^2 - λ_min(M)σ_min(A)^2Av^k-b^2. The second inequality in 3. follows directly from 1. The two estimates in (<ref>) and (<ref>) in Theorem <ref> 3. are relevant in different circumstances: Estimate (<ref>) with the contraction factor (1-λ_min(M)σ_min(A)^2) is relevant if λ_min(M)>0. Whether this is true depends on the dimensions of A, the distribution of the directions x, and the matrix A (see below for further details). For overdetermined systems A, i.e. for m>d and A with rank d this is true for all the isotropic sampling schemes we considered here. The estimate (<ref>) with contraction factor (1-λ_min(AMA^T)) is only relevant if the minimal eigenvalue is positive. This cannot happen when m>d since AMA^T is m× m with rank at most d. In the case m<d the matrix A has a nontrivial kernel and hence, the expectation (xx^TAx^2) may not exist (in fact, it does not exist for x∼(0,I_d) and x∼(√(d)S^d-1)). However, for the discrete distributions (random coordinate vectors and Rademacher vectors), this depends on whether (x∈(A))>0 or not. If this is not the case, the expectation exists and is finite. Moreover, in this case we have λ_min(AMA^T)>0 for d>m if (A)=d. The convergence speed is governed by spectral properties of M. A simple and crude estimate shows the following bounds for the eigenvalues of M which hold for all isotropic random vectors: Let d≤ m, A∈^m× d and x∈^d be an isotropic random vector. Then it holds for M = (xx^TAx^2) that 1/dσ_max(A)^2I_d M 1/dσ_min(A)^2I_d. Consequently it holds that 1dσ_max(A)^2AA^T(Axx^TA^TAx^2) 1dσ_min(A)^2AA^T1d κ^2I_d. with κ = σ_max(A)^2/σ_min(A)^2 being the condition number of A. Since m≥ d we have σ_min(A)^2x^2≤Ax^2≤σ_max(A)^2x^2 and hence xx^Tσ_max(A)^2x^2≤xx^TAx^2≤xx^Tσ_min(A)^2x^2. Hence, we only have to compute (xx^Tx^2) and for isotropic random variables it holds that (xx^Tx^2) = 1d I_d which proves the claim. Unfortunately, these bounds do not imply any faster convergence for RD in comparison with SGDAS (compare the statements from Theorem <ref> and Corollary <ref> with Theorem <ref> and Proposition <ref>). However, numerical experiments indicate that the smallest and largest eigenvalues of M are usually more close together than the simple bounds from Proposition <ref> suggest. The following lemma shows better bounds for the standard normal distribution (and, by the above remark, the uniform distribution on the sphere): Let x∼(0,I_d) or x∼(√(d)S^d-1)and m>d>2. Then it holds that the matrices A^TA and M = ( xx^TAx^2) can be diagonalized simultaneously. More precisely, if A^TA = U(λ_i)U^T with orthonormal U with columns u_i, i=1,…,d, then M = U(μ_i)U^T and the eigenvalues μ_i of M fulfill 1/2(λ_1 + ⋯ + λ_d)Γ(d2)/Γ(d+12)≤μ_i = ( u_ix^2/∑_j=1^dλ_ju_jx^2) ≤1/d(λ_1·⋯·λ_d)^1/d1/π^d/2Γ(32-1d)Γ(12-1d)^d-1. For i,k∈{ 1,…,d } consider (U^TMU)_i,k = u_i^TMu_k = ( u_ixu_kx∑_j=1^dλ_ju_jx^2). The random variables u_ix and u_kx are uncorrelated and have zero mean and since the denominator ∑_j=1^dλ_ju_jx^2 is independent of the signs of u_ix we get (U^TMU)_i,k = 0 for i≠ k. The formula for μ_i follows from the case i=k. For the upper estimate we denote z_i =u_ix and note that z_i∼(0,1). We use the inequality for the arithmetic and geometric mean λ_1z_1^2 + ⋯ + λ_dz_d^2≥ d ( λ_1z_1^2·⋯·λ_dz_d^2)^1/d. To estimate μ_i we take, without loss of generality i=1 and have μ_1 = 1(2π)^d/2∫_^d^z_1^2/λ_1z_1^2 + ⋯ + λ_dz_d^2e^-z^2/2 z ≤1/d(λ_1·⋯·λ_d)^1/d1/(2π)^d/2∫_ (z_1^2)^1-1/de^-z_1^2/2 z_1∏_j=2^d∫_(z_j^2)^-1/de^-z_j^2/2 z_j. We use the identity ∫_(z^2)^ae^-z^2/2 z = 2^a+12Γ(a+12) (valid for a>-12) and obtain μ_1 ≤1/d(λ_1·⋯·λ_d)^1/d1/(2π)^d/22^32-1dΓ(32-1d)( 2^12-1dΓ(12-1d) )^d-1 = 1/d(λ_1·⋯·λ_d)^1/d1/π^d/2Γ(32-1d)Γ(12-1d)^d-1. Now we turn to the lower estimate. We write the integral in d-dimensional spherical coordinates as μ_1 = 1(2π)^d/2∫_^d^z_1^2/λ_1z_1^2 + ⋯ + λ_dz_d^2e^-z^2/2 z = 1(2π)^d/2∫_0^2π∫_0^π⋯∫_0^π∫_0^∞cos(ϕ_1)^2e^-r^2/2r^d-1sin(ϕ_1)^d-1sin(ϕ_2)^d-2⋯sin(ϕ_d-2)λ_1cos(ϕ_1)^2 + λ_2sin(ϕ_1)^2cos(ϕ_2)^2 + ⋯ + λ_dsin(ϕ_1)^2⋯sin(ϕ_d-1)^2 rϕ_1⋯ϕ_d-1. We estimate all trigonometric functions in the denominator by 1 and get μ_1 ≥1(2π)^d/2∑_j=1^dλ_j∫_0^∞r^d-1e^-r^2/2 r ∫_0^πcos(ϕ_1)^2sin(ϕ_1)^d-2ϕ_1∫_0^πsin(ϕ_2)^d-3ϕ_2⋯ ⋯∫_0^πsin(ϕ_d-2)ϕ_d-2∫_0^2πϕ_d-1. We use the identities ∫_0^∞r^d-1e^-r^2/2 r = 2^(d-2)/2Γ(d2), ∫_0^πsin(ϕ)^mϕ = Γ(m+12)Γ(12)/Γ(m+22), ∫_0^πsin(ϕ)^mcos(ϕ)^2ϕ = Γ(m+12)Γ(32)/Γ(m+32) and get (with Γ(12) = √(π) and Γ(32) = √(π)/2) μ_1 ≥1(2π)^d/2∑_j=1^dλ_j 2^(d-2)/2Γ(d2) Γ(d-12)Γ(32)Γ(d+12)·Γ(d-22)Γ(12)Γ(d-12)·⋯·Γ(32)Γ(12)Γ(2)Γ(1)Γ(12)Γ(32)2π = 2^(d-2)/2Γ(d2)/(2π)^d/2∑_j=1^dλ_jΓ(32)Γ(12)^d-3/Γ(d+12)2π = 1/2(λ_1 + ⋯ + λ_d)Γ(d2)/Γ(d+12). The lower and upper estimates in Lemma <ref> are difficult to interpret. To make them easier we note that for large d Γ(d2)/Γ(d+12) ≈1/√(2d), Γ(32 - 1d) ≈Γ(32) = √(π)/2, Γ(12 - 1d) ≈Γ(12) = √(π) and thus Γ(32-1d)Γ(12-1d)^d-1≈π^d/22. With these approximation we have approximate bounds 1/2√(2d)∑_j=1^dλ_j I_d⪷ M ⪷1/2d(λ_1·⋯·λ_d)^1/dI_d, where λ_i = σ_i(A)^2 are the squares of the singular values of A. Especially, we get the bound λ_min(M)≥ (√(8d)∑_jλ_j)^-1 and since A_F^2 = ∑_jλ_j we get from equation (<ref>) (Av^k+1-b^2) ≤( 1- σ_min(A)^2√(8d)A_F^2)(Av^k-b^2) Likewise we get from (<ref>) that min_0≤ k≤ N-1A^T(Av^k-b)^2≤√(8d)A_F^2b^2N. We remark that the estimates on M are loose and that in practice one usually observes faster convergence. We will do a refined analysis in the next section and show how the iterates “converge along singular vectors”. At the end of this section we have a closer look at the choice of random coordinate vectors. Let x be a random coordinate vector, i.e. x = √(d)e_k with k being selected uniformly at random from { 1,…,d }. Then it holds that M = ( xx^TAx^2) = 1d (a_1^-2,…,a_d^-2) and consequently 1/dmax_j=1…,da_j^2I_d M 1/dmin_j=1,…,da_j^2. We denote the columns of A by a_i, i=1,…,d, and the Ax_2 = √(d)a_k_2 with probability 1/d and it directly follows ( xx^TAx^2) = 1d ∑_k=1^de_ke_k^TAe_k^2 = 1d (a_1^-2,…,a_d^-2). We can also consider sampling of x from non-isotropic distributions, which brings an additional degree of freedom to the setup of the algorithm. However, it is in general hard to come up with sampling schemes that provably improve the convergence rate and are simple to implement in practice. In the case of random coordinate vectors we can consider sampling x = √(d)e_k with probability p_k and get the expectation M = (xx^TAx^2) =(p_1a_1^-2,…,p_da_d^-2). For the special choice p_k = a_k^2/A_F^2 (know from the randomized Kaczmarz method <cit.>) we obtain M = 1A_F^2I_d which leads to the rate (Av^k+1-b^2) ≤( 1- σ_min(A)^2A_F^2)(Av^k-b^2) which is known from <cit.> (see also <cit.>). § ILL POSED PROBLEMS AND CONVERGENCE ALONG SINGULAR VECTORS In this section we will analyze the behavior of the quantities v^k-v̂u_i for iterates v^k and right singular vectors u_i of A. These quantities have been studied in <cit.> (and previous results in a similar direction can be found in <cit.>) for the randomized Kaczmarz iteration and it has been shown that their expectation vanishes at different rates. We will analyze the noisy case, i.e. the case where Av̂ = b but the iteration is run with the right hand side b+r. As a baseline for comparison, we first analyze the iterates of the Landweber iteration. Let A∈^d× m with right and left singular vectors (u_i) and (w_i), respectively, and singular values σ_i. Moreover let b∈^m and v̂∈^d with Av̂= b and b̃ =b+r, v^0∈^d and v^k defined by v^k+1 = v^k - ω A^T(Av^k-b̃) for some stepsize ω>0. Then it holds that v^k-v̂u_i = (1 - ωσ_i^2)^kv^0-v̂u^i + 1-(1-ωσ_i^2)^kσ_irw_i . We calculate v^k+1-v̂u_i = v^k-v̂u_i - ωAv^k-b-rAu_i = v^k-v̂u_i - ωA(v^k-v̂)Au_i + ωrAu_i = v^k-v̂u_i - ωv^k-v̂A^TAu_i + ωσ_irw_i = (1-ωσ_i^2)v^k-v̂u_i + ωσ_irw_i. Recursively, this gives v^k-v̂u_i = (1-ωσ_i^2)^kv^0-v̂u_i + ∑_l=0^k-1(1-ωσ_i^2)^lωσ_irw_i = (1-ωσ_i^2)^kv^0-v̂u_i + 1-(1-ωσ_i^2)^kσ_irw_i This theorem shows the typical semiconvergence property of the Landweber method: the contributions v^k-v̂u_i of the i-th singular vector have a contribution from the initial error v^0-v̂ that decays faster for the larger singular values, and another contribution that does converge to rw_i/σ_i and which is due to the noise. In a similar way we get for the iterates of the random descent method: Let A∈^d× m with right and left singular vectors (u_i) and (w_i), respectively, and singular values σ_i. Moreover let b∈^m and v̂∈^d with Av̂= b and b̃ =b+r, v^0∈^d and let μ_i be the eigenvalues of the matrix M = ( xx^TAx^2). Then the iterates v^k be the iterates of Algorithm <ref> with b̃ instead of b fulfill (v^k-v̂u_i) = (1 - μ_iσ_i^2)^kv^0-v̂u^i + 1-(1-μ_iσ_i^2)^kσ_irw_i. Comparing Theorems <ref> and <ref> we observe that in the case of random descent we get another factor μ_i which depends on i. For the Landweber iteration in Theorem <ref> one takes 0<ω<2/A^2 and we see that if μ_i>ω we have that semiconvergence happens faster for random descent than for the Landweber iteration. We will see the practical implications of this result in numerical experiments in Section <ref>. § NONLINEAR LEAST SQUARES PROBLEMS We extend the stochastic gradient descent with adjoint sampling to nonlinear least squares problems, i.e. we consider a nonlinear map F:^d→^m and b∈^m and aim to solve min_v∈^d12F(v)-b^2. The standard gradient method, also known as non-linear Landweber method, iterates v^k+1 = v^k - τ DF(v^k)^T(F(v^k)-b) where DF(v^k)∈^m× d denotes the Jacobian of F at v^k. The method is known to convergence for 0<τ< 2DF(·)^-2 and has regularizing properties when combined with early stopping <cit.>. If we assume that we do not have access to DF(v)^T we can still use the idea of adjoint sampling and get an unbiased estimate of the gradient: Since (F(v)-bDF(v)xx) = DF(v)^T(F(v)-b) for x according to Assumption <ref>, we could use the term in the expectation to perform stochastic gradient descent, leading to v^k+1 = v^k - τF(v^k)-bDF(v^k)xx. If we further assume that we do not even have access to the derivative of F (and that automatic differentiation is not available), we can approximate DF(v)x by the finite difference, i.e. we use DF(v)x ≈ F(v+x)-F(v). This leads us to the following nonlinear stochastic gradient descent with adjoint sampling method which iterates v^k+1 = v^k - τF(v^k)-bF(v^k+x) - F(v^k)x. Alternatively, we could also view the stochastic gradient descent as v^k+1 = v^k - F(v^k)-bDF(v^k)τ xx and then approximate DF(v)τ x ≈ F(v+τ x)-F(v) which leads to v^k+1 = v^k - F(v^k)-bF(v^k+τ x) - F(v^k)x. Both methods (<ref>) and (<ref>) only use two forward evaluations of the non-linear operator F. § EXPERIMENTS §.§ Comparison with other solvers In this section we compare SGDAS and RD with other solvers for linear system Av=b that meet our requirements, i.e. only with solvers that only need forward evaluations of A and do not need to store a larger number of vectors, namely with TFQMR (<cit.>) and CGS (<cit.>). Note that GMRES also only needs forward evaluations of A, but constructs an orthonormal basis that grows with the number of iterations and hence, does not meet our criteria. Both TFQMR and CGS are designed for square systems but do not assume further structure of the operator A. However, we can turn both over- and underdetermined systems into square systems by adding rows or columns. Although this is pretty straightforward, we include the details for completeness: Underdetermined systems: If A∈^m× d and b∈^m with m< d we define Ã ;= [ A; 0 ]∈^d× d, b̃ := [ b; 0 ]∈^d. Then v solves Ã v = b̃ exactly if it solves Av=b. Overdetermined systems: If m>d we define Ã := [ A 0 ]∈^m× m and have that a vector ṽ = (v^T, w^T)^T solves Ãṽ = b exactly if v solves Av = b. If the system Av=b is inconsistent we still have that ṽ solves Ã^TAṽ = Ã^Tb exactly if v solves A^TAv = A^Tb. We implemented SGDAS and RD in Python using numpy and scipy. We generated several sparse random m× d matrices A, corresponding solutions v̂ and right hand sides b = Av̂ to obtain consistent linear systems. We let the methods SGDAS (Algorithm <ref>) and RD (Algorithm <ref>) run with different isotropic random vectors until a specified relative tolerance Av-b/b was reached or a maximum number of iterations of 10000 has been reached. As a comparison we called TFQMR and CGS from scipy with the same tolerance and maximal number of iterations. In Table <ref> we collect the results for several sizes and densities of A and a fairly large tolerance of 10^-2 and Table <ref> gives results for smaller matrices A and a smaller tolerance of 10^-5. Furthermore, we tested RD on least squares problems from the SuiteSparse Matrix Collection <cit.>. We used matrices of different sizes and let RD, TFQMR and CGS run for 10·max(m,d) iterations or until a tolerance of 10^-2 is reached. We did not include spherical sampling in this case since the iterates are the same as for normal sampling (as the update is zero homogeneous and the spherical uniform distribution is the normalized normal distribution). We report the final relative residual and runtime in Table <ref>. Notably, RD always works and is reasonably fast. Sometimes it is even in faster than TFQMR and CGS. Moreover, TFQMR and CGS sometimes fail dramatically (actually, they fail on most non-square problems). Moreover, as expected, SGDAS is always slower than RD. In conclusion, RD is a reliable and comparable fast method to minimize least squares functionals under the computational constraints that we consider in this paper. §.§ Ill-posed problems In this section we illustrate the effect of the findings from Section <ref>. We consider a simple toy example with d=m=100, namely the discrete counterpart of “inverse integration”. The corresponding map A is the cumulative sum, i.e. (Av)_i = ∑_j=1^iv_i. From Theorems <ref> and <ref> we see that random descent with normally distributed directions has advantages over the Landweber iteration if the eigenvalues μ_i of M are larger than the stepsize ω of the Landweber iteration. In Figure <ref> we plot the values ωσ_i^2 = σ_i^2/A^2 and μ_iσ_i^2. Larger values lead to faster semiconvergence and we observe that the values μ_iσ_i^2 are indeed larger for larger indices i, i.e. for the smaller singular values. This indicates, that random descent should perform favorably if the initial error v^0-v̂ has large contributions from singular vectors from small singular values, i.e. for rough solutions. We constructed a rough solution b and corresponding noisy data b̃ = b+r with little noise (see Figure <ref>). We have run the Landweber iteration as well as random descent (with different sampling of the direction x) and report the decay of residuals and semiconvergence of the errors in Figure <ref>. We observe indeed a faster asymptotic decay of the residual for certain sampling schemes in random descent (namely for spherical, normal and Rademacher directions) than for the Landweber iteration, although the residual decays faster for Landweber in the beginning as predicted by our observation in Figure <ref> and similar for the semiconvergence of the errors. In Table <ref> we report values of the best errors achieved by the methods and also the errors achieved with stopping according to Morozov's discrepancy principle. We observe that the adjoint free methods perform comparable good in terms of reconstruction quality, but are in fact faster than the Landweber iteration. §.§ A non-linear Hammerstein equation Non-linear integral operators of the type F(v)(s) = ∫_0^1k(s,t)f(t,v(t)) t are called Hammerstein operators. The corresponding equations F(v)(s) = b(s) are called Hammerstein equations. In this section we consider the discretization of the equation min_v12F(v)-b^2, F(v)(s) := ∫_0^1s-t v(t)^3 t = b(s). We discretized this operator by approximating the integral with a Riemann sum with respect to an equispaced subdivision with d=200 points. We denote the resulting nonlinear map from ^d to ^d again with F. We generated some v^† and corresponding b = F(v^†) and used Algorithm <ref> (called variant 1) and Algorithm <ref> (called variant 2) both with Rademacher vectors x. The stepsize τ_k = τ in both methods has been chosen by trial and error to τ = 0.5/d (but equal for both methods) so that the least squares objective decreases. Further we compare the method with random search (see <cit.>). The method only relies on the objective Φ(v) = 12F(v)-b^2. In each iteration it samples a vector u uniformly distributed on the unit sphere and iterates v^k+1 = v^k - γ_kα_k[ Φ(v^k+α_ku) - Φ(v^k) ]u. It uses a stepsize γ_k and a discretization length α_k. Convergence can be shown for γ_k=γ small enough and α_k→ 0. We use γ = 2 and α_k = θ^k with θ = 0.99 (also chosen by trial and error). We run all three methods 20 times and plot the relative residuals over iterations for all runs as well as the average over the runs in Figure <ref>. We see that both our variants minimize the residual even with constant stepsize. Moreover, there is a considerable variation in the speed of convergence while variant 1 seems to be faster in this example. The random search method also performs well, but not as good as variant 1 of randomized descent. § ACKNOWLEDGMENTS This work has received funding from the European Union’s Framework Programme for Research and Innovation Horizon 2020 (2014-2020) under the Marie Skłodowska-Curie Grant Agreement No. 861137. siamplain
http://arxiv.org/abs/2306.08556v2	20230614150157	On Darboux theorems for geometric structures induced by closed forms	[ "Xavier Gràcia", "Javier de Lucas", "Xavier Rivas", "Narciso Román-Roy" ]	math.DG	[ "math.DG", "math-ph", "math.MP", "53C15, 53C12, 53D05, 53C10" ]	A pose and shear-based tactile robotic system for object tracking, surface following and object pushing John Lloyd1 and Nathan Lepora2 July 31, 2023 ======================================================================================================= =4pt -2cm This work reviews the classical Darboux theorem for symplectic, presymplectic, and cosymplectic manifolds (which are used to describe regular and singular mechanical systems), and certain cases of multisymplectic manifolds, and extends it in new ways to k-symplectic and k-cosymplectic manifolds (all these structures appear in the geometric formulation of first-order classical field theories). Moreover, we discuss the existence of Darboux theorems for classes of precosymplectic, k-presymplectic, k-precosymplectic, and premultisymplectic manifolds, which are the geometrical structures underlying some kinds of singular field theories. Approaches to Darboux theorems based on flat connections associated with geometric structures are given, while new results on polarisations for (k-)(pre)(co)symplectic structures arise. -0.1cm Keywords: Darboux theorem, flat connection, k-cosymplectic manifold, k-precosymplectic manifold, k-presymplectic manifold, k-symplectic manifold, multisymplectic manifold, premultisymplectic manifold. -0.1cm MSC 2020: Primary: 53C15, 53C12. Secondary: 53D05, 53C10. 1 #11pt 0pt plus 0.1mm § INTRODUCTION Since its very origins, differential geometry has been applied to many branches of mathematical physics to study different kinds of physical systems, and it has led to many developments. Symplectic geometry, namely the study of closed non-degenerate two-forms, the so-called symplectic forms, was one of the first areas of differential geometry to be introduced. Symplectic geometry has its origins in the study of celestial mechanics <cit.>, it has a relevant role in classical mechanics <cit.>, and it has inspired the development of many other useful geometric structures with relevant applications <cit.>. One of the fundamental results in symplectic geometry is the Darboux theorem, which describes the local structure of finite-dimensional symplectic manifolds <cit.>. Roughly speaking, the Darboux theorem states that a symplectic form can be locally written as a differential form with constant coefficients of a particular type, namely as the canonical symplectic form of a cotangent bundle in adapted coordinates, ω = q̣^i∧p̣_i <cit.>. There exist several types of infinite-dimensional symplectic manifolds, and some of them do not admit a Darboux theorem <cit.>. Hereafter, we focus on finite-dimensional manifolds, unless otherwise stated. The Darboux theorem can be proved in different ways <cit.>, and its proof can be extended to presymplectic forms, namely closed two-forms of constant rank <cit.>. It is well-known that symplectic and presymplectic forms describe the phase spaces for autonomous regular and singular dynamical systems in mechanics. For non-autonomous mechanical systems, the suitable structures are the so-called cosymplectic and precosymplectic manifolds <cit.>. As a preliminary goal, this paper reviews the theory of Darboux theorems for symplectic and presymplectic manifolds, and it analyses their relation to the so-called flat compatible symplectic and presymplectic connections <cit.>. Connections are hereafter assumed to be linear and torsionless, being the second condition usual in the literature and a key to the description of certain features of the differential forms and integrable distributions to be studied in this work. We also provide proofs of the Darboux theorems for cosymplectic and precosymplectic manifolds. The Darboux theorem for precosymplectic structures is assumed in many references but its proof seems to be absent in the literature <cit.>. To achieve a geometrical covariant description of (first-order) classical field theories, the above-mentioned structures have been generalised in several ways. The simplest ones are the so-called k-symplectic manifolds, introduced by A. Awane <cit.> and used later by M. de León et al. <cit.> and L.K. Norris <cit.> for describing first-order classical field theories. They coincide with the polysymplectic manifolds described by G.C. Günther <cit.> (although these last ones are different from those introduced by G. Sardanashvily et al. <cit.> and I.V. Kanatchikov <cit.>, that are also called polysymplectic). This structure is used to give a geometric description of regular field theories whose Lagrangian and/or Hamiltonian functions, in a local description, do not depend on the space-time coordinates (or the analogous). In the degenerate case we use k-presymplectic structures, which allow us to describe the corresponding field theories given by singular Lagrangian functions <cit.>. It is worth stressing that there exist several ways of defining k-presymplectic manifolds, some of which have apparently been proposed and studied in the present work for the first time. A natural extension of k-symplectic manifolds are k-cosymplectic manifolds, which enable one to generalise the cosymplectic description of non-autonomous mechanical systems to regular field theories whose Lagrangian and/or Hamiltonian functions, in a local description, depend on the space-time coordinates (or the analogous) <cit.>. As previously, the singular case of these theories leads to the introduction of k-precosymplectic manifolds, which can be defined in different manners, as shown in this paper and studied in previous works <cit.>. The Darboux theorem was generalised and proved for k-symplectic manifolds in <cit.> and for k-cosymplectic manifolds in <cit.>. The Darboux theorem plays a relevant role in these theories since, for instance, it significantly simplifies the proofs of many results <cit.>. In this work, we provide a (as far as we know) new Darboux theorem for k-symplectic and k-cosymplectic linear spaces. We also provide new proofs for the Darboux theorems for k-symplectic and k-cosymplectic manifolds. Our proofs reveal new properties of such types of manifolds concerning the properties of their Lagrangian submanifolds. In particular, new details about the existence of the hereafter called polarisations for k-symplectic and k-cosymplectic manifolds are obtained. Moreover, classical proofs of the k-symplectic manifold rely on coordinates and special, rather lengthy calculations <cit.>. Others are focused on connections and give indirect proofs <cit.>. Meanwhile, our proof of the k-symplectic Darboux theorem is intrinsic and short. Moreover, our proof could have been made shorten by relying on known results, but we decided to give a full explanation of all the structures and results involved, which made it longer than strictly needed to prove the canonical form of k-symplectic manifolds. Darboux theorems for k-symplectic manifolds are closely related to the notion of polarisation <cit.>. This means that we search for coordinates where the k-(co)symplectic structures take a form with constant coefficients of a particular type. Nevertheless, one could find new coordinates where the k-(co)symplectic forms would take constant coefficients of another different type. This would potentially lead to Darboux coordinates of other types. Moreover, one may try to find coordinates to put the differential forms of a k-symplectic structure on a canonical manner. This leads to the existence of a certain type of associated distribution. Notwithstanding, Darboux coordinates can be defined to additionally put a basis of the distribution in a particular manner. It is worth noting that, in the case of k-symplectic manifolds, the conditions to obtain Darboux coordinates putting the associated differential forms into canonical form ensure that there exists a canonical basis of the distribution too. Meanwhile, our k-cosymplectic Darboux theorem shows that the conditions to put the differential forms associated with a k-cosymplectic manifold are different from those needed to ensure also a canonical form for a basis of the associated distribution. Moreover, our analysis also sheds some light in the existence of Darboux coordinates for k-cosymplectic manifolds, and it complements the results given in previous works <cit.>. In particular, it is worth noting that Theorem II.4 and Theorem 5.2.1 in <cit.> can be slightly misleading, as part of the assumptions needed to prove such theorems are only described in Remark 2.5 and Note 5.2.1, after them, respectively. Then, we study k-presymplectic manifolds. These structures appear as a side problem in k-symplectic or multisymplectic theories <cit.>. We here prove that the very definition of a k-presymplectic manifold can be set in different ways, depending on the features that we want them to have, e.g. to fit the analysis of systems we are dealing with. Some of these notions of k-presymplectic manifold do not admit a Darboux theorem of the initially expected form, even for the linear k-presymplectic cases. Then, we study some different possible definitions of k-presymplectic manifolds, and we provide some counterexamples showing that a Darboux theorem does not need to exist for them. This is quite unexpected, as it was previously assumed that Darboux theorems must be satisfied for them. It is worth noting that the authors in <cit.> remark that the existence of a Darboux theorem for k-presymplectic manifolds is an open problem, although they skip this by giving intrinsic proofs of their results. The same happens when we consider k-precosymplectic manifolds <cit.> in order to deal with non-autonomous field theories described by singular Lagrangian functions. As in the k-presymplectic manifolds case, one has the same type of problems and similar solutions are given. A Darboux theorem for precosymplectic manifolds has been provided. Although this result has been used in the literature <cit.>, it seems that a proof is missing. More generally, we have provided definitions of k-pre(co)symplectic manifolds admitting Darboux theorems. This gives an alternative approach to previous point-wise and local Darboux theorems in <cit.> for the k-presymplectic case. Moreover, our point-wise and local k-precosymplectic Darboux theorems seem to be new. Note also that k-precosymplectic manifold do not have canonically defined Reeb vector fields. This causes that the Darboux theorems may not involve the existence of a basis of them given in a canonical form. Moreover, the distribution defined to put the differential forms of k-precosymplectic manifolds in a canonical manner does not admit a canonical basis unless additional conditions are given. Finally, we have the multisymplectic manifolds first introduced by J. Kijowski, W.M. Tulczyjew, and other authors <cit.>, which constitute one of the most generic structures for studying the behaviour of Lagrangian and Hamiltonian field theories (see <cit.> and references therein). Nevertheless, although there are some partial results <cit.>, a Darboux-type theorem for multisymplectic manifolds in general is not known. In particular, a class of multisymplectic manifolds with a local structure defined by Darboux type coordinates was characterised in <cit.>, and certain kinds of multisymplectic manifolds admitting Darboux coordinates have been described in <cit.>, giving a sufficient condition that guarantees the existence of Darboux charts. While studying the different geometric structures, we analyse the existence of linear connections compatible with them. Some of our results are known, see for instance symplectic connections <cit.>, k-symplectic connections <cit.>, k-cosymplectic <cit.>, multisymplectic and polysymplectic connections <cit.>. On the other hand, some of the connections compatible with these and other structures are here proposed. Moreover, we here review the subject and serves as a reference point for further works. The structure of the paper goes as follows. Section <ref> reviews the Darboux theorems for symplectic, presymplectic, cosymplectic, and precosymplectic structures and its relation to flat compatible connections. In Section <ref>, we provide a new proof of the Darboux theorem for k-symplectic manifolds, which is simpler than previous proofs <cit.>. We also discuss the existence of Darboux coordinates in k-presymplectic manifolds and show that in order to ensure its existence, some very restrictive hypothesis are required. Section <ref> is devoted to study the existence of Darboux coordinates in k-(pre)cosymplectic manifolds. We give a new proof of the Darboux theorem for k-cosymplectic manifolds <cit.>. We also see that it is not possible to ensure the existence of Darboux coordinates, unless some additional conditions are imposed. In Section <ref> we review the existing results on Darboux coordinates for (pre)multisymplectic structures. Some new results on this topic are presented. Finally, Section <ref> summarises our results and gives some hints on future work. It is worth noting that we explain how the use of flat connections with torsion may be used to study geometric structures related to differential forms that are not closed, such as contact ones. This will be the topic of another paper. § DARBOUX THEOREMS, FLAT CONNECTIONS, AND SYMPLECTIC-LIKE STRUCTURES Let us set some general assumptions to be used throughout this work. It is hereafter assumed that all structures are smooth. Manifolds are real, Hausdorff, connected, second countable, and finite-dimensional. Differential forms are assumed to have constant rank, unless otherwise stated. Sum over crossed repeated indices is understood. Sometimes, the summation sign, Σ, will be used to make clear the range of the indexes we are summing over. All our considerations are local, to avoid technical problems concerning the global existence of quotient manifolds and similar issues. Hereafter, M and Q are assumed to be manifolds, 𝔛(M) and Ω^k(M) stand for the (M)-modules of vector fields and differential k-forms on M. Moreover, connections are assumed to be linear and torsion-free. More particularly, this section reviews (co)symplectic and (co)presymplectic manifolds and give the corresponding Darboux theorems. It also analyses the relation of Darboux theorems with compatible flat connections. We will also introduce the concept of characteristic distribution, as it will play an important role when generalising, in Sections <ref> and <ref>, the results of this section. §.§ Symplectic and presymplectic manifolds This section reviews the definition of symplectic and presymplectic manifolds, and it also analyses their corresponding Darboux theorems. In the context of presymplectic manifolds, we recall the definition of their characteristic distributions. For symplectic and presymplectic manifolds, the relation between compatible connections and Darboux coordinates is studied. A symplectic manifold is a pair (M,ω), where M is a manifold and ω is a closed differential two-form on M that is non-degenerate, i.e. the contraction _Xω=0, for a vector field X on M, if and only if X=0. The canonical model for symplectic manifolds is the cotangent bundle of a manifold Q, namely ( Q,ω_Q), where ω_Q∈Ω^2( Q) is the canonical symplectic two-form in Q, whose local expression in adapted coordinates {q^i,p_i} of Q on their associated coordinated open subset of Q is ω_Q = q̣^i∧p̣_i. A symplectic manifold (M,ω) gives rise to the musical (vector bundle) isomorphism ♭: Q→ Q and its inverse ♯: Q→ Q naturally induced by the (M)-module isomorphisms ♭(M) ⟶Ω^1(M) X ⟼_Xω and ♯ = ♭^-1. Note that a vector bundle morphism ♭ can be defined for every two-form ω, but ♯ only exists when ♭ is invertible or, equivalently, ω is non-degenerate. Let (M,ω) be a symplectic manifold. Given a distribution D⊂ M, the symplectic orthogonal of D is defined by D^⊥ = ∐_x∈ MD^⊥_x, where D_x^⊥ = {v∈_xM\|ω_x(v,u) = 0, ∀ u∈ D_x} , and ∐_x∈ MD_x^⊥ stands for the disjoint sum of all D_x^⊥ over x∈ M. Symplectic orthogonals allow us to introduce several types of submanifolds of symplectic manifolds. Let (M,ω) be a symplectic manifold and consider a submanifold N⊂ M. Then, * the submanifold N is said to be isotropic, if N⊂ N^⊥. * the submanifold N is coisotropic, if N^⊥⊂ N. * the submanifold N is Lagrangian if it is isotropic and coisotropic, namely if N^⊥ = N. Lagrangian submanifolds are also called maximally isotropic and then 2 N = M. Two symplectic manifolds (M_1,ω_1) and (M_2,ω_2) are symplectomorphic if there exists a diffeomorphism ϕ: M_1→ M_2 such that ϕ^ω_2 = ω_1. The classical Darboux theorem states that every symplectic manifold is locally symplectomorphic to a cotangent bundle endowed with its canonical symplectic structure <cit.>. The Darboux theorem was initially proved by Darboux <cit.>, but its modern standard proof relies on the so-called Moser's trick <cit.>. The statement of the Darboux theorem for symplectic manifolds goes as follows. Let (M, ω) be a symplectic manifold. Then, for every x∈ M, there exist local coordinates { q^i, p_i} around x where ω = q̣^i∧p̣_i. Note that the Darboux theorem amounts to saying that there exist, on a neighbourhood of any x∈ M, two foliations by transversal Lagrangian submanifolds. In infinite-dimensional manifolds, one can still define a symplectic form, but the induced musical morphism ♭:(M)→Ω^1(M) is, in general, only injective. This gives rise to the so-called weak symplectic manifolds. Meanwhile, if ♭:𝔛(M)→Ω^1(M) is an isomorphism, then the symplectic manifold is said to be a strong symplectic manifold. There exists no Darboux theorem for general weak symplectic manifolds <cit.>. Nevertheless, by requiring appropriate additional conditions, an analogue can be derived <cit.>. Let us introduce the notion of symplectic connection <cit.>. Note that the torsion-free assumption is common in the literature, and it is a key for certain results to be developed. Indeed, we will show in Section <ref> that skipping it leads to a more general theory, but more involved, inappropriate, and unnecessary for our present work. Apart from that last comment to be given in the conclusions of this work, all connections are assumed to be torsion-free, unless otherwise stated. A symplectic connection on a symplectic manifold (M,ω) is a connection ∇ on M such that ∇ω = 0. The symplectic form ω is said to be parallel relative to ∇. Every symplectic manifold admits local symplectic connections. Indeed, as a consequence of the Darboux theorem, one can construct a local symplectic flat connection for (M,ω) around every x∈ M by assuming that its Christoffel symbols vanish in some Darboux coordinates defined around x. Such a connection is flat and torsion-free. In general, flat symplectic connections cannot be globally defined, as it is known that the curvature of a connection is linked to the topology of the manifold where it is defined on. Milnor proved and surveyed in <cit.> several results on the existence of connections on the tangent bundle to a manifold. For instance, the tangent bundle to a closed and oriented surface of genus g has no flat connection if \|2-2g\|≥ g. The sphere ^2 has zero genus. Hence, there is no flat connection on ^2, which admits a natural symplectic structure ω_^2 that can be defined by considering ^2 embedded in ^3 and setting (ω_^2)_x(v_x,v'_x)=⟨ x,v_x× v'_x⟩ , ∀ x∈ℝ^3 , ∀ v_x,v'_x∈_x^2⊂_x^3≃^3 , where tangent vectors at x∈^2 are naturally understood as vectors in ℝ^3 and, hence, their vector products are defined. Meanwhile, ⟨·,·⟩ stands for the natural scalar product in ℝ^3. Let us recall that, if a connection is flat, the parallel transport of a tangent vector along a path contained in a small open set U does not depend on the path. Thus, a basis {e_1,…,e_n} of _xM gives rise, by parallel transport, to a family of vector fields X_1,…,X_n on U⊂ M, such that X_i(x)=e_i for i=1,…,n. Then, ∇_X_iX_j=0 and, since ∇ is torsion-free, one has that 0=T(X_i,X_j)=∇_X_iX_j-∇_X_jX_i-[X_i,X_j]=-[X_i,X_j] , ∀ i,j=1,…,n . Hence, there exist coordinates {x^1,…,x^n} on a neighbourhood of x such that X_i=∂/∂ x^i for i=1,…,n. Moreover, the Christoffel symbols of the connection vanish on U. Using the above result and assuming the local existence of a flat torsion-free connection compatible with a symplectic form, one may prove the Darboux theorem in a very easy manner. In fact, every symplectic form ω on M can be put into canonical form at any point x∈ M for a certain basis {e_1,…,e_n} of _xM, i.e. ω_x=∑_i=1^ne^2i-1∧ e^2i . Recall that on a neighbourhood of every point x∈ M, one can define a coordinate system {x^1,…,x^n} around x so that there exists vector fields X_i=∂/∂ x^i, with i=1,…,n, such that ∇_X^iX^j=0 , ∀ i,j=1,…,n , and X_i(x)=e_i for i=1,…,n. Since ∇ is a compatible symplectic connection for ω, one has that ∇_X^iω(X^j,X^k)=0 , ∀ i,j,k=1,…,n . Hence, one has ω = ∑_i=1^2nx̣^2i-1∧x̣^2i . In a similar way, but weakening the conditions in Definition <ref>, we can introduce the concept of presymplectic manifold. Recall that we assume differential forms to have constant rank. A presymplectic form on M is a closed two-form ω∈Ω^2(M) of constant rank. The pair (M,ω) is called a presymplectic manifold. Let us construct a prototypical example of presymplectic manifold. Let (M,ω) be a symplectic manifold, and let N be a submanifold of M. Consider the canonical embedding denoted by _N N ↪ M, and endow N with the induced two-form ω_N = _N^∗ω, which is closed. Then, (N, ω_N) is a presymplectic manifold provided the rank of ω_N is constant. To see that the condition on the rank of _N^ω is necessary, let us consider the counter example given by the canonical two form, ω=x̣∧p̣_x+ỵ∧p̣_y, on ℝ^2 and the immersed submanifold given by _ℝ:(x,p_x)∈ℝ↦ (x,p_x^2/2,0,p_x)∈ℝ×ℝ≃ℝ^2. Then, _ℝ^ω=p_xx̣∧p̣_x, which is not symplectic at the zero section of ℝ. Before introducing the characteristic distribution associated with a presymplectic manifold, let us fix some terminology about distributions. A (generalised) distribution on M is a subset D⊂ M such that D∩_xM is a vector subspace of _xM for every x∈ M. A distribution D on M is said to be smooth if, for every x∈ M, there exists a neighbourhood U_x of x and (smooth) vector fields X_1,…,X_k on U_x so that D_y=⟨ X_1(y),…,X_k(y)⟩ for every y∈ U_x. A generalised distribution D is regular if it is smooth and has constant rank. A (generalised) codistribution on M is a subset C⊂ M such that C_x = C∩_xM is a vector subspace of _xM for every x∈ M. The smooth and/or regular notions introduced for distributions also apply to codistributions. Given a presymplectic manifold (M,ω), its characteristic distribution is the distribution _ω = ω = { v∈ M \|ω(v,·) = 0 } . A vector field X∈(M) belonging to _ω, i.e. such that _Xω = 0, is called a characteristic vector field of (M,ω). Note that _ω = ♭. In the case of symplectic manifolds, ♭ is a vector bundle isomorphism, and thus _ω = {0}. Moreover, _ω is a distribution because ω has constant rank. But the kernel of a general closed two-form does not need to be a smooth generalised distribution. For example, ω_P=(x^2+y^2)x̣∧ỵ is a closed two-form on ^2, but it is not presymplectic, as its rank is not constant. Moreover, ω_P is a generalised distribution (ω_P)_(0,0) = _(0,0)^2 while (ω_P)_(x,y)=0 for every (x,y)∈ℝ^2 different from (0,0). Indeed, ω_P is not even a smooth generalised distribution. The characteristic distribution _ω of a presymplectic manifold (M,ω) is integrable. The integrability of _ω follows from the closedness of the symplectic form ω, the constancy of his rank, and the Frobenius theorem. If ω is a presymplectic form on M, its characteristic distribution is integrable. Moreover, around every x∈ M, there exists an open neighbourhood U of x such that the space of integral leaves of _ω, let us say U/_ω, admits a natural manifold structure and the projection π:U→ U/_ω is a submersion. Let us prove this fact. Since 𝒞_ω is integrable, the Frobenius theorem ensures that, for every x∈ M, there exists a local basis of vector fields, {∂/∂ x^1,…,∂/∂ x^k}, spanning 𝒞_ω on a coordinated neighbourhood U_x of x with coordinates {x^1,…,x^n}. In a small enough open subset U of U_x containing x, one can assume that x^1,…,x^n take values in an open ball of ℝ^n. Then, the space of leaves of U/𝒞_ω is a manifold of dimension n-k and the mapping π:U→ℝ^n-k is an open submersion. We will then say that 𝒞_ω is simple on U. Since ω is invariant relative to the elements of its characteristic distribution, and it vanishes on them, there exists a unique two-form ω on U/_ω such that π^ω= ω. In this way, ω is closed and nondegenerate because if _X_ω= 0, then there exists a vector field X on U such that π_X = X_, and then _Xω=0. Since _ω = ω = π, then X_ = 0. With this in mind, we are ready to state the Darboux theorem for presymplectic forms. Note that this theorem can be stated since presymplectic forms are assumed to have constant rank. Otherwise, it would be difficult to establish a series of canonical forms for closed two-forms even in the most simple cases, e.g. on ℝ^2. Consider a presymplectic manifold (M,ω). Around every point x∈ M, there exist local coordinates {q^i,p_i,z^j}, where i = 1,…, r and j = 1,…,d, such that ω = ∑_i=1^rq̣^i∧p̣_i , where 2r is the rank of ω. In particular, if r=0, then ω=0 and d= M. If 2r= M, then d=0 and {q^i,p_i} give a local coordinate system of M. Consider an open neighbourhood V of x∈ M where the integral foliation ℱ defined by the distribution _ω = ω is simple. Let P be the manifold of leaves of ℱV and let π V→ P be the canonical projection. There exists a symplectic form ω̅ on P given by ω = π^∗ω̅. The Darboux theorem for symplectic manifolds ensures that there exists an open coordinate neighbourhood U̅⊂ P of π(x) with local coordinates {q̅^1,…,q̅^r, p̅_1,…,p̅_r} such that ω̅= ∑_i=1^ṛ̅q^i∧̣̅p_i on U̅. Define q^i = q̅^i∘π and p_i = p̅_i∘π for i=1,…, r and we choose d= M - 2r other functions z^1,…,z^d, functionally independent relative to the previous ones. This gives rise to a local coordinate system {q^1,…,q^r,p_1,…,p_r,z^1,…,z^d} around x. This chart satisfies the conditions of the theorem. The definition of a presymplectic connection is a straightforward generalisation of Definition <ref> to the presymplectic realm (see <cit.>). A presymplectic connection relative to a presymplectic manifold (M,ω) is a connection ∇ on M such that ∇ω = 0. The Darboux theorem for presymplectic forms implies that there exists, locally, a flat presymplectic connection. The other way around, the existence of a flat presymplectic connection for a presymplectic manifold (M,ω) allows us to prove the Darboux theorem as in the case of symplectic forms. In particular, we have proved the following. Every presymplectic manifold (M,ω) admits locally defined flat presymplectic connections ∇, i.e. ∇ω=0. At this point, it becomes clear that if a differential form admits a compatible flat torsion-less connection, it must be closed. Hence, no flat torsion-less compatible connection exist for contact forms, locally conformally symplectic forms, and other differential forms that are not closed <cit.>. We have stressed the word “torsion-less" unless every connection in this work is assumed to be so, because in the conclusions of this work will show that removing this condition may lead to deal with no-closed differential forms. §.§ Cosymplectic and precosymplectic manifolds Let us review the definition of cosymplectic <cit.> and precosymplectic <cit.> manifolds, their corresponding Darboux theorems, and their relations to flat cosymplectic and precosymplectic connections. A cosymplectic structure in M is a pair (ω,η), where ω∈Ω^2(M) and η∈Ω^1(M) are closed differential forms such that η does not vanish and η⊕ω = M. The triple (M,ω,η) is said to be a cosymplectic manifold. Note that a cosymplectic structure on M implies that M is odd-dimensional. The fact that η is non-vanishing implies that ⟨η⟩⊕ω = M and M = 2n+1 for n≥ 0. Then, (M,ω,η) is a cosymplectic manifold if and only if η∧ω^n is a volume form on M, where we assume that ω^0=1. In particular, a cosymplectic manifold (M,ω,η) yields a presymplectic manifold (M,ω). Note that the case M=1 may give rise to a cosymplectic manifold according to our definition <cit.>. The characteristic distribution of a cosymplectic manifold (M,ω,η) is the rank one distribution given by _ω = ω, and it is often called the Reeb distribution. The following proposition states that (M,ω,η) induces a unique distinguished vector field, called Reeb vector field, taking values in ω. Given a cosymplectic manifold (M, ω,η), there exists a unique vector field R∈(M) that satisfies _Rη = 1 , _Rω = 0 . A cosymplectic manifold (M,ω,η) induces a (M)-module isomorphism ♭𝔛(M)→Ω^1(M) given by ♭(X) = _Xω + (_Xη)η, whose inverse map is denoted by ♯ = ♭^-1. Then, the Reeb vector field R reads R = ♯η . Consider the product manifold × Q and the projections π_1× Q→ and π_2× Q→ Q onto the first and second manifolds in × Q. If t is the natural coordinate in and ω_Q is the canonical symplectic form on ^Q, then the triple (×^∗ Q,π_2^∗ω_Q,π_1^∗ṭ) is a cosymplectic manifold. Let us consider the pull-back of t to × Q via π_1, and the pull-back of some Darboux coordinates {q^i,p_i} for ω_Q to × Q via π_2. Let us denote such pull-backs in the same way as the original coordinates to simplify the notation. Then, in the coordinates {t, q^i, p_i}, the Reeb vector field of (× Q,π_2^∗ω_Q,π_1^∗ṭ) read ∂/∂ t. Locally, π_2^ω_Q=q̣^i∧p̣_i and π_1^ṭ = ṭ. Given a cosymplectic manifold (M, ω, η), there exists, around each point x∈ M, local coordinates {t, q^i, p_i}, where 1≤ i≤ n, such that η = ṭ , ω = q̣^i∧p̣_i . Since (M,ω) is a presymplectic manifold and ω has corank one, there exist for any point x∈ M a neighbourhood U of x with coordinates {s,q^i,p_i}, with i=1,…,n, so that ω=q̣^i∧p̣_i. Consider now a potential function of η, which exists because η is closed, and denote it by t. Since η∧ω^n is a volume form, {t,q^i,p_i} is a coordinate system around x and η = ṭ and ω = q̣^i∧p̣_i. The Darboux theorem for cosymplectic manifolds states that every cosymplectic manifold is locally diffeomorphic to the canonical model (<ref>) (see <cit.>). In Darboux coordinates, the Reeb vector field R for a cosymplectic manifold (M,ω,η) is written as R = t. The Darboux theorem for cosymplectic structures implies that there exists, around each point, a flat connection ∇ such that ∇η = 0 and ∇ω = 0. Indeed, ∇ can be chosen to be the connection with zero Christoffel symbols relative to some Darboux coordinates. This justifies the following definition. A cosymplectic connection relative to (M,ω,η) is a connection on M such that ∇η = 0 and ∇ω = 0. Let us show that the existence of flat cosymplectic connections allows us to prove the Darboux theorem for (M,ω,η). At a point x∈ M, the fact that η_x⊕ω_x=_xM implies that there exists a basis of _xM of the form {e_1,…, e_2n+1} so that η_x=e^2n+1 and ω_x=∑_i=1^ne^2i-1∧ e^2i relative to the dual basis {e^1,…,e^2n+1} in _x M. Due to the fact that ∇ is flat, there exists a family of commuting parallel vector fields X_1,…,X_2n+1 such that X_i(x)=e_i for i=1,…,2n+1. Since ∇_X_i[η(X_j)]=0 , ∇_X_i[ω(X_j,X_k)]=0 , i,j,k=1,…, 2n+1 , the dual basis of differential one-forms τ^1,…,τ^2n+1 to X_1,…,X_2n+1 is such that η=τ^2n+1, ω=∑_i=1^nτ^2i-1∧τ^2i . Since X_1,…,X_2n+1 admit a coordinate system so that X_i=∂/∂ x_i, with i=1,…,2n+1, then τ^i=x̣^i for i=1,…,2n+1, and the Darboux theorem for cosymplectic manifolds follows. Note that this is due to the fact that the connection is assumed to be torsion-free. Cosymplectic manifolds can be generalised by assuming that η∈Ω^1(M) and ω∈Ω^2(M) are closed forms on M, but η∩ω is a distribution of fixed rank that is not necessarily zero. This implies that ω is a presymplectic form on M. This gives rise to the definition of a precosymplectic manifold. When η∩ω={ 0}, one retrieves the definition of a cosymplectic manifold. A precosymplectic structure in M is a pair (ω,η), where ω∈Ω^2(M) and η∈Ω^1(M) are closed differential forms such that η∩ω is a regular distribution strictly included in ω at every x∈ M. If ω = 2r< M, the triple (M,ω,η) is said to be a precosymplectic manifold of rank 2r. It is worth stressing that the fact that η∩ω is a regular distribution strictly contained in ω implies that η∧ω^r is a non-vanishing form and ω^r+1 = 0 for a certain fixed r, and conversely. Therefore, ω has constant rank 2r, with 2r < M. Let (P,ω) be a presymplectic manifold with Darboux coordinates {q^i,p_i,z^j}. Consider the manifold × P with the induced coordinates {t,q^i,p_i,z^j} obtained as usual, namely, q^i,p_i,z^j are the pull-back to ℝ× P of the chosen variables in P. Then, (× P,π_2^ω ,π^_1ṭ) is a precosymplectic manifold. In the obtained local coordinates, π^_2ω=q̣^i∧p̣_i while π^_1ṭ is denoted by ṭ to simplify the notation. Consider the regular distribution D=ω∩η of a precosymplectic manifold (M,ω,η). Then, D is involutive because ω and η are so. The foliation associated with D defines a local projection π M→M = M / (ω∩η) , where M is the quotient manifold of the leaves of D. Recall that we are assuming that M is a manifold for simplicity. Indeed, one of the general assumptions of our paper is that manifold structures and other existing mathematical local structures are defined globally. In reality, one can only ensure that for every x∈ M and a local neighbourhood U_x of x, the space M/(ω∩η) is a manifold. Hence, by our general assumptions, there exists a unique cosymplectic structure (ω,η) on M such that π^∗ω= ω and π^∗η= η. As in the case of cosymplectic manifolds, we can define special types of vector fields for precosymplectic manifolds. Given a precosymplectic manifold (M,ω,η), a vector field X∈𝔛(M) satisfying _Xω = 0 , _Xη = 1 , is called a Reeb vector field. The space generated by Reeb vector fields, namely ω, is called the Reeb distribution of (M,ω,η). Note that, if R∈(M) is a Reeb vector field, then R+Y is also a Reeb vector field for every Y ∈ω∩η. In other words, Reeb vector fields for precosymplectic manifolds need not be univocally defined. Finally, let us state the Darboux theorem for precosymplectic manifolds, whose proof seems, as far as we know, to be absent in the literature. Nevertheless, it is always implicitly assumed that it holds <cit.> and it is quite straightforward. Let (M,ω,η) be a precosymplectic manifold with ω=2r≤ M-1. For every x∈ M, there exist local coordinates {t, q^i, p_i, z^j} around x, where 1≤ i≤ r and 1≤ j≤ M - 1 - 2r, such that η = ṭ , ω = ∑_i=1^rq̣^i∧p̣_i . Since ω is a presymplectic form, there exist coordinates {q^i,p_i,z'_i} on a neighbourhood U of x such that ω =∑_i=1^r q̣^i∧p̣_i. Since (η∩ω )^ ∘=⟨η⟩⊕ Im ω and η does not vanish, one has that ω≤ M-1. One the other hand, η is closed and, therefore, there exists a function t on U, where U can be chosen smaller if necessary, such that η = ṭ and ω=q̣^i∧p̣_i. Since η∧ω^r does not vanish, {t,q^i,p_i} are functionally independent functions. Finally, one can choose additional functionally independent coordinates, z^1,…,z^n with respect to {t,q^i,p_i} and (<ref>) will hold. As in the previous cases, there exists a locally defined flat connection ∇ whose Christoffel symbols vanish on the chosen Darboux coordinates. Then, η and ω become parallel differential forms relative to ∇. This motivates the following natural definition. A precosymplectic connection relative to a precosymplectic manifold (M,η,ω) is a connection on M such that ∇η=0 and ∇ω=0. Note that, as previously, the existence of a flat precosymplectic connection allows one to provide a brief proof of the Darboux theorem for precosymplectic manifolds. § –SYMPLECTIC AND –PRESYMPLECTIC MANIFOLDS Let us introduce and provide Darboux theorems for k-symplectic manifolds. This will give a new, complementary approach, to the classical results <cit.> and some new more modern approaches <cit.>. Moreover, we will discuss the existence of Darboux theorems for k-presymplectic manifolds. Furthermore, this will be done by providing new simpler, shorter and more geometrical proofs of Darboux theorems for k-symplectic manifolds while giving more details and, as far as we know, a new Darboux theorem for linear spaces <cit.>. Additionally, we will give a new proof about the existence of a complementary for a polarisation that is isotropic relative to the differential two-forms of a k-symplectic structure. On the other hand, Darboux theorems give rise to the hereafter called flat k-symplectic and k-presymplectic connections, which, in turn, lead to other proofs of respective Darboux theorems. It is worth noting that an alternative, somehow different, development of these ideas for the k-symplectic case can be found in <cit.>. Moreover, some new structures will arise in our approach and our results concerning k-presymplectic manifolds seem to be absolutely new. Let M be an n(k+1)-dimensional manifold. A k-symplectic structure on M is a family (ω^1,…, ω^k,V), where V is an integrable distribution on M of rank nk, and ω^1,…,ω^k are closed differential 2-forms on M satisfying that * ω^αV× V=0, for 1≤α≤ k, * ⋂_α=1^k ω^α = {0}. Under the above hypotheses, (M,ω^1,…,ω^k,V) is called a k-symplectic manifold. We call V a polarisation of the k-symplectic manifold. Our notion of k-symplectic manifold matches the one given by A. Awane <cit.>. Moreover, it is equivalent to the concepts of standard polysymplectic structure of C. Günther <cit.> and integrable p-almost cotangent structure introduced by M. de León et al <cit.>. In the case k=1, Awane's definition reduces to the notion of polarised symplectic manifold, that is a symplectic manifold with a Lagrangian foliation. We will illustrate in forthcoming examples that the distribution V is needed to ensure the existence of a particular type of Darboux coordinates. In fact, Günther calls polysymplectic manifolds the differential geometric structures obtained from our definition by removing the existence of the distribution V. Meanwhile, a standard polysymplectic manifold in Günther's paper is a polysymplectic manifold admitting an atlas of Darboux coordinates. Note that a polysymplectic manifold may have atlas of Darboux coordinates without a distribution V. In a particular case, if we think of symplectic manifolds as a one-symplectic manifold, then it is clear that it has local Darboux coordinates, but the standard symplectic manifold on the sphere does not have a polarisation <cit.>. Then, Günther's definition is more general than ours, while it is equivalent to our definition if the compatibility of two charts Darboux coordinates {y^i,p^α_i} and {x^i,π^α_i} involves that x=x(y) and the momenta are transformed accordingly, namely π^α=π^α(y,p) are the momenta of the {x^i}. Otherwise, the equivalence is only local. Let us provide a Darboux theorem at the tangent space of a point of a k-symplectic manifold. Since every k-symplectic manifold (M,ω^1,…,ω^k,V) induces at every _xM for x∈ M a so-called k-symplectic vector space, Theorem <ref> can be understood as a Darboux theorem for k-symplectic vector spaces. (k-symplectic linear Darboux theorem) Assume that (M,ω^1,…,ω^k,V) is a k-symplectic manifold. For every x∈ M, there exists a basis {e^1,…,e^n;e_1^β,…,e_n^β}_β=1,…,k of _xM such that ω^β=∑_i=1^ne^i∧ e_i^β , V=⊕_α=1^kV_α, V_β=⟨ e^1_β,…, e^n_β⟩, β=1,…,k . Note that {e_1,…,e_n,e_β^1,…,e_β^n} is the dual basis in _xM. The result amounts to the Darboux theorem for symplectic linear spaces for k=1. Hence, let us assume k>1. Since {0}=⋂_α=1^kω^α, one has that ^_xM = ω^1_x + … + ω^k_x , ∀ x∈ M . Although all posterior structures in this proof refer to the point x, the point will be omitted to simplify the notation. Since ω^β\|_V× V=0, one has that ω^β(V)⊂ V^∘ for β=1,…,k. If W is a regular distribution supplementary to V, then W=n, and ω ^β (W )≤ n. Note that ω^1(V)+…+ω^k(V)⊂ V^∘ . Due to (<ref>) and the above discussion, one has that ω^1(W)+…+ω^k(W) is a distribution of rank nk, at least. This implies that ω^β(W)=n and ω^1(W)⊕…⊕ω^k(W)⊕ V^∘ = ^M , V^∘=ω^1(V)+…+ω^k(V) . If ω^α(v+w)=0, where v∈ V and w∈ W, then ω^α(v)=-ω^α(w). Since ω^α(W)∩ω^α(V)=0 and ω^α\|_W=n, then ω^α(v)=0 and ω^α(w)=0, which implies that w=0 and v∈ω^α. Hence, ω^α⊂ V. We can consider the distributions V_β = ⋂_1 ≤α≤ k α≠βω^α , β=1,…,k≠ 1 , or V^1=V (k=1) . Note that ω^β(V_α)=0 for α≠β and for every α,β=1,…,k. Let {w_1,…, w_n} be a basis of W. Since ω^α(W) has rank n and its elements do not belong to V^∘, then the restrictions of ω^α(w_1),…,ω^α(w_n) to V are linearly independent and there exist v_1,…,v_n in V such that ω^α(v_1),…,ω^α(v_n) are linearly independent on W, e.g. ω^α(w_i,v_j) = δ_ij for i,j=1,…,n. Hence, ω^α(V)≥ n. Since ω^α(V)⊂ V^∘, then ω^α(V)=n. In particular, ω^α(V)=n for every α=1,…,k. Since ⋂_α=1^kω^α=0 and Im ω^α(V)⊂ V^α for α=1,…,k, it follows that ϕ:v∈ V↦ (ω^1(v),…,ω^k(v))∈ V^∘⊕(k)…⊕ V^∘, where ⊕ stands for a Whitney sum of vector bundles in the natural way, is injective. Hence, ϕ becomes an isomorphism and V≃⊕_α=1^kV_α. Indeed, v=∑_α=1^kϕ^-1( pr_α(v)), where pr_α:(w_1,…,w_k)∈ V^∘⊕…⊕ V^∘↦ (0,…,0,w_α,0,…,0)↦ V^∘⊕…⊕ V^∘, is the corresponding decomposition. Since V = ⊕_α=1^k V_α and ω^β(V_β)⊂ V^∘ has the same rank as V^β, it follows that V_β=n. Hence, one can consider a basis {e^1,…,e^n} of V^∘. There exists a basis f_β^1,…,f_β^n of each V^β such that ω^α(f_β^i)=-e^iδ_α^β for i=1,…,n and α,β=1 …,k. Considering a dual basis {f^β_i,e^i} of _x^M, one has that ω^β = e^i∧ f^β_i + c_ij^β e^i∧ e^j , β=1,…,k . If e^β_i=f^β_i+c_ij^β e^j, then ω^β = ∑_i=2^n e^i∧ e^β_i , β=1,…,k . Note that the change on the covectors e^β_i implies that, in the dual bases to the bases {e^i,e_i^α} and {e^i,f_i^α} in _x^M, one has that f_α^i=e_α^i for α=1,…,k and i=1,…,n. Hence, V_α= ⟨ f_α^1,…,f^n_α⟩=⟨ e_α^1, …,e_α^n⟩ for α=1,…,k. It stems from Theorem <ref> that ω^1,…,ω^k have constant rank. This fact comes from the definition of k-symplectic structure, the dimension of M, and the rank of V. Note also that the last paragraph in the proof of Theorem <ref> can be almost straightforwardly changed to put a symplectic linear form and a Lagrangian subspace into a canonical form. Given a k-symplectic manifold (M,ω^1,…,ω^k,V) with k≠ 1, we set V_β= ⋂_α=1 α≠β^kω^α , β=1,…,k. For a k-symplectic manifold (M,ω^1,…,ω^k, V), the distributions V^1,…,V^k satisfy that every x∈ M admits a coordinate system {y^1,…,y^n;y^α_1,…,y_n^α} on a neighbourhood of x so that V_α = ⟨∂/∂ y^α_1,…,∂/∂ y^α_n⟩ , α=1,…,k. Let y^1,…,y^n be common functionally independent first-integrals for all vector fields taking values in V. If k=1, the result follows trivially, so we assume k> 1. Given different α_1,…,α_k-1∈{1,…,k}, one has that V_α_1⊕…⊕ V_α_k-1=ω^β, where β is the only number in {1,…,k} not included in {α_1,…,α_k-1}. Hence, the distribution V_α_1⊕…⊕ V_α_k-1 has rank n(k-1), it is integrable because ω^β is closed, and the vector fields taking values in it have n common local first-integrals y^β_1,…,y^β_n such that ỵ^β_1∧…∧ỵ^β_n∧ỵ^1∧…∧ỵ^n≠ 0. By construction, {y^1_1,…,y^1_n,…,y^k_1,…,y^k_n,y^1,…,y^n} becomes a local coordinate system on M and V_α=(⋂_i=1^nỵ^i)∩(⋂_β≠α i=1,…,nỵ^β_i ). Moreover, ∂∂ y^β_1,…,∂∂ y^β_n vanish on all coordinates y^α_1, …,y^α_n with α≠β. Hence, V_β=⟨∂/∂ y^β_1,…,∂/∂ y^β_n⟩=⋂ _α≠β=1^kω^α, β=1,…,k. Let (M,ω^1,…, ω^k,V) be a k-symplectic manifold. Around every point x∈ M, there exist local coordinates {q^i,p^α_i}, with 1≤ i≤ n and 1≤α≤ k, such that ω^α =∑_i=1^n q̣^i∧p̣^α_i , V = ⟨p^α_i⟩_i=1,…,n, α=1,…,k . By our Darboux theorem for k-symplectic vector spaces, namely Theorem <ref>, there exists a basis {e^1,…,e^n;e_1^α,…,e_n^α}_α = 1,…,k of _xM such that ω^α_x =∑_i=1^n e^i∧ e_i^α for α = 1,…,k. The basis is chosen so that the dual basis {e_1,…,e_n,e^1_α,…,e^n_α} , with α=1,…,k, is such that V=⟨ e_α^i⟩ _α=1,…,k i=1,…,n. Recall that the subspaces in _xM of the form V_β x = ⋂_α=1 α≠β^kω_x^α = ⟨ e_1^β,…,e_n^β⟩ , β = 1,…,k , satisfy that V_x = ⊕_β = 1^kV_β x. By Lemma <ref>, there exist variables {y^j,y_j^β}, with j = 1,…,n and β = 1,…,k, such that, locally, V^β = ⟨y^β_1,…, y^β_n⟩, with β = 1,…,k. Moreover, ω^β = ⊕_α≠βV^α. Using previous results and since ω^βV× V = 0, we have ω^β = f_i^jβỵ^i∧ỵ^β_j + g_ijỵ^i∧ỵ^j for certain functions g_ij,f_i^jβ, with i,j=1,…,n and β = 1,…,k. Since ω̣^β = 0, it follows that f^jβ_i = f^jβ_i(y^l,y_l^β) and g_ij=g_ij(y^l,y_l^β) for i,j,l=1,…,n. Therefore, each ω^β can be considered as a differential two-form on ^2n. Moreover, each V^β can be then considered as a Lagrangian distribution of a symplectic two-form ω^β, when it is considered as a differential two-form on ^2n. Consequently, for a fixed β, one has 0 = -y^β_j y^i = _X^β_y^i_∂/∂ y^β_jω^β, i,j=1,…,n ⟹ X^β_y^i∈ (V_β)^⊥=V_β , i=1,…,n . Note that the orthogonal is relative to the restriction of ω^β to ℝ^2n. Whatever, by additionally considering ι_X_y^i^βω^α=0 for α≠β, one can also see that X^β_y^i becomes a vector field taking values in V^β. What follows is an adaptation of the Liouville–Mineur–Arnold theorem (see also <cit.>). Since V^α is integrable, we can consider a leaf F of V^α and its canonical inclusion _F:F↪ M. Let us define the map ζ x∈ M↦ (y^1(x),…,y^n(x))∈^n. Consider a regular point x'∈ M of ζ. Since the map ζ is regular in an open neighbourhood of x', there exist vector fields Y_1,…,Y_n on a neighbourhood of x' such that Y_i and y^i on ℝ^n are ζ-related for i=1,…,n. Consider the inner contractions Θ_i^α=_Y_iω^α for i=1,…,n on a neighbourhood of x' in M and the vector fields X^α_y^i, which take values in V_α. Then, _X^α_y^iΘ_j^α= _X^α_y^i_Y_jω^α=ω^α(Y_j,X^α_y^i)= -ω^α(X^α_y^i,Y_j)= -Y_jy^i= -δ^i_j, i,j=1,…,n. Hence, given two vector fields X^α_y^i,X^α_y^j, one has (Θ̣_ℓ^α)(X^α_y^i,X^α_y^j)= X^α_y^iΘ^α_ℓ(X^α_y^j)-X^α_y^jΘ^α_ℓ(X^α_y^i)-Θ^α_ℓ([X^α_y^i,X^α_y^j])= 0 . The latter is due to the fact that [X^α_y^i,X^α_y^j] is the Hamiltonian vector field of {y^i,y^j}=X^α_y^jy^i=0 because X_y^j takes values in V_α. Thus, _F^Θ^α is closed and there exists a potential _F^Θ_i^α=p̣^α_i. And recalling that ω^ α\|_V_α× V_α=0, it follows that ω^α=ỵ^i∧p̣^α_i. Moreover, it follows that V_α=⟨∂/∂ p^α_i⟩, α=1,…,k, and V takes the proposed form. Let us recall that the above proof could have been cut by the half by referring straightforwardly to the Liouville–Mineur–Arnold theorem, as since {y_i,y_j}=0, with i,j=1,…,n, that theorem implies that there are functions p^β_1,…, p^β_n with β=1,…,k such that ω^β=ỵ^i∧p̣^β_i for each β=1,…,k. Instead, we decided to give a complete, self-contained proof. Without this full explanation, Theorem <ref> would probably be the shortest direct proof of the Darboux theorem for k-symplectic manifolds in the literature. Although Theorem <ref> relies on Lemma <ref> and the k-symplectic linear Darboux theorem, Lemma <ref> is a rather straightforward geometric result, which was described carefully to verify all the details, and only the fact that V=⊕_α=1^kV^α is needed from the k-symplectic linear Darboux theorem to prove our full k-symplectic Darboux theorem. Moreover, note that one could have assumed that Darboux coordinates only are concerned with the canonical expressions of ω^1, …, ω^k. It turns out that given the conditions on the distribution, once we put ω^1, …, ω^k in a canonical manner, we also put a basis of V in the desired form. We will see in next section that this is not the case for Darboux coordinates for other structures. Given a k-symplectic manifold (M,ω^1,…,ω^k,V), we call k-symplectic Darboux coordinates the coordinates allowing us to write ω^1,…,ω^k and V in the form (<ref>). The k-symplectic Darboux coordinates will be called just Darboux coordinates when it does not lead to any misunderstanding. Note that the proof of Theorem <ref> shows that k-symplectic Darboux coordinates induce the existence of a distribution V'=⟨∂/∂ y^1,…,∂/∂ y^n⟩ that allows us to state the following result. Every k-symplectic manifold (M,ω^1,…,ω^k,V) admits, locally, a supplementary integrable distribution V' on M such that V⊕ V'= M and ω^α \|_V'× V'=0 for α=1,…,k. The canonical model of a k-symplectic manifold is the cotangent bundle of k^1-covelocities, namely ⊕^k Q = Q ⊕k…⊕ Q (the Whitney sum of k copies of the cotangent bundle of a manifold Q), equipped with the distribution V = π, where π^α⊕^k Q → Q and π:⊕^k Q → Q are the canonical projections onto the α-th component and Q respectively, and the canonical presymplectic two-forms ω^α = (π^α)^ω with α=1,…,k, where ω stands for the canonical symplectic two-form in Q. In this model, natural coordinates are Darboux coordinates, and the k-symplectic Darboux theorem states that k-symplectic manifolds are locally diffeomorphic to a cotangent bundle of k^1-covelocities. Meanwhile, the distribution V' is a distribution in ⊕_α=1^k Q whose leaves project diffeomorphically onto Q. As in the previous sections, one can introduce the notion of compatible connection with a k-symplectic manifold <cit.>. A k-symplectic connection on a k-symplectic manifold (M,ω^α,V) is a connection ∇ on M such that ∇ω^α = 0 for every α = 1,…,k. Again, Darboux coordinates allow us to define, locally, a connection, ∇, such that ∇ω^α=0 for α=1,…,k. And vice versa, the k-symplectic linear Darboux Theorem allows us to put ω^1,…,ω^k and the distribution V into a canonical form on the tangent space at a point and, a flat connection compatible with the k-symplectic manifold enables us to expand this canonical form to an open neighbourhood of the initial point where ω^1,…,ω^k and V take the form (<ref>). It is worth recalling the interesting work <cit.>, where connections compatible with k-symplectic structures are studied. These connections depend on the existence of certain foliations and are canonical once such foliations are given. By using such foliations and distributions, the Darboux theorem can be proved. We find that our approach here is more direct than that in <cit.> and the Darboux theorem is given in our work more geometrically. Note that a k-symplectic Darboux theorem also appears as a particular case of the multisymplectic theory in <cit.>. Now, let us study Darboux theorems for k-presymplectic manifolds (see <cit.> for some previous results on this case). This case poses several fundamental problems. First, there exist several possible definitions of k-presymplectic manifolds depending on their possible applications or representative cases. Some possible definition of k-presymplectic manifold can be found in <cit.>. Meanwhile, <cit.> defines a k-presymplectic manifold as a manifold equipped with k closed two-forms. It is clear that we will not have Darboux coordinates with such a general definition. As shown next, a direct analogue of the Darboux coordinates is not available in some of the possible definitions of k-presymplectic structure, while cases that admit Darboux coordinates may not be of physical interest. Let us give a brief analysis of this matter. Let ⊕_α=1^k ^Q be endowed with its canonical k-symplectic structure ω^1,…,ω^k and let π⊕_α=1^k ^Q → Q be the canonical projection onto Q. A canonical foliated k-presymplectic manifold is a tuple (S,ω_S^1,…,ω_S^k) given by a submanifold S⊂⊕_α=1^k ^Q such that π\|_S S → Q is a fibre bundle and S is endowed, for _S S →⊕_α=1^k ^Q being the canonical inclusion, with the k differential two-forms ω^α_S=^_Sω^α, for α=1,…,k. The rank of the fibration π\|_S:S→ Q is called the rank of (S,ω^1_S,…,ω^k_S) while ω^1_S,…,ω^k_S are called a canonical foliated k-presymplectic structure. More generally, the above gives rise to the following definition. A foliated k-presymplectic manifold is a tuple (M,ω^1,…,ω^k) such that there exists a canonical foliated k-presymplectic manifold (S,ω^1_S,…,ω^k_S) and a global diffeomorphism ϕ:M→ S such that ϕ^ω_S^α=ω^α for α=1,…,k. A foliated k-presymplectic manifold (M,ω^1,…,ω^k) is exact if ω^1,…,ω^k are exact. It is worth noting that the previous definition also makes sense for ϕ being, only, a local diffeomorphism. In that case, the main results to be displayed afterward remain valid, but many more technical details are to be considered to prove them. To keep our presentation simple and highlight the main ideas about Darboux coordinates, which are generically local, we have defined ϕ to be a global diffeomorphism. Definition <ref> implies that ω_S^1,…,ω_S^k admit a natural distribution V=π∩ S of rank S- Q such that ω_S^α\|_V× V=0 for α=1,…,k. If S=⊕_α=1^k Q, then V=π and S gives rise to a k-symplectic structure admitting Darboux coordinates. Let us illustrate by means of a simple example why a Darboux k-presymplectic theorem does not exist for general foliated k-presymplectic manifolds. It is worth noting that Darboux coordinates for families of closed differential forms are, at the very last instance, a way of writing them in a coordinate system so that their associated coordinates are constant. The following theorem shows that this is impossible for general k-presymplectic manifolds. Every rank-zero exact canonical foliated k-presymplectic structure is equivalent to k exact differential two-forms on Q. An exact canonical foliated k-presymplectic manifold (S⊂⊕_α=1^k Q,ω_S^1,…,ω_S^k) gives rise, as S is diffeomorphic to Q via π\|_S:S⊂⊕_α=1^k Q→ Q, to a unique family of exact differential two-forms, ω^1_Q,…,ω^k_Q, on Q satisfying that π\|_S^ω_Q^1=ω_S^1,…,π\|_S^ω_Q^k=ω_S^k. Conversely, k exact presymplectic two-forms ω^1_Q,…, ω^k_Q on Q with potentials θ^1,…,θ^k give rise to a section S = {(q,θ^1(q),…,θ^k(q)) \| q∈ Q} of π⊕_α=1^k ^Q → Q. Note that _S^ω^α=-_S^(̣p^α_iỵ^i)=-θ̣^α\|_S=π\|_S^ω^α_Q , α=1,…,k . Then, ω^1_Q,…,ω^k_Q are exact and equivalent to a rank-zero canonical foliated k-presymplectic structure. Since there is no way to put k arbitrary closed differential two-forms on Q into a coordinate system so that all of them will have constant coefficients, there will be no general Darboux theorem for foliated k-presymplectic manifolds, and thus there is no Darboux theorem for k-presymplectic manifolds in general. Theorem <ref> can be considered as an extreme case of canonical foliated k-presymplectic manifold. For the case of a fibration π\|_S:S → Q of rank one, it is simple to find new examples where there will be no Darboux coordinates. Assume the simple case of a fibration of rank one given by a submanifold S⊂⊕_α=1^2ℝ^2 onto ℝ^2. Since S has dimension three, the two differential forms ω_S^1,ω_S^2 can be assumed to have rank two and non-trivial common intersection of their kernels. In such a case, they are proportional. One of them can always be put into canonical form for certain variables, because is presymplectic. Since they are proportional and due to the closeness condition, they depend only on two variables. Hence, to put them in canonical form with some Darboux variables amounts to putting two different volume forms on ℝ^2 in canonical form for the same Darboux variables, which is impossible. Let us describe in more detail a more complex example of a foliated 2-presymplectic manifold that does not admit Darboux coordinates. Consider ⊕_α=1^2ℝ^2 and the fibration of the submanifold S onto ℝ^2 with rank one of the form S={(p^(1)_1(λ,y^1,y^2)ỵ^1+p^(1)_2(λ,y^1,y^2)ỵ^2,p^(2)_1(λ,y^1,y^2)ỵ^1+p^(2)_2(λ,y^1,y^2)ỵ^2):λ,y^1,y^2∈ℝ}. In particular, consider p_1^(1)=λ , p_2^(1)=0 , p_1^(2)=f(λ,y^1) , p_2^(2)=0 , for a certain function f(λ,y^1) such that ∂ f/∂λ is different from the constant functions zero and one. Hence, ω^1_S=λ̣∧ỵ^1 and ω^2_S=∂ f/∂λ (λ,y^1)λ̣∧ỵ^1, which are closed, proportional, have rank-one kernel and cannot be put into a canonical form for canonical coordinates because ω^1_S,ω^2_S amount to two different volume forms on ℝ^2. There are several manners of defining a k-presymplectic manifold. The following one offers a possibility. Let M be a (n(k+1)-m)-dimensional manifold, with 0≤ m≤ nk. A k-presymplectic structure on M is a family (ω^1,…, ω^k,V), where V is an r-dimensional integrable distribution and ω^1,…, ω^k are closed differential two-forms on M with ω^α = 2r_α and r = ∑_α=1^k r_α, where 1≤ r_α≤ n, satisfying that ω^αV× V = 0 , α=1,…, k . A manifold M endowed with a k-presymplectic structure is called a k-presymplectic manifold. We would expect to obtain for every k-presymplectic structure (M,ω^1,…,ω^k,V), where ω^α=2r_α, with 1≤ r_α≤ n , and every x∈ M a local coordinate system {y^i,p_i^α} around x so that ω^α=ỵ^i^α_j∧p̣^α_i^α_j , α=1,…,k , for certain i^α_j∈{1,…,n} for j=1,…, r_α for every α=1,…,k. Nevertheless, Example <ref> represents a counterexample for the existence of Darboux coordinate system for k-presymplectic structures. Contrary to previous examples, we will give conditions ensuring that a k-presymplectic manifold admits Darboux coordinates. Indeed, the manifold S is three-dimensional, while k=2. The associated presymplectic forms have rank two. The distribution V is then two-dimensional and generated, for instance, by the vector fields ⟨∂/∂λ,∂/∂ y^2⟩. Then, n and m can be fixed to be two and three. It is worth noting that for a k-presymplectic structure on M, any Riemannian metric g on M allows one to obtain a decomposition of a subspace E⊂_xM as a direct sum of subspaces E^κ_1,…,κ_k=E∩(⋂_α=1^k (ω_x^α)^κ_α) , where κ_α∈{0,1}, while (ω_x^α)^0=ω_x^α and (ω_x^α)^1=(ω_x^α)^⊥_g, where ⊥_g is the orthogonal relative to the introduced metric g. The main aim of this decomposition is to divide _xM into two subspaces, V,S, given by direct sums of the subspaces in (<ref>) in such a manner that ω^α(V) and ω^α(S) have rank r_α, while ω^α(V)∩ω^α(S)=0 for α=1,…,k. As in the case of k-symplectic linear spaces, one can now prove a k-presymplectic linear space Darboux theorem. (k-presymplectic linear Darboux theorem) Given a k-presymplectic structure (ω^1,…,ω^k,V) on M, where ω^α=2r^α for α=1,…,r. Let D=⋂_α=1^kω^α have rank d and let V=r+d = ∑_α=1^k r_α+d be so that V_α=r_α, V=D ⊕⊕_β=1^k V_β , D+V_α=V∩(⋂_β≠αω^β) , (k≠ 1) α=1,…,k , and M=n+r+d. Then, at every _xM, for x∈ M, one can set a basis of the form {e^1,…,e^n;e^α_μ^α_j,v^1,…,v^d}, with μ^α_j∈ I_α⊂{1,…,n} and I_α = r_α with α=1,…,k, of _xM such that ω_x^α=∑_j=1^r_αe^μ^α_j∧ e^α_μ^α_j , α=1,…,k , D_x=⟨ v_1,…,v_d⟩, V_α x=⟨ e_α^μ^α_j⟩ . Note that M=n+r+d. Since D=⋂_α=1^kω^α has rank d, one has that D_x^∘=ω^1_x+…+ω^k_x , ∀ x∈ M , is such that D^∘ =n+r. Since ω^β\|_V× V=0, it follows that ω^β(V)⊂ V^∘ for every β. We have ω^1(V)+…+ω^k(V)⊂ V^∘. Note that V^∘ =n. From the second and third condition in (<ref>), it follows that V_α∩ω^α=0. Moreover, one has that ω^α(V_α)=r_α=ω^α(V) for α=1,…,k. Consider the supplementary S=V^⊥_g to V. Then, V^⊥_g= M - r-d = n and ω_x^β(S_x)≤ n for every x∈ M. Due to (<ref>) and the above, one has that ω^1(V^⊥_g)+…+ω^k(V^⊥_g) is a distribution of rank r at least. By our decomposition, every α allows us to divide V^⊥_g into two spaces in the form V^⊥_g=Υ_α⊕(ω^α∩ V^⊥_g), where Υ_α has rank r_α because ω^α=n+r+d-2r_α and ω^α∩ V=r+d-r_α. Then, ω^α(V^⊥_g) is equal to the image of a subspace of rank r_α of V^⊥_g and it therefore has rank r_α and ω^α(S)∩ω^α(V)=0. Then, (ω^1(V^⊥_g)+…+ω^k(V^⊥_g))=r , ω^1(V)+…+ω^k(V)= V^∘ . Note that ω^α=n+d+r-2r_α and ω^α(V)=ω^α(V_α⊕(ω^α∩ V)). Due to the second expression in (<ref>), the sum of the codistributions S_^α=ω^α(V) of M for α=1,…,k has rank n, but they do not need to be in direct sum. A non-degenerate contravariant symmetric tensor, g^. on S_=S_^1+…+S_^k can be used to give a decomposition of it into subspaces in direct sum of the form S_^κ_1,…,κ_k=⋂_α=1^kS^κ_α_α, where κ_α∈{0,1} for α=1,…,k, while S^1_α=S^α_ and S^0_α=(S^α_)^⊥_g^, namely the orthogonal in S_* of S_^α relative to g^. Take a basis of S_* associated with our decomposition. For the elements of such a basis spanning S_^α, there will be unique elements in V_α whose image under ω^α give minus the corresponding basis in S_^α. Take a supplementary to S_* in M, of dimension d+r, dual to a basis adapted to the decomposition of V and vanishing on V^⊥_g. It is worth noting that we have a decomposition M=[Υ_α⊕ (ω^α∩ V^⊥_g)]⊕[V_α⊕(⊕_β≠αV_β)⊕ D] and a dual one in S_⊕ (V^⊥_g)^∘. In such a basis, the form of ω^α goes back to (<ref>) and the same technique in Theorem <ref> gives the canonical form for every ω^α with α=1,…,k. Finally, if w_1,…,w_d is a basis of D dual to the one chosen in _xM, one has that ω^β=∑_j=1^r_β e^μ_j^β∧ e^β_μ_j^β , V_β=⟨ e_β^μ^β_j⟩, β=1,…,k. As proved above, depending on their exact definition, k-presymplectic manifolds need not have a Darboux theorem (whatever this means, because we can have different ways of defining such an object). That is why we hereafter a definition of k-presymplectic manifold ensuring the existence of a particular case of k-presymplectic Darboux theorem. This is done by assuming the existence of certain integrable distribution with particular properties. A k-presymplectic manifold (M,ω^1,…,ω^k,V) is a k-presymplectic manifold such that M=n+r+d where d=⋂_α=1^kω^α and ω^α=2r^α, the V is an integrable distribution such that ω\|_V× V=0 of rank r+d and there are integrable distributions ⊕_α=1 ^kV_α, V_1,…,V_k, D so that V= ⊕_α=1^kV_α⊕ D, D=⋂_α=1^kω^α, D+V_β=⋂_β≠αω^α∩ V (k≠ 1) , β=1,… k . Given a k-presymplectic manifold (M,ω^1,…,ω^k, V), the distributions V^α, with α=1,…,k, satisfy that every x∈ M admits a coordinated neighbourhood with coordinates {y^1,…,y^n,z^1,…,z^d,y^α_1,…,y_r_α^α} , α=1,…,k , on a neighbourhood of x so that V_α = ⟨∂/∂ y^α_1,…,∂/∂ y^α_r_α⟩ , α=1,…,k , D=⟨∂/∂ z^1,…,∂/∂ z^d⟩ . Let y^1,…,y^n be common functionally independent first-integrals for all vector fields taking values in V. Since D is a regular distribution of rank d given by the intersection of kernels of the closed forms ω^1,…,ω^k, it is integrable. It is assumed that ⊕_α=1^kV_α is integrable. Hence, V_1⊕…⊕ V_k has common first-integrals z^1,…,z^d such that ẓ^1∧…∧ẓ^d∧ỵ^1∧…∧ỵ^n≠ 0. If k=1, the result of our lemma easily follows. Assume that k>1. Given different integers α_1,…,α_k-1∈{1,…,k}, one has that, V_α_1⊕…⊕ V_α_k-1⊕ D=ω^β∩ V , where β is the only number in {1,…,k} not included in {α_1,…,α_k-1}. Hence, the distribution V_α_1⊕…⊕ V_α_k-1⊕ D has corank r_β, it is integrable, and the vector fields taking values in it have r_β common local first-integrals y^β_1,…,y^β_r_β such that ẓ_1∧…∧ẓ_d∧ỵ^β_1∧…∧ỵ^β_r_β∧ỵ^1∧…∧ỵ^n≠ 0. By construction, {y^1_1,…,y^1_r_1,…,y^k_1,…,y^k_r_k,z^1,…,z^d,y^1,…,y^n} becomes a local coordinate system on M and V_α=(⋂_i=1^dẓ^i)∩(⋂_i=1^nỵ^i)∩⋂_β≠α i=1,…,r_βỵ^β_i . Moreover, ∂∂ y^β_i with i=1, …,r_β vanish on all coordinates y^α_j with α≠β and j=1,…,r_α. Hence, ⟨∂/∂ y^β_1,…,∂/∂ y^β_r_β⟩=V_β , β=1,…,k , and ⟨∂/∂ z^1,…,∂/∂ z^d⟩=D . Once the above is proved, the following theorem is immediate. One only has to slightly adapt Theorem <ref> by considering that V_α=r_α for α=1,…,k and to restrict ω^α to the integral submanifolds of V_α⊕Υ_α, which have dimension 2r^α, where ω^α becomes symplectic. Let (M,ω^1,…, ω^k,V) be a k-presymplectic manifold such that ω^α=2r_α, with 1≤ r_α≤ n. The dimension of M is n+r+d. For every point x∈ M, there exist local coordinates {y^i,y^α_μ^α_j,z^j}, with 1≤ i≤ n, μ^α_j∈ I_α⊆{ 1,…, n}, \| I_α\|=r_α, 1≤ j≤ r_α and 1≤α≤ k, such that ω^α=∑_j=1^r_αỵ^μ^α_j∧ỵ^α_μ^α_j, V_α=⟨∂/∂ y^α_μ^α_j⟩ , α=1,…,k , ⋂_α=1^kω^α=⟨∂/∂ z^j⟩ . § –COSYMPLECTIC AND –PRECOSYMPLECTIC MANIFOLDS Similarly to previous sections, let us study k-cosymplectic and k-precosymplectic manifolds. Our investigation will introduce relevant technical issues to be addressed that were not present in previous sections. One of its main differences with respect to previous Darboux theorems relies on the fact that Reeb vector fields are not uniquely defined in the case of k-precosymplectic manifolds. This suggests that Darboux coordinates for k-precosymplectic manifolds should not assume a canonical form form Reeb vector fields. Moreover, additional conditions will be needed to assume so as to obtain canonical bases for the distributions after having the corresponding differential forms written in a canonical manner. Let M be an (n(k+1)+k)-dimensional manifold. A k-cosymplectic structure in M is a family (η^α,ω^α,V), with 1≤α≤ k, where η^1,…,η^k are closed one-forms on M, while ω^1,…,ω^k are closed two-forms in M, and V is an integrable nk-dimensional integrable distribution in M satisfying that η^1∧…∧η^k≠ 0, η^α\|_V=0 , ω^α\|_V× V=0 , * ⋂_α=1^k( η^α∩ω^α)={0}, ⋂_α=1^kω^α=k . A manifold M endowed with a k-cosymplectic structure is said to be a k-cosymplectic manifold. Every k-cosymplectic structure (η^α ,ω^α,V) in M admits a unique family of vector fields R_1,…,R_k on M, called Reeb vector fields, such that _R_αη^β=δ^β_α , _R_αω^β = 0 , α,β=1,…,k . Note that the existence of Reeb vector fields is independent of the existence or not of the distribution V. Given a one-cosymplectic manifold (M,η,ω,V), the pair (η,ω) is a special type of cosymplectic structure in M that additionally admits the distribution V. Not every cosymplectic structure admits such a V. In fact, consider (M=ℝ×𝕊^2,η,ω), where η is the one-form on M obtained by pulling-back the one form ṭ on ℝ, and ω is the pull-back to M of the standard symplectic form on 𝕊^2. Then, (M=ℝ×𝕊^2,η,ω) is not a one-cosymplectic manifold because the standard symplectic form on 𝕊^2 does not admit a distribution as commented previously in this paper. Given a k-cosymplectic manifold of the form (M,η^1,…,η^k,ω^1,…,ω^k,V), every point x∈ M admits a neighbourhood with local coordinates {x^α,y^i,y^α_i}, with 1≤α≤ k, 1≤ i ≤ n, such that η^α=x̣^α , ω^α=∑_i=1^nỵ^i∧ỵ^α_i , α=1,…,k. In these coordinates, R_α=x^α for α=1,…,k. If k≠ 1, then V=⟨y^α_i⟩ where α=1,…,k and i=1,…,n. If k=1 and [ω,V]⊂ω⊕ V, then V=⟨y^α_i⟩. Since η^1,…,η^k are closed and η^1∧…∧η^k does not vanish at any point of M, one has that H=⋂_α=1^kη^α is an integrable distribution of corank k. Moreover, V is contained in H by the definition of k-cosymplectic manifolds. Consider one of the integral leaves, 𝒮, of H, and the natural local immersion _𝒮:𝒮↪ M. The _𝒮^ω^α along with the restriction of V to 𝒮 give rise to a k-symplectic manifold since a vector field taking values in H that is orthogonal to H relative to ω^1,…,ω^k belongs to ⋂_α=1^k(η^α∩ω^α)=0. Hence, _𝒮^ω^1,…, _𝒮^ω^k admit k-symplectic Darboux coordinates. Doing the same along different leaves of H and gluing the results, we obtain that ω^1, …,ω^k,η^1,…,η^k have their canonical form. Let us explain this in detail. The differential forms ω^1,…,ω^k,η^1,…,η^k are invariant relative to the Reeb vector fields of the k-cosymplectic manifold and their value in M can be understood as the extension to M obtained from their value on 𝒮 by the extension by one-parametric groups of diffeomorphisms of the vector fields R_1,…,R_k. Consider coordinates x^1,…,x^k rectifying simultaneously the vector fields R_1,…,R_k. If one consider the coordinate system in M given by the coordinates x^α, y^i,y_i^α on M, where y^i,y^α_i are invariant under the flows of R_1,…,R_k and match the k-symplectic Darboux coordinates on 𝒮, one gets that the x^α are functionally independent of the y^i,y^α_i. Moreover, since R_1,…,R_k are in the kernels of ω^1,…,ω^k and they are invariant relative to R_1,…,R_k, it follows that their form on M is the same as in 𝒮. Meanwhile, η^α=dx^α for α=1,…,k. and the forms ω^1,…,ω^k,η^1,…,η^k on M take a canonical form. To obtain a canonical basis of the distribution V, additional conditions must be added for k=1. On the other hand, if k>1, then each distribution V_α is the intersection of the kernels of ω^β for β≠α along with the intersection with ⋂_β=1^k η^β. They are therefore invariant relative to the Reeb vector fields. So, they can be put in canonical form on 𝒮 and extended as previously from 𝒮 to vector fields on M with a canonical form. On the other hand, if k=1, one has that V may not be the kernel of a closed form invariant relative to the associated Reeb vector field and the previous method fails. To ensure this, one has to assume [ω,V]⊂ω⊕ V. Equivalently, [R,V]⊂ V for the unique Reeb vector field of the one-cosymplectic manifold. The conditions given in <cit.> and <cit.> for the Darboux theorem for k-cosymplectic manifolds may be a little bit misleading since a necessary condition in the case k=1, namely V must be invariant relative to the action of the Reeb vector field, is not given in <cit.> and <cit.>, but in <cit.> or <cit.>, respectively, after them. Moreover, the above-mentioned condition in <cit.> can be rewritten in a new way, namely [R_α,V]⊂ V, with α=1,…,k, can be rewritten by saying that the distributions ω and V are integrable and their direct sum is integrable. This is also commented in <cit.>. As shown in the previous theorem, the condition [ω, V]⊂ V⊕ω is necessary in order to ensure a canonical form for the elements of a basis of V. Notwithstanding, if one is mainly concerned with the canonical form of the η^1,…,η^k,ω^1,…,ω^k, this condition can be avoided. This is the reason why we skipped [ω, V]⊂ V⊕ω in our definition of k-cosymplectic manifolds. Let {x^1,…,x^k} be a linear coordinate system on ℝ^k. Given the canonical projections π̅_1^k× (^1_k)^Q→^k, π̅_2^k× (^1_k)^Q→ (^1_k)^Q, π̅_0^k× (^1_k)^Q→^k× Q. The canonical model for k-cosymplectic structures is (^k× (^1_k)^Q,(π̅_1)^x̣^α,(π̅_2)^ω^α,V=(π̅_0)_) , where ω^1,…,ω^k are the two-forms of the canonical k-symplectic structure on (^1_k)^Q. More generally, one has the following construction. Let (N,ϖ^α,𝒱) be an arbitrary k-symplectic manifold. Given the canonical projections π_^k^k× N⟶^k , π_N^k× N⟶ N define the differential forms η^α = π_^k^∗(x̣^α) , ω^α = π_N^∗ϖ^α , α=1,…,k . The distribution 𝒱 in N defines a distribution V in M=^k× N by considering the vector fields on N as vector fields in M in the natural way via the isomorphism M=ℝ^k⊕ N. All conditions given in Definition <ref> are verified, and hence (M=^k× N,η^α,ω^α,V) is a k-cosymplectic manifold. As in the case of k-presymplectic manifolds, there are many ways of defining a k-precosymplectic structure. Note that in the k-precosymplectic case, one cannot, in general, extend the notion of Reeb vector fields to give an object that is uniquely defined. Hence, one may wonder about the necessity of putting them into a canonical form in Darboux coordinates, since they are not unique. Taking this into account, let us give one of the possible definitions for k-precosymplectic manifolds. No condition for the determination of the canonical form of the Reeb vector fields will be assumed. Let M be a manifold of dimension n(k+1)+k-m, with 0≤ m≤ nk. A k-precosymplectic structure in M is a family (η^α,ω^α,V), with 1≤α≤ k, where η^α are closed one-forms in M, while ω^α are closed two-forms in M such that ω^α=2r_α, with 1≤ r_α≤ n, and V is an integrable distribution in M of corank n+k satisfying that * η^1∧…∧η^k≠ 0 , η^α\|_V=0 , ω^α\|_V× V=0 , α=1,…,k, * ⋂_α=1^kω^α= k+d , * ⋂_α=1^k(ω^α∩η^α) = d , * one has that V is an integrable distribution admitting a decomposition into integrable distributions V=⊕_α=1^kV_α⊕ D such that D+V_β=(⋂_β≠αω^α)∩ V for β=1,…,k and k≠ 1 for V_β=r_β. A manifold M endowed with a k-precosymplectic structure is called a k-precosymplectic manifold. We here after define r=∑_α=1^kr_α. Consider a k-presymplectic manifold (P,ϖ^α,V). Let us construct a k-precosymplectic structure on ^k× P. First, consider the canonical projections ^k× Pπ⟶P , ^k× Pτ⟶^k . Then, define η^α = τ^∗x̣^α, where x^1,…,x^k are linear coordinates in ^k, and ω^α = π^∗ϖ^α for α=1,…,k. Then, (^k× P,η^α,ω^α) is a k-precosymplectic manifold. Let us prove a technical result that is necessary to asses the role played by the distribution ⋂_α=1^kη^α in k-precosymplectic manifolds. Given a k-precosymplectic manifold (M,η^1,…,η^k,ω^1,…,ω^k, V), every x∈ M admits a coordinated neighbourhood with coordinates {x^1,…,x^k, y^1,…,y^n,z^1,…,z^d,y^α_1,…,y_r_α^α} , α=1,…,k , on a neighbourhood of x so that V_α = ⟨∂/∂ y^α_1,…,∂/∂ y^α_r_α⟩ , α=1,…,k , D=⟨∂/∂ z^1,…,∂/∂ z^d⟩ . Since η^1,…,η^k are closed, they admit potentials x^1,…,x^k, respectively. Let y^1,…,y^n be common functionally independent first integrals for all vector fields taking values in the integrable distribution V such that x̣^1∧…∧x̣^k∧ỵ^1∧…∧ỵ^n≠ 0. It is assumed that ⊕_α=1^kV_α is integrable. Hence, V_1⊕…⊕ V_k has common first integrals z^1,…,z^d such that μ=x̣^1∧…∧x̣^k∧ẓ^1∧…∧ẓ^d∧ỵ^1∧…∧ỵ^n≠ 0. Given different integers α_1,…,α_k-1∈{1,…,k}, and k>1, one has that, V_α_1⊕…⊕ V_α_k-1⊕ D=ω^β∩ V , where β is the only number in {1,…,k} not included in {α_1,…,α_k-1}. Hence, the distribution V_α_1⊕…⊕ V_α_k-1⊕ D has corank r_β in V, it is integrable, and the vector fields taking values in it have r_β common local first-integrals y^β_1,…,y^β_r_β such that ỵ^β_1∧…∧ỵ^β_r_β∧μ≠ 0. Note that, if k=1, a similar result can be obtained by considering V=V_1⊕ D and some r_1 functionally independent integrals of D. By construction, {x^1,…, x^k,y^1_1,…,y^1_r_1,…,y^k_1,…,y^k_r_k,z^1,…,z^d,y^1,…,y^n} becomes a local coordinate system on M and V_α=(⋂_i=1^dẓ^i)∩(⋂_i=1^nỵ^i)∩(⋂_β≠α i=1,…,r_βỵ^β_i )∩(⋂_β=1^kx̣^β). for k>1. For k=1, a similar expression is obtained by skipping the kernels of the ỵ^1_i. Moreover, ∂∂ y^β_i with i=1, …,r_β vanish on all coordinates y^α_j,y^i, with α≠β and j=1,…,r_α, and the z^1,…,z^d. Hence, ⟨∂/∂ y^β_1,…,∂/∂ y^β_r_β⟩=V_β , β=1,…,k , and ⟨∂/∂ z^1,…,∂/∂ z^d⟩=D . The corresponding Darboux theorem for k-precosymplectic manifolds reads as follows. Let M be a k-precosymplectic manifold such that M=n+d+r+k, while ω^α=2r_α, with 1≤ r_α≤ n. Let us assume the existence of k Reeb vector fields R_1,…,R_k spanning an integrable k-dimensional distribution and such that they commute among themselves. For every x∈ M, there exists a local chart of coordinates {x^α,y^i,y^α_μ_α,z^j} , 1≤α≤ k , 1≤ i≤ n , μ_α∈ I_α⊆{1,…,n} , \| I_α\| = r_α , 1≤ j≤ d , such that η^α=x̣^α , ω^α=∑_μ_α∈ I_αỵ^μ_α∧ỵ^α_μ_α α=1,…,k . If additionally [R_i,V]⊂ V, then V=⟨∂/∂ y^α_μ_α, ∂/∂ z^j⟩ , ⋂_α=1^k(η^α∩ω^α)=⟨∂/∂ z^j⟩ . Consider the distribution Υ=⋂_α=1^kη^α, which is integrable of rank n+d+r. One can define a leaf S_λ of Υ. Then, one has the immersion _λ:S_λ↪ M. Since V is included in Υ, one has that ^_λω^1,…,^_λω^k allow us to define a k-presymplectic manifold with Darboux coordinates for the η^α and the ω^α which depend smoothly on λ. Note that the ω^α,η^α are invariant relative to some Reeb vector fields R_1,…,R_k spanning an involutive distribution and commuting among themselves. Using this fact and proceeding as in the Darboux k-cosymplectic manifold structure, we obtain our Darboux coordinates for the η^α and the ω^α. Note that the same applies to the canonical basis for ⋂_α=1^k(η^α∩ω^α) even for k=1. Notwithstanding, the form of the basis for the distribution V needs the additional condition about its invariance relative to R_1,…,R_k. Then, gluing together as in Theorem <ref>, the result follows. Note that k-precosymplectic manifolds admit Reeb vector fields, but they are not uniquely defined by conditions (<ref>). One must impose some additional condition on M to determine them uniquely. For instance, let us restrict ourselves to a k-precosymplectic structure on ^k× M, where M is a k-presymplectic manifold. Then, if we ask the Reeb vectors fields to be vertical with respect to the projection ^k× M→^k, the system of equations (<ref>) determines univocally Reeb vector fields. An equivalent way of obtaining this same family is taking the vector fields {x^α} on ^k and lifting them to ^k× M with the trivial connection x̣^α⊗x^α. As it is obvious, in Darboux coordinates we have that these vector fields are R_α=x^α. Note that every k-presymplectic structure in this case will also satisfy the conditions established in our Darboux theorem. § MULTISYMPLECTIC AND PREMULTISYMPLECTIC STRUCTURES Let us now comment on certain results on Darboux coordinates for multisymplectic forms <cit.>. First, let us detail some results on (pre)multisymplectic geometry (see <cit.> for further references). In the context of (pre)multisymplectic geometry, the standard kernel of a differential form is called the one-kernel. Let M be an n-dimensional differentiable manifold. A closed form Ω∈^k(M) whose one-kernel is a distribution of constant rank is called a premultisymplectic form. Additionally, if _XΩ=0 for a vector field X∈𝔛(M) implies that X=0, then Ω is said to be one-nondegenerate and it becomes a multisymplectic form. The pair (M,Ω) is said to be a premultisymplectic or a multisymplectic manifold of degree k, if the one-kernel of Ω is one-degenerate or one-nondegenerate, respectively. First examples of multisymplectic manifolds are symplectic manifolds, i.e. multisymplectic manifolds of degree 2, and orientable manifolds, namely multisymplectic manifolds with a volume form. The following is a linear analogue of (pre)multisymplectic manifolds. A k-covector Ω on ℝ^n is called a premultisymplectic linear form. If _vΩ=0 for some x∈ℝ^n implies that v=0, then Ω is said to be one-nondegenerate and it becomes a multisymplectic linear form or k-plectic linear form. The pair (ℝ^n,Ω) is said to be a premultisymplectic linear space or a linear multisymplectic linear space of degree k, respectively. Multisymplectic linear spaces given by a k-covector are also called k-plectic vector spaces. Other typical examples of multisymplectic manifolds are given by the so-called bundles of forms, which, in addition, are the canonical models of multisymplectic manifolds. These canonical models are constructed as follows. * Let Q be a manifold. Consider the bundle ρΛ^k(^Q)→ Q, i.e. the bundle of k-forms in Q (also called the k-multicotangent bundle of Q). This bundle is endowed with a canonical structure called the tautological or canonical form Θ_Q∈^k(Λ^k(^Q)) given by Θ_Q_μ(V_1,… ,V_k)=(ρ_V_1∧…∧ρ_ V_k)μ, for every μ∈Λ^k(^Q) and V_1,…,V_k∈_μ(Λ^k(^Q)). Then, Ω_Q=Θ̣_Q∈^k+1(Λ^k(^Q)) is a one-nondegenerate form and hence (Λ^k(^Q),Ω_Q) is a multisymplectic manifold of degree k+1. Furthermore, denoting by {x^i,p_i_1… i_k} the charts of natural coordinates in Λ^k(^Q), these canonical forms read locally as Θ_Q=p_i_1… i_kx̣^i_1∧…∧x̣^i_k , Ω_Q=p̣_i_1… i_k∧x̣^i_1∧…∧x̣^i_k . Such coordinates are Darboux coordinates in Λ^k(^Q). * If π Q→ M is a fibre bundle, let ρ_rΛ^k_r(^Q)→ Q be the subbundle of Λ^k(^Q) made of the r-horizontal k-forms in Q with respect to the projection π, namely the k-forms in Q vanishing when applied to r vector fields that in Q that are π-vertical. If ρ^k_rΛ_r^k(^Q)→Λ^k(^Q) is the canonical injection, then Θ^r_Q=(ρ^k_r)^Θ_Q∈^k(Λ^k_r(^Q)) is the tautological k-form in Λ^k_r(^Q), and then, taking Ω^r_Q=Θ̣^r_Q∈^k+1(Λ^k_r(^Q)), we have that (Λ^k_r(^Q),Ω^r_Q) is a multisymplectic manifold of degree k+1. As above, the charts of natural coordinates in Λ^k_r(^Q) are also charts of Darboux coordinates, on which these canonical forms have local expressions similar to the above ones. Nevertheless, in general, multisymplectic manifolds are not (locally) diffeomorphic to these canonical models. Note that a multisymplectic form with Darboux coordinates admits a local flat connection compatible with it. Furthermore, if the multisymplectic form has a compatible flat connection, it admits coordinates in which the multisymplectic form has constant coordinates, but it does not need to be of the previous form. In particular, if a multisymplectic form has kernels of higher order to those of Ω_Q, then there is no Darboux theorem in the above senses. In particular, this is a typical problem for Darboux coordinates: differential forms can be put into a form with constants coefficients in many manners and Darboux theorems use to stress one particular form over others, although others may be of interest too. In general, multisymplectic manifolds do not need to have a coordinate system that makes the multisymplectic form to have constant coordinates, which is the very most basic condition for the existence of a Darboux theorem. Indeed, multisymplectic manifolds of this type are called flat in the literature <cit.>. The exact definition is given next. A multisymplectic manifold (M, ω) is called flat near x∈ M, if there exists a mapping ϕ : U⊂ M →_xM such that ϕ(x) = 0 and ϕ^ω_x=ω for ω_x being a constant-coefficient non-degenerate multilinear-form on _xM. An (n+1)-plectic vector space (V, ω) is called standard if there exists a linear subspace W⊂ V such that _u∧ vω= 0 for all u, v ∈ W, and ω^♯: w∈ W↦ω^♯(w)∈Λ^n(V/W)^ such that ω^♯(w)(v_1 + W, …, v_n + W)=ω(w, v_1, …, v_n) for every v_1,…,v_n∈ V, is an isomorphism. In the above situation, W is unique if n≥ 2 and then often denoted W_ω. From <cit.>, the following result can easily be derived. Let n ≥ 2 and let (M, ω) be a standard (n+1)-plectic manifold, i.e. (M, ω) has as constant linear type fixed standard (n+1)-plectic vector space. Then, W_ω =_x∈ MW_ω_x⊂ TM is a smooth distribution. Furthermore, (M, ω) is flat if and only if W_ω is integrable. Let us just recall that our definition of (n+1)-plectic symplectic manifold is sometimes called a n-plectic manifold in the literature <cit.>. Let us now turn to a type of multisymplectic manifold for which we will obtain Darboux coordinates. A special multisymplectic manifold is a multisymplectic manifold (M,Ω) of degree k such that Ω=Θ̣, for some Θ∈^k-1(M), and there is a diffeomorphism ϕ M→Λ^k-1(^Q), Q=n≥ k-1, (or ϕ M→Λ^k-1_r(^Q)), and a fibration π M→ Q such that ρ∘ϕ=π (resp. ρ_r∘ϕ=π), and ϕ^Θ_Q=Θ (resp. ϕ^Θ_Q^r=Θ). And, as a result of the above discussion, we state the following result. Special multisymplectic manifolds (M,Ω) are multisymplectomorphic to bundles of forms. Therefore, there is a local chart of Darboux coordinates around every point x∈ M. Like in the k-symplectic and k-cosymplectic cases, some additional properties are needed to assure the existence of Darboux-type coordinates <cit.> and then to have multisymplectic manifolds that locally behave as the canonical models. To state these additional conditions, we need to introduce some generalisations of concepts of symplectic geometry. So, if (M,Ω) is a multisymplectic manifold of degree k and 𝒲 a distribution on M , we define <cit.> the r-orthogonal multisymplectic vector space at p∈ M of 𝒲 as 𝒲_x^⊥,r={ v∈_xM\|(v∧ w_1∧…∧ w_r)Ω_p=0 ,∀ w_1,…,w_r∈𝒲_x} . Then, the r-orthogonal multisymplectic complement of W is the distribution 𝒲^⊥,r=_x∈ M𝒲_x^⊥,r, and we say that 𝒲 is an r-coisotropic or an r-isotropic distribution if 𝒲^⊥,r⊂𝒲 or 𝒲⊂𝒲^⊥,r, respectively (if 𝒲=𝒲^⊥,r then 𝒲 is an r-Lagrangian distribution). Let us use previous notions. Let (M,Ω) be a multisymplectic manifold of degree k, and let 𝒲 be a regular one-isotropic involutive distribution in (M,Ω). * A multisymplectic manifold of type (k,0) is a triple (M,Ω,𝒲) such that, for every x∈ M, * 𝒲(x)=Λ^k-1(_xM/𝒲(x))^. (_xM/𝒲(x))>k-1. * A multisymplectic manifold of type (k,r) (1≤ r≤ k-1) is a quadruple (M,Ω,𝒲,ℰ), where ℰ is a distribution on M such that, for every x∈ M, one has that ℰ(x) is a vector subspace of _xM/𝒲(x) satisfying the following properties: * If π_x_xM→_xM/𝒲(x) is the canonical projection, then (v_1∧…∧ v_r)Ω_x=0, for every v_i∈_xM such that π_x(v_i)∈ℰ(x) (i=1,…,r). * 𝒲(x)=Λ_r^k-1(_xM/𝒲(x))^, where the horizontal forms are considered with respect to the subspace ℰ(x). (_xM/𝒲(x))>k-1. Then, the fundamental result is the following <cit.>. Every multisymplectic manifold (M,Ω) of type (k,0) (resp. of type (k,r)) is locally multisymplectomorphic to a bundle of (k-1)-forms Λ^k-1(^Q) (resp. Λ^k-1_r(^Q)), for some manifold Q; that is, to a canonical multisymplectic manifold. Therefore, there is a local chart of Darboux coordinates around every point x∈ M. Multisymplectic manifolds that are locally multisymplectomorphic to bundles of forms are called locally special multisymplectic manifolds. As a relevant example, if π E→ M is a fiber bundle (where M is an m-dimensional oriented manifold), J^1π is the corresponding first-order jet bundle, and L is a first-order regular or hyperregular Lagrangian density, then the Poincaré–Cartan form Ω_ L∈^m+1(J^1π) is a multisymplectic form and (J^1π,Ω_ L) is a (locally) special multisymplectic manifold. If L is a singular Lagrangian, then (J^1π,Ω_ L) is a premultisymplectic manifold. A special premultisymplectic manifold is a premultisymplectic manifold (M,Ω) of degree k such that M/Ω is a manifold and the unique multisymplectic form Ω' on M/Ω such that π^Ω'=Ω is a special multisymplectic form. The following naturally follows. Let (M,Ω) be a premultisymplectic manifold of degree k, and 𝒲 a regular one-isotropic involutive distribution in (M,Ω) such that Ω⊂𝒲 and d=Ω. A premultisymplectic manifold of type (d,k,0) is a triple (M,Ω,𝒲) such that, for every x∈ M, * 𝒲(x)-d=Λ^k-1(_xM/𝒲(x))^. (_xM/𝒲(x))>k-1. * A premultisymplectic manifold of type (d,k,r) (1≤ r≤ k-1) is a quadruple (M,Ω,𝒲,ℰ), where ℰ is a distribution on M such that, for every x∈ M, the space ℰ(x) is a vector subspace of _xM/𝒲(x) with the following properties: * If π_x_xM→_xM/𝒲(x) is the canonical projection, then (v_1∧…∧ v_r)Ω_p=0, for every v_i∈_xM such that π_x(v_i)∈ℰ(x), i=1,…,r. * 𝒲(x)-d=Λ_r^k-1(_xM/𝒲(x))^, where the horizontal forms are considered with respect to the subspace ℰ(x). (_xM/𝒲(x))>k-1. Every premultisymplectic manifold (M,Ω) of type (d,k,0) (resp. of type (d,k,r)) is locally premultisymplectomorphic to a canonical premultisymplectic manifold of type (d,k,0) (resp. of type (d,k,r)). Therefore, there is a local chart of Darboux coordinates around every point x∈ M. As in previous structures, analogous claims can be done concerning the existence of connected compatible connections with premultisymplectic manifolds. § CONCLUSIONS AND OUTLOOK The focus of this research is the exploration of Darboux-type theorems concerning geometric structures defined by closed differential forms. The initial section of this study entails an examination of the Darboux theorem for symplectic, presymplectic, and cosymplectic manifolds. By imposing minimal regularity conditions, we have successfully established a proof for a Darboux theorem applicable to precosymplectic manifolds. Within the realm of geometric mechanics, these manifolds serve as the phase spaces for both regular and singular autonomous and non-autonomous dynamical systems. We have presented novel proofs for the Darboux theorem concerning k-symplectic and k-cosymplectic manifolds. These proofs appear to be simpler compared to the previously known ones. Additionally, we have introduced and demonstrated new Darboux theorems for specific families of k-presymplectic and k-precosymplectic manifolds. Furthermore, we have provided a counterexample illustrating that a general Darboux-type theorem does not hold for k-presymplectic manifolds. We have conducted a thorough review of previous findings regarding the existence of Darboux coordinates for certain types of multisymplectic manifolds. Lastly, we have presented fresh results that establish the existence of Darboux coordinates for particular cases of premultisymplectic manifolds. All of these structures play a vital role in the geometric representation of both regular and singular classical field theories. The relations of Darboux theorems with flat connections have been studied, which provides new viewpoints and gathers previous scattered results in the literature. The ideas of this paper can be extended to other geometric structures related with closed one or two-forms of different types. Notwithstanding, the formalism on flat compatible connections does not apply to geometric structures related to families of different forms that do not allow for a locally constant form and therefore closed, e.g. for contact and precontact structures, and their extensions (which appear, for instance, in the geometric description of dissipative and action-dependent systems in physics). It would be interesting to find an analogue of our formalism for such theories. In particular, note that non-closed differential forms may have flat compatible connections provided torsion different from zero is allowed. For instance, consider the manifold M = ^3 with natural coordinates {t,x,p}, the one-form η = ṭ - px̣ and the connection ∇ in M whose only non-vanishing Christoffel symbol is Γ_px^t = -1. It is easy to check that η is a contact one-form on M, and parallel relative to the connection ∇, namely ∇η = 0. However, the connection ∇ is not torsion-free: its torsion has local expression T = x̣⊗p̣⊗t - p̣⊗x̣⊗t. This torsion takes account of the non-integrability of the contact distribution D = η. Meanwhile, ∇ is flat. The relation between integrability of a geometric structure and the torsion of compatible connections will be investigated in a future work. Moreover, this work has studied conditions for Darboux theorems of various types. We believe that there is still room to provide more types of Darboux coordinates, and that more research in the study of necessary and sufficient conditions for their existence is needed. In particular, this specially applies to k-pre(co)symplectic manifolds. §.§ Acknowledgments We thank M. de León and J. Gaset for fruitful discussions and comments. We acknowledge partial financial support from the Spanish Ministry of Science and Innovation, grants PID2021-125515NB-C21, PID2021-125515NB-C22, and RED2022-134301-T of AEI, and of the Ministry of Research and Universities of the Catalan Government, project 2021 SGR 00603 Geometry of Manifolds and Applications, GEOMVAP. J. de Lucas and X. Rivas acknowledge partial financial support from project IDUB with number PSP: 501-D111-20-2004310. X. Rivas would like to thank the cordiality shown during his stays at the Faculty of Physics of the University of Warsaw financed from the above mentioned IDUB project. abbrv 0pt plus 1pt
http://arxiv.org/abs/2306.11297v1	20230620052330	Decentralized Quantum Federated Learning for Metaverse: Analysis, Design and Implementation	[ "Dev Gurung", "Shiva Raj Pokhrel", "Gang Li" ]	cs.LG	[ "cs.LG" ]	§ INTRODUCTION Quantum Machine Learning (QML) <cit.> has emerged as a promising paradigm in a number of computationally demanding fields, thanks to the proliferation of quantum computers and the ensuing surge in linear/algebraic computation and operational capabilities. The underlying physics of QML, such as entanglements, teleportation, and superposition <cit.> are the key enablers of such high computational efficiency. When such enablers can be developed under the Federated Learning (FL) framework, such as by employing Quantum Neural Networks (QNNs) <cit.>, the training, learning, federation, prediction, and optimization capabilities can leapfrog simultaneously, leading to the development of Quantum FL (QFL). On the other hand, the blockchain has successfully guaranteed the immutability and trustworthiness of FL <cit.> while facilitating decentralized financial transactions (e.g., cryptocurrency). It is essential to investigate the potential of blockchain for decentralizing QFL functionalities. However, the greenfield development of QFL and decentralizing its capabilities are nontrivially challenging tasks. Despite these challenges, we must overcome them so that the developed QFL not only becomes a part of our future but molds it, propelling us toward a more environmentally and technologically sophisticated civilization. The emerging Metaverse can be taken as an example of such a civilization, which aims to bring together multiple sectors into one ecosystem and create a virtual environment that mirrors its natural equivalent and maintains persistence. Taking the metaverse as a motivating example, we aim to build QFL capabilities to support an interactive a platform that blends social networking, gaming, and simulation to create a virtual space replicating the real world. Furthermore, such QFL can facilitate collaborative learning, which is very important in the metaverse. §.§ Motivation and Background In this work, our primary focus is on designing a robust blockchain-based QFL (BQFL) framework that is specifically tailored to support Metaverse. In addition to that, we also shed light on the hybrid metaverse. As illustrated in Figure <ref>, our objective is to develop a peer-to-peer blockchain-based QFL framework suitable for the Metaverse. One main motivation for this work is the increasing interest in the growing demand for secure, decentralized, and trustworthy ML algorithms in the Metaverse. A QFL based on a centralized global server is prone to single-point failure issues. To address this issue, in this work, we propose a decentralized QFL protocol that takes advantage of the immutable and distributed nature of blockchain technology to create a more trustworthy QFL framework. Eventually, the design of decentralized QFL ensures the security and trustworthiness of machine learning algorithms and cryptocurrency transactions in the Metaverse. §.§ Related Works QFL is an emerging area with several studies in recent years <cit.>. Most QFL works focus on optimization <cit.>. Some works are for security aspects <cit.> and some in terms of implementation <cit.>. BCFL is well studied in the literature; see <cit.> etc. Pokhrel et al. <cit.> introduced the BCFL design to address privacy concerns and communication cost in vehicular networks. Whereas, Chen et al. <cit.> addressed the single point of failure and malicious device detection through the distributed validation mechanism. These works <cit.> have built enough ground to investigate BQFL, to harness the benefits of both blockchain and QFL, which is the main research problem considered in this paper. Duan et. al <cit.> proposed a three-layer metaverse architecture consists of infrastructure, interaction, and ecosystem. Metaverse is based on blockchain and has been studied in a few types of literature <cit.>, but the use and integration of machine learning, especially QFL, in Metaverse, has not yet been explored. Bhattacharya et. al <cit.> proposed FL integration metaverse for the gaming environment. Chang et. al <cit.> provided a survey on AI-enabled by 6G for Metaverse. Zeng et. al <cit.> proposed a high-performance and efficient FL system for Industrial Metaverse. The authors partly incorporated a new concept of Sequential-to-parallel (STP) training mode with a fast Inter-Cluster Grouping (ICG) grouping algorithm and claim that it effectively addresses the heterogeneity issues of streaming industrial data for better learning. §.§ Contributions In summary, the main contributions of this paper are as follows. * We analyze and develop a novel trustworthy blockchain-based quantum federated learning (BQFL), i.e., a decentralized approach to QFL, by presenting and combining the principles of blockchain, quantum computing, and federated learning. * We implement BQFL and develop new insights into the feasibility and practicality of BQFL. In addition, we develop substantial reasoning with a thorough theoretical analysis in terms of employing BQFL under Metaverse, considering both privacy and security concerns. § IDENTIFIED RESEARCH CHALLENGES We have identified several bottleneck challenges in the field of classic and quantum FL and their potential applications for orchestrating Metaverse, all of which are explained in the following. * Limitations of CFL: One of the key limitations of conventional CFL, which is used to train models across heterogeneous clients and aggregate them at a the central server is its restricted computational power <cit.>. This can undermine the advantages of decentralized learning, especially when clients are a mix of pioneers and stragglers. To address this limitation, the use of QNNs is required, which is known as QFL <cit.>. However, the literature currently lacks a complete analysis and understanding of QNNs over FL, and more research is needed in the field of BQFL to investigate how QNNs work in various FL scenarios, such as blockchain integration and data availability. * Central-Serverless QFL: In QFL, only a central server typically aggregates the model parameters, leading to single points of failure and a lack of incentive mechanisms that can limit the performance of QNNs. To address these issues, blockchain technology can be highly effective in introducing trust into QNNs due to its immutable nature. However, the architecture of blockchain-based QNNs is poorly understood in the literature, and we aim to investigate this by developing a BQFL framework that can resolve these issues. * Challenges of P2P Blockchain QFL: Implementing the P2P blockchain FL is a complex and resource-intensive task requiring significant network bandwidth and computational power. As a result, extensive research work and studies are required in this direction. * External use of Blockchain for QFL: This approach will make the implementation simpler and more scalable than the P2P approach. However, it will be less decentralized and trustless than the P2P approach, as it might need a central server. * Challenges in the development of Metaverse: Progress in technologies such as Virtual Reality and Augmented Reality (VR/AR) has led to the possibility of the existence and development of Metaverse. However, problems such as the digital economy's transparency, stability, and sustainability cannot be solved with these technologies alone <cit.>. Also, one of the main challenges or shortcomings in the development of Metaverse is the lack of a clear and distinctive architectural definition that could be used as a standard blueprint approach. Some challenges in the development of Metaverse can be: * How to cope with the computational requirement of Metaverse? * How to achieve efficient resources allocation and solve large-scale data complexities? * Can QFL and Blockchain together solve the issue? * Blockchain QFL for Metaverse: BQFL is a decentralized approach to federated learning that combines blockchain technology, quantum computing, and machine learning. On the other hand, Metaverse is a blockchain-based virtual world that allows users to interact with each other along with their digital assets and experiences, such as Virtual land where one can buy, purchase, and build businesses on the land. Blockchain technology can facilitate trusted digital ownership, interoperability, and decentralization to improve user experience and create new business models. * Problem with today's quantum computers: Current quantum computers are a sort of proof-of-concept that the technology can be built <cit.>. But the problem is their infeasibility in real-life applications and the frequent error that occurs in them, referred to as 'noise' in terms of computation. Thus, this leads to the need for a thorough study and investigation of the implementation of how the blockchain works along with QFL networks. * Multi-Model AI for Metaverse: Metaverse requires different types of model learning, not just limited to text recognition. Thus, the model training needs to learn different forms of data images, speeches, videos, etc. One of the current works being done towards it is by Meta AI, which refers to as self-supervised learning <cit.>. Also, a world model is needed specifically for Metaverse because it needs to be able to interpret and understand different forms of data such as text, video, image, etc. * Hybrid Metaverse: It won't be an overstatement to say that Metaverse will be our future in some way or another for sure. However, the metaverse, especially as proposed by Meta (former Facebook), has come under a number of criticisms that doubt its future. There are many limitations to the purely virtual metaverse. First, not everyone would love to be stuck in a virtual world 24/7. Thus, architecture design in the form of a hybrid metaverse that can incorporate both AR and VR simultaneously needs to be redesigned. Thus, the question is, can we create a metaverse that is a replica of the real world where an actor in that environment can quickly switch between the virtual (VR) and semi-real (AR) world simultaneously? For example, suppose that a replica of an existing shopping center is created as a shopping center metaverse. An actor/actress within VR equipment can enter the metaverse replica. However, while doing so, is it possible for her/him to be teleported to the actual store that s/he wants to visit and see items, in real interaction with the people in the shopping center as if s/he visits there? * Data Utilization: Most metaverse today focuses on avatar creation, with avatar actions limited to interaction. Thus, with so many actors and devices working together, the data thus generated must be utilized for an end-to-end solution <cit.>. The metaverse involves sensor data, such as the user's physical movement and motion capture, and personal data, like biometric data, etc. which are highly sensitive and personal. * Full potential of Metaverse: Due to limited resources and computing power, Metaverse is still far from reaching its full potential of total immersion, materialization, and interoperability <cit.>. § PRELIMINARIES, THEORIES, AND IDEAS In this section, we cover fundamental concepts of quantum machine learning and present the theoretical concept behind the implementation of the system framework proposed <cit.>. §.§ Terms and Terminologies Qubit is the fundamental unit of data storage in quantum computing <cit.>. Unlike classical computers, which use bits with only two values (0 and 1), qubits can also take on a range of values due to mechanical superposition. The number of qubits needed depends on the computational problems that need to be solved. The quantum channel refers to the medium used for transferring quantum information (qubits) <cit.>. Quantum Federated Averaging aims to find a quantum channel that takes an input state and transforms it into the desired output. Quantum Classifiers are devices that solve classification problems. The quantum circuit takes the quantum state as an input. Tensor Circuit <cit.> is an open-source quantum circuit simulator that supports different features such as automatic differentiation, hardware acceleration, etc. It is especially useful for simulating complex quantum circuits used in variational algorithms that rely on parameterized quantum circuits. Noisy Intermediate-Scale Quantum (NISQ) computers <cit.> with a limited number of error-prone qubits are currently the most advanced quantum computers available <cit.>. Quantum computers that are fully fault-tolerant and capable of running large-scale quantum algorithms are not available at the moment. Since real quantum computers are not easily accessible, quantum circuit simulation on classical computers is necessary. The tensor circuit library is commonly used for this purpose. The quantum neural network is a variational quantum circuit used in quantum computing. Variational quantum circuits (VQC) <cit.> are a technique that mimics classical neural networks in quantum computing. It involves training a dataset, encoding the quantum states as input, producing output quantum states, and then converting the output back into classical data. Data Encoding <cit.> is the process of transforming classical information into quantum states that can be manipulated by a quantum computer. Amplitude encoding stores data in the amplitudes of quantum states, while binary encoding stores information in the state of a qubit. Binary encoding is preferable for arithmetic computations, while analogue encoding is suitable for mapping data into the Hilbert space of quantum devices. Quantum Convolutional Neural Network (QCNN) <cit.> is a type of neural network used in quantum computing. Quantum perceptron is the smallest building block in Quantum Neural Networks (QNNs) <cit.>. Blockchain is a decentralized ledger system that relies on distributed nodes to keep a record of transactions that cannot be altered once committed. Smart contracts are programs that automatically execute and follow the terms of a contract or agreement. Blockchain consensus is a crucial task that ensures the system's overall reliability and addresses unexpected behavior from clients or malicious nodes on the network. Decentralized Applications run autonomously on decentralized computing systems such as the blockchain. In peer-to-peer networks, each the participating device has equal privileges and the distributed network architecture is embraced. §.§ Design Ideas and Fundamentals §.§.§ Gradient Descent To minimize a function f(w) and its gradient δ f(w) starting from an initial point, the optimal approach is to update the parameters in the direction of the steepest descent, given by w_n+1 = w_n - ηΔ f(w). This process can be repeated until the function reaches a local minimum f(w^). Here, η is the step size or learning rate, which handles the magnitude of the update at each iteration. §.§.§ Local Training Initially, the first trainer accesses the global parameters w_g. Then, the Adam optimizer, a popular optimization algorithm used in machine learning, is utilized through the optax library for gradient-based optimization. The learning rate is set to a commonly used value of 1e-2. Next, the optimizer state opt_state is initialized with the current parameters w_d. This state represents the optimizer's internal variables and state, which are used to update the model parameters during training. The optimizer state is updated during the training process, which involves iterating over the training data for a certain number of epochs, epochs. In each iteration, the loss value loss_val and the gradient value grad_val are calculated for the current batch using the model parameters w_d, input data x, output data y and variable k. The optimizer state opt_state is updated using the calculated gradients grad_val with the current parameters params, and the updated values updates are stored. These updates are then applied to the current model parameters. Finally, the mean loss loss_mean for the current batch is calculated using loss_val, which is a list of individual loss values for each example in the batch. §.§.§ Class filter [filter function] To remove certain labels from a given dataset, one approach is to iterate over the dataset and filter out samples with undesired labels. This can be accomplished using a conditional statement to check if each sample's label is in the list of labels to be removed. If a sample's label is found in the list, it can be skipped or removed from the dataset. §.§.§ Quantum Circuit [clf function] To create a quantum circuit, we define a function that applies k layers of quantum gates to a given circuit c. Each layer consists of gates applied to each qubit in the circuit. To do this, we iterate over each layer first and then over each qubit in the circuit. If the 2D numpy array params represents the circuit parameters, the rotation angles for each qubit are determined based on the corresponding parameters at a particular index. To create an entangled state, a Controlled NOT (CNOT) gate is applied to each neighboring pair of qubits in the circuit. Next, each qubit is rotated about the x-axis with a rotation angle determined by the corresponding parameter at index [3 j, i]. Then, a z-axis rotation is applied to each qubit with a rotation angle determined by the corresponding parameter at index [3 * j + 1, i]. Finally, another x-axis rotation is applied to each qubit with an angle of rotation determined by the parameters at index [3 * j + 2, i]. Here, j represents the layer number, while i refers to the qubit number. By applying this series of gates to the circuit, we can create a quantum state with desired properties. It is important to note that the specific combination of gates used can have a significant impact on the resulting quantum state i.e. a careful selection of gates and parameters is critical for achieving desired outcomes. §.§.§ Parameterized Quantum Circuits (PQC) When training a parameterized quantum circuit model, the objective is to learn an arbitrary function from the data. This is done by minimizing a cost or loss function, denoted as f(w), with respect to the parameter vector w. The process involves minimizing the expectation value, ⟨ψ(w)\|Ĥ\|ψ(w)⟩, where Ĥ is the Hamiltonian of the system. To achieve this, the trainers first send the parameters w_n to the server. Then, the expectation value is computed as ⟨ψ(w_n)\|Ĥ\|ψ(w_n)⟩. Parameters are updated to w_n+1, and the process is repeated until convergence. Gradient-based algorithms are commonly used to optimize the parameters of a variational circuit, denoted 𝕌_𝕨. For a PQC, its output is a quantum state \|ψ(w_n)⟩, where w_n is a vector of parameters that can be tuned <cit.>. §.§.§ Prediction probabilities [readout function] The purpose of this function is to extract probabilities from a given quantum circuit. The function takes a quantum circuit c as input and generates probabilities using one of two modes, namely softmax and sampling method. In "softmax" mode, the function first computes the logits for each node in the neural network, which are the outputs of the last layer before applying the activation function. These logits are then used to compute the softmax probabilities. On the other hand, if the "sample" mode is selected, the function computes the wave-function probabilities directly and then normalize them to obtain the output probabilities. §.§.§ Loss Function A neural network loss function is optimized in a quantum circuit taking four input arguments: network parameters params, input data x, target data y, and the number of quantum circuit layers k. First, a quantum circuit with n qubits is constructed using the input data x. The circuit is then modified by a classifier function that takes input arguments params, c, and k, thus transforming the circuit into a quantum neural network. The modified circuit is then passed to a read-out function that produces predicted probabilities for each input. Finally, the loss is computed as the negative logarithmic likelihood of the predicted probabilities and is averaged over all samples in the batch. §.§.§ Accuracy Calculation To evaluate the accuracy of the quantum classifier model with given parameters params, input data x, target labels y and a number of layers k, the following steps are taken: First, a quantum circuit c is created using the input data x. Then, the function clf is applied to the circuit c with the parameters params to update the circuit. The updated circuit is then passed to the readout function to obtain the predicted probabilities for each label. Then, the highest probability index is obtained for each input in x and then compared with the true class label index for each input in y. Finally, the precision is calculated by dividing the number of correct predictions by the total number of inputs in x. § PROPOSED BQFL FRAMEWORK We have proposed a trustworthy Blockchain-based QFL (BQFL) framework that integrates blockchain with QFL to address various issues related to privacy, security, and decentralization in machine learning. The framework consists of two approaches, one where the blockchain is separate from QFL, and the other where the blockchain is within QFL in a completely peer-to-peer network. §.§ Motivating example: Metaverse with BQFL Consider a Metaverse space for a city center replicated in a digital twin creating a hybrid space for visiting shops, shopping, looking at items closely, and meeting people. Unlike a complete virtual immersive experience, this metaverse could be a hybrid one that has options for complete immersiveness into the virtual world as well as in augmented reality in the actual store. In this way, we can respond to people with AR by pushing a button or some specific method. For this purpose, the whole system network must perform extremely fast with the least delay issues. Thus, in this regard, as we have found out from experimental and theoretical aspects, BQFL indeed performs better. §.§ The BQFL Framework Design As shown in Figure <ref>, the proposed framework consists of an actual physical space and a virtual replica of the real-world space. The three main building blocks are the QFL framework, Blockchain, and Metaverse. For QFL, we have nodes or devices with QNN for training with the local data. Once all local devices do the local training, then the final averaging of the local models for final global model generation can be done by Metaverse Observer or done in a pure decentralized fashion. The Metaverse observer is the main entity in the framework which looks after overall activities in the metaverse. This entity could be designed for each type of specific part in the metaverse to perform specific tasks. For example, with the proposed framework, the main task for the metaverse observer is to provide knowledge inference, prediction, recommendation, etc. to the actors. The actors or people participating in the metaverse use AR/VR technology to enter into the virtual (purely virtual world with avatars) or augmented reality version of real physical space. The overall workflow for the framework is presented in Algorithm <ref>, whereas, the overall local training in the higher level representation is presented in Algorithm <ref>. §.§ Different Approaches §.§.§ Blockchain separate from QFL - Blockchain externally Blockchain can be integrated into QFL in various ways depending on the need for decentralization. One approach is to use blockchain only for storing transactions such as rewards, model weights, etc., while the clients that train the model do not have copies of the blockchain. In this approach, the blockchain nodes can act as miners, and the QFL nodes can be different from the miners. This approach of using the blockchain externally is a secure and transparent way to store model updates and other metadata. The blockchain is not used for coordination or communication between clients. The steps involved in integrating blockchain externally in QFL are as follows: * Set up a blockchain network with nodes to store and validate transactions. * Deploy a smart contract. * Submit model updates to the smart contract after each round of training by the clients. * The smart contract aggregates the updates and generates a global model for the next round of training. §.§.§ Blockchain within QFL- Peer to Peer BQFL In another approach, we consider decentralized QML in a completely peer-to-peer network where each client has a copy of the blockchain. We present a decentralized peer-to-peer network QFL for demonstration and experimental purposes. The steps involved in integrating blockchain within QFL are as follows. * Clients communicate with each other through the blockchain network. * Blockchain is used to facilitate communication and coordination between clients, along with the storage of updates and other metadata. * Each client in the network validates transactions and contributes to the consensus mechanism, ensuring the integrity and security of the system. This QFL P2P blockchain will allow for a fully decentralized and trustworthy system where clients communicate and collaborate directly without any central authority or third-party service. Some of the obvious advantages of this approach are greater privacy, security, and transparency, with reduced risk of a single point of failure or attack. §.§.§ Foundations of BQFL for Metaverse The architecture of the proposed BQFL consists of a quantum computing infrastructure, the QFL Algorithm, and Metaverse. * Quantum Computing Infrastructure: To train machine learning models using QFL, we require quantum computing resources that are capable of running QFL algorithms. * QFL Algorithm: The QFL algorithm should work in a distributed and privacy-preserving manner among multiple users contributing their local data for the training process. * Metaverse: Metaverse is a virtual world where clients can collaborate and communicate with each other. §.§.§ Assumption for the framework design We have made the following assumptions. * FedAvg performs E steps of SGDs in parallel on a set of devices. Opposite to QFL with a central server, model averaging occurs without a central server architecture. * In the presence of stragglers, devices that can become inactive are inevitable. Thus, all devices are assumed to be active throughout the process. * Data sets are non-IID. § THEORETICAL ANALYSIS In this section, we present theoretical analysis in terms of convergence for blockchain-based quantum federated learning. §.§ Convergence Study In this section, we examine the convergence properties of the proposed algorithms. Here, we analyze the convergence and conditions for convergence under different assumptions about the data distribution and communication patterns. From <cit.>, we follow these assumptions. Objective functions Φ_1, …, Φ_N are all L-smooth, which is a standard assumption in federated learning. Φ_k(β ) ≤Φ_k(θ) + (β - θ)^T ∇Φ_k(θ) + L/2 \|\|β - θ\|\|^2_2. where, for any vectors β and θ, the function value at β is upper-bounded by the function value at θ, plus a term that depends on the gradient of A_k at θ and the distance between β and θ. The objective functions Φ_1, …, Φ_N are all μ-strongly convex. This means that for all β and θ, the following inequality holds: Φ_k(β ) ≥Φ_k(θ) + (β -θ)^T ∇ A_k(θ) + μ/2\|\|β -θ\|\|^2_2. where, k ∈{1,…,N}, β and θ are vectors in the same space as the gradients, and μ is a positive constant that controls the strength of the convexity of the functions. Let suppose ξ_k^t be sampled uniformly at random from the local data of the k^th device. The variance of the stochastic gradients in each device is bounded by a constant σ_k^2 i.e. E \|\|∇Φ_k(θ_t^k, ξ_t^k)-∇Φ_k(θ_t^k)\|\|^2≤σk^2, for k=1, …, N. Here, ∇Φ_k(θ_t^k, ξ_t^k) represents the stochastic gradient of the k^th device's objective function with respect to its local model parameter at iteration t, evaluated at the random data sample ξ_k^t. ∇Φ_k(θ_t^k) represents the average stochastic gradient of the k^th device's objective function with respect to its local model parameter at iteration t evaluated on all the local data samples of the device. For stochastic gradients, its expected squared norm is uniformly bounded, i.e., 𝔼\|\|∇Φ_k(θ_t^k, ξ_t^k)\|\|^2 ≤ G^2 for all k=1,…,N and t=1,…,T-1. where, A_k is the objective function of the k^th client, θ^k_t is the local model parameter of the k^th client at iteration t, ξ^k_t is the random data sample from the k^th client's local data at iteration t, ΔΦ_k(θ^k_t, ξ^k_t) is the stochastic gradient of the k^th client's objective function with respect to its local model parameter at iteration t, evaluated at the random data sample ξ^k_t. G is the bound on the expected squared norm of stochastic gradients. Then, from <cit.> if assumptions 1-4 hold, then fedAvg satisfies, 𝔼[Φ(θ_T)] - Φ^* ≤κ/γ + (T-1)(2B/μ + μγ/2 E\|\|θ_1 - θ^\|\|^2), where, B = ∑_k=1^N p_k^2 σ_k^2 + 6LΓ + 8(E-1)^2G^2. In equation <ref>, 𝔼[Φ(θ_T)] - Φ^ represents the expected excess risk, B is a constant term, and p_k, σ_k, L, Γ, and G are parameters that depend on the problem and the algorithm. Here, κ and γ are constants defined as κ = L/μ and γ = max{ 8κ, E }. Whereas, η_t = 2/μ(γ + t). §.§ Considering encoding and decoding time for QFL Data encodings for quantum computing is the process of data representation for the quantum state of a system <cit.>. This process of encoding classical data into a quantum state can be a significant bottleneck, as it can introduce significant time delays. The choice of encoding scheme used will depend on the specific task and the available hardware. Here, we consider a vanilla data encoding method which is known as "amplitude encoding". It involves mapping classical data to the amplitudes of a quantum state. Given an input data vector of length L, the quantum state can be represented as: \|ψ⟩ = ∑_i=1^L a_i \|i⟩. Here, a_i is the ith element of the input data vector, and \|i⟩ is the basic state corresponding to the binary representation of i. A sequence of gates is applied to encode the data vector into a quantum circuit. This sets the amplitudes of the quantum state to the values in the input data vector. In order to do that, a set of rotation, gates can be used that adjust the phase of each basis state, followed by a set of controlled-NOT (CNOT) gates for the amplitudes. Even though, the time required to apply a single gate in a quantum circuit is typically on the order of nanoseconds or less, but for the whole data vector, it will depend on the number of qubits and the complexity of the encoding process. Assuming that we have a quantum circuit with n qubits, the time required to encode a single element of the input data vector can be approximated as: t_i≈ n · t_gate Here, t_gate is the time required to apply a single gate in the quantum circuit. Therefore, for the entire input data vector, the total time required to encode the can be approximated as: t_T≈ L · n · t_gate The above equation follows the assumption that we encode each element of the input data vector one at a time. §.§ Blockchain Time Delay Blockchain time delay can include both communication delay and consensus delay. Also, the time required to share the new copy of the blockchain ledger with each other can be added to the total delay time. We also need to consider the time it takes for a block to be appended to the blockchain after it is proposed by a node as well as the block propagation delay. Suppose we have a blockchain network with n nodes, and each node has a stake Stake_i and a probability prob_i of being selected as the next validator to create a block. The probability of a the node i being selected as the validator can be represented as, prob_i = Stake_i/Stake Let's assume that each node takes t seconds to create a block and the network latency is L seconds. The time it takes for a block to be created and validated is: T = max(t, L) + t Now, to calculate the expected time it takes for a block to be created and validated by the network, given the stake and probability of each node, we can write, E[T] = 1/∑_i=1^n prob_i∑_i=1^n prob_i T The proposed blockchain-based quantum federated learning algorithm satisfies: E[total_time] ≤κ/γ + (T-1)(2B/μ + μγ/2 E\|\|θ_1 - θ^\|\|^2) + 1/∑_i=1^n prob_i∑_i=1^n prob_i T + L · n · t_gate Using (<ref>), (<ref>) and (<ref>), we can prove that the total time convergence is satisfied as in Theorem <ref>. §.§ Metaverse Factors With important insights form <cit.>, we can express the meta immersion experience E_meta for any user k as, E_meta^k = D_rate^k(1 - Ulink_errorRate^k) VR_e^k where, D_rate is the download data link that impacts lossless virtual experience, Ulink_errorRate is uplink tracking bit error rate and VR_e is a virtual experience that is subjective to the user. For quantifying virtual experience, we can say, VR_e ∝{activity, onlineTime, ...} From Equation <ref> and <ref>, VR_e ∝ E[total_time] From our experimental results <ref>, QFL performs faster than CFL. Thus, this directly implies that with QFL we will have better VR_e than CFL and, in general, better service indicators and technical indicators. With BQFL, the experience of Metaverse VR_e is always greater or more satisfactory than CFL. Different technical and service indicators such as D_rate, Uplink_errorRate, etc. are impacted proportionally to VR_e, E[total_time]. Using (<ref>) and Theorem <ref>, we can prove Theorem 2. We will discuss later how our experimental analysis supports the conclusion of Theorem 2. §.§ Metaverse Ecosystem Different aspects of Metaverse include user behavior prediction, content recommendation, object recognition, training data, etc. The metaverse can be considered as a network of interconnected nodes, where each node is a user, object, or virtual space, and edges are the relationships or connections between them. Graph theory can be used for mathematical analysis and modeling of such networks. In the metaverse, various events, interactions, and behaviors occur probabilistically. Thus, probability theory can be used to model the likelihood of events happening like the probability of encountering a particular object or meeting a specific user. With statistical analysis, understanding patterns, trends, and distributions within the metaverse can be achieved. Also, user behavior can be analyzed within the metaverse in a probabilistic manner. Finally, machine learning algorithms could be used to predict and simulate user actions based on historical data, contextual information, and user preferences. To this end, we have considered three key aspects of metaverse ecosystems that can be orchestrated with BQFL. They are: §.§.§ PQ security <cit.> For a fair and transparent ecosystem, security is crucial. This demonstrates an impeding need for the post-quantum secure BQFL. §.§.§ Autonomous Governance Autonomous Governance is the key to the success of the whole system. This prevents the system from being controlled by a certain group of people. §.§.§ AI-Driven Metaverse Observer Duan et. al <cit.> presented the idea of an AI-Driven Metaverse Observer, who can track real-time operation data from the Metaverse and analyze it. This observer can make a recommendation on ongoing events to users. For this approval rating system can be implemented. This would provide global information that can assist users to capture timely events in a better way. § EXPERIMENTS AND RESULTS To study the integration of blockchain in QFL, we have inherited implementation approaches in <cit.>, <cit.> for BCFL and <cit.> for QFL. The experiments were run in Google Colab Pro as well as on a local computer. §.§ Preprocessing Image data are preprocessed for training and testing purposes as follows. The first pixel values of the input images are scaled in the range of [0,1]. After that, encoding is applied to the images depending on the type of encoding. With the "vanilla" encoding, the mean is set to 0. With "mean" encoding, the mean of training images is subtracted from all images. While with the "half" encoding approach, the images are shifted by 0.5. Another important step in preprocessing is resizing the image to the size of [int(2^n/2), int(2^n/2)], where n is the number of qubits used in the quantum circuit. Eventually, the resized images are flattened to a 1D array of size 2^n. Finally, the pixel values are normalized by dividing each image by the square root of the sum of its squared pixel values so that we have a unit length. The labels for the input images are hot encoded to match the output format of the model. §.§ Dataset Preparation Quantum computers cannot directly process the classical representations of datasets. The data preparation consists of the following steps: * Data Loading: Libraries like TensorFlow can be used for the loading and splitting of data sets into a training and test set. With the initial processing of normalization and encoding, the downscaling of the images needs to be performed afterward. * Downscaling images: An image size of 28 × 28 is too large for existing quantum computers. Thus, they need to be resized to a size of 16 × 16 (for an 8-qubit quantum circuit) or 4 X 4. * Data Encoding is an essential step in QML. We perform encoding of classical data into states of qubits. We use the MNIST dataset for experimental purposes. MNIST dataset consists of 70,000, 28 × 28 images of handwritten digits. The digits consist of 10 classes (0 to 9). For this work, we have performed data sharding similar to <cit.>. In doing so, we remove the samples with labels equal to '8' and '9' from both the training and the testing sets. We follow a cycle-m structure, where each client has access to the data set to only m classes at a time. We also consider n = 9 clients as a whole with 7 assigned as workers and 2 miners. Both quantum FedAvg and quantum FedInference <cit.> are experimented with. For classical learning, normal FedAveraging is used as in <cit.>. The batch size is 128 and the learning rate is 0.01. In terms of evaluation, top 1 accuracy and loss are used as performance metrics. Figures <ref>, <ref>, and <ref> display the individual test accuracy plots for BQFL-inf, BQFL-avg, and BCFL-avg, respectively. BQFL-inf performs exceptionally well with non-IID data, as evident from Figure <ref>. However, BQFL-avg struggles more with non-IID data, as depicted in Figure <ref>, with highly fluctuating accuracy between the Top 1 and the lowest accuracy, as shown in Figure <ref>. On the other hand, BCFL-avg performs well with the non-IID dataset, as illustrated in Figure <ref>. §.§ Test Performance Figure <ref> shows the test accuracy plots for BQFL-avg, BQFL-inf, and BCFL-avg. Among these, BCFL-avg outperforms both BQFL-inf and BQFL-avg in terms of test accuracy. As the degree of non-IID decreases, the test accuracy of BCFL-avg increases. However, for BQFL-inf, the test accuracy decreases slightly with an increase in the degree of non-IID. On the other hand, BQFL-avg suffers greatly with a higher degree of non-IID, especially when training workers with each having only two classes, resulting in a low final test accuracy. §.§ Training Performance In addition to evaluating the test accuracy, we also analyzed the training performance of the different FL frameworks. As shown in Figure <ref>, both BQFL-avg and BQFL-inf converge faster than BCFL-avg. BQFL-avg and BQFL-inf share similar training performance, indicating that the additional communication overhead incurred by BQFL-inf does not result in significant performance degradation. However, as shown in Figure <ref>, BQFL-inf performance is declining when the degree of non-IID increases. This is the opposite of BQFL-avg in terms of test accuracy. In contrast, as shown in Figure <ref>, BCFL-avg has a slower convergence rate compared to the BQFL frameworks, especially when the degree of non-IID is high in terms of training. Overall, these results suggest that BQFL-avg and BQFL-inf can achieve better training performance than BCFL-avg, while BQFL-inf may not be as robust as BQFL-avg in handling non-IID data. §.§ Impact of Degree of Non-IID The impact of the degree of non-IID on the test accuracy of BQFL-Avg, BQFL-inf and BCFL- avg is shown in Figure <ref>. The results reveal that the degree of non-IID has varying effects on the performance of the different federated learning algorithms. First, we observe that BQFL-Avg is the most impacted by a higher degree of non-IID, as evidenced by its decreasing test accuracy with increasing non-IID. This indicates that BQFL-Avg may not be the best choice for federated learning scenarios with highly non-IID data distributions. In contrast, BQFL-inf is not that significantly impacted by the degree of non-IID. This suggests that BQFL-inf may be a suitable algorithm for federated learning with non-IID data distributions. BQFL-avg, on the other hand, shows a more obvious decrease in test accuracy with increasing non- IID, particularly at higher levels. This indicates that BQFL-avg may not perform well in federated learning scenarios with highly non-IID data distributions. Finally, we observe that BCFL-avg performs consistently well across all levels of non-IID. In fact, BCFL-avg outperforms BQFL-avg at all levels of non-IID, indicating that BCFL-avg may be a more robust algorithm for federated learning with non-IID data distributions. §.§ Quantifying Stake Accumulation The plot in Figure <ref> indicates that there is a similar trend in stake accumulation for all three cases of BQFL-avg, BQFL-inf, and BCFL-avg. However, it is worth noting that there are some variations in the initial stages of stake accumulation, especially for BCFL-avg. As shown in the plot, stake accumulation starts at a relatively lower level for BCFL-avg, but it catches up with the other two methods as the stake accumulation progresses. It is important to consider stake accumulation as it directly affects the selection of representatives for the consensus protocol. In scenarios where a selection mechanism is implemented, higher stake accumulation indicates a higher probability of a node being selected as a representative, which in turn, increases its influence in the consensus process. Therefore, having a steady and predictable stake accumulation rate is crucial for the stability and security of the consensus protocol. However, its actual implementation is limited in this work. §.§ Delay Performance In terms of communication time as shown in Figure <ref>, BQFL-inf takes the longest time compared to the other algorithms. BQFL-avg is faster than BCFL-avg in this aspect, which indicates that BQFL-avg can achieve faster convergence compared to BCFL-avg. However, it's important to note that there is a slight difference in the way test accuracy and test loss are computed between BQFL and BCFL. Regarding block generation time as shown in Figure <ref>, BCFL-avg takes the longest time of all algorithms. BQFL-avg and BQFL-inf have similar performance in terms of block generation time. It is worth mentioning that block generation time can have a significant impact on the overall performance of the federated learning algorithm, especially in scenarios where the network has limited resources. Therefore, a trade-off must be made between communication time and block generation time to achieve optimal performance for a given system. §.§ Accounting Metaverse measures For a fully immersive experience in the metaverse, a few metrics are known as the service and technical indicators of user experience and feelings in the metaverse For example, for a lossless visual experience, a download data link is required to be high enough, i.e., 20–40 Mbps <cit.>, which impacts the resolution, frame rate, motion blur, etc., that determines the feeling of presence and are service indicators. In this instance, BQFL can assist in achieving its goal because of its high-performance training and testing, which can be used to create digital twins or any other tasks faster. From Figures <ref> and <ref>, it is clear that BQFL-avg performs better than BCFL-avg implying that it is better suited for applications such as metaverse and can fulfill today's increasing data and computational needs. § CONCLUDING REMARKS In this work, we have developed a rigorous analysis and design of a BQFL framework, considering its practicality and implementation in Metaverse. Extensive theoretical and experimental analysis is done to design and understand the behavior of integration between QFL with the blockchain. We have developed new insights and explained significant results with new findings. Our experimental results demonstrated the practicality of BQFL. However, extensive further research is required to fully understand the practicality of BQFL and its application for the metaverse application. which requires further investigation.
http://arxiv.org/abs/2306.06298v1	20230609232721	Progress on Constructing Phylogenetic Networks for Languages	[ "Tandy Warnow", "Steven N. Evans", "Luay Nakhleh" ]	q-bio.PE	[ "q-bio.PE", "stat.AP" ]	Front-running Attack in Distributed Sharded Ledgers and Fair Cross-shard Consensus Jianting Zhang Purdue University [email protected] Tiantian Gong Purdue University [email protected] Wuhui Chen Sun Yat-sen University [email protected] Zicong Hong The Hong Kong Polytechnic University [email protected] Sifu Luo Sun Yat-sen University [email protected] Aniket Kate Purdue University [email protected] July 31, 2023 ===================================================================================================================================================================================================================================================================================================================================================================== In 2006, Warnow, Evans, Ringe, and Nakhleh proposed a stochastic model (hereafter, the WERN 2006 model) of multi-state linguistic character evolution that allowed for homoplasy and borrowing. They proved that if there is no borrowing between languages and homoplastic states are known in advance, then the phylogenetic tree of a set of languages is statistically identifiable under this model, and they presented statistically consistent methods for estimating these phylogenetic trees. However, they left open the question of whether a phylogenetic network – which would explicitly model borrowing between languages that are in contact – can be estimated under the model of character evolution. Here, we establish that under some mild additional constraints on the WERN 2006 model, the phylogenetic network topology is statistically identifiable, and we present algorithms to infer the phylogenetic network. We discuss the ramifications for linguistic phylogenetic network estimation in practice, and suggest directions for future research. § INTRODUCTION The evolutionary history of a collection of languages is fundamental to many questions in historical linguistics, including the reconstruction of proto-languages, estimates of dates for diversification of languages, and determination of the geographical and temporal origins of Indo-Europeans <cit.>. These phylogenetic trees can be estimated from linguistic characters, including morphological, typological, phonological, and lexical characters <cit.>. There are many methods for estimating phylogenetic trees, including parsimony criteria, distance-based methods, and likelihood-based techniques based on parametric models of trait evolution, and the relative strengths of these methods and how they depend on the properties of the data have been explored using both real-world and simulated datasets <cit.>. Yet it is well known that languages do not always evolve purely via descent, with “borrowing" between languages requiring an extension of the Stammbaum model to a model that explicitly acknowledges exchange between languages <cit.>. One graphical model that has been used explicitly for language evolution is composed of an underlying genetic tree on top of which there are additional contact edges allowing for borrowing between communities that are in contact <cit.>. This type of graphical model has been studied in the computational phylogenetics literature, where it is referred to as a “tree-based phylogenetic network" <cit.>. The estimation of phylogenetic networks is very challenging, both for statistical reasons (i.e., potential non-identifiability) and computational reasons (see discussion in <cit.>); although tree-based phylogenetic networks are a restricted subclass of phylogenetic networks, there are still substantial challenges in estimating these phylogenetic networks, as discussed in <cit.>. As difficult as it is to estimate a tree-based phylogenetic network, the estimation of a dialect continuum represents an even larger challenge, and the interpretation of a dialect continuum is also difficult <cit.>. However, at least for language families such as Indo-European, tree-based phylogenetic networks may suffice <cit.>, and hence are the focus of this paper. The inference of phylogenetic networks depends on the graphical model (i.e., tree, tree-based phylogenetic network, etc.) and also on the stochastic model of character evolution. Examples of relevant character evolution models include the Stochastic Dollo with Lateral Transfer model in <cit.>, which models presence/absence of cognate classes (i.e., binary characters) with borrowing, and a model for multi-state character evolution in <cit.>, which also allows for borrowing. When the phylogenetic network is tree-based, we may seek to estimate just the genetic tree (i.e., the tree in the tree-based phylogenetic network) or we can seek to estimate the entire topology of the phylogenetic network itself, which would include the location of the contact edges. In this study, we address the challenge of estimating the phylogenetic network topology under an extension of the model proposed in <cit.>, which we will refer to as the WERN 2006 model to acknowledge the four authors of the model (Warnow, Evans, Ringe, and Nakhleh). In the WERN 2006 model, the graphical model is a tree-based phylogenetic network so that the underlying genetic tree is rooted and binary and the non-tree edges represent contact between language groups and are bidirectional. Characters can evolve down the underlying genetic tree or can use one or more contact edges. However, if a character evolves using a contact edge so that a state is borrowed into a lineage via that contact edge, then the borrowed state replaces the state already in the lineage. Thus, every character evolves down some rooted tree contained within the rooted network. The WERN 2006 model includes numeric parameters that govern the probability of change, and these parameters depend on the type of character, which may be phonological, morphological, or lexical. While the phonological characters have two states, 0 and 1, indicating presence-absence of a sound change and 0 indicating the ancestral state, the other characters can exhibit any number of states on the languages, and so are called “multi-state" characters. The WERN 2006 model allows for homoplasy in character evolution (i.e., parallel evolution or back-mutation, see Figure <ref>), provided that the homoplastic character states are known (in other words, we know which character states can arise as a result of either parallel evolution or back-mutation). Our WERN 2023 model modifies the WERN 2006 model as follows. First, under the WERN 2023 model, we allow for any number of homoplastic states, as long as these states are known in advance. We require that the probability of homoplasy for the root state be strictly less than 1 for all non-binary characters. We also allow for some characters to not exhibit any homoplasy, but the probability of a character being homoplasy-free is a parameter that can be any value x with 0 ≤ x ≤ 1. The special case where 0 < x means that the probability of a random character being homoplasy-free is strictly positive; when this special case holds, we will be able to use this information fruitfully. In this article, we show that we can estimate the unrooted topology of any WERN 2023 model phylogenetic network in a statistically consistent manner, provided that the cycles in the phylogenetic network are vertex-disjoint (which will ensure that the phylogenetic network is level-1 <cit.>) and each cycle contains at least four vertices. The key to constructing these unrooted topologies is the inference of the unrooted quartet trees displayed by trees contained within the phylogenetic network, and these can be easily constructed from the fact that we have identifiable homoplasy. Finally, we also show that if homoplasy-free characters have positive probability, then we can identify the rooted topology of such a phylogenetic network. The rest of the article is organized as follows. In Section <ref>, we give a high-level description of the new model we propose, followed by an algorithm for estimating the unrooted phylogenetic network and in Section <ref> we present an algorithm for rooting that unrooted topology. We state the theoretical guarantees for the algorithms, but leave the proofs in the appendix. In Section <ref> we discuss the implications for the theoretical results we provide and the issues when trying to estimate these phylogenetic networks in practice. We conclude in Section <ref> with a discussion of future work. § MATHEMATICAL FOUNDATIONS This section introduces the basic mathematical concepts and results, but we direct the interested reader to <cit.> and <cit.> for additional context. §.§ Basic terminology The tree-based rooted phylogenetic networks N we consider are formed by taking a rooted binary tree T (with root r) and adding edges to the tree (see Figure <ref>) so that no two cycles share any vertices. The edges within the rooted tree are directed away from the root towards the leaves, but the additional edges represent borrowing and so are bi-directional. To ensure identifiability, throughout this article we will constrain the phylogenetic network topology so that the smallest cycle in the unrooted network has at least four vertices; for example, the unrooted network in Figure <ref>(c) has two cycles, each with four vertices. Moreover, when we say that the phylogenetic network N is level-1, we will specifically mean that all cycles have at least four vertices. We let ℒ denote the set of languages for which we wish to construct the true phylogenetic network, N. We use linguistic characters to estimate this network, and let α(L) denote the state of language L for character α. Recall that we say that a character exhibits homoplasy on a tree T if it is not possible to assign labels to the internal vertices so that the character evolves without back mutation or parallel evolution (Figure <ref>). Furthermore, every rooted network defines a set of rooted trees (Figure <ref>) and every character evolves down one of the trees within the network. We say that a character evolves without homoplasy on a network if it is homoplasy-free on at least one of the trees inside the network; conversely, a character exhibits homoplasy on a phylogenetic network if it exhibits homoplasy on every tree within the network. We can also consider the rooted trees in the network as unrooted trees, in which case they can be used to define quartet trees. Thus, we will say that the unrooted tree T displays a quartet tree uv\|xy if T has an edge e that separates leaves u,v from leaves x,y (see Figure <ref>). The set of all quartet trees displayed by any tree contained inside the network N is referred to as Q(N). § CONSTRUCTING THE UNROOTED NETWORK TOPOLOGY In this paper, the phylogenetic network N consists of an underlying genetic tree on top of which there are borrowing edges, the cycles that are created have at least four vertices and are vertex disjoint, and we assume that the characters evolve down N under the WERN 2023 model. Here we describe a method that is based on computing quartet trees for constructing the unrooted topology of the phylogenetic network. §.§ Quartet Tree-Calculator (QTC): Constructing Q(N) We begin with a description of the QTC method (Quartet Tree Calculator) for computing quartet trees. Recall that we assume we know which of the states are homoplastic. Let α be a character and assume states 1 and 2 are both non-homoplastic. Now suppose that we have four languages a,b,c,d such that α(a)=α(b)=1 and α(c) = α(d)=2. Then, we add quartet tree ab\|cd to our estimate of Q(N). We compute these quartet trees for every character α in turn, thus defining a set of quartet trees that we will refer to as Q, the output of QTC. Let N be a rooted phylogenetic network, and let characters evolve down N under the WERN 2023 model, and let Q be the output of QTC. Then very quartet tree in Q will be in Q(N). Furthermore, as the number of characters increase, with probability converging to 1, every quartet tree in Q(N) will appear in Q. Thus, QTC is a statistically consistent estimator of Q(N). The proof of this theorem is given in the appendix. §.§ Quartet-Based Topology Estimator We now present QBTE (Quartet-Based Topology Estimator), our method for constructing an unrooted network topology, using the quartet trees calculated using QTC. By Theorem <ref>, QTC will return Q(N) with probability going to 1 as the number of characters increases. Hence, to estimate the unrooted topology of a phylogenetic network N, it suffices to use a method that can take unrooted quartet trees as input, provided that it is guaranteed to return the unrooted topology of N when given Q(N). A natural candidate is the algorithm from Section 7.1 of <cit.>, which correctly constructs the unrooted topology of level-1 networks N given Q(N), and does so in O(n^4) time, where n is the number of leaves in the network N. However, any algorithm (e.g., <cit.>) that correctly computes the unrooted phylogenetic network topology for any level-1 network N given Q(N) can be used. Hence, we propose the following two-phase technique to estimate the unrooted topology of N. QBTE: constructing the unrooted network topology * Construct a set of quartet trees Q from the input M character dataset, using the QTC method. * Use the algorithm from <cit.> applied to Q to produce an estimate of the unrooted topology of N. The QBTE (Quartet-based topology estimation) method is statistically consistent for estimating the unrooted topology of the network N under the WERN 2023 model when the rooted network N is a level-1 network where all cycles have length at least 4; furthermore, QBTE runs in polynomial time. The proof is provided in the appendix. § ROOT-NETWORK: ROOTING AN UNROOTED LEVEL-1 NETWORK Here we present Root-Network, a method for rooting an unrooted level-1 phylogenetic network. Thus, the input to Root-Network will be the unrooted network N and the set 𝒞_0 of homoplasy-free phonological characters that exhibit both states 0 and 1 at the leaves of N. If 𝒞_0 is empty, we mark every edge as being able to include the root, and otherwise we will process the edges to determine which edges are feasible as root locations. At the end of processing all the homoplasy-free phonological characters, any edge that remains is considered a feasible root location. When an edge e=(a,b) is used as the root location, it is subdivided through the introduction of a new vertex v_e so that the edge (a,b) is replaced by a path of length two containing two edges: (a,v_e) and (v_e,b). The vertex v_e is then the root of the tree that is produced. Since these characters in 𝒞_0 exhibit both states and because 0 is the ancestral state, making e contain the root is equivalent to saying that the state of v_e is 0 for every character in 𝒞_0. Hence, determining if v_e can be the root for a given character α∈𝒞_0 is equivalent to saying that v_e can be labelled 0 without losing the homoplasy-free property for α. Root-Network determines which edges cannot contain the root by processing each character from 𝒞_0 in turn. All edges are initially colored green, and any edge that is discovered to not be able to contain the root for some character is colored red. Under the assumptions of the algorithm, at the end of the algorithm there will be at least one edge that is not colored red. The set of edges that are green constitutes the set of edges that can contain the root, and will be returned by the algorithm. Handling cut edges. An edge whose deletion splits the network into two components is referred to as a “cut edge." If e is a cut-edge in the network, then it is easy to tell if it should be red or green. Removing a cut edge e splits the leafset into two sets, A and B. If any character exhibits state 1 on leaves in both A and B, then e must be colored red, and otherwise it remains green. We note that it is not possible for both 0 and 1 to appear on both sides of e, since that is inconsistent with homoplasy-free evolution. Processing edges in cycles All edges that are not cut edges are in cycles, and because we are working with a level-1 network, any such edge is in exactly one cycle. Here we show how to color the edges that are in cycles. Let γ be a cycle in N, and assume it has k vertices. If we were to remove all the edges in the cycle, the network would split into exactly k components, since all cycles in N are vertex-disjoint. Consider a single character in 𝒞_0 and the states of this character at the leaves in each of the components defined for γ. We split the components into three sets: the set A(0) of components all of whose leaves have state 0, the set A(1) of components all of whose leaves have state 1, and the set A(0,1) the set of components where at least one leaf has state 0 and at least one leaf has state 1. Each vertex in γ belongs to exactly one component, and so we can label the vertices of γ. according to the type of component they belong to (i.e., A(0), A(1), or A(0,1)). We note that γ has at most one vertex labelled A(0,1), as otherwise the character cannot evolve without homoplasy. We use this to determine if we should recolor the edges in γ as follows: * If there is one vertex in γ labelled A(0,1), then we color red any edge incident with a vertex labelled A(1). * If there are no vertices in γ labelled A(0,1), then we color red any edge both of whose endpoints are labelled A(1). We perform this processing for every character, thus recoloring some edges in γ red. Any edge that remains green throughout this process is returned by Root-Network. Let N be the true unrooted level-1 network and let 𝒞_0 denote the set of homoplasy-free phonological characters that exhibit both 0 and 1 at the leaves of N. Rooting N on any edge returned by Root-Network will produce a rooted network on which all characters in 𝒞_0 can evolve without homoplasy, and the edge containing the true location of the root will be in the output returned by Root-Network. Furthermore, when given the unrooted topology of the true phylogenetic network as input, Root-Network is a statistically consistent estimator of the root location under the assumption that the probability of homoplasy-free phonological characters is positive. The proof for this theorem is in the appendix. As a corollary, we have: The two-stage method of QBTE followed by Root-Network is statistically consistent for estimating the rooted topology of the network N under the WERN 2023 model, when the rooted network N is a level-1 network and the probability of homoplasy-free phonological characters is positive. Furthermore, this two-stage method runs in polynomial time. The proof follows easily from Theorems <ref> and <ref>. § PRACTICAL CONSIDERATIONS We have described (1) QBTE, a method for constructing the unrooted topology of a level-1 phylogenetic network from characters, and (2) Root-Network, a method for rooting the resultant topology of the level-1 network. Each of these methods has strong theoretical guarantees of statistical consistency. However, these guarantees do not imply good or even reasonable accuracy on finite data, such as can occur when the input is of insufficient quantity or does not evolve under the assumptions of the theorems (e.g., down a level-1 network with known homoplastic states). Therefore, we ask: what are the consequences for estimating the network from real-world languages, given these caveats? It is important to realize that the guarantees for the QBTE algorithm depend on QTC correctly returning the entire set of quartet trees Q(N), as the algorithm from <cit.> depends on having this entire set for constructing the unrooted network topology. Moreover, QBTE also requires that the characters evolve down a level-1 network. Even if the assumptions of the character evolution are valid, so that the characters evolve down a level-1 phylogenetic network under the WERN 2023 model, some of the quartet trees in Q(N) may fail to appear in the output from QTC, which will violate the requirements for QBTE to return a network. Furthermore, if the assumptions regarding character evolution are invalid, then some of the quartet trees produced by QTC may be incorrect (e.g., they may be quartet trees not displayed in the phylogenetic network). Finally, it may be that the characters evolve down a phylogenetic network that is more complex than a level-1 network. In each of these cases, the most likely outcome is that QBTE will fail to return anything. Given the likely limitations of all three methods, we consider an alternative approach. Instead of estimating the unrooted network topology directly, we propose to estimate the unrooted genetic tree first using quartet trees, then (if desired) root the genetic tree and add in the contact edges. For example, such an approach was used in <cit.> to produce a perfect phylogenetic network for Indo-European. Genetic Tree Estimation (heuristic): * Step 1: Construct a set Q of quartet trees using the QTC technique. * Step 2: Build a tree T for ℒ from Q, using quartet amalgamation methods that construct trees on the full leafset from sets of estimated quartet trees; examples include ASTRAL <cit.>, Quartets MaxCut <cit.>, and Quartet FM <cit.>, which do not require that all the quartet trees be correct, nor that the set contain a quartet tree for every four-leaf subset of the leafset. Note that quartet amalgamation methods typically try to solve the Maximum Quartet Support Supertree problem, where the output is a tree that agrees with as many quartet trees in the input as possible. Because these quartet amalgamation methods will return output trees even under adverse conditions (e.g., where many quartet trees have errors), this type of approach is guaranteed to return a tree T provided that the set Q of quartet trees produced by QTC contains quartets that cover the leafset. This condition is much easier to achieve than what is required for our level-1 network estimation method, QBTE. Moreover, when the quartet amalgamation method uses polynomial time (which is true of many such methods), this approach uses polynomial time. Hence there are several empirical advantages to this approach over QBTE. § FUTURE WORK This study suggests several directions for future work. For example, we recognized practical limitations of QBTE, our proposed method for estimating the unrooted phylogenetic network topology: although it is provably statistically consistent under the WERN 2023 model, assuming that the phylogenetic network is level-1, in practice it may fail to return any network topology for a given input. Hence, it has limited practical use for analyzing real world data. Therefore, the most important future work is to determine whether there are methods that are provably statistically consistent for estimating the topologies of these tree-based phylogenetic networks that are also of practical benefit. The approach we suggested of estimating the genetic tree first is worthwhile, but we do not yet have any proofs of statistical consistency for that estimation using quartet amalgamation methods. Another technique that might lead to phylogenetic network estimation methods that are of practical benefit would seek to modify the algorithms used for QBTE so that they were guaranteed to return network topologies even when the conditions for exact accuracy did not apply. Such extensions could potentially be implemented by seeking level-1 network topologies that agreed with the maximum number of input quartet trees. Finally, another direction for future work is to determine whether more complex graphical models (e.g., level-2 phylogenetic networks) are identifiable under the WERN 2023 model, and whether level-1 phylogenetic networks are identifiable under character evolution models that are more complex than the WERN 2023 model. Future work is needed to explore these different possibilities. § APPENDIX We restate and then sketch proofs for Theorems 1–3. Theorem 1. Let N be a rooted phylogenetic network, and let characters evolve down N under the WERN 2023 model, and let Q be the output of QTC. Then very quartet tree in Q will be in Q(N). Furthermore, as the number of characters increase, with probability converging to 1, every quartet tree in Q(N) will appear in Q. Thus, QTC is a statistically consistent estimator of Q(N). We begin by showing that every quartet tree placed in Q is also in Q(N). Recall that quartet tree uv\|xy is included in Q if and only if some character α is found such that α(u)=α(v) ≠α(x)=α(y) and the states α(u),α(x) are non-homoplastic. This character evolves down some tree T contained inside the network. Moreover, since the states exhibited at u,v,x,y are non-homoplastic, there is a path in T connecting u and v and another path connecting x and y and these two paths do not share any vertices. Hence, the quartet tree uv\|xy is in Q(N). We now show that in the limit, every quartet tree in Q(N) is also in Q. Let ab\|cd be a quartet tree in Q(N). Hence, there is a rooted tree T contained in N that induces this quartet tree (when T is considered as an unrooted tree). With positive probability, a character will evolve down T. Without loss of generality, assume a and b are siblings in the rooted version of T, so that their least common ancestor, lca_T(a,b), lies strictly below the root of the tree T. Since a and b are siblings, there is an edge e above lca_T(a,b) within T. It follows that the probability that a random character evolves down T, selecting a non-homoplastic state at the root, and then changing on e but on no other edge in T, is strictly positive. Note that for any such characters α, we have α(a)=α(b) and α(c)=α(d) where α(a) and α(b) are different and both are non-homoplastic states. In such a case, Q will include quartet tree ab\|cd. Thus, in the limit as the number of characters increases, with probability converging to 1, Q will contain every quartet tree in Q(N), the set of all quartet trees for the network N. Since in the limit Q ⊆ Q(N) and Q(N) ⊆ Q, it follows that Q = Q(N) with probability converging to 1. Theorem 2. The QBTE (Quartet-based topology estimation) method is statistically consistent for estimating the unrooted topology of the network N under the WERN 2023 model when the rooted network N is a level-1 network where all cycles have length at least 4; furthermore, QBTE runs in polynomial time. By Theorem <ref>, we have shown that as the number of characters increases, we can construct Q(N), the set of all quartet trees for N. By <cit.>, the algorithm they present is a statistically consistent estimator of the unrooted topology for any level-1 network. Since a tree-based network in which no two cycles share any nodes is a level-1 network, it follows that QBTE is statistically consistent. Moreover, since the algorithm from <cit.> runs in O(n^4) time, where n is the number of leaves in the network, QBTE runs in polynomial time. Theorem 3. Let N be the true unrooted level-1 network and let 𝒞_0 denote the set of homoplasy-free phonological characters that exhibit both 0 and 1 at the leaves of N. Rooting N on any edge returned by Root-Network will produce a rooted network on which all characters in 𝒞_0 can evolve without homoplasy, and the edge containing the true location of the root will be in the output returned by Root-Network. Furthermore, when given the unrooted topology of the true phylogenetic network as input, Root-Network is a statistically consistent estimator of the root location under the assumption that the probability of homoplasy-free phonological characters is positive. We sketch the proof due to space constraints. It is straightforward to verify that an edge is colored red for a character α if and only if subdividing the edge and labelling the introduced node by 0 for α makes α homoplastic on every tree contained within the network. Furthermore, it is not hard to see that if we root the network on any edge that remains green throughout Root-Network, then all characters in 𝒞_0 will be homoplasy-free. As a result, the first part of the theorem is established. For the second part of the theorem, if the probability of homoplasy-free phonological characters is positive, then with probability converging to 1, for every edge in the true network, there is a character α that changes on the edge but on no other edge; hence, α will be non-constant and homoplasy-free. Let e_1 and e_2 be the two edges incident to the root, and suppose the input set of characters contains α_1 and α_2 homoplasy-free characters that change on e_1 and e_2, respectively, then these two characters will mark as red every edge below e_1 and e_2. In the unrooted topology for N, the root is suppressed and edges e_1 and e_2 are merged into the same single edge, e. Hence, when Root-Network is applied to the unrooted topology for N, if characters α_1 and α_2 are in the input, then the only edge that is not colored red will be the edge e containing the suppressed root. In conclusion, since the probability of homoplasy-free phonological characters is strictly positive, as the number of such characters increase, the probability that every edge other than the root edge will be red will converge to 1. Thus, Root-Network will uniquely leave the single edge containing the suppressed root green, establishing that it is statistically consistent for locating the root in the network.
http://arxiv.org/abs/2306.01884v1	20230602192915	Experimental analysis on image resolution of quantum imaging with undetected light through position correlations	[ "Marta Gilaberte Basset", "René Sondenheimer", "Jorge Fuenzalida", "Andres Vega", "Sebastian Töpfer", "Elkin A. Santos", "Sina Saravi", "Frank Setzpfandt", "Fabian Steinlechner", "Markus Gräfe" ]	quant-ph	[ "quant-ph", "physics.optics" ]	Experimental analysis on image resolution of quantum imaging with undetected light through position correlations Marta Gilaberte Basset^1,2,†,, René Sondenheimer^1,3,†,, Jorge Fuenzalida^4, Andres Vega^2, Sebastian Töpfer^4, Elkin A. Santos^2, Sina Saravi^2, Frank Setzpfandt^1,2, Fabian Steinlechner^1,2, and Markus Gräfe^1,2,4 ^1Fraunhofer Institute for Applied Optics and Precision Engineering IOF, Albert-Einstein-Str. 7, 07745, Jena, Germany. ^2Friedrich-Schiller-University Jena, Institute of Applied Physics, Abbe Center of Photonics, Albert-Einstein-Str. 6, 07745, Jena, Germany. ^3Friedrich-Schiller-University Jena, Institute of Condensed Matter Theory and Optics, Max-Wien-Platz 1, 07743 Jena, Germany. ^4Institute of Applied Physics, Technical University of Darmstadt, Schloßgartenstraße 7, 64289 Darmstadt, Germany ^†Both authors contributed equally. ^[email protected] ^**[email protected] July 31, 2023 ================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================= § ABSTRACT Image resolution of quantum imaging with undetected photons is governed by the spatial correlations existing between the photons of a photon pair that has been generated in a nonlinear process. These correlations allow for obtaining an image of an object with light that never interacted with that object. Depending on the imaging configuration, either position or momentum correlations are exploited. We hereby experimentally analyse how the crystal length and pump waist affect the image resolution when using position correlations of photons that have been generated via spontaneous parametric down conversion in a nonlinear interferometer. Our results support existing theoretical models for the dependency of the resolution on the crystal length. In addition, we probe the resolution of our quantum imaging scheme for varying pump waists over one order of magnitude. This analysis reveals the intricate dependency of the resolution on the strength of the correlations within the biphoton states for parameter combinations in which the crystal lengths are much larger than the involved photon wavelengths. We extend the existing models in this parameter regime to properly take nontrivial effects of finite pump waists into account and demonstrate that they match the experimental results. § INTRODUCTION In recent years, quantum imaging techniques have proven to be a very useful tool to overcome classical limitations <cit.>. For instance, when imaging at wavelengths outside the visible range, detection technologies are limited especially for low-light level applications, such as occurring in life sciences <cit.>. Quantum imaging with undetected light (QIUL) <cit.> is a technique that overcomes these detection limitations exploiting the capabilities of nonlinear interferometers <cit.>. It is based on the quantum interference effect of induced coherence <cit.>, and exploits the spatial correlations existing between two photons for example generated via spontaneous parametric down-conversion (SPDC), to create an image of an object with light that did not illuminate it. This nonlinear process can be engineered to generate one beam at the desired probe wavelength for the sample, and the other beam, containing correlated partner photons, at the visible range to ease the detection. Therefore, the interest in understanding quantum imaging systems has rapidly grown not only for imaging applications <cit.>, but also for holography <cit.>, spectroscopy <cit.>, and optical coherence tomography <cit.>. Image resolution is one of the main parameters that describes the quality of an imaging system, which for QIUL is governed by the spatial correlations of the photons. Several works have experimentally exploited the momentum anti-correlations of SPDC biphoton states, i.e. imaging at the far-field plane (Fourier plane) of the nonlinear crystal <cit.>. Alternatively, one can also obtain the image of an object that is placed at the near-field plane (image plane) of the nonlinear crystal. When this is the case, the imaging system exploits position correlations of the photons <cit.>. Recently, QIUL has been implemented with the near-field configuration for the first time and, thus, demonstrating its experimental viability <cit.>. Exploiting position correlations is of particular interest due to the fact that the degree of correlation between the two photons of an SPDC pair does not depend on the pump beam spatial coherence <cit.>. That relaxes the requirements on the pump source, providing more flexibility to engineer a quantum imaging system. The role of the parameters of the two-photon source on image resolution (pump waist, crystal length, and wavelengths of the down-converted photons) has been analysed for both cases momentum <cit.> and position <cit.> correlations. These works derived resolution limits for specific parameter regimes within different approximations that were specifically designed for the precise parameter regime under consideration. For instance, the crystal length can be neglected within a thin-crystal approximation <cit.> in the far-field configuration <cit.>. By contrast, the impact of a finite pump waist can usually be neglected for near-field configurations but the crystal length plays the dominant role for image resolution. In particular, it has been shown that shorter crystal lengths improve the resolution within the paraxial regime <cit.>. However, this improvement reaches a lower bound given by the diffraction limit. At this limit, the resolution is governed by the longer wavelength of the photon pair. For a detailed analysis providing a general model for such effects also beyond the commonly used paraxial regime, we refer to <cit.>. Additionally, sub-diffraction resolution imaging might be achieved by exploiting evanescent modes existing within wavelength-range distances <cit.>. While the theory predictions in the far field have been experimentally demonstrated <cit.>, this task remains missing in the near field. In this work, we experimentally study the resolution of QIUL for different parameter regimes based on position correlations for the first time. We demonstrate that in this configuration the main parameter governing the spatial resolution for sufficiently large crystals is the crystal length as in agreement with the theory <cit.>. Furthermore, we also vary the pump waist to show that it does not influence the resolution over a broad parameter range. In particular, if the wavelengths are in the visible or near infrared regime and the crystal length is of the order of millimeters, the resolution stays almost unaffected for pump waists ≳100. However, we observe slight deviations for strongly focused pump beams. To properly account for these effects, the existing theoretical model for the system needs to be extended. Although recently developed numerical techniques <cit.> could also account for such effects, we generalize the existing analytical model for resolution limits in the near field <cit.> to derive an analytical dependency of the image resolution on the pump waist as well as the crystal length. This investigation also allows us to directly connect the image resolution with the strength of the quantum correlations encoded in the biphoton states. Moreover, it reveals that different physical information is stored in the visibility and the image function that might be used to describe the imaging system. Resolution can be determined via characteristic spreads quantifying the blurring seen in an image of an object. Spreads extracted from both functions almost coincide for sufficiently large pump waists in the near-field configuration such that the resolution limit can be obtained either from amplitude images (image function) or from visibility images (visibility). However, they deviate for decreasing pump waists showing that the correlation information between the photons is only properly reflected in the visibility. We will show that these effects are corroborated in the obtained experimental results. As a side product, our analysis provides a new quantity to assess the quality of the imaging setup without needing any information about involved magnifications. In case the experimentally measured data stays sufficiently close to the corresponding theory predictions, we are able to introduce a tool to extract an estimator for the magnification value of the imaging configuration without the need to directly measure it. § EXPERIMENTAL SETUP The experimental setup (Fig. <ref>) consists of an SU(1,1) nonlinear interferometer where a 4f system of lenses ensures that the object lies in the image plane (near field) of the crystal. This plane is then imaged into the camera through a different 4f lens system. In this way, position correlations enable the formation of the image <cit.>. For more details on the systems of lenses and the imaging configuration used, see Fig. <ref> in App. <ref>. A pump beam of 96 mW pump power and pump wavelength λ_p = 405 is focused with lens L_p into a type-0 ppKTP crystal that generates a pair of correlated photons through SPDC at 730 and 910 wavelengths either during the forward propagation of a pump photon through the crystal (path A) or when it passes through the crystal in the backward direction (path D) after being reflected back by mirror M1. We refer to the light with wavelength = 910 as undetected (u) because it is never detected, although being the one illuminating the object. By contrast, the photons with wavelength = 730 are directed towards the camera but never interact with the object. Therefore we denote this beam as the detected beam (d). The camera used for detection is a Prime BSI Scientific CMOS from Teledyne Photometrics with a pixel size of 6.5. Because of the sufficiently low pump power, the down-conversion process occurs in the low gain regime and we can consider only one pair of down-converted photons (either forward or backward generated) to be present at a time in the interferometer. The probability amplitudes of the SPDC emission generated in the first and second passage through the nonlinear crystal are superposed and exhibit interference when indistinguishable. The required indistinguishability is achieved by careful alignment of the forward and backward beams which erases the which-path information. The interference pattern observed from the detected photons contains information of an object in the undetected beam path (C) due to the induced coherence without induced emission effect <cit.>. Using this quantum phenomenon, the image formation for QIUL works as follows. An undetected photon in path C (Fig. <ref>) with transverse wave vector and transverse position _u interacts with an object placed at the image plane of the nonlinear crystal at the transverse position = M__u where M_ is the total magnification obtained by photons of the undetected arm. This spatial information is linked to a photon with transverse position (_d) in the detected beam due to the correlations of the SPDC biphoton states originating from the common creation event of the photon pair. This photon is detected at the camera position = M__d with M_ denoting the total magnification for light in the detected path <cit.>. Therefore, a position on the object is directly related to a position on the camera . The optimal visibility of the interference generated in such a scheme is achieved by accurate alignment of the optical components for indistinguishability of the beams (and to fulfill the imaging conditions), as well as precisely matching the interferometric arms to the same optical length. Image resolution is affected by the precision of this alignment as well. The mirror M2 is mounted on top of a piezo stage to allow for the scanning of different interferometric phases, which allows us to apply the digital phase-shifting holography (DPSH) technique to extract images with amplitude and phase information of the object <cit.>. Amplitude images obtained from DPSH can be directly related to the value of the image function G() at each camera pixel. The image function has been introduced as the difference of the maximum (I_max) and minimum intensity (I_min) at each position in the camera plane <cit.>, G() = I_max() - I_min(). Visibility, given by V() = I_max() - I_min()/I_max() + I_min(), at each pixel is also extracted as an image, which we call visibility image. The latter can be used to analyse the system resolution and the strength of the position correlations. The lenses inside the interferometer (L1, L1_d and L1_u) introduce no magnification (M_u,i=M_d,i=1) when the system of lenses is perfectly positioned. M_u(d),i is the magnification of the lens system in the interferometer undetected (detected) beam path. The detected beam passes through a second magnification system on its way to the camera (M_d,c) consisting of lenses L2_c and L3_c introducing a magnification of 2.67. Magnifying the image allows us to have more precision in the measurements, due to the pixel size. The total magnification seen by the detected beam is then M_d = M_d,i M_d,c. In practice, ensuring these precise magnification value (M_ = 2.67) is a challenging task and often difficult to realize. In the following, we will elaborate on how we account for the impact of not ideally positioned lenses by extracting the relevant magnification value, here M_, for each tested configuration from a nonlinear fit of the intensity and visibility profiles generated by a sharp edge on the camera. This newly introduced routine allows for higher accuracy than our experimental evaluation of the magnification, see App <ref> for more details. The actual resolution of the implemented quantum imaging scheme with undetected photons depends on various quantities coming either from the quantum nature of the underlying SPDC process, i.e. the correlation strength of the biphoton state, or the classical imaging system in terms of image formation and magnification. In order to isolate the impact of the underlying quantum correlations depending on the crystal length L and pump waist , we need to know the precise total magnification from the lens system. This is important because the spreads measured in the camera plane explicitly depend on M_ in a multiplicative fashion as the detected photons creating the image precisely go through the corresponding lens system. Therefore, we can construct magnification-adjusted spreads Δ_ = Δ_,/M_ and Δ_ = Δ_,/M_ where Δ_, and Δ_, denote the spreads measured in the camera plane. The subscripts and refer to the fact whether the spreads where obtained from visibility or amplitude (image function) images, respectively. In order to extract information in the object plane, we multiply the magnification adjusted visibility spread by the magnification of the undetected arm, Δ_ = M_Δ_, i.e. the total magnification of the system, relating camera and object planes, is given by Δ_,/Δ_ = M_/M_. The magnification-adjusted spreads provide information about the imaging system that root purely in the quantum nature of the implemented scheme and factor out any impact induced by the classical part, e.g. optical aberrations, imaging system misalignments, or magnifications. This is equivalent to realize a system where the lens configuration does not imply any magnification at all. As the main focus of our work will be on the impact of the quantum correlations on the spatial resolution, we will focus on the magnification-adjusted spreads in the following. Due to a low manufacturing precision of our target object for the measurement of the magnification, the experimental results obtained suffered from big error bars (see App. <ref> for more details). In order to minimize the uncertainty coming from the magnification measurement, we propose a different strategy that allows us to construct an estimator for the magnification present in the system. First, we introduce a new parameter to quantify the quality of the experimental results without the need of knowing the system magnification. As the spreads, either obtained from image function or visibility, measured in the camera depend only linearly on M_, we study their ratio Δ_,/Δ_, = Δ_/Δ_ which is a magnification independent quantity by construction. Although this quantity cannot be related to the resolution of the system, we can use it to estimate the quality of the correlations and the overall alignment required to generate induced coherence. The advantage of this ratio is given by the fact that we are able to compare pure experimentally obtained data (left-hand side of Eq. (<ref>)) to values that can be predicted by theory (right-hand side of Eq. (<ref>)). In case the experimentally obtained ratio stays close to the theory prediction, we can use the following functional dependency as a fit for the experimentally obtained data for the image function (cf. Sec. <ref> for a derivation) G_(x_c) = exp{ -4π ( + )/^2 L + 2π^2 ( + )x_c^2/M_^2}× ×[ 1 - {√(2) [λ_λ_ L - 2π( + )]/√([λ_^2 L + 2π( + )]L)( + )x_c - M_x̃_/M_}] and visibility V_(x_c) = 1/2[ 1 - {√(2) [λ_λ_ L - 2π( + )]/√([λ_^2 L + 2π( + )]L)( + )x_c - M_x̃_/M_}] to estimate the magnification of the detected photon beam M_. The subscript denotes that we have evaluated the image function and visibility for a sharp edge model. Here, x_ denotes the horizontal coordinate in the camera plane and x̃_ accounts for a potential displacement of the object from the optimal position at the center of the undetected light beam. The impact of the parameter combination M_x̃_ on the resolution in the camera plane can also be analyzed by this fit routine, i.e. we are using a two parameter fit with fit parameters M_ and M_x̃_. Strictly speaking, both fits (image function and visibility) should give the same magnification value. However using the fits, we implicitly assume that the underlying theoretical model matches perfectly the experimental realization. Due to experimental uncertainties, e.g. in the alignment or the determination of the other parameters of the system, there can be an ambivalence in the extraction of the magnification parameter M_. This can potentially result in a deviation of M_ extracted from Eq. (<ref>) from M_ obtained from Eq. (<ref>). Nonetheless, as long as the magnification independent ratio Δ_,/Δ_, stays close to the theory prediction Δ_/Δ_ which implies that the theoretical model fits sufficiently good the experimental realization, the magnification extracted from both functions will be (almost) the same. Therefore, we use the average of these two values as an estimator of M_ if this is the case. Note that this careful comparison is necessary. Using only one fit as an estimator of M_ could lead to wrong magnification values as a change in M_ can be compensated in a change of other system parameters. Then, one would extract an incorrect magnification value designed in such a way that the resulting resolution imitates the theory prediction. § EXPERIMENTAL RESULTS In this section, we present the results on image resolution when exploiting position correlations in QIUL. To evaluate the effect of the crystal thickness on the resolution, the measurements were performed with three crystals of the same characteristics but different lengths L (2, 5, and 10). Additionally, for each crystal, the resolution of the system is evaluated for different pump waists (50, 142, 214, and 308). The resolution power of our system is obtained through the analysis of the edge response of the system to a sharp edge. The object is a blade of a knife edge placed at the image plane of the crystal (near-field configuration), right in front of the mirror on the signal arm (M2 in Fig. <ref>) such that it is imaged parallel to the vertical y_-axis in the camera plane (see Fig. <ref>). The edge response is evaluated from both, amplitude and visibility images at the camera plane. In order to do this, we first analyze the integrated intensities per pixel row to determine the y_ position with maximum intensity for each amplitude image. By doing this, we determine the optimal position where the detected beam has the strongest impact which minimizes errors induced by our theoretical approximations. Then, we fit the image and visibility functions evaluated for a sharp edge model, i.e. the corresponding edge spread functions (ESFs), to the experimentally obtained amplitude and visibility edge profile for the pixel row with maximum intensity, respectively. Many classical imaging schemes are linear and stationary/isoplanatic such that the impulse response function depends only on coordinate differences between the object and camera planes. In this case, the derivative of the ESF is equivalent to the line spread function (LSF) which, in turn, is directly related to the point spread function (PSF) when considering a Gaussian profile for the illumination <cit.> (see Fig. <ref>). Exploiting position correlations for QIUL, these relations are fulfilled for visibility within our approximation as well as for the image function (amplitude) to a good approximation if the pump waist is sufficiently large. However, we would like to emphasize at this point that for smaller pump waists, the derivative of the ESF will not coincide with the LSF for the image function as the system is no longer isoplanatic which can be directly inferred from the joint probability distribution of detected and undetected photons, see Sec. <ref>. We also observe that for sufficiently large pump waists (≳100 μm in our configuration) the analysis of amplitude images to extract the system resolution power gives similar results as visibility images, but they strongly differ for smaller pump waists. Only in the particular parameter regime where the conditions ^2 ≫^2 L/ + and ^2 ≫^2 L/ + are fulfilled, the image function might be used to determine the image resolution to a good approximation. We will elaborate on these points in detail in Sec. <ref>. The resolution of an imaging system can be heuristically defined in various ways. Here, we follow the practical convention that we analyze the spread of the PSF at the point where its intensity decays to 1/ in order to directly compare our results with previous works <cit.>. This definition can in most cases also be transferred to a 1/-width of the LSF or an 24/76-knife-edge width of the ESF being defined as the distance between the points of the measured curve that are 24% and 76% of the maximum value. While this analogy holds for visibility images, it is not the case for amplitude images (also see Sec. <ref> for a detailed discussion). From the measured Δ_, and Δ_,, the magnification independent parameter introduced in Eq. (<ref>) is calculated. We find that the percentage the experimental data deviates from the theory prediction is similar than the ratio between the extracted fit parameters M_ from Eq. (<ref>) or Eq. (<ref>). Therefore, we can use this ratio indeed as a classifier to determine the quality of the experimental implementation to match the underlying theory assumptions used to model the system as described at the end of Sec. <ref>. Figure <ref> compares the experimentally measured and theoretically predicted ratios. The fact that they are in good agreement allows us to extract an estimator for the magnification of the detected interferometer arm for each of these measurements. Therefore, we have access to the magnification-adjusted spreads encoding the influence of the quantum correlations on the resolution. The results from the evaluation of the magnification-adjusted spreads Δ_ and Δ_ as detailed in Sec. <ref> are given in Figures <ref> and <ref>, respectively. From the careful interpretation of these results, it is concluded that the physical meaning of what these two quantities encode is different. Visibility gives a measure on the indistinguishability of the beams and the correlation strength between the photons of an SPDC pair. These two quantities directly correlate to how good a point in the object is mapped onto the camera plane, i.e. they determine the image quality (resolution and contrast). This connection is also seen from the results in Fig. <ref>, which show that the resolution of the system improves for short crystals, and stays constant when varying the pump waist as predicted in the existing literature <cit.>, if the pump waist is sufficiently large. To be more precise, we are able to identify this regime in the region of parameter space where ^2 ≫^2 L/ + and ^2 ≫^2 L/ + hold. However, an interesting behaviour arises for smaller pump waists. While decreasing the pump waist, the position correlations between the photon pairs deteriorate (which directly worsens image resolution as well) until they might be non-existing anymore, i.e. the SPDC biphoton state becomes separable. At that particular point, the resolution (or the visibility image PSF spread) diverges since the photons reaching the camera plane carry no spatial information on the object anymore. In order to explain the behaviour observed for smaller pump waists (50), it is necessary to extend the current existing models. This can be done either by following the lines of Ref. <cit.> using numerical techniques or by extending the existing analytical model as we will do in Sec. <ref>. For amplitude images, the interpretation of results presented in Fig. <ref> has to be done more carefully. In Fig. <ref>, we depict the spreads obtained from amplitude images depending on the pump waist. For large pump waists, one obtains similar results for visibility and amplitude images when analyzing image resolution. However, for smaller pump waists, when the position correlations start to worsen (see corresponding points in Fig. <ref>), relating the amplitude image spread to resolution leads to misleading results. As the pump waist size approaches the value where the state becomes separable, the Gaussian contribution to the image function (see the exponential term in Eq. <ref>) induces the main x_ dependence compared to the contribution of the error function which approaches a constant value. At the point where the spatial correlations are lost, the image function carries no spatial information about the object. Therefore, the spreads obtained from amplitude images for small pump waists rather give a measure on the detected beam size than image resolution. § THEORY AND DISCUSSION For the specific parameter constellations realized in the experiments, we observe that for large pump waists the resolution limits stay almost constant with varying pump waist. These results verify the theoretical predictions done in the literature so far that were operating in a regime where the influence of finite pump waists can almost be ignored <cit.>. However, the experimental results also demonstrate that discrepancies can arise if sufficiently small pump waists are realized for fixed crystal lengths L and wavelengths and . Even more interestingly, we observe that spreads obtained from visibility images or amplitude images have a different dependency on . While both spreads approach the same limit for large pump waists, the definition of resolution in terms of the induced spreads via the imaging system becomes ambiguous for small pump waists as the image function spread Δ_ decreases while the visibility spread Δ_ increases. In order to address these subtle points, we are filling the gap of deriving an analytical model in the paraxial regime that takes the impact of the pump waist on the resolution limits into account. With that, we have a formalism for image formation with position correlations at our disposal such that we are able to analyze the resolution capabilities for a wide range of different source parameters based on the experimental setup sketched in Fig. <ref> as well as to identify the physical interpretation of Δ_ and Δ_. One of the main ingredients for QIUL are the spatial correlations encoded in biphoton wave functions. Such correlated photon pairs are usually generated via SPDC and are the result of photons being born at approximately the same position <cit.>. In first order perturbation theory and for collinear phase matching the photon pair state reads <cit.> \|ψ⟩ = 𝒩∫∫ P( + ) (L λ_p/8π( - )^2 ) \|⟩\|⟩ where 𝒩 is a normalization constant and () denotes the transverse wave vector of the detected (undetected) photon. Further, we have the wavelength of the pump photon λ_p, the detected photon , and the undetected photon , the crystal length L as well as the profile of a spatially coherent pump beam focused into the crystal. In our case, the latter is given by a Gaussian shape P( + ) = exp{ -w_p^2/4( + )^2 } with w_p being the pump waist. As we put the object at the image plane of the SPDC source, we exploit position correlations that are encoded in the joint probability density 𝒫(_d,_u). In order to analyze the properties of our QIUL setup, we use the image function G() as well as the visibility V(), see Eq. (<ref>) and Eq. (<ref>), respectively. Following Ref. <cit.>, the image function can be computed in our specific case via G() ∼∫ 𝒫(/M_,/M_) \|T()\|. Analogously, we have for the visibility V() ∼∫ 𝒫(/M_,/M_) \|T()\|/∫ 𝒫(/M_,/M_). The impact of an object is encoded in the transmission coefficient T(). Simple models for an object are given by a Dirac delta function, T∼δ(), modeling a point or a Heaviside function, T = Θ(x_), modeling the impact of an edge being orthogonal to the x_ direction in the object plane. We will denote the image function evaluated for the respective objects as G_ for a point and G_ for an edge. Similarly, we introduce the notation V_ (visibility PSF) and V_ (visibility ESF). Due to the intricate momentum dependency of the SPDC state (<ref>), it is a nontrivial task to find a closed form expression for the joint probability density 𝒫(_,_) and thus for the image function or visibility. To obtain a qualitative understanding, we approximate the by a Gaussian structure, (x^2) →^-x^2, following the standard strategy usually done in the literature <cit.>. For this particular approximation, one obtains 𝒫(_,_) = 8/π^2 L (+)exp{-2(_ + _)^2/^2(+)^2 - 4π (_ - _)^2/L(+)} for the joint probability density. So far, the resolution limit for the undetected photon scheme under investigation was analyzed in the limit where the first term in the exponential is merely slowly varying compared to the second term in the sum. Formally, this is equivalent with a plane-wave limit where →∞. This is motivated by the fact that typical parameters realized in an experiment allow to neglect the contributions from a finite pump waist. Indeed, our experimental data clearly show that this is a well justified approximation over a large parameter range of the pump waist for fixed , , L. Nonetheless, we also demonstrated that we are able to probe regimes where the pump waist influences the imaging system. Therefore, we extend the existing analyses by including the impact of finite pump waists. As a first example to describe the resolving power of the optical system sketched in Fig. <ref> in a qualitative fashion, we analyze the PSF for the Gaussian approximation of the function and obtain G_(ρ_) = exp{ -[ 2^2/^2( + )^2 + 4π/L ( + )] ρ_^2/M_^2}, as well as V_ (ρ_) = exp{ - 2[2π^2(+) - L ]^2/2π^4(+)^3 L + ^2 ^2 (+)^2 L^2ρ_^2/M_^2} for the image function PSF and visibility PSF, respectively. Here, we have used the fact that the PSFs obey a radial symmetry, thus, depending only on ρ_ = \|\|. Furthermore, we normalized the maximum to one. Usually, the quality of a QIUL system is quantified by the spreads of the image function or visibility. As aforementioned, we are using a 1/-width for the PSFs, G_(Δ__,) = 1/ and V_(Δ_,) = 1/. Note, that we have introduced a subscript for the spread of the image function to indicate that this is a spread obtained from a PSF but dropped it for the visibility spread. The reason for this will become clear once we discuss the spreads of the ESFs. Eventually, we obtain the magnification adjusted PSF spreads by dividing the PSF spreads at the camera by the magnification of the detected arm, Δ__ = Δ__,/M_ and Δ_ = Δ_,/M_, which read Δ__ = √(L( + )/4π) √(1/1 + ^2 L/2π^2 ( + )), Δ_ = √(L( + )/4π) 2π^2 ( + ) √(1 + ^2 L/2π^2 ( + ))/2π^2 ( + )- L. The first conclusion that we can draw from Eq. (<ref>) and (<ref>) is that the spreads obtained from the image function as well as from the visibility coincide in the →∞ limit. In particular, Δ__ coincides with the result in Ref. <cit.> in this limit where contributions of the pump waist on the resolution were neglected. For the image function spread, this is a good approximation as long as the inequality ^2 L/2π^2 ( + )≪ 1 is fulfilled. Interestingly, the two spreads either obtained from the image function or from visibility show different dependencies on . For instance, Δ_ is well approximated by the pump waist independent limit √(L( + )/4π) for ^2 L/2π^2 ( + )≪ 1 and L/2π^2 ( + )≪ 1. Apart from the limiting case, there are a couple of important differences stored in both quantities that become manifest for finite pump waists. In case the pump waist is decreasing (for fixed other parameters), the values for Δ_ increase until they reach a singularity at w_p,sing^2 = L/2π ( + ), cf. Fig. <ref>. By contrast, Δ__ is decreasing. Naively, one could conclude that the resolution improves with smaller pump waists by investigating the image function spread. However, the spread extracted from the visibility gets broader for smaller pump waists until it hits a singularity within our approximation. While this seems to be a contradiction at first sight, it is important to notice that both quantities store different information of the presented imaging scheme. The fact that Δ_ diverges is not surprising if we carefully study the properties of the SPDC biphoton state enabling imaging with undetected photons. If the condition = w_p,sing is fulfilled, the biphoton state becomes separable within the Gaussian approximation of the function. Even more important, all spatial correlations between the detected and undetected photons are lost. This becomes transparent if one studies the joint probability distribution given in Eq. (<ref>) which factorizes 𝒫(_,_) = 𝒫_(_) 𝒫_(_). As both photons of a pair are uncorrelated, the spatial information cannot be transmitted from the object to the camera. Therefore, the visibility becomes constant, cf. Eq. (<ref>) for = w_p,sing, and Δ_ diverges. Thus, Δ_ can be interpreted as a measure of the correlation strengths of the biphoton state. For large pump waists, there exist a high degree of spatial correlations. Lowering the pump waist, the correlations get worse until they vanish at the singularity. Technically speaking, the correlation strengths begin to increase again for < w_p,sing. However, we might also approach a regime there were our assumptions, e.g. paraxial approximation, break down. Furthermore, it is important to note that the singularity might be an artefact of the Gaussian approximation. By taking the actual phase matching condition into account, we assume that the singular structure might get softened, depending as to whether a parameter combination exists such that the actual SPDC state given in Eq. (<ref>) gets separable. The role of the image function spread Δ__ is different. The image function encodes intensities at each camera pixel position. Even though the biphoton state might become separable for a specific parameter constellation, there is always the detected beam impinging onto the camera. In our currently analyzed case, it will have a Gaussian shape with a spread determined by M_√(L/4π) within our approximations. However, this spread is not a valid measure to quantify the spatial resolution capabilities of the undetected photon scheme. The detected photons in this case do not contain any spatial information of the object at all as the image function does not properly reflect the correlation strengths in an adequate manner. Therefore for wide-field imaging, we are using the spreads extracted from visibility information to quantify resolution limits. The image function spread rather provides information about the detected beam size. Only in the limit →∞, image function and visibility store the same information as in this case the SPDC state becomes perfectly correlated. Eventually, the (visibility) spread observed in the detection plane divided by the total system magnification M_/M_ can be related to the minimum resolvable distance of an object via <cit.> d_min, obj_(NF)≈ 0.7√(2π)M_/M_Δ_, = 0.7 M_√(L( + )/2) 2π^2 ( + ) √(1 + ^2 L/2π^2 ( + ))/2π^2 ( + )- L. One can deduce from these analytical solutions that the dominating effects for the resolution are given by the crystal length L and the magnification of the undetected arm M_ for a wide range of pump waists. Although, the terminology of a magnification is used for the quantity M_, we would like to emphasize that it does not play the role of an usual magnification as in a classical imaging scheme. The system of lenses inducing M_ rather decreasing (M_ <1) or increasing (M_ >1) the illumination spot of the undetected photon beam but do not magnify any properties of the object. Therefore, the parameter M_ influences the actual resolution while the parameter M_ indeed plays the role of a magnification as it is magnifying the spatial information in the detected light beam transmitted via the correlations stored in the joint probability density from the undetected photons interacting with the object. In general, the resolution improves with shorter crystal lengths being consistent with the fact that this implies stronger position correlations as can be seen in Eq. (<ref>). However, this improvement of the resolution is limited by a threshold determined by the longer wave length of the SPDC generated photon pairs. This effect is not present in the current model as we perform momentum integrations over the entire momentum space of detected and undetected photons. In practice, the available propagating modes are constraint, thus, modifying the integration boundaries. As long as L≫+ these effects can be neglected but in case L ≈+, the localisation of the PSF for decreasing L saturates, resulting in a crystal-length independent spread for thin crystals with L < +. This effect was analyzed and corroborated by detailed numerical studies <cit.>. While we have theoretically analyzed the resolution properties based on position correlations for the simple case of a point as an object, we now extend the analysis to the situation of a sharp edge to be able to compare to the experimental results presented in Sec. <ref>. Therefore, we evaluate Eqs. (<ref>) and (<ref>) for T=Θ(x_-x̃_) leading to G_ and V_ given in Eqs. (<ref>) and (<ref>), respectively. On a qualitative level, we can draw the same conclusions from the ESFs as we did for the PSFs. For the visibility this extends even to a quantitative level. This can directly be inferred from the fact that in our case the derivative of the visibility ESF with respect to the position in the camera plane is mathematically equivalent to our result of the visibility PSF ∂_x_ V_ = V_. Therefore, we extract the same spreads according to our resolution criteria specified in Sec. <ref>. For the image function, the situation is slightly different as ∂_x_ G_≠ G_ due to the fact that the joint probability density is not only a function of the coordinate differences. Due to the nontrivial x_ dependency of G_ there is no closed form expression for the image function ESF spread Δ__. Nevertheless, we can extract this information numerically which is depicted as solid lines in Fig. <ref>. § CONCLUSION We have experimentally evaluated for the first time the effect of crystal length and pump waist on image resolution in a quantum imaging system exploiting position correlations of down-converted photons. The results obtained confirm the theory predictions published so far in the regime where nontrivial effects from the pump waist can be neglected. Nevertheless, the experimental results clearly demonstrated deviations from the existing analytical predictions for decreasing pump waists if the other parameters where kept fixed. We therefore derived an analytical model to predict the resolution values as well as the impact of the correlation strength over a larger parameter range. Moreover, we analyzed the physical meaning encoded in visibility and amplitude image information. We found that visibility is the property containing the resolution information while amplitude images give rather information on the detected beam size. For the regime of small pump waists, spatial resolution worsens as the correlations between the photons of the biphoton state deteriorate. That results in the fact that wide-field imaging being not a suitable approach in case the spatial correlations between the photons are lost. However, QIUL would still be possible in this regime by using a scanning approach. In this case, the image resolution would not depend on quantum properties but rather depend on the bit depth of the camera, the scanning step size, and the undetected beam size. To summarize, an improvement on image resolution can be mainly achieved by using shorter crystal lengths and by decreasing the magnification at the undetected path (M_) as previously stated <cit.>. At the same time, it is important to stress out that M_ does not act as a classical magnification since it does not influence the detected dimensions on the camera, but just modifies the spot size that probes the object. In addition, our results show that resolution gets worse as soon as the pump waist leaves the regime where ^2 ≫ L/+ and ^2 ≫^2 L/+ are fulfilled. Our work provides new insights into the intricate relations between all source parameters and properties, providing us with a new tool to optimize image resolution for different imaging applications. § ACKNOWLEDGEMENTS This work was supported as a Fraunhofer LIGHTHOUSE PROJECT (QUILT). Furthermore, funding from the German Federal Ministry of Education and Research (BMBF) within the funding program Quantentechnologien - von den Grundlagen zum Markt with contract number 13N16496 as well as the funding programme FKZ 13N14877 are acknowledged. We also acknowledge support from the Thuringian Ministry for Economy, Science, and Digital Society and the European Social Funds (2021 FGI 0043); European Union's Horizon 2020 research and innovation programme (Grant Agreement No. 899580 and No. 899824); and the Cluster of Excellence "Balance of the Microverse" (EXC 2051 project 390713860). § APPENDIX §.§ Imaging configuration Figure <ref> gives detailed information on the imaging configuration used during the measurements presented. §.§ Magnification measurement An in-house made object (Fig. <ref>) was used to perform the magnification measurements by calculating the ratio between the object and its image dimensions. Due to the field of view (FOV) at the object plane, only the "windows of the tower" acting as parallel slits with a fixed distance are considered as our object. The object dimensions were measured with a Zygo- New View 7300 optical profiler. The roughness of the frame between the windows is the main error source of the object dimension measurements, and therefore, it was also measured. The manufacturing precision of the object was analysed from a picture taken under a 20× magnification objective with an Olympus DP71 sensor which is coupled to an Olympus BX51TRF microscope with a U-TV0.63XC adapter. The unsharpness of one edge of the window frame is obtained by fitting an error function to its intensity profile (Fig. <ref>). From these measurements, we obtain that the distance between two window centers is 133± 23. To measure the distance between two windows on the image obtained with the QIUL system, the windows of the tower are treated as slits. For these measurements, the wavelength that illuminates the object is the same as the detected, and the possibility to create light from the second pass of the pump through the crystal is avoided by blocking that path. The intensity profile from each slit (window) was fitted with a Gaussian function, and the distance between slits (windows) is then the distance between the Gaussian peaks given in pixel units (Fig. <ref>). This distance is then converted to from the camera sCMOS camera pixel size of 6.5. By taking this measurement right after the resolution measurements for each crystal length and pump waist combination, and comparing it to the object real dimensions, we calculated the experimental magnification values for each configuration. § REFERENCES
http://arxiv.org/abs/2306.04075v1	20230607003256	Electron-hole dichotomy for thermoelectric transport in a two-valley system with strong intervalley scattering	[ "Masayuki Ochi" ]	cond-mat.mtrl-sci	[ "cond-mat.mtrl-sci" ]	Forefront Research Center, Osaka University, Machikaneyama-cho, Toyonaka, Osaka 560-0043, Japan Department of Physics, Osaka University, Machikaneyama-cho, Toyonaka, Osaka 560-0043, Japan The role of electron-phonon scattering in thermoelectric transport has been paid much attention, especially in multivalley systems. By investigating a two-valley model with electron-phonon coupling, we find three electron transport regimes realized by electron-hole asymmetry of electron relaxation time due to the strong intervalley scattering. Seebeck coefficient denotes an electron-hole dichotomy due to this asymmetry. Our finding sheds light on unexplored thermoelectric transport under the strong electron-phonon scattering. Electron-hole dichotomy for thermoelectric transport in a two-valley system with strong intervalley scattering Masayuki Ochi July 31, 2023 ============================================================================================================== Introduction.—Thermoelectric conversion, which enables waste heat recovery, is a key technology for resolving the energy crisis. Enhancing thermoelectric conversion efficiency is a crucial task in this field; accordingly, many studies have been conducted on this topic. To date, several types of desirable electronic band structures have been proposed, for example, band convergence <cit.>, low-dimensional band dispersion <cit.>, resonant states <cit.>, and pudding-mold-shaped band structures <cit.>. An important feature of these band structures is large density of states and/or large group velocity near the band edge. These factors are certainly favorable for efficient thermoelectric conversion when simplification of the scattering process and its strength, e.g., with the constant relaxation-time approximation, is validated. However, scattering can drastically change a situation. In fact, there are several strategies for enhancing thermoelectric conversion efficiency utilizing scattering, e.g., energy filtering <cit.>, modulation doping <cit.>, and ionization-impurity scattering <cit.>. Strong electron correlation effects can invoke non-trivial scattering effects, which cause anomalous temperature dependence of the Seebeck coefficient <cit.>, enhancement of the Seebeck effect by spin entropy <cit.>, spin fluctuation <cit.>, (para)magnon drag <cit.>, scattering by magnetic ions <cit.>, and band renormalization <cit.>. Recent theoretical developments allow the first-principles treatment of the electron-phonon coupling in transport calculations <cit.>. Using this technique, researchers can investigate, e.g., how intervalley and intravalley electron-phonon scattering differ and affect transport properties <cit.>. It was pointed out that band convergence occurring at distant k-points is beneficial while that for a single k-point is not <cit.>, contrarily to the previous understanding that band convergence is always beneficial assuming simplified scattering processes. The detrimental effect of band convergence was demonstrated in some materials, e.g., for GaN <cit.>. Valley engineering to avoid valley degeneracy via strain has also been proposed <cit.>. The mobility of electrons for characteristic electronic and phonon states in (quasi-)two-dimensional materials have been investigated <cit.>. Enriched knowledge of electron-phonon scattering also leads ones to a strategy for decreasing thermal conductivity via phonon softening that does not degrade electron mobility <cit.>. It is also interesting that the electron-phonon drag enhancement of transport properties has now been analyzed in a first-principles manner <cit.>. As a new aspect of electron-phonon scattering, Fedorova et al. pointed out that strong interband scattering can invoke an anomalous sign change in the Seebeck coefficient by blurring a portion of the electronic band structure <cit.>. This idea can be used to effectively hide the upper side of the Dirac cone overlapping with a heavy band, which increases the powerfactor owing to the sharp dispersion of the Dirac cone liberated from the bipolar effect <cit.>. However, currently, little is known about such an intriguing role of electron-phonon scattering owing to the theoretical complexities of addressing the very large degrees of freedom in electron-phonon-coupled systems. In particular, many energy scales appearing there makes it difficult to explore a wide parameter space to find unprecedented phenomena. In this Letter, we analyze a minimal model for a two-electron-valley system with intravalley and intervalley electron-phonon scattering; accordingly, find three electron transport regimes under strong intervalley scattering. As shown in the schematic represented in Fig. <ref>, the usual electron transport with a negative Seebeck coefficient S<0 is realized in regime 1, where the chemical potential μ is placed near the band edge and far from the other valley. In this regime, the Seebeck effect is dominated by carriers above the chemical potential (electron carriers) owing to their larger concentration and group velocity than those of the carriers below the chemical potential (hole carriers), which yields S<0. In regime 2, S>0 is realized by strong intervalley scattering significantly shortening the lifetime of electron carriers <cit.>, while hole carriers are energetically far from the other band edge so that they do not suffer from intervalley scattering. In addition, we find that reentrant to S<0 and enhancement of PF, called regime 3, is realized when μ is placed near the edge of the other electron valley at low temperature. The PF enhancement of this regime is caused by asymmetric coherence where only hole carriers suffer from intervalley scattering effects. Our finding shed light on an unexplored role of the electron-phonon coupling, and will trigger a search for high-performance thermoelectric materials from a new perspective. Methods.—We used a two-dimensional effective model of an electron-phonon coupled system expressed as follows: ℋ = ∑_k=(k_x,k_y)∑_σ∈{↑, ↓}∑_i=1^2 ϵ_ k iĉ^†_kσ iĉ_kσ i, +∑_q=(q_x,q_y)∑_ν=1^2 ω_ qν( b̂^†_qνb̂_qν + 1/2), +∑_k,q,σ, i_1, i_2, ν[ g_ q i_1 i_2 νĉ^†_ k+ qσ i_1ĉ_kσ i_2b̂_qν + h.c. ], where σ∈{↑, ↓} is the spin index, ĉ (ĉ^†) and b̂ (b̂^†) are the annihilation (creation) operators of an electron and a phonon, respectively, and their wave numbers satisfy -π≤ k_x, k_y, q_x, q_y ≤π. Hereafter, we used the dimensionless notation of model parameters to avoid complexity. The electron band dispersion was given as ϵ_ ki = -(cos k_x + cos k_y - 2) (i=1) -(cos (k_x+π) + cos (k_y+π) - 2) + Δ (i=2) where Δ is the energy offset between the two valleys. The phonon band dispersion was given as ω_ qν = v_0 √(q_x^2+q_y^2) (ν = 1) ω_0 (ν = 2) where v_0 and ω_0 are the acoustic phonon velocity and Einstein phonon frequency, respectively. A simple electron-phonon coupling was assumed as follows: g_ q i_1 i_2 ν = g_A√(\| q\|)δ_i_1 i_2δ_ν 1 + g_E (1-δ_i_1 i_2) δ_ν 2, where the coupling constants for intravalley scattering (i_1=i_2) by the acoustic phonon (ν=1) and intervalley scattering (i_1≠ i_2) by the Einstein phonon (ν=2) are g_A and g_E, respectively. This is a minimal model representing a two-electron-valley system with electron-phonon coupling. The √(\| q\|) dependence of the acoustic phonon expressed in Eq. (<ref>) was assumed by considering g∝ M_ q kω_ q, ν=1^-1/2∝ M_ q k \| q\|^-1/2 with the matrix element M_ q k for the potential variation δ V_ q associated with the phonon mode satisfying M_ q k = ⟨ k+ q\|δ V_ q\| k⟩∝ \| q\|, which holds, e.g., for the deformation potential approximation <cit.>. Note that it is often the case where electron-phonon coupling for the optical phonon becomes very strong around \| q\|=0. In our model, two electron valleys are placed at different k-points and the chemical potential is far from band crossing, that is, momentum transfer \| q\| for the intervalley scattering is sufficiently large so that we can neglect q-dependence of the electron-phonon coupling for ν=2. Transport calculations were performed based on the Boltzmann transport theory. The transport coefficient K_j (j=0, 1) is defined as follows: K_j = -2 ∑_ k,iτ_ k i v_x; k i^2 (ϵ_ k i- μ)^j ∂ f_ ki/∂ϵ, where μ is the chemical potential, f_ ki= (e^β (ϵ_ ki - μ) + 1)^-1 is the Fermi-Dirac distribution function for the inverse temperature β = T^-1, v_x; k i is the x-component of the group velocity v_ k i = ∂ϵ_ k i/∂ k, and factor of two on the right-hand side comes from spin degeneracy. Here, we used the momentum-relaxation time approximation, and then the electron relaxation time τ_ k,i was calculated using the following equation <cit.>, 1/τ_ k i = 2π∑_ q, i',ν( 1 - v_ k i· v_ k' i'/\| v_ k i \| \| v_ k' i' \|) \|g_ q i i' ν\|^2 ×[ W^(+)_ k q i i' ν + W^(-)_ k q i i' ν] with W^(±)_ k q i i' ν = δ(ϵ_ ki- ϵ_ k+ q i'±ω_ qν) f_ k+ q i' + n_ qν 1 - f_ k+ q i' + n_ qν, where n_ qν = (e^βω_ qν - 1)^-1 is the Bose-Einstein distribution function. The electrical conductivity σ, Seebeck coefficient S, and powerfactor PF were calculated as follows: σ = K_0, S = -1/TK_1/K_0, PF = σ S^2. The electron-phonon coupling affects the electron transport only through the electron relaxation time in this formulation. Renormalization effects through the real part of the electron self energy is an important future issue. We fixed g_A=1 and used g_E/g_A as a parameter representing the strength of the intervalley scattering. We used ω_0=0.2 so that the phonon energy is an order of magnitude smaller than the electronic bandwidth. The acoustic phonon velocity was set as v_0 = ω_0/π so that ω_ q 1∼ω_ q 2 holds near the Brillouin zone boundary. We used 500 × 500 and 1,000 × 1,000 k (q)-meshes for T≥ 0.25 and T<0.25, respectively, except τ-plots where a 2,400 × 2,400 k (q)-mesh was used. The delta function appearing in Eq. (<ref>) was approximated as a Gaussian distribution function with a broadening energy width of 0.001. The three electron transport regimes.—First, we present the calculated transport properties using g_E/g_A=2 and 20. Figure <ref>(a) presents the calculated PF with various Δ using T=0.04 and g_E/g_A=2, where the electron-phonon couplings for intervalley and intravalley scattering have a comparable strength. In this case, a high PF was obtained for Δ=0, i.e., when two valleys are degenerate. For Δ≠ 0, two PF peaks appear near the band edges of the two valleys, μ=0 and Δ. S<0 always holds. Note that we use a unit of μVK^-1 for S by multiplying k_B e^-1 = 86.17 μVK^-1 with a dimensionless equation, Eq. (<ref>), as is often done in model calculations <cit.>. These observations are consistent with many transport calculations using relaxation-time approximation. However, as shown in Fig. <ref>(b), where intervalley scattering is much stronger than intravalley scattering, g_E/g_A=20, the situation is quite different. First, the band degeneracy at Δ =0 yields the smallest PF peak, which sharply contrasts the case with g_E/g_A=2. This is because valley degeneracy significantly shortens the electron relaxation time via intervalley scattering. Band convergence, Δ = 0, is no longer a good strategy for enhancing PF under strong intervalley scattering (see, e.g., Ref. strain_valley for mobility degradation via band convergence). In addition, PF exhibits a remarkable three-peaked structure for large Δ, such as Δ = 0.6 in Fig. <ref>(b). These three PF peaks appear at approximately μ=0, Δ - ω_0 (=0.4 for Δ = 0.6), and Δ. Around the second peak, the Seebeck coefficient exhibits a characteristic sign change, as reported in Ref. ano_el_hole. Hereafter, we denote the transport regimes around these three μ values as regimes 1, 2, 3. Δ–μ plot.—Before interpreting the three-peaked PF structure shown in Fig. <ref>(b) with Δ=0.6, we shall answer a natural question that arises here: How robust is the three-peaked structure? In fact, this interesting PF structure strongly depends on temperature. Figure <ref> presents S and PF values calculated using g_E/g_A=20 and three temperatures: T=ω_0/7 (≃ 0.029), ω_0/5 (=0.04), and ω_0/3 (≃ 0.067). In these plots, we varied both the chemical potential μ and the electron-valley offset Δ. The PF peak in regime 1 around μ∼ 0 is relatively robust while the peak value itself can be small for a small Δ. On the other hand, the PF peak in regime 2 around μ∼Δ - ω_0 is conspicuous at high T but diminishes by lowering T. Note that regime 2 is identified by S>0 regions in Figs. <ref>(a)–(c). The PF peak in regime 3 around μ∼Δ shows an opposite trend: it does not appear at high T, e.g., in Fig. <ref>(f), but develops by lowering T, which finally offers higher PF values than PF peak values in regimes 1 and 2 at T=ω_0/7, as shown in Fig. <ref>(d). Relaxation time.—To understand the mechanism of how the three-peaked structure of PF occurs, we calculated the electron relaxation time τ_ ki as a function of the corresponding electron energy ϵ_ ki: τ(ϵ), as shown in Fig. <ref>. Here, we only show the electron relaxation time of the i=1 valley because the electrons in valley 2 contributes little to the transport coefficients K_j (j=1,2) for the chemical potentials used here. The calculation was performed using Δ=0.6, g_E/g_A=20, μ=Δ - ω_0 (=0.4) and Δ (=0.6), and T=ω_0/7 (≃ 0.029), ω_0/5 (=0.04), and ω_0/3 (≃ 0.067). At high temperatures, T/ω_0 ≫ 1, Eq. (<ref>) can be approximately simplified to W^(±)_ k q 12 2≃δ(ϵ_ k1- ϵ_ k+ q 2±ω_0) n_ q 2. Considering that the i=2 valley has the band edge at Δ, i.e., ϵ_ k+ q 2≥Δ, the electron relaxation time τ(ϵ_ k1) can be approximated as a μ-independent step function: long τ for ϵ_ k1 <Δ - ω_0 where W^(±)_ k q 12 2≃ 0, short τ for Δ - ω_0 < ϵ_ k1 <Δ + ω_0 where W^(-)_ k q 12 2≃ 0 but W^(+)_ k q 12 2 is activated, and much shorter τ for Δ + ω_0 < ϵ_ k1 where both W^(±)_ k q 12 2 are activated. In Figs. <ref>(c)(f), while T/ω_0 = 1/3 is not very large, τ(ϵ) plot resembles that step function. This is why a large S>0 was obtained in regime 2: τ of electron and hole carriers are sizably different in Fig. <ref>(c). This situation is illustrated schematically in Fig. <ref>(b): only the electron carriers suffer from the strong intervalley scattering <cit.>. This is also similar to the idea of the energy filtering using energy-dependent scattering time <cit.>, At low temperatures, a peak structure of τ(ϵ) gradually develops around the chemical potential ϵ=μ, as shown in Fig. <ref>. A long-lived (coherent) electron at \|ϵ - μ\| < ω where ω is the characteristic phonon energy, is a well-known consequence of the electron-phonon coupling at low temperatures. In fact, considering n_ qν∼ 0, Eq. (<ref>) becomes W^(+)_ k q 1i' ν≃δ(ϵ_ k1- ϵ_ k+ q i' + ω) f_ k+ q i' and W^(-)_ k q 1i' ν≃δ(ϵ_ k1- ϵ_ k+ q i' - ω) (1 - f_ k+ q i' ), both of which are small for \|ϵ_ k1 - μ\| < ω. For example, f_ k+ q i' in W^(+) becomes large for ϵ_ k+ q i'<μ and then the δ-function requires ϵ_ k1 = ϵ_ k+ q i' - ω < μ - ω. For the same reason, ϵ_ k1 > μ + ω is desirable for activating W^(-). Because the temperature broadening of the Fermi-Dirac distribution obscures this tendency, this structure is conspicuous at low temperature. Note that τ(ϵ) (ϵ∼μ) at the low-temperature limit has a peak structure due to acoustic-phonon (ν=1) intravalley scattering because acoustic phonons can have an energy smaller than ω_0. However, the peak structure of τ(ϵ) is remarkably asymmetric around ϵ=μ in Fig. <ref>(d) for the following reason. Hole carriers with Δ - ω_0 < ϵ_ k1<μ suffer from scattering by W^(+)_ k q 12 2≃δ(ϵ_ k1- ϵ_ k+ q 2 + ω_0) f_ k+ q 2 owing to the small but non-zero f_ k+ q 2 for unoccupied states with ϵ_ k+ q 2=ϵ_ k1+ω_0 > Δ. Electron carriers also suffer from this scattering but the effect is weaker because of the smaller f_ k+ q 2. On the other hand, W^(-)_ k q 12 2≃δ(ϵ_ k1- ϵ_ k+ q 2 - ω_0) (1 - f_ k+ q 2 ) is prohibited for both hole and electron carriers with ϵ_ k1<μ + ω_0, because the δ-function requires ϵ_ k1 = ϵ_ k+ q 2 + ω_0 ≥Δ + ω_0 = μ + ω_0. Therefore, electron carriers have a longer relaxation time than that for hole carriers, which yields a large \|S\| with a negative sign. This asymmetric coherence is the origin of the regime 3, as schematically shown in Fig. <ref>(c). Temperature dependence.—Finally, we point out that the three-peaked structure of PF exhibits a characteristic temperature dependence. Figure <ref> presents the temperature dependence of PF calculated using Δ=0.6 and g_E/g_A=20. For regime 2, PF at μ=Δ - ω_0 becomes zero at T∼ 0.02, under which the Seebeck coefficient becomes negative and regime 2 disappears. This is because the coherent peak of τ develops by lowering the temperature, which conceals the step-like structure of τ(ϵ) as seen in Figs. <ref>(a)–(c). For regime 3, PF at μ=Δ becomes zero at T∼ 0.06, above which the Seebeck coefficient becomes positive and regime 3 is absorbed in regime 2. As discussed in the previous paragraph, the origin of regime 3, namely, asymmetric coherence of the electron relaxation time, does not occur at high temperatures. It is also remarkable that PF peak in regime 3 is very large at T∼ 0.02. Summary.—We have found that electron transport has three regimes under strong intervalley electron-phonon coupling. In addition to the normal transport in regime 1, significant shortening of τ above Δ - ω_0 and asymmetric coherence by the absence of the scattering paths shown in Fig. <ref>(c) , invoke regimes 2 and 3, respectively. Our finding gives a clue to find unexplored thermoelectric transport with electron-phonon coupling. This study was supported by JSPS KAKENHI (Grant Number JP22K04908) and JST FOREST Program (Grant Number JPMJFR212P). 999 band_conv1 Y. Pei, X. Shi, A. LaLonde, H. Wang, L. Chen, and G. J. Snyder, Nature 473, 66 (2011). band_conv2 K. H. Lee, S.-I. Kim, H.-S. Kim, and S. W. Kim, Appl. Energy Mater. 3, 2214 (2020). low_dim1 L. D. Hicks and M. S. Dresselhaus, Phys. Rev. B 47, 12727 (1993). low_dim2 L. D. Hicks and M. S. Dresselhaus, Phys. Rev. B 47, 16631 (1993). low_dim3 H. Usui and K. Kuroki, J. Appl. Phys. 121, 165101 (2017). resonant J. P. Heremans, B. Wiendlocha, and A. M. Chamoire, Energy Environ. Sci. 5, 5510 (2012). pudding K. Kuroki and R. Arita, J. Phys. Soc. Jpn. 76, 083707 (2007). energy_filt1 J. P. Heremans, C. M. Thrush, and D. T. Morelli, J. Appl. Phys. 98, 063703 (2005). energy_filt2 G. Zeng, J. M. O. Zide, W. Kim, J. E. Bowers, A. C. Gossard, Z. Bian, Y. Zhang, A. Shakouri, S. L. Singer, and A. Majumdar, J. Appl. Phys. 101, 034502 (2007). energy_filt3 S. V. Faleev and F. Léonard, Phys. Rev. 77, 214304 (2008). modulation_dope1 M. Zebarjadi, G. Joshi, G. Zhu, B. Yu, A. Minnich, Y. Lan, X. Wang, M. Dresselhaus, Z. Ren, and G. Chen, Nano Lett. 11, 2225 (2011). modulation_dope2 B. Yu, M. Zebarjadi. H. Wang, K. Lukas, H. Wang, D. Wang, C. Opeil, M. Dresselhaus, G. Chan, and Z. Ren, Nano Lett. 12, 2077 (2012). ion_imp_sc1 S. Wang, J. Yang, L. Wu, P. Wei, W. Zhang, J. Yang, Adv. Funct. Mater. 25, 6660 (2015). ion_imp_sc2 L. Pan, S. Mitra, L.-D. Zhao, Y. Shen, Y. Wang, C. Felser, D. Berardan, Adv. Funct. Mater. 26, 5149 (2016). cuprate_expt S. D. Obertelli, J. R. Cooper, and J. L. Tallon, Phys. Rev. B 46, 14928(R) (1992). cuprate_vh1 D. M. Newns, C. C. Tsuei, R. P. Huebener, P. J. M. van Bentum, P. C. Pattnaik, and C. C. Chi, Phys. Rev. Lett. 73, 1695 (1994). cuprate_vh2 G. C. McIntosh and A. B. Kaiser, Phys. Rev. B 54, 12569 (1996). cuprate_3 G. Hildebrand, T. J. Hagenaars, W. Hanke, S. Grabowski, and J. Schmalian, Phys. Rev. B 56, R4317(R) (1997). cuprate_4 H. Kontani, J. Phys. Soc. Jpn. 70, 2840 (2001). Koshibae W. Koshibae and S. Maekawa, Phys. Rev. Lett. 87, 236603 (2001). spin_entropy1 G. D. Tang, X. N. Xu, C. P. Tang, Z. H. Wang, Y. He, L. Qiu, L. Y. Lv, L. Xing, and Y. W. Du, EPL 91, 17002 (2010). spin_entropy2 Y. Zhang, L. Xu, G.-Q. Liu, J. Cai, Y. Yin, F. Shi, X. Tan, and J. Jiang, Phys. Chem. Chem. Phys. 23, 17866 (2021). spin_fluc N. Tsuji, A. Nishide, J. Hayakawa, and T. Mori 5, eaat5935 (2019). magnon_drag1 M. V. Costache, G. Bridoux, I. Neumann, and S. O. Valenzuela , Nat. Mater. 11, 199 (2012). magnon_drag2 S. J. Watzman, R. A. Duine, Y. Tserkovnyak, S. R. Boona, H. Jin, A. Prakash, Y. Zheng, and J. P. Heremans, Phys. Rev. B, 94, 144407 (2016). paramagnon_drag Y. Zheng, T. Lu, Md. M. H. Polash, M. Rasoulianboroujeni, N. Liu, M. E. Manley, Y. Deng, P. J. Sun, X. L. Chen, R. P. Hermann, D. Vashaee, J. P. Heremans, and H. Zhao, Sci. Adv. 5, eaat9461 (2019). mag_scat J.-B. Vaney, S. A. Yamini, H. Takaki, K. Kobayashi, N. Kobayashi, and T. Mori, Mater. Today Phys. 9, 100090 (2019). FeSb2 A. Chikina, J.-Z. Ma, W. H. Brito, S. Choi, P. Sémon, A. Kutepov, Q. Du, J. Jandke, H. Liu, N. C. Plumb, M. Shi, C. Petrovic, M. Radovic, and G. Kotliar, Phys. Rev. Res. 2, 023190 (2020). EPW1 F. Giustino, M. L. Cohen, and S. G. Louie, Phys. Rev. B 76, 165108 (2007). EPW2 S. Poncé, E. R. Margine, C. Verdi, and F. Giustino, Comput. Phys. Comm. 209, 116 (2016). EPW3 S. Poncé, E. R. Margine, and F. Giustino, Phys. Rev. B 97, 121201(R) (2018). perturbo J.-J. Zhou, J. Park, I-T. Lu, I. Maliyov, X. Tong, and M. Bernardi, Comput. Phys. Commun. 264, 107970 (2021). elphbolt N. H. Protik, C. Li, M. Pruneda, D. Broido, and P. Ordejón, npj Comput. Mater. 8, 28 (2022). interval Y. Wu, B. Hou, C. Ma, J. Cao, Y. Chen, Z. Lu, H. Mei, H. Shao, Y. Xu, H. Zhu, Z. Fang, R. Zhang, and H. Zhang, Mater. Horiz. 8, 1253 (2021). Mori_ZrX2 H. Mori, M. Ochi, and K. Kuroki, Phys. Rev. B 104, 235144 (2021). inter_intra_PbXHH V. Askarpour and J. Maassen, Phys. Rev. B 107, 045203 (2023). inter_intra_elemental_monolayer Y. Wu, B. Hou, Y. Chen, J. Cao, H. Shao, Y. Zhang, C. Ma, H. Zhu, R. Zhang, and H. Zhang, npj Comput. Mater. 7, 145 (2021). when_band_conv J. Park, M. Dylla, Y. Xia, M. Wood, G. J. Snyder, and A. Jain, Nat. Commun. 12, 3425 (2021). GaN_crystal_field S. Poncé, D. Jena, and F. Giustino, Phys. Rev. B 100, 085204 (2019). GaN_crystal_field2 S. Poncé, D. Jena, and F. Giustino, Phys. Rev. Lett. 123, 096602 (2019). strain_valley T. Sohier, M. Gibertini, D. Campi, G. Pizzi, and N. Marzari, Nano Lett. 19, 3723 (2019). sym_q2d S. Zheng, S. Xiao, K. Peng, Y. Pan, X. Yang, X. Lu, G. Han, B. Zhang, Z. Zhou, G. Wang, and X. Zhou, Adv. Mater. 35, 2210380 (2023). flexural_phonon C. Zhang, L. Cheng, and Y. Liu, J. Phys.: Condens. Matter 33, 234003 (2021). Sb_high_mobility L. Cheng, C. Zhang, and Y. Liu, J. Am. Chem. Soc. 141, 16296 (2019). why_2d_low_mobility L. Cheng, C. Zhang, and Y. Liu, Phys. Rev. Lett. 125, 177701 (2020). soft_PbTe J. Cao, Đ. Dangić, J. D. Querales-Flores, S. Fahy, and I. Savić, Phys. Rev. B 104, 045202 (2021). electron_phonon_drag N. H. Protik and B. Kozinsky, Phys. Rev. B 102, 245202 (2020). ano_el_hole N. S. Fedorova, A. Cepellotti, and B. Kozinsky, Adv. Funct. Mater. 32, 2111354 (2022). dirac_filter Y. Xia, J. Park, V. Ozoliņš, and C. Wolverton, Phys. Rev. B 100, 201401(R) (2019). tau_eq1 B. Liao, J. Zhou, B. Qiu, M. S. Dresselhaus, and G. Chen, Phys. Rev. B 91, 235419 (2015). tau_eq2 W. Li, Phys. Rev. B 92, 075405 (2015). Mahan G. D. Mahan, Many-Particle Physics, 3rd ed. (Springer, Berlin, 2010). note_seebeck The Seebeck coefficient is represented as S=- (e T)^-1 K_1 K_0^-1 by explicitly showing physical constants. Because (k_B T)^-1 K_1 K_0^-1 is a dimensionless quantity, one can always denote a unit of the Seebeck coefficient by rewriting S as product of k_B e^-1 and a dimensionless (k_B T)^-1 K_1 K_0^-1.
http://arxiv.org/abs/2306.02891v1	20230605140021	Super- and subradiance in dilute disordered cold atomic samples: observations and interpretations	[ "William Guerin" ]	physics.atom-ph	[ "physics.atom-ph", "physics.optics", "quant-ph" ]
http://arxiv.org/abs/2306.04582v1	20230607163415	Balancing the Benefits of Vaccination: an Envy-Free Strategy	[ "Pedro Ribeiro de Almeida", "Vitor Hirata Sanches", "Carla Goldman" ]	q-bio.QM	[ "q-bio.QM", "physics.soc-ph" ]	Balancing the Benefits of Vaccination: an Envy-Free Strategy. Pedro Ribeiro de Almeida, Vitor Hirata Sanches, Carla Goldman Instituto de Física - Universidade de São Paulo, CEP 05508-090, São Paulo-SP, Brasil. June 2023 ========================================================================================================================================================== The Covid-19 pandemic revealed the difficulties of vaccinating a population under the circumstances marked by urgency and limited availability of doses while balancing benefits associated with distinct guidelines satisfying specific ethical criteria (J.W.Wu, S.D. John, E.Y. Adashi, Allocating Vaccines in the Pandemic: The Ethical Dimension, The Am. J. of Medicine V.33(11): 1241 - 1242 (2020)). We offer a vaccination strategy that may be useful in this regard. It relies on the mathematical concept of envy-freeness. We consider finding balance by allocating the resource among individuals that seem to be heterogeneous concerning the direct and indirect benefits of vaccination, depending on age. The proposed strategy adapts a constructive approach in the literature based on Sperner s Lemma to point out an approximate division of doses guaranteeing that both benefits are optimized each time a batch becomes available. Applications using data about population age distributions from diverse countries suggest that, among other features, this strategy maintains the desired balance throughout the entire vaccination period. Keywords: pandemic preparedness, balanced vaccine allocation, decision making process, envy-free division, direct and indirect benefits, Sperner s Lemma, cake-cutting. § SIGNIFICANCE STATEMENT Direct and indirect benefits of vaccination are related to decreasing the severity of the individual s symptoms and to decreasing the spreading of the disease due to collective effects. The share with which a single dose contributes to each type of benefit may depend, among other conditions, on the age of the individual that receives it. This imposes difficulties in optimizing allocation guidelines that aim to support individual needs while controlling transmissibility. We offer a strategy of vaccination that may balance these two aspects based on the mathematical concept of envy-freeness. The present study revealed the efficiency of such a strategy and its tendency to equalize the benefits of vaccination locally, within a country, and among countries presenting the most diverse age distribution profiles. § INTRODUCTION The unprecedented situation in which a vaccine was successfully developed amid the disease pandemic, the case of Covid-19, brought about urgent questions related to the possible strategies for allocation of the doses made available gradually in very small batches that do not cover the entire population in a community all at once <cit.>, <cit.>. Given the high transmissibility of the virus and widespread infection, the problems associated with vaccine allocation highlighted the urgent need to elaborate and put in practice certain guidelines that best satisfy a given set of ethical requirements <cit.>,<cit.>. In many countries, the prioritization followed protocols suggested by the WHO <cit.> to allocate the first doses that became available to the oldest and to those with comorbidities since these individuals are the most likely to develop severe forms of the disease <cit.>, <cit.>. Other groups at maximum risk such as health care workers and, in some places, members of disadvantaged groups deprived of minimal protection against direct exposure to the virus, the homeless for instance, in addition to members of indigenous populations and isolated small communities, among others, have also been eligible for doses of the vaccine from the first batches <cit.>. It is worth noticing that, after the most elderly and other most-at-risk groups receive their doses, virtually the entire population remains unvaccinated while new doses continue to be available in very limited numbers. In the remaining susceptible individuals, comprising the large majority of the population, the ability to transmit the disease and the severity of the symptoms are widely dispersed, and these generally correlate with age. We restrict the contribution offered here to this scenario. The elderly within this remaining population would still be mostly benefited directly from receiving the doses because they tend to develop the most severe forms of the disease compared to the younger that are likely to present with only mild symptoms, although this is not a rule <cit.> . On the other hand, due to their mobility and intense daily activity, younger people have a major capacity to transmit the virus compared to that of the elderly <cit.>. Therefore, vaccinating younger people would greatly benefit the entire population, as an indirect effect. Direct and indirect effects of vaccination, regarding mainly the interplay between decreasing disease severity and its transmissibility, raise questions about the possibility of balancing these two factors that seem to compete with each other in making decisions about allocating vaccine doses <cit.>. We believe that any solution to this problem should comprise the following points: 1) a measure to evaluate proximity to a balanced condition that enables comparing results among different strategies of vaccination, and 2) a methodology to implement dose allocation that maintains such balance on time until vaccine coverage of the entire population is achieved. We argue that this can be approached following an envy-free type of strategy for a fair division of doses among individuals possessing different utilities. The concept of envy-freeness is often illustrated in the literature by the classical cake-cutting problem <cit.>, <cit.>. This refers to a partition among agents of a certain resource (the cake), generally heterogeneous, such that each one of the agents evaluates their parts as being the best among the parts chosen by the others. The heterogeneity of the resource is usually expressed through a utility function that assigns to the different parts of the cake, different values satisfying additivity. In general, each agent has its own utility function. Here, we use the notion of utility to quantify both the direct and indirect benefits of vaccinating the diverse age groups of the population. We then formulate such a strategy to address the case of vaccine dose allocation by the agents to the individuals adapting the constructive approach presented in <cit.> and reviewed in <cit.> which is based on Sperners Lemma. For this, we assume that the vaccine is a desirable good and also that individuals and vaccine doses can be conceived as divisible quantities being represented by densities, defined appropriately. Accordingly, each age group receives a score named utility in agreement with the various views and plans of certain consultants or counselors expressing their priority criteria in line with the current public policies in the considered community. We examine the case at issue regarding transmissibility and severity of the disease as a prototype to explain our ideas, although the model is not restricted to it. In keeping with this, it will be sufficient to consider the expertise of only two counselors, each one in charge of scoring all individuals according to their ages. One of the counselors referred to as C_A (Ana), is an expert in predicting the ways of spreading the disease. The other counselor, C_B (Bob), is an expert in disease symptomatology. Specifically, C_A represents the allocation guideline that accounts for the benefit of vaccinating to control transmission - the indirect effect of vaccination. C_B represents another allocation guideline that accounts for the benefit at the individual level - the direct effect of decreasing the severity of the symptoms. Both C_A and C_B are interested in balancing the two aspects; none of them wants to dispute vaccine doses. Therefore, whenever a new batch becomes available to this community, the doses will be allocated in such a way that each counselor agrees on the distinct groups of individuals to be vaccinated to optimize separately the benefit envisaged by each one. We claim that this characterizes an envy-free division of the vaccine doses. The way that this may be accomplished is our main proposal and will be developed in the following Sections. We emphasize that unlike utilitarian models <cit.>, <cit.> , our strategy is not based on a single score system for which the priorities for doses allocation are evaluated in terms of the total score received by each individual from the different counselors. Rather, we conceive the model in such a way that each counselor optimizes the benefit according to their particular view. Our approach differs also from the reserve system strategies <cit.> for which the total vaccine supply from each batch is distributed according to pre-assigned proportions to certain reserved categories. In our model, the proportions of doses attributed to the management of each counselor are dynamic quantities, resolved along the process. Our proposal is presented in Section <ref>. Illustrative examples are considered in Section <ref>. We compare the results from the application of the envy-free strategy using data comprised of certain population age distributions, with those predicted by the other two strategies examined, referred to as oldest-first, and maximize-benefit, as detailed below. We have also considered a strategy named minimize-benefit to set a scale to measure the efficiency with which the benefits are acquired by each strategy. These comparative results indicate that the envy-free leads to a considerable improvement in keeping the benefits related to C_A and C_Bclose together over time conferring support to this strategy as a way to pursue the desired balance. A discussion of these results and considerations about the extent of the applicability of the model are presented in Section <ref>. In the Supplementary Material we outline the numerical procedure used to implement the model dynamically. § MODEL Our formulation is decomposed into two parts. The first part consists of preliminary definitions to build up the relevant simplex as a basis for the choice of individuals to be vaccinated at each time. It is assembled using accessible data about population age distribution, taken in connection with the utility attributed to all groups of individuals by each counselor. The second part consists in building up the dynamics that drives this choice to achieve the required balance between the two guidelines. §.§ The simplex The age group distribution in a community with N susceptible individuals will be considered for the account of two counselors C_A and C_B, each one of them endowed with a utility function ρ _η(I), η =A,B hypothesized in such a way to attribute a score to each individual according to the corresponding age-related priority criteria. This can be performed by ordering these N individuals in such a way that their age I(x) is a monotonic increasing surjective function of their positions x∈ℤ∩ 0,N]. In order to build up the 1-simplex of interest over which we perform our considerations about the choices of the counselors, we map the interval [0,N] into the interval [0,1] and variable x into a real variable y=x/N such that y∈ 0,1]. The age at position y within this map shall now be calculated as I(yN). We may assume that all individuals within the same age group are equally valued by each counselor though most likely, the value varies between counselors. It will be convenient though, to deal with continuous utility functions ρ _η(I(yN))≡ρ _η(y) represented by a combination of smoothed step functions for each counselor η =A,B, as detailed in Section <ref>. The utility densities u_η(y) defined for all y∈ 0,1] as u_η(y)=ρ _η(y)/∫_0^1ρ _η(y))dy are the functions that allow for considerations about envy-free divisions based on Sperners Lemma, as will be explained next. Observe also that any region ω of the considered simplex may be decomposed into a number M of disjoint sub-regions {v_j}, j=1,2,...M. Each v_j, extended between endpoints y_jI (initial) and y_jF (final) with y_jI<y_jF, comprises a number [ ( y_jF-y_jI) N] of individuals, where the notation [ z] indicates the integer part of the real number z. §.§ The dynamic Consider a population that at a certain instant of time t comprises N(t) susceptible individuals to whom a batch of V<N vaccine doses shall be allocated. We suppose that the availability of the batches occurs at a certain frequency of 1/T until the entire population is vaccinated. We also assume that individuals achieve full protection after receiving a single dose. The time t shall then be better measured in terms of the interval T between batches as t=nT, for n∈ℤ_+. The question posed here regards the choice of the V individuals to receive the doses at each time t in order to balance the current guidelines. We think of two different priority criteria suggested by two counselors C_A and C_B expressing different opinions about how one should rank the population in the community to guide this choice. The utility density functions u_A(y) and u_B(y), y∈ 0,1] conceived, respectively, by C_A and C_B assume nonnegative real values and represent a measure of the relevance for vaccinating the individuals ordered according to some rule. To present the methodology, we choose to order the individuals by their age, although this does not exclude any other possibility. Such an ordered list of individuals mapped into the interval [0,1] defines the 1- simplex as detailed above. We aim to present a fair division strategy of an envy-free class through which the choice of the V individuals at each time balances the perspectives of the two counselors in the best possible way. The proposal offers an approximate solution extending the constructive approach <cit.> based on Sperners Lemma as presented in <cit.> and reviewed in <cit.>. From the utility density functions u_η(y), η∈{A,B} we define the benefit 𝒰_η^ω (t) according to the referred counselor perspective, that results from vaccinating the individuals inside a region ω (t) of the simplex at time t: 𝒰_η^ω (t)≡∫_ω (t)u_η(y)dy The total benefit that is reached after vaccinating the entire population of susceptible amounts to one, according to both counselors: 𝒰_η=∫_0^1u_η(y)dy=1. We proceed by partitioning the 1-simplex, at a time t, into a number d of identical parts, each of which comprised between a pair of neighbor points (p_i,p_i+1) at the positions (y_p_i,y_p_i+1), respectively, with y_p_j=j/d, for j={0,1,2,...d}. We then assign to the endpoint p_0at y_p_0 =0 a label arbitrarily chosen between A and B so called in reference to the counselors, and then proceed by labeling each of the following points p_iof the sequence as A or B, alternately. Observe that each point p_i at y_p_isplits the ordered population into two parts, part I on the left of p_i and part II on the right of p_i, comprising respectively N_I^i and N_II^i individuals at time t, such that N_I^i =[ y_p_iN] N_II^i =[ (1-y_p_i)N] At each of these points p_i we also consider splitting the batch of vaccines available at a certain time into two parts, V_I^i and V_II^i . We choose V_I^i and V_II^i proportional to N_I^i and N_II^i, respectively: [ V_I^i=[ y_p_iV]; V_II^i=[ (1-y_p_i)V] ] To the extent that the simplex is arranged in this way, both quantities, i.e. individuals and vaccine doses, are evaluated using the single continuous variable y. This allows each counselor to express, at the corresponding labeled points p_i, what would be their preferential side to proceed with vaccination. We assume that V_I^i and V_II^iare intended necessarily to vaccinate individuals, respectively, on sides I and II defined for each i. Explicitly, to maximize benefit at each A -labeled point p_i, counselor C_A is asked to express her preference, based on u_A, about vaccinating V_I^i individuals on the side I or V_II^i individuals on the side II. The same for counselor C_B at each B-labeled point p_i,based on u_B. One should notice that it is implicit in this procedure, regardless of the counselors choices, that neither of them would be able to vaccinate the entire population at once with the corresponding amount V_I^i or V_II^i of doses available on each side. Moreover, at an A- labeled pointp_i where counselor C_A is in charge of choosing the side and decides for say, side II, she is supposed to make use of all of the V_II^i doses pre-assigned to that side. This implies that counselor C_B would necessarily vaccinate individuals on the other side using all of the V_I^i doses, even though it may not be his preferentials. Despite this, C_B would look for individuals amounting to V_I^i that are best to be vaccinated on the side Iaccording to his utility density function. The same will be followed by counselor C_A after C_B has expressed his preferential choices at each B-labeled point p_i. Accordingly, the counselor in charge at each point p_i, regardless of being labeled A or B, ends up vaccinating exclusively at one of the sides. Nonetheless, they would benefit from vaccination on both sides. Since both utility density functions assume nonzero values along the entire simplex, each counselor must account for a benefit coupled with the others choice. In the example above we understand that, at that particular point p_i, counselor C_A has chosen side II and the best sub-region to vaccinate the V_II^i individuals at that side. This choice is foreseen after evaluating the total benefit from u_A composed of: (i) the amount obtained from u_A at a sub-region of II comprising V_II^i individuals that have been chosen according to her utility function u_A, and (ii) the coupled benefit that corresponds to the amount obtained from u_A at a sub-region of I comprising V_I^i individuals that have been chosen by suggestion of C_B, based on his utility density u_B. She concluded that the sum of (i) and (ii) is greater than the amount she would have obtained if she has chosen to vaccinate on the side I and received the coupled benefit from side II. For this, one must assume that both counselors know each others utility density functions. To extend (i) and (ii) to arbitrary choices, it will be useful to define for Γ∈{I,II} and η∈{A,B}, the interval Ω _η^Γ(p_i,t), as the sub-region on the side Γ of the simplex with respect to point p_i where counselor η evaluates the maximum benefit from u_η at time t. According to this, counselor C_A looks for the largest between the total benefit U_A^I(p_i) and U_A^II(p_i) that, recalling ( <ref>), are defined as: [ U_A^I(p_i,t)≡𝒰_A^Ω _A^I+𝒰 _A^Ω _B^II ] and [ U_A^II(p_i,t)≡𝒰_A^Ω _A^II+𝒰 _A^Ω _B^I ] If U_A^I(p_i,t)⩾ U_A^II(p_i,t) she decides for side I , otherwise she decides for side II. Likewise, to decide which side to vaccinate at each B-labeled pointp_i, according to his utility function, counselor C_B looks for the largest between the total benefit U_B^I(p_i,t) and U_B^II(p_i,t), defined as: [ U_B^I(p_i,t)≡𝒰_B^Ω _B^I+𝒰 _B^Ω _A^II ] and [ U_B^II(p_i,t)≡𝒰_B^Ω _B^II+𝒰 _B^Ω _A^I ] If U_B^II(p_i,t)⩾ U_B^I(p_i,t) he decides for the side II, otherwise he decides for the side I. The example discussed above corresponds to the case for which the pre-evaluation of the benefit by C_A, at the considered point p_i, resulted in U_A^II(p_i,t)>U_A^I(p_i,t). We finally observe that even though side I has no individuals to be vaccinated at the end-point p_0 at y_p_0=0, the counselor in charge there might have two options: either to let the other vaccinate on side II using the entire amount V of doses, or to vaccinate the V individuals on side II. For example, if the point p_0 is A-labeled then counselor C_A will still be in charge to decide about her preferential side based on the largest between U_A^I(p_0,t) =𝒰_A^Ω _B^II(p_0,t) and U_A^II(p_0,t) =𝒰_A^Ω _A^II(p_0,t) On the contrary, if the end-point p_0 is B-labeled then counselor C_B would select the side based on the largest between U_B^I(p_0,t) =𝒰_B^Ω _A^II(p_0,t) and U_B^II(p_0,t) =𝒰_B^Ω _B^II(p_0,t) Since at p_0 the values reached by u_A at Ω _A^II(p_0,t) are higher than or at least equal to the values reached by u_A at Ω _B^II(p_0,t) then U_A^II≧ U_A^I. Similarly, since the values reached by u_B at Ω _B^II(p_0,t) are higher than or at least equal to the values reached by u_B at Ω _A^II(p_0,t) then U_B^II≧ U_B^I. Therefore, the counselor in charge at p_0 will oneself prefer to indicate the individuals to be vaccinated, and this would happen on side II, instead of leaving vaccination up to the other counselor. Using similar arguments, one finds that for p_1 at y_p_1=1 either one of the counselors would choose side I. Therefore, whoever counselor at p_0, would choose the right side whereas whoever counselor at p_1,would choose the left side. These conclusions assure that the conditions under which Sperner's Lemma holds are fully satisfied by the simplex defined above. Finally, after the two counselors have expressed their preferential sides at each of the corresponding points p_i and the simplex looks like that sketched in Figure 1 it allows one, through simple visual inspection, to list all pairs of consecutive points, referred here generically as (p_L,p_R), such that the counselor at the point on the left p_L has expressed a preference to vaccinate on one of the sides say on side II, while the counselor at the point on the right p_R has expressed a preference to vaccinate on the opposite side, i.e. side I. The existence of at least one such pair of points is ensured by Sperner's Lemma. Accordingly, for sufficient large partition d, an internal point p^∗ of the interval defined by any of these pairs will approximate a position at which the preferred sides of the two counselors are opposite to one another. The choice of any of those points p^∗ (if more than one) identifying opposite preferred sides for each counselor to allocate the available vaccine doses, characterizes an approximate envy-free division for which either U_A^I(p^∗)⩾ U_A^II(p^∗) and U_B^II(p^∗)⩾ U_B^I(p^∗) or U_A^I(p^∗)⩽ U_A^II(p^∗) and U_B^II(p^∗)⩽ U_B^I(p^∗) In order to carry on this strategy until all susceptible individuals in the population have the opportunity to get their doses, it is assumed that the procedure described above is repeated at each time t when a new batch containing V doses becomes available. For simplicity, we consider the unrealistic case for which V does not change along the entire process. On each of these occasions, the simplex must be re-scaled and the utility densities attributed accordingly to the set of individuals mapped again into the interval [0,1], after excluding those already vaccinated with the doses from the previous batch. We present a numerical study using this procedure for analyzing the time evolution of the benefit in selected population age distributions. The utility functions are written using an arbitrary scale to mimic counselors` general guidance. The results are compared with those produced by strategies specified in the following as maximize-benefit, oldest-first in addition to a minimize-benefit strategy introduced to set a scale for efficiency. The maximize-benefit strategy looks for distributing the doses to the groups of individuals for which the sum of the two utilities is maximized. The minimize-benefit strategy does the opposite. Under the oldest-first strategy, the doses available are fully distributed to the oldest individuals present at the time, approaching the current procedure adopted by many public health systems. Our findings are shown in the next Section. § RESULTS The time evolution of benefits acquired by applying each of the three strategies mentioned above is studied through numerical simulations. The methodology outlined (Supplementary Material) has been developed specifically to accomplish this. We use data for population age distribution of the countries indicated in <cit.>. For comparing the outcomes from the diverse strategies, the population of each country is divided into four age groups I_k, k=1,2,3,4, comprising, respectively, individuals from 0 to 14 years old (I_1), from 15 to 24 years old (I_2), from 25 to 64 years old (I_3), and those that are 65 years old or above (I_4) . Any other division could have been considered. Before proceeding into the normalization, each counselor η assigns to each of these groups a utility value according to their particular priority criteria. Our choices are conceived using an arbitrary scale to set the quantities employed in the examples. These are indicated by the components of the vectors Ψ _(A)^(1)=( 12,16,4,1) or Ψ _(A)^(2)=( 7,23,2,1) for C_A, and Ψ _(B)^(1)= ( 1,4,12,16) or Ψ _(B)^(2)=( 1,2,7,23) for C_B , which assume non-zero positive values and are independent of the number of individuals in each age group, characteristic of each community. These are then applied on Eq.(<ref>) to build the utility density functions u_η(y) for the diverse age distributions. We examine the four combinations: Ψ _(A)^(1) and Ψ _(B)^(1) (Default), Ψ _(A)^(1) and Ψ _(B)^(2) (Symptomatology.), Ψ _(A)^(2) and Ψ _(B)^(1) (Transmissibility), Ψ _(A)^(2) and Ψ _(B)^(2) (Concentrated). The idea is to test the choices of the counselors as the utilities become concentrated on the groups that each one of them finds the most priority to compare with the cases for which the utilities are less concentrated in a single group (Default). The utility density functions obtained using the population age distribution of the U.S. are shown in Figure 2. Analogous results have been obtained for the remaining countries (not shown). We emphasize that the assignments above for each Ψ _(η )^(1,2) represent possible choices to compare the achievements of the different strategies and combinations of utilities considering the diverse age distributions. Any other possibility would be feasible, depending on the interests and attributions of the counselors. Given u_η(y) for each country and for each counselor, the simulated dynamic compares the outcomes using three different strategies to allocate doses namely, Envy-Free, Oldest-First, and Maximize-Benefit one at the time, until vaccination ends. Under envy-free, the preferred side of each of the two counselors at p^∗(t) are opposite to one another. Yet, because for a given η , U_η^Γ(p^∗) accounts also for the coupled benefits associated with the others choice [<ref> - <ref>], the total region Ω (t)_EF to be vaccinated at each time t is necessarily composed of two or more disjoint segments spanned on both sides, the same for C_A and for C_B. That is, Ω (t)_EF =Ω _A^I∪Ω _B^II if C_A preferred side I and C_B preferred side II, or Ω (t)_EF=Ω _A^II∪Ω _B^I if C_A preferred side II and C_B preferred side I. Under oldest-first, the focus is on the protection of the elderly. In this case, the choice of the fraction of individuals to be vaccinated with available doses is based exclusively on the distribution of the age groups. The preference is always for the V most elderly which fraction v(t)=V/N(t) comprises a one segment region Ω (t)_oldest of the simplex at each time t. The maximize-benefit strategy, on the other hand, is based on the choice of the fraction v(t) of individuals comprising a region Ω (t)_max, eventually composed of disjoint regions, where the benefit achieved by adding the utilities from the two counselors is maximized. Using definition (<ref>), we express the average increment to the benefit achieved at time t as: 𝒰_ ^Ω (t)=1/2(𝒰_A^Ω (t)+𝒰_B^Ω (t)) for all strategies, such that Ω (t)∈{Ω (t)_ EF ,Ω (t)_oldest ,Ω (t)_max,Ω (t)_rand}. These include a random vaccination process considered for comparison purposes, under which the fraction v(t) of doses is offered to a randomly chosen fraction Ω (t)_rand of the simplex. In all cases, the simulations run for an initial population comprising N(0)=10^4 individuals and fixed vaccine batches of V=10^2 doses each. The simplex built at every iteration time to follow the envy-free strategy was partitioned using d=100 that ensures convergence of the results, as suggested by the study depicted in Figure S2. The whole procedure intends to find the regions Ω (t) to distribute the doses at each iteration time, that conform with each of the considered strategies. Figures (3-7) show results considering utilities combined as τ _(A)^(1) and τ _(B)^(1) (Default). The other combinations are also examined and the results are collected in Figures (8-9). The time behavior of the increments 𝒰_A^Ω (t),𝒰_B^Ω (t) and 𝒰_ ^Ω (t) in Figure 3 are for the population of the U.S. All other distributions that we have examined exhibited the same patterns (results not shown). Figure 4 exhibits the results for selected countries, as listed. Each point represents the time average of the differences (absolute values) Δ𝒰 between the increments to the benefit achieved by each of the two counselors, Δ𝒰≡1/τ ∑_t=0^τ\|𝒰_A^Ω (t)-𝒰 _B^Ω (t)\| evaluated over the time interval τ encompassing the entire vaccination period, for the diverse strategies. Figure 5 illustrates with the example of the U.S., the results obtained for the time evolution of the cumulative benefits Φ _η(t) : Φ _η(t)=∑_t =0^t𝒰 _η^Ω (t) for each of the two counselors η =A,B, and the mean: Φ (t)=1/2(Φ _A(t)+Φ _B(t)) The outcomes obtained for all selected countries exhibited a similar pattern (results not shown). Figure 6 depicts the time average of the differences (absolute values) between the contributions to the cumulative benefits of the two counselors, evaluated for all the countries listed: ΔΦ=1/τ∑_t\|Φ _A(t)-Φ _B(t)\| Figure 7 shows the corresponding results for time average Φ of Φ (t) (<ref>): Φ=1/τ∑_tΦ (t) These include the results for the minimize-benefit which is worth considering here precisely because it offers a lower bound to set a scale that allows one comparing outcomes, as we discuss next. Figure 8 merges the results for the averages of cumulative benefits ΔΦ and Φ using the considered strategies and combinations of utilities listed above extended for 236 countries (not specified). § DISCUSSION AND CONCLUDING REMARKS The realistic case addressed here is that of deciding about strategies for allocating vaccine doses that become available to a community at a certain frequency but in very limited quantities. In the example used, we consider two guidelines to drive allocation. The first focuses on the direct benefit of decreasing the severity of the symptoms. The second focuses on the indirect benefit of decreasing transmission. We approach this situation by representing each of these guidelines as the priority of a qualified counselor in scoring the entire population ordered by age. Assuming that full protection of an individual is achieved after a single dose, the challenge is to select the group of individuals to be vaccinated every time a new batch becomes available to balance these two contributions. The difficulty relies on the fact that, in general, the amount by which a given vaccinated individual contributes to each of the benefits differ from each other. On the contrary, if both benefits were of the same magnitude, any strategy would result in a balanced condition. We claim that the strategy based on an envy-free division for dose allocation, as outlined above, offers a suitable and efficient choice to achieve such a balance in unpaired cases, as exemplified by the considered utilities. Our approach adapts the constructive analysis of the classic cake-cutting division problem <cit.> to conceive distributing doses optimizing the benefits envisaged by each counselor, which include the benefits coupled with the others choice. Consistent with this, the results in Figure 3 of a case study certify that under the envy-free strategy, the increments to the benefit acquired at each time by each counselor remain very close together until vaccination is completed. Such results contrast with those obtained through oldest-first and maximize-benefit for which the increments to the two benefits differ considerably from each other across time. By adopting any of these two strategies, the selected regions of the simplex for doses allocation, either Ω =Ω _oldest or Ω =Ω _max along which u_A(y) and u_B(y) may assume very different values, leads to unbalanced U_A^Ω (t) and U_B^Ω (t). This is also the case with the random procedure. Figure 4 suggests a measure Δ𝒰 (<ref>) for this imbalance averaged over time. The results for the diverse strategies are depicted for each of the selected countries. It shows that Δ𝒰 approaches null values through the envy-free strategy. Relatively large values are obtained by applying the other two strategies and also by choosing the regions at random. Although each of the benefits accumulates to the unity at the same time, the way that this is accomplished and the effects on the achievements of the two counselors can differ considerably. In this respect, the comparative results in Figure 5 offer information about the efficiency with which the benefits evolve under different strategies. This can be better seen by interpreting cumulative data as the positions in time of the two particles in the space of benefits driven, each of them, by the corresponding counselor. Extending the analysis for the population age distributions of the selected countries, as shown, Figure 6 depicts the average distance kept between these two particles in each case, until reaching their common final position simultaneously. Large values indicate that on average, one of the particles reached positions close to the goal considerably faster than the other. That is, for such strategies, the two benefits evolve out of sync over a considerably large period. This is the case formaximize-benefit and oldest-first in these examples. On the contrary, the positions of the two particles under the envy-free remain very close together at each instant through the entire time interval, suggesting that in addition to offering a way to promote a balance between acquired benefits, the strategy offers also a way to balance the instantaneous rates at which this happens. This is important for practical purposes since the intervals between consecutive batches may be very large, especially during the initial vaccination. The effects of a time delay between the achievements of each of the two benefits may have devastating consequences for the community. The random choice procedure offers balanced rates, on average, although the instant rates differ considerably since the sizes of the increments to the benefits alternate unbalanced. Keeping with this kinematic interpretation, data in Figure 7 refer to the time averages Φ of the positions of the center of mass of the two particles achieved through the diverse strategies, and for all of the selected countries. The maximize-benefit presents the largest average value, as expected. Even though the partial benefits, i.e. the ones envisaged by each counselor, evolve at different rates in this case, both of them reach large values within relatively short times. Envy-free is also efficient in accumulating benefits almost as fast as the maximize-benefit does. Apparently, in all cases, the oldest-first and the random choice promote the worst results among all the considered procedures, except for a strategy introduced here named minimize-benefit. Under this, one looks for regions of the simplex that minimize the total benefit at each time. Although very implausible to be adopted in practice, this strategy is useful to consider in the present analysis since it provides a lower bound to compare the efficiency of the diverse strategies investigated. Accordingly, the average benefit accumulated upon envy-free is much closer to the quantity accumulated by the maximize-benefit than that accumulated by the minimize-benefit (Figure 7). Random choice accumulates benefits at an average rate between the maximize and minimize-benefit strategies. The oldest-first spreads its contributions along the interval showing a strong dependence on the population age distribution. Figure 8 depicts the results for (a) the time averages of the instantaneous difference Δ𝒰 and (b) the time averages of the cumulative difference ΔΦ, both against the average cumulative benefit Φ. Each point from a total of 236 composing a colored set, corresponds to the population distribution of a given country (not identified). The emphasis is given to the different combinations of utilities and strategies employed. In all cases, the results are in line with the behavior depicted in Figures 4, 6, and 7, for the utility pair named Default. The envy-free strategy is unique in achieving the smallest differences Δ𝒰 and ΔΦ among all strategies and in producing total benefit at a rate that, on average, is the closest to that achieved by maximize-benefit. Although the maximize-benefit (and in parallel, the minimize-benefit) approaches the results for the envy-free regarding the cumulative difference ΔΦ, the dispersion of data increases considerably in these cases. A surprising outcome from the study in Figure 8 is that the envy-free reveals a tendency to minimize the dispersion of the distributions for both ΔΦ and Φ when compared to the corresponding results achieved by the other strategies. For all pairs of utilities chosen, the remaining strategies produced large dispersion either for ΔΦ or Φ, or for both. Collectively, these results indicate that among all of the considered strategies the envy-free promotes a good balance between the benefits envisaged by the two counselors over time, and also that this happens at similar and relatively high rates at initial times resulting in fast accumulation of benefits. In addition, it is the strategy that tends to equalize the benefits of vaccination among diverse countries, which is desirable within a scenario of a pandemic. We thus believe that the proposed strategy fulfills the requirements stated in the introduction since it maintains the balance in agreement to different measures comprising a) the amount of benefit acquired at each time by each counselor, b) the efficiency of the process given the speed with which the cumulative benefit approaches limiting values, and c) the tendency to equalize the effects achieved by distinct population age distributions. We have assumed throughout that the only mechanism by which individuals are removed from the simplex is through vaccination. We do not account for varying vaccine efficacy or deaths, whether caused by the disease or by any other reason across the vaccination period. Once the two counselors provide the utilities, we predict the fraction of individuals from each age group, and at each time, that should be vaccinated to guarantee the balance. The results in Figure 9 exemplify in the case of the U.S. the kind of outcome provided by each of the four combinations of utilities, as indicated. In all cases, individuals of 65+ and those comprised within 15-24 years old are indicated to be prioritized across the initial batches. The effects of vaccine efficacy have been considered in previous studies using optimization algorithms <cit.>, <cit.> in connection to the evolution of age-stratified population models. In particular, an SEIR (susceptible, exposed, infectious, recovered) model dynamics has been considered for analyzing different scenarios for the choice of the age groups at the initial period of vaccination <cit.>. Given the proposal developed here, it might be interesting to conceive a vaccination plan based on an interplay between the dynamic of the envy-free and that of the SEIR model. Such a protocol would be able to minimize morbidity while balancing benefits. Finally, it should emphasize that the model offered here is not in any possible way restricted to the specific guidelines addressed above. These have been selected as references to explain and illustrate the practice of the method. Any other guideline could have been chosen to drive the allocation of available units. In addition, because Sperner's Lemma can be extended to more dimensions <cit.>, <cit.>, this opens the possibility to extend the constructive strategy described above to approach more realistic situations in which there are more than two guidelines defining priorities <cit.>. We believe that this offers an attractive perspective to resolve such complex problems, with the help of careful and skilled counselors. Supplementary Material Methods Here, we sketch the algorithm we have developed to find the envy-free division for vaccine allocation, given a pair of utility density functions. The time t=nT of the n^th iteration is measured in intervals T=1 between the availability of consecutive vaccine batches with V doses each. A fraction v(t)=V/N(t) from the simplex embracing N(t)>V susceptible individuals at t is selected for vaccination and then, removed. The simplex must then be re-scaled in order to map the remaining N(t+1)=N(t)-V susceptible into the interval [0,1] to resume the process of vaccination at the time t+1. Therefore, each iteration of the simulation comprises three steps: a decision step; a removal step; and a re-scaling step, which are sketched in Figure S1. Decision Step This is the part that distinguishes the strategies to drive vaccination. To proceed with the envy-free, we follow the procedure detailed in Section <ref> to build the simplex, label it, and use Equations (<ref> - <ref>) to determine which side each counselor would choose to vaccinate at each labeled point. Then, by inspection, we identify all pairs of points (p_L,p_R) between which an envy-free point p^∗(t) must be located. We choose the average positions between p_L and p_R to approximate the actual p^∗(t) at each time. The structure of the simplex with the continuous functions ρ ^(η )(y) to approach the utility densities of counselor η =A,B, guarantees the existence of at least one envy-free point between each pair (p_L,p_R). To build up such a function we suppose that a value ψ _k^(η ) is attributed by counselor η to each age group labeled k∈{1,...,m} , that decompose the population of the interval [0,1] into m sub-intervals, each of these enclosed between initial and final points, respectively y_k^I and y_k^F, for all k. Continuity at the frontiers between neighboring sub-intervals is assured by means of Sigmoid functions with an additional parameter B coinciding with the slope at the origin: G(y)=1/1+e^-By. S1 This allows a construction of the functions ρ ^(η )(y) as ρ ^(η )(y)=ψ _1^(η )[ 1-G(y-y_1^F)] +∑_k=1^m-1ψ _k^(η )[ G(y-y_k^I)-G(y-y_k^F) ] +ψ _m^(η )[ G(y-y_m^I)] S2 The normalized utility density functions u^(η )(y) defined by equation (<ref>) for each η are evaluated for ρ ^(η )(y) defined above. A remark is in order here regarding an eventual identification of several envy-free points in the simplex, at each time t. When this is the case, we proceed by choosing the one leading to the smallest difference between the benefits envisaged by the two counselors. In case of a tie, we choose the envy-free point leading to the greatest benefit resulting from adding the two contributions. If the simplex would still present more than one envy-free point, we select one of them randomly. Removal Step The choice of an envy-free point at the Decision Step prescribes a set Λ of L(t) intervals Λ ={λ _1(t),...,λ _L(t)} λ _l(t)∈ 0,1], each one of them selected either by C_A or by C_B to maximize each one benefit, accounting for the coupled contribution from the others choice. The union of all λ _l(t), l∈{1,...,L}, corresponds to the fraction v(t)=V/N(t) of the population vaccinated at time t which is then removed from the interval [0,1]. At the end of this removal process occurring at the interaction time t, the simplex turns out into a set of L(t)+1 disjoint intervals s_j(t)=[s_j^I(t),s_j^F(t)], j∈{1,..,L(t)+1} which union S(t)=⋃_js_j(t)⊆ 0,1] S3 shall be re-scaled to define the simplex at the time t+1. The construction is sketched in Figure S1 for L=2. Re-scaling Step After removing the individuals vaccinated at time t, each interval s_j(t) is re-scaled into a new interval referred to as ζ _j(t+1). The union of all ζ _j(t+1) defines the new simplex [0,1] over which the former steps shall be repeated at time t+1: Z(t+1)=⋃_jζ _j(t+1)=[0,1] S4 The intervals ζ _j(t+1) are set through the scale factor r(t;t+1)=N(t)/N(t+1)=1/(1-v(t))S5 so that the first interval ζ _1(t+1) has its endpoints calculated as: ζ _1^I(t+1) =0 S6 ζ _1^F(t+1) =Δ s_1(t)r(t;t+1) where Δ s_j(t)=s_j^F(t)-s_j^I(t) is the size of the interval s_j(t). The remaining intervals [ζ _j^I(t+1), ζ _j^F(t+1)] for all j>1 are set as: ζ _j^I(t+1) =ζ _j-1^F(t+1) S7 ζ _j^F(t+1) =ζ _j^I(t+1)+Δ s_j(t)r(t;t+1) Z(t+1) defines the simplex that will be considered in the next iteration, at the time t+1. The three steps described above are iterated up to the vaccination is completed. About the choice of parameter d Sperner's Lemma guarantees that the envy-free strategy will always find at least one pair of points (p_L,p_R) enclosing an envy-free point p^∗ at the end of each iteration time. However, if the considered number d of divisions of the simplex is too small, the average between these two points may not be a good approximation to p^∗, as we have assumed. In this case, changing d may lead to oscillations in the value of p^∗ and, most probably, in the quantities derived from it. Improving the approximation by increasing d is expected to reduce such oscillations as p^∗ approaches its actual value. This, however, implies adding considerable computational costs to the numerical procedure. To achieve a compromise between mathematical accuracy and computational performance in this case, we examine how the change in d directly affects the temporal averages of the quantities shown in figures 4, 6, and 7 using as an example, the population age distribution from the U.S.. Figure S2(a) shows the average temporal behavior of the difference of the benefits (absolute values) ((<ref>)) due to the contributions of the two counselors obtained through the envy-free strategy, as d increases. Figure S2(b) shows the corresponding behavior of the cumulative differences (<ref>), and Figure S2(c) shows the mean cumulative benefit (<ref>). As expected, the amounts oscillate around the mean until stabilizing at a certain value of d that is not the same for the different quantities analyzed. We proceed into the whole numerical calculation presented above choosing d=100 which seems suitable to ensure convergence of the results in all cases. Other strategies The other strategies considered to simulate the dynamics of vaccination, in particular the maximize benefit and the oldest-first, introduce changes into the Decision Step described above. The maximize-benefit, is based on the choice of the region Ω (t)_max in the simplex which is of the size of the total fraction v(t)=V/N(t) of individuals to be vaccinated at each time t, such that it maximizes the total benefit, accounting for both counselors according to the prescription in (<ref>) for Ω (t)=Ω (t)_max. The iterating procedure follows then the same removal and re-scaling steps as for the envy-free. The implementation of the oldest-first strategy consists in allocating the total fraction v(t)=V/N(t) of vaccine doses available at the time t to the oldest fraction of the population present at that time. The resulting benefit is evaluated according to (<ref>) for Ω (t)=Ω (t)_oldest. The iterating procedure follows then the same removal and re-scaling steps as for the envy-free. Acknowledgements The authors acknowledge D.H.U. Marchetti for comments and suggestions on the manuscript. P.R.A acknowledges the financial support from the Brazilian agency Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES). 99 who protocols World Health Organization, A Global Framework to Ensure Equitable and Fair Allocation of COVID-19 Products and Potential implications for COVID-19 Vaccines, 18 June 2020; https://bit.lyhttps://1drv.ms/u/s!ApaXW-xuBujRqF60FeJAdKSCkWMC?e=3eSf7Q/32rhHPb. WHO H.Gayle, A Framework for Equitable Allocation of COVID-19 Vaccine, National Academy of Sciences, Engineering and Medicine 2020, Washington, DC: The National Academies Press. https://doi.org/10.17226/25917. ethical 1 J.W.Wu, S.D. John, E.Y. Adashi, Allocating Vaccines in the Pandemic: The Ethical Dimension, The Am. J. of Medicine V.33(11): 1241 - 1242 (2020). science 1 Ezekiel J. Emanuel, Govind Persad, Adam Kern, Allen Buchanan, Cécile Fabre, Daniel Halliday, Joseph Heath, Lisa Herzog, R. J. Leland, Ephrem T. Lemango, Florencia Luna, Matthew S. McCoy, Ole F. Norheim, Trygve Ottersen, G. Owen Schaefer, Kok-Chor Tan, Christopher Heath Wellman, Jonathan Wolff, Henry S. Richardson, An ethical framework for global vaccine allocation, Science 369(6509): 1309-1312 (2020). clinical Kai Liua, Ying Chenb, Ruzheng Linc Kunyuan Han, Clinical features of COVID-19 in elderly patients: A comparison with young and middle-aged patients, J. of Infection 80: e14–e18 (2020). clinical 1 Huang C, Wang Y, Li X, Ren L, Zhao J, Hu Y, Zhang L, Fan G, Xu J, Gu X, Cheng Z, Yu T, Xia J, Wei Y, Wu W, Xie X, Yin W, Li H, Liu M, Xiao Y, Gao H, Guo L, Xie J, Wang G, Jiang R, Gao Z, Jin Q, Wang J, Cao B Clinical features of patients infected with 2019 novel coronavirus in Wuhan, China. Lancet. 395(10223): 497 (2020). how to cut a cake L. E. Dubins and E. H. Spanier, How to Cut A Cake Fairly, The American Mathematical Monthly 68(1): 1- 17 (1961). constructive S. J. Brams, A. D. Taylor, An Envy-Free Cake Division Protocol, The American Mathematical Monthly, 102(1): 9-18 (1995). Su F.E. Su, Rental harmony: Sperner's lemma in fair division. Am. Math. Monthly 106, 930–942 (1999). Playful Introduction M. DeVos. D.A. Kent, Game Theory - a Playful Introduction, Am. Math. Soc., Student Math. Library V. 80, Providence, Rhode Island (2016). utilitarian models 1 D.B.White , M.H. Katz, J.M. Luce, B. Lo, Who should receive life support during a public health emergency? Using ethical principles to improve allocation decisions. Ann. Intern. Med. 150(2): 132-138 (2009). utilitarian models 2 Y. Liu, S. Salwi S, B.C. Drolet, Multivalue ethical framework for fair global allocation of a COVID-19 vaccine. J Med Ethics 46(8): 499-501 (2020). reserved systems A.T. Makhoul, B.C. Drolet, A Reserve System for the Equitable Allocation of a Severe Acute Respiratory Syndrome Coronavirus 2 Vaccine, Chest 159(3): 1292 - 1293 (2021). demographic https://population.un.org/wpp/Download/Standard/MostUsed/; United Nations, Department of Economic and Social Affairs, Population Division (2022). World Population Prospects 2022, Online Edition. science3 L. Matrajt, J. Eaton, T. Leung, E. R. Brown, Vaccine optimization for COVID-19: Who to vaccinate first? Sci. Adv.7(6) : eabf1374 (2021). pnas21 J.H. Bucknera, G. Chowell, Michael R. Springborn, Dynamic prioritization of COVID-19 vaccines when social distancing is limited for essential workers, Proc. Nat. Acad. Sci. USA, Vol. 118(16) e2025786118 (2021). science2 K. M. Bubar, K. Reinholt, S. M. Kissler, M. Lipsitch, S. Cobey, Y. H. Grad, D. B. Larremore, Model-informed COVID-19 vaccine prioritization, Science (371): 916–921 (2021). § LEGENDS * Figure 1 - A labeled simplex defined by a partition with d=9 . The scheme follows Ref. <cit.> to illustrate in the present case possible choices of counselors C_A, at points A and C_B, at points B, about vaccinating on side I or on side II. Each of the regions between an identified pair (p_L,p_R) encloses a point p^∗ that sets an envy-free division of the simplex. * Figure 2 - Illustrative example. Utility density functions evaluated by each counselor C_A (purple) and C_B (green) considering the four combinations of utilities, as indicated, for the population age-groups of the U.S. * Figure 3 - Simulated time series for the benefits (<ref>) acquired by each counselor, C_A (orange) and C_B (blue) through (a) a random procedure and strategies (b) maximize-benefit, (c) oldest-first, (d) envy-free. The utility density functions employed correspond to the combination defined as Default in Fig.(2) and the results shown are for the population age-distribution of the U.S. * Figure 4 - Time average of the differences (absolute values) ( <ref>) between the contributions of the two counselors to the benefits obtained through each strategy, extended to the population age-groups of the selected countries, as specified. The utility density functions employed correspond to the combination defined as Default. * Figure 5 - Simulated time series for the cumulative benefits Φ _η(t) (<ref>) acquired by each counselor, C_A (orange) and C_B (blue) through (a) a random procedure and strategies (b) maximize-benefit, (c) oldest-first, (d) envy-free. The utility density functions employed correspond to the combination defined as Default in Fig.(2). The results shown are for the population age-distribution of the U.S. * Figure 6 - Time average of the differences (absolute values) ΔΦ (<ref>) between the contributions of the two counselors to the cumulative benefits obtained through each strategy, extended to the population age-distributions of the selected countries, as specified. The utility density functions employed correspond to the combination defined as Default. * Figure 7 - Time average of the mean cumulative benefit Φ (<ref>) between the contributions of the two counselors, for each strategy and selected countries. The utility density functions employed correspond to the combination defined as Default. * Figure 8 - Time averages of (a) the cumulative differences (absolute values) ΔΦ (<ref>), and (b) the instantaneous differences (absolute values) Δ𝒰 (<ref>) against the mean Φ (<ref>), evaluated for the population age-distributions of 236 selected countries for strategies and utility combinations, as indicated by colors. The distributions of the points are indicated by the lateral diagrams. Maximize-benefit (blue) minimize-benefit (green), oldest-first (brown), envy-free (red) and random procedure (orange). * Figure 9 - Indication of the population fraction per age group to receive the doses at each time to follow the envy-free strategy considering the different combinations of utilities, as indicated. The results shown are for the population age-distribution of the U.S. * Figure S1 - Schematic view of a model simplex at an iteration time t. (1) An envy-free division point p^∗ is identified. (2) The regions λ _1 and λ _2 corresponding to the fractions of individuals that received the doses are removed from the simplex. (3) The remaining regions s_1, s_2, and s_3 are reset through the scale factor r to recompose the simplex for the analysis at time t+1. * Figure S2 - Study of convergence of the results as dvaries. The quantities examined are indicated on the axis. In each case, the median is indicated by the orange line.
http://arxiv.org/abs/2306.09815v1	20230616125046	DisasterNets: Embedding Machine Learning in Disaster Mapping	[ "Qingsong Xu", "Yilei Shi", "Xiao Xiang Zhu" ]	cs.CV	[ "cs.CV" ]	Amortized Inference for Gaussian Process Hyperparameters of Structured Kernels (Supplementary Material) Aldo Lipani ======================================================================================================= Disaster mapping is a critical task that often requires on-site experts and is time-consuming. To address this, a comprehensive framework is presented for fast and accurate recognition of disasters using machine learning, termed DisasterNets. It consists of two stages, space granulation and attribute granulation. The space granulation stage leverages supervised/semi-supervised learning, unsupervised change detection, and domain adaptation with/without source data techniques to handle different disaster mapping scenarios. Furthermore, the disaster database with the corresponding geographic information field properties is built by using the attribute granulation stage. The framework is applied to earthquake-triggered landslide mapping and large-scale flood mapping. The results demonstrate a competitive performance for high-precision, high-efficiency, and cross-scene recognition of disasters. To bridge the gap between disaster mapping and machine learning communities, we will provide an openly accessible tool based on DisasterNets. The framework and tool will be available at https://github.com/HydroPML/DisasterNets. Disaster mapping, space granulation, attribute granulation, machine learning, DisasterNets § INTRODUCTION Disaster mapping is an essential task following tragic events such as hurricanes, earthquakes, and floods. It is also a time-consuming and risky task that still often requires the sending of experts on the ground to meticulously map and assess the damages. With a growing number of satellites in orbit (such as Sentinel, ASTER, and Landsat), it is easy to acquire almost real-time remote sensing images from areas struck by a disaster. However, it is challenging for real-time disaster mapping due to the massive amount of remote sensing data, variations in different disaster scenarios, and the time sensitivity for post-disaster rescue. To this end, leveraging deep learning, a comprehensive and general framework for disaster mapping, termed DisasterNets, is proposed for high precision and fast recognition of different disasters. Specifically, the proposed framework includes five modules to achieve end-to-end disaster mapping under different scenarios. When the corresponding labeled disaster training samples are available in the study area, a supervised/semi-supervised deep learning module is utilized for semantic segmentation in remote sensing images of disasters. For disaster mapping on synthetic aperture radar (SAR) or high-resolution remote sensing images, the main challenges of the supervised/semi-supervised deep learning module include high intra-class variance, low inter-class variance, the large variance of object scales, and dependency on training samples. To address these challenges, some supervised deep learning networks (such as MFFENet <cit.>) by fusing multi-scale features of objects and semi-supervised deep learning networks (such as SSCDNet <cit.>) by the self-training technology are utilized in DisasterNets. In most cases, the suddenness of disasters and the massive amount of data in remote-sensing images make the labeling task difficult. Toward this end, an unsupervised change detection module using available pre-disaster remote sensing images, an unsupervised domain adaptation with source data module for existing source domain disaster datasets with labels, and an unsupervised domain adaptation without source data module for unavailable source domain disaster datasets are presented to segment the unlabeled post-disaster remote sensing images. The main difficulties affecting unsupervised change detection in remote sensing images are differences in light conditions, atmospheric conditions, and seasonality due to different acquisition dates. Thus, some unsupervised change detection networks (such as UCDFormer <cit.>, DCVA <cit.>) by considering the distribution differences and computational costs are presented in DisasterNets. Furthermore, for the unsupervised domain adaptation with source data module, some deep learning networks (such as ADANet <cit.>, CaGAN <cit.>) are used to address the domain adaptation problem in disaster mapping by leveraging the adversarial learning behaviors of GANs to perform distribution alignment in the pixel, feature, and output spaces of CNN networks. For the unsupervised domain adaptation without source data module, some source-free domain adaptation networks (such as SGD-MA <cit.>) are utilized in DisasterNets by generating a reliable synthetic source domain. Finally, the disaster database with the corresponding geographic information field properties obtained by using an attribute granulation module is presented for emergency rescue, risk assessment, and other applications. The proposed DisasterNets is applied in earthquake-triggered landslide mapping and flood mapping under different scenarios. Specifically, high-resolution remote sensing images of three earthquake-induced landslides in Jiuzhaigou, Wenchuan (China) and Hokkaido (Japan), as well as SAR remote sensing images of Pakistan flood are used to verify the practicality and effectiveness of DisasterNets under different scenarios. The results demonstrate a competitive performance for high-precision, high-efficiency, and cross-scene recognition of different disasters, and the insightful results are beneficial to disaster mapping based on machine learning methods. § DISASTERNETS As shown in Fig. <ref>, the DisasterNets consists of two stages, space granulation and attribute granulation. For the space granulation stage, the primary objective is to acquire disaster mapping. The attribute granulation stage focuses on incorporating geographical attributes to facilitate swift disaster assessments for each affected area. §.§ Supervised/Semi-supervised Learning When the corresponding labeled disaster training samples are available in the study area, a deep supervised segmentation model, dubbed Multiscale Feature Fusion with Encoder-decoder Network (MFFENet) <cit.>, is utilized for large number of labeled samples, and a semi-supervised deep learning network (such as SSCDNet <cit.>) is used for few labeled samples. Here, we will provide a brief introduction to MFFENet and SSCDNet. MFFENet consists of two parts: encoder and decoder. The encoder part is to generate different feature levels using the backbone network ResNet101. In addition, the atrous spatial pyramid pooling (ASPP) is used to generate context-reinforced features, and we modify the sampling rates of ASPP to {6, 12, 24, 36} to produce denser feature maps with larger field-of-views. In the decoder part, an adaptive triangle fork (ATF) module is utilized to adaptively fuse the useful features at different scales and the same scales, and the residual convolution module is used as the basic processing unit. In addition, a dense top-down feature pyramid module is presented to gather more contextual information from the outputs of ATF and the encoder. Finally, to efficiently optimize the MFFENet model, a boundary-aware loss is introduced, which reweights the pixels near the boundary. Detailed descriptions of MFFENet, including its optimization, are presented in the work <cit.>. SSCDNet incorporates the unsupervised domain adaptation strategy to address the domain shift problem in semi-supervised learning. By adapting at the feature level and output level, the network reduces domain distribution gaps and generates highly certain predictions for unlabeled samples. To improve the quality of pseudo-labels, a trustworthy pseudo-labeling method is employed, leveraging feedback information from output-level domain adaptation and a threshold strategy to identify trustworthy regions. These trustworthy regions are then used as ground-truth labels for network training. Further details of SSCDNet can be found in the work <cit.>. §.§ Unsupervised Change Detection When there are no corresponding labeled samples in the research area, but there are pre-disaster remote sensing images, some unsupervised change detection networks (such as UCDFormer <cit.>) are presented in DisasterNets. UCDFormer is a three-step approach for a scenario of unsupervised change detection with domain shift, which considers style differences and seasonal differences between multi-temporal images. Specifically, first, a transformer-driven image translation module is utilized to map data across two domains with real-time efficiency. A light-weight transformer is proposed in the transformer-driven image translation module to reduce the computational complexity of the self-attention layer in regular transformers by using spatial downsampling and channel group operations. In addition, a priori change indicator, affinity weight, is intended to reduce the translation strength of changed pixels and to increase the translation of unchanged pixels, by using a weighted translation loss. Next, a reliable pixel extraction module is proposed to extract significantly changed/unchanged pixel positions from the difference map, which is computed by fusing multi-scale feature maps. Finally, a binary change map of disasters is obtained based on the reliable changed/unchanged pixel positions and the random forest classifier. Detailed descriptions of UCDFormer are provided in the work <cit.>. §.§ Unsupervised Domain Adaptation In most cases, the suddenness of disasters and the massive amount of data in remote sensing images make the labeling task difficult. Toward this end, some unsupervised domain adaptation (UCD) networks (such as an adversarial domain adaptation network (ADANet) <cit.>, a class-aware generative adversarial network (CaGAN) <cit.>) are used to address the domain adaptation with source data module problem in disaster mapping by leveraging the adversarial learning behaviors of GANs to perform distribution alignment in the pixel, feature, and output spaces of CNN networks. In addition, some source-free domain adaptation networks (such as SGD-MA <cit.>) are utilized in DisasterNets for the domain adaptation without source data problem, by generating a reliable synthetic source domain. For a learnable and life-long model to perform different disaster segmentation tasks, it should be able to reutilize the information acquired in previous disaster segmentation tasks with the labeled images and transfer it to the new learning tasks of disaster segmentation with no labeled images. ADANet is proposed to mitigate the domain shift in different data distributions of disasters. ADANet consists of two modules: a segmentation network and two discriminators. Some supervised encoder-decoder architectures (such as MFFENet) can be utilized as the generator. Hence, the output features of the encoder block and the decoder block in the network are both collected and adopted since the former contains rich overall semantic information and the latter contains rich context, scene layout, and other detailed information. Detailed descriptions of ADANet are provided in the work <cit.>. However, the source data is usually not accessible in many cases due to privacy or disaster emergency urgency. Thus, UDA without source data (SDG-MA) is utilized in DisasterNets. SDG-MA consists of a source data generation (SDG) stage and a model adaptation (MA) stage. In the SDG stage, we reformulate the goal as estimating the conditional distribution rather than the distribution of the source data, since the source data space is exponential with the dimensionality of data. After the conditional distribution of the source data is obtained, it becomes a UDA task to mitigate the domain shift of different disaster data. In addition, a novel transferable weight in SDG-MA is defined by considering confidence and domain similarity to distinguish different categories in each domain. For more details about SDG-MA, please refer to the work <cit.>. §.§ Attribute Granulation Following the spatial granulation of the regional disasters, the next step involves calculating the area, perimeter, aspect ratio, and centroid of each disaster. Additionally, spatial identification is performed on the disasters detected in the remote sensing imagery, and the corresponding geographical coordinates of their centroids (locations) are incorporated. Utilizing a geographic information system, these characteristics of the disasters are defined as attribute properties, thereby completing the construction of their spatial geographic information attributes. Finally, the regional disaster database is rapidly established. § EXPERIMENTS Datasets. To assess the performance of the scheme for different disasters, two experiments are tested, including earthquake-triggered landslide mapping and large-scale flood mapping. For earthquake-triggered landslide mapping using RGB images, first, when the labeled landslide database <cit.> is accessible, the supervised method (MFFENet) is applied to the earthquake-induced Jiuzhaigou landslides. The research region chosen in the Jiuzhaigou earthquake covers an area of 53.6 km^2. Then, with the availability of pre-earthquake remote sensing images of Jiuzhaigou, the unsupervised change detection module, such as UCDFormer, is employed to identify the earthquake-induced landslides in the region. Next, the earthquake-induced landslides in Hokkaido, Japan, are chosen as a case study to assess the effectiveness of UCD with source data, using the labeled landslide database as the source data. Notably, a representative small region of the earthquake-induced Hokkaido landslides is carefully selected to evaluate the agreement between the ground truth obtained through visual interpretation and the predicted results generated by the ADANet model. Finally, the earthquake-induced landslides in Wenchuan, China are selected as a case study to assess the effectiveness of UCD without source data. Furthermore, the Pakistan flood in 2022 (30.49 km^2) is employed to verify the effectiveness of DisasterNets. Given that the flood in Pakistan is classified as an open area flood event, we directly utilize SAR data from the Sentinel-1 satellite to acquire pre-change and post-change SAR images of floods. Then, UCDFormer is used to swiftly generate a map of the affected flood area. Results of earthquake-triggered landslide mapping. According to the visualized results in Fig. <ref> and quantitative results in Table <ref>, it is evident that the supervised method yields the highest accuracy, followed by UDA with source data, and finally unsupervised change detection. However, the situation is reversed when considering training and inference time. Unsupervised change detection achieves a precision of 48.04% within approximately 10 minutes, whereas the supervised method achieves a precision of 90.23% but requires around 12 hours for processing. Additionally, the visualization results in Fig. <ref> indicate that SGD-MA can achieve satisfactory recognition even without the use of source data. Results of Pakistan flood mapping. According to the visualized flood mapping of Pakistan 2022 in Fig. <ref>, our results using unsupervised change detection (UCDFormer) exhibit a high degree of consistency with the public results from GloFAS global flood monitoring. This strong agreement highlights the effectiveness of our DisasterNets in rapidly mapping flood hazards. § CONCLUSION In this study, a comprehensive framework for fast and accurate disaster recognition using machine learning, DisasterNets, is proposed. The framework, consisting of space granulation and attribute granulation stages, demonstrates competitive performance in earthquake-triggered landslide mapping and large-scale flood mapping. IEEEbib
http://arxiv.org/abs/2306.06651v1	20230611111627	Predicting Software Performance with Divide-and-Learn	[ "Jingzhi Gong", "Tao Chen" ]	cs.SE	[ "cs.SE", "cs.AI", "cs.PF" ]	Loughborough University Leicestershire United Kingdom [email protected] Tao Chen is the corresponding author University of Birmingham Birmingham United Kingdom [email protected] Predicting the performance of highly configurable software systems is the foundation for performance testing and quality assurance. To that end, recent work has been relying on machine/deep learning to model software performance. However, a crucial yet unaddressed challenge is how to cater for the sparsity inherited from the configuration landscape: the influence of configuration options (features) and the distribution of data samples are highly sparse. In this paper, we propose an approach based on the concept of “divide-and-learn”, dubbed . The basic idea is that, to handle sample sparsity, we divide the samples from the configuration landscape into distant divisions, for each of which we build a regularized Deep Neural Network as the local model to deal with the feature sparsity. A newly given configuration would then be assigned to the right model of division for the final prediction. Experiment results from eight real-world systems and five sets of training data reveal that, compared with the state-of-the-art approaches, performs no worse than the best counterpart on 33 out of 40 cases (within which 26 cases are significantly better) with up to 1.94× improvement on accuracy; requires fewer samples to reach the same/better accuracy; and producing acceptable training overhead. Practically, also considerably improves different global models when using them as the underlying local models, which further strengthens its flexibility. To promote open science, all the data, code, and supplementary figures of this work can be accessed at our repository: . <ccs2012> <concept> <concept_id>10011007.10010940.10011003.10011002</concept_id> <concept_desc>Software and its engineering Software performance</concept_desc> <concept_significance>500</concept_significance> </concept> </ccs2012> [500]Software and its engineering Software performance Predicting Software Performance with Divide-and-Learn Tao Chen ===================================================== § INTRODUCTION “What will be the implication on runtime if we deploy that configuration?” The above is a question we often hear from our industrial partners. Indeed, software performance, such as latency, runtime, and energy consumption, is one of the most critical concerns of software systems that come with a daunting number of configuration options, e.g., x264 (a video encoder) allows one to adjust 16 options to influence its runtime. To satisfy the performance requirements, it is essential for software engineers to understand what performance can be obtained under a given configuration before the deployment. This not only enables better decisions on configuration tuning <cit.> but also reduces the efforts of configuration testing <cit.>. To achieve the above, one way is to directly profile the software system for all possible configurations when needed. This, however, is impractical, because (1) the number of possible configurations may be too high <cit.>. For example, HIPA^cc (a compiler for image processing) has more than 10,000 possible configurations. (2) Even when such a number is small, the profiling of a single configuration can still be rather expensive <cit.>: Wang et al. <cit.> report that it could take weeks of running time to benchmark and profile even a simple system. Therefore, an accurate performance model that can predict the expected performance of a newly given configuration is of high demand. With the increasing complexity of modern software, the number of configurable options continues to expand and the interactions between options become more complicated, leading to significant difficulty in predicting the performance accurately <cit.>. Recently, machine learning models have been becoming the promising method for this regression problem as they are capable of modeling the complex interplay between a large number of variables by observing patterns from data <cit.>. However, since machine learning modeling is data-driven, the characteristics and properties of the measured data for configurable software systems pose non-trivial challenges to the learning, primarily because it is known that the configuration landscapes of the systems do not follow a “smooth” shape <cit.>. For example, adjusting between different cache strategies can drastically influence the performance, but they are often represented as a single-digit change on the landscape <cit.>. This leads to the notion of sparsity in two aspects: * Only a small number of configuration options can significantly influence the performance, hence there is a clear feature sparsity involved <cit.>. * The samples from the configuration landscape tend to form different divisions with diverse values of performance and configuration options, especially when the training data is limited due to expensive measurement—a typical case of sample sparsity <cit.>. This is particularly true when not all configurations are valid <cit.>. Existing work has been primarily focusing on addressing feature sparsity, through using tree-liked model <cit.>; via feature selection <cit.>; or deep learning <cit.>. However, the sample sparsity has almost been ignored, which can still be a major obstacle to the effectiveness of machine learning-based performance model. To address the above gap, in this paper, we propose , an approach to model software performance via the concept of “divide-and-learn”. The basic idea is that, to handle sample sparsity, we divide the samples (configurations and their performance) into different divisions, each of which is learned by a local model. In this way, the highly sparse samples can be split into different locally smooth regions of data samples, and hence their patterns and feature sparsity can be better captured. In a nutshell, our main contributions are: * We formulate, on top of the regression of performance, a new classification problem without explicit labels. * We extend Classification and Regression Tree (CART) <cit.> as a clustering algorithm to “divide” the samples into different divisions with similar characteristics, for each of which we build a local regularized Deep Neural Network (rDNN) <cit.>. * Newly given configurations would be assigned into a division inferred by a Random Forest classifier <cit.>, which is trained using the pseudo labeled data from the CART. The rDNN model of the assigned division would be used for the final prediction thereafter. * Under eight systems with diverse performance attributes, scale, and domains, as well as five different training sizes, we evaluate against four state-of-the-art approaches and with different underlying local models. The experiment results are encouraging: compared with the best state-of-the-art approach, we demonstrate that * achieves no worse accuracy on 33 out of 40 cases with 26 of them being significantly better. The improvements can be up to 1.94× against the best counterpart; * uses fewer samples to reach the same/better accuracy. * incurs acceptable training time considering the improvements in accuracy. Interestingly, we also reveal that: * can considerably improve the accuracy of an arbitrarily given model when it serves as the local model for each division compared with using the model alone as a global model (which is used to learn the entire training dataset). However, the original with rDNN as the local model still produces the most accurate results. * 's error tends to correlate quadratically with its only parameter d that sets the number of divisions. Therefore, a middle value (between 0 and the bound set by CART) can reach a good balance between handling sample sparsity and providing sufficient training data for the local models, e.g., d=1 or d=2 (2 or 4 divisions) in this work. This paper is organized as follows: Section <ref> introduces the problem formulation and the notions of sparsity in software performance learning. Section <ref> delineates the tailored problem formulation and our detailed designs of . Section <ref> presents the research questions and the experiment design, followed by the analysis of results in Section <ref>. The reasons why works, its strengths, limitations, and threats to validity are discussed in Section <ref>. Section <ref>, <ref>, and <ref> present the related work, conclude the paper, and elaborate data availability, respectively. § BACKGROUND AND MOTIVATION In this section, we introduce the background and the key observations that motivate this work. §.§ Problem Formulation In the software engineering community, the question introduced at the beginning of this paper has been most commonly addressed by using various machine learning models (or at least partially) <cit.>, in a data-driven manner that relies on observing the software’s actual behaviors and builds a statistical model to predict the performance without heavy human intervention <cit.>. Formally, modeling the performance of software with n configuration options is a regression problem that builds: 𝒫 = f(S), 𝒫∈ℝ whereby S denotes the training samples of configuration-performance pairs, such that 𝐱∈S. 𝐱 is a configuration and 𝐱=(x_1,x_2,⋯,x_n), where each configuration option x_i is either binary or categorical/numerical. The corresponding performance is denoted as 𝒫. The goal of machine learning-based modeling is to learn a regression function f using all training data samples such that for newly given configurations, the predicted performance is as close to the actual performance as possible. §.§ Sparsity in Software Performance Learning It has been known that the configuration space for software systems is generally rugged and sparse with respect to the configuration options <cit.> — feature sparsity, which refers to the fact that only a small number of configuration options are prominent to the performance. We discover that, even with the key options that are the most influential to the performance, the samples still do not exhibit a “smooth” distribution over the configuration landscape. Instead, they tend to be spread sparsely: those with similar characteristics can form arbitrarily different divisions, which tend to be rather distant from each other. This is a typical case of high sample sparsity <cit.> and it is often ignored in existing work for software performance learning. In Figure <ref>, we show examples of the configuration samples measured from four real-world software systems. Clearly, we see that they all exhibit a consistent pattern[Similar pattern has been registered on all systems studied in this work.]—the samples tend to form different divisions with two properties: * Property 1: configurations in the same division share closer performance values with smoother changes but those in-between divisions exhibit drastically different performance and can change more sharply. * Property 2: configurations in the same division can have a closer value on at least one key option than those from the different divisions. In this regard, the values of performance and key configuration options determine the characteristics of samples. In general, such a high sample sparsity is caused by two reasons: (1) the inherited consequence of high feature sparsity and (2) the fact that not all configurations are valid because of the constraints (e.g., an option can be used only if another option has been turned on) <cit.>, thereby there are many “empty areas” in the configuration landscape. When using machine learning models to learn concepts from the above configuration data, the model needs to (1) handle the complex interactions between the configuration options with high feature sparsity while (2) capture the diverse characteristics of configuration samples over all divisions caused by the high sample sparsity, e.g., in Figure <ref>, where samples in different divisions have diverged performance ranges. For the former challenge, there have been some approaches proposed to target such, such as <cit.> and <cit.>. However, very little work has aimed to address the latter which can be the main obstacle for a model to learn and generalize the data for predicting the performance of the newly-given configuration. This is because those highly sparse samples increase the risk for models to overfit the training data, for instance by memorizing and biasing values in certain respective divisions <cit.>, especially considering that we can often have limited samples from the configuration landscape due to the expensive measurement of configurable systems. The above is the main motivation of this work, for which we ask: how can we improve the accuracy of predicting software performance under such a high sample sparsity? § DIVIDE-AND-LEARN FOR PERFORMANCE PREDICTION Drawing on our observations of the configuration data, we propose — an approach that enables better prediction of the software performance via “divide-and-learn”. To mitigate the sample sparsity issue, the key idea of is that, since different divisions of configurations show drastically diverse characteristics, i.e., rather different performance values with distant values of key configuration options, we seek to independently learn a local model for each of those divisions that contain locally smooth samples, thereby the learning can be more focused on the particular characteristics exhibited from the divisions and handle the feature sparsity. Yet, this requires us to formulate, on top of the original regression problem of predicting the performance value, a new classification problem without explicit labels. As such, we modify the original problem formulation (Equation <ref>) as below: D = g(S) ∀ D_i ∈D: 𝒫 = f(D_i), 𝒫∈ℝ Overall, we aim to achieve three goals: * Goal 1: dividing the data samples into diverse yet more focused divisions D (building function g) and; * Goal 2: training a dedicated local model for each division D_i (building function f) while; * Goal 3: assigning a newly coming configuration into the right model for prediction (using functions g and f). Figure <ref> illustrates the overall architecture of , in which there are three core phases, namely Dividing, Training, and Predicting. A pseudo code can also be found in Algorithm <ref>. §.§ Dividing The very first phase in is to appropriately divide the data into more focused divisions while doing so by considering both the configuration options and performance values. To that end, the key question we seek to address is: how to effectively cluster the performance data with similar sample characteristics (Goal 1)? Indeed, for dividing the data samples, it makes sense to consider various unsupervised clustering algorithms, such as k-mean <cit.>, BIRCH <cit.> or DBSCAN <cit.>. However, we found that they are ill-suited for our problem, because: * the distance metrics are highly system-dependent. For example, depending on the number of configuration options and whether they are binary/numeric options; * it is difficult to combine the configuration options and performance value with appropriate discrimination; * and clustering algorithms are often non-interpretable. As a result, in , we extend Classification and Regression Tree (CART) as the clustering algorithm (lines 3-11 in Algorithm <ref>) since (1) it is simple with interpretable/analyzable structure; (2) it ranks the important options as part of training (good for dealing with the feature sparsity issue), and (3) it does not suffer the issues above <cit.>. As illustrated in Figure <ref>, CART is originally a supervised and binary tree-structured model, which recursively splits some, if not all, configuration options and the corresponding data samples based on tuned thresholds. A split would result in two divisions, each of which can be further split. In this work, we at first train the CART on the available samples of configurations and performance values, during which we use the most common mean performance of all samples for each division D_i as the prediction <cit.>: y_D_i=1\|D_i\|∑_y_j ∈ D_iy_j in which y_j is a performance value. For example, Figure <ref> shows a projected example, in which the configuration that satisfies “ ” and “” would lead to an inferred runtime of 112 seconds, which is calculated over all the 5 samples involved using Equation <ref>. By choosing/ranking options that serve as the splits and tuning their thresholds, in , we seek to minimize the following overall loss function during the CART training: ℒ= ∑_y_j ∈ D_l(y_j - y_D_l)^2 + ∑_y_j ∈ D_r(y_j - y_D_r)^2 where D_l and D_r denote the left and right division from a split, respectively. This ensures that the divisions would contain data samples with similar performance values (Property 1) while they are formed with respect to the similar values of the key configuration options as determined by the splits/thresholds at the finest granularity (Property 2), i.e., the more important options would appear on the higher level of the tree with excessive splitting. However, here we do not use CART to generalize prediction directly on new data once it is trained as it has been shown that the splits and simple average of performance values in the division alone can still fail to handle the complex interactions between the options, leading to insufficient accuracy <cit.>. Further, with our loss function in Equation <ref>, CART is prone to be overfitting[Overfitting means a learned model fits well with the training data but works poorly on new data.] especially for software quality data <cit.>. This exacerbates the issue of sample sparsity <cit.> under a small amount of data samples which is not uncommon for configurable software systems <cit.>. Instead, what we are interested in are the (branch and/or leaf) divisions made therein (with respect to the training data), which enable us to use further dedicated and more focused local models for better generalizing to the new data (lines 6-11 in Algorithm <ref>). As such, the final prediction is no longer a simple average while we do not care about the CART overfitting itself as long as it fits the training data well. This is similar to the case of unsupervised clustering for which the clustering is guided by implicit labels (via the loss function at Equation <ref>). Specifically, in we extract the data samples according to the divisions made by the dth depth of the CART, including all the leaf divisions with depth smaller than d. An example can be seen from Figure <ref>, where d is a controllable parameter to be given. In this way, divides the data into a range of [d+1,2^d] divisions (d ≥ 1), each of which will be captured by a local model learned thereafter. Note that when the number of data samples in the division is less than the minimum amount required by a model, we merge the two divisions of the same parent node. As a concrete example, from Figure <ref>, we see that there are two depths: when d=1 there would be two divisions (one branch and one leaf) with 10 and 8 samples respectively; similarly, when d=2 there would be three leaf divisions: two of each have 5 samples and one is the division with 8 samples from d=1 as it is a leaf. In this case, CART has detected that the is a more important (binary) option to impact the performance, and hence it should be considered at a higher level in the tree. Note that for numeric options, e.g., , the threshold of splitting ( >5) is also tuned as part of the training process of CART. §.§ Training Given the divisions produced by the Dividing phase, we train a local model for the samples from each division identified as part of Goal 2 (lines 12-14 in Algorithm <ref>). Theoretically, we can pair them with any model. However, as we will show in Section <ref>, the state-of-the-art regularized Deep Neural Network (rDNN) <cit.> (namely ), published at ICSE'19, is the most effective one under as it handles feature sparsity well for configurable software. Indeed, Ha and Zhang <cit.> showed that rDNN is more effective than the others even with small data samples when predicting software performance (in our study, we also evaluate the same systems with small training sample sizes as used in their work). Therefore, in we choose rDNN as the underlying local model by default. In this work, we adopt exactly the same structure and training procedure as those used by Ha and Zhang <cit.>, hence we kindly refer interested readers to their work for the training details <cit.>. Since the local models of the divisions are independent, we utilize parallel training as part of . §.§ Predicting When a new configuration arrives for prediction, chooses a model of division trained previously to infer its performance. Therefore, the question is: how to assign the new configuration to the right model (Goal 3)? A naive solution is to directly feed the configuration into the CART from the dividing phase and check which divisions it associates with. Yet, since the performance of the new configuration is unforeseen from the CART's training data, this solution requires CART to generalize accurately, which, as mentioned, can easily lead to poor results because CART is overfitting-prone when directly working on new data <cit.>. Instead, by using the divided samples from the Dividing phase (which serves as pseudo labeled data), we train a Random Forest—a widely used classifier and is resilient to overfitting <cit.>—to generalize the decision boundary and predict which division that the new configuration should be better assigned to (lines 15-21 in Algorithm <ref>). Again, in this way, we are less concerned about the overfitting issue of CART as long as it matches the patterns of training data well. This now becomes a typical classification problem but there are only pseudo labels to be used in the training. Using the example from Figure <ref> again, if d=1 then the configurations in the 10 sample set would have a label “division1”; similarly, those in the 8 sample set would result in a label “division2”. However, one issue we experienced is that, even with d=1, the sample size of the two divisions can be rather imbalanced, which severely harms the quality of the classifier trained. For example, when training BDB-C with 18 samples, the first split in CART can lead to two divisions with 14 and 4 samples, respectively. Therefore, before training the classifier we use Synthetic Minority Oversampling Technique (SMOTE) <cit.> to pre-process the pseudo label data, hence the division(s) with much less data (minority) can be more repeatedly sampled. Finally, the classifier predicts a division whose local model would infer the performance of the new configuration. §.§ Trade-off with the Number of Divisions Since more divisions mean that the sample space is separated into more loosely related regions for dealing with the sample sparsity, one may expect that the accuracy will be improved, or at least, stay similar, thereby we should use the maximum possible d from CART in the dividing phase. This, however, only exists in the “utopia case” where there is an infinite set of configuration data samples. In essence, with the design of , the depth d will manage two conflicting goals that influence its accuracy: * greater ability to handle sample sparsity by separating the distant samples into divisions, each of which is learned by an isolated local model; * and a larger amount of data samples in each division for the local model to be able to generalize. Clearly, a greater d may benefit goal (1) but it will inevitably damage goal (2) since it is possible for CART to generate divisions with imbalanced sample sizes. As a result, we see d as a value that controls the trade-off between the two goals, and neither a too small nor too large d would be ideal, as the former would lose the ability to deal with sample sparsity while the latter would leave too little data for a local model to learn, hence produce negative noises to the overall prediction. Similar to the fact that we cannot theoretically justify how much data is sufficient for a model to learn the concept <cit.>, it is also difficult to prove how many divisions are sufficient for handling the sample sparsity in performance modeling. However, in Section <ref>, we will empirically demonstrate that there is a (upward) quadratic correlation between d value and the error incurred by due to the conflict between the above two goals. § EXPERIMENT SETUP Here, we delineate the settings of our evaluation. In this work, is implemented based on Tensorflow and . All experiments were carried out on a machine with Intel Core i7 2GHz CPU and 16GB RAM. §.§ Research Questions In this work, we comprehensively assess by answering the following research questions (RQ): * RQ1: How accurate is compared with the state-of-the-art approaches for software performance prediction? * RQ2: Can benefit different models when they are used locally therein for predicting software performance? * RQ3: What is the sensitivity of 's accuracy to d? * RQ4: What is the model building time for ? We ask RQ1 to assess the effectiveness of under different sample sizes against the state-of-the-art. Since the default rDNN in is replaceable, we study RQ2 to examine how the concept of “divide-and-learn” can benefit any given local model and whether using rDNN as the underlying local model is the best option. In RQ3, we examine how the depth of division (d) can impact the performance of . Finally, we examine the overall overhead of in RQ4. §.§ Subject Systems We use the same datasets of all valid configurations from real-world systems as widely used in the literature <cit.>. To reduce noise, we remove those that contain missing measurements or invalid configurations. As shown in Table <ref>, we consider eight configurable software systems with diverse domains, scales, and performance concerns. Some of those contain only binary configuration options (e.g., x264) while the others involve mixed options (binary and numeric), e.g., HSMGP, which can be more difficult to model <cit.>. The configuration data of all the systems are collected by prior studies using the standard benchmarks with repeated measurement <cit.>. For example, the configurations of Apache—a popular Web server—are benchmarked using the tools and , where workloads are generated and increased until reaching the point before the server crashes, and then the maximum load is marked as the performance value <cit.>. The process repeats a few times for each configuration to ensure reliability. To ensure generalizability of the results, for each system, we follow the protocol used by existing work <cit.> to obtain five sets of training sample size in the evaluation: * Binary systems: We randomly sample n, 2n, 3n, 4n, and 5n configurations and their measurements, where n is the number of configuration options <cit.>. * Mixed systems: We leverage the sizes suggested by - <cit.> (a state-of-the-art approach) depending on the amount of budget. The results have been illustrated in Table <ref>. All the remaining samples in the dataset are used for testing. §.§ Metric and Statistical Validation §.§.§ Accuracy For all the experiments, mean relative error (MRE) is used as the evaluation metric for prediction accuracy, since it provides an intuitive indication of the error and has been widely used in the domain of software performance prediction <cit.>. Formally, the MRE is computed as: MRE = 1k×∑^k_t=1\|A_t - P_t\|A_t× 100% whereby A_t and P_t denote the tth actual and predicted performance, respectively. To mitigate bias, all experiments are repeated for 30 runs via bootstrapping without replacement. Note that excluding replacement is a common strategy for the performance learning of configuration as it is rare for a model to learn from the same configuration sample more than once <cit.>. §.§.§ Statistical Test Since our evaluation commonly involves comparing more than two approaches, we apply Scott-Knott test <cit.> to evaluate their statistical significance on the difference of MRE over 30 runs, as recommended by Mittas and Angelis <cit.>. In a nutshell, Scott-Knott sorts the list of treatments (the approaches that model the system) by their median values of the MRE. Next, it splits the list into two sub-lists with the largest expected difference <cit.>. For example, suppose that we compare A, B, and C, a possible split could be {A, B}, {C}, with the rank (r) of 1 and 2, respectively. This means that, in the statistical sense, A and B perform similarly, but they are significantly better than C. Formally, Scott-Knott test aims to find the best split by maximizing the difference Δ in the expected mean before and after each split: Δ = \|l_1\|/\|l\|(l_1 - l)^2 + \|l_2\|/\|l\|(l_2 - l)^2 whereby \|l_1\| and \|l_2\| are the sizes of two sub-lists (l_1 and l_2) from list l with a size \|l\|. l_1, l_2, and l denote their mean MRE. During the splitting, we apply a statistical hypothesis test H to check if l_1 and l_2 are significantly different. This is done by using bootstrapping and Â_12 <cit.>. If that is the case, Scott-Knott recurses on the splits. In other words, we divide the approaches into different sub-lists if both bootstrap sampling and effect size test suggest that a split is statistically significant (with a confidence level of 99%) and with a good effect Â_12≥ 0.6. The sub-lists are then ranked based on their mean MRE. § EVALUATION §.§ Comparing with the State-of-the-art §.§.§ Method To understand how performs compared with the state-of-the-art, we assess its accuracy against both the standard approaches that rely on statistical learning, i.e., <cit.> (linear regression and sampling methods) and <cit.> (an improved CART), together with recent deep learning-based ones, i.e., <cit.> (a single global rDNN) and <cit.> (an adversarial learning method). All approaches can be used for any type of system except for , which works on binary systems only. Following the setting used by Ha and Zhang <cit.>, [Since supports multiple sampling methods, we use the one (or combination for the mixed system) that leads to the best MRE.] and use their own sampling method while , and rely on random sampling. Since there are 8 systems and 5 sample sizes each, we obtain 40 cases to compare in total. We use the implementations published by their authors with the same parameter settings. For , we set d=1 or d=2 depending on the systems, which tends to be the most appropriate value based on the result under a small portion of training data (see Section <ref>). We use the systems, training sizes, and statistical tests as described in Section <ref>. All experiments are repeated for 30 runs. §.§.§ Results The results have been illustrated in Table <ref>, from which we see that remarkably achieves the best accuracy on 31 out of 40 cases. In particular, considerably improves the accuracy, e.g., by up to 1.94× better than the second-best one on Size 1 of VP8. The above still holds when looking into the results of the statistical test: is the only approach that is ranked first for 26 out of the 31 cases. For the 9 cases where does not achieve the best median MRE, it is equally ranked as the first for two of them. These conclude that is, in 33 cases, similar to (7 cases) or significantly better (26 cases) than the best state-of-the-art for each specific case (which could be a different approach). For cases with different training sample sizes, we see that performs generally more inferior than the others when the size is too limited, i.e., Size 1 and Size 2 for the binary systems. This is expected as when there are too few samples, each local model would have a limited chance to observe the right pattern after the splitting, hence blurring its effectiveness in handling sample sparsity. However, in the other cases (especially for mixed systems that have more data even for Size 1), needs far fewer samples to achieve the same accuracy as the best state-of-the-art. For example, on Lrzip, only needs 386 samples (Size 3) to achieve an error less than 15% while requires 907 samples (Size 5) to do so. Another observation is that the improvements of is much more obvious in mixed systems than those for binary systems. This is because: (1) the binary systems have fewer training samples as they have a smaller configuration space. Therefore, the data learned by each local model is more restricted. (2) The issue of sample sparsity is more severe on mixed systems, as their configuration landscape is more complex and comes with finer granularity. As a result, we anticipate that the benefit of can be amplified with more complex systems and/or more training data. To summarize, we can answer RQ1 as: RQ1: performs similar or significantly better than the best state-of-the-art approach in 33 out of 40 cases, with up to 1.94× improvements. It also needs fewer samples to achieve the same accuracy and the benefits can be amplified with complex systems/more training samples. §.§ under Different Local Models §.§.§ Method Since the idea of “divide-and-learn” can be applicable to a wide range of underlying local models of the divisions identified, we seek to understand how well perform with different local models against their global model counterparts (i.e., using them directly to learn the entire training dataset). To that end, we run experiments on a set of global models available in and widely used in software engineering tasks to make predictions directly <cit.>, such as CART, Random Forest (RF), Linear Regression (LR), Support Vector Regression (SVR), Kernel Ridge Regression (KRR), and k-Nearest Neighbours (kNN). We used the same settings as those for RQ1 and all models' hyperparameters are tuned in training. For the simplicity of exposition, we report on the ranks r produced by the Scott-Knott test. §.§.§ Result From Table <ref>, we can obtain the following key observations: firstly, when examining each pair of the counterparts, i.e., and X, can indeed improve the accuracy of the local model via the concept of “divide-and-learn”. In particular, for simple but commonly ineffective models like LR <cit.>, can improve them to a considerable extent. Yet, we see that does not often lead to a significantly different result when working with CART against using CART directly. This is as expected, since using different CART models for the divisions identified by a CART makes little difference to applying a single CART that predicts directly. Interestingly, we also see that our model performs better than the traditional ensemble learning: —a CART-based “divide-and-learn” model performs generally better than RF, which uses CART as the local model and combines them via Bagging. Secondly, the default of , which uses the rDNN as the local model, still performs significantly better than the others. This aligns with the findings from existing work <cit.> that the rDNN handles the feature sparsity better. Indeed, deep learning models are known to be data-hungry, but our results surprisingly show that they can also work well for a limited amount of configuration samples. The key behind such is the use of regularization, which stresses additional penalties on the more important weights/options. This has helped to relieve the need for a large amount of data during training while better fitting with the sparse features in configuration data. A similar conclusion has also been drawn from previous studies <cit.>. Therefore, for RQ2, we say: RQ2: Thanks to the concept of “divide-and-learn”, is able to significantly improve a range of global models when using them as the underlying local model. §.§ Sensitivity to the Depth d §.§.§ Method To understand RQ3, we examine different d values. Since the number of divisions (and hence the possible depth) is sample size-dependent, for each system, we use 80% of the full dataset for training and the remaining for testing. This has allowed us to achieve up to d=4 with 16 divisions as the maximum possible bound. For different d values, we report on the median MRE together with the results of Scott-Knott test for 30 runs. We also report the smallest sample size from the divisions, averaging over 30 runs. §.§.§ Results From Figure <ref>, we see that the correlation between the error of and d value is close to quadratic: reaches its best MRE with d=1 or d=2. At the same time, the size of training data for a local model decreases as the number of divisions increases. Since d controls the trade-off between the ability to handle sample sparsity and ensuring sufficient data samples to train all local models, d=1 or d=2 tends to be the “sweet points” that reach a balance for the systems studied. After the point of d=1 or d=2, the MRE will worsen, as the local models' training size often drops dramatically. This is a clear sign that, from that point, the side-effect of having too less samples to train a local model has started to surpass the benefit that could have been brought by dealing with sample sparsity using more local models. When d=0, which means only one division and hence is reduced to that ignores sample sparsity, the resulted MRE is the worst on 4 out of 8 systems; the same applied to the case when d=4. This suggests that neither too small d (e.g., d=0 with only one division) nor too larger d (e.g., d=4 with up to 16 divisions, i.e., too many divisions) are ideal, which matches our theoretical analysis in Section <ref>. Therefore, we conclude that: RQ3: The error of has a (upward) quadratic correlation to d. In this work, d=1 or d=2 (2 to 4 divisions) reaches a good balance between handling sample sparsity and providing sufficient training data for the local models. §.§ Overhead of Model Building §.§.§ Method To study RQ4, we examine the overall time required and the breakdown of overhead for in various phases. As some baselines, we also illustrate the model building time required by the approaches compared in RQ1. §.§.§ Result From Table <ref>, incurs an overall overhead from 6 to 56 minutes. Yet, from the breakdown, we note that the majority of the overhead comes from the training phase that trains the local models. This is expected, as uses rDNN by default. Specifically, the overhead of compared with (3 to 60 minutes) is encouraging as it tends to be faster in the worst-case scenario while achieving up to 1.94× better accuracy. This is because (1) each local model has less data to train and (2) the parallel training indeed speeds up the process. In contrast to (a few seconds to one minute), appears to be rather slow as the former does not use hyperparameter tuning but fixed-parameter values <cit.>. Yet, as we have shown for RQ1, achieves up to a few magnitudes of accuracy improvement. Although and have an overhead of less than a minute, again their accuracy is much more inferior. Further, requires a good selection of the sampling method(s) (which can largely incur additional overhead) while does not work on mixed systems. Finally, we have shown in RQ3 that 's MRE is quadratically sensitive to d (upward), hence its value should be neither too small nor too large, e.g., d=1 or d=2 in this work. In summary, we say that: RQ4: has competitive model building time to and higher overhead than the other state-of-the-art approaches, but this can be acceptable considering its improvement in accuracy. § DISCUSSION §.§ Why does Work? To provide a more detailed understanding of why performs better than state-of-the-art, in Figure <ref>, we showcase the most common run of the predicted performance by and against actual performance. Clearly, we note that the sample sparsity is rather obvious where there are two distant divisions. , as an approach that relies on a single and global rDNN, has been severely affected by such highly sparse samples: we see that the model tries to cover points in both divisions, but fails to do so as it tends to overfit the points in one or the other. This is why, in Figure <ref>b, its prediction on some configurations that should lead to low runtime tend to have much higher values (e.g., when and ) while some of those that should have high runtime may be predicted with much lower values (e.g., when and ). , in contrast, handles such a sample sparsity well as it contains different local models that particularly cater to each division identified, hence leading to high accuracy (Figure <ref>a). §.§ Strengths and Limitations The first strength of is that the concept of “divide-and-learn”, paired with the rDNN, can handle both sample sparsity and feature sparsity well. As from Section <ref> for RQ1, this has led to better accuracy and better utilization of the sample data than the state-of-the-art approaches. The second strength is that, as from Section <ref> for RQ2, can improve different local models compared with when they are used alone as a global model. While we set rDNN as the default for the best accuracy, one can also easily replace it with others such as LR for faster training and better interoperability. This enables great flexibility with to make trade-offs on different concerns of the practical scenarios. A limitation of is that it takes a longer time to build the model than some state-of-the-art approaches. On a machine with CPU 2GHz and 16GB RAM, needs between 6 and 56 minutes for systems with up to 33 options and more than 2,000 samples. §.§ Why d ∈{1\|2} is Highly Effective? We have shown that the setting of d in should be neither too small nor too large; the key intention behind the d is to reach a good balance between handling the sample sparsity and providing sufficient data for the local models to generalize. This is especially true when the CART might produce divisions with imbalanced sample sizes, e.g., we observed cases where there is a division with around 500 samples while one other has merely less than 10. Our experimental results show that such “sweet points” tend to be d=1 or d=2 for the cases studied in this work. However, the notion of “too small” and “too large” should be interpreted cautiously depending on the systems and data size. That is, although in this study, setting d=1 or d=2 appears to be appropriate; they might become “too small” settings when the data size increases considerably and/or the system naturally exhibits well-balanced divisions of configuration samples in the landscapes. Yet, the pattern of quadratic correlation between d and the error of should remain unchanged. §.§ Using in Practice Like many other data-driven approaches, using is straightforward and free of assumptions about the software systems, data, and environments. We would recommend setting d=1 or d=2 by default, especially when the data sample size is similar to those we studied in this work. Of course, it is always possible to fine-tune the d value by training with alternative settings under the configuration samples available. Given the quadratic correlation between d and the error, it is possible to design a simple heuristic for this, e.g., we compare the accuracy of trained with d=i and d=i+1 starting from d=1 and finally selecting the maximum d value k such that with k+1 is less accurate than with k. §.§ Threats to Validity Internal Threats. Internal threats to validity are related to the parameters used. In this work, we set the same setting as used in state-of-the-art studies <cit.>. We have also shown the sensitivity of to d and reveal that there exists a generally best setting. We repeat the experiments for 30 runs and use Scott-Knott test for multiple comparisons. Construct Threats. Threats to construct validity may lie in the metric used. In this study, MRE is chosen for two reasons: (1) it is a relative metric and hence is insensitive to the scale of the performance; (2) MRE has been recommended for performance prediction by many latest studies <cit.>. External Threats. External validity could be raised from the subject systems and training samples used. To mitigate such, we evaluate eight commonly used subject systems selected from the latest studies. We have also examined different training sample sizes as determined by <cit.>—a typical method. Yet, we agree that using more subject systems and data sizes may be fruitful, especially for examining the sensitivity of d which may lead to a different conclusion when there is a much larger set of training configuration samples than we consider in this study. § RELATED WORK We now discuss the related work in light of . Analytical model. Predicting software performance can be done by analyzing the code structure and architecture of the systems <cit.>. For example, Marco and Inverardi <cit.> apply queuing network to model the latency of requests processed by the software. Velez et al. <cit.> use local measurements and dynamic taint analysis to build a model that can predict performance for part of the code. However, analytical models require full understanding and access to the software's internal states, which may not always be possible/feasible. is not limited to those scenarios as it is a data-driven approach. Statistical learning-based model. Data-driven learning has relied on various statistical models, such as linear regressions <cit.>, tree-liked model <cit.>, and fourier-learning models <cit.>, etc. Among others, <cit.> utilizes linear regression combined with different sampling methods and a step-wise feature selection to capture the interactions between configuration options. <cit.> is an improved CART with an efficient sampling method <cit.>. However, recent work reveals that those approaches do not work well with small datasets <cit.>, which is rather common for configurable software systems due to their expensive measurements. This is a consequence of not fully handling the sparsity in configuration data. Further, they come with various restrictions, e.g., does not work on mixed systems while needs an extensive selection of the right sampling method(s). In contrast, we showed that produces significantly more accurate results while does not limit to those restrictions. Ensemble model. Models can be combined in a shared manner to predict software performance. For example, Chen and Bahsoon <cit.> propose an ensemble approach, paired with feature selection for mitigating feature sparsity, to model software performance. Other classic ensemble learning models such as Bagging <cit.> and Boosting <cit.> (e.g., RF) can also be equally adopted. Indeed, at a glance, our does seem similar to the ensemble model as they all maintain a pool of local models. However, the key difference is that the classic ensemble models will inevitably share information between the local models at one or more of the following levels: * At the training level, e.g., the local models in Boosting learn the same samples but with a different focus; the Bucket of Models (i.e., what Chen and Bahsoon <cit.> did) builds local models on the same data and uses the best upon prediction. * At the model prediction level, e.g., Bagging aggregates the results of local models upon prediction. , in contrast, has no information sharing throughout the learning as the samples are split and so does the prediction of the local models. This has enabled it to better isolate the samples and cope with their inherited sparsity, e.g., recall from RQ2, the overall accuracy of is better than RF (they both use CART as the local models but learn with and without sharing information). Deep learning-based model. A variety of studies apply neural network with multiple layers and/or ensemble learning to predict software performance <cit.>. <cit.> is a state-of-the-art DNN model with L_1 regularization to mitigate feature sparsity for any configurable systems, and it can be more accurate than many other existing approaches. The most recently proposed <cit.> relied on adversarial learning, which consists of a generative network to predict the performance and a discriminator network to distinguish the predictions and the actual labels. Nevertheless, existing deep learning approaches capture only the feature sparsity while ignoring the sample sparsity, causing serve risks of overfitting even with regularization in place. Compared with those, we have shown that, by capturing sample sparsity, is able to improve the accuracy considerably with better efficiency and acceptable overhead. Hybrid model. The analytical models can be combined with data-driven ones to form a hybrid model <cit.>. Among others, Didona et al. <cit.> use linear regression and kNN to learn certain components of a queuing network. Conversely, Weber et al. <cit.> propose to learn the performance of systems based on the parsed source codes from the system to the function level. We see as being complementary to those hybrid models due to its flexibility in selecting the local model: when needed, the local models can be replaced with hybrid ones, making itself a hybrid variant. In case the internal structure of the system is unknown, can also work in its default as a purely data-driven approach. § CONCLUSION This paper proposes , an approach that effectively handles the sparsity issues in configurable software performance prediction. By formulating a classification problem with pseudo labels on top of the original regression problem, extracts the branches/leaves from a CART which divides the samples of configuration into distant divisions and trains a dedicated local rDNN for each division thereafter. Prediction of the new configuration is then made by the rDNN of division inferred by a Random Forest classifier. As such, the division of samples and the trained local model handles the sample sparsity while the rDNN deals with the feature sparsity. We evaluate on eight real-world systems that are of diverse domains and scales, together with five sets of training data. The results show that is: * effective as it is competitive to the best state-of-the-art approach on 33 out of 40 cases, in which 26 of them are significantly better with up to 1.94× MRE improvement; * efficient since it often requires fewer samples to reach the same/better accuracy compared with the state-of-the-art; * flexible given that it considerably improves various global models when they are used as the local model therein; * robust because, given the quadratic correlation, a middle d value(s) (between 0 and the bound set by CART) can be robust and leads to the best accuracy across the cases, e.g., d=1 or d=2 under the sample sizes in this work. Mitigating the issues caused by sparsity is only one step towards better performance prediction, hence the possible future work based on is vast, including multi-task prediction of performance under different environments and merging diverse local models (e.g., a mix of rDNN and LR) as part of the “divide-and-learn” concept. Consolidating with an adaptive d is also within our agenda. § DATA AVAILABILITY Data, code, and supplementary figures of this work can be found at our repository: . ACM-Reference-Format
http://arxiv.org/abs/2306.04399v1	20230607125846	Transfer Learning of Transformer-based Speech Recognition Models from Czech to Slovak	[ "Jan Lehečka", "Josef V. Psutka", "Josef Psutka" ]	cs.CL	[ "cs.CL" ]	Department of Cybernetics, University of West Bohemia in Pilsen, Czech Republic {jlehecka,psutka_j,psutka}@kky.zcu.cz Transfer Learning of Transformer-based Speech Recognition Models from Czech to Slovak Jan Lehečka10000-0002-3889-8069 Josef V. Psutka10000-0003-4761-1645 Josef Psutka10000-0002-0764-3207 July 31, 2023 ========================================================================================================== In this paper, we are comparing several methods of training the Slovak speech recognition models based on the Transformers architecture. Specifically, we are exploring the approach of transfer learning from the existing Czech pre-trained Wav2Vec 2.0 model into Slovak. We are demonstrating the benefits of the proposed approach on three Slovak datasets. Our Slovak models scored the best results when initializing the weights from the Czech model at the beginning of the pre-training phase. Our results show that the knowledge stored in the Cezch pre-trained model can be successfully reused to solve tasks in Slovak while outperforming even much larger public multilingual models. § INTRODUCTION Transfer learning in speech recognition has been shown to be effective in improving accuracy and reducing the amount of training data required for new tasks. It is especially useful in scenarios where the amount of available training data is limited, such as low-resource languages or domains with specific acoustic characteristics. The aim of this paper is to identify a suitable transfer learning approach for two languages, Czech and Slovak. These two languages have many similarities, both in their written form and pronunciation. In our experiments, we are comparing several methods of training the Slovak models for the target task of automatic speech recognition (ASR). Specifically, we are investigating the possibilities of transferring the knowledge from the existing pre-trained Czech model into Slovak ASR tasks. Since Czech and Slovak have a lot in common, we expect this transfer learning approach to be beneficial in the target Slovak tasks because it can reuse the already trained knowledge common to both languages while suppressing the non-Slovak information in favor of Slovak-specific knowledge during the transfer. In this paper, we investigate the benefits of this transfer learning approach. We demonstrate the benefits of the proposed approach on three ASR datasets (described in detail in section <ref>). Two of the used datasets (CommonVoice and VoxPopuli) are public speech recognition datasets used very often for the benchmarking of ASR systems in many languages <cit.>. The third dataset, MALACH, is the Slovak portion of the very unique and challenging speech recognition dataset containing testimonies of eyewitnesses of the Holocaust recorded during 90'. We consider the MALACH dataset to be extremely important dataset for several reasons: (1) it preserves extremely valuable testimonies from our recent history, which should not be forgotten and which, alas, cannot be extended or scaled up anymore because the number of direct witnesses of the Holocaust rapidly decreases to zero as time goes on; (2) every improvement in the speech recognition accuracy unlocks new valuable historical and cartographical information encoded in the spoken utterances for researchers and public searching in this vast archive; (3) since most of the speakers were very old at the time of recording and the testimonies were spoken under heavy emotions, it is a challenging dataset to test the robustness, zero-shot performance and transfer learning ability of existing ASR models. § TRANSFER LEARNING FROM CZECH TO SLOVAK As mentioned above, Czech and Slovak share many similarities not only in their written form but also phonetically. Czech orthography serves as a model for several other Balto-Slavic languages that use the Latin alphabet. Slovak can be regarded as its direct descendant from this perspective. Both languages use comparable diacritics and have a similar, often interchangeable relationship between letters and the sounds they represent. The significant similarity between the two languages can also be attributed to the fact that they were both official languages in the same country for over 40 years (in Czechoslovakia). In this article, we will focus only on the graphemic aspect of these languages. For a more detailed comparison of Czech and Slovak in the context of acoustic modeling, please refer to <cit.>. In the Czech language, there are a total of 42 letters that are used. This includes the 26 letters of the basic Latin alphabet as well as 15 letters that have diacritical marks such as a caron [], acute [], or a overring []. In addition, there is a digraph [ch] that represents a phoneme /x/ (SAMPA is used in all cases of phonetic notation <cit.>) and is considered one of the letters of the Czech alphabet. There are two different ways to write a long /u:/ in Czech: [ú ] and [ů ], but they have the same pronunciation. One form cannot occur in the initial position, while the other occurs exclusively in the initial position or at the beginning of the root of a compound word. The Slovak alphabet is the longest alphabet among Slavic and other European languages, consisting of a total of 46 letters. It includes the 26 letters of the basic Latin alphabet that are also used in Czech. Additionally, there are 17 letters that have diacritical marks, which include diaeresis [] and a circumflex [] but do not include a overring []. But only five of these diacritical letters differ from those used in Czech ([ä ] [ľ ] [ĺ ] [ô ] [ŕ ]). Moreover, there are two additional digraphs present in the Slovak alphabet, i.e. [dz] and [dž]. These letters represent phonemes /dz/ and /dZ/. § WAV2VEC 2.0 Wav2Vec 2.0 models have recently become a new state-of-the-art paradigm in ASR tasks outperforming the previous architectures by a large margin <cit.>. It is a deep neural network pre-trained to reconstruct the corrupted audio signals. The model consists of a multi-layer convolutional neural network (referred to as a feature encoder) followed by a multi-layer Transformer encoder <cit.>. The convolutional feature encoder processes the raw input signal and produces a sequence of latent-speech representations. Each of these latent-speech representations is a vector encoding one 20ms-long frame of the input signal with only a small (5ms) context being taken into account. The attention-based Transformer then converts latent-speech representations into contextualized speech representations while paying attention to the full context of the input signal. The training of Wav2Vec models consists of two phases: self-supervised pre-training and supervised fine-tuning. The phase of self-supervised pre-training requires a large-scale unlabeled speech dataset, from which the model learns the contextualized speech representations by predicting masked frames. Moreover, the model is pre-trained also to solve a contrastive task over quantized speech representations, so the model is forced to map input frames into discrete speech units and correctly identify masked frames among a set of distractors. During this phase, the model does not have any orthographical information about the processed speech as it has access only to the raw audio signal, so it is pre-trained to catch and encode the meaning of individual audio frames only based on its context. The pre-training phase is essential to equip the model with deep knowledge mined from tens of thousands of hours of unlabeled speech. This knowledge constitutes a great advantage over models trained from scratch using labeled data only. From this point of view, the pre-trained weights of the Wav2Vec model could be seen as a very clever initialization of the model weights for supervised training. In this paper, we are investigating the benefits of clever initialization also for the pre-training, i.e., not starting from random weights from scratch but using weights of a model pre-trained from much more speech data from a language that is somehow similar. This way, the model could preserve the information common to both languages and reuse it when solving tasks in the other language. After the pre-training is done, the model transfers the pre-trained knowledge into the target ASR task within the fine-tuning phase. This is a supervised phase requiring the training speech dataset to be labeled. In order to decode the most probable sequences of graphemes, the model is additionally equipped with a final Connectionist Temporal Classification (CTC) layer <cit.>. CTC is an alignment-free method for grouping audio frames belonging to the same output token in order to convert a sequence of frame-level predictions into a much shorter sequence of output tokens. The CTC classification process can be described – in a simplified way – in 3 steps: * Assign the most probable output token to each audio frame. * Group sub-sequences with the same token into a single token. * Remove blank tokens. Tokens could be any speech or language units, e.g., phonemes, graphemes, sub-word units, words, etc. In this paper, we experimented with grapheme-based predictions, i.e., we predicted the sequence of characters. We chose the grapheme-based output units because it has several advantages: (1) the fine-tuned model works with very small vocabulary (the size of the alphabet plus several special tokens), so the decoding is fast, (2) it avoids out-of-vocabulary problems (any sequence of graphemes can be predicted), and (3) it can be used as a stand-alone full-fledged end-to-end speech recognizer without any additional postprocessing. § EXPERIMENTAL SETUP In our experiments, we used existing pre-trained Wav2vec models or – when not available – we pre-trained new ones. We fine-tuned all pre-trained models on train and development parts of three Slovak ASR datasets. After that, we evaluated all models on the test part of relevant datasets. The test parts were held out during the whole fine-tuning process and had no speaker overlaps with train or development parts. We used implementation from tool <cit.> for both pre-training and fine-tuning of models. §.§ Pre-trained Models In this section, we present all the pre-trained models we were experimenting with. We used three monolingual pre-trained Wav2Vec 2.0 models of the base size: Czech (denoted as ), Slovak (), and a model transferred from Czech to Slovak (). To test the monolingual models against multilingual models, we also evaluated two popular large-scale multilingual models (Wav2Vec XLS-R and Whisper). We are listing the models along with detailed information in the rest of this section. §.§.§ W2V2-cs The is a monolingual model pre-trained solely from the Czech speech. We used the publicly available model [<https://huggingface.co/fav-kky/wav2vec2-base-cs-80k-ClTRUS>] <cit.>. It has been trained from 80 thousand hours of Czech speech from various domains, mainly from the VoxPopuli dataset <cit.> and records from Czech TV and radio shows. §.§.§ W2V2-sk The is a monolingual model pre-trained solely from the Slovak speech. We didn't find any suitable public model, so we pre-trained a new base-sized model from scratch. Since Transformer-based models are known to scale well with the size of pre-training data, we tried to gather as much public unlabeled speech data as possible. We collected over 17 thousand hours of Slovak speech from various sources. The collection includes recordings from the Slovak portion of the VoxPopuli dataset <cit.> (12k hours), a mix of self-crawled records from Slovak TV shows (4.5k hours), the MALACH dataset (800 hours) and the Slovak portion of CommonVoice corpus 13.0 <cit.> (24 hours). We used Wav2Vec 2.0 architecture <cit.> and adopted the same hyperparameter setting as in the paper, i.e., we trained the base model (12 Transformer blocks, model dimension 768, 8 attention heads, and a total of 95 million parameters) for 400 thousand steps with a batch size of about 1.6 hours. The pre-training took four days on a machine with eight NVIDIA A100 GPUs. §.§.§ W2V2-cs-sk The is a monolingual Slovak model which was not initialized randomly from scratch but rather from weights of the Czech model . After the initialization, we pre-trained the model with the exact same setting and data as . Thus, the only difference between and is the initialization of weights. We expect this model to identify, preserve and transfer the useful knowledge common to both languages while suppressing the non-Slovak information in favor of Slovak-specific knowledge during the pre-training. In this paper, we are exploring if and how much this transfer learning approach is beneficial. We are releasing this pre-trained Slovak model publicly to the research community[<https://huggingface.co/fav-kky/wav2vec2-base-sk-17k>]. §.§.§ W2V2-XLS-R-300M To compare monolingual models also with popular multilingual public models, we selected Wav2Vec XLS-R <cit.> as a representative of large-scale pre-trained cross-lingual models. The model was pre-trained on approximately 436 thousand hours of unlabeled speech data from 128 languages (including both Czech and Slovak). We experimented with the 300M variant, which has more than 300 million parameters, i.e., more than 3× more than the base Wav2Vec 2.0 model. We denote this model . §.§.§ Whisper-large Finally, we compared our models with <cit.>, another popular model trained on 99 languages (including both Czech and Slovak) from 680,000 hours of multilingual and multitask labeled data. This model differs from Wav2Vec models in two main aspects: (1) it is not an encoder-only model but has also a decoder serving as an audio-conditioned built-in language model, (2) the input is Mel spectrogram instead of the raw audio signal. We experimented with the large size of the model with 32+32 Transformer layers, dimension 1280, 20 attention heads, and a total of 1.55 billion trainable parameters. When decoding, we specified the language to Slovak, so the model didn't have to identify the language automatically from the input signal. As this model has already been fine-tuned on a large palette of datasets and tasks by authors, we didn't further fine-tune the model, and we used the downloaded weights directly. §.§ Fine-tuning We prepared all training and development ASR data consistently for all datasets. Where necessary, we sliced long training audio signals on speech pauses not to exceed the length of 30 s. Longer utterances were discarded due to the memory limits of used GPUs during fine-tuning. We removed non-speech events and punctuation from the transcripts and mapped all words into lowercase. We fine-tuned all models with the same setting as the base model in <cit.>, i.e., we trained for 80 thousand steps with a batch size of about 26 minutes per step, and the learning rate warmed up over the first 8 000 steps to a maximum value of 2×10^-5, where it was held for the next 32 000 steps, and finally decayed exponentially to zero. The weights of the feature encoder were frozen for the first 10 000 steps of the fine-tuning. §.§ Fine-tuning Datasets We experimented with three datasets described in detail in the rest of this section. The statistics about individual datasets are tabulated in Tab. <ref>. §.§.§ CommonVoice The CommonVoice dataset is a Slovak portion of the crowdsourced project Mozilla Common Voice <cit.>. We used corpus version 13.0, containing 20 hours of validated speech. We decided to keep also sentences reported as difficult pronunciation in our training data. All other reported sentences (e.g., grammar or spelling, different language etc.) were ignored. §.§.§ VoxPopuli The VoxPopuli dataset <cit.> is a large-scale multilingual speech corpus collected from 2009-2020 European Parliament event recordings. The Slovak portion contains 12.1 thousand unlabeled hours and 35 hours with transcription. We ignored all train and development utterances without the raw transcription, decreasing the amount of transcribed data to 32.8 hours. §.§.§ MALACH The Malach Archive preserves the memories of Holocaust survivors through audiovisual interviews in 32 languages. The recordings are characterized by natural speech with emotional outpourings and heavy accents due to the advanced age of the speakers (around 75 years old). Transfer learning can significantly increase recognition accuracy for such type of data, as it is difficult to find additional suitable data for acoustic modeling due to the nature of the corpus (more details can be found in <cit.>). The Czech portion of the Malach data was released by the LDC in 2014 <cit.>, comprising 400 randomly selected testimonies for training acoustic models. However, due to the manual transcription of only 15-minute segments of each testimony, the acoustic modeling process had access to only 100 hours of Czech speech data. Theoretically, the available data could contain up to 800 speakers. The Slovak section of the Malach corpus was transcribed similarly to the Czech section, with 15-minute segments of 400 testimonies transcribed for training. Additionally, 20 testimonies (10 men and 10 women) were fully transcribed to create the development and test portions of the Slovak corpus. In order to maintain consistency with other corpora and ensure a manageable test size, the size of the test set was limited to a reasonable level. A carefully selected subset of the transcribed data consisting of 500 sentences was utilized. To enhance the reliability of the results, all segments containing crosstalks were deliberately excluded from the test set, as they could potentially impact the findings. Therefore, this subset consisted only of continuous segments where either the survivor or the interviewer spoke, with no interruption or overlap from the other speakers. §.§ Decoding When transcribing the speech from fine-tuned models, we experimented with two decoding strategies: (1) using only the fine-tuned Wav2Vec model as a stand-alone end-to-end speech recognizer and (2) CTC beam search decoder using additional language information from a language model (LM) during the decoding. The decoding with strategy (2) usually improves speech recognition performance by bringing useful language information into the decoding process while penalizing improbable outputs in the target language. For strategy (2), we trained one large-scale general-purpose n-gram LM to be used in all experiments for all datasets. As training data, we used web pages from the Common Crawl project[<https://commoncrawl.org>]. We downloaded and processed 34 crawls from August 2018 to October 2021 following the same cleaning and deduplicating rules as in the English C4 dataset <cit.>. Together, we collected about 37GB of cleaned and deduplicated Slovak text containing 5.6 billion words from more than 16 million web pages. To keep the LM of a practical size, we pruned all unigrams with counts lower than ten and higher-order n-grams with counts lower than 100. We trained the LM in lowercase as all fine-tuning transcripts were converted into lowercase. The final LM contained 2.5 million unigrams and 12 million n-grams in total. We used <cit.> toolkit to train the LM and [<https://github.com/kensho-technologies/pyctcdecode>] tool to decode transcripts. §.§ Evaluation We compared models in terms of word error rate (WER). Since all transcripts were cleaned from punctuation and cast into lowercase before the fine-tuning, our fine-tuned models cannot predict punctuation or upper-cased characters, so we did not consider casing and punctuation differences with the reference as errors. Note that although our models are not able to predict cased transcriptions nor punctuation, which usually makes the transcript difficult to read, we are, in all relevant applications, applying also a postprocessing phase on generated transcripts, in which a specially trained transformer-based large language model restores the casing and punctuations in the transcripts. We found this approach more beneficial than training the Wav2Vec models to predict directly cased words and punctuation for two reasons: (1) the text-based language model is more accurate in this task as it can work with larger context and have a better understanding of the syntax and semantics of the spoken words, and (2) the training of Wav2Vec models is less confusing because both cased words and punctuation tokens do not correspond to any distinguishable acoustic units and yet, they would have different target labels. § RESULTS The results of our experiments are tabulated in Tab. <ref> (results with stand-alone Wav2Vec models) and Tab. <ref> (results with Wav2Vec models using the language model in the decoder). When comparing corresponding values from both tables, we can confirm that including LM from Common Crawl into the CTC decoder significantly improves the ASR results for all models across all datasets. In the first row of both tables, we show the results of the Czech model fine-tuned on the Slovak datasets. When compared with results in the second row from the Slovak model , we can clearly see the Slovak model is better (which is expected), but moreover, we see that the difference is, in many cases, not so large (from 0.5% to 3.2% in terms of absolute WER reduction). This closeness confirms that Czech and Slovak have a lot in common, and we could get a reasonably good Slovak ASR system just by fine-tuning the Czech pre-trained model on a small amount of Slovak labeled speech. The larger the fine-tuning dataset is, the smaller the difference between the performance of the Czech and Slovak pre-trained models is. Now, let's concentrate on the differences between the second row (Slovak model pre-trained from scratch from the Slovak-only speech) and the third row (Slovak model initialized from the Czech model before pre-training). For two datasets (VoxPopuli and MALACH), we can observe a small but consistent decrease in WER gained by this transfer learning. However, for the CommonVoice dataset, we got the best results (among the base-sized models) from the pure Slovak model. After an analysis of the errors, we believe this is caused by an insufficient amount of training data. There are just 14.2 hours of labeled Slovak speech in the training CommonVoice dataset. We observed many Czech forms of Slovak words in the transcripts from the model fine-tuned on the CommonVoice dataset, indicating that the model still has a lot of the original Czech-related knowledge even after the transfer to Slovak and that this amount of train labeled data is not enough to override the Czech-related knowledge in the model. The multilingual scored the best result among all models on the CommonVoice dataset. We attribute this result to the fact that it was pre-trained on the whole CommonVoice dataset containing 7 thousand hours containing similar sentences (the domain of CommonVoice is a read speech primarily from Wikipedia sentences) in various languages. Thus, the pre-trained embeddings could better encode information in this dataset than other models, where the CommonVoice dataset was only a very small part of the pre-training corpus. However, although more than 3× larger, it did not perform better on the other two datasets, for which our smaller monolingual models performed slightly (VoxPopuli dataset) or significantly (MALACH dataset) better. Finally, the results from the Whisper model are far from all fine-tuned models. Although this model was not directly fine-tuned on the target datasets, CommonVoice and VoxPopuli datasets were a part of the huge labeled training dataset of the model. These results, which correspond to the reported results in <cit.>, suggested that general-purpose models – even the huge ones – do not always perform well on low-resources languages and tasks. To sum up our results, the transfer learning between Czech and Slovak is, in most cases, beneficial, and the more labeled data for the target domain there is, the more we can benefit from this transfer by reusing the knowledge common to both languages. We also showed that monolingual models pre-trained on a single language can successfully compete with the much larger multilingual models. § CONCLUSION In this paper, we compared several methods of training the Slovak ASR models and evaluated the models on three Slovak datasets. Our results showed that the proposed transfer learning approach from the Czech pre-trained model can bring significant reduction in terms of speech recognition WER, especially when the fine-tuning dataset is large enough. Our base Wav2Vec 2.0 models performed better on two datasets (including the extremely important MALACH dataset) than 3× larger Facebook's XLS-R model and much better on all three datasets than 16× larger OpenAI's Whisper model. Since such a reduction of the model size while preserving or improving the performance could save a lot of energy required for the inference, we release the pre-trained Slovak model publicly for the research community. §.§.§ Acknowledgments. This research was supported by the Ministry of the Interior of the Czech Republic, project No. VJ01010108. Computational resources were provided by the e-INFRA CZ project (ID:90254), supported by the Ministry of Education, Youth and Sports of the Czech Republic. splncs04
http://arxiv.org/abs/2306.04773v1	20230607204221	The Temperature, Electron, and Pressure Characteristics of Switchbacks: Parker Solar Probe Observations	[ "Jia Huang", "Justin C. Kasper", "Davin E. Larson", "Michael D. McManus", "Phyllis Whittlesey", "Roberto Livi", "Ali Rahmati", "Orlando M. Romeo", "Mingzhe Liu", "Lan K. Jian", "J. L. Verniero", "Marco Velli", "Samuel T. Badman", "Yeimy J. Rivera", "Tatiana Niembro", "Kristoff Paulson", "Michael L. Stevens", "Anthony W. Case", "Trevor A. Bowen", "Marc Pulupa", "Stuart D. Bale", "Jasper S. Halekas" ]	physics.space-ph	[ "physics.space-ph", "astro-ph.SR", "physics.plasm-ph" ]	Jia Huang [email protected] 0000-0002-9954-4707]Jia Huang Space Sciences Laboratory, University of California, Berkeley, CA 94720, USA. 0000-0002-7077-930X]Justin C. Kasper BWX Technologies, Inc., Washington DC 20001, USA. Climate and Space Sciences and Engineering, University of Michigan, Ann Arbor, MI 48109, USA 0000-0001-5030-6030]Davin E. Larson Space Sciences Laboratory, University of California, Berkeley, CA 94720, USA. 0000-0001-6077-4145]Michael D. McManus Space Sciences Laboratory, University of California, Berkeley, CA 94720, USA. 0000-0002-7287-5098]Phyllis Whittlesey Space Sciences Laboratory, University of California, Berkeley, CA 94720, USA. 0000-0002-0396-0547]Roberto Livi Space Sciences Laboratory, University of California, Berkeley, CA 94720, USA. 0000-0003-0519-6498]Ali Rahmati Space Sciences Laboratory, University of California, Berkeley, CA 94720, USA. 0000-0002-4559-2199]Orlando Romeo Space Sciences Laboratory, University of California, Berkeley, CA 94720, USA. 0000-0003-2981-0544]Mingzhe Liu LESIA, Observatoire de Paris, Université PSL, CNRS, Sorbonne Université, Université de Paris, 5 place Jules Janssen, 92195 Meudon, France. 0000-0002-6849-5527]Lan K. Jian Heliophysics Science Division, NASA Goddard Space Flight Center, Greenbelt, MD 20771, USA 0000-0003-1138-652X]Jaye L. Verniero Heliophysics Science Division, NASA Goddard Space Flight Center, Greenbelt, MD 20771, USA 0000-0002-2381-3106]Marco Velli Department of Earth, Planetary and Space Sciences, University of California, Los Angeles CA 90095, USA 0000-0002-6145-436X]Samuel T. Badman Center for Astrophysics \| Harvard & Smithsonian, Cambridge, MA 02138 USA. 0000-0002-8748-2123]Yeimy J. Rivera Center for Astrophysics \| Harvard & Smithsonian, Cambridge, MA 02138 USA. 0000-0001-6692-9187]Tatiana Niembro Center for Astrophysics \| Harvard & Smithsonian, Cambridge, MA 02138 USA. 0000-0002-5699-090X]Kristoff Paulson Center for Astrophysics \| Harvard & Smithsonian, Cambridge, MA 02138 USA. 0000-0002-7728-0085]Michael Stevens Center for Astrophysics \| Harvard & Smithsonian, Cambridge, MA 02138 USA. 0000-0002-3520-4041]Anthony W. Case Center for Astrophysics \| Harvard & Smithsonian, Cambridge, MA 02138 USA. 0000-0002-4625-3332]Trevor A. Bowen Space Sciences Laboratory, University of California, Berkeley, CA 94720, USA. 0000-0002-1573-7457]Marc Pulupa Space Sciences Laboratory, University of California, Berkeley, CA 94720, USA. 0000-0002-1989-3596]Stuart D. Bale Physics Department, University of California, Berkeley, CA 94720-7300, USA. Space Sciences Laboratory, University of California, Berkeley, CA 94720, USA. 0000-0001-5258-6128]Jasper S. Halekas Department of Physics and Astronomy, University of Iowa, Iowa City, IA 52242, USA. Parker Solar Probe (PSP) observes unexpectedly prevalent switchbacks, which are rapid magnetic field reversals that last from seconds to hours, in the inner heliosphere, posing new challenges to understanding their nature, origin, and evolution. In this work, we investigate the thermal states, electron pitch angle distributions, and pressure signatures of both inside and outside switchbacks, separating a switchback into spike, transition region (TR), and quiet period (QP). Based on our analysis, we find that the proton temperature anisotropies in TRs seem to show an intermediate state between spike and QP plasmas. The proton temperatures are more enhanced in spike than in TR and QP, but the alpha temperatures and alpha-to-proton temperature ratios show the opposite trends, implying that the preferential heating mechanisms of protons and alphas are competing in different regions of switchbacks. Moreover, our results suggest that the electron integrated intensities are almost the same across the switchbacks but the electron pitch angle distributions are more isotropic inside than outside switchbacks, implying switchbacks are intact structures but strong scattering of electrons happens inside switchbacks. In addition, the examination of pressures reveals that the total pressures are comparable through a switchback, confirming switchbacks are pressure-balanced structures. These characteristics could further our understanding of ion heating, electron scattering, and the structure of switchbacks. § INTRODUCTION Parker Solar Probe (PSP) provides unprecedented in situ observations of the solar wind in the inner heliosphere <cit.>. PSP was launched in August 2018, and it has completed 15 orbits by 2023 March, with the deepest perihelion reaching a heliocentric distance of about 0.062 au. <cit.> report that switchbacks, defined as rapid and large magnetic field rotations that last from seconds to hours, are unexpectedly prevalent in the inner heliosphere. Many follow-up studies have revealed further properties of switchbacks <cit.>, posing new challenges to understanding their nature, origin, and evolution. The thermodynamics of switchbacks have not been well understood. The proton temperatures perpendicular (T_⊥ p) and parallel (T_∥ p) to the ambient magnetic field reflect the deviations from the thermal equilibrium in the solar wind plasma. Examining these variations is critical to uncovering the kinetic processes that control the dynamics of the interplanetary medium <cit.>. Temperature anisotropy (T_⊥ p/T_∥ p) arises when anisotropic heating and cooling processes act preferentially in one direction <cit.>, which is validated by observed deviations in T_⊥ p/T_∥ p from adiabatic predictions in solar wind observations <cit.>. In addition, alpha particles are an important component of the solar wind, and alpha-to-proton temperature ratios (T_α/T_p, T_⊥α/T_⊥ p, and T_∥α/T_∥ p) could indicate preferential heating processes of particles. Note that the total temperature of particles is defined as T_i = (2T_⊥ i + T_∥ i)/3, where i represents p and α for proton and alpha, respectively. Currently, <cit.> find that switchbacks show similar T_∥ p inside and outside individual switchbacks. <cit.> indicate that both T_⊥ p and T_∥ p stay unchanged in switchbacks based on the analysis of three-dimensional (3D) proton velocity distribution functions (VDFs). Moreover, <cit.> suggest that T_∥ p enhances while T_⊥ p remains the same in switchbacks patches compared to the ambient solar wind. However, a statistical study comparing thermal states inside and outside switchbacks is still lacking to clarify such debates. The structure of switchbacks may reflect their origin and evolution. Whether a switchback is a single plasma-magnetic field structure with no major differences inside and outside has still not been unequivocally determined. Switchbacks are identified by the spacecraft crossing of magnetic field lines: if switchbacks are formed by the same flux tubes, then the properties of switchbacks should be similar across the structure, a fact that seems to be supported by current observations <cit.>; if on the other hand switchbacks are formed by the folding of magnetic field lines due to overtaking of different plasma streams with shear, or the drag by ejectas or small transients <cit.>, then the plasma on either side of the reversal could be significantly different. Consequently, it is valuable to study the plasma properties in different regions of switchbacks to verify if a switchback is formed by similar flux tubes. In this work, we investigate the thermal characteristics, electron pitch angle distributions, and pressure variations of both inside and outside switchbacks. Following the method of <cit.> and <cit.>, we identify thousands of switchbacks with PSP observations during encounters 1-8 (E1-E8), except for E3 due to data gaps. Based on the analysis of the proton temperature anisotropies and the alpha-to-proton temperature ratios, we investigate whether switchbacks contribute to solar wind heating. With the results on electron pitch angle distributions and pressure variations, we examine the structure of switchbacks. The data is described in Section <ref>. The main observational results and analysis as stated above are included in Section <ref>. The discussion and summary are presented in Section <ref>. § DATA The PSP data used in this work are provided by the Solar Wind Electrons, Alphas, and Protons (SWEAP) instrument suite <cit.> and the FIELDS instrument suite <cit.>. SWEAP has three instruments, including the Solar Probe Cup (SPC) <cit.>, Solar Probe Analyzer for Electrons (SPAN-E) <cit.>, and Solar Probe Analyzer for Ions (SPAN-I) <cit.>. SWEAP measures the velocity distributions of solar wind electrons, protons, and alpha particles <cit.>. FIELDS detects the DC and fluctuating magnetic and electric fields, plasma wave spectra and polarization properties, spacecraft floating potential, and solar radio emissions <cit.>. In this work, we use the magnetic field data from the FIELDS instrument. The electron temperature data and the electron pitch angle distributions are from SPAN-E, and the electron density data are derived from the analysis of plasma quasi-thermal noise (QTN) spectrum measured by the FIELDS Radio Frequency Spectrometer <cit.>. The fitted proton and alpha data from E4 are derived from SPAN-I, and they are used to investigate the alpha-associated characteristics. The proton temperature components in E1 and E2 are derived with the method described in <cit.>, whereas they are retrieved from bi-Maxwellian fitting to the proton spectra observed by SPAN-I from E4. The plasma dataset is further cleaned based on the field of view of the instrument and the deviations of the proton and alpha densities from the QTN electron density according to the neutral plasma state. SPAN-I measures 3D VDFs of the ambient ion populations in the energy range from several eV q^-1 to 20 keV q^-1 at a maximum cadence of 0.437 s, and it has a time of flight section that enables it to differentiate the ion species <cit.>. The details of the fitted proton and alpha data are described in several works <cit.>. However, the SPAN-I measurements used here are from low cadence downlinked data, and the time resolutions of the fitted proton and alpha data are 6.99 s and 13.98 s, respectively <cit.>. The FIELDS instrument collects high-resolution vector magnetic fields with variable time resolutions. The 4 samples per cycle (i.e. 4 samples per 0.874 s) data are used here. § OBSERVATIONS §.§ Switchback Event In this work, we use the 1748 switchbacks identified by our automatic algorithm from E1 to E8 for the following statistical analysis, with the searching method and switchback event lists detailed in <cit.>. Additionally, we note that there are many different definitions of switchbacks based on the comparison of magnetic field rotations regarding the background, and different criteria of the rotation angles are applied <cit.>. Here, the switchbacks identified by our method are required to be fully reversed in the radial magnetic field direction, thus they are somewhat large switchbacks. Figure <ref> shows an example of the switchback observed on 2021 January 18 during E7. From top to bottom, the panels show the magnetic field components in RTN coordinates, the variations of the radial magnetic field component (B_R) to the total magnetic field strength (\|B\|) (i.e. B_R/\|B\|), the normalized pitch angle distributions of suprathermal electrons (E-PADs), the anisotropy of E-PADs (A_E) at the energy of 346.5 eV, the integrated intensity of suprathermal electrons (F_E) at the energy of 346.5 eV over all pitch angles, the normalized pressure components (thermal pressure P_k, magnetic pressure P_B, total pressure P_total), the proton temperature components (T_⊥ p in red and T_∥ p in blue), and the alpha-to-proton temperature ratio (T_α/T_p). Following the method of <cit.>, we separate an individual switchback into five parts: leading/trailing quiet period (LQP/TQP), leading/trailing transition region (LTR/TTR), and spike. As described in <cit.>, we identify the different parts of an individual switchback in negative (positive) magnetic sectors with the following criterion: the spike interval satisfies -(+)B_R/\|B\|<0.25, the quiet region complies with -(+)B_R/\|B\|>0.85, and the transition region includes all data between these thresholds. Therefore, the spike is generally characterized by a fully magnetic field reversal, as shown by the blue-shaded region, where B_R/\|B\| changes polarity while the dominant E-PADs stay in the same direction. The two gray-shaded regions represent the LQP and TQP, which are quiet ambient solar wind of switchbacks. Between the quiet periods and the spike locate the transition regions where the magnetic field rotates from the quiet period to the spike or vice versa, and they usually contain large-amplitude fluctuations. In general, we select comparable intervals for the five parts of switchbacks, but it varies for each event as described in <cit.>. Furthermore, QP (TR) means the combined region of LQP (LTR) and TQP (TTR) in the following. Panels (c) to (e) present the electron features. The E-PADs anisotropy (A_E) in panel (d) and intensity (F_E) in panel (e) are derived from the E-PADs in panel (c). The E-PADs intensity is the integrated electron intensity over all pitch angles, and we follow <cit.> to define it as: F_E = ∑j_i sinθ_i where j_i is the electron differential flux in each pitch angle, and θ_i is the pitch angle. The variations of F_E imply the changes of source regions of the magnetic field lines, thus we can use this parameter to check if the switchbacks are different or not through the crossing. In addition, the E-PADs anisotropy measures the anisotropy of electron intensity at different pitch angles, and we follow <cit.> to define it as: A_E = log(∑(j_N - <j_N>)^2/∑j_N) where j_N = j_i/<j>, and <j> is the mean flux across all pitch angles. The A_E measures the anisotropic distributions of electrons at different pitch angles, which associates with the pitch angle scattering of electrons <cit.>, because the E-PADs are generally aligned well along the magnetic field lines (i.e. 0 or 180 degrees depending on polarity). Therefore, A_E is generally a negative value, and smaller A_E means more isotropic E-PADs. From this figure, we can see that the E-PADs show more isotropic distribution and larger intensity in the spike than the transition region and quiet period in this switchback. Panel (f) shows the normalized pressures in this switchback. The magnetic field pressure is defined as P_B = B^2/2μ_0, the thermal pressure is the sum of the proton, alpha, and electron pressures P_k = n_p k_B T_p + n_α k_B T_α + n_e k_B T_e, and the total pressure P_tot = P_B + P_k. μ_0 and k_B denote the vacuum magnetic permeability and Boltzmann constant, respectively. The total pressure and components are calculated with the best-selected data from encounters 1 to 12. As a consequence, we can derive their radial evolution indices with a power law function, and then normalize them to 20 solar radii for comparison. The method and radial evolution indices are presented in <cit.>. In this figure, we can see the normalized P_B, P_k, and P_total are almost the same through the switchback. Panel (g) displays the variations of T_⊥ p and T_∥ p, and panel (h) gives the T_α/T_p fluctuations. For this switchback event, we can see that all three parameters show some variations, implying the thermal states could be different inside and outside switchbacks. §.§ Proton Temperature components Temperature anisotropy indicates thermal states of solar wind and infers associate thermodynamic processes <cit.>, thus it is valuable to study the temperature anisotropy variations in switchbacks. In Figure <ref>, we present T_⊥ p/T_∥ p versus parallel proton plasma beta (β_∥ p = 2μ_0 n_p k_B T_∥ p/B^2) in different regions of switchbacks. In panels (a) to (c), the red, cyan, blue, and brown dashed lines represent mirror, ion-cyclotron, parallel firehose, and oblique firehose instabilities, respectively, with the thresholds from <cit.>, whereas the black solid line indicates the anti-correlations between T_⊥ p/T_∥ p and β_∥ p of proton core population, which was first derived from fast solar wind with Helios observations by <cit.>. Panel (d) presents the histogram distributions of T_⊥ p/T_∥ p in the three regions. From Figure <ref>, we can see that the plasma is well limited by the instabilities in different regions of switchbacks, indicating the switchbacks are mostly thermal stable. Moreover, panel (d) shows that the temperature anisotropies peak at around 1 in different regions, but the spike has more isotropic temperatures than TR and QP. In addition, the T_⊥ p/T_∥ p - β_∥ p distributions further reveal some features. First, spike and TR have more plasma with large β_∥ p than QP region, indicating the parallel temperatures are more enhanced in spike and TR, which is consistent with previous results <cit.> and also supported by our quantitative analysis in following Table <ref>. Second, spike and TR have more isotropic population (T_⊥ p/T_∥ p∼ 1) than QP region, denoting the perpendicular temperatures are also more enhanced in spike and TR, which implies the protons in spike and TR are more heated. Third, TR seems to have two populations, whereas the isotropic one dominates in spike and the anisotropic one dominates in QP, indicating the TR may stay at an intermediate state between spike plasma and QP plasma, inferring the TR could be active sites for energy transformations. In Figure <ref>, we quantitatively compare the enhancement of temperature components in TR and QP with that in spike. For each temperature component, we calculate the median value in each region of an individual switchback, compute the difference ratio between two different regions, and then derive the occurrence rate of the difference ratios. Here, we define the ratio of temperature component T_i between two regions as R_T_i^R1/R2 = R_T_i^R1/R_T_i^R2, where T_i includes T_p, T_⊥ p, and T_∥ p, and R_T_i^R1 and R_T_i^R2 represent the median value of T_i in region 1 (R1) and in region 2 (R2), respectively. Panels (a) to (c) show the occurrence rate histograms of the difference ratios for T_p, T_∥ p, and T_⊥ p, respectively. In each panel, the black (red) histogram shows the comparisons between TR (QP) and spike. Consequently, we list the mean value and standard deviation (1σ) of R_T_i^R1/R2 along with the percentage of R_T_i^R1/R2 < 1 in Table <ref>. From this table, we can see that R_T_p^TR/Spike is 0.889±0.136, and 83.6% of the ratios are smaller than 1, thus the results are of significance to suggest that T_p is more enhanced in spike than TR. Similarly, the mean values of the difference ratios are 0.892±0.162 and 1.034±0.243 for QP/Spike and TR/QP, respectively, whereas the corresponding percentages of R_T_p^R1/R2 < 1 are 75.0% and 47.0%. These results indicate that T_p is more enhanced in spike than both TR and QP, and it is slightly more increased in TR than QP. Similarly, the mean values of R_T_∥ p^R1/R2 are 0.792±0.267, 0.796±0.316, and 1.119±0.456, and the percentages of R_T_∥ p^R1/R2 < 1 are 85.0%, 80.6%, and 45.9% for TR/Spike, QP/Spike, and TR/QP, respectively. Moreover, the mean values of R_T_⊥ p^R1/R2 are 0.940±0.139, 0.944±0.158, and 1.016±0.188, and the percentages of R_T_⊥ p^R1/R2 < 1 are 72.6%, 70.8% and 47.3% in the three regional ratios. Therefore, the results indicate that all of T_p, T_∥ p and T_⊥ p are more enhanced in spike than both TR and QP, and their enhancements in TR are slightly larger than that in QP. In addition, we can see that T_⊥ p differences between the three regions are relatively smaller than T_∥ p, implying the T_⊥ p/T_∥ p in spike is generally smaller than that in TR and QP, which is consistent with the above analysis of Figure <ref>. We therefore find that inside switchbacks, the proton temperature is enhanced and this enhancement primarily is driven by parallel heating with a relatively smaller amount of perpendicular heating. \|c\|c\|c\|c\|c\| The temperature comparisons between different regions of switchbacks. 30 1 750 pt 2\|c\| 1c\|TR/Spike 1c\|QP/Spike 1c\|TR/QP T_p Mean ± σa 0.889±0.136 0.892±0.162 1.034±0.243 R_T_p^R1/R2 < 1b 83.6% 75.0% 47.0% T_∥ p Mean ± σ 0.792±0.267 0.796±0.316 1.119±0.456 R_T_∥ p^R1/R2 < 1 85.0% 80.6% 45.9% T_⊥ p Mean ± σ 0.940±0.139 0.944±0.158 1.016±0.188 R_T_⊥ p^R1/R2 < 1 72.6% 70.8% 47.3% T_α/T_p Mean ± σ 1.305±0.480 1.342±0.725 1.058±0.534 R_T_α/T_p^R1/R2 < 1 19.2% 26.4% 50.9% T_∥α/T_∥ p Mean ± σ 1.724±1.173 1.772±1.266 1.129±1.585 R_T_∥α/T_∥ p^R1/R2 < 1 23.3% 27.8% 52.3% T_⊥α/T_⊥ p Mean ± σ 1.220±0.424 1.263±0.765 1.095±0.627 R_T_⊥α/T_⊥ p^R1/R2 < 1 34.2% 36.1% 49.5% T_α Mean ± σ 1.132±0.327 1.159±0.595 1.097±0.832 R_T_p^R1/R2 < 1 39.7% 44.4% 49.5% T_∥α Mean ± σ 1.270±0.810 1.220±0.711 1.092±0.564 R_T_∥ p^R1/R2 < 1 42.5% 41.7% 52.0% T_⊥α Mean ± σ 1.132±0.353 1.180±0.737 1.096±0.622 R_T_⊥ p^R1/R2 < 1 43.8% 45.8% 50.9% aThe mean value and standard deviation (1σ) of R_T_i^R1/R2 bThe percentage of R_T_i^R1/R2 smaller than 1.0 §.§ Alpha-to-proton temperature ratios The variations of alpha-to-proton temperature ratios are pivotal to understanding the competing heating processes of protons and alpha particles. At 1 au, T_α/T_p distributions show two peaks at about 1.0 and about 4.0 <cit.>, indicating alpha particles have either similar temperature or similar thermal speed as protons. However, T_α/T_p was predicated to peak only at around 5.4 due to the collisional thermalization of protons and alpha particles in the near-Sun environment <cit.>. Therefore, investigating the alpha-to-proton temperature variations in switchbacks could help understand whether switchbacks contribute to alpha heating. Figure <ref> shows the occurrence rates of T_α/T_p in different regions of switchbacks in panel (a) and the cumulative distribution function (CDF) in panel (b). From panel (a), we can see that T_α/T_p peaks at around 8.0 in all regions of switchbacks along with the rest of solar wind without switchbacks (not shown), which is larger than the predication by <cit.>, implying the generally stronger heating of alpha particles in the inner heliosphere. Additionally, both panels indicate that the spike has more small T_α/T_p values but less large T_α/T_p values as compared with QP, whereas TR displays an intermediate state between spike and QP in alpha thermodynamics. Furthermore, Figure <ref> and Table <ref> also show the differences of T_α/T_p and its components in different switchback regions. The table displays that the mean value and standard deviation of R_T_α/T_p^R1/R2 is 1.305±0.480, 1.342±0.725, and 1.058±0.534 for TR/Spike, QP/Spike and TR/QP, respectively, and the corresponding percentages of R_T_α/T_p^R1/R2 < 1 are 19.2%, 26.4% and 50.9%, which are also clearly visualized from Figure <ref>. Though the σ is relatively large, the comparisons suggest that T_α/T_p is generally larger in TR and QP than spike, and TR has comparable T_α/T_p as QP. Moreover, T_∥α/T_∥ p and T_⊥α/T_⊥ p show similar results, indicating that the two components are also larger in TR and QP than in spike, and TR and QP have comparable enhancements. These results are consistent with the variations in alpha temperatures as shown in the same table, suggesting the alpha temperatures are relatively larger in TR and QP than in spike. Therefore, the QP and TR regions of switchbacks show larger enhancements of alpha-to-proton temperatures than spike, which is opposite to proton temperature features, implying QP and TR could be more favorable for alpha particle heating in comparison with spike regions. §.§ Electron Pitch Angle Distributions \|c\|c\|c\|c\|c\| The E-PADs comparisons between different regions of switchbacks. 30 2 750 pt 2\|c\| 1c\|TR/Spike 1c\|QP/Spike 1c\|TR/QP A_E (mean) Mean ± σ 0.865±0.329 0.750±0.269 1.219±0.350 R_A_E^R1/R2 < 1 76.3% 83.9% 30.3% A_E (median) Mean ± σ 0.857±0.334 0.768±0.263 1.168±0.366 R_A_E^R1/R2 < 1 74.8% 85.1% 24.1% F_E (mean) Mean ± σ 1.002±0.008 1.003±0.009 0.999±0.005 R_F_E^R1/R2 < 1 43.5% 38.8% 58.5% F_E (median) Mean ± σ 1.002±0.009 1.003±0.010 0.999±0.007 R_F_E^R1/R2 < 1 38.9% 36.7% 57.7% E-PADs are essential to investigate magnetic field geometry, which is important to understand the structure of switchbacks. Current observations mainly support that the switchback is an intact structure that has no big difference based on the studies of, for example, cross helicity <cit.>, proton core parallel temperature <cit.>, perpendicular stochastic heating rates <cit.>, alpha fluctuations <cit.> inside and outside of switchbacks. In this section, we further check whether the electron signatures also accord with the above conclusion. A_E measures the isotropization of the electron fluxes in different pitch angles. In general, the electron fluxes are highly anisotropic and aligned along the magnetic field lines, i.e. electron fluxes are concentrated on pitch angle 0^o or 180^o. The E-PADs become isotropic when electron scattering happens or the magnetic field line disconnects from the Sun (i.e. heat flux dropout). Therefore, the A_E characteristics could help infer the electron-associated processes in switchbacks. Figure <ref> shows the comparisons of A_E (panels (a) and (b)) and F_E (panels (c) and (d)) between different regions of switchbacks. Panels (a) and (b) compare A_E between different regions of switchbacks with mean values and median values to calculate the regional difference ratios, respectively. According to the definition, A_E are negative values, and a larger value means more anisotropic E-PADs, as shown in Figure <ref>(d). From the two panels, we can see that both TR and QP have more R_A_E^R1/R2<1 values than the spike, and the occurrence rate shows a wide spread around 1. With the mean values derived from each region, Table <ref> shows that the mean value and standard deviation of R_A_E^R1/R2 is 0.865±0.329, 0.750±0.269, and 1.219±0.350 for TR/Spike, QP/Spike and TR/QP, respectively, and the corresponding percentages of R_A_E^R1/R2 < 1 are 76.3%, 83.9% and 30.3%. The results are very similar when median values are used, as shown in the table. As a consequence, in comparison with spike, TR and QP are more anisotropic, with QP being even more anisotropic than TR. The result suggests that the electrons could be heavily scattered inside the switchbacks, but the scattering mechanism, which may relate to instabilities, turbulence, wave-particle interactions, or magnetic field fluctuations, is unknown. This conclusion is also supported by the latest work of <cit.>. F_E is believed to associate with the source regions of the footpoints of magnetic field lines, and its variations indicate the possible change of source regions or disconnection of magnetic field lines <cit.>. Furthermore, <cit.> suggests that the switchbacks could be formed based on the so-called super-Parker spiral scenario, which is evolved by the magnetic field footpoints walking from the source of slow wind to faster wind. Thus, the variations of F_E could help to investigate if the switchback structures are intact and to test whether the super-Parker spiral theory works. Panels (c) and (d) in Figure <ref> present the F_E variations in different regions of switchbacks. From the two panels, we can see that nearly all of the difference ratios fall in the range between 0.95 and 1.05, indicating the intensities are almost the same in different parts of switchbacks. This is further verified by Table <ref>, which shows the mean values of regional ratios are very close to 1.0 and the 1σ deviations are less than 1% of the mean values. Therefore, the results suggest that the electron intensities inside and outside of switchbacks are nearly the same, which is consistent with previous results that the switchbacks should be intact structures <cit.>. However, the F_E doesn't change inside and outside individual switchbacks may not support the super-Parker spiral scenario <cit.>, because we should, under such conditions, have a large chance to observe the differences when the footpoint of a switchback changes source region. §.§ Pressures <cit.> study a patch of switchbacks and indicate they are pressure-balanced structures. In this section, we investigate the pressure features across the individual switchback based on statistical analysis. Figure <ref> shows the comparisons of pressures in different regions of switchbacks with the same format as Figure <ref>. Panels (a) to (c) compare the normalized P_K, P_B, and P_total between different regions of switchbacks with the mean value in each switchback region used to calculate the difference ratios, respectively. Panels (d) to (f) show the same histograms but the median values are used to derive the ratios. In table <ref>, we present the mean value and 1σ deviation of the difference ratios for each pressure component. From both the figure and the table, we can see that the occurrence rates of the difference ratios are similar no matter the mean or median values are used. Moreover, our results show that P_K decreases slightly while P_B increases slightly in both TR and QP as compared with the spike, and TR and QP have very similar P_K and P_B. However, P_total in different regions of switchbacks are comparable with uncertainties being smaller than 10%. Therefore, the individual switchbacks should also be pressure-balanced structures, suggesting they are in balance with the patch wind outside as concluded by <cit.>, which further implies that the switchbacks may be formed near the Sun and are well-evolved with the ambient solar wind to retain the balanced pressures. \|c\|c\|c\|c\|c\| The pressure comparisons between different regions of switchbacks. 30 3 750 pt 2\|c\| 1c\|TR/Spike 1c\|QP/Spike 1c\|TR/QP P_K (mean) Mean ± σ 0.927±0.157 0.897±0.167 1.040±0.133 P_K (median) Mean ± σ 0.921±0.175 0.892±0.168 1.039±0.159 P_B (mean) Mean ± σ 1.069±0.552 1.104±0.722 0.986±0.097 P_B (median) Mean ± σ 1.048±0.432 1.107±0.894 0.985±0.127 P_total (mean) Mean ± σ 0.965±0.136 0.953±0.142 1.011±0.061 P_total (median) Mean ± σ 0.956±0.104 0.948±0.106 1.009±0.067 § DISCUSSION AND SUMMARY In this work, we have investigated the temperatures, electron pitch angle distributions, and pressure variations inside and outside switchbacks. The major results are summarized in the following. * The distributions of proton temperature anisotropy suggest that TR has two populations, whereas the isotropic population dominates in spike and the anisotropic population dominates in QP, indicating the TR may stay at an intermediate state between spike plasma and QP plasma. * The analysis of proton temperature components indicates that all of T_p, T_∥ p, and T_⊥ p are more relatively enhanced in spike than in both TR and QP regions, with the enhancements in TR being slightly larger than that in QP. However, the alpha-to-proton temperature ratios are larger in TR and QP than in spike, and similar trends are found in alpha temperatures, which are opposite to the proton temperature features. These results suggest that the preferential heating mechanisms of protons and alphas are competing in different regions of switchbacks. * The investigation of E-PADs shows that the A_E are more anisotropic in TR and QP than in spike regions, but the F_E are almost the same inside and outside switchbacks. The results imply that the electrons could be heavily scattered inside switchbacks, but the constant F_E indicates that the switchbacks could be intact structures, which is consistent with previous results. * The examination of pressures reveals that P_total in different regions of switchbacks are comparable. However, P_K decreases slightly while P_B increases slightly in both TR and QP as compared with the spike regions, and TR and QP have very similar P_K and P_B. Therefore, the individual switchbacks should also be pressure-balanced structures, the individual switchbacks should also be pressure-balanced structures, which further implies that the switchbacks may be formed near the Sun and are well-evolved with the ambient solar wind to retain the balanced pressures. At last, we briefly discuss the heating of protons and alphas by switchbacks. In combination with the proton and alpha temperature variations, we can see that the alpha particles are more heated in TR and QP than in spike regions, but the protons show the opposite feature, whereas the TR region indicates an intermediate state between QP and spike. These characteristics imply that the preferential heating mechanisms of protons and alphas are competing in different regions of switchbacks. In general, the alpha particles are preferentially heated via Alfvén-cyclotron dissipation when the alpha-to-proton differential flow normalized by local Alfvén speed is close to zero, whereas the protons are more heated when the differential flow increases <cit.>, and the heating efficiency is also related to β_∥ p <cit.>. As shown in <cit.>, the alpha-to-proton differential speeds in different regions of switchbacks are predominantly low, implying the switchbacks should be favorable for the heating of alpha particles. Moreover, Figure <ref> shows the β_∥ p varies in a wide range in switchbacks, thus the heating efficiency could vary in different regions. Further, <cit.> suggest that there are numerous small-scale current sheets in switchbacks due to magnetic braiding, and the relaxation of these microstructures could provide the energy to heat ambient solar wind. Therefore, the alpha-to-proton temperatures increase more in TR and QP than in spike regions implying that the relaxation of small-scale current sheets may start from outside switchbacks, which is reasonable due to fewer small-scale current sheets existing in QP and TR than in spike regions. However, the opposite proton variations are difficult to explain, but the TR stays in an intermediate state between QP and spike may suggest that the protons and alphas transfer energies between QP and spike regions probably through proton-proton, alpha-alpha, and alpha-proton collisions. The collisions may further modify the temperature anisotropies and alpha-to-proton temperature ratios. Therefore, a more detailed quantitative analysis is valuable to figure out the competing heating mechanisms of protons and alphas in different regions of switchbacks. Parker Solar Probe was designed, built, and is now operated by the Johns Hopkins Applied Physics Laboratory as part of NASA’s Living with a Star (LWS) program (contract NNN06AA01C). Support from the LWS management and technical team has played a critical role in the success of the Parker Solar Probe mission. Thanks to the Solar Wind Electrons, Alphas, and Protons (SWEAP) team for providing data (PI: Justin Kasper, BWX Technologies). Thanks to the FIELDS team for providing data (PI: Stuart D. Bale, UC Berkeley). J. H. is also supported by NASA grant 80NSSC23K0737. L. K. J. is supported by LWS research program. aasjournal
http://arxiv.org/abs/2306.07901v1	20230613165211	A Past Episode of Rapid Tidal Evolution of Enceladus?	[ "Matija Ćuk", "Maryame El Moutamid" ]	astro-ph.EP	[ "astro-ph.EP" ]	Matija Ćuk [email protected] 0000-0003-1226-7960]Matija Ćuk SETI Institute 339 N Bernardo Ave Mountain View, CA 94043, USA 0000-0002-4416-8011]Maryame El Moutamid Cornell Center of Astrophysics and Planetary Sciences Department of Astronomy and Carl Sagan Institute Cornell University 326 Space Science Building Ithaca, NY 14853, USA Saturn possesses a dynamically rich system containing numerous moons and impressive rings. Whether the rings of Saturn are much younger than the planet itself has been a long-open question; more recently a young age has been proposed for some moons. Recent detection of the fast orbital evolution of Rhea and Titan strongly suggest a highly frequency-dependent tidal response of Saturn, possibly through excitation of inertial waves within the planet's convective envelope. Here we show that the resonance locking to inertial waves cannot explain the dynamical structure of the Saturnian system or the current tidal heating of Enceladus. On the other hand, both the observation and our modelling results indicate that the system is not consistent with evolution under equilibrium tides. We propose that the system's architecture can best be explained by relatively high “background” tidal response coupled with discrete resonant modes. In this view, only Titan may be in a true long-term resonance lock with a tidal mode of Saturn. Rhea is most likely currently experiencing a transient period of fast tidal evolution as it passes through a mode, rather than being locked to it. Assuming that Enceladus went through a temporary period of fast tidal evolution, we can reproduce its present resonance with Dione and satisfy other dynamical constraints. Additionally, we conclude that the long-term tidal response of Saturn to Tethys must be weaker than expected from frequency-independent tides, as already found by observations. § INTRODUCTION Before the Cassini mission to Saturn (2004-2017) it was widely thought that the major moons of Saturn (Mimas and larger) are as old as the planet, and that the moons' orbital evolution is driven by equilibrium tides within Saturn. “Equilibrium tides” refers to classical tidal theory described by textbooks like <cit.>, in which there is little or no dependence of tidal dissipation on the orbital frequency of the perturbing moon. These two assumptions constrained the tidal quality factor Q which quantifies tidal dissipation within Saturn to Q > 18,000 (NB: lower Q means higher dissipation), or else Mimas would have been within the rings less than 4.5 Gyr ago <cit.>. The detection of thermal flux of 10-15 GW on Enceladus <cit.> challenged this estimate of the tidal evolution rate. <cit.> showed that, assuming an equilibrium state, tidal heating of Enceladus through its orbital resonance with Dione produces (18,000 / Q) × 1.1 GW. Their result implies that either the tidal Q of Saturn is an order of magnitude lower than 18,000, or the heating of Enceladus is not in equilibrium. The latter explanation of the observations was initially dominant, but the astrometric work of <cit.> suggested a migration rate of most major moons that is an order of magnitude faster than previously estimated. A notable implication of the results of <cit.> was that the tidal Q ≈ 1700, and the tidal heating of Enceladus could be in equilibrium. <cit.>, assuming equilibrium-type tides and a constant tidal Q ≃ 1700 as found by <cit.>, analyzed the orbital histories of the three largest moons interior to Titan: Tethys, Dione and Rhea. <cit.> found that their orbits are consistent with Dione and Rhea crossing their mutual 5:3 mean-motion resonance (MMR) in the past. <cit.> also modeled past passage of Tethys and Dione through their 3:2 MMR and found that this event excites inclinations well above the observed values, implying that this resonance passage did not happen. Assuming Q=1700, this relative dynamical age (i.e. Dione-Rhea 5:3 MMR was crossed in the past, but Tethys-Dione 3:2 MMR was not) translates to an absolute age of the system below about 100 Myr. While the age of Saturn's rings is hotly debated, this result is consistent with the estimate of the rings' age derived by <cit.>. <cit.> concluded that the rings and moons interior to Titan formed in a dynamical instability about 100 Myr ago, in which the previous generation of moons was disrupted in collisions, and then largely re-accreted into the observed satellites. Some of the more recent findings are consistent with a young rings and satellite system. The relatively small mass <cit.> and rapid evolution <cit.> of the rings suggest a relatively young age, but other authors argue that ring pollutants are lost faster than ice, implying an older age <cit.>. It appears that dominant past impactors in the Saturnian system are different from Kuiper Belt objects <cit.>, and are possibly planetocentric <cit.>. This would be consistent with, but would not require, a recent origin of the system. More recently, <cit.> proposed an alternate proposal for a recent cataclysm that originates not in the inner system but in an instability between Titan and a past resonant moon <cit.>; the full consequence of this scenario for the inner moons is still unclear. Since the work done by <cit.>, analysis of the moons' motions using both Earth-based astrometry and Cassini data <cit.> has strongly suggested that the tidal evolution in the Saturnian system is not driven by equilibrium tides. Rhea has been found to migrate outward many times faster than predicted by equilibrium tides, with an orbital evolution timescale of a/ȧ = 6 Gyr. Additionally, <cit.> find that Titan is migrating with a 11-Gyr timescale, but that is disputed by <cit.>, who find a >100 Gyr timescale for Titan's evolution. Both groups agree on the fast evolution of Rhea, ruling out equilibrium tides as the only form of tidal dissipation within Saturn. The pattern of tidal evolution found by <cit.> matches the expectations of resonant locking theory of <cit.>. In this theory, Saturn's tidal response is exceptionally high at certain synodic frequencies, at which the tidal perturbations from the moons are resonant with internal oscillation modes of the planet. If the planet's structure were static, the moons would just quickly evolve through these frequencies without much consequence for their long-term evolution. However, due to changes in the resonant frequencies of the planet, the orbital locations at which a moon is resonant with the planet move outward, pushing the moons along faster than they would move through equilibrium tides <cit.>. If this is true, the moon is evolving due to a “resonance lock” with the planet's interior. Similar migration timescales for multiple moons imply that inertial waves within the planet are the type of oscillation driving the evolution. <cit.> suggest that the rate of tidal evolution for all moons at any time in their history may be given as ȧ/a=(3 t_s)^-1, where t_s is the age of the planet at any time. Orbital evolution of all of Saturn's moons with a uniform relative migration rate rules out mutual MMR crossings; while approximately equal, but not identical, evolution rates would greatly extend the time between any MMR crossings. If this is the mechanism behind the evolution of the Saturnian system, the constraints on its age proposed by <cit.> on the basis of MMRs do not apply. However, MMRs currently present in the system, as well as secular resonances, still need to be reconciled with this hypothesis of parallel orbital evolution. Equilibrium tides that have previously been assumed to dominate orbital evolution of Saturnian satellites have a strong dependence on orbital distance, ȧ/a ∝ a^-6.5 <cit.>. On the other hand, resonant lock produces orbital evolution that is either independent of orbital distance, ȧ/a f(a), in case of locking to inertial waves, or is faster for more distant satellites, ȧ/a ∝ a^3/2, in case of locking to Saturn-frame modes <cit.>. Therefore, it is likely that equilibrium tides would dominate evolution in a zone closer to the planet, while the resonance lock (if present) would dominate evolution of more distant satellites. The exact boundary between these two regimes depends on the strength of the planet's tidal response and the rate at which resonant peaks in tidal response are shifting. Note that the equilibrium tidal evolution rate is directly proportional to the satellite's mass, while resonance lock evolution rate is independent from it, so the distance at which each of the mechanisms dominates will not be the same for moons of all sizes. Additionally, in the innermost zone close to the Saturn's rings, ring-torque driven evolution <cit.> may dominate over all types of tidal evolution. Here we will consider several specific dynamical features of the Saturnian system in the light of potential mechanisms of tidal evolution § CONSTRAINTS ON SATURN'S TIDAL RESPONSE FROM CURRENT TIDAL HEATING OF ENCELADUS Enceladus and Dione are currently locked in a MMR with an argument 2λ_D-λ_E-ϖ_E, where λ and ϖ are the mean longitude and the longitude of pericenter, respectively <cit.>, while subscripts D and E refer to Dione and Enceladus. This resonance keeps the moons' orbital period ratio close to 1:2, and acting to increase the eccentricity of Enceladus over time. Satellite tides within Enceladus act in the opposite direction, damping Enceladus's eccentricity and releasing heat in the process. This tidal dissipation within Enceladus is thought to drive the observed geological activity on Enceladus <cit.>. The amount of heat observed on Enceladus <cit.>, combined with a relatively low eccentricity (e_E=0.005), implies that Enceladus is very dissipative with tidal parameters given by Q/k_2 ≈ 100 (or even smaller if there is more undetected heat), consistent with a fluid response to tides <cit.>. Given that this eccentricity would damp in under 1 Myr, it is natural to assume that the eccentricity of Enceladus is continuously re-excited by the resonance with Dione, so that the eccentricity and the tidal heating are in a long-term equilibrium. In context of equilibrium tides, this would require Q ≈ 1700 for Saturn <cit.>. The dynamics of the tidal heating of Enceladus in the resonance lock scenario is yet to be fully modeled. For the purposes of a MMR between two moons, there are several possible configurations of resonant modes. The simplest case is that only the inner moon is locked with a resonant mode, with the outer moon evolving only due to interaction with the inner. Alternatively, two moons could be locked to two converging modes. Convergent modes, however, are not compatible with a moon-moon resonance, as the inner moon would push the outer moon outward away from its mode, and we are back to the original case of only the inner moon evolving through resonant locking. A third possibility are simultaneous divergent resonant modes, but they would preclude capture into the moon-moon mean-motion resonance, which requires convergent evolution <cit.>. The fourth possibility is also conceivable: two modes evolving in parallel, with the inner moon experiencing stronger torque by being closer to the mode center, while the outer moon is subject to outward acceleration, both from the resonant mode and the perturbations of the inner moon. While this configuration is in principle consistent with a MMR, it is clear that it is sensitively dependent on the moons' locations relative to the resonant modes, and that the stability of this state would need to be investigated in greater detail. Therefore, here we will concentrate on the scenario in which only the inner moon is in resonance lock. It can be shown that a MMR driven by resonance locking of the inner moon alone to inertial modes is not consistent with the present heating rate of Enceladus (assuming an equilibrium). <cit.> show that the power of tidal heating of the inner moon of a resonant pair, assuming no tidal torque on the outer moon and all eccentricities being in equilibrium, is: H = n_E T_E - T_E L_E+L_D( G m_S m_E a_E + G m_S m_D a_D) where T_E is the tidal torque on Enceladus, while L is angular momentum, n is mean motion, a is semimajor axis, m is mass, and G is gravitational constant. Given that the moons are evolving in parallel due to mean-motion resonance lock, the torque has a simple relation to the evolution rate <cit.>: T_E=1 2ȧ a( L_E + L_D) = 1 2 t_a( L_E + L_D) where t_a is the evolution timescale. Substituting this back into Eq. <ref>, and assuming that the angular momentum and energy of Dione are much bigger than those of Enceladus (accurate to about 10%), we get H ≈1 2 t_a( n_E L_D - G m_S m_D a_D) Recognizing that G m_S/a_D^3=n_D^2, n_E ≈ 2 n_D and, for small eccentricities, L_D = m_D a_D^2 n_D, we get: H ≈G m_S m_D 2 t_a a_D = 5 × 10^28 J t_a If we assume t_a=9 Gyr, as proposed by <cit.> as being typical value for orbital evolution due to resonance locking in the Saturnian system, H ≈ 180 GW, more than an order of magnitude in excess of the observed value <cit.>. Therefore it appears that the observed resonance between Enceladus and Dione cannot be maintained by only Enceladus being locked to an inertial wave within Saturn. On the other hand, if the resonance lock evolves uniformly in a reference frame rotating with Saturn, with the dominant semi-diurnal tidal period changing by a constant absolute rate for all satellites <cit.>, steady-state heating of Enceladus will be much lower. The Saturn-frame resonance lock would produce a/ȧ≈ 200 Gyr for Enceladus, based on Titan's evolution timescale of 11 Gyr <cit.> and the ȧ/a ∝ a^3/2 <cit.>. This rate of evolution gives us a steady-state heat flow of about 8 GW for Enceladus, close but below the measured value (which is by itself the lower limit of the real flux). One caveat with this calculation is that we assumed no contribution from equilibrium tides acting on Enceladus and (more importantly) Dione, meaning that Saturn's “background” Q/k_2 ≫ 30,000, or otherwise the tidal heating would be even lower. If we follow recent results of <cit.> who find a possible resonant lock for Rhea but not Titan, the timescale for Enceladus's evolution through resonant lock (assuming divergent modes anchored at Rhea) could be in the 30-40 Gyr range, with the associated tidal heating in the 40-55 GW range. Models of Enceladus's ice shell suggest a heat loss rate in the range 25-40 GW <cit.>, and the total tidal heating rate of Enceladus likely exceeds the measured value (possibly due to distributed tidal heating outside the South Polar Terrain), so there may not be a discrepancy between these predictions and the actual heat production rate. If we assume equilibrium tides and a steady-state, then a Q/k_2=5000 can explain the observed heat flux of Enceladus, as suggested by <cit.>. Note that a combination of inertial wave lock and equilibrium tides can also explain the observed flux, as long as the equilibrium tidal evolution rate of Dione is about 90% of the drift rate of the inertial mode Enceladus is locked to. This complex (but possible) setup still gives us about the same “background” Q/k_2=5000 as the assumption of pure equilibrium tides. The possibility of Enceladus and Dione being locked to two normal modes evolving almost in unison is also conceivable (and would result in lower equilibrium heat flows), but we assess it as less likely. § CONSTRAINTS ON SATURN'S TIDAL RESPONSE FROM ORBITAL RESONANCES §.§ Past 2:1 MMR between the Horseshoe Moons and Enceladus? Janus and Epimetheus are inner moons of Saturn that are currently in a horseshoe orbital configuration which undergoes a reversal every four years <cit.>. Gravitational interactions with Saturn's rings make the width of the “horseshoe” decrease over time, and the timescale for this evolution is on the order of 10^7 yr <cit.>. For our purposes Janus and Epimetheus (and their presumed parent body) are interesting because they are expected to migrate very fast due to ring torques, potentially crossing resonances with other moons. <cit.> estimate that Janus migrates about 40 km/Myr due to ring torques, and the two moons' putative parent body (if they originated in a breakup) would have migrated even faster, at 50 km/Myr. Janus and Epimetheus are about 1500 km exterior to the 2:1 mean-motion resonance with Enceladus. Ignoring the tidal evolution of Enceladus for the moment, it appears that the precursor of Janus and Epimetheus should have crossed this resonance about 30 Myr ago, putting constraints on the age and evolution of the system. We simulated this resonance crossing between coorbitals and Enceladus using numerical integrator simpl, previously used by <cit.>. Enceladus was assumed to be in its present orbital resonance with Dione. At first we assumed that Janus and Epimetheus were in a horseshoe configuration before the resonance, and gave them their present eccentricities and inclinations. Left-hand panels in Fig. <ref> show a typical outcome of such simulations, in which the horseshoe configuration is disrupted and Janus and Epimetheus experience close encounters (our integrator does not test for collisions). This destabilization happens well before the core of the 2:1 resonance with Enceladus is reached, implying that the horseshoe is disrupted by near-resonant perturbations. Next we assumed that the two moons were corbitals before the resonance, but in a Trojan or “tadpole” configuration <cit.> (typical results shown in right-hand side panels of Fig. <ref>). Interestingly, near-resonant perturbations always convert the tadpole configuration into a horseshoe, which is stable from there on. However, the moons are then captured into the 2:1 resonance with Enceladus, in which their eccentricities grew over time while the semimajor axis is locked to that of Enceladus. This eccentricity growth is largely unaffected by any tidal damping, as the small sizes and demonstrably rigid natures of irregularly shaped Janus and Epimetheus do not allow for significant tidal deformation or dissipation over 10^7 year timescales we are interested in. We expect the resonance eventually to break and Janus and Epimetheus to collide. As we expect the moons to have large eccentricities at the time of the collision while their semimajor axes are initially within the resonance with Enceladus, the resulting debris must re-accrete significantly interior to the resonance (due to angular momentum conservation). We also ran a simulation assuming that Janus and Epimetheus were contained within one body during the resonance crossing with Enceladus (which may have subsequently broken up). Our simulations of the 2:1 resonance crossing with Enceladus show that the precursor is always captured in the resonance (Fig. <ref>). Note that we assumed current orbital eccentricity of Janus for the progenitor, and the present-day configuration of the Enceladus-Dione resonance. In most simulations, proto-Janus is captured into a stable corotation resonance in which the eccentricity of Enceladus is slightly higher than equilibrium eccentricity in the resonance with Dione (left-hand panels in Fig. <ref>). In some cases this resonance is broken and proto-Janus is captured into the e_E(i.e. Lindblad) sub-resonance in which the eccentricity of proto-Janus grows over time, like we saw for the initial tadpole configuration. Given the large orbital precession rates of the innermost moons, all resonances are well separated and there is no obvious way of breaking this lock purely through dynamics. However at eccentricities in the 0.05-0.1 range proto-Janus would cross the orbits of Prometheus and Pandora (if they were present at that epoch) or the outer edge of the rings. Resulting collisions would presumably break the resonant lock between proto-Janus and Enceladus. Once again, angular momentum conservation dictates that any re-accretion of proto-Janus's debris happens interior to the resonance with Enceladus. If we assume that the coorbitals were produced in a breakup of a single progenitor, we can use their orbits to constrain the orbit of this progenitor. Using current orbits for the coorbitals, and under assumption of conservation of momentum at separation, we find that pre-breakup parent body of Janus and Enceladus had an eccentricity e ≤ 0.006, much less than expected from the past capture into the 2:1 resonance with Enceladus. Eccentricity can be erased through re-accretion, but as we discuss above, disruption and reaccretion move the resulting new moons interior to the resonance with Enceladus. Therefore, either the tidal evolution of Enceladus has to be comparable with the orbital evolution of the horseshoe pair, or the inner Saturnian system has to be rather young (a combination of these two factors is also possible). If the resonant pair Enceladus and Dione are evolving through equilibrium tides with Q/k_2=5000 for Saturn <cit.>, their joint orbital evolution timescale would be a/ȧ≈ 10 Gyr. Enceladus being locked to an inertial mode would produce the same timescale (even if the amount of tidal heating would be very different, as all of Dione's orbital evolution would now be due to Enceladus). This rate of evolution would only push the resonance with Janus-Epimetheus precursor back to 40 Myr. Locking of Enceladus to a Saturn-frame mode would lead to a a/ȧ≃ 130 Gyr, which would produce negligible migration compared to the ring-torque-driven evolution of the coorbitals' precursor, keeping the apparent age of the resonant encounter at 30 Myr ago. Enceladus's rate of evolution through equilibrium tides (but not resonance locking) depends on its mean-motion resonance with Dione. Before the resonance Enceladus would have had an equilibrium tidal evolution timescale a/ȧ=5 Gyr (assuming Q/k_2=5000 for Saturn), so depending on the age of the Enceladus-Dione resonance, the progenitor-Enceladus resonance would have happened between 40 and 75 Myr ago. <cit.> propose that a model in which equilibrium tides are weak and the moons' orbits evolve solely through resonance locking may result in a long-term stable system. In this model, the moons' orbits are not expected to converge and enter mean-motion resonances with each other. This way dynamical excitation and possible destabilization through MMRs is avoided. The simulations discussed here show that the inclusion of ring torques introduces relatively rapid convergence of the orbits of some of the inner moons. A young age (<50 Myr), at least for the Janus-Epimetheus parent body (JEPB) if not for other moons, appears inevitable. If we assume the presence of both equilibrium tides and resonant tidal response (Section <ref>) the actual maximum age for JEPB may be somewhat older than 75 Myr but difficult to calculate precisely. Also, it appears that the JEPB formed close to its present location, and that the idea that Janus and Epimetheus evolved from the rings smoothly to their present position <cit.> may not be tenable given the apparent impossibility of the pair (or their parent body) crossing the 2:1 resonance with Enceladus. §.§ Establishment of the Current Mimas-Tethys 4:2 Resonance Mimas and Tethys are currently in a 4:2 inclination-type resonance that involves the inclinations of both moons (the resonant argument is 4λ_Θ - 2λ_M - Ω_M - Ω_Θ), where the subscripts M and Θ refers to Mimas and Tethys, respectively. Large libration amplitude of the resonance has in the past been used to suggest that the resonance capture was a low-probability event <cit.>. Our work so far (under the assumption of equilibrium tides) suggests that there are at least two distinct dynamical pathways to resonance capture, both of which require later increase of the resonance argument libration width due to a third body. If the initial inclination of Mimas was very low (i_M ≃ 0.001^∘), lack of capture into the preceding i_M^2 sub-resonance and capture into i_M i_Θ sub-resonance are highly likely events (assuming i_Θ≈ 1^∘ before the resonance). Right-hand panels in Figure <ref> shows a typical capture into the Mimas-Tethys resonance assuming equilibrium tides with Q/k_2=4000 for Saturn. This rate of tidal evolution implies that the current Mimas-Tethys resonance is only 20-25 Myr old, consistent with a relatively young proposed age of the system <cit.>. The physical reason behind the lack of capture into the i_M^2 sub-resonance appears to be non-adiabatic nature of the resonance crossing, as proposed by <cit.>. While the tidal evolution is smooth and slow by most criteria, the extreme narrow width of the i_M^2 sub-resonance at very low inclinations seems to allow for non-resonant crossing. Alternatively, if we assume pre-resonant inclination of i_M=0.1^∘ for Mimas, there is a high probability (about 70%-80%) of missing capture into the i_M^2 sub-resonance, and a similarly high probability of capture into the i_M i_Θ sub-resonance. In this case the resulting libration amplitude of the resonant argument is about 60^∘, still short of the observed one but much larger than in the low inclination limit. In this regime the capture into i_M^2 is unlikely because of large initial inclination <cit.>, while the capture into i_M i_Θ sub-resonance is somewhat more likely due to large i_Θ (also, negative kick to the i_M when crossing i_M^2 also makes the next capture more likely). Figure <ref> shows two of the many simulations we did to study capture into the 4:2 Mimas-Tethys resonance in isolation, meaning that we did not simulate the system's evolution before and after this encounter. Initially we expected the two sub-resonances of the 4:2 MMR (i^2_M and i_M i_Θ) to be the only relevant inclination-type terms of the 2:1 Mimas-Tethys commensurability. Later simulations of the comprehensive recent dynamical history of the system have revealed additional relevant inclination-type resonances. In particular, a third-order harmonic of the 2:1 Mimas-Tethys resonance with the argument 2λ_Θ-λ_M+ϖ_M-Ω_M-Ω_Θ is surprisingly strong, and can lead to capture for low initial inclinations of Mimas (see Fig. <ref>). This sub-resonance (which we designate e_M i_M i_Θ) is encountered well before the i_M^2 and i_M i_Θ sub-resonances shown in Fig. <ref>. The reason for the unexpected strength of e_M i_M i_Θ resonant term are the high inclination of Tethys and eccentricity of Mimas, which we assumed both predate these moons' 4:2 MMR. These assumptions were based on lack of available mechanisms of exciting e_M after the capture into the current 4:2 Mimas-Tethys resonance, and the necessity of large i_Θ for the capture to occur. We find that an initial i_M ≈ 0.1^∘ is necessary in order to avoid capture into the e_M i_M i_Θ sub-resonance. Therefore, while both low- and high-inclination routes to capture into the observed i_M i_Θ resonance are possible in isolation, additional constraints from the e_M i_M i_Θ crossing make the high inclination path the only likely capture mechanism. Captures into resonance shown in Fig. <ref> results in a libration amplitude of the resonant argument that is smaller than observed. In general, we find that that the libration amplitude of the Mimas-Tethys resonance is highly vulnerable to perturbations from other moons (including Enceladus, Sec. <ref>), so this resonance's libration amplitude is less indicative of capture mechanism than previously thought. We note that the difference between the post-capture libration amplitude and the observed value is less pronounced in our preferred high inclination route to Mimas-Tethys 4:2 MMR compared to the low-inclination route. Clearly more detailed study of the system's very recent evolution, accounting for the influence of all the moons (including Tethys's small Trojan companions), is necessary to better understand the evolution of the libration amplitude of the Mimas-Tethys resonance. All hypotheses of the origin of the Mimas-Tethys resonance must include a convergent evolution of these two moons. This convergent evolution is expected in the case of equilibrium tides, but interestingly only in the “constant Q” rather than “constant time-lag" model (as the synodic period of Mimas is relatively long). In case of evolution by both moons being locked to inertial waves there should in principle be no relative orbital evolution, either convergent or divergent, while resonance locking to Saturn-frame modes would result in divergent evolution. If only Mimas is in resonant lock, then a resonance would form and should be about 20 Myr old (in the case of inertial waves) or about 300 Myr old (in case of locking to Saturn-frame modes). Locking of Mimas to a Saturn-frame mode would require a “background” Q ≥ 100,000, as faster equilibrium tidal migration would allow Mimas to “outrun” the mode. Another common assumption in all scenarios on the origin of the Mimas-Tethys resonance require Tethys to have a prior inclination of about i_Θ≈ 1^∘. This relatively large inclination requires some kind of past dynamical interaction with other moons, most likely a resonance. <cit.> have found this inclination to be a plausible consequence of Dione-Rhea 5:3 resonance crossing, followed by the (associated) Tethys-Dione secular resonance. We note that this scenario requires convergent orbital evolution of Dione and Rhea, at least in the past (see Subsection <ref>) §.§ Observed Acceleration of Rhea and the Past 5:3 Dione-Rhea Resonance The orbit of Rhea is directly observed to evolve on 6 Gyr timescale <cit.>. The rate of orbital evolution of Titan may be similarly fast <cit.>, but this is still disputed <cit.>. Observational results for Rhea are clearly not consistent with the expectations based on equilibrium tides. Locking to resonant modes within Saturn has been proposed as an explanation for these observations <cit.>, with the apparent rate of the moon's orbital evolution being determined by the drift in frequency of the resonant peaks in the tidal response of the planet. After Rhea's fast evolution was first observed <cit.>, the assumption that the peaks in tidal response have a constant absolute frequency drift in Saturn's rotating frame <cit.> implied that Titan's own drift timescale should be a/ȧ < 2 Gyr. The observed tidal evolution rate of Titan of 11 Gyr <cit.> would imply that the moons could not both be in resonant lock, or that the resonant mode drift is not constant in the rotating frame. Locking to inertial waves which drift together in an inertial reference frame was proposed instead <cit.>, which should result in the same tidal evolution timescale for all moons in resonant lock. The difference between the apparent evolution timescales for Rhea and Titan reported by <cit.> seems to suggest that moons under resonant lock can still have converging orbits, which would challenge the big picture of <cit.>, in which moons never cross mutual resonances. On the other hand, if Titan has a much slower orbital evolution consistent with equilibrium tides <cit.>, then we can be sure that not all moons are locked to resonant modes. Clearly the dynamics of the system is more complex than predicted in any one simple model. The observed fast evolution of Rhea is at odds with the hypothesis that Dione and Rhea crossed their mutual 5:3 MMR. The Dione-Rhea 5:3 MMR crossing was proposed by <cit.> as a way of producing the current inclinations of Tethys and Rhea. The inclination of Tethys is particularly significant (i_Θ≈ 1^∘) and must have predated Tethys's current resonance with Mimas. As <cit.> show, the Dione-Rhea 5:3 resonance is usually followed by a secular resonance between Tethys and Dione during which Dione “passes” its eccentricity and inclination to Tethys. Therefore there is a compelling reason to think that a past Dione-Rhea 5:3 MMR crossing did take place. The orbital evolution of Rhea therefore presents a conundrum. Its rate is much too fast for equilibrium tides (assuming Q/k_2=5000), but it is also too fast for resonance locking <cit.>. A Saturn-frame mode resonant lock would have a/ȧ≈ 40 Gyr, while resonance lock with inertial modes would predict a/ȧ=11 Gyr, same as Titan. Furthermore, the apparent past crossing of the Dione-Rhea resonance implies that this fast evolution of Rhea is a very recent phenomenon (i.e. over the past several Myr so so). Assuming all of these constraints are correct, the simple solution is that Rhea is not locked to a mode, but is currently crossing a resonant mode. This is a possible situation if a moon (through equilibrium tides) evolves faster than a mode rather than the other way around, making a resonant lock impossible but producing occasional bursts of fast orbital evolution. If we assume that Titan is currently evolving with a timescale of 100 Gyr <cit.>, then it is possible that resonance lock may not be feasible at all. The argument here is that Titan would have certainly been captured in a resonant lock if resonant modes move faster than Titan's orbit evolves due to equilibrium tides. In principle, we can also envision resonant modes moving to higher frequencies over time, opposite the direction of tidal evolution. In this case, all accelerated tidal evolution would always be episodic, being driven by the moons overtaking resonant modes. In the rest of the paper, we will examine how a combination of equilibrium tides and passage through resonant modes can explain other features of the Saturnian system, namely the establishment of the Enceladus-Dione MMR. § ENCELADUS-DIONE 2:1 RESONANCE: EQUILIBRIUM TIDES In the previous sections we concluded that orbital evolution through equilibrium tides (with Q/k_2=5000) is able to explain the present heating of Enceladus <cit.> and the capture of Mimas and Tethys into their current resonance with a high probability, given appropriate initial conditions. We also find that orbital evolution of Enceladus through equilibrium tides allows for an age of Janus-Epimetheus pair (or their parent body) longer than 40 Myr, unlike Enceladus's evolution through resonant lock. However, it has not been explored in the prior literature whether equilibrium tides can establish the current Enceladus-Dione 2:1 MMR, as opposed to maintaining it. Study of this resonant capture must be done through numerical integrations, as <cit.> have shown that practically all two-body resonances in the Saturnian system harbor three-body resonances that are very hard to model analytically, in addition to many two-body sub-resonances. §.§ Enceladus-Dione 4:2 Inclination Resonances The Enceladus-Dione 2:1 MMR contains two first-order sub-resonances, four more second-order ones, several important three-body resonances, as well as numerous two-body third-order sub-resonances. The currently occupied e_E sub-resonance is one of the last to be encountered as the orbits of Enceladus and Dione converge. We ran a number of simulations of the Enceladus-Dione 2:1 MMR encounter assuming equilibrium tides and Q/k_2=4000 for Saturn. Typically, Enceladus was captured into the 4:2 i_E^2 resonances in large majority of cases where Enceladus and Dione encounter this resonance under equilibrium tides. Left-hand panels in Fig. <ref> plot the result of a typical simulation that features capture into the Enceladus-Dione 4:2 i_E^2 resonance. Enceladus's inclination grow to about 1^∘, at which point secondary resonances break the inclination resonance. In this particular simulation all inner moons (from Mimas to Rhea) were assumed to have initially equatorial orbits, but the result is the same when Tethys was assumed to have been already inclined. In all remaining simulations of equilibrium tide Enceladus-Dione 4:2 MMR crossing Enceladus is caught into a more complex inclination resonance, also affecting the inclination of Dione or Tethys. In all cases Enceladus acquires an inclination on the order of a degree, two orders of magnitude above the observed one. Near-certainty of capture into one of the inclination sub-resonances found in our simulations strongly suggests that the Enceladus-Dione 2:1 MMR was not assembled through equilibrium tides. This is in contrast to what we found for the Mimas-Tethys 4:2 resonance (Section <ref>) which can be accounted for using equilibrium tides (except for the present libration amplitude, which is easily excited by a third body). High probability of capture into the Enceladus-Dione 4:2 i_E^2 resonance, but not Mimas-Tethys 4:2 i_M^2 resonance is rather surprising but holds in large numbers of numerical simulations. We suspect that the lack of capture into the Mimas-Tethys 4:2 i_M^2 resonance with low initial i_M is due to the mechanism originally proposed by <cit.>, which states that in cases of small free inclination and fast orbital precession even relatively slow resonant encounter may not be adiabatic, i.e. a second-order resonance may not be able to dominate the motion of the ascending node against oblateness-driven precession. Note that this explanation did not hold in numerical simulations using Q ≈ 18,000 for Saturn <cit.>, but appears to explain the behavior at ten times faster tidal evolution used in this study. §.§ Enceladus-Tethys 11:8 Resonance In the course of our work on the past dynamics of the Saturnian system, we discovered that Enceladus-Tethys 11:8 resonance offers unexpected constraints on the past orbital evolution of those two moons. In the equilibrium tide paradigm, this resonance would have been crossed 10-15 Myr ago. Since Tethys's predicted equilibrium tidal evolution is faster than that of Enceladus (they are the only neighboring pair of major Saturnian moons on diverging orbits, as Tethys's six times larger mass boosts its tidal evolution), this resonance should have been crossed divergently without a chance of capture. Despite the third order of this sub-resonance, the large eccentricity of Enceladus and inclination of Tethys make this resonant term surprisingly relevant. In particular, we find that the Enceladus-Tethys 11:8 MMR crossing usually both excited the inclination of Enceladus beyond the observed value, and disrupted the Mimas-Tethys 4:2 MMR (Fig. <ref>). These results decisively argue that the current system could not have resulted by evolution through equilibrium tides. Of course, observations of the tidal acceleration on Rhea <cit.> already established that Saturn's tidal response is dynamic, and that Rhea and/or Titan may be in resonance lock. However, as we demonstrated in previous sections, the observed resonances between the inner moons appear to suggest convergent tidal evolution consistent with equilibrium tides. The apparent lack of past crossing of the Enceladus-Tethys 11:8 MMR is the first evidence from mutual resonances that requires frequency-dependent tides to have acted in the past. In general, the Enceladus-Tethys 11:8 MMR could have been avoided through slower orbital evolution of Tethys or faster migration of Enceladus. We explored the former possibility assuming that the tidal response of Saturn is frequency-dependent but does not contain resonant modes. This would be consistent with findings of <cit.> and <cit.>, who do find slower orbital evolution of Tethys relative to other inner moons than expected from equilibrium tides (however, the uncertainties are still large). The current tidal evolution rate of Enceladus is constrained by its tidal heating (Sec. <ref>), so a slower evolution of Tethys is necessary to avoid a recent passage through the Enceladus-Tethys 11:8 MMR. However, we have just seen that the equilibrium tides acting on Enceladus are still unable to reproduce the Enceladus-Dione 2:1 MMR (Subsection <ref>). Therefore it appears that the most likely solutions to the problem posed by Enceladus-Tethys 11:8 MMR requires 1) both that the tidal response at Tethys's frequency is currently weaker than that of Enceladus, and 2) that the migration of Enceladus was much faster in the past. We explore this possibility in the next Section. § ENCELADUS-DIONE 2:1 RESONANCE: SHORT-LIVED ENHANCED TIDAL EVOLUTION In this section we present simulations of Enceladus and Dione encountering their 2:1 MMR while Enceladus is migrating much faster than expected by equilibrium tides. This is enabled in the numerical integrator simpl by adding a simple factor multiplying the tidal acceleration of each moon. For moons evolving under equilibrium tides this factor is simply 1, and it is larger for accelerated evolution. We can use this modification of equilibrium tides as our hypothesis is that Enceladus (and later Rhea) are simply passing through frequency bands that have very high tidal response, rather than being locked to these resonant modes. Resonant locking cannot be modeled this way, as moons locked to resonant modes tend to have constant migration rate but do not experience constant tidal Q of Saturn (and the apparent tidal Q will change if the moon in question enters a resonance with an exterior satellite). §.§ Inclination-Type Sub-Resonances of the Enceladus-Dione 4:2 MMR It is a well-known phenomenon that the probability of mean-motion resonance capture declines as the resonance is encountered more rapidly <cit.>. In this sub-section we explore the hypothesis that an episode of fast tidal evolution may have enabled Enceladus to cross the inclination resonances with Dione without capture. Results from a number of simulations are plotted in Fig. <ref>. We ran twenty different simulations that had Saturn's Q/k_2=4000 for all moons except Enceladus, for which the response was enhanced 5 times; six resulted in capture into an inclination-type resonance and fourteen experienced a kick in inclination. In twenty simulations where Enceladus evolved ten times faster than expected, none experienced capture. Post-passage inclination of Enceladus was on average lower in 10-times accelerated simulations (typically i_E=0.01-0.02^∘) than in 5-times accelerated ones (typically i_E=0.02-0.04^∘). Our choice of current inclinations and eccentricities for initial conditions is somewhat arbitrary. While its present inclination is small, Enceladus presumably formed with close to zero inclination and this initial value may affect the post-resonant distribution of inclinations. Later simulations (shown in Section <ref>) were started with a lower inclination of Enceladus but the outcomes were very similar. As seen in Fig. <ref>, the three-body resonance with Tethys (middle of the three jumps) is a minor contributor to Enceladus's final inclination, so our assumption that Tethys was already inclined at this epoch is not crucial. The exact inclination of Dione may effect the results somewhat (as the third jump is the i_E i_D sub-resonance), but we see no strong reason to expect a different inclination for Dione at the time when 2:1 resonance with Enceladus was established. §.§ Eccentricity-Type Sub-Resonances of the Enceladus-Dione 4:2 MMR After the inclination-type sub-resonances have been crossed, Enceladus encounters a number of eccentricity type sub-resonances of the Eneceladus-Dione 2:1 MMR. Based on results shown in Fig. <ref>, we enhanced Enceladus's tidal evolution by a factor of ten, while the tidal evolution of other moons corresponds to frequency-independent Q/k_2=4000 for Saturn. The choice of initial eccentricities requires making assumptions not only about past resonances but also about the rate of eccentricity damping by the moons. Our first batch of simulations were using the current eccentricities for most moons, except that Enceladus was given a low initial e_E<0.001 while Dione was given e_D=0.004, about twice the current value (to account for the expected resonance kick and subsequent damping). Out of the first group of simulations using these initial conditions, the majority of runs resulted in Enceladus being captured into three-body resonances with Rhea or Tethys (Fig. <ref>, first and third rows), and the rest resulted in e_D sub-resonance, with no simulations reaching the current e_E sub-resonance (which is last in order of encounters). Captures into three-body resonances, which were understandably missed in past semi-analytical models <cit.> demonstrate once again the importance of such resonances in the Saturnian system <cit.>. These captures may come as a surprise given the high rate of orbital migration of Enceladus, but we should recognize that these are first-order resonances, unlike the inclination-type resonance shown in Fig. <ref>, which are necessarily of the second order. This preponderance of three-body resonance captures is in part a consequence of us starting the simulations with Tethys and Rhea on very low eccentricity orbits. However, these were not arbitrary choices, as these two moons currently do have almost circular orbits. Low current eccentricities of both Tethys and Rhea argue against these three-body resonance captures happening in the recent past, as damping the eccentricities acquired in Fig. <ref> in realistic timescales may be difficult, especially for Rhea. We therefore prefer these moons having relatively small eccentricities at this epoch and avoiding capture into the three-body resonances, rather than being captured and acquiring large eccentricities (on the order of 0.01 or more). In the second batch of simulations, we gave both Tethys and Rhea eccentricities of 0.002, which we found (through trial and error) to be largely sufficient to avoid capture into three-body resonances. In the second group of simulations, Enceladus still never reaches the current e_E resonance, but in majority of cases becomes captured in a second-order resonance which also includes eccentricity of either Titan or Dione (Fig. <ref>, rows four and five, respectively). While the mixed resonance e_Ee_D has been studied before <cit.>, the three-body resonance resonance with Titan is new. In both of these cases we cannot avoid capture into these sub-resonances by changing the eccentricity of Dione or Rhea. A less eccentric Dione would make capture into e_E e_D resonance less likely, but would increase the fraction of captures into the first order e_D sub-resonance (this fraction is already 20-30% for initial e_D=0.004) and may conflict with Dione's current eccentricity. In the case of Titan, its eccentricity does not get affected by the resonance and we must use values very close to the current one. The simpest way to avoid the capture into the above mentioned second-order eccentricity sub-resonances is to give Enceladus a sizable initial eccentricity. The implication is that at the time of capture into the Enceladus-Dione 2:1 MMR, not only there had to be an accelerated orbital evolution of Enceladus (to avoid capture into the inclination-type resonances), but all inner moons had to have somewhat eccentric orbits (to avoid capture into the eccentricity-type resonances). In the next section we will put together a possible evolution path that satisfies the constraints presented in this and previous sections, and the implications of the moons previously excited eccentricities will be discussed in Section <ref>. §.§ Comprehensive Model of the System's Recent Evolution In this section we attempt to construct a numerical model of the recent (last 20 Myr) evolution of the Saturnian satellite system. We are using all of the constraints that were established in previous sections. Enceladus and Dione are assumed to experience tidal acceleration with Q/k_2=4000 at the present epoch,[we assumed a value on the high-end of this estimate of dissipation in order to make simulations faster.] in agreement with the hypothesis of equilibrium tidal heating of Enceladus <cit.>. Mimas is assumed to have the same tidal evolution rate, both for lack of other constraints, and as it is consistent with Mimas encountering and being captured into 4:2 resonance with Tethys (Section <ref>). Need for avoidance of the 11:8 Enceladus-Tethys resonance, as well as (admittedly uncertain) results by <cit.> and <cit.>, suggested that the tidal acceleration of Tethys is much weaker than that expected from equilibrium tides. Finally, most radically, we assumed that Enceladus went through a stage of very rapid tidal evolution due to crossing of (but not locking to) a resonant mode. This was done to avoid capture into Enceladus-Dione 4:2 inclination resonances (Section <ref>), as well as to avoid a recent crossing of Enceladus's 1:2 resonance with the horseshoe moons (or their progenitor; Sec <ref>). Additional assumptions include low initial tidal dissipation within Enceladus until it experiences strong tidal heating, at which point Enceladus switches to a strong tidal response (this is done to approximate melting of the interior). Due to the nature of the integrator where tidal response is treated as a constant parameter, we modelled both the transitions in the tidal acceleration of Enceladus and the changes in its own tidal response as abrupt events, implemented manually. Table <ref> shows the initial conditions for two sets of simulations of the integrated evolution of the inner moons (sets differed only by initial i_Θ). In both cases, Enceladus was assumed to be experiencing 10x accelerated evolution in the first 10 Myr of the simulation. After 3 Myr we selected one simulation in each set in which Enceladus was captured into the 2:1 e_E MMR with Dione and acquired high eccentricity, cloned those simulations, and from that time onward used a much higher tidal response of Enceladus. At 10 Myr we reverted Enceladus to an equilibrium tidal evolution rate and current tidal parameters, evolving the system until 20 Myr or until Mimas-Tethys resonance reached its present state. We also assumed equilibrium tides on Rhea before 10 Myr and accelerated evolution after than (Section <ref>), and accelerated Titan throughout, but this had little importance as nether Rhea not Titan encountered any resonances. lcccc 1 Initial conditions and tidal parameters for the simulations shown in Fig. <ref>. The slashes separate the values relevant for the two simulations (left-hand side is listed first). For parameters that were changed during the simulation, vertical lines separate values used during 0-3 Myr, 3-10 Myr and after 10 Myr, respectively. Relative tidal acceleration refers to a factor by which the Saturn's response of k_2/Q=(4000)^-1 was enhanced at that moon's frequency. Since Q=100 was typically assumed, the last column is usually equal to the tidal love number k_2, except for Enceladus during 3-10 Myr period, when k_2=1 and Q < 100. 0pt Moon Eccentricity Inclination Relative Tidal Tidal k_2/Q Name e i [^∘] Acceleration × 10^2 Mimas 0.022 0.1 1 0.001 Enceladus 0.0035 0.003 10 \| 10 \| 1 0.01 \| 2.7 / 3.3 \| 1 Tethys 0.002/0.003 0.98 0.33 0.02 Dione 0.005 0.03 1 0.02 Rhea 0.002 0.33 1 \| 1 \| 5 0.02 Titan 0.0305 0.33 10 0.3 Figure <ref> shows outcomes of two successful simulations (one from each set), which come close to reproducing the current system. Between two sets of first-stage simulations (20 total), ten were “successful”, meaning that Enceladus and Dione were in their 2:1 e_E MMR at 3 Myr. The other ten simulations were caught in one of the other sub-resonances of the Enceladus-Dione 2:1 MMR (Fig. <ref>), typically exciting the eccentricities of Tethys or Dione well above the observed values, or “fell out” of the resonance due apparent interaction with secondary resonances. We chose two of the successful simulations for cloning, which was done by sharply changing the tidal properties of Enceladus. The tidal Love number was changed from k_2E=0.01 to k_2E=1, approximating melting. Different clone simulations had tidal Q of Enceladus in the 30-39 range. This range was chosen through trial and error, as we found that simulations with A=(Q_S k_2E)/(Q_E k_2S) < 10 lead to breaking of the resonance, while those with A > 10 settled into bound cycle within the 2:1 e_E sub-resonance (subscript S designates Saturn's properties at Enceladus's frequency). This critical change in the dynamics of resonance with the change in Enceladus's tidal response was first discovered by <cit.>, and our value for critical A agrees with theirs[As <cit.> explored a more standard case in which the orbital evolution of Dione is not negligible compared to that of Enceladus, A in their paper must be multiplied by (1-(ȧ_D a_E)/(ȧ_E a_D))^-1.]. This phase of the evolution of Enceladus, despite seemingly chaotic oscillations, is not stochastic but determined by tidal properties, so all simulations in which Enceladus is dissipative enough (i.e. A > 10) will stay at the threshold of the Enceladus-Dione 2:1 e_E resonance indefinitely. We assume that Enceladus eventually gets out of the resonant mode and migrates due to “background” tidal response of Saturn that is not dependent on frequency. In reality this transition would be gradual as resonant modes are expected produce a smooth (if narrow) profile of tidal response over frequency <cit.>. We could not simulate this without extensively modifying the integrator and, more importantly, greatly increasing the complexity of our model. At 10 Myr all of our clone simulations switch to Enceladus experiencing Saturn's tides with Q/k_2=4000 and having its own k_2/Q=0.01, approximately what is expected if the current heating is equal to observed and is in equilibrium. Out of twenty cloned simulations only three do not complete the transition to a narrow libration within the resonance consistent with observations (in two simulations Enceladus leaves the resonance, in one it is permanently trapped in a large libration state due to secondary resonance). In some simulations the transition is smooth like in the right-hand side of Fig. <ref>, while in the others secondary resonances are encountered during the evolution, leading to temporary increases in the libration amplitude (as in the left-hand side of Fig. <ref>). The migration of Mimas, Tethys and Rhea is largely unaffected by the Enceladus-Dione resonance in our simulations. There is some variation of the eccentricity of Mimas when Enceladus encounters secondary resonances within the 2:1 e_E MMR with Dione, but the effect on Mimas is usually minor. The inclination of Mimas is unaffected by any dynamics discussed so far, and passes through a series of kicks due to sub-resonances of the Mimas-Tethys 2:1 commensurability. The subresonances with arguments 2λ_Θ-λ_M+ϖ_M-2Ω_M, 2λ_Θ-λ_M+ϖ_M-Ω_M-Ω_Θ (cf. Fig. <ref>), and 4λ_Θ-2λ_M-2Ω_M (the pure i^2_M term, Fig. <ref>) are encountered at about 3 Myr, 7 Myr and 14 Myr, respectively. Since the latter two kicks (which are larger) always happen after the simulations were cloned at 3 Myr, we can consider clones of the original two simulations to be practically independent when it comes to the inclination of Mimas. Out of eighteen clones which stayed in the Enceladus-Dione 2:1 MMR, nine were captured into the current Mimas-Tethys 4:2 i_M i_Θ sub-resonance (bottom panels in Fig. <ref>). The remaining clones either experienced capture into the i_M^2 harmonic or passed the whole forest of sub-resonances without capture. Therefore we can say that both observed resonances (Mimas-Tethys 4:2 i_Mi_Θ and Enceladus-Dione 2:1 e_E) have high probability (about 50%) when using these initial conditions and assumptions about Enceladus's tidal evolution and internal dissipation. While we can quantify the probabilities of different stochastic outcomes of resonant dynamics, we are currently not able to assess the a priori probability of our initial conditions and assumptions about Saturn's tidal response. Note that our preferred timeline requires Enceladus to settle into the present quiescent state before Mimas acquires high inclination through its resonance with Dione. The current Mimas-Tethys resonance is very fragile and we often see it broken if it coincides with Enceladus having very high and/or chaotic eccentricity. Other parameters of the system at the end of simulations in Fig. <ref> are mostly consistent with the present state. Mimas-Tethys resonance in every case has a large libration amplitude that is still well short of the observed one (93^∘), but we expect even very minor subsequent perturbations to modify this quantity (we ignored all moons smaller than Mimas in these runs). Inclinations of Enceladus and Dione are somewhat stochastic but in the range that includes the observed values (i_E=0.008^∘, i_D=0.02^∘), as is the eccentricity of Dione (probably the most variable quantity in our simulations; currently e_D=0.002). For both Mimas and Tethys inclinations are determined by the initial conditions and their mutual resonance, and the eccentricities depend primarily on the initial values and tidal dissipation, without much stochasticity. However, the eccentricity of Rhea is one quantity that our simulation cannot explain, as we have set it much higher than observed in order to avoid three-body argument of the Enceladus-Dione MMR (Fig. <ref>), but the tidal dissipation we assume for Rhea cannot subsequently modify that eccentricity. This discrepancy may tell us something about the recent dynamics of Rhea, as we discuss in the next Section. § DISCUSSION AND CONCLUSIONS §.§ Damping of Inclination in Enceladus? Much of our reasoning that resulted in the model of recent evolution presented in Fig. <ref> is driven by the survival of the low inclination of Enceladus. In order for Enceladus's inclination to stay so low, both the capture into the 4:2 Enceladus-Dione MMR (Sections <ref> and <ref>) and crossing of the 11:8 Enceladus-Tethys MMR (Section <ref>) must be avoided. Can we be confident that the inclination of Enceladus was not actually higher in the past and then damped by tides? The simplest way to estimate tidal damping of inclination within Enceladus is assuming a homogeneous Enceladus that can be described by a single tidal love number k_2 and a tidal quality factor Q. If we assume that the eccentricity of Enceladus is currently in equilibrium between excitation by resonance with Dione and damping by tides which produces the observed heating <cit.>, we get k_2/Q ≈ 0.01 <cit.>. This corresponds to an eccentricity-damping timescale of about 0.5 Myr, making Enceladus exceptionally dissipative. The timescale for damping of inclination is longer by the factor 7 (sini/sinθ)^2, where θ is the forced obliquity of the moon. The forced obliquity of Enceladus has been modeled by <cit.> and they found that θ≤ 4× 10^-4 ∘. This would make the (sini/sinθ) ≥ 20, making the timescale for damping of Enceladus's inclination over 1 Gyr, clearly too slow to affect dynamics in the timeframe we consider. Another mechanism for inclination damping would be resonant response of a global ocean <cit.>. Given that Enceladus likely possesses a sub-surface ocean, this possibility must be addressed. <cit.> analysed in-depth different mechanisms of tidal dissipation, and found that at Enceladus's present obliquity the heating due to obliquity tides in the ocean is more than three orders of magnitude lower than non-resonant obliquity tides due to whole-body response by Enceladus. This also implies that the inclination damping timescale due to resonant ocean tides is longer than 10^3 Gyr. One important finding by <cit.> about resonant tides is that their power depends as a cube of obliquity (as opposed to the square of obliquity in non-resonant tides), meaning that the timescale for inclination damping is inversely proportional to obliquity. However, even if the inclination of Enceladus were about a degree (cf. Fig. <ref>) and forced obliquity were θ≈ 0.05^^∘, resonant inclination damping would still be an order of magnitude slower than non-resonant obliquity tides. Finally, even if the parameters used by <cit.> were not to apply (for some unforeseen reason) to Enceladus on a high inclination orbit, their calculations clearly demonstrate that the inclination of Enceladus cannot be brought to its present low value by resonant ocean tides. The above discussion assumed that Enceladus is in Cassini state 1, in which the forced obliquity due to inclinations is low, and that dissipation within other moons does not affect the evolution of Enceladus's inclination. However, it is in principle possible that the obliquity of a moon could be excited by a spin-orbit resonance. This would be equivalent to the excitation of obliquity of Saturn itself by a secular resonance between the axial precession of Saturn and nodal precession of Neptune's orbit <cit.>. Recently <cit.> suggested that Uranian moon Oberon may have in the past been caught in a similar resonance with the orbit of Umbriel, and that tidal dissipation within Oberon may have damped the inclination of Umbriel. Using the results of <cit.>, we surveyed the precession frequencies in the Saturnian system and did not find any candidates for such a resonance, although we cannot exclude this possibility due to uncertainties in the moons' shapes and gravity fields. There are however additional arguments against the relevance of such resonances to Enceladus. Most importantly, dynamics of the Saturnian satellite system is dominated by Saturn's oblateness, and the mutual perturbations by the moons are less important than in the Uranian system. Therefore there is little or no coupling between the precession frequencies of different moons, and the relatively low mass Enceladus is particularly unlikely to have a noticeable effect on the rotational dynamics of the larger moons. Furthermore, <cit.> found that damping of inclination through a spin-orbit resonance can operate only until the relevant orbital inclination damps below the level at which resonance can be maintained, and this level is likely to be higher than the very low current i_E=0.008^∘. Therefore we conclude that spin-orbit resonances are vey unlikely to have damped the inclination of Enceladus. §.§ Implications of the Moons' Initial Conditions Mimas Our model requires that the eccentricity of Mimas predates the establishment of the current Mimas-Tethys and Enceladus-Dione resonances. The origin of this eccentricity may lie in the past 3:1 Mimas-Dione MMR <cit.>, or some other still unidentified, possibly 3-body, resonance. The implication is that the damping of Mimas's inclination was limited and therefore that Mimas is unlikely to posses an internal ocean <cit.>. A new finding in our paper is that Mimas must have had a ≈ 0.1^∘ inclination before encountering 2:1 MMR with Tethys. The origin of this inclination is harder to explain, as most three-body resonances do not affect inclination, and 3:1 MMR crossing with Dione produces a smaller inclination “kick” <cit.>. One possibility that needs investigation is whether Dione was more inclined at the time of Mimas-Dione 3:1 MMR crossing, and that would require producing a self-consistent model of the system's evolution further than 20 Myr into the past. Enceladus We find that the eccentricity of Enceladus was already excited (e ≤ 0.005) before encountering the 2:1 MMR with Dione, but its inclination was not. The most likely source of this eccentricity are three-body resonances, either isolated or as part of the 5:3 Dione-Rhea MMR crossing. An apparently pristine inclination of Enceladus implies that it did not encounter any major (1st or 2nd order) two-body resonances with mid-sized moons prior to the 2:1 MMR with Dione. Tethys Our model requires Tethys to have a somewhat higher eccentricity (e_Θ=0.002-0.003) 20 Myr ago, and almost its present large inclination. The eccentricity of Tethys poses no challenges, as a past higher eccentricity was suggested on both geophysical <cit.> and dynamical <cit.> grounds, and tidal dissipation is likely to subsequently produce Tethys's present low eccentricity. The one-degree inclination of Tethys was always known to have to predate the Mimas-Tethys 4:2 resonance <cit.>, but its origin was never explained until <cit.> proposed a Tethys-Dione secular resonance closely following (and dynamically related to) the Dione-Rhea 5:3 MMR crossing. Unless another mechanism of exciting Tethys's inclination is found, our initial conditions effectively require that a passage through the Dione-Rhea 5:3 had happened in the past. Dione We start our simulations with Dione that has excited eccentricity (e_D ≈ 0.005) but very low inclination. This is generally consistent with a past secular resonance with Tethys <cit.>, in which Dione “passed” its inclination and part of its eccentricity (acquired in a resonance with Rhea) to Tethys. The secular resonance is broken when either the eccentricity or inclination of Dione reach very low values (e.g. i_D<0.1^∘ for inclination). Therefore, a substantial eccentricity is to be expected to survive if the inclination is very low, implying that the resonance was broken by depletion of Dione's inclination. Rhea At the start of our simulation e_R=0.002, ten times in excess of Rhea's current free eccentricity e_R=2 × 10^-4.[The total eccentricity of Rhea is larger due to a dominant term forced by Titan which is not relevant for dynamics discussed here.] Rhea's inclination at the start of our simulation is the same as now (i_R=0.33^∘) and does not change in the course of it. This substantial inclination is exactly what is expected from a past crossing of the Dione-Rhea 5:3 MMR. This dynamical mechanism is also expected to produce a comparable eccentricity of Rhea, broadly consistent with our initial conditions, but not the observed values. The discrepancy between theoretical expectations and the actual value here is significant, and requires so-far unknown dynamical mechanism of lowering Rhea's eccentricity. We plan to address this issue in the near future using an integrator that resolves the rotational dynamics of Rhea and search for any additional dynamical features. §.§ Width and Distribution of Peaks in Tidal Dissipation Our work is decidedly semi-empirical in design, as we acknowledge the importance of highly variable response of Saturn to tidal forces of different moons. As we have shown in this paper, both equilibrium tides and resonance-lock-only models that were used so far fail to fully explain the system's dynamics. Apart from the general lack of information on the source of Saturn's dissipation, we tried to keep the number of free parameters to a minimum, leading to our decision to change the evolution rates abruptly. Our decision not to model the interior evolution of Enceladus but to periodically adjust its tidal parameters “by hand” was dictated by our own technical limitations and and we hope that in the future there will be integrated models that fully model both orbital dynamics and interior evolution of the moons. Regardless of the nature and evolution of resonant modes, it is clear that these are resonant phenomena, and therefore must exhibit a spike-like profile against frequency (possibly Lorentzian or similar). As apparent from Fig. <ref>, we assumed that the width of the normal mode affecting Enceladus to be about 1% of its semimajor axis. We could in principle restrict the very fast evolution to a narrower interval that includes the initial encounter with the Enceladus-Dione 2:1 MMR, but that would require that the resonant mode and the resonance with Dione were encountered at the exact same time due to an unlikely coincidence. Furthermore, if Rhea is only passing though a resonant mode, this mode cannot be too narrow if we were to observe this transient phenomenon. These features in frequency space appear much wider than the resonant modes proposed by <cit.> based on the theory of tidal response in stars and giant planets. We also find that the tidal response at Tethys's frequency must be lower than what appears to be “background” rate, so this frequency dependence is not restricted to peaks in dissipation, but also has local minima (“troughs”). Apart from being relatively wide, resonant modes cannot be too few and far in between if they were recently encountered by both Enceladus and Rhea as we propose. The determination of a consensus result for the current rate of tidal evolution of Titan is of great importance, as it will give us a major indication if resonance locking is present or not. Of all the moons of Saturn that raise significant tides (Mimas-Titan), Titan is most likely to be in resonant lock, as it has the slowest (equilibrium) tidal evolution and is the least likely to have been recently re-accreted in some kind of late cataclysm. If Titan is not in resonance lock, it is possible that the resonant modes are moving inward (in terms of semimajor axis at which they are encountered), making is somewhat less surprising that encounters between moons and modes appears to common. Still, two moons encountering resonant modes within the last few tens of Myr appears unlikely unless modes are very numerous, or their distribution is correlated with that of moons. The last possibility may indicate that the moons may have re-accreted close to the modes, either due to where the last generation of satellites was before the assumed instability, or for some other reason. The only certainty is that the tidal evolution of the Saturnian system holds yet more surprises for us. §.§ Summary In this work we tried to consider all of the available constraints on the recent (last few tens of Myr) and current orbital evolution of major Saturnian satellites. We find that no single mechanism of orbital evolution proposed so far (including frequency-independent equilibrium tides and the evolution through resonance-locking) can explain the orbits of these moons. Strong equilibrium tides can explain the existence of the observed resonances (Mimas-Tethys and Enceladus-Dione) and the current heating rate of Enceladus, while resonant modes are necessary to explain the current dynamics of Rhea and the original capture of Enceladus into the resonance with Dione. Additionally, the evolution of Tethys needs to be slower than that of other moons, implying “troughs” as well as “peaks” in response as a function of frequency. In order to successfully reproduce the encounter of Enceladus with the 2:1 resonance with Dione we require a passage through a resonant mode, rather than locking to a resonant mode. This is reasonable if the resonant modes in the inner system are evolving more slowly than those at larger distances, as originally predicted <cit.>, but would not work in the context of inertial waves <cit.>. Alternatively, if Titan is currently not locked to a resonant mode as the results of <cit.> suggest, it is also possible that resonant modes move inward, and in that case the moons could only temporarily cross the modes, rather than become locked to them. Given the complexity and uncertainties of the tidal evolution rates that not only vary from moon to moon but also over time, it is difficult to reach firm conclusions about the age of the system. However, given the amount of dynamical excitation that the inner moons (especially Mimas and Enceladus) may have experienced in the last 20 Myr, it is difficult to envision this system of relatively “dynamically cold” satellites evolve this way for hundreds of Myrs, let alone multiple Gyrs. We hope that more precise future determinations of the current orbital evolution rates of the Saturnian moons (based on astrometry or spacecraft data) will be able to confirm or falsify our model of their recent evolution. This work was supported by NASA Solar System Workings Program awards 80NSSC19K0544 (to MĆ and MEM) and 80NSSC22K0979 (to MĆ). We would like to thank Jim Fuller, Valery Lainey, Bob Jacobson, and Francis Nimmo for very insightful discussions. We also thank the International Space Science Institute in Bern for organizing an extremely useful workshop in the evolution of the Saturnian system (May 2022). We wish to thank two anonymous reviewers whose comments greatly improved the paper. aasjournal
http://arxiv.org/abs/2306.03211v1	20230605193645	Exploring a new approach to Hadronic Parity Violation from Lattice QCD	[ "Marcus Petschlies", "Nikolas Schlage", "Aniket Sen", "Carsten Urbach" ]	hep-lat	[ "hep-lat" ]	Helmholtz-Institut für Strahlen- und Kernphysik, University of Bonn, Nussallee 14-16, 53115 Bonn, Germany Bethe Center for Theoretical Physics, University of Bonn, Nussallee 12, 53115 Bonn, Germany Helmholtz-Institut für Strahlen- und Kernphysik, University of Bonn, Nussallee 14-16, 53115 Bonn, Germany Bethe Center for Theoretical Physics, University of Bonn, Nussallee 12, 53115 Bonn, Germany Helmholtz-Institut für Strahlen- und Kernphysik, University of Bonn, Nussallee 14-16, 53115 Bonn, Germany Bethe Center for Theoretical Physics, University of Bonn, Nussallee 12, 53115 Bonn, Germany Helmholtz-Institut für Strahlen- und Kernphysik, University of Bonn, Nussallee 14-16, 53115 Bonn, Germany Bethe Center for Theoretical Physics, University of Bonn, Nussallee 12, 53115 Bonn, Germany The long-range, parity-odd nucleon interaction generated by single pion exchange is captured in the parity-odd pion-nucleon coupling . Its calculation in lattice QCD requires the evaluation of 4-quark operator nucleon 3-point functions. We investigate a new numerical approach to compute based on nucleon matrix elements of parity-even 4-quark operators and related to the parity-violating electro-weak theory by PCAC and chiral perturbation theory. This study is performed with 2+1+1 dynamical flavors of twisted mass fermions at pion mass m_π≈ 260 in a lattice box of L ≈ 3 and with a lattice spacing of a ≈ 0.091. From a calculation excluding fermion loop diagrams we find a bare coupling of = 8.08 (98) · 10^-7. Exploring a new approach to Hadronic Parity Violation from Lattice QCD Carsten Urbach July 31, 2023 ====================================================================== § INTRODUCTION Determining the effects of hadronic parity violation (HPV) in nucleon-nucleon interaction is a challenging task, both in experiment and theory. HPV amplitudes based on parity symmetry breaking are small deviations against a large QCD background. The long-range, single pion exchange interaction originating from flavor-conserving, neutral currents at the electro-weak scale is a promising channel to study the parity-odd pion-nucleon coupling <cit.>. The first experimental determination <cit.> of the associated pion-nucleon coupling related to the Δ I = 1 effective electro-weak Lagrangian has recently sparked new interest in the theoretical Standard Model (SM) prediction of . The available theoretical estimates of from SM physics are predominantly based on effective field theory and model calculations, apart from one exploratory lattice calculation. Starting point for model calculations was the scheme for describing parity-nonconserving nuclear forces from Desplanques, Donoghue, Holstein <cit.>. Continuing on that basis Dubovik and Zenkin found in Ref. <cit.> a best value estimate of 1.3· 10^-7. Ref. <cit.> extended the quark model picture to include the weak interaction effects from the Δ baryon and estimated 2.7· 10^-7. Kaiser and Meißner started investigations with a chiral soliton model <cit.>, and Meißner and Weigelt used a three-flavor Skyrme model and calculated the coupling in the range (0.8 - 1.3)· 10^-7 in Ref. <cit.>. A chiral quark-soliton model was used by Ref. <cit.> with an estimate of the coupling 0.874· 10^-7. Ref. <cit.> applied the operator product expansion to the nucleon 2-point function in an external pion field and based on QCD-sum rules found a value 3.4· 10^-7. Ref. <cit.> studied the parity-odd couplings in the nucleon-nucleon interaction with the 1/N_c-expansion and esitmated for the sin^2(θ_w) / N_c-suppressed a range 0.8 (0.3)· 10^-7. de Vries et al. used chiral effective field theory in Ref. <cit.> to compute the neutron capture on the proton process and matched to experimental data, resulting in an estimate 1.1 ( 1.0 ) · 10^-6. The first attempt at an estimate from first principles of the strong interaction was carried out by Wasem in Ref. <cit.>. We come back to comparing our present work to this reference and only collect its final estimate here 1.099 (0.505)· 10^-7. The significant experimental result by the NDPgamma collaboration in Ref. <cit.> of 2.6 (1.2)· 10^-7 is another milestone in this timeline. The same experimental data was subsequently re-analyzed with chiral effective field theory in Ref. <cit.>, which estimated the coupling at 2.7 (1.8)· 10^-7. More recently, Ref. <cit.> used a factorization ansatz for the matrix element of the parity-violating electro-weak Hamiltonian, together with non-perturbative lattice QCD data for the nucleon quark charges to find an estimate of 3.06 (1.72)· 10^-7. The above results are summarized in Fig. <ref>. We find this situation of scattered results highlights the need for systematic study and improved ab-initio theoretical determinations. The aforementioned first ab-initio lattice QCD determination and the non-perturbative estimate of the nucleon matrix elements with the parity-violating (PV) effective Lagrangian has been presented in Ref. <cit.>. In this work the actual transition matrix elements N π_PV⟶ N for a transition of a nucleon-pion state to a nucleon state mediated by the Δ I = 1, parity-violating Lagrangian was considered. Though this calculation is pioneering, it is also exploratory in many regards as also discussed in detail in Refs. <cit.>. Challenges are the rigorous treatment of the pion-nucleon state in finite volume and energy non-conservation between initial and finial state on the lattice, which were circumvented in Ref. <cit.>. Apart from this the calculation considered also only a certain quark flow diagram topology, arguing that the neglected diagrams are expected to have a contribution only within the statistical accuracy. Moreover, renormalization of the 4-quark operators was not included. Still, the obtained value on a coarse lattice with a heavier-than-physical pion m_π≈ 390 is consistent with the recent NPDGgamma experimental analysis. An alternative theoretical ansatz has been put forward anew in Refs. <cit.>, by proposing a joint effort of chiral effective field theory (χEFT) and lattice QCD. Based on the PCAC relation the transition via the parity-violating interaction Lagrangian with a soft pion in the initial or final state is equivalent to a transition via a parity-conserving Lagrangian without a soft pion. This relation is, however, true only in the limit of exact chiral symmetry, and at non-zero pion mass it receives higher order corrections in χEFT. But these corrections can be argued to be a numerically small, and can in principle also be calculated by studying the pion mass dependence with lattice QCD. This alternative theoretical ansatz leads to a major simplification in the lattice computation: one now considers a transition amplitude between single nucleon states N _PC⟶ N with a parity-conserving (PC) Lagrangian, which from a numerical point of view is more straightforward to handle in a lattice calculation. In particular, the complication arising from the pion-nucleon state is absent since the matrix element is computed for single nucleon initial and final states. In this work we investigate the computational concepts proposed in Ref. <cit.> in practice and propose a concrete numerical implementation to evaluate the nucleon 3-point functions with the 4-quark operator insertions of _PC. Of course the ensuing Wick contractions still comprise fermion loop diagrams, which were neglected in the first work <cit.>. We will argue that these diagrams and the renormalization procedure are intricately linked: in the lattice calculation these particular fermion loop diagrams generate power-divergent mixing with lower-dimensional operators, and we add an initial discussion about such power divergent terms and our future strategy for renormalizing the 4-quark operators. § OPERATORS AND COUPLING The matching between the parity-violating interaction in the electro-weak sector of the SM and the effective nucleon and pion degrees of freedom at energy scale Λ_QCD∼ m_proton has been worked out in Ref. <cit.>. Here, we largely follow the notation of the recent Ref. <cit.>. The Δ I = 1, parity-conserving Lagrangian is given by ^w_PC = -G_F/√(2) sin^2( θ_w )/3 ∑_i ( C^(1)_i θ^(ℓ)'_i + S^(1)_i θ^(s)'_i ) , C^(1) and S^(1) denote the Wilson coefficients obtained in 1-loop perturbation theory <cit.>. The 4-quark operators θ^(ℓ)' with only light quarks ℓ contributing and θ^(s)' with light and strange s quarks contributing read θ^(ℓ)'_1 = _a γ_μ 1 q_a _b γ^μ q_b , θ^(ℓ)'_2 = _a γ_μ 1 q_b _b γ^μ q_a , θ^(ℓ)'_3 = _a γ_μ 1 q_a _b γ^μ q_b , θ^(s)'_1 = _a γ_μ s_a _b γ^μ q_b , θ^(s)'_2 = _a γ_μ s_b _b γ^μ q_a , θ^(s)'_3 = _a γ_μ s_a _b γ^μ q_b , θ^(s)'_4 = _a γ_μ s_b _b γ^μ q_a . As a perturbative addition to pure QCD, the interaction Lagrangian Eq. eq:L-PC induces a proton-neutron (pn) mass splitting ( δ m_N )_4q = 1/m_N p \| ^w_PC(0) \| p = -1/m_N n \| ^w_PC(0) \| n , and with the PCAC relation the leading contribution to the coupling comes from the mass splitting ≈ -1/F_π (δ m_N)_4q/√(2) , where F_π denotes the pion decay constant in the chiral limit. In the following this work is mainly concerned with the lattice QCD estimate of the operator matrix elements N \| θ^(f)_i(0) \| N for f = ℓ, s and N the proton and neutron. § 4-QUARK OPERATOR MATRIX ELEMENTS FROM THE LATTICE To determine the nucleon matrix elements of the 4-quark operators in Eq. eq:4q-op we follow the Feynman-Hellmann-Theorem technique advocated for in Ref. <cit.>. The relevant correlation functions result from inserting the individual operators θ^(f)'_i(x) into the proton or neutron 2-point function, summed over all lattice sites x. The nucleons are interpolated by the usual zero-momentum, positive parity proton and neutron 3-quark operators N^+_α(t) = P^(+)_αα' ∑_ ϵ_abc u_a(t,)^T C d_b(t,) u_α' c(t,) N^0_α(t) = P^(+)_αα' ∑_ ϵ_abc d_a(t,)^T C u_b(t,) d_α' c(t,) with (positive) parity projector P^(+) = 1/2 ( 1 + γ_0 ) and C the charge conjugation matrix. From these we construct the 2- and 3-point functions C_2pt(t) = N(t+t_i) N̅(t_i) , C_3pt(t) = ∑_x N(t+t_i) θ^(f)'_i(x) N̅(t_i) . The different types of Wick contractions following from Eq. eq:c3pt are depicted in Fig. <ref> in diagrammatic form. We distinguish three types of diagrams: those containing quark loops, denoted B and D, and without a quark loop, denoted W. Note that the latter type is the only one included in the calculation of Ref. <cit.>. For the quark loop diagrams, we further make a technical distinction between type D, where the fermion loop is individually spin-color traced and type B, where it is not. Quark-disconnected diagrams are neglected, since by virtue of the flavor structure of the operators in Eq. eq:4q-op such diagrams cancel in SU(2) flavor symmetric QCD, which we work in. We connect the 2- and 3-point functions in Eqs. eq:c2pt, eq:c3pt to the nucleon matrix element by spectral decomposition and the Wigner-Eckart-Theorem C_2pt(t) = ∑_σ -m_N t0 \| N(0) \| n,σ n,σ \| N̅(0) \| 0/2m_N + … C_3pt(t) = (t/a+1) n \| θ^(f)'_i \| n/2m_N -m_N t ×∑_σ 0 \| N(0) \| n,σ n,σ \| N̅(0) \| 0/2m_N + … . Here \| 0 ⟩ denotes the QCD vacuum state , \| n,σ⟩ the nucleon ground state with zero 3-momentum and spin-1/2 component σ. In Eq. eq:spectral-decomp-2 we use the spin-independent matrix element n, σ \| θ^(f)'_i(0) \| n, σ' = δ_σ σ' n \| θ^(f)'_i(0) \| n , for the Lorentz-scalar operator θ^(f)'_i. With ellipsis we denote excited state contributions as well as contributions from different time-orderings, which are at most of order t^0. A detailed account of the application of the Feynman-Hellmann-Theorem (FHT) to the calculation of nucleon matrix elements can be found in Ref. <cit.>. According to FHT, in the vacuum \|λ⟩ including the perturbation λ ^w_PC in the action we can determine the effective mass of the nucleon state for sufficiently large t by m_eff^(λ)(t \| τ) = 1/τ arccosh( C_2pt^(λ)(t+τ) + C_2pt^(λ)(t-τ) /2 C_2pt^(λ)(t)) = m_eff(t \| τ) + λ/2 (δ m_N)_4q + λ^2 , up to excited state contamination, and m_eff as well as the matrix element for (δ m_N)_4q are taken in pure QCD. Taking the derivative with respect to λ we then obtain the desired matrix element by studying the dependence on source-sink separation t as well as offset τ of the ratio R(t,τ) = ξ/√(ξ^2-1)× ×1/τ ( C_3pt(t+τ) + C_3pt(t-τ) / C_2pt(t+τ) + C_2pt(t-τ) - C_3pt(t) /C_2pt(t) ) , t large⟶n \| θ^(f)'_i \| n/2 m_N ξ = C_2pt(t+τ) + C_2pt(t-τ) /2 C_2pt(t) , again up to excited state contamination. We determine R per individual operator θ^(f)'_i by fitting the ratio to a constant for various ranges in t and τ. Evaluation of diagrams We evaluate the Wick contractions by a combination of point-to-all, stochastic and sequential quark propagators. The point-to-all propagators ψ^(x_i,α,a) result from solving the lattice Dirac equation for a spin-color diluted source with support at a single lattice site S^βα_ba(x; x_i ) = D^-1_β,β'^b,b'(x,y) [ δ_x_i,y δ_α,β' δ_a,b'] . From the point-to-all propagators the nucleon 2-point functions are evaluated in the usual way. The quark loop in diagrams B and D in Fig. <ref> is constructed by a fully time, spin and color diluted stochastic timeslice propagator, L(x)^ab_αβ = ∑_t,γ,c D_u^-1_ακ^ad(x;y) ( η(t,) δ_t_y,t δ_γ,κ δ_d,c) × ×( η(t,) δ_t_x,t δ_γ, β δ_b,c) , where η(t,) ∈ {± 1 } are independent and identically with zero mean and unit variance E[ η(t,) ] = 0 , E[ η(t,) η(t,) ] = δ^(3)_, . To apply the FHT method we must sum the 3-point function with insertion of the 4-quark operator at each lattice site. We realize this summed simultaneous insertion by using the sequential inversion method: to that end we construct the two sequential sources for B- and D-type S^(B)(x; x_i) = Γ L(x) Γ S(x; x_i) , S^(D)(x; x_i) = Γ L(x) Γ S(x; x_i) . Here Γ is one of the relevant Dirac matrices Γ = γ_μ or Γ = γ_μ. The Lorentz index μ is actually summed over at this stage. By repeated inversion of the Dirac operators on these sources we obtain the sequential propagators T^(B) and T^(D) for B and D diagram, respectively, given by T^(K)(y; x_i) = ∑_x D^-1(y; x) S^(K)(x; x_i) , K = B, D . The ensuing contractions for C_3pt are analogous to those for C_2pt, using T^(B) and T^(D). For the W diagram in Fig. <ref> we again use the stochastic sequential propagator technique to split the four quark lines connecting at the insertion point into two pairs. The relevant term of propagators through the insertion point then reads ∑_x S_1(y; x) Γ S_1(x; x_i) × S_2(y; x) Γ S_2(x; x_i) = ∑_x,z S_1(y; x) Γ S_1(x; x_i) × S_2(y; z) Γ S_2(z; x_i) ×δ^(4)_x,z = ∑_x,z S_1(y; x) Γ S_1(x; x_i) × S_2(y; z) Γ S_2(z; x_i) × ×E[ η(x) η(z)] , with binary noise vector η(x) as in Eq. eq:binary-source, and subscript 1,2 denoting the quark propagator flavor. We thus generate a set of independent binary noise sources η^r, r=1,…,N_r as in Eq. eq:binary-source, and the corresponding sequential sources and propagators S^(W),r(x; x_i) = Γ η^r(x) S(x; x_i) , T^(W),r(y; x_i) = ∑_x D^-1(y; x) S^(W),r(x; x_i) , and by Eq. eq:decomp-unity the product of two such sequential propagators from independent noise sources produces in the expectation value the four quark lines connected at a single site, which is summed over the lattice. Fierz rearrangement The operators in Eq. eq:4q-op fall into two classes with respect to their spin-color structure: θ^(f)'_1 , θ^(f)'_3 for f = ℓ, s consist of products of quark bilinear terms, i.e. _1 Γ q_1 ×_2 Γ q_2. The remaining operators θ^(ℓ)'_2 and θ^(s)'_2, θ^(s)'_4 have cross-linked color and spinor indices. We refer to those as “color-crossed” operators for short. These matrix elements of the color-crossed operators can be computed in two different ways. The first one is to compute the contractions corresponding to the color-crossed operators. This is achieved by using color dilution of the sequential sources S^(W),r in Eq. eq:W-seq: adding color indices a,b,c we thus have S^(W),r,a_bc(x; x_i) = Γ η^r(x) S_ac(x; x_i) δ_a,b . The second way is to apply a Fierz rearrangement in order to transform the color-crossed operators into products of standard quark bilinear factors, thereby avoiding the need for color dilution. Then, the analogous methods discussed above for the non color-crossed operators are applied. For instance θ^(ℓ)'_2 is equivalently represented as θ^(ℓ)'_2 = u_α,a^* (γ_μ)_αβ u_β,b u_γ,b^* (γ_μ)_γδ u_δ,a - [ u ↔ d ] = 1/2 γ_μ u γ_μ u + 1/2 γ_μ u γ_μ u - 1 u 1 u + u u - [ u ↔ d ] , where by [ u ↔ d ] we denote the same term as written explicitly, but up replaced by down quark flavor. The strange operators are treated accordingly. Thus, instead of the list of operators in Eq. eq:4q-op, we consider only the quark bilinear forms Γ q Γ q , Γ q Γ s , Γ q Γ s , q = u, d with as before Γ = {γ_μ}, {γ_μ}, but also in addition Γ = 1,. § LATTICE COMPUTATION For our numerical study we use a gauge field ensemble from the Extended Twisted Mass Collaboration <cit.> with dynamical up, down, charm and strange quark. The ensemble has a lattice volume of 32^3×64, a lattice spacing of a ≈ 0.091 fm and, thus, a spatial lattice extend of L=3.1 fm. The pion mass value is m_π = 261(1) MeV, m_π· L=4 and the nucleon mass value is m_N=1028(4) MeV. The strange quark mass is tuned to its physical value. The simulated action features a light mass degenerate quark doublet of twisted mass fermions at maximal twist guaranteeing O(a) improvement <cit.>, amended by a Sheikholeslami-Wohlert “clover” term included to reduce residual a^2 lattice artifacts. The charm-strange doublet is again of twisted mass type, including a quark mass splitting term <cit.>. The heavy doublet action is not flavor diagonal, which needlessly complicates the calculation of correlation functions involving strange quarks. For the present study we thus use a mixed-action approach, by the addition of a doublet of Osterwalder-Seiler (OS) strange quarks <cit.>, analogous to the light quark doublet. The bare OS strange quark mass value, which is not critically important yet for this exploratory investigation, has been tuned such that the Ω baryon mass assumes its physical value. The lattice action determines symmetry properties in our computation and these are relevant for the discussion of renormalization and mixing. We thus reprint the detailed formulas for sea and valence quark action in the App. <ref>. Contributions from B and D diagram type For later discussion it will be valuable to consider the contribution to the nucleon 3-point functions for the individual operators from the combined B and D diagram type and the W-type separately, motivated by the fermion loop present in B and D-type diagrams, but not in W-type diagrams. To determine the estimate for the matrix element we fit the ratios R(t,τ) to a constant in various ranges t_min≤ t ≤ t_max together with various sets {τ_1,…,τ_n} of joint data sets. The fits are correlated with a block-diagonal covariance matrix, where we neglect the correlation between different τ-values, i.e. we set cov( R(t,τ) , R(t',τ') ) = 0 for all pairs ττ'. Including cross-τ elements renders the covariance matrix near-singular and distorts the fit with bad estimates of said elements. To each fit we assign an Akaike Information Criterion (AIC) weight following the procedure in Ref. <cit.>, which is given by w_fit = exp( -1/2 ( χ^2 + 2 N_param - N_data ) ) with χ^2 based on the block-diagonal covariance matrix, N_param the number of fit parameters (one for our fit to constant), and N_data the number of data points ( R(t,τ) values ) entering the fit. Moreover, the fits are bootstrapped and we obtain the fit parameter uncertainty from the variance over bootstrap samples. The ranges for t and τ applied in the fits are given by 1 ≤ t_min / a ≤ 10 , 10 ≤ t_max / a ≤ 17 , 2 ≤τ / a ≤ 6 . The boundaries are based on observation, where a meaningful fit is accessible, and given our current accuracy the above choice covers all such ranges. Note in addition, with the symmetric ratio in Eq. eq:fht-2, the maximal addressed ratio value involves data at t_max+τ. Finally, we restrict the set of parameters in our fits to a single constant (for the matrix element). At present level of statistical uncertainty per R(t,τ) data point, in most t/τ ranges we cannot model excited state contamination in our data with any statistical significance. From all available fits with best fit parameter μ_i and error σ_i and AIC weight w_i we build the combined distribution function <cit.> (x) = ∑_i w_i 𝒩_μ_i, σ_i(x) / ∑_j w_j . 𝒩_μ,σ is the normal distribution with mean μ and variance σ^2. Based on (x) we quote the median of the distribution function as the central value and the 16 % and 84 % quantiles as the uncertainty interval. In Fig. <ref> we present the ratio R^(ℓ)'(t, τ) as a function of t for different values of τ for the B and D-type operators. In addition we include the result of the AIC weighting procedure as gray bands. The distribution functions and quantiles corresponding to the AIC procedure are shown in Fig. <ref> in App. <ref>. Contributions from W diagram type The analysis of the W diagram contribution proceeds analogously to the B+D case. We show the ratio data R(t,τ) per operator in Fig. <ref> with our estimate for the matrix element as the gray band. Fig. <ref> (App. <ref>) correspondingly justifies this estimate at the level of the cumulative distribution function. Diagrams with strange quarks For the strange operators θ^(s)' in Eq. eq:4q-op, only one diagram type contributes per operator. These are D-type contributions for θ^(s)'_1, 3 and B-type contributions for θ^(s)'_2, 4, the latter only when using Fierz rearrangement for these two operators. Still, whether B or D, only strange quark loop diagrams occur in this case. Here, we circumvent the technical complication of unitary strange and charm flavor mixing by the twisted mass heavy quark action Eq. eq:action_sc and employ the aforementioned mixed action approach with a strange quark doublet (s_+, s_-), analogously to the light quark doublet. This means the strange operators matrix elements are determined similarly to the one for θ^(ℓ)', with the replacement of the light quark loop by the strange quark loop, L_u(x) → L_s(x). Since the two strange quark flavors in the doublet (s_+, s_-) are identical in the continuum limit, we insert the strange quark loop averaged over both strange quark flavors. Using -hermiticity, in detail we then define L̅_s(x) = 1/2 ( L_s_+ + L_s_-) = 1/2 ( L_s_+ + L_s_+^† ) , L_s_± = D_s_±^-1 η η^t . We show the lattice data and the matrix element fit result for the ratios R^(s)'(t,τ) in Fig. <ref>. The application of the AIC cumulative distribution functions defined in Eq. eq:aic-2 is shown in Fig. <ref> in App. <ref>. Discussion of matrix elements from BDW diagrams All results for the matrix elements are compiled in Tabs. <ref> for light quark operators and <ref> for the strange quark operators. They are given per operator flavor f = ℓ, s, operator number k and as a third label we give the diagrams contributing. In Tab. <ref> we observe a difference in magnitude between B+D and W diagram contributions for each individual operator by two orders of magnitude. Our explanation here mixing with operators of lower (and equal) mass-dimension, in the case of B and D diagrams. The latter two types contain a quark loop and we argue in Sec. <ref> below, that mixing of the 4-quark operator is permitted, starting with local quark-bilinear operators. By naive visual inspection, the structure of the W diagram on the other hand, does not allow for such mixing and in Sec. <ref> below we use solely its contribution to arrive at an estimate of in analogy to Ref. <cit.>. The strange quark operators θ^(s)'_k are entirely built from B- and D-type diagrams, albeit with the strange quark flavor running inside the fermion loop. These operators are therefore equally prone to mixing as the light quark operators. This mixing of {θ^(ℓ)'_k , θ^(s)'_k } in lattice QCD with lower dimensional operators does not come entirely unexpected, given the dimension 6 of the operators and the reduced symmetry of the lattice model. We add several comments on potential subtractions and renormalization in Sec. <ref> below. A second feature is the antisymmetry of ^(ℓ)'_1 and ^(ℓ)'_3. The opposite-equal values can be shown for the bare matrix element at tree-level of perturbation theory. Beyond that, we are currently unaware of a symmetry argument, that would enforce this property at the non-perturbative level. § BARE COUPLING FROM W-TYPE DIAGRAM We put our present study in perspective to the work of Ref. <cit.> by taking an analogous approach: we only include the contribution from the W-type diagram and ignore the multiplicative renormalization and the mixing to match the lattice result to the MS scheme, while still using the Wilson coefficients from renormalized perturbation theory. Thus, we evaluate the combination of matrix elements ^(ℓ)'_i = N \| θ^(ℓ)'_i \| N/(2 m_N) _C = ∑_i=1^3 C^(1)_i ^(ℓ)'_i . Based on the sets of bootstrapped fits with their associated AIC weights, we construct the cumulative distribution function for _C by first building all combinations of fits for ^(ℓ)_i, i=1,2,3, then determining the mean and error from bootstrap mean and variance of the sample-wise built linear combination in Eq. eq:W-1, and finally assigning to each such combination of fits the AIC weight as the product of weights from the three individual matrix element fits. The resulting cumulative distribution function is shown in Fig. <ref>, together with the median (α = 0.5 quantile) and the confidence band from the α = 0.16 , 0.84 quantiles. From the matrix element estimate _C we determine the bare coupling based on the W-type diagrams by multiplying the numerical factors from the effective Lagrangian. ( W, bare) = G_F· (ħ c /a)^2 sin^2(θ_W)/3 a f_π × a^4 C^(1)_i N \| θ^(ℓ)'_i(0) \| N /2 am_N In Eq. eq:h-1 we restored all explicit factors of the lattice spacing a to have dimensionless quantities only.[The nucleon state has mass dimension -1, due to normalization N, \| N,' = 2E_N() L^3 δ_' in finite volume L^3.] The pion decay constant for the gauge field ensemble considered has been determined in Ref. <cit.> with value in lattice units af_π = 0.06674 (15). The only explicit use of the lattice spacing is made to convert the Fermi constant G_F as an external scale to lattice units. We use the value a = 0.09076 (54) fm from Ref. <cit.>. For the matrix elements combined with the Wilson coefficients in lattice units we find a^4 C^(1)_i N \| θ^(ℓ)'_i(0) \| N /2 am_N = 1.27 _13^17· 10^-2 , and together with the conversion factor with Standard Model parameters from PDG <cit.> converted to lattice units G_F· (ħ c /a)^2 sin^2(θ_W)/3 af_π = 6.367 ( 77 ) · 10^-5 , the result for the bare coupling is then ( W, bare) = 8.08 ( 98 ) · 10^-7 . The result in Eq. eq:hpione-estimate as representative of a lattice estimate of is by construction very preliminary. Conceptually, in its underlying restrictions it is similar to the first lattice determination in Ref. <cit.>, which found ( Wasem 2012) = (1.099 ± 0.505) ^+0.058_-0.064· 10^-7 , at m_π≈ 389 pion mass and with a coarser lattice a = 0.123. We recall, that the computational ansatz of both lattice calculations differs fundamentally in using a parity-violating versus parity-conserving interaction Lagrangian. Moreover, our preliminary result for (W, bare) is of compatible by order of magnitude with the recent experimental value (exp) = 2.6 (1.2)_stat (0.2)_syst· 10^-7 . § COMMENTS ON MIXING AND OUTLINE OF RENORMALIZATION The renormalization of the set of 4-quark operators in Eq. eq:4q-op in continuum QCD has been discussed in Refs. <cit.>, and finds its expression in the Wilson coefficients { C^(1)_i, S^(1)_i } which are calculated in renormalized QCD perturbation theory in the scheme, together with their anomalous dimension matrix. In continuum QCD with the mass-independent scheme and dimensional regularization, mixing with operators of lower dimension is excluded. Here we comment on the situation in the practical lattice QCD calculation, with Wilson-type fermions and non-zero quark mass. The explicit breaking of proper Lorentz symmetry down to discrete 3-rotations and to non-equivalence of spatial and temporal direction (due to T L) does not play a significant role for the 4-quark operators, which are invariant under a 3- and 4-dimensional rotation. Of practical importance in this numerical calculation with Wilson-type fermions is the breaking of chiral symmetry, of up-down SU(2) flavor and parity symmetry. We focus in these introductory remarks on the light quark propagators θ^(ℓ)'. Twisted Mass fermions The symmetries of the twisted mass lattice action for the light quarks are listed in Eqs. eq:tra-C, eq:tra-P, eq:tra-T, eq:tra-R5, eq:tra-Dd and eq:tra-Sud in the App. <ref>. Based on these lattice symmetries we identify the operators which are allowed to mix, i.e. which are not excluded by quantum numbers under those symmetry transformations. These quantum numbers are for the (light) 4-quark operators Operator [-m_f] [-m_f] _5 θ^(ℓ) ' +1 +1 +1 +1 -1 The mixing candidate operators of mass-dimension 3 to 5 are given by dim 3 ⊗1 q 4 m_ℓ 1⊗ q, D⊗ q 5 m_ℓ^2 ⊗1 q , m_ℓ D⊗1 q, D^2 ⊗1 q, σ_μν G̃_μν q, m_ℓ GG̃ Here, 1 denotes the unit matrix in spinor and flavor space, respectively, and G̃_μν = ϵ_μναβ G_αβ the dual (lattice) gluon field strength tensor.[On the same footing there are mixing candidate operators of dimension 6. These, however, cause at most logarithmic divergent scaling violations, which we defer to later discussion.] The dimension-3 operator is allowed by breaking of parity symmetry by the twisted mass fermion action. The dimension-4 operators are allowed by chiral symmetry breaking, which in addition to having opposite _5 parity to θ^(ℓ)' is indicated by the explicit factor of the fermion mass m_ℓ. Both operators are connected by the equation of motion for the quark field. Analogous statements hold for the dimension-5 operators. Mixing with such operator matrix elements hampers the extraction of the renormalized 4-quark operator matrix elements in the continuum limit, due to power-divergent mixing coefficients 1/a^3 and 1/a^2 for dimension-3 and -4 operators, respectively. A suitable scheme to subtract such contributions appears to be the gradient flow together with the short flow time expansion <cit.>. The practical application to the twisted mass case is currently under investigation. We mention two other setups, which are of interest in this study of the method using parity-even 4-quark operators. Iso-symmetric Wilson fermions Wilson fermions observing SU(2) isospin symmetry have individual parity and exchange symmetry (cf. Eqs. eq:tra-C-eq:tra-Sud). What remains is the explicit chiral symmetry breaking by the Wilson term. In this case the dimension-3 operator is ruled out by parity symmetry. However, the dimension-4 operator m_ℓ 1⊗ q (and thus the related D⊗ q) is still allowed to mix. Parity-odd 4-quark operators This case was investigated in Ref. <cit.>, with iso-symmetric clover-improved Wilson fermions. In this case, using parity , charge conjugation and exchange symmetry is sufficient to show, that there is no operator of dimension 3, 4 or 5, that can mix on the lattice with the operators of _PV^w. The different mixing properties in the lattice QCD calculation with Wilson-type fermion regularization appear as a major drawback of using the PCAC relation and converting to the parity-conserving Lagrangian. However, in the parity-violating case the accurate representation of the nucleon-pion state with the Lüscher method and the ensuing signal-to-noise problem from the meson-baryon interpolator pose potentially even harder problems, especially towards physical pion mass and large lattice volume. § CONCLUSION In this work we investigated the numerical implementation of a new method to calculate nucleon matrix elements of parity-even flavor-conserving 4-quark operators from lattice QCD, that pertain to the fully theoretical prediction of the long-range nucleon-pion coupling . This constitutes the first step towards a full-fledged calculation of the coupling from a combination of chiral perturbation theory and non-perturbative lattice matrix elements. For one ensemble at pion mass 260 and lattice spacing a ≈ 0.091 we demonstrated for the first time the calculation of all relevant (bare) matrix elements at the level of 10 % combined statistical and systematic uncertainty. The specific implementation shown here is readily and feasibly scalable towards physical pion mass, continuum and infinite volume. We achieve this result due to the simplified representation of the coupling by application of the soft-pion-theorem and the implied sufficiency to calculate (single-hadron) nucleon matrix elements of parity-even operators. Of course, corrections to this leading order defining relation in χPT, though expected to be small, can in principle be computed and, therefore, the approximation is systematically improvable. However, renormalization of lattice matrix elements poses a challenge due to mixing with lower-dimensional operators. This mixing comes about due to reduced symmetries at non-zero lattice spacing and explicit breaking of chiral symmetry due to finite quark mass values. The Gradient Flow method for subtracting power-divergent mixing and renormalization appears as promising direction to study, due to the possibility to study mixing and matching to a continuum renormalization scheme only after extrapolating lattice data to the continuum, and thus with restored symmetries. The investigation of its practical implementation for the pertinent 4-quark operators is our on-going work. We are grateful to Andrea Shindler, Tom Luu and Jangho Kim for useful discussions on the subject of renormalization. This work is supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) and the NSFC through the funds provided to the Sino-German Collaborative Research Center CRC 110 “Symmetries and the Emergence of Structure in QCD” (DFG Project-ID 196253076 - TRR 110, NSFC Grant No. 12070131001) The open source software packages tmLQCD <cit.>, Lemon <cit.>, QUDA <cit.>, R <cit.> and CVC <cit.> have been used. § LATTICE ACTION AND SYMMETRIES Light quark lattice action The lattice action of up and down quark for twisted mass fermions with a clover term is given by ^(ℓ) = a^4 ∑_f=u,d ∑_x _f(x) ( γ_μ ∇̅_μ - i W_cr + m_f + r_f ac_SW/4 σ G ) ψ(x) , with Wilson parameters r_u = 1 = -r_d. In Eq. eq:action_l we have covariant derivative ∇̅_μ = 1/2 ( ∇^f_μ + ∇^b_μ) , the subtracted Wilson term of dimension 5 W_cr = - a r_f/2 ∇^f_μ ∇^b_μ + M_cr(r_f) , and the Sheikholeslami-Wohlert term again of dimension 5 and with the clover-plaquette-based lattice field strength tensor G <cit.>. The form of the twisted mass lattice action eq:action_l is valid in the physical basis of the quark fields, i.e. where the mass term is real and diagonal, at maximal twist <cit.>, such that automatic a improvement is realized for physical observables. Discretization of the strange quark fermion action For the strange quark we employ the mixed action technique, with different fermion discretization used for the sea quarks pertaining to gauge field sampling and to the valence quark, used for the actual calculations of correlation functions. The sea quark action is given in Ref. <cit.> and to realize a mass splitting and automatic a improvement features mixing strange and charm sea quark flavor by lattice artifacts. ^(s,c)_sea = a^4 ∑_x _h(x) ( γ_μ ∇̅_μ - i τ^1 W_cr + μ_σ + μ_δ τ^3 + ac_SW/4 τ^1 σ G ) ψ_h(x) , where ψ_h = (c, s)^T denotes the strange-charm doublet, μ_σ the average bare quark mass of the doublet and μ_δ the mass splitting. The bare mass parameters μ_σ, μ_δ are tuned by the two conditions of physical D_s meson mass, as well as the renormalized quark mass ratio . m_s / m_c\|_MS,μ = 2. To simplify the calculation of nucleon correlators with strange operator insertion we follow the mixed action approach in Ref. <cit.> and introduce another doublet of twisted mass valence strange quarks (s_+,s_-). It is formally identical to the light quark doublet, except for the value of the bare twisted quark mass m_ℓ→ m_s. In particular it shares the critical hopping parameter (as tuned to maximal twist), and the Sheikholeslami-Wohlert parameter c_SW with the light quark sector. The bare quark mass m_s at maximal twist is given by twisted quark mass parameter m_s = μ_s and the latter is tuned, such that the mass of the Ω baryon takes the physical value. Symmetry transformations for light quarks We list the complete set of discrete transformations, which pertain to our identification of operator mixing for the 4-quark operators. Apart from those listed here, there are the 3-rotations, and the residual (continuous) U(1)_3 flavor symmetry, under which the lattice action is invariant. The discrete transformations of charge conjugation C, parity P and time reversal T are given by ψ(t,) C→ C^-1 (t,)^T , (t,) C→ -ψ(t,)^T C U_μ(t,) C→ U_μ(t,)^* ψ(t,) P→γ_4 ψ(t,-) , (t,) P→(t,-) γ_4 U_4(t,) P→ U_4(t,-) , U_k(t,) P→ U_k(t,--a k̂)^† ψ(t,) T→ iγ_4 ψ(-t,) , (t,) T→ -i(-t,) γ_4 U_4(t,) T→ U_4(-t-a,)^† , U_k(t,) T→ U_k(-t,) In addition to the discrete Lorentz transformation there are several spurious transformations ℛ_5 : {ψ→ ψ , → - } 𝒟_d : {ψ→3/2π i ψ , →3/2π i U_μ(x) → U_μ(-x-aμ̂)^† } 𝒮_u,d : { u / d → d / u , / → / } The transformations eq:tra-C, eq:tra-P, eq:tra-T, eq:tra-R5, eq:tra-Dd and eq:tra-Sud form a complete set to define the light quark action and form operator multiplets eligible for mixing. The following transformations are symmetries P ×𝒟_d × (m_f → -m_f) , T ×𝒟_d × (m_f → -m_f) , 𝒞 , 𝒟_d ×ℛ_5 , P ×𝒮_u,d , where the spurious transformation m_f → -m_f denotes the change of sign of the bare mass parameters. § AIC CUMULATIVE DISTRIBUTION FUNCTIONS
http://arxiv.org/abs/2306.03103v1	20230602095515	Sampling and Ranking for Digital Ink Generation on a tight computational budget	[ "Andrei Afonin", "Andrii Maksai", "Aleksandr Timofeev", "Claudiu Musat" ]	cs.HC	[ "cs.HC", "cs.CL" ]	EPFL, Lausanne, Switzerland Google Research, Zürich, Switzerland Sampling and Ranking for Digital Ink Generation on a tight computational budget Andrei Afonin1work done as a student researcher at Google Research, Zürich, SwitzerlandThese authors contributed equally to this work and share first authorship Andrii Maksai2[2] Aleksandr Timofeev1[1] Claudiu Musat2 July 31, 2023 ============================================================================================================================================================================================================================== Digital ink (online handwriting) generation has a number of potential applications for creating user-visible content, such as handwriting autocompletion, spelling correction, and beautification. Writing is personal and usually the processing is done on-device. Ink generative models thus need to produce high quality content quickly, in a resource constrained environment. In this work, we study ways to maximize the quality of the output of a trained digital ink generative model, while staying within an inference time budget. We use and compare the effect of multiple sampling and ranking techniques, in the first ablation study of its kind in the digital ink domain. We confirm our findings on multiple datasets - writing in English and Vietnamese, as well as mathematical formulas - using two model types and two common ink data representations. In all combinations, we report a meaningful improvement in the recognizability of the synthetic inks, in some cases more than halving the character error rate metric, and describe a way to select the optimal combination of sampling and ranking techniques for any given computational budget. § INTRODUCTION Digital ink (online handwriting) offers users of digital surfaces a way of expression similar to pen and paper. This mode of expression is gaining popularity with the increasing adoption of styluses and digital pens for tablets. In its digital form, ink is a medium that offers rich possibilities for personalized intelligent assistance for creativity and productivity. One direct way of offering the assistance is via ink synthesis, enabling user-facing features such as handwriting autocompletion, spelling correction, beautification, assisted diagramming and sketching. Making these assistance experiences convenient and comfortable requires maximizing the output quality of the models, while respecting privacy and latency constraints. The same is true of other types of generated content, but standards might be higher in the case of digital ink generation, for example: * Since assistive handwriting content appears in the same space as the content generated by the user, it's vital that the generated content is readable and not look "out-of-place". The users of generative image models for content creation purposes might be more forgiving to model mistakes, because there the model assists in the creative process where the users don't necessarily know what exactly they are looking for. * Personalized assistive handwriting often requires the models to observe the user's handwriting and transfer that style to the generated output. Unlike other modalities, handwriting is a personally-identifiable data. Therefore, it is important for the models to run on-device, rather than server-side. * Generating suggestions (for example when doing autocompletion in handwriting) requires the models to be fast enough to produce their suggestions before the user has moved on or decided to add new content themselves. When the content is produced too slowly, it gets in the way of the user's flow rather than helping. This problem is further exacerbated by the constraint that the models run on-device. In this work, we aim, given a trained generative model of digital ink and a computation budget, to produce readable outputs as often as possible, under the assumption that the model is going to be run on-device. To achieve this goal, we consider two classes of approaches that work well together. Sampling. This constrained ink modelling problem resembles text and audio generation. Following the work that has been done there <cit.>, we first concentrate on using perturbed probability distributions for sampling from autoregressive models. This improves the quality within a single inference call, by picking a sampling technique that minimizes the number of repetitive or incoherent samples. Examples of generated digital ink can be found in Fig. <ref>. Ranking. We additionally train ranking models to predict the recognizability of an ink. We employ these models by first generating a diverse set of candidates and then ranking them to select the best output. This improves the quality if the time budget allows for multiple inference calls. Our proposed ranking approach would actually work for any binary quality measure (like thresholded L_2 distance in the style embedding space for style transfer <cit.> or edit-aware Chamfer distance for spelling correction <cit.>), but we focus on recognizability, since likely for any application of digital ink synthesis, the output should be recognizable. Our contributions are as follows[A notebook accompanying this submission that can run inference on example models for each dataset, data representation, and model type, and includes test label sets, is available here: <https://colab.research.google.com/drive/1AkwmDOkEIkifbOYEBdcB9PrR_Ll-fcmz>]: * We use sampling and ranking techniques for digital ink generation, and perform an ablation study on the ranking model objective, training, and tuning. To our knowledge, ours is the first work on this topic in the digital ink space. * We show that selecting appropriate sampling parameters improves the quality of the output significantly compared to the typically used baselines, across multiple datasets, model types, and data representations. * We show that ranking further improves the quality, and discover that depending on the computational budget, the highest quality ranking models may not lead to optimal quality. We provide practical way of selecting the ranking model. § RELATED WORK Errors in autoregressive generative models. Autoregressive generative models often generate samples with artifacts <cit.>. Artifacts appear when the generation process gets stuck in either high- or low-probability regions of the sampling space, and results in two types of errors, overconfidence (usually manifested as repeated tokens) <cit.> and incoherence errors, respectively. We show examples of such errors during Digital Ink generation process in Fig. <ref>. This is also known as the likelihood trap <cit.> and stems from exposure bias <cit.>, which is difference between training done with 'teacher forcing' and inference <cit.>. Sampling. One common way of finding the trade-off between overconfidence and incoherence errors, often used in Text-to-Speech (TTS) and Natural Language Processing (NLP), is sampling <cit.>, which modifies the distribution from which the points in the autoregressive model are sampled. Sampling from original distribution is called ancestral sampling; popular sampling techniques that extend it include Top-K <cit.> and Top-P, or nucleus <cit.> sampling. Originally introduced for text generation, they propose picking a word from the distribution of the top most likely next words, limited by either number (in Top-K) or cumulative probability (in Top-P). Variations of the sampling techniques above include Typical sampling <cit.>, which selects components closest to a dynamically selected probability, Mirostat sampling <cit.>, which select K in Top-K sampling adaptively, and Beam search <cit.>. Ranking models. Another way to improve the generation quality is to generate several samples and choosing the best one among them. This is frequently done in information retrieval domains such as question answering <cit.>, text summarization <cit.>, and code generation <cit.>. Approaches most similar to ours are the ones that use ranking models for conditional generative modeling. In <cit.>, the ranking model is trained to predict the best text continuation, with positive samples coming from real text and negative samples coming from different parts of the text and model-generated continuations. In <cit.>, two ranking models are trained to predict the match between the generated audio and the target label, as well as between the generated audio and the source audio used for style extraction. They are combined with weights specified by the user, to rank audio generated with specific style. Handwriting synthesis. Two of the most popular models for digital ink generation are multi-layer LSTMs with monotonic attention over the label <cit.> (also known in TTS as Tacotron <cit.>) and the encoder-decoder Transformer architecture <cit.>. Other architectures include VRNN <cit.> used in <cit.>, Neural ODEs <cit.>, and Diffusion models <cit.>. These architectures underpin applications such as sketch generation <cit.> and completion <cit.>, style transfer <cit.>, beautification <cit.>, spelling correction <cit.>, and assisted diagramming <cit.>. Metrics for evaluating the quality of digital ink generative models of text typically include Character Error Rate for text generation readability <cit.>, writer identification for style transfer <cit.>, and human evaluation <cit.>. Most digital ink generation approaches use either ancestral sampling or greedy sampling, with exception of <cit.>, which uses biased sampling <cit.> for the task of generating the synthetic training data. To our knowledge, no studies on the effects of sampling and ranking for digital ink generation have been performed. Similarly, no studies have looked at the relationship between the generation speed and quality. § METHOD Given an autoregressive generative model of digital ink that takes a text label as input and produces a sequence representing digital ink as output, we are interested in maximizing the average quality M_Θ_S,Θ_R(S, B, R) of the model output, while guaranteeing that the maximum inference time does not exceed a certain threshold 𝒯_𝓂𝒶𝓍. Here, S is the sampling method used by the generative model, B is the size of the batch for generation, and R is an inference-time parameter of the ranking model, Θ_S are fixed trained weights of the model, Θ_R are the trainable parameters of the ranking model, which we will describe below. During inference, given a label, the generative model will use sampling method S to produce a batch of B digital inks, which will be scored according to the ranking model Θ_R. The highest-ranking sample will be returned as the output; if B=1, the ranking model is bypassed. Fig. <ref> illustrates the approach. Our main results concern the trade-off between the inference time and model output quality, and are presented in Sec. <ref>. The rest of this section is organized as follows: we describe our approach to measuring quality and inference time in Sec. <ref>; Sec. <ref> outlines the data representation for digital ink and sampling methods S that can be used with it; Sec. <ref> describes the ranking models we use and how to train them. §.§ Evaluation We propose an evaluation method linked to the system's usability. Similar to other works <cit.>, as quality measure M we use the Character Error Rate (CER) of a trained handwriting recognition model on the generated samples. This stems from the assumption that the generated text is not useful if it is not readable, regardless of other attributes like style and beauty. A second axis of interest for usability is the inference time. We report the worst case inference time per character. We measure the worst case latency, with the assumption that exceeding the budget makes the functionality unusable for users. We measure time per character since processing time is expected to scale linearly with the sequence length. §.§ Data representation and sampling Two frequently used representations of the digital ink data are raw and curve representation, which both encode the ink as a sequence of input tokens in ℝ^d×{0,1}^2, with first d values describing the shape of the stroke between two points, and the last 2 binary values indicating whether (i) a particular token is at the end of the stroke, and whether (ii) it is the last token in the sequence (end of ink). For the raw representation, d=2 and describes the offset between two adjacent points, and for the curve representation, d=6 and describes the parameters of Bezier curve fit to a segment of the stroke <cit.>. Following the approach of <cit.> and most of the later literature on the topic, we parameterize the output distribution of every step of the autoregressive generative model by a set of parameters (π, μ, Σ, e_s, e_i), where π, μ, Σ describe weights, means, and covariances of a mixture of Gaussians, from which ℝ^d stroke parameters are sampled, and e_s and e_i describe the parameters of Bernoulli distributions from which the pen-up (end-of-stroke) and end-of-sequence events are sampled. Σ is full-covariance matrix for raw features (d=2) and diagonal otherwise. We provide more details in Sec. <ref>. Sampling. We consider two types of distortions for the output distribution: distortion of the mixture weights π and distortion of the diagonal components of the covariance matrix Σ. To distort the mixture weights, we consider several standard approaches: Top-K (parameterized by the value of K), and Top-P and Typical sampling (both parameterized by the value of P). To distort the covariance matrix, we subtract a sampling bias value b from the diagonal elements of the covariance matrix, before applying the softplus <cit.> function to it to ensure positive values. This reduces the variance after the model has been trained, to avoid sampling in low-confidence regions. The sampling parameters S=(s,m,b) are therefore the sampling method s∈{Top-K, Top-P, Typical}, the mixture parameter m, and the sampling bias value b. §.§ Ranking models Running a ranking model to order the generated samples may be computationally costly. For this reason, we differentiate between a process to rank all candidates and one that ranks only the most promising ones. Following the approach commonly used in information retrieval <cit.>, our ranking approach is two-staged, with a "fast" ranker ℛ_1 that runs on all B generated outputs simultaneously, and a slower, more trustworthy "good" ranker ℛ_2, which is used to re-rank the samples ranked highest by ℛ_1. The inference time parameter R of the ranking model, introduced at the beginning of this section, is the number of top samples according to ℛ_1 that are re-ranked by ℛ_2. When R=B, this corresponds to using only ℛ_2, and when R=1, only ℛ_1 is used. We describe both rankers below, and provide more details about them in Sec. <ref>. "Good" ranker ℛ_2. Since our goal is to generate samples with lowest possible Character Error Rate, an obvious choice for ℛ_2 to use the recognizer model that measures CER as the ranking model - that is, select the sample that is perfectly recognizable or has the lowest character error rate. However, running the recognizer on-device can be slow depending on the implementation, and we will see that having a faster first stage is beneficial. "Fast" ranker ℛ_1. Following the approach of <cit.>, our ℛ_1 ranker is a model learned to predict whether the generated sample is recognizable or not, that is, whether the recognizer would return the target label given the generated ink. In other words, this ranker is an approximation of the "good" ranker and tries to predict its output. Since inference time is one of the main focuses of our work, we consider a much simpler ranking model than the one described in <cit.>. Instead of looking at both the generated ink and target label, our ranker just uses the generated ink. It consists of two convolutional layers followed by global average pooling. We study this choice of ranking model in terms of inference speed and the types of errors that it can address in Sec. <ref>. Training dataset for ℛ_1. As described above, ℛ_1 ranker is trained to be a fast approximation of the ℛ_2 ranker, and it predicts whether synthesized ink is even close to being recognizable. To train ℛ_1, we don’t use real data: we use the synthesizer for generating a sample for a given text label, and ℛ_2 ranker for generating a binary label of whether the sample is recognizable (recognition result matches the text label) or not. The pair of generated ink and binary label is the training data for ℛ_1 (more details in Sec. <ref>). We first train the ranking model, and then, select the sampling method S that performs best on the 𝒟_tune dataset. Doing the reverse would require training a ranking model for each possible sampling parameter setting, which would be prohibitively expensive. This means that during training of ℛ_1, the sampling method is yet unknown. To accommodate this, we create the training dataset for ℛ_1 by generating samples with (s, m, b) selected at random, for each sample. This allows ℛ_1 to be robust to any future selection of S, so that the sampling parameters can be chosen after the ranker is trained. We evaluate this method of training dataset creation in Sec. <ref>. § RESULTS §.§ Setup To show that both sampling and ranking bring forth significant improvements in generation quality, and show the robustness of the proposed approach, we will evaluate it on 4 datasets across 3 different languages, with two frequently used model types, and two data representations. We consider 4 digital ink datasets for text generation: English <cit.> and <cit.>, Vietnamese <cit.>, and an internal dataset of mathematical expressions. We use two data representations described in Sec. <ref>, and , and evaluate two different model types, <cit.> and <cit.>. §.§ Implementation details For both and , we use 10-component Gaussian mixtures in the model output. For , we use one-hot encoding of labels and 3 layers of size 256 in the decoder. For , we use 2 layers with 4 attention heads and embedding size 64 in the label encoder, and 6 layers with 4 attention heads and embedding size 128 in the decoder. We use the Pre-LN implementation <cit.>. We train models with Adam with global clipnorm of 0.1, and learning rate of 1e-3 for and learning rate schedule described in <cit.> for . Models are trained for 2× 10^6 steps with batch size 256. For training the ℛ_1 ranker, we generate 10^5 samples with labels from the generator training data as the training set, and 1000 samples with labels from the generator validation data as the validation set. As described in Sec. <ref>, for each sample, we select a sampling method at random to generate it. The pool of sampling methods includes Top-P, Typical samplings with m∈{0.0,0.1,…,1.0} and Top-K sampling with m∈{1,2,…,10}, and sampling biases b∈{0,1,5,25,100,∞}. The ℛ_2 ranker is a state-of-the-art recognizer that has been trained on internal data not related to public datasets and is an LSTM-CTC model with 6 layers of size 216 <cit.>, which is combined with word and character language models during beam search decoding, similar to <cit.>. For , we use testset_v for validation, testset_f for tuning sampling parameters (via grid search over all possible samplings), and testset_t for testing. For , we use the version of the dataset split by individual words. Since this dataset does not have the tuning subset, we use validation data labels for tuning sampling parameters. For , since this dataset does not have tuning or testing subset, we extracted 1500 labels whose lengths have the same mean and variance as the validation data, from the labels present in the IAMonDO dataset (we include these labels with the submission for clarity). Models were implemented in Tensorflow and the time measurements were done after conversion to TFLite on a Samsung Galaxy Tab S7+ tablet. §.§ Baselines Sampling model baseline. We compare the model with tuned sampling parameters, with a model with fixed sampling method. Since different works in the literature consider different sampling methods, to have a fair comparison to them, as to a baseline, we report the best result with S=(Top-P,m,b), m∈{0.0, 1.0}, b∈{0.0,∞}, that is, greedy or ancestral sampling of component with infinite or zero bias for the offset parameters. We will refer to the optimal sampling method as S_opt, and to baseline as S_base. Ranking model baseline. We compare the ℛ_1 ranker that predicts the recognizability of the generated ink, described in Sec. <ref>, with an approach described in <cit.>, which trains a model to distinguish between real and synthesized samples, with the goal of selecting the most "real-looking" samples. We will refer to it as ℛ_base. §.§ Quantitative analysis Effect of sampling and ranking In Table <ref>, we compare the results of applying different sampling and ranking techniques for all datasets, model types, and data types. A first major finding of our study is that tuning the sampling technique helps in almost all cases - in 13 cases out of 16, with the remaining ones being ties. The second conclusion is that using a ranking model helps in all cases. There is still a significant gap between the performance when using ℛ_1 and the quality-optimal ℛ_2. However, as we show in the next paragraph, achieving such quality comes with penalties for inference time. Finally, we can conclude that using ranker that predicts whether the ink is recognizable or not is superior to using a baseline ranker <cit.> that predicts whether a given ink is real or synthetic. However the latter ranker also helps in most cases, as compared to not using ranking at all. Comparison under a time budget. The inference time for the model consists of 3 separate parts: (i) generating a batch of B samples; (ii) ranking them with the ℛ_1 ranker (unless B=R, in which case we can use just ℛ_2); (iii) Re-ranking the top R candidates with ℛ_2 (unless B=1 in which case the generated sample can be returned directly). We show how these values scale with the input batch size for the model (that is, B for generative model and ℛ_1, and R for ℛ_2), in Table <ref>, and the trade-off between CER and inference time in Fig. <ref>. Here we present the comparison of model quality vs inference time budget, by varying the values of B and R. To connect the input sequence length to inference time, we fix the maximum number of decoding steps the model is allowed to make per input sequence symbol. In other words, our inference time is measured as time needed for one decoding step times the maximum allowed number of tokens per input symbol. The generation is always run until the maximum number of frames. In the models we used for this evaluation, 99% of the samples generated less than 5 frames per output character, which is the ratio that we fixed. Table <ref> shows the inference time for synthesis model, ℛ_1, and ℛ_2, in ms per character as a function of the input batch size. Notice that both the autoregressive generative model and the convolution-based ranker are able to take advantage of vectorization and are 7.5 and 3.2 times faster for large batch sizes than if run individually. The recognizer, used as ℛ_2, however, does not parallelize well due to CTC <cit.> decoding and combination with language models, thus scaling linearly with the batch size. Based on the data in Table <ref>, we plot the numbers for model quality and worst-case inference time for different values of B and R in Fig. <ref>. Points with (B=4,R=2), (B=8,R=4), and (B=16,R=8) are on the Pareto frontier, verifying our earlier statement that there are scenarios where the best performance can be achieved by combining the two rankers. Points (B=2,R=1) and (B=4,R=1) are also on the frontier, verifying our statement that there are cases where the best performance can be achieved without using the recognizer part of the ranking model at all. Discussion and limitations. We note that the findings we present here are not universal, and the exact inference time depends on a multitude of factors such as specific generative model type and size, hardware, length of the sequence to be generated (processor caching makes longer sequences faster on a per-character basis), ranking model type and size (for the recognizer ranker, we rely on a model using CTC decoding which is hard to vectorize, whereas Seq2Seq models may parallelize better, although usually have worse accuracy). Furthermore, the average/median inference time might differ from the worst case significantly: The generative model produces an average 3.7 output frames per input character, compared to 5 which we used for the worst case analysis. Also when using the recognizer as a ranker, we need not recognize all of the candidates as we can stop at the first candidate that is perfectly recognizable, which may happen sooner or later depending on the exact sampling type and model quality. However, we believe that this does not invalidate our findings: depending on the time budget, better performance may be achieved by using a fast learned ranking model or combining it with a recognizer. Ablation study. In Table <ref> we evaluate our choice of the construction of the ranker training dataset, and tuning of the sampling parameters for every setup (generation model type and feature type). Firstly, we compare our approach of generating training data for the ranker by using random sampling parameters for every label to two other baseline approaches: (i) using a fixed ancestral sampling when generating the training data; this intuitively makes sense as sampling from "widest" possible distribution should cover all the whole diversity of the generated data. (ii) for each setup, using the sampling parameters that yield the lowest CER if ℛ_2 is used as ranker; this makes sense as ℛ_1 tries to approximate ℛ_2, and it is reasonable to assume that their optimal sampling parameters should be similar. We observe that on average our proposed way of constructing a training dataset is optimal, never being more than one decimal point worse than other approaches, but at times significantly outperforming them. Secondly, we show that the optimal sampling parameters differ a lot between the setups, so it is important to tune them for each setup. The only reliable signals we observed was that for the representation, it is often preferable to sample more "greedily" (lower value of K in Top-K or P in Top-P sampling) than for the representation, and that the optimal samplings seem to be somewhat close between the two model types. §.§ Qualitative analysis In this section, we first attempt to confirm that: (i) the two types of errors, overconfidence and incoherence, actually happen when generating digital ink samples, and (ii) both the choice of sampling and ranking has effect on these errors. Results are presented with the Tacotron model on Deepwriting dataset with curve representation, but we have observed largely similar trends for other cases. Afterwards, we present examples of model output on various datasets. Fig <ref> shows examples of generated ink with various samplings - with both incoherence and overconfidence examples visible. As we can observe, overconfidence errors typically result in very long ink, that can not be recognized as the label, with repeating pattern inside. Given this observation, we attempt to quantify the number of errors of each type by looking at samples that can not be recognized (meaning the label returned by the recognizer differs from the input label to the generative model), and within those samples, whether the generation process reached the maximum number of steps (implying overconfidence) or not (implying incoherence). Table <ref> shows the number of errors, estimated by this approach, as a function of sampling parameters (value of p in Top-P sampling), and it confirms the intuition about how it should behave. We can see that as the sampling parameters go from greedy sampling closer to ancestral sampling, the number of overconfidence errors goes down, while the number of incoherence errors goes up. When we use the ranking model, we see that the number of incoherence samples first goes down, and then goes up. We attribute this to the fact that as sampling becomes more diverse, the ranking model is able to select better candidates, but as sampling becomes too diverse, all candidates start being less recognizable. Overall, using ranking seems to reduce the number of overconfidence errors by 50-90%, and number of incoherence errors by up to 50%. Fig. <ref> shows of the model outputs, sorted according to the score provided by the ranker, left-to-right. As can be seen, the rightmost sample in every row is recognizable and matches the label, while the leftmost sample is mostly not recognizable. It is expected that in many cases at least one of 5 samples is not recognizable - if that were not the case, that would mean that the selected sampling method is too conservative and should be relaxed to produce samples with higher diversity (which would trade-off having all 5 candidates recognizable in "easy" cases for improved performance in "difficult" cases where all 5 samples were not recognizable). § CONCLUSION In this paper, we investigated the effects of combining sampling and ranking strategies to improve digital ink generation. These methods, used before in other domains such as NLG and TTS, proved to be highly useful, and complementary to each other in the case of digital ink. Until now, however, they were not explored in this domain, with most methods using ancestral or greedy sampling, and no candidate ranking. We evaluate sampling and ranking techniques, on four datasets - two containing writing in English and one in Vietnamese, as well as a fourth one with mathematical formulas. We test the robustness of the findings using two model types (Tacotron and Transformer) and two common ink data representations ( and ). In all the combinations, we report significant improvements in the recognizability of the synthetic inks: taken together, a well-chosen sampling method, followed by fast ranking consistently improve recognizability, in many cases halving the character error rates. An important factor in the perceived quality of ink synthesis is speed. Potential applications, such as handwriting autocompletion, spelling correction, and beautification usually process user inputs on-device, so ink generative models need to be fast. We thus report the findings with respect to a given computational budget. splncs04
http://arxiv.org/abs/2306.04212v1	20230607073701	Migrate Demographic Group For Fair GNNs	[ "YanMing Hu", "TianChi Liao", "JiaLong Chen", "Chuan Chen", "Jing Bian", "ZiBin Zheng" ]	cs.LG	[ "cs.LG", "cs.CY" ]	Sun Yat-Sen University GuangZhou China [email protected] Sun Yat-Sen University GuangZhou China [email protected] Sun Yat-Sen University GuangZhou China [email protected] Sun Yat-Sen University GuangZhou China [email protected] Sun Yat-Sen University GuangZhou China [email protected] Sun Yat-Sen University ZhuHai China [email protected] Graph Neural networks (GNNs) have been applied in many scenarios due to the superior performance of graph learning. However, fairness is always ignored when designing GNNs. As a consequence, biased information in training data can easily affect vanilla GNNs, causing biased results toward particular demographic groups (divided by sensitive attributes, such as race and age). There have been efforts to address the fairness issue. However, existing fair techniques generally divide the demographic groups by raw sensitive attributes and assume that are fixed. The biased information correlated with raw sensitive attributes will run through the training process regardless of the implemented fair techniques. It is urgent to resolve this problem for training fair GNNs. To tackle this problem, we propose a brand new framework, FairMigration, which can dynamically migrate the demographic groups instead of keeping that fixed with raw sensitive attributes. FairMigration is composed of two training stages. In the first stage, the GNNs are initially optimized by personalized self-supervised learning, and the demographic groups are adjusted dynamically. In the second stage, the new demographic groups are frozen and supervised learning is carried out under the constraints of new demographic groups and adversarial training. Extensive experiments reveal that FairMigration balances model performance and fairness well. <ccs2012> <concept> <concept_id>10010405.10010455</concept_id> <concept_desc>Applied computing Law, social and behavioral sciences</concept_desc> <concept_significance>300</concept_significance> </concept> </ccs2012> [300]Applied computing Law, social and behavioral sciences Migrate Demographic Group For Fair GNNs ZiBin Zheng ======================================= § INTRODUCTION In recent years, graph neural networks (GNNs) have attracted much attention due to the potent ability to convey data in a graph-structured manner. In many real-world scenarios, including node classification <cit.>, community detection <cit.>, link prediction <cit.> and recommendation systems <cit.>, have been applied to GNNs. The GNN aggregates the messages delivered by neighbors to obtain the embedding of nodes, edges, or graphs. The key to the powerful expression ability of GNN lies in extracting the attribute features and the structural features in the graph structure data at the same time. Recently, fairness has become a high-profile issue. Several recent studies have shown that AI models may produce biased results for specific groups or individuals divided by some particular sensitive attributes, such as race, age, gender, etc. The biased algorithms have resulted in some horrible cases. An American judicial system's algorithm erroneously predicts that African Americans will commit twice as many crimes as whites. Amazon found that its recruitment system was biased against female candidates, especially in tech positions <cit.>. The further application of AI models will be severely constrained if the fairness issue cannot be satisfactorily addressed. In deep learning, there have been some works that try to resolve the fairness issue. Fairboosting <cit.> aims at resolving the low recognition rate of mask-wearing faces in East Asia, using the masking method to generate masking faces, balancing the data with resampling, and proposing a symmetric arc loss to improve recognition accuracy and fairness. To improve counterfactual token fairness in text classification and connect robustness and fairness, Garg et al. <cit.> propose three methods: blinding, counterfactual enhancement, and counterfactual logical pairing. Wang et al. <cit.> effectively promote fairness by minimizing the mutual information between the semantics in the generated text sentences and the polarity of their demographics. Jalal et al. <cit.> define several intuitive concepts about group fairness for image generation with uncertain-sensitive properties, and explores these concepts' incompatibilities and trade-offs. However, fair deep learning methods seldom take samples' interaction into account. Therefore, the fair deep learning techniques are not applicable to graph data <cit.>. There are also several efforts to address the fairness issue in GNNs. FairGNN <cit.> employs adversarial training to prevent GNNs from leaking sensitive information during message passing. Edits <cit.> preprocesses attributes and topologies to reduce biased information. Although these methods solve the fairness issue for GNNs to a certain extent, they are still restricted to fixed sensitive information. The existing fair GNN strategies are unable to decouple the original sensitive attribute with prediction due to a lack of effective solutions to the biased information included in raw sensitive attributes. The biased results generated by vanilla GNN can be attributed to a variety of factors. To begin with, when labeling the data, it will ineluctably be influenced by subjective elements and resemble previous historical data <cit.>. These biased properties are introduced into graph neural networks during training and displayed in the outcomes. Second, GNNs correlate each dimension feature, including sensitive attributes, with the prediction result <cit.>. For different groups divided by sensitive attributes, the tightness and accuracy of the correlation between sensitive attributes and predict labels may differ enormously. For example, when a group's label distribution is extremely unbalanced, the GNNs tend to predict this group to the majority of the group's labels and strongly correlate the group's sensitive attribute with the predicted label. On the contrary, if a group's label distribution is relatively uniform, the GNNs will tend to give a lower weight to the sensitive attribute of the group and make random predictions during training, resulting in poor performance in the group. In addition, the topology of the graph also introduces biased information during message passing. In a homogeneous graph, two nodes directly connected usually have the same or similar attribute characteristics. When smoothing the graph data by GNN will make the groups more concentrated internally and more opposed and exclusive between groups <cit.>. Finally, sensitive attributes are considered immutable by existing fair algorithms on GNNs. Under such circumstances, the bias in the initial data will always impede the model training process, regardless of how the model is improved. When training GCN <cit.> on the three datasets, the change tendency of group similarities is illustrated in Figure <ref>. It is evident that the distribution of group similarity between two groups diverges increasingly with fixed sensitive attributes, leading to a biased prediction toward one group. In this paper, we propose a novel model, FairMigration, for the fairness issue of GNNs. FairMigration is an additive method realizing the group migration, which could break the limitation of static sensitive attributes and gradually remove the biased information contained in the original data in the training of the GNNs. The training of FairMigration is divided into two stages. In the first stage, the encoder is trained by personalized self-supervised learning and learns the embeddings of nodes. Based on group similarity distribution, outliers in one group are transferred to another group. After the first stage of training, the encoder is preliminarily trained and the migrated groups division is acquired. In the second stage, the encoder and the classifier are optimized by supervised learning under the condition of the new pseudo-demographic groups and adversarial training. Our contributions are summarized below: * To our knowledge, we first point out that the biased information contained in static sensitive attributes will always exist in training for fair GNNs. * We propose a model with group migration to address the problem of biased information contained in fixed sensitive attributes. * Extensive experiments verify the effectiveness of the proposed method in this paper. § RELATED WORK §.§ Graph Neural Networks Many Graph Neural Networks (GNNs) have been proposed to learn the representation of graph structure data. GCN <cit.> uses the first-order approximation of Chebyshev's polynomial as the aggregation function of message passing, GAT <cit.> uses the attention mechanism to assign message weight for aggregation, GIN <cit.> aggregates messages with a summation function. Jump Knowledge (JK) <cit.> passes the output of each layer of the graph neural network to the final layer for aggregation. APPNP <cit.> combines personalized PageRank with GCN to aggregate the information of high-order neighbors. GraphSAGE <cit.> generalizes GCN to inductive tasks, learning a function that aggregates the representation of known neighbors. §.§ Fairness In Deep Learning The methods of solving the fairness problem in DL can be categorized into three types: pre-processing, in-processing treatment, and post-processing <cit.>. The pre-processing methods perform debiasing operations on the data before training, such as modifying attributes and regenerating labels. Lahoti et al. <cit.> create fair representation before training through external knowledge. Ustun et al. <cit.> construct a debiased classifier through recursive feature picking. Mehrotra et al. <cit.> denoise sensitive attributes to reduce gender and racial bias. The in-processing methods alleviate the bias of the model when training. Chai et al. <cit.> dynamically adjust the weights of the loss function during training. FairSmooth <cit.> train classifiers in each group separately and then aggregates classifiers by Gaussian smooth. The post-processing methods modify the output to obtain debiased results. Lohia et al. <cit.> use an individual bias detector for prioritizing data samples in a bias mitigation algorithm. Mishler et al. <cit.> have developed a post-processing predictor that estimates, expands and adjusts previous post-processing methods through a dual robust estimator. Putzel et al. <cit.> modify the predictions of the black-box machine learning classifier for fairness in multi-class settings. §.§ Fairness In Graph Neural Networks There have been some attempts to address the group-level fairness issues of graph neural networks. FairDrop <cit.> prevents unfair information transmission in graph neural networks by randomly masking some edges. GRADE <cit.> improves the fairness of GNNs through edge interpolation generation and attribute masking. Köse et al. <cit.> have developed four new graph enhancement methods to achieve fair graph contrastive learning. FairAug <cit.> reduces biased results in graph contrastive learning through adaptive data augmentation. FairRF <cit.> explores the issue of training fair GNNs under the condition of unknown sensitive attributes. FairGNN <cit.> uses adversarial training to prevent the leakage of sensitive attributes. Nifty <cit.> adopts a counterfactual augmented siamese network and regularization of model parameters meeting the Lipschitz condition for debiasing. Edits <cit.> constrains the Wasserstein distance of attributes between groups, and then augments topology based on preprocessed attributes to output debiased results. GUIDE <cit.> proposes a new method for measuring group-level fairness. FairVGNN <cit.> adopts adversarial training, feature masking, and gradient cropping to reduce bias. FMP <cit.> resists topology bias by constraining the distance of raw attributes and the embeddings. The above algorithms train fair GNN under the fixed sensitive attributes, encountering bottleneck of fairness improvement. § PRELIMINARY In this section, the notations of this paper will be illustrated and the problem definition will be given. §.§ Notations Given a graph 𝒢 (𝐀,𝐗 ), 𝐀∈ℝ^N × N denotes the adjacency matrix of 𝒢, and 𝐗∈ℝ^N × K denotes the attribute matrix of 𝒢. The sensitive attribute vector is denoted by 𝐒∈ℝ^N, which is a column of the attribute matrix 𝐗. 𝐔∈ℝ^N ×(K-1) denotes the attribute matrix removed 𝐒 from 𝐗. 𝒢 (𝐀, 𝐗) can be augmented to the j-th view 𝒢̃_j (𝐀, 𝐗̃_j), where 𝐗̃_j is the corresponding augmented attribute matrix. GNN learns the representation of nodes, mapping the graph 𝒢 into the embedding matrix 𝐙∈ℝ^N × d. Similarly, the embedding matrix of graph 𝒢̃_j is denoted by 𝐙_j∈ℝ^N × d. The decoder GNN recovers the attribute matrix from 𝐙. The reconstructed attribute matrix is denoted by 𝐗^rec∈ℝ^N × K. The reconstructed sensitive vector is denoted by 𝐒^rec∈ℝ^N. The matrix, removing 𝐒^rec from 𝐗^rec, is denoted by 𝐔∈ℝ^N ×(K-1). Our method involves a group migration module. The corresponding notation mainly includes the current pseudo attribute matrix 𝐏∈ℝ^N, the group similarity distribution matrix 𝐐∈ℝ^N, the prototype of i-th group 𝐓_i ∈ℝ^ d and the outlier set 𝐎. For convenience, all the important notations are listed in Table <ref>. §.§ Problem Definition The fairness issue can be divided into two levels: group-level fairness and individual-level fairness. The group-level fairness emphasizes fairness between different groups and treat every group equally. Individual fairness emphasizes the fairness between individuals, and reduces the prediction difference of similar individuals. This paper mainly focuses on single-value binary group-level fairness, which is measured by the difference in the probability of being predicted for a particular label on two groups. § METHOD In this section, the proposed model, FairMigration will be introduced in detail. FairMigration consists of two training stages. In the first stage (self-supervised learning stage), FairMigration constructs pseudo-demographic groups by group migration based on similarity while initially optimizing the encoder using self-supervised learning based on counterfactual fairness. The division of pseudo-demographic groups is expected to correspond to the ground-truth labels, rather than the original sensitive attributes. The obtained pseudo-demographic groups are applied to the model's training in the supervised learning stage. In the second stage (supervised learning stage), in addition to the cross-entropy, the adversarial training and the pseudo-demographic group based distance restriction are added to further increase fairness. §.§ Self-Supervised Learning Stage The target of FairMigration is to improve the fairness of the graph neural network through group migration. Augmentation of the sensitive attributes during the self-supervised learning stage meets with the downstream tasks. In addition, the encoder can be optimized preliminarily. Therefore, we choose sensitive attributes flip as the augmentation strategy for self-supervised training. §.§.§ Counterfactual fairness augmentation Given a graph 𝒢(𝐀,𝐗), 𝐀 is the adjacency matrix, and 𝐗 is the attribute matrx. Two augmented views of 𝒢, generated by setting all the sensitive attributes 𝐒 as 0 and 1, can be annotated as 𝒢̃_0(𝐀,𝐗̃_0) and 𝒢̃_1(𝐀,𝐗̃_1), respectively. Such an augmentation strategy would encourage the graph neural networks to get rid of the false relationships between predicted labels 𝐘̃ and the sensitive attributes 𝐒. Then, we employ GNN to obtain the embeddings of 𝒢(𝐀,𝐗), 𝒢̃_0(𝐀,𝐗̃_0), and 𝒢̃_1(𝐀,𝐗̃_1). The embedding matrix of graph 𝒢̃ can be written as: 𝐙 = GNN(𝐀,𝐗). The embedding matrix of augmented graph 𝒢̃_i can be written as: 𝐙̃_i = GNN(𝐀,𝐗̃_i), i = 0,1. We defined a contrastive loss ℒ_con to optimize the encoder for fairness: ℒ_con = 1/N∑_i^N ((1-cos(𝐙̃_1[i,:], 𝐙̃_2[i,:]))+ cos(𝐙̃_1[i,:], shuffle(𝐙̃_2[i,:]))). Additionally, we introduce a personalized reconstruction loss ℒ_rec to enhance the representation ability of the encoder while blurring the sensitive attributes. We adopt multilayer perceptron (MLP) as a decoder to reconstruct the attributes, avoiding sensitive attribute leakage caused by message passing: 𝐗^rec = MLP(GNN(𝐀,𝐗)). The goal of personalized reconstruction loss is to optimize the encoder for graph representation while mixing in raw sensitive attributes. The reconstructed sensitive attributes are expected to be in an intermediate state. The personalized reconstruction loss can be expressed as follows: ℒ_rec = 1/N∑_i^N ( MSE(𝐔-𝐔^rec) + ∑_j=0^j=s_max MSE(S^rec_i,j)), where 𝐔 is the attributes matrix without the sensitive attribute, 𝐔^rec is the reconstructed attributes matrix 𝐗^rec without the reconstructed sensitive attribute 𝐒^rec, and cos(·, ·) is cosine similarity. Letting q be the index of sensitive attribute channel in 𝐗, 𝐔 can be represented as 𝐔 = [𝐗[:,0:q],𝐗[:,q+1:]]. The following optimization function is applied to optimize the GNN encoder to stripping the prediction label from the original sensitive attribute 𝐒. ℒ_ssl = αℒ_con + (1 - α) ℒ_rec, where α∈ [0,1] is a hyperparameter that balances ℒ_con and ℒ_rec. §.§.§ Demographic groups migration While self-supervised learning, a similarity-based pseudo-demographic groups migration is conducted to constrain the GNN for fairness. The group division can be adjusted dynamically when self-supervised learning. Thus, group migration breaks the limitation of static sensitive attributes. Given the current pseudo sensitive attribute vector 𝐏, the prototype set of all pseudo-demographic groups {𝐓_0,𝐓_1, ···, 𝐓_s_max} can be acquired: 𝐓_j = ∑_i ∈{𝐏_i = j}𝐙_i, where 𝐓_j, j ∈{0, 1, ···, S_max} (in this paper, S_max = 1) is the prototype of j-th group, and 𝐏_i is the i-th node's current pseudo sensitive attribute. After that, pseudo-demographic groups' similarities matrix 𝐐 can be calculated, which implies the similarity distribution of groups. 𝐐_i = cos(𝐓_𝐏_i, 𝐙_i), where 𝐐_i measures the cosine similarity of the i-th node with its current pseudo-demographic group's prototype. The mean value μ_k and the standard deviation σ_k of set {𝐐_i : 𝐏_i = k } describe the similarity distribution of the pseudo-demographic group k. The outliers satisfying equation (<ref>) (deviating from the group prototypes up to the threshold) will be migrated to the group whose prototype is the most similar. This paper is conducted on single-value binary sensitive attributes. Therefore, the group migration is simplified into a sensitive attribute value flip as 𝐏_i = 1 - 𝐏_i. The situation of generating new groups is not considered in this paper. 𝐐_i < μ_𝐏_i - 2 ×σ_𝐏_i. The loss function of group migration can be written as: ℒ_mig = 1/\|𝐎\|∑_i ∈𝐎 1 - sim(𝐙_i, 𝐓_1-𝐏_i). §.§.§ Objective function of self-supervised learning It has been revealed that the fairness of model will be disturbed by balanced demographic group distribution <cit.>. To further promote the fairness of our model, a re-weight strategy correlated with the number of demographic groups is introduced to adjust the loss functions in equation (<ref>), equation (<ref>) and equation (<ref>). The above loss functions can be rewritten as: ℒ_con = 1/N∑_i^N w_i ((1-cos(𝐳̃_1[i,:], 𝐳̃_2[i,:])) + cos(𝐳̃_1[i,:], shuffle(𝐳̃_2[i,:]))), ℒ_rec = 1/N∑_i^N w_i( MSE(𝐔-𝐔^rec) + ∑_j=0^j=s_max MSE(S^rec_i,j) ), ℒ_mig = 1/\|𝐎\|∑_i ∈𝐎 w_i (1 - sim(𝐙_i), 𝐓_1-𝐏_i), where w_i = max{\|𝐒 = 0\|,\|𝐒 = 1\|}/\|𝐒_i\|. The loss function of self-supervised learning can be written as: ℒ_pre = ℒ_mig + γℒ_ssl, where γ∈ [0, 1] is hyperparameter to control the contribution of ℒ_ssl. As self-supervised learning finishes, the migrated pseudo-sensitive attributes matrix 𝐏 is frozen and will be used in the supervised learning phase as a fairness constraint. §.§ Supervised Learning Stage At the stage of self-supervised learning, only the encoder and decoder are optimized mainly for fairness. Therefore, it is necessary to optimize the classifier and fine-tune the encoder for node classification. In order to improve the fairness of the classifier and avoid the encoder being undermined by the fairness reduction in supervised learning, we introduce migrated pseudo-sensitive attributes and adversarial training as constraints. §.§.§ Cross-entropy loss A MLP is adopted as a classifier to output the predicted labels 𝐘̃: 𝐘̃ = δ (MLP(GNN(𝐀,𝐗))), where δ is the activation function. The cross-entropy is used as the loss function of supervised learning: ℒ_CE = - 1/𝐍∑_i^𝐍 [y_i log(ỹ_i) + (1-y_i)log(1 - ỹ_i)]. §.§.§ Pseudo-demographic groups constraints In the supervised learning stage, the migration loss function, equation (mig) in the self-supervised learning, is still applied, but the migrated pseudo sensitive attributes are frozen. This procedure could prevent the fairness degradation brought by biased classification. §.§.§ Adversarial training The adversarial training encourages the encoder to avoid exposing raw sensitive attributes while optimizing the sensitive attributes predictor. In this paper, we set all sensitive attributes available. However, a portion of individuals may offer fake sensitive attributes for privacy. We adopt a sensitive attributes predictor f_E(·) to recover the sensitive attributes: 𝐒^p = f_E (𝐀,𝐗), where 𝐒^p is the predicted sensitive attributes matrix. With 𝐒^p, The optimization direction of adversarial training can be transferred to reducing sensitive information in embedding 𝐙. The adversarial training module f_A(·) tries to retrieve the sensitive attributes from 𝐙 while the encoder tries to eliminate the sensitive attributes in 𝐙. The retrieved sensitive attributes 𝐒^A from f_A(·) can be written as: 𝐒^A = f_A (𝐙), The loss function of optimizing f_E(·) can be written as: min_θ_Eℒ_E = -1/𝐍 [∑_i 𝐒^A_i log(𝐒^p_i) + (1 - 𝐒^A_i) log(1 - 𝐒^p_i)], where θ_E is the trainable parameters of f_E(·). To avoid the exposure of the raw sensitive attributes and the leaking of flipped sensitive attributes, instead of a simple cross-entropy function, the loss function of adversarial training is modified as: min_θ_Gmax_θ_Aℒ_A = -1/2𝐍 [∑_i 𝐒^A_i log(𝐒^p_i) + (1 - 𝐒^A_i) log(1 - 𝐒^p_i) + (1-𝐒^A_i) log(𝐒^p_i) + 𝐒^A_i log(1 - 𝐒^p_i)], where θ_A is the trainable parameters of f_A(·). §.§.§ Objective function of supervised learning The loss function of supervised learning can be written as: min_θ_G, θ_Cmax_θ_Aℒ_sup = ℒ_CE + λℒ_mig - βℒ_A, where λ and β are hyperparameters. θ_G, θ_C are trainable parameters of the encoder and classifier, respectively. § EXPERIMENT In this section, a series of experiments are conducted to demonstrate the effectiveness of our proposed model. §.§ Datasets We conduct experiments on three different real-world datasets credit, bail, and income. The statistics information of the the datasets is demonstrated in Table <ref>. The detailed introductions of these three datasets are as follows: * Credit <cit.>: credit graph is built on 30, 000 credit card users. A node represents a user and the probability of generating an edge between two nodes depends on the similarity of their payment features. The label of credit is whether or not the user will default on credit card payments next month. The sensitive attribute is age. * Bail <cit.>: bail (also known as recidivism) graph is built on 18, 876 defendants released on bail at the U.S. state courts from 1990 to 2009. A node represents a defendant and the probability of generating an edge between two nodes is determined by the similarity of their past criminal records and demographics. The label of bail is whether or not the defendant with bail. The sensitive attribute is race (white or not). * Income: income graph is built on 14,821 individuals sampled from the Adult dataset <cit.>. A node represents a person. Take the similarity of a pair of nodes as the probability of establishing an edge between them. The label of income is whether or not the person earns more than 50K dollars. The sensitive attribute is race. §.§ Baseline In order to verify the effectiveness of FairMigration, three state-of-the-art GNN-based methods nifty, fairGNN, and EDITS are chosen for comparison. A brief introduction of these methods are following: * Nifty <cit.>. Nifty promotes the fairness by the counterfactual perturbation based siamese network and uses Lipschitz continuous function to normalize the layer weights. * fairGNN <cit.>. fairGNN is a adversarial training based method. It trains a sensitive attributes predictor to retrieve the sensitive attributes from the node embeddings while trains the GNN to reduce the information of the sensitive attributes in the node embeddings. We set al.l the sensitive attributes available for comparision. * EDITS <cit.>. EDITS transforms the attributes and regenerates the adjacency matrix for lowering the Wasserstein distance of attributes and topology between different demographic groups. §.§ Evaluation Metrics We use AUC-ROC to evaluate the performance of node classification. In addition, we use statistical parity(Δ SP, also known as demographic parity) and equal opportunity(Δ EO) to evaluate the fairness. The definition of Δ SP and Δ EO can be written as: Δ SP = \|P(ŷ = 1\|s = 0) - P(ŷ = 1\|s = 1)\| Δ EO = \|P(ŷ = 1\|y=1,s = 0) - P(ŷ = 1\|y=1,s = 1)\| §.§ Implementation The experiments are conducted on a server with Intel(R) Core(TM) i9-10980XE CPU @ 3.00GHz, NVIDIA 3090ti, Ubuntu 20.04 LTS, CUDA 11.3, python3.8, PyTorch 1.12.1, and PyTorch Geometric. Three popular GNNs, GCN, JK, and APPNP are adopted to be the backbone. The parameters range of experiments are following: * FairGNN: α=4, β∈{10, 100, 1000}. * Nifty: λ = 0.5. * Edits: default u_1 to u_4. Threshold = 0.02 for credit, 0.015 for bail, 0.1 for income. * FairMigration: λ∈{5,10,15,20}, β∈{0.01,0.05,0.1,0.5,1}, α∈{0.2,0.4,0.6,0.8}, γ∈{0.2,0.4,0.6,0.8,1} We run all experiments 10 times for preventing accidents as much as possible. §.§ Experiment Results In this subsection, we compare the node classification performance and fairness of FairMigration with the state-of-the-art models on three different GNNs. The comparison results of AUC-ROC, Δ SP, and Δ EO are displayed in Table <ref>. The observations of the comparison can be summarized as: * On different GNN backbones, FairMigration achieves competitive fairness with all baselines while the performance of node classification is comparable. It reveals the advances of FairMigration compared with other baselines. * All baselines show varying degrees of unstable performance that sometimes perform well in fairness but badly in node classification, or on the contrary. For example, nifty shows poor performance in node classification in bail. FairMigration avoids this unstable situation, achieving higher unity of performance and fairness. §.§ Ablation study In order to fully understand the contribution of each component of FairMigration, we conduct ablation studies, and the results are shown in Table <ref>. Four variants of FairMigration removing one component are defined. The wo_mig denotes the variant removing the group migration. The wo_adv denotes the variant removing the adversarial training. The wo_ssf denotes the variant removing the personalized self-supervised learning. The wo_wei denotes the variant removing the reweight. Removing group migration or personalized self-supervised learning would result in the most significant deterioration in fairness and little changes in node classification. The combination of group migration and personalized self-supervised learning is a powerful technique to train fair GNNs. If Removing the adversarial training, FairMigration suffers from a fairness drop in most cases but enjoys fairness promotion in some cases. Adversarial training is an unstable strategy. Removing the reweight, FairMigration produces slightly biased results. The reweight technique can be a supplement to train fair GNNs. §.§ Visualization of group migration In this section, we take GCN as the backbone as an example, and visualize the group migration of baselines and FairMigration during the supervised learning stage. The change curve of mean and standard deviation of group similarity distribution is demonstrated in Figure <ref>. There are the following observations: * The in-processing methods, Nifty, FairGNN, and FairMigration gradually eliminate the similarity distribution gap between groups during training. The pre-posting method Edits is still unable to completely get rid of the static biased information even though the data is preprocessed. * Nifty and FairGNN show a certain degree of oscillation during training and they might not obtain a GNN fair enough with reasonable utility in some cases. * FairMigration commendably bridges the differences between the two groups in all listed cases, demonstrating a remarkable ability to train fair GNNs. §.§ Parameter Sensitivity In order to investigate the impact of hyperparameters, λ, β, α and γ, we conducted experiments about parameter sensitivity, whose results are displayed in Figure <ref> and Figure <ref>. The observations can be summarized as follows: * λ is the weight of group migration constraints in supervised learning. It almost doesn't impact node classification but influences fairness a lot. GCN achieves the highest fairness in credit, bail, and income when λ = 20, λ = 5, and λ = 20, respectively. * β is the weight of adversarial training in supervised learning. β plays a little role in node classification in credit and bail but disturbs the node classification in income. The high value of β would upgrade fairness in credit and income, but increase little biases in bail. FairMigration with GCN achieves the highest fairness in credit, bail, and income when β = 1, β = 0.1, and β = 1, respectively. * α is the trade-off between contrastive learning and reconstruction. γ is the weight of personalized self-supervised learning. It is a hard task to find a combination of α and γ that obtain the best node classification performance and fairness simultaneously. But, the optimal combination of α and γ in node classification is very closed to that in fairness. § CONCLUSION AND THE FUTURE DIRECTION In this paper, we explore a novel aspect of fairness, breaking the limitation of static sensitive attributes for training fair GNN. We propose an innovative framework FairMigration, reallocating the demographic groups dynamically instead of maintaining the demographic group division following the raw sensitive attributes. FairMigration preliminarily optimizes the encoder mainly for fairness by personalized self-supervised learning and dynamically migrates the groups. After that, the migrated groups and the adversarial training are adopted to constrain supervised learning. The extensive experiments exhibit the effectiveness of FairMigration in both downstream tasks and fairness. The group migration strategy is an interesting direction. FairMigration adopts a simple flip strategy. However, the optimal number of migrated groups may not be the same as the raw groups. Therefore, we will study the optimal migrated group division and extend it to multi-value sensitive attributes. ACM-Reference-Format
http://arxiv.org/abs/2306.01663v2	20230602163206	Quantitative Steinitz theorem: A spherical version	[ "Grigory Ivanov", "Márton Naszódi" ]	math.MG	[ "math.MG", "52A27 (primary), 52A35" ]	Steinitz's theorem states that if the origin belongs to the interior of the convex hull of a set Q ⊂ℝ^d, then there are at most 2d points Q^' of Q whose convex hull contains the origin in the interior. Bárány, Katchalski and Pach gave a quantitative version whereby the radius of the ball contained in the convex hull of Q^' is bounded from below. In the present note, we show that a Euclidean result of this kind implies a corresponding spherical version. SourceP: Smart Ponzi Schemes Detection on Ethereum Using Pre-training Model with Data Flow Lu Pengcheng, Cai Liang, Yin Keting Zhejiang University Hangzhou, China [email protected], [email protected], [email protected] July 31, 2023 ====================================================================================================================================== § INTRODUCTION A fundamental fact in convexity discovered by Steinitz states that the interior of the convex hull of a subset Q of equals the union of the interiors of the convex hulls of at most 2d points of Q. A quantitative version was shown by Bárány, Katchalski and Pach <cit.>. We will call it the Euclidean Quantitative Steinitz Theorem or, QST in short. Let Q be a subset of whose convex hull contains the Euclidean unit ball o,1 centered at the origin o. Then there exists set Q^' of at most 2d points of Q that satisfies o,r⊂Q^' with some r>0 depending only on d. We will use r(d) to denote the largest r that makes the conclusion of Theoremthm:QST_monochromatic true. Clearly, r(d) ≤ 1. In <cit.>, the lower bound r(d)>d^-2d is presented, r(d)>cd^-1/2 is conjectured with a universal constant c>0. The first polynomial lower bound, r(d) > 1/6d^2 was proved in <cit.> by the authors. The upper bound r(d)≤1/2√(d) was shown in <cit.> and thus, r(d) tends to zero as d tends to infinity. In the present note, we establish a spherical (or, cone) version of Theoremthm:QST_monochromatic. We use =u∈uu=1 to denote the unit sphere in , and e_d+1 to denote the last element of the standard basis. We define the spherical cap with center v∈ and spherical radius ρ∈[0,π] as v,ρ = u ∈uv≥cosρ. A set K⊂ is called spherically convex, if it is either , or is contained in an open hemisphere, and for any two points u and v of K, the shorter great circular arc connecting u and v is contained in K. The spherical convex hull of a subset A of , denoted by A, is defined accordingly. It is known to exist and to be unique for any A⊆. Let C be a subset of , with d≥2, whose spherical convex hull contains the cap e_d+1,ρ for some ρ∈(0,π/2). Then there exists set C^' of at most 2d points of C that satisfies e_d+1,γρ⊂C^' with some γ>0 depending only on d. We will use γ(d) to denote the largest γ that makes the conclusion of Theoremthm:QST_monochromaticS true. Our main result is as follows. With the notation above, r(d) ≥γ(d)≥r(d)/2 for any dimension d≥2. Clearly, Theoremthm:SphericalQST_from_Euclidean_QST implies Theoremthm:QST_monochromaticS. Moreover, combined with the lower bound on r(d) in the paragraph following Theoremthm:QST_monochromatic, we obtain the following explicit bound. Let C be a subset of , with d≥2, whose spherical convex hull contains the cap e_d+1,ρ for some ρ∈ (0, π/2). Then there exists set C^' of at most 2d points of C that satisfies e_d+1,ρr(d)/2⊂C^'. While a non-quantitative spherical version of Steinitz's non-quantitative Euclidean theorem easily follows, the proof of our quantitative spherical result requires some additional ideas described in Sectionsec:SphericalQST_from_Euclidean_QS § PROOF OF THEOREM <REF> We will use the following two simple and purely technical observations. We postpone their proofs to the next section. For any t>0, we have t ≤tan t. For any t ∈0, π/4, we have tan t ≤ 2t. Assume that r ∈ (0,1] and ρ∈0, π/2. Then π/2 - arctanρ/r≥rρ/2. A straight-forward combination of Euclidean polarity with Theoremthm:QST_monochromatic yields the following Quantitative Helly Theorem (QHT), which we will use. We omit the proof. We recall that the polar of the set S ⊂ is defined by S = {x ∈xs≤ 1 for all s ∈ S }. Let L be a subset of with L contained in o,1. Then there exists a set L^' of at most 2d points of L that satisfies o,1/r(d)⊃(L^'), where r(d) is the quantity defined after Theoremthm:QST_monochromatic. We denote the Northern hyperplane by H_N = x ∈xe_d+1 = 1 and the open Northern hemisphere by = {x ∈xe_d+1 > 0 }. We identify H_N with inheriting the metric of and setting the point e_d+1 as the origin. We use P_N to denote the central projection from the origin of onto H_N, that is, for any (x_1,…,x_d+1)∈ with x_d+1≠0, we set P_N((x_1,…,x_d+1))=(x_1/x_d+1,x_2/x_d+1, …, x_d/x_d+1). First, we discuss the easy case, when C is contained in . In this case the result directly follows from its Euclidean counterpart. We set Q = P_N (C) and observe that Q⊇ P_N(e_d+1,ρ)=o,tanρ. By the definition of r(d), there is a subset C^' of C of size at most 2d such that P_N (C^') contains the ball o,r(d) tanρ. Equivalently, C^' contains the cap e_d+1, arctanr(d) tanρ. Since r(d) ≤ 1, one gets r(d)/2·ρ < π/2. Thus, by Claimclaim:tan_pi_4, the inequality tanr(d)/2·ρ≤ r(d) ·ρ≤ r(d) tanρ holds for all ρ∈ (0, π/2) and all positive integer d. That is, for all ρ∈ (0, π/2) and all positive integer d, C^' contains the cap e_d+1, r(d)/2·ρ. However, since lim_t → 0arctant/t = lim_t → 0tant/t=1, this case ensures that γ(d) ≤ r(d). Next, we discuss the general case, that is, when C is not necessarily contained in the open Northern hemisphere. We will use the following notation. For a point c∈ and a set C⊂, we set c=x∈xc>0, and C=⋂_c∈ Cc. Observe that for a set C⊆ we have that C is empty if and only if, C is not contained in any open hemisphere. This, in turn, is equivalent to having o∈C in . If C is such, then by Carathéodory's theorem, there is a C^'⊆ C of size at most d+2 with o∈C^'. Which yields that C^'=, and there is nothing to prove. Thus, we will assume that K:=C∩ is not empty. Then K⊂e_d+1,π/2-ρ, and thus, by projection, we have in H_N P_N(K)⊂ P_N(e_d+1,π/2-ρ)=e_d+1,(ρ). Since K⊂, we can write P_N(K)=P_N(⋂_c∈ Cc)= ⋂_c∈ CP_N(c∩), where on the right, we see an intersection of half-spaces in . Applying Theoremthm:QHT, we obtain a set C^'⊂ C of size at most 2d with e_d+1,(ρ)/r(d)⊃⋂_c∈ C^'P_N(c∩), which yields e_d+1,arctan((ρ)/r(d))⊃⋂_c∈ C^'(c∩). By polarity on , we get e_d+1,π/2 - arctan((ρ)/r(d))⊂C^'. By Claimclaim:tanestimate, π/2-arctan((ρ)/r(d))≥r(d)ρ/2, and Theoremthm:SphericalQST_from_Euclidean_QST follows. § PROOFS OF THE TECHNICAL TOOLS The first inequality is a standard exercise in calculus. To prove the second one, consider f [0, π/2) → given by f(t) = tan t/t for t ∈0, π/2 and f(0)=1. By direct computations, f^'(t) = (tan t)^'· t - tan t/t^2 = t/cos^2 t - tan t/t^2 = t - sin t cos t/t^2 cos^2 t = t - sin (2t)/2/t^2 cos^2 t. Since t > sin t for a positive t, we conclude that f^' is positive on (0, π/2). Thus, f is strictly increasing on [0, π/2). Consequently, for any t ∈0, π/4, tan t ≤tan (π/4)/π/4· t ≤ 2t. Since r > 0 and ρ∈0, π/2, we have the following sequence of equivalent inequalities: π/2 - arctanρ/r≥r/2·ρ ⇔ ρ/r≥r/2·ρ ⇔ ρ/r≤r/2·ρ ⇔ tanr/2·ρ≤ r tanρ. Since r ∈ (0,1], one gets r/2·ρ∈0, π/4. By Claim <ref>, tanr/2·ρ≤ r ρ≤ r tanρ. The claim follows. amsalpha
http://arxiv.org/abs/2307.00219v1	20230701043510	Iterative conditional replacement algorithm for conditionally specified models	[ "Kun-Lin Kuo", "Yuchung J. Wang" ]	stat.CO	[ "stat.CO" ]	Iterative conditional replacement algorithm for conditionally specified models Kun-Lin Kuo Institute of Statistics, National University of Kaohsiung, Kaohsiung, Taiwan and Yuchung J. WangCorresponding author: [email protected] Department of Mathematical Sciences, Rutgers University, Camden, NJ, USA ============================================================================================================================================================================================================================================================= The sample-based Gibbs sampler has been the dominant method for approximating joint distribution from a collection of compatible full-conditional distributions. However for conditionally specified model, mixtures of incompatible full and non-full conditional distributions are the realities; but, their updating orders are hard to identified. We propose a new algorithm, the Iterative Conditional Replacement (ICR), that produces distributional approximations toward the stationary distributions, dispensing Markov chain entirely. ICR always converges, and it produces mutually stationary distributions, which will be consistent among one another when the conditional distributions are compatible. Examples show ICR to be superior in quality, while being more parallelizable and requiring little effort in monitoring its convergence. Last, we propose an ensemble approach to decide the final model. Keywords: Dependency network; I-projection; Method of alternating projection; Mutually stationary distributions; Unsupervised leaning. § INTRODUCTION Using the two cultures of <cit.>, the assumption of a joint distribution is data modeling, whereas conditionally specified model (CSM)—specifying a joint distribution via conditional distributions—belongs to the camp of algorithmic modeling. A typical example is in multiple imputation: explicit full multivariate (Bayesian) models versus MICE <cit.>. However, Markov random field <cit.>, spatial modeling <cit.>, and dependency networks <cit.> had been shown that the conditional approach offers certain advantages. CSM can be used to compose joint models from data collected over spatial ranges or temporal stages, because it would be unrealistic to simultaneously articulate a joint model for a large number of variables. A better is to locally model a small number of variables, then combine those submodels into a joint model, like embedding pieces of a jigsaw puzzle into a complete picture. Our algorithm will make the process of modeling locally and synthesizing globally easier. Formally, CSM determines a joint distribution for 𝕏=(x_1,…,x_d) after three stages of maneuvers: * Conditional modeling: Built a predictive conditional model from data for every x_i ≡{i} using a subset of 𝕏\{x_i}≡{-i} as the predictors via a regularized modeling or machine learning algorithm, such as regression, classification, or a neural network. Let the learning outcome be {f_i\|c_i: 1 ≤ i ≤ d}, where c_i ⊆{-i}. Or more directly, a conditional model, { f_a_i\|b_i: 1 ≤ i ≤ L }, has already been formulated by domain experts using subject matter knowledge and algorithms of her choice, where a_i and b_i are non-intersecting subsets of 𝕏. For spatial data, c_i (b_i) is commonly known as the “neighbors” of x_i (a_i); in general, c_i (b_i) is the covariates used to predict x_i (a_i). * Synthesize (from local to global): Embed the conditional distributions, {f_i\|c_i: 1 ≤ i ≤ d} or {f_a_i\|b_i: 1 ≤ i ≤ L }, into joint distributions of 𝕏. Nodes of 𝕏 may be divided into groups. Within each group, the synthesis produces intermediate distribution. These intermediate distributions then propagate in phases to the entire 𝕏, with the sequential orders of propagation playing a critical role. * Optimize: Different sequences to propagate the intermediate distributions may result in different joint distributions. The entire collection of stationary joint distributions, produced in Stage II, make up an ensemble, and it is the ensemble that makes the final model of 𝕏. The final outcome of a CSM will depend on both the data and the algorithms used in the three stages. Here, we propose an algorithm to divide and to synthesize, and recommend another algorithm for the optimization attendant to Stage III. Absent the concerns of Stages II and III, much algorithmic creativity remains available in Stage I. A conditional model of Stage I is said to be compatible if a joint distribution exists, from which every conditional or marginal distribution can be derived. In such a circumstance, the output of a synthesis should be unique. Moreover, a CSM is said to be sufficient if it has enough information to identify a joint distribution of 𝕏. A conditional distribution involving all the variables in 𝕏 is called a full-conditional and is expressed as f_i\|-i or f_a_i\|-a_i; otherwise, it is a non-full conditional: f_a_i\|b_i, a_i∪ b_i 𝕏. When the CSM is {f_i\|-i: 1 ≤ i ≤ d} and the Gibbs sampler (GS) is used for synthesis, there can be up to d! (systematic scan) stationary distributions, one for each permutation of (1,…,d) <cit.>. Most CSM papers only consider full-conditional models that mimic the Bayesian computation <cit.>. However, proposing a full-conditional for every variable of 𝕏 is impractical; in stead, a mixture of full and non-full conditionals is a more realistic approach. Therefore, practical synthesis must be able to accommodate combinations of full and non-full conditionals. <cit.> invented partially collapsed Gibbs sampler (PCGS): the GS based on combinations of compatible full and non-full conditionals. They discovered that PCGS must follow specific updating orders to draw correct samples. Another difference between Bayesian computation and CSM is that approximating the posterior distribution is not the main objective of GS, while joint distribution of 𝕏 is the only focus of CSM. Here, we invented the Iterative Conditional Replacement algorithm (ICR) which produces distributions, not samples. ICR will simultaneously compute several joints and/or marginal distributions regardless of compatibility and its convergence is guaranteed. When the CSM is compatible, ICR will approximate the unique stationary distribution; otherwise, the joint distributions would be many and different. More critically, we devise simple rules to identify all the permissible updating orders. The examples below show that ICR is computationally more robust and flexible than sample-based methods. Traditionally, compatibility must be confirmed before GS or PCGS sampling can start; otherwise, the Markov chains can become null. In contrast, ICR cycles through a permissible updating order, and produces mutually stationary distributions. Moreover, there are compatible and sufficient CSM, such as { f_1\|23, f_2\|13, f_3}, that PCGS cannot sample, because it cannot pass the dependence of (x_1,x_2) back to x_3. We propose “divide-then-ICR” strategy: first, the CSM is divided into suitable groups such that permissible updating orders within each group can be found; second, apply ICR to each group and produce (intermediate) distributions for subsets of 𝕏. Finally, use ICR again to combine intermediate distributions into joint distributions or marginal distributions. For example, { f_1\|23 ,f_2\|13, f_3} is first divided into { f_1\|23, f_2\|13} and { f_3}. From { f_1\|23, f_2\|13}, ICR computes two stationary π_12\|3^(1,2) and π_12\|3^(2,1), where the superscripts indicate different updating orders. We multiply either distribution by f_3 and get the two mutually stationary joint distributions: π_123^(1,2) and π_123^(2,1). If these two joints are equal, the original CSM is deemed compatible. The Stage III optimization is to find a mixture, απ_123^(1,2)+ (1-α)π_123^(2,1), that minimizes the deviance relative to the original CSM. In the past, there have been many algebraic proposals to verify the compatibility among full conditionals, for example, <cit.> and <cit.>. However, how to verify the compatibility between full and non-full conditionals is still very much an open problem. Here is a case that computations can answer algebraically difficult question; we prove that the CSM is compatible when the multiple stationary distributions computed by ICR are the same. In the examples below, benefits of ICR are highlighted by its capacity to handle (a) incompatible CSM; (b) reducible CSM whose support is partitioned; (c) the conditional density is sticky for GS to sample (slow mixing); and (d) the CSM that divide-then-ICR can synthesize, whereas PCGS cannot. ICR is introduced in Section <ref>, first for full conditionals, then for combinations of full and non-full conditionals. ICR is cyclically doing I-projections among spaces defined individually by each conditional distribution. Examples are in Section <ref>. Many times, ICR cannot be applied to a CSM directly; but partitioning a CSM into several smaller CSM enables ICR to be applied locally. Historical connections of ICR with other algorithms, such as GS, power method, and alternating projection are addressed in Section <ref>. Section <ref> contains a brief conclusion. § THE ITERATIVE CONDITIONAL REPLACEMENT ALGORITHM Hereafter, conditional and marginal distributions/densities will be abbreviated as conditional(s) and marginal(s). A joint density is denoted by p, q, π, f, or g without subscript, while their marginal and conditional densities have subscripts and are denoted as π_1, p_ij, q_a, q_-a, f_i\|-i, g_12\|34, where 1={x_1}, ij={x_i,x_j}, a={x_i: i∈ a}, -a={x_i: i ∉a}, i\|-i={x_i\|x_j, j i}, and 12\|34 ={x_1,x_2\|x_3,x_4}. We also reserve f_a_i\|b_i and g_a_j\|b_j for the conditional distributions in a CSM, p and q as the distributions produced during ICR iterations, and π^(i_1,…,i_d) for the stationary joint distribution updated in the order of (i_1,…,i_d). Moreover, let S(f) and S(f_i\|-i) be the support of f and f_i\|-i, respectively; S(q_a) be the support of q_a. We always assume S(f_j\|-j) = S(f_i\|-i) for all (i,j). A d-dimensional joint density f is said to satisfy the total positivity condition if S(f)= S(f_1)×⋯× S(f_d). We use Kullback-Leibler divergence, called K-L divergence hereafter, as the measure of deviance that drives ICR's search. The K-L divergence is defined as I(p;q)=∑_x p(x) logp(x)/q(x). §.§ ICR for conditionally specified models of full conditionals Let the CSM be {f_j\|-j: 1 ≤ j ≤ d}, and (i_1 ,i_2, …, i_d) and (i_2, …, i_d, i_1) be two adjacent updating orders. <cit.> prove the following properties for {π^(i_1,…,i_d)}: * Stationary distributions π^(i_1 ,i_2, …, i_d) and π^(i_2, …, i_d, i_1), respectively, have f_i_d\|-i_d and f_i_1\|-i_1 as their conditionals; * π^(i_1, i_2, …, i_d)_-i_1 = π^(i_2, …, i_d, i_1)_-i_1; and * π^(i_1, i_2, …, i_d)_i_1 = π^(i_2, …, i_d, i_1)_i_1. Therefore, the goal of the algorithm is to formulate sequences of joint distributions that monotonically approximate the {π^(i_1, …,i_d)} such that they collectively fulfill (H1)–(H3). Requirements (H2) and (H3) are necessary for balancing the degrees of freedom between the CSM and the collection of all the stationary distributions. To illustrate, consider a simple CSM A={f_1\|2,f_2\|1}, and define C_1={f_1\|2ω_2} and C_2={f_2\|1ν_1}, where ω_2 and ν_1 are marginal densities of x_2 and x_1, respectively. Let q be a joint density having the same support of f_1\|2. The K-L divergence between q and a τ= f_1\|2τ_2 ∈ C_1 satisfies the Pythagoras equality: I(q;τ)=I(q; f_1\|2q_2) + I(f_1\|2q_2;τ), which is proved in Appendix <ref>. By choosing τ_2=q_2, I(f_1\|2q_2;τ)=0 and minimization of I(q;τ) is achieved. Thus, I-projection of q=q_1\|2 q_2 onto C_1, is f_1\|2 q_2, so it is named conditional replacement. By the same token, the I-projection of q=q_2\|1 q_1 onto C_2 is f_2\|1q_1. Let the iterations begin from a q^(0). The following alternating I-projections between C_1 and C_2 produce two sequences of joints: q^(2k+1)=f_1\|2q^(2k)_2 ∈ C_1 q^(2k+2)=f_2\|1 q^(2k+1)_1 ∈ C_2, Throughout, (H1) holds for both { q^(2k+1)} and { q^(2k+2)}. The choices of q^(2k+1)_2= q^(2k)_2 and q^(2k+2)_1= q^(2k+1)_1 not only minimize the K-L divergence, but also satisfy (H2). Next, (H3) provides the metric to detect the convergence of ICR; I-projections will be stopped at t when q^(2t+1)_1=q^(2t)_1 and q^(2t+2)_2=q^(2t+1)_2. Numerically, stop ICR at t-th iteration when M(t)=I(q_1^(2t);q_1^(2t+1))+I(q_2^(2t+1);q_2^(2t+2)) < 10^-10. Upon convergence, we designate q^(2t+1) as π^(2,1)∈ C_1 and q^(2t+2) as π^(1,2)∈ C_2. The following proposition follows from Theorem <ref> to be proved later. Both I(π^(2,1); q^(2k+1)) and I(π^(1,2);q^(2k+2)) decrease to 0 as k→∞. Due to the total variation norm inequality, P-Q≤√(1/2 I(P;Q)), q^(2k) - π^(1,2)→ 0 and q^(2k+1) - π^(2,1)→ 0. π^(1,2) =π^(2,1) if and only if {f_1\|2, f_2\|1} are compatible. π^(1,2) =π^(2,1) implies C_1 ∩ C_2 ∅, thus compatible. When {f_1\|2, f_2\|1} are compatible if and only if they have the same odds ratios. Two distributions are the same if and only if they have the same odds ratios and the same marginal densities, which ICR is designed to achieve, i.e., (H2) and (H3). <cit.> has an algebraic check of the compatibility between f_1\|2345 and f_2\|1345 without iteration. Alternatively, ICR begins with an arbitrary q^(0)_2\|345 and computes q^(2k+1)_12\|345=f_1\|2345q^(2k)_2\|345 and q^(2k+2)_12\|345=f_2\|1345 q^(2k+1)_1\|345, until they converge to π^(1,2)_12\|345 and π^(2,1)_12\|345, respectively. Regardless of the initial q^(0)_2\|345 , π^(1,2)_12\|345 =π^(2,1)_12\|345 confirms compatibility. For d=3 and CSM: {f_1\|23, f_2\|13, f_3\|12}, define C_i={f_i\|-i v_-i} for i=1,2,3, where v_-i is any marginal density of x_-i. There are two updating orders: clockwise: C_1→ C_2 → C_3 → C_1 →⋯; and counter-clockwise: C_1→ C_3 → C_2 → C_1 →⋯. The three stationary distributions of clockwise sequence are π^(1,2,3)∈ C_3, π^(2,3,1)∈ C_1 and π^(3,1,2)∈ C_2, and they are called circularly-related, and ICR approximates them with the following iterations: q^(3k+1)=f_1\|23 q^(3k)_23, q^(3k+2)=f_2\|13 q^(3k+1)_13 q^(3k+3)=f_3\|12 q^(3k+2)_12,k=0,1,2,… . The above marginalization-then-multiplications is designed to satisfy both (H1) and (H2). And ICR stops iterations when (H3): q^(3t)_1=q^(3t+1)_1 q^(3t+1)_2=q^(3t+2)_2 and q^(3t+2)_3=q^(3t+3)_3, are reached. Numerically, ICR stops when M(t)=I(q_1^(3t);q_1^(3t+1))+I(q_2^(3t+1);q_2^(3t+2)) +I(q_3^(3t+2);q_3^(3t+3))<10^-10. The following proposition follows from Theorem <ref>. For the clockwise updating order, the three sequences of joint densities converge, respectively, to their stationary distributions. That is, as k →∞, q^(3k+1)→π^(2,3,1)∈ C_1, q^(3k+2)→π^(3,1,2)∈ C_2 and q^(3k+3)→π^(1,2,3)∈ C_3 in K-L divergence. CSM: {f_1\|23, f_2\|13, f_3\|12} are compatible if and only if π^(1,2,3) =π^(2,3,1)=π^(3,1,2). Let D={1,…,d} represent (x_1,…,x_d). Consider the conditional model: A={ f_a_i\|-a_i: 1 ≤ i ≤ L}, with ⋃_i=1^L a_i= D. Again define C_a_i={f_a_i\|-a_i v_-a_i}, where v_-a_i is any x_-a_i-marginal density. For a fixed updating order: C_a_1→ C_a_2→⋯→ C_a_L, the L circularly-related stationary distributions are P={π^(a_2,…,a_L,a_1)∈ C_a_1, π^(a_3,…,a_L,a_1,a_2)∈ C_a_2, …, π^(a_1,a_2,…,a_L)∈ C_a_L}. We start with q^(0)= f_a_L\|-a_L w_-a_L∈ C_a_L. One cycle of ICR consists of L I-projections. For 1 ≤ i ≤ L , the conditional replacements for (H1) and (H2) are: q^(Lk+i)= f_a_i\|-a_i q^(Lk+i-1)_-a_i∈ C_a_i, k=0,1,…. The iterations stop at t when q^(Lt+i)_a_i=q^(Lt+i-1)_a_i for every 1≤ i ≤ L, that is, (H3). Numerically, ∑_i=1^L I(q_a_i^(Lt+i);q_a_i^(Lt+i-1)) < 10^-10 is used to stop the iterations. If the L stationary distributions of P are the same, then the conditionals of A are compatible. Because π^(a_i+1,…,a_i-1,a_i)∈ C_a_i, the equalities of L stationary distributions of P imply ⋂_i=1^L C_a_i∅, hence compatible. §.§ ICR for unsaturated conditionally specified models (combinations of full and non-full conditionals) We shall name a CSM of exclusively full conditionals (Section <ref>), as a saturated CSM, otherwise, the CSM is unsaturated. To model data, unsaturated CSM is more realistic. But it is rarely discussed in the literature because the GS has a hard time sampling unsaturated CSM. A major difficulty for GS is finding the rules that identify the correct sequential orders to sample the non-full conditionals. PCGS <cit.> is proposed to circumvent such issues, and our algorithms will provide its theoretical justifications. The following rules are quite intuitive from the perspective of conditional replacement. Let an unsaturated CSM be represented by {f_a_i\|b_i: 1 ≤ i ≤ L} and Δ=(⋃_i=1^L b_i) \ (⋃_i=1^L a_i). Also, define C_a_k={f_a_k\|b_k v_b_k=q_a_k ∪ b_k}, where v_b_k is a marginal distribution of b_k. Conditional replacement (I-projection) of any q_a_i ∪ b_i∈ C_a_i onto C_a_j is permissible, written as C_a_i⇀ C_a_j, when the following two rules hold: * b_j ⊆ a_i ∪ b_i. * a_i ∩ b_j ∅. When C_a_i⇀ C_a_j, we define the ICR mapping ℙ: C_a_i→ C_a_j as ℙ(q_a_i ∪ b_i)= f_a_j\|b_jq_b_j, where q_b_j is the x_b_j-marginal density of q_a_i∪ b_i. Marginalization of q_a_i ∪ b_i into q_b_j can only be done when Rule A holds. Next, we consider applying ℙ in cycle. Let (1^∗,…, L^∗), be a permutation of (1, …,L) with (L+1)^∗≡ 1^∗. If every ℙ mapping from C_a_i^∗ to C_a_(i+1)^∗ is permissible, then (a_1^∗,…, a_L^∗) is said to be a permissible updating cycle for {f_a_i\|b_i: 1 ≤ i ≤ L}, and is denoted as ⟨⟨ a_1^∗,…, a_L^∗⟩⟩. [unconditioned ICR]Let the conditional model be A={ f_a_i\|b_i: b_i ∅, 1 ≤ i ≤ L}, Δ = ∅, and ⋃_i=1^L a_i= Λ. When ⟨⟨ a_1^∗,…, a_L^∗⟩⟩, ICR will synthesize joint and marginal distributions of Λ. In addition, the I-projections begin with a marginal distribution, q^(0)_b_1^∗, use q^(1)=f_a_1^∗\|b_1^∗ q^(0)_b_1^∗ to initiate the iterations, and ℙ^k (q^(1)) ∈ C_a_r^∗ where r=k L+1. For example, CSM: {f_12\|3, f_4\|123, f_3\|124, f_5\|1234} permits C_12⇀ C_4⇀ C_3⇀ C_5, but not C_5⇀ C_12 due to violation of Rule B; hence, Algorithm 2 cannot be applied. Had we changed f_12\|3 to f_12\|35, then ⟨⟨ 12,4,3,5⟩⟩, and Algorithm <ref> will synthesize one joint, π^, plus two marginals: {π_1235, π_1234}. When π^_1235=π_1235 and π^_1234=π_1234, the CSM is compatible. In the following, we consider unsaturated CSM that specifies conditional distributions, not joints. When Δ∅, it can be shown that Δ⊂ b_i for every i. Suppose that CSM {f_a_i\|b_i: b_i∅, 1 ≤ i ≤ L} has a permissible updating cycle. If Δ∅, then Δ⊂ b_i for every i. Without loss of generality, let ⟨⟨ a_1,…, a_L⟩⟩ be a permissible updating cycle. When u∈Δ=(⋃_i=1^L b_i) \ (⋃_i=1^L a_i), u∈ b_j for some j, but u∉a_i for all i. Because of Rule A, we have u∈ b_j⊆ a_j-1∪ b_j-1. Hence, u must also belongs to b_j-1. By induction, u belongs to every b_i, which implies that Δ⊂ b_i for every i. [conditioned ICR] Let { f_a_i\|b_i: b_i∅, 1 ≤ i ≤ L} be a conditional model having a permissible updating cycle. When Δ∅, ICR will synthesize densities that are conditioned on Δ. Let ⟨⟨ a_1,…, a_L⟩⟩ be a permissible updating cycle. The initial density is q^(1)_(a_1∪ b_1 ) \Δ \| Δ= f_a_1 \| b_1 q^(0)_(b_1\Δ) \| Δ, where q^(0)_(b_1\Δ) \| Δ is any conditional density of (b_1\Δ) given Δ. Every subsequent distribution produced by ICR is also conditioned on Δ. A simple example is { f_1\|23, f_2\|13}. Another example is {f_12\|345, f_3\|245} which permits ℙ mapping from C_3 onto C_12 conditioned on Δ={x_4, x_5}, and ℙ mapping from C_12 back onto C_3 conditioned on Δ. Using Algorithm <ref>, ICR synthesizes π_123\|45^(3,12) and π_23\|45^(12,3) from {f_12\|345, f_3\|245}. In the following, we concentrate on Algorithm <ref>, because most discussions apply to Algorithm <ref> with additional conditioning on Δ. For CSM: {f_a_i\|b_i: b_i ∅, 1 ≤ i ≤ L}, let C_a_i={ f_a_i\|b_iv_b_i}, and ⟨⟨ a_1,…, a_L⟩⟩ be a permissible updating cycle. A collection of densities, {π^(a_i+1,…,a_L,a_1,…,a_i)∈ C_a_i: 1 ≤ i ≤ L}, are said to be mutually stationary when ℙ(π^(a_i+1,…,a_L,a_1,…,a_i)) = π^(a_i+2,…,a_L,a_1,…,a_i+1) for every i, with (L+1)≡ 1. Mutually stationary distributions have the following properties: Each set of {π^(a_i+1,…,a_L,a_1,…,a_i)} is associated with a specific permissible updating cycles. * Every π^(a_i+1,…,a_L,a_1,…,a_i) is stationary with respect to ℙ^L, i.e., ℙ^L(π^(a_i+1,…,a_L,a_1,…,a_i))=π^(a_i+1,…,a_L,a_1,…,a_i). * For saturated CSM, {π^(1,2),π^(2,1)}, {π^(1,2,3),π^(2,3,1),π^(3,1,2)} and {π^(a_2,…,a_L,a_1), π^(a_3,…,a_L,a_1,a_2), …, π^(a_1,a_2,…,a_L)} are mutually stationary. * Neighboring marginal densities satisfy π^(a_i+1,…,a_L,a_1,…,a_i)_b_i+1 = π^(a_i+2,…,a_L,a_1,…,a_i+1)_b_i+1, i.e., condition (H2) for every i. * For a compatible CSM having π^* as its joint, {π^_a_i ∪ b_i: i≤ i ≤ L } satisfy ℙ (π^_a_i ∪ b_i)= π^_a_i+1∪ b_i+1, hence are mutually stationary. If one π^(a_i+1,…,a_L,a_1,…,a_i) is known, the other L-1 stationary densities can be computed via mapping ℙ cyclically. For example, when π^(1,2) is known, π^(2,1)= ℙ(π^(1,2)). * Only for a saturated CSM, {π^(a_i+1,…,a_L,a_1,…,a_i)} are all joint densities. * The assertion of the existence of {π^(a_i+1,…,a_L,a_1,…,a_i)} is always true for totally positive CSM. Otherwise, the existence depends on whether π^(a_i+1,…,a_L,a_1,…,a_i)_b_i+1 is a bona fide marginal distribution of b_i+1 for 1≤ i ≤ L. Therefore, we first determine a permissible updating cycle, say ⟨⟨ a_1,…,a_L⟩⟩, then ICR will compute {π^(a_i+1,…,a_L,a_1,…,a_i)}. In the following proofs, the CSM is {f_a_i\|b_i:1≤ i≤ L}, c_i=a_i∪ b_i, symbol x_c_i denote values of (x_j: j ∈ c_i) and C_a_i={h_c_i:h_a_i\|b_i=f_a_i\|b_i}. Assume C_a_i⇀ C_a_j is permissible. For any two densities h and g in C_a_i, mapping both by ℙ onto C_a_j decreases their K-L divergence. That is, I(h;g)>I(ℙ(h);ℙ(g)). First, we have I(h;g) = ∑_x_c_ih(x_c_i)logh(x_c_i)/g(x_c_i) = ∑_x_b_jh_b_j(x_b_j)∑_x_c_i\ b_jh_c_i\ b_j\|b_j(x_c_i\ b_j\|x_b_j)(logh_c_i\ b_j\|b_j(x_c_i\ b_j\|x_b_j)/g_c_i\ b_j\|b_j(x_c_i\ b_j\|x_b_j)+logh_b_j(x_b_j)/g_b_j(x_b_j)) = [∑_x_b_jh_b_j(x_b_j)I(h_c_i\ b_j\|b_j(x_c_i\ b_j \|x_b_j);g_c_i\ b_j\|b_j(x_c_i\ b_j \|x_b_j))] +I(h_b_j;g_b_j). It is easy to see that I(ℙ(h);ℙ(g))=I(h_b_j;g_b_j), because ℙ(h) and ℙ(g) have the same conditional density f_a_j\|b_j. Hence, I(h;g)-I(ℙ(h);ℙ(g)) =∑_x_b_jh_b_j(x_b_j)I(h_c_i\ b_j\|b_j(x_c_i\ b_j \|x_b_j);g_c_i\ b_j\|b_j(x_c_i\ b_j \|x_b_j)), which is strictly positive, unless h_c_i\ b_j\|b_j=g_c_i\ b_j\|b_j for every x_b_j∈ b_j. The following theorem proves that the L sequences of densities produced by ICR converge respectively to mutually stationary densities. For a permissible updating cycle, say ⟨⟨ a_1,…,a_L⟩⟩, assume the corresponding L mutually stationary densities π^(a_i+1,…,a_L,a_1,…,a_i), 1 ≤ i ≤ L with (L+1)≡ 1, exist. For every 1 ≤ i ≤ L, the sequence of densities produced by Algorithm <ref>, {q^(kL+i)}, converge monotonically to π^(a_i+1,…,a_L,a_1,…,a_i) in K-L divergence, as k tends to ∞. Due to Lemma <ref>, we have, for 1 ≤ i ≤ L, I(π^(a_i+1,…,a_L,a_1,…,a_i);q^(kL+i)) > I(ℙ(π^(a_i+1,…,a_L,a_1,…,a_i));ℙ(q^(kL+i))) = I(π^(a_i+2,…,a_L,a_1,…,a_i+1);q^(kL+i+1)). After applying ℙ L times, ICR is back to C_a_i with ℙ^L (π^(a_i+1,…,a_L,a_1,…,a_i)) = π^(a_i+1,…,a_L,a_1,…,a_i), and ℙ^L (q^(kL+i))= q^((k+1)L+i). Thus, I(π^(a_i+1,…,a_L,a_1,…,a_i);q^(kL+i)) > I(ℙ^L (π^(a_i+1,…,a_L,a_1,…,a_i));ℙ^L (q^(kL+i))) = I(π^(a_i+1,…,a_L,a_1,…,a_i);q^((k+1)L+i)). Hence, I(π^(a_i+1,…,a_L,a_1,…,a_i);q^(kL+i)) decreases strictly to zero as k →∞. Because the decrease is monotonic, Algorithm <ref> may be stopped at (k+1)th cycle when I( q^(kL+i); ℙ^L (q^(kL+i))) < 10^-10 for any i. The following corollary provides theoretical justifications for PCGS. Let π be a joint distribution of 𝕏 and the CSM be {π_i\|c_i:1≤ i≤ d}. Let (1^∗,…, d^∗) be a permutation of (1,…,d). When (a) i^∗∈ c_(i+1)^∗ and (b) c_(i+1)^∗\{i^∗}⊆ c_i^∗ for every i^∗ with (d+1)^∗≡ 1^∗, Algorithm <ref> will synthesis {π_i∪ c_i} from {π_i\|c_i}. Moreover, PCGS updating in the order of x_1^∗→ x_2^∗→⋯→ x_d^∗→ x_1^∗→⋯ preserves stationarity. Another feature of Algorithm <ref> is that it can be applied to subgroups of conditionals after suitably partitioning the CSM; the rule is that a permissible updating cycle is identified within each subgroup. Depending on the CSM, ICR might be able to synthesize the outcomes of the subgroups—the many local models—into global joint distributions of 𝕏. We shall name such an approach “divide-then-ICR”. If we depict a CSM as a directed graph, GS requires a feedback loop that connects every variable of 𝕏. Therefore, the option of partitioning a CSM into subgroups is not available to GS or PCGS. § EXAMPLES [A simple case for divide-then-ICR]Consider the compatible unsaturated CSM, {f_3, f_1\|23, f_2\|13}, with f_3(0)=f_3(1)=1/2. <cit.> showed that none of the six permutations of (1,2,3) can lead PCGS to generate samples from the correct joint, because there is no permissible updating cycle; though, the model is sufficient. The joint π and its two conditional densities f_1\|23 and f_2\|13 are given as follows; moreover, we add an incompatible g_2\|13 to pair with f_1\|23 for showcasing our compatibility check: x_1 0 1 0 1 0 1 0 1 x_2 0 0 1 1 0 0 1 1 x_3 0 0 0 0 1 1 1 1 π_123 1/20 3/20 4/20 2/20 3/20 3/20 3/20 1/20 f_1\|23 1/4 3/4 2/3 1/3 1/2 1/2 3/4 1/4 f_2\|13 1/5 3/5 4/5 2/5 1/2 3/4 1/2 1/4 g_2\|13 3/5 1/7 2/5 6/7 4/5 3/4 1/5 1/4 The CSM is first partitioned into {f_1\|23, f_2\|13} and {f_3}. Then ⟨⟨ 1,2⟩⟩, and Algorithm <ref> is applied with Δ ={3}. The initial distribution can be any q^(0)_2\|3. The stationary distributions, π_12\|3^(2,1) and π_12\|3^(1,2), are computed via the following alternating ℙ mappings: ℙ(q^(2k))= q^(2k+1)_12\|3≡ f_1\|23 q^(2k)_2\|3ℙ(q^(2k+1))=q^(2k+2)_12\|3≡ f_2\|13 q^(2k+1)_1\|3, k=0,1,2,…. When q^(2t+1)_1\|3=q^(2t)_1\|3 and q^(2t+2)_2\|3=q^(2t+1)_2\|3, the iterations reaches stationarity. Numerically, convergence had occurred after seven cycles because M(t)=I(q^(2t)_1\|3;q^(2t+1)_1\|3)+I(q^(2t+1)_2\|3;q^(2t+2)_2\|3) drops from M(0)= 6.7× 10^-2 to M(6)=4.7× 10^-11. Hence, we have q^(13)_12\|3 = π_12\|3^(2,1) and q^(14)_12\|3 =π_12\|3^(1,2). To check compatibility, we use Π(t)=I(q^(2t)_12\|3;q^(2t+1)_12\|3)+ I(q^(2t+1)_12\|3;q^(2t+2)_12\|3); it drops from Π(0)=2.0× 10^-2 to Π(6)=5.6× 10^-11, which implies π^(2,1)_12\|3=π^(1,2)_12\|3 and compatibility. Furthermore, π^(2,1)_12\|3 f_3 reproduces π_123. Now, consider the incompatible case: {f_1\|23, g_2\|13}. Because M(0)=2.7× 10^-1 drops to M(7)=2.1× 10^-11, Algorithm <ref> converges after eight cycles. But 0.92 <Π(t)<0.95, 0≤ t≤ 10 never decreases, hence the two stationary densities are different, which implies that f_1\|23 and g_2\|13 are not compatible. Let x_i have m_i categories for i=1,2,3. In order to match the joint and the x_3 marginal distributions, the number of unknowns is m_1 m_3+ m_2 m_3-2, but the number of equations is m_1 m_2 m_3+ 2 m_3-3. In terms of computational effort, Algorithm <ref> is much simpler than solving over-specified linear equations. [Permissible updating cycles of an unsaturated CSM]Consider a hypothetical example that an Asian nation applies to become a permanent member of the Security Council of United Nations (UN). America's vote is conditioned on Great Britain and France, but not on Russia and China. So its conditional distribution is a non-full conditional. Assume that France's vote would be conditioned on the other four nations, so its conditional distribution is a full conditional. Only the joint distribution can express the probability that this nation will not receive a veto. In Stage I, each conditional distribution can be estimated from this nation's voting history in UN and geopolitics; in Stage II joints will be synthesized from this unsaturated CSM. Here, we consider a hypothetical model whose f_i\|a_i are derived from a randomly generated π(x_1,…,x_5), hence, compatible: A={f_1\|2345,f_2\|1345,f_3\|145,f_4\|15,f_5\|1234}. There are only two out of 5!=120 updating cycles that are permissible: ⟨⟨ 5,4,3,2,1⟩⟩ and ⟨⟨ 5,1,4,3,2⟩⟩. Therefore, partition of CSM is not needed. For ⟨⟨ 5,4,3,2,1⟩⟩, one cycle of Algorithm <ref> is as follows: q^(5t+1)=f_5\|1234q_1234^(5t), q_145^(5t+2)=f_4\|15q_15^(5t+1),q_1345^(5t+3)=f_3\|145q_145^(5t+2), q^(5t+4)=f_2\|1345q_1345^(5t+3), q^(5t+5)=f_1\|2345q_2345^(5t+4). Every I-projection does two operations: marginalization then multiplication. For some non-full conditionals, marginalization may not be required. Among the above five steps, q^(5t+2)_145 and q^(5t+3)_1345 are, respectively, multiplied directly into f_3\|145 and f_2\|1345 to form q_1345^(5t+3) and q^(5t+4). When no marginalization is performed, the q^(k) will not conflict with the conditional models. Stop ICR when q^(5t+1)_5 =q^(5t)_5, q^(5t+1)_234 =q^(5t+4)_234, and q^(5t+4)_1 =q^(5t+5)_1. Numerically, ICR iterations will be stopped at t when M(t)=I(q_5^(5t);q_5^(5t+1))+I(q_234^(5t+1);q_234^(5t+4))+I(q_1^(5t+4);q_1^(5t+5)) < 10^-10. When compatibility is in question, you compute the following Π(t): Π(t)=I(q^(5t);q^(5t+1))+I(q^(5t+1);q^(5t+4))+I(q^(5t+4);q^(5t+5)). If it drops to 0, the CSM is compatible, otherwise, not. The stopping criterion for the other permissible cycle: ⟨⟨ 5,1,4,3,2⟩⟩ is M(t)=I(q_5^(5t);q_5^(5t+1))+I(q_1^(5t+1);q_1^(5t+2))+I(q_234^(5t+2);q_234^(5t+5)). For both updating cycles, the randomly generated joint distribution is recovered. <cit.> considered the unsaturated CSM: {f_1\|2345,f_2\|345, f_3\|145,f_4\|25,f_5\|13}; they used a procedure that is equivalent to recursive factorization to derive the joint density. We illustrate divide-then-ICR here. First, divide the CSM into {f_1\|2345,f_2\|345,f_3\|145}, {f_4\|25}, and {f_5\|13} because ⟨⟨ 3,2,1⟩⟩; ⟨⟨ 123,4⟩⟩ and ⟨⟨ 1234,5⟩⟩ hold. * Phase 1: Algorithm <ref> produces π_123\|45^(3,2,1), π_13\|45^(2,1,3), π_23\|45^(1,3,2) condition on {4,5}. To build a joint, only π_123\|45^(3,2,1) needs to be used in the next phase. * Phase 2: Algorithm <ref> uses {π_123\|45^(3,2,1), f_4\|25} to build π_1234\|5^(4,123) and π_24\|5^(123,4) conditioned on {5}. * Phase 3: Algorithm <ref> uses {π_1234\|5^(4,123), f_5\|13} to build a joint π_12345^(5,1234) and a marginal π_135^(1234,5). When the CSM is compatible, π_12345^(5,1234) is the joint producing the CSM. The synthesis is written as ⟨⟨ ⟨⟨ ⟨⟨ 1,2,3⟩⟩ , 4⟩⟩ ,5⟩⟩. [Embedding a CSM like a jigsaw puzzle]Let the CSM be {f_2\|1, f_3\|2, f_1\|3, f_4\|123, f_5\|1246, f_6\|1245, f_3^\|12456, f_6^\|12345}, where 3^* and 6^* indicate the variables appear twice in the model. We divide CSM into 4 subgroups: {f_2\|1, f_3\|2, f_1\|3}, { f_4\|123}, { f_5\|1246, f_6\|1245}, { f_3^\|12456, f_6^\|12345}, and use Algorithm 2 or 3 to consolidate the conditionals in each group into: marginals: {π_12, π_23, π_13}, and conditionals: f_56\|124, f_36\|1245, respectively. In order to incorporate f_4\|123, we need the marginal π_123 which is missing from the CSM, so the CSM is not sufficient. Recall the three-way log-linear model: logπ_ijk= μ +μ^1_i + μ^2_j+ μ^3_k + μ^12_ij+ μ^23_jk+μ^13_ik+ μ^123_ijk. In order to obtain π_123, an assumption about the three-way iterations is required. Either μ^123_ijk= 0 or μ^123_ijk= constant is most common; other possibilities may need some subject-matter knowledge. Once μ^123 are settled, use iterative proportional fitting algorithm (IPF) along with {π_12, π_23, π_13} to obtain π_123. Combining π_123 and f_4\|123 gives π_1234, which will be marginalized into π_124 to be combined with f_56\|124 to form π_12456. This distribution can be reduced to π_1245 to be matched with f_36\|1245 to form a joint distribution π_123456. [A sticky conditional model for GS]Consider the following compatible conditionals: x_1 0 1 0 1 0 1 x_2 0 0 1 1 2 2 f_1\|2 100000/100001 1/100001 100000/100001 1/100001 7/8 1/8 f_2\|1 200000/700007 2/8 500000/700007 5/8 7/700007 1/8 , which are derived from the following joint density: π=(200000/700015,2/700015,500000/700015,5/700015, 7/700015,1/700015). It would be difficult for GS to explore the support because the concentration of probabilities at (0,0) and (0,1). Here we show that ICR will not be hindered by the sticky cells. For ICR, M(4)=3.8× 10^-11 indicates convergence after five rounds of ICR. The mutual K-L divergence between π^(1,2) and π^(2,1) is Π(4)=3.9× 10^-11, thus confirms that the model is compatible, and π is reproduced. Next, GS is used to produce 5 batches of size 1,000,000 samples from {f_1\|2,f_2\|1}; the burn-in is set at 100,000. Let g^(s), s=1,…,5, be the empirical pdf with g^(1) based on the first 1,000,000 samples, and the other g^(i)s based on 4 increments of 1,000,000 additional samples. The accuracy of GS are measured by discrepancies, I(g^(s);π)+I(π;g^(s)), s=1,…,5. Last, let T_1 and T_2 be the transition matrices based on f_1\|2 and f_2\|1, respectively. The power method uses the averages of the six rows of (T_1T_2)^n as the approximations to π. Let p^(t) be the distribution by power-method approximations, which stops at t=5 with I(p^(5);π)+I(π;p^(5))<10^-10, where π is the target joint distribution. In Figure <ref>, ICR converges a bit faster than the power method, while the additional 4 million GS samples shows little improvement. In terms of efficiency, CPU times (second) of ICR, power method, and GS are 0.006, 0.019 and 114, respectively. The CPU time consumed by GS makes it impractical to deal with problems having sticky issue <cit.>, also see <cit.> for a sticky Gaussian model. Sticky issue slows down sample-based exploitation of the support, but it dose not affect distribution-based ICR or power method. [Conditional models with disjoint support]Consider a compatible model A_1={f_1\|234,f_2\|134,f_3\|124,f_4\|123} and an incompatible model A_2={f_1\|234,f_2\|134, f_3\|124, g_4\|123}, whose conditional densities are detailed as follows: x_1 0 0 1 1 0 0 1 1 x_2 0 1 0 1 0 1 0 1 x_3 0 0 1 1 0 0 1 1 x_4 0 0 0 0 1 1 1 1 f_1\|234 1 1 1 1 1 1 1 1 f_2\|134 1/8 7/8 2/5 3/5 5/12 7/12 1/5 4/5 f_3\|124 1 1 1 1 1 1 1 1 f_4\|123 1/6 1/2 2/3 3/7 5/6 1/2 1/3 4/7 g_4\|123 1/6 3/10 2/3 3/7 5/6 7/10 1/3 4/7 Their support S is the union of two disjoint regions S_1={(0,0,0,0),(0,1,0,0),(0,0,0,1), (0,1,0,1)} and S_2={(1,0,1,0),(1,1,1,0), (1,0,1,1),(1,1,1,1)}. We will use three different marginal distributions: u, v and w to show how they affect the stationary distributions: x_1 x_2 x_3 x_4 u v w 0 0 0 0 1/8 1/20 1/15 0 1 0 0 1/8 3/20 2/15 0 0 0 1 1/8 2/20 3/15 0 1 0 1 1/8 4/20 4/15 4\|c\|total of S_1 1/2 1/2 2/3 1 0 1 0 1/8 1/10 1/15 1 1 1 0 1/8 1/10 1/15 1 0 1 1 1/8 1/10 1/15 1 1 1 1 1/8 2/10 2/15 4\|c\|total of S_2 1/2 1/2 1/3 . Notice that u is the uniform distribution, and ∑_x∈ S_iv(x)=∑_x∈ S_iu(x)≠∑_x∈ S_iw(x). Let p^(0)=f_4\|123u_123, q^(0)=f_4\|123v_123 and r^(0)=f_4\|123w_123 be the initial distributions of ICR, which uses ⟨⟨ 1,2,3,4⟩⟩ as the updating cycle. The three sequences of joints are, respectively, p^(4k+i)=f_i\|-ip_-i^(4k+i-1), q^(4k+i)=f_i\|-iq_-i^(4k+i-1),r^(4k+i)=f_i\|-ir_-i^(4k+i-1), where i=1,…,4. The convergence of p^(k) is determined by M_p(k)=I(p_1^(4k);p_1^(4k+1))+I(p_2^(4k+1);p_2^(4k+2))+I(p_3^(4k+2);p_3^(4k+3))+ I(p_4^(4k+3);p_4^(4k+4)). We stop ICR at time t_p when M_p(t_p)<10^-10. The M_q(k) and M_r(k) are similarly defined, so are the stopping times t_q and t_r. Figure <ref> plots M_p(t), M_q(t) and M_r(t) vs. t, and they all indicate fast convergence with t_p=5, t_q=4 and t_r=4, respectively. After convergence, we obtain three batches of stationary joint distributions: {p^(4t_p+i)}, {q^(4t_q+i)}, {r^(4t_r+i)}, where i=1,…,4 are associated with C_i. Compatibility is equivalent to within-group consistency, whose discrepancy is measured by Π_p(t)=I(p^(4t);p^(4t+1))+I(p^(4t+1);p^(4t+2))+I(p^(4t+2);p^(4t+3))+I(p^(4t+3);p^(4t+4)). The resulting Π_p(5)=3.6× 10^-12, Π_q(4)=9.4× 10^-11 and Π_r(4)=1.3× 10^-10 indicate that A_1 is a compatible CSM, no matter which initial distribution is used. Uniqueness of stationary distributions is based on within-C_4 consistency; we need only to compare among p^(4t_p+4), q^(4t_q+4) and r^(4t_r+4): I(p^(4t_p+4);q^(4t_p+4))+I(q^(4t_q+4);p^(4t_p+4)) = 1.2× 10^-12, I(p^(4t_p+4);r^(4t_r+4))+I(r^(4t_r+4);p^(4t_p+4)) = 0.1155, I(q^(4t_q+4);r^(4t_r+4))+I(r^(4t_r+4);q^(4t_q+4)) = 0.1155. The above informs us that p^(4t_p+4)=q^(4t_q+4), p^(4t_p+4) r^(4t_r+4), and q^(4t_q+4) r^(4t_r+4). Therefore, stationary distributions indeed depend of the initial distributions, which is expected for reducible Markov chain. Next, ICR with initial distributions u, v and w is applied for A_2. The M_p(t), M_q(t) and M_r(t) are plotted against t in lower panel of Figure <ref>. The left plot indicates fast convergence also for incompatible CSM, with M_p(4)=1.0× 10^-12, M_q(4)=2.2× 10^-13, and M_r(3)=7.2× 10^-11. To check compatibility, we calculate Π_x. Because Π_p(4)=0.0107, Π_q(4)=0.0107 and Π_r(3)=0.0143, A_2 is deemed incompatible. To see the effect of initial distributions, we compute the following K-L divergences: I(p^(20);q^(20))+I(q^(20);p^(20)) = 1.57× 10^-15, I(p^(20);r^(16))+I(r^(16);p^(20)) = 0.1155, I(q^(20);r^(16))+I(r^(16);q^(20)) = 0.1155. We see that the difference between u and v does not change their stationary distributions. In summary, this example shows that * Convergence of ICR is not affected by the compatibility of the model; * Compatibility is not affected by the choice of the initial distribution, i.e., our compatibility check is independent of the choice of the initial distribution; and * It is the probability assigned to each disjoint support, (S_i), not the detailed distribution over S_i, that determines the stationary distribution. When the support is partitioned, (S_i) must be carefully guided by subject-matter knowledge; the (S_i) may also be adjusted iteratively until the joint distribution is more consistent with data. This flexibility of using initial distribution to fine tune the stationary distribution is not available to irreducible CSM. § DISCUSSIONS §.§ Differences between ICR and GS Consider the saturated CSM {f_i\|-i: 1 ≤ i ≤ d}; let T_i be the transition matrix of f_i\|-i, and q be a vector representing a joint pdf. It can be shown that qT_i=f_i\|-i q_-i≡ℙ(q). That is, q transitioned by T_i, I-projection of q onto C_i, and replacing the (x_i\|-x_i)-conditional of q by f_i\|-i are the same thing. But the commonality ends here. We choose conditional replacement because it is the easiest to modify for non-full conditionals. Also, Rule A of Algorithm <ref> is intuitively necessary because it is the only circumstance under which conditional replacement can be executed. GS is justified by Markov chain which cannot be applied to incompatible or unsaturated CSM. A popular remedy is to expand every non-full conditionals into a full conditional. But such a practice may blind GS to use an impermissible updating cycle, and cause GS to sample from the distribution that is not the target. We show that identification of the permissible updating cycles is critical for the execution of ICR, while GS does not need to pay attention to it, because Rule A and Rule B are automatically satisfied for full conditionals. §.§ Use Gibbs ensemble to find the optimal joint distribution Graphically, a conditional model is depicted by a cyclic directed graph with feedback loop. <cit.> call such a graphical model a dependency network, and their objective is to synthesize one joint distribution from a saturated CSM derived empirically, and without regard to compatibility. They used GS based on incompatible full conditionals to synthesize, and coined the term pseudo-Gibbs sampler (PGS). They claimed that different updating cycles of PGS will converge to nearly identical stationary distributions when the data are large; but, statisticians have refuted such a claim. For example, <cit.> stated “the simulations (imputations) never converge to a single distribution, rather the distribution depends upon the order of the updating and when the updating stopped.” <cit.> also stated “Gibbs samplers based on a set of densities that are not compatible result in Markov chains that are null, that is, they are either null recurrent or transient.” In fact, <cit.> stated that PGS's “theoretical properties are largely unknown and no doubt considerable caution must be exercised.” <cit.> called the stationary distributions of PGS, pseudo-Gibbs distributions (PGD). According to <cit.>, incompatible CSM faces the multiplicity problem: there are many different models that have about the same merit. He suggests that “aggregating over a large set of competing models can reduce the nonuniqueness, while improving accuracy.” In addition, the resulting model “is also more stable.” <cit.> <cit.> named the collection of d! PGDs of a saturated CSM as the Gibbs ensemble, and proposed to use a weighed sum of PGDs as the final model. Building the ensemble requires running d! long chains of Gibbs sampling, which makes the computational burden heavy, if not impossible for large d. For instance, <cit.> used two chains of 1,000,000 GS samples each to approximate π^(1,2) and π^(2,1), even though {f_1\|2, f_2\|1} are two 2 × 2 conditionals. From d full conditionals, ICR produces d PGDs in one batch, hence, reduces the computational burden by one order. <cit.> considered only ensemble for saturated CSM, because PGS cannot sample unsaturated CSM. As we have shown, the size of the Gibbs ensemble of an unsaturated CSM is considerably less than d!, because only permissible updating cycles need to be entertained. This understanding makes the computations for unsaturated CSM less prohibitive. In Example <ref>, {f_1\|2345,f_2\|1345,f_3\|145,f_4\|15,f_5\|1234} have only six stationary distributions in two batches, not 120. Gibbs ensemble optimizes by computing a weighted mixture of these six distributions. The deviance of the mixture relative to the CSM is smaller than every individual PGD. Different deviance measures, such as K-L divergence, Pearson chi-square X^2, and Freeman-Turkey F^2 have been considered; therefore, the optimal joint will be deviance-dependent. §.§ Comparisons between the power method and ICR Back to {f_i\|-i: 1≤ i ≤ d}, let T_i be the transition matrix of f_i\|-i, and T=T_1⋯ T_d. The power method uses the row average of T^k as the stationary distribution for T. But in practice, the power method often encounters a sparse T of enormous size when d is large; thus it is not practical. ICR computes at least as fast as the power method, and it has the following computational advantages: * One cycle of ICR computes d stationary densities, while the power method requires d sequences. For d=3, ICR produces mutually stationary joints: π^(1,2,3),π^(2,3,1), and π^(3,1,2), whereas the power method needs to evaluate 3 separate sequences: (T_1T_2T_3)^k, (T_2T_3T_1)^k and (T_3T_1T_2)^k until convergence. * The size of 2-dimensional T increases exponentially with d, while ICR works with d-dimensional arrays. * The power method cannot be applied to unsaturated conditional models because the transition matrices of full and of non-full conditionals have different sizes. * When T is a reducible matrix, power method often fails. §.§ Method of alternating projections (MAP) Traditionally, GS considers T=T_1⋯ T_d as one entity; hence, the effect of individual T_i becomes latent. However, entertaining T_i separately can gain operational advantage, see, for example, <cit.> and <cit.>, who used the method of alternating projection (MAP) of <cit.> to find “minimal sufficient subfields”. Also, it should not be a surprise that our conditional replacement mapping ℙ onto C_i is Burkholder's conditional expectation given C_i. More recently, <cit.> show that the GS is a MAP, when every T_i is considered separately. When the saturated CSM is compatible, the proof in <cit.> guarantees the convergence of ICR in norm, but not in K-L divergence. However, CSM often encounter incompatible models having non-full conditionals. Algorithm <ref> is a MAP, but it is different from ordinary MAP in the following aspects: * MAP is commonly used to approximate one fixed point in ⋂_i C_i, see <cit.>. Here, we show that MAP can also be used to pursue multiple fixed points, one in each C_i. * MAP usually projects onto closed subsets of the same space, say H={all the joint distributions over S(f_i\|-i) }. For a saturated CSM, every C_i is a subset of H. But the C_i defined by a non-full conditional is not a subset of H, but of a different space. Examples here show that MAP can be applied to closed subsets of different spaces, as long as the projections respect the hierarchy between spaces, i.e., Rule A. Because of (a) and (b) above, a new concept of stationarity is needed; mutual stationarity is better defined collectively, not individually. Figure <ref> illustrates such pursuits of ℙ with d=3. Distributions q^(3k+i) within each C_i converge monotonically to stationary distribution π^(j,k,i), and ℙ(π^(j,k,i))= π^(k,i,j). Minimum context and little background knowledge are required to understand the replacement of conditional distribution, and the simple proof of Theorem <ref>. Our goal is to make ICR, as an algorithm, easily understood and appreciated by statisticians and data scientists, who have little familiarity with Markov chain theory or Hilbert space. Another popular MAP algorithm is IPF, which hardly refer to Hilbert space, orthogonal projection or conditional expectation; instead, it is described as replacing marginal densities iteratively, see <cit.> and <cit.>. Finally, much of MAP has been dealing with continuous functions over convex domains. The algorithm, “divide-then-ICR,” and the proof of Theorem <ref> can be easily carried over to continuous distributions provided the integrals are finite. Marginalization of a continuous density is the computatonal obstacle of ICR. <cit.> studied alternating I-projection of a regular Gaussian distribution onto the intersection of spaces characterized by Gaussian conditionals (a C_i defined by a full conditional) and Gaussian marginal distribution (another C_j defined by a non-full conditional). For Gaussian distributions, marginalization is straightforward. Part of his algorithm <cit.> is similar to ICR. His model placed restrictions on the conditionals that guarantee compatibility (C_i ∩ C_j ∅), hence, has unique stationarity; he did not consider incompatible cases or discrete densities. § CONCLUSION When the number of variables is large and the data size is relatively small, subjective or objective variable selection is necessary, hence, unsaturated conditional models are inevitable. However, in the past, only saturated conditional models had been considered—<cit.>, <cit.>, <cit.>, <cit.>, <cit.>, <cit.> and <cit.>—due to lack of computational tools. On the other front, <cit.> used linear equations/algebra to check compatibility; their methods quickly reach the curse of dimension. ICR is invented to fit unsaturated conditional models, and to check their compatibility using computing, rather than algebra. ICR provides the channel to apply computing power to solve issues of conditional modeling. It seems to us that ICR is the right choice for CSM because it is multiplying by the transition matrix (see Section <ref>), doing I-projection (see Section <ref>), and performing conditional expectation (see Section <ref>), at the same time. ICR, along with “divide-then-ICR” and parallelization, can efficiently compute all of the mutually stationary distributions, which are called the Gibbs ensemble. We are in agreement with <cit.> and <cit.> that a fair-minded mixture of the Gibbs ensemble is a sensible approach in Stage III to resolve the multiplicity problem. Any practical algorithm must be easy to scale and requires little expertise to tune. ICR and the ensemble optimization meet both criteria. § APPENDIX §.§ The proof of Pythagoras equality Because τ∈ C_1, it can be written as τ=f_1\|2τ_2, and the K-L divergence between q and τ is I(q;τ) = ∑_i,j q(i,j) logq(i,j)/f_1\|2(i\|j)τ_2(j) = ∑_i,j q(i,j) logq(i,j)/f_1\|2(i\|j)q_2(j)+ ∑_i,j q(i,j) logf_1\|2(i\|j)q_2(j)/f_1\|2(i\|j)τ_2(j) = I(q; f_1\|2q_2) + I(q_2;τ_2)=I(q; f_1\|2q_2) + I(f_1\|2q_2;τ), because of I(q_2;τ_2) = ∑_i f_1\|2(i\|j) ∑_j q_2(j) logq_2(j)/τ_2(j) = ∑_i,jf_1\|2(i\|j)q_2(j) logq_2(j)/τ_2(j) = ∑_i,jf_1\|2(i\|j)q_2(j) logf_1\|2(i\|j)q_2(j)/f_1\|2(i\|j)τ_2(j)=I(f_1\|2q_2;τ). 40 [Arnold et al.(1996)]Arnold1996 Arnold B. C., Castillo E., & Sarabia, J. M. (1996). Specification of distributions by combinations of marginal and conditional distributions. Statistics & Probability Letters, 26, 153–157. [Arnold et al.(2002)]Arnold2002 Arnold B. C., Castillo E., & Sarabia, J. M. (2002). Exact and near compatibility of discrete conditional distributions. Computational Statistics and Data Analysis, 40, 231–252. [Arnold et al.(2004)]Arnold2004 Arnold B. C., Castillo E., & Sarabia, J. M. (2004). Compatibility of partial or complete conditional probability specifications. Journal of Statistical Planning and Inference, 123, 133–159. [Besag(1974)]Besag1974 Besag J. (1974). Spatial interaction and the statistical analysis of lattice systems (with discussion). Journal of the Royal Statistical Society: Series B, 36, 192–236. [Besag(2001)]Besag2001 Besag J. (2001). Comment on “Conditionally specified distributions: an introduction. Statistical Science, 16, 265–267. [Breiman(2001)]Breiman2001 Breiman L. (2001). Statistical modeling: the two cultures. Statistical Science, 16, 199–215. [Burkholder and Chow(1961)]Burkholder1961 Burkholder D. L., & Chow Y. S. (1961). Iterates of conditional expection operators. Proceedings of the American Mathematical Society, 12, 490–495. [Burkholder(1962)]Burkholder1962 Burkholder D. L. (1962). Successive conditional expectations of an integrable function. Annals of Mathematical Statistics, 33, 887–893. [Casella(1996)]Casella1996 Casella G. (1996). Statistical inference and Monte Carlo algorithms. Test, 5, 249–344. [Chen et al.(2013)]Chen2013 Chen S.-H., Ip E. H., & Wang, Y. J. (2013). Gibbs ensembles for incompatible dependency networks. WIREs Computational Statistics, 5, 478–485. [Chen and Ip(2015)]Chen2015 Chen S.-H., & Ip, E. H. (2015). Behaviour of the Gibbs sampler when conditional distributions are potentially incompatible. Journal of Statistical Computation and Simulation, 85, 3266–3275. [Cramer(1998)]Cramer1998 Cramer E. (1998). Conditional iterative proportional fitting for Gaussian distributions. Journal of Multivariate Analysis, 65, 261–276. [Darroch and Ratcliff(1972)]Darroch1972 Darroch J. N., & Ratcliff, D. (1972). Generalized iterative scaling for log-linear models. Annals of Mathematical Statistics, 43, 1470–1480. [Diaconis et al.(2010)]Diaconis2010 Diaconis P., Khare K., & Saloff-Coste, L. (2010). Stochastic alternating projections. Illinois Journal of Mathematics, 54, 963–979. [Gelman and Raghunathan(2001)]Gelman2001 Gelman A., & Raghunathan T. E. (2001). Comment on “Conditionally specified distributions: an introduction”. Statistical Science, 16, 268–269. [Heckerman et al.(2000)]Heckerman2000 Heckerman D., Chickering D. M., Meek C., Rounthwaite R., & Kadie C. (2000). Dependency networks for inference, collaborative filtering, and data visualization. Journal of Machine Learning Research, 1, 49–75. [Kaiser and Cressie(2000)]Kaiser2000 Kaiser M. S., & Cressie N. (2000). The construction of multivariate distributions from Markov random field. Journal of Multivariate Analysis, 73, 199–220. [Kuo and Wang(2018)]Kuo2018 Kuo, K.-L., & Wang, Y. J. (2018). Simulating conditionally specified models. Journal of Multivariate Analysis, 167, 171–180. [Kuo and Wang(2019)]Kuo2019 Kuo K.-L., & Wang, Y. J. (2019). Pseudo-Gibbs sampler for discrete conditional distributions. Annals of the Institute of Statistical Mathematics, 71, 93–105. [Raghunathan et al.(2001)]Raghunathan2001 Raghunathan T. E., Lepkowksi J. M., van Hoewyk J., & Solenberger, P. (2001). A multivariate technique for multiply imputing missing values using a sequence of regression models. Survey Methodology, 27, 85–95. [Smith and Roberts(1993)]Smith1993 Smith A. F. M., & Roberts G. O. (1993). Bayesian computation via the Gibbs sampler and related Markov chain Monte Carlo methods. Journal of the Royal Statistical Society: Series B, 55, 3–23. [van Buuren(2007)]vanBuuren2007 van Buuren S. (2007). Multiple imputation of discrete and continuous data by fully conditional specification. Statistical Methods in Medical Research, 16, 219–242. [van Dyk and Park(2008)]vanDyk2008 van Dyk D. A., & Park T. (2008). Partially collapsed Gibbs samplers: theory and methods. Journal of the American Statistical Association, 103, 790–796. [von Neumann(1950)]Neumann1950 von Neumann J. (1950). Functional Operators, Vol. 2. Princeton: Princeton University Press. [Wang(1993)]Wang1993 Wang Y. J. (1993). Construction of continous bivariate density fuctions. Statistica Sinica, 3, 173-187. [Wang and Ip(2008)]Wang2008 Wang Y. J., & Ip E. H. (2008). Conditionally specified continuous distributions. Biometrika, 95, 735–746. [Williams(2001)]Williams2001 Williams D. (2001). Weighing the Odds, Cambridge: Cambridge University Press.
http://arxiv.org/abs/2306.11911v1	20230620214916	LNL+K: Learning with Noisy Labels and Noise Source Distribution Knowledge	[ "Siqi Wang", "Bryan A. Plummer" ]	cs.CV	[ "cs.CV" ]	Ultra-sensitive separation estimation of optical sources Clémentine Rouvière,^1∗ David Barral,^1 Antonin Grateau,^1 Ilya Karuseichyk,^1 Giacomo Sorelli,^2 Mattia Walschaers,^1 Nicolas Treps^1 ^1Laboratoire Kastler Brossel, Sorbonne Université, CNRS, ENS-Université PSL, Collège de France, 4 place Jussieu, Paris, F-75252, France ^2Fraunhofer IOSB, Ettlingen, Fraunhofer Institute of Optronics, System Technologies and Image Exploitation, Gutleuthausstr. 1, 76275 Ettlingen, Germany ^∗E-mail: [email protected]. July 31, 2023 ============================================================================================================================================================================================================================================================================================================================================================================================================================================================================================= Learning with noisy labels (LNL) is challenging as the model tends to memorize noisy labels, which can lead to overfitting. Many LNL methods detect clean samples by maximizing the similarity between samples in each category, which does not make any assumptions about likely noise sources. However, we often have some knowledge about the potential source(s) of noisy labels. For example, an image mislabeled as a cheetah is more likely a leopard than a hippopotamus due to their visual similarity. Thus, we introduce a new task called Learning with Noisy Labels and noise source distribution Knowledge (LNL+K), which assumes we have some knowledge about likely source(s) of label noise that we can take advantage of. By making this presumption, methods are better equipped to distinguish hard negatives between categories from label noise. In addition, this enables us to explore datasets where the noise may represent the majority of samples, a setting that breaks a critical premise of most methods developed for the LNL task. We explore several baseline LNL+K approaches that integrate noise source knowledge into state-of-the-art LNL methods across three diverse datasets and three types of noise, where we report a 5-15% boost in performance compared with the unadapted methods. Critically, we find that LNL methods do not generalize well in every setting, highlighting the importance of directly exploring our LNL+K task.[Code available at <https://github.com/SunnySiqi/LNL_K>] § INTRODUCTION High-quality labeled data is beneficial to deep neural networks (DNNs) training. However, obtaining such datasets is expensive and labels are often corrupted in large real-world datasets <cit.>. Thus, Learning with Noisy Labels (LNL) <cit.> has become an important topic in the robust training. The goal of LNL is to effectively learn the feature distribution from the noisy training set and perform well on the clean test set <cit.>. To avoid overfitting to noisy labels, an ideal model would identify three types of clean samples: easy positives that match the estimated categorical distribution perfectly; hard negatives <cit.> that are near the decision boundary, and outliers <cit.> of the estimated distribution but still be representative of the true class. As shown in Fig. <ref>-a, existing methods <cit.> detect clean samples by finding the most similar samples within each class. Samples that match the category distribution well can be detected this way, while those near the decision boundary and outliers are still challenging. Moreover, a high noise ratio can lead to ambiguity in the estimated distribution, , the noise distribution is estimated instead of its category. For example, the red category in Fig. <ref>-a has 50% noise, which skews the distribution of the class and ends up selecting the noisy samples. Our key observation is that prior work does not consider the distribution of noise, which can be beneficial information in LNL for the above-mentioned challenges. Notably, the noise source knowledge is not entirely unknown in real-world datasets. Labels are rarely uniformly corrupted across all classes, and some classes are more easily to be confused than others <cit.>. For example, visually similar objects are often mislabeled: knitwear and sweater <cit.>, automobiles and trucks <cit.>. What's more, some categories are designed to establish causality in scientific settings and can be treated as noise sources in the training, such as the "control" group <cit.>, , "doing-nothing" group and when no experimental effect happens, the test object should look like "control." Hence, for datasets with such noise source distribution knowledge, exploring how to incorporate knowledge into the clean sample detection process has great potential. To this end, we introduce a new task: Learning with Noisy Labels and noise source distribution Knowledge (LNL+K). In contrast to traditional LNL tasks, we assume that we are given some knowledge about noisy label distribution. , noisy labels tend to originate from specific categories. For example, the knowledge in Fig. <ref> is that the noisy samples are from the yellow class. Compared with LNL that the probability of a sample being clean only depends on the distribution of its labeled class features, LNL+K also takes the distribution of its noise source features into account. The benefits of integrating noise source distribution knowledge are twofold. First, this knowledge is helpful in distinguishing noisy samples with similar features. Consider the red class in Fig. <ref>-b, even the noisy red triangles have similar features to the true circle class, given the noise source yellow class, it's obvious that those noisy samples are closer to their true label class. Second, knowledge is necessary when the noise ratio is high and noisy samples dominate the class distribution. Without knowledge, LNL methods select samples that maximize the similarity within the group, which ends up selecting the noisy ones that dominate the distribution. Unlike most LNL methods that assume an upper bound on the noise ratio <cit.>, LNL+K moves beyond this limitation. Rather than detecting clean-label samples according to how "similar" to other samples in its own class, LNL+K focuses on how "dissimilar" with samples in the noise source class. In order to demonstrate the benefits of LNL+K methods as mentioned above, we explore several baseline methods of LNL+K by adding noise source distribution knowledge to unsupervised state-of-art LNL methods <cit.>. The adaptations are made based on a unified framework of clean sample detection in LNL+K. Each adaptation method uses the same feature for clean sample detection as the LNL methods but then also compares the (noisy) class features with the noise source features. Experiments are on both synthesized and real-world datasets with three types of noise, one of which is the dominant noise - a new noise setting we introduce to simulate the high-noise-ratio scenarios where the noisy samples may dominate the class distribution. Results show that adaptation methods outperform the original ones, and rankings change among the methods proves that unsupervised methods have different "knowledge absorption" to the added supervision, , The degree of performance improvements varies for unsupervised LNL methods. These differences in "knowledge absorption" rates indicate that LNL+K is a new task worthy of the research community's attention. In summary, our contributions are: * We introduce a novel task, termed LNL+K: Learning with Noisy Label and noise source distribution Knowledge. We also design a new noise setting: dominant noise, where noisy samples are the majority of a labeled category distribution. * We define a unified framework for clean label detection in LNL+K, and explore three baseline methods for LNL+K by adapting LNL methods with noise source knowledge. * Our experiments report a 4.5% increase in accuracy with asymmetric noise on synthesized datasets using CIFAR-10/CIFAR-100 <cit.>, with up to a 15% gain on dominant noise. We also obtain a 1.5% accuracy gain on BBBC036 <cit.>, in a real-world noisy dataset for image-based cell profiling <cit.>. § RELATED WORK Hindering the memorization of noisy labels plays a vital role in LNL <cit.>. In order to achieve this objective, different approaches are pursued to detecting noisy labels and robust training. For clean and noisy sample detection, there are mainly loss-based <cit.> methods that detect noisy samples with high losses, and probability-distribution-based <cit.> approaches that select clean samples with high probability differences between the predicted classes, under the assumption that clean-label samples have high confidence in the prediction. However, these assumptions may not always hold true, especially with hard negative and hard positive samples. Samples selected by these approaches are more likely to be "easy" samples instead of "clean" samples. To retain those boundary samples, Self-Filtering (SFT) <cit.> observed that noisy samples more easily occur fluctuation, where a sample classified correctly before is misclassified in the later process. Feature-based approaches <cit.> have also been proposed that utilize the input before the softmax layer – high-dimensional features, which are less affected by noisy labels <cit.>. CRUST <cit.> uses the Jacobian spectrum of typical neural network gradient descent, which can be split into information space and nuisance space. Finding data points that span the information space can avoid gradient descent to overfit noisy labels. FINE <cit.> uses the eigenvector of the feature for each class to maximize the alignment values of clean data. For robust learning, there are methods adjusting the loss function <cit.>, using regularization techniques <cit.>, and multi-round learning only with selected clean samples <cit.>. LNL+K focuses on exploring noise source distribution knowledge used in the clean sample detection process. In summary, there are two assumptions underlying LNL methods: 1. Most samples in a class are clean. Even in high noise ratio settings, the noisy samples are from multiple classes, so the category with the most samples is the true label. 2. Noisy samples are very dissimilar to clean ones. Our work demonstrates that noise source distribution knowledge is the key to moving beyond these limtations. § LEARNING WITH NOISY LABELS + KNOWLEDGE (LNL+K) Learning with Noisy Label Source Knowledge (LNL+K) aims to find the optimal parameters set θ^* for the classifier f_θ, which is trained on the noisy dataset D with noise source knowledge D_ns and achieve high accuracy performance on the clean test dataset. In this section, we first introduce the notation we will use, then we will define a unified clean-sample-detection framework in Section <ref>. Suppose we have a dataset D = {(x_i, y_i)_i=1^n ∈ R^d × K}, where K = {1, 2, ..., k} is the categorical label for k classes. (x_i, y_i) denotes the i-th example in the dataset, such that x_i is a d-dimiensional input in R^d and y_i is the label. {y_i}_i=1^n might include noisy labels and we have no knowledge of the true labels {y_i}_i=1^n. However, we do have some prior knowledge about noisy label sources. The noisy source estimation can be obtained by analysis on a smaller clean subset D' ⊂ D, where ∀ (x_i, y_i) ∈ D', y_i = y_i. Therefore, the noise source distribution knowledge D_ns can be represented by a probability matrix P_k × k, where P_ij refers to the probability that a sample in class i is mislabeled as class j. The noise source knowledge can also be summarized with human visual understanding: , automobiles and trucks are visually similar classes and are more likely mislabeled with each other. In this case, the source knowledge can be represented by a set of label pairs LP = {(i, j) \| i, j ∈ K}, where (i, j) refers to the fact that samples in class i are more likely to be mislabeled as class j. For the convenience of formulating the following equations, D_c-ns represents the set of noise source labels of category c. , D_c-ns = {i \| i∈ K (P_ic>0 (i,c) ∈ LP)}. §.§ A Unified Framework for Clean Sample Detection with LNL+K. To make our framework general enough to represent different LNL methods, we define a unified logic of clean sample detection. In other words, this section provides a general overview of LNL+K methods and summarizes them using a unified set of abstract functions. Section <ref> delves into specific adaptation of LNL methods using our framework to use as our baselines. For LNL methods, sample x_i has a clean categorical label c, , y_i =c ↔ y_i = c p(c\|x_i) > δ, where p(c\|x_i) is the probability of sample x_i with label c and δ is the threshold for the decision. Different methods vary in how they obtain p(c\|x_i). For example, as mentioned in related work, loss-based detection uses Loss(f_θ(x_i), y_i) to estimate p(c\|x_i), probability-distribution-based methods use the logits or classification probability score f_θ(x_i), and feature-based method use p(c\|x_i)=M(x_i,ϕ_c), where M is a similarity metric and ϕ_c = D(g(X_c)) is the distribution of features labeled as category c, , X_c = {x_i \| y_i=c}, g(X_c) = {g(x_i, c) \| x_i ∈ X_c}∼ϕ_c, and g(·) is a feature mapping function. The feature-based methods often vary in how they implement their feature mapping g(·) function and similarity distance metric M. LNL+K adds knowledge D_ns by comparing p(c\|x_i) with p(c_n\|x_i), where c_n is the noise source label. When category c has multiple noise source labels, p(c\|x_i) should be greater than any of these. In other words, the probability of sample x_i has label c (,p(c\|x_i)), not only depends on its own value but is decided by the comparison to the noise source labels. For example, the red triangle x_i in Fig. <ref> has a high probability of belonging to the red class, , p(red\|x_i) > δ, then it is detected as a clean sample in LNL. However, compared to the probability of belonging to the noise source yellow class, p(yellow\|x_i) > p(red\|x_i), so the red triangle is detected as a noisy sample in LNL+K. To summarize, the propositional logic of LNL+K is: y_i =c ↔ y_i= c p(c\|x_i) > Max({p(c_n\|x_i) \| c_n ∈ D_c-ns}). § LNL+K BASELINE METHODS In this section, we present our baseline methods of adapting LNL methods to use noise source distribution knowledge. Our adaptations focus on methods that aim to detect clean samples. Once the samples are selected, the rest of the training remains the same as the original methods. This consists of a two-stage approach, where in the first warm-up stage the model trains with all the samples, and in the second stage, the model only trains using selected clean samples at each epoch. Fig. <ref> provides an illustration of the baseline methods we use. §.§ SFT^+k SFT <cit.> detects noisy samples according to predictions stored in a memory bank ℳ. ℳ contains the last T epochs' predictions of each sample. A sample x_i is detected as noisy if a fluctuation event occurs, , the sample classified correctly at the previous epoch t_1 is misclassified at t_2, where t_1 < t_2. The occurrence of the fluctuation event can be formulated as fluctuation(x_i, y_i)=1, otherwise fluctuation(x_i, y_i)=0 , fluctuation(x_i, y_i)=1 ↔∃ t_1, t_2 ∈{t-T, ⋯ ,T} t_1 < t_2 s.t. f_θ(x_i)^t_1 = y_i f_θ(x_i)^t_2≠ y_i, where f_θ(x_i)^t_1 represents the prediction of x_i at epoch t_1. SFT is a probability-distribution-based approach and can fit our probabilistic model as follows. The propositional logic of SFT is, p(c\|x_i)= {[ 1 y_i = c fluctuation(x_i, y_i) = 0; 0 otherwise. ]. , SFT^+k applies the noise source distribution knowledge to SFT by relaxing the constraints of fluctuation. The fluctuation events only occur when the previous correct prediction is misclassified as the noise source label. For example, in Fig. <ref>, the noisy red triangle was classified correctly as "red" at epoch t-1 but classified incorrectly as "yellow", which is the noise source class, at epoch t. Since a fluctuation event occurs, the red triangle is detected as noisy. Thus, we define SFT^+k fluctuation as, fluctuation(x_i, y_i, D_y_i-ns)=1 ↔∃ c_n ∈ D_y_i-ns, ∃ t_1, t_2 ∈{t-T, ⋯ ,T} t_1 < t_2, s.t. f_θ(x_i)^t_1 = y_i f_θ(x_i)^t_2 = c_n. Combining Eq. <ref>, Eq. <ref> and Eq. <ref>, SFT^+k detects x_i with clean label y_i=y_i=c with p(c\|x_i) as: y_i=c ↔ y_i = c p(c\|x_i) > Max({p(c_n\|x_i) \| c_n ∈ D_c-ns}) ↔ y_i = c p(c\|x_i) = 1 ↔ y_i = c fluctuation(x_i, y_i, D_y_i-ns) = 0. §.§ CRUST^+k The key idea of CRUST <cit.> is from the neural network Jacobian matrix containing all its first-order partial derivatives. It is proved in their work that the neural network has a low-rank Jacobian matrix for clean samples. In other words, data points with clean labels in the same class often have similar gradients clustered closely together. CRUST is a feature-based method and this approach can be summarized with settings in Section 3.1. The feature used for selection is the pairwise gradient distance within the class: g(X_c) = {d_x_ix_j(𝒲) \| x_i, x_j ∈ X_c}, where d_x_ix_j(𝒲) = ∇ L(𝒲, x_i) - ∇ L(𝒲, x_j) _2, 𝒲 is the network parameters and L(𝒲, x_i) = 1/2∑_x_i ∈ D (y_i - f_θ(𝒲, x_i))^2. CRUST needs an additional parameter β to control the size of the clean selection set X_c'. Given β, the sample x_i is selected as clean if X_c' = β (X_c' is the size of set X_c') and x_i ∈ X_c', where ∑ g(X_c') has the minimum value. , the selected clean subset X_c' has the most similar gradients clustered together. Thus, we can summarize the similarity metric M for p(c\|x_i) as: M(x_i, ϕ_c, β)=1 ↔∃ X_c'⊂ X_c X_c'= β, s.t. x_i ∈ X_c' (∀X_c”= β X_c”⊂ X_c, ∑ g(X_c') ≤∑ g(X_c”)), otherwise M(x_i, ϕ_c, β)=0. Thus, we can get the propositional logic of CRUST: y_i =c ↔ y_i = c p(c\|x_i) =1 ↔ M(x_i, ϕ_y_i, β)=1. To adapt CRUST to CRUST^+k with noise source distribution knowledge. from Eq.<ref>, we have y_i = c y_i≠ c ↔ p(c\|x_i) ≤ Max({p(c_n\|x_i) \| c_n ∈ D_c-ns}) ↔∃ c_n ∈ D_c-ns s.t. p(c_n\|x_i) ≥ p(c\|x_i) ↔∃ c_n ∈ D_c-ns s.t. p(c_n\|x_i) = 1. To get p(c_n\|x_i), we first mix x_i with all the samples in X_c_n, , X_c_n+ = {x_i}∪ X_c_n. Then apply CRUST on this mix set, , calculate the loss towards label c_n and select the clean subset X_c_n+'. if x_i ∈ X_c_n+', then p(c_n\|x_i) = 1. For example, in Fig. <ref>, to select clean-label samples in the red class, we first mix the red class with its noise source yellow class(If there are multiple noise source classes, we repeat this process for each class), then we calculate the gradients with all yellow labels. If the sample's true label is yellow, then the gradients should be similar to other yellow samples, which can be captured with CRUST on the entire mix set. The clean samples in red are those that don't belong to the yellow class CRUST cluster. Here is the formulation of CRUST^+k, we modify L(𝒲, x_i) to L(𝒲, x_i, c) = 1/2∑_x_i ∈ D (c - f_θ(𝒲, x_i))^2, where we calculate the loss to any certain categories, not limited to the loss towards the label. Similarly, we have d_x_ix_j(𝐖, c) = ∇ L(𝒲, x_i, c) - ∇ L(𝒲, x_j, c) _2, g(X_c_n+, c_n) = {d_x_ix_j(𝐖, c_n) \| x_i, x_j ∈ X_c_n+}. We use γ to represent the subset size of X_c+c_n, which is decided by β and noise source distribution. Finally, we get the similarity metric M(x_i, ϕ_c_n+, γ) as: M(x_i, ϕ_c_n+, γ) = 1 ↔∃ X_c_n+'⊂ X_c_n+X_c_n+'= γ, s.t. x_i ∈ X_c_n+' (∀X_c_n+”= γ X_c_n+”⊂ X_c_n+, ∑ g(X_c_n+', c_n) ≤∑ g(X_c_n+”, c_n)), otherwise M(x_i, ϕ_c_n+, γ)=0. Combining Eq.<ref>, Eq.<ref>, and Eq.<ref>, p(c\|x_i) of CRUST^+k method is: y_i = c ↔ y_i = c (∀ c_n ∈ D_c-ns, p(c_n\|x_i) < p(c\|x_i)) ↔ y_i = c (∀ c_n ∈ D_c-ns, p(c_n\|x_i) = 0) ↔ y_i = c (∀ c_n ∈ D_c-ns, M(x_i, ϕ_c_n+, γ) = 0). §.§ FINE^+k Filtering Noisy instances via their Eigenvectors(FINE) <cit.> selects clean samples with the feature-based method. Let f_θ^(x_i) be the feature extractor output and Σ_c be the gram matrix of all features labeled as category c. The alignment is defined as the cosine distance between feature f_θ^(x_i) and c, which is the eigenvector of the Σ_c and can be treated as the feature representation of category c. FINE fits a Gaussian Mixture Model (GMM) on the alignment distribution to divide samples to clean and noisy groups - the clean group has a larger mean value, which refers to a better alignment with the category feature representation. In summary, feature mapping function g(x_i, c) = <f_θ^(x_i), c>, and mixture of Gaussian distributions ϕ_c = 𝒩_clean + 𝒩_noisy = 𝒩(μ_g(X_c-clean), σ_g(X_c-clean)) + 𝒩(μ_g(X_c-noisy), σ_g(X_c-noisy)), where μ_g(X_c-clean) > μ_g(X_c-noisy). The similarity metric M(x_i, ϕ_c)= {[ 1 𝒩_clean(g(x_i,c)) > 𝒩_noisy(g(x_i,c)); 0 𝒩_clean(g(x_i,c)) ≤𝒩_noisy(g(x_i,c)). ]. Thus, we have y_i =c ↔ y_i = c p(c\|x_i)=1 ↔ M(x_i, ϕ_y_i)= 1. Next, we show our design of FINE^+k with noise source distribution knowledge. The key difference between FINE and FINE^+k is that we use the alignment score of the noise source class. For example, in Fig. <ref>, the FINE^+k score is the difference between the red class alignment score and the yellow class alignment score, then we fit GMM on this FINE^+k score. Noisy samples in the red class would have better alignment with the yellow class eigenvector, thus a lower mean in the FINE^+k score distribution. For a formal description of FINE^+k, We define g_k(x_i, c, c_n) = g(x_i, c) - g(x_i, c_n). Similar to FINE, FINE^+k fits a GMM on g_k(X_c, c, c_n), so we have g_k(X_c, c, c_n) ∼ϕ_k-{c+c_n} = 𝒩_close-c + 𝒩_close-c_n, where μ_close-c > μ_close-c_n. This can be interpreted in the following way: Samples aligning better with category c should have larger g(x_i, c) values and smaller g(x_i, c_n) values according to the assumption, thus the greater the g_k(x_i, c, c_n), the closer to category c, vice versa, the smaller the g_k(x_i, c, c_n), the closer to category c_n. Then we have M(x_i, ϕ_k-{c+c_n})= {[ 1 𝒩_close-c(g_k(x_i, c, c_n)) > 𝒩_close-c_n(g_k(x_i, c, c_n)); 0 𝒩_close-c(g_k(x_i, c, c_n)) ≤𝒩_close-c_n(g_k(x_i, c, c_n)). ]. By combining with Eq.<ref>, we have y_i =c ↔ y_i= c (∀ c_n ∈ D_c-ns, p(c\|x_i) > p(c_n\|x_i)) ↔ y_i= c (∀ c_n ∈ D_c-ns, M(x_i, ϕ_k-{c+c_n})= 1 ). § EXPERIMENTS §.§ Datasets and Experiential Settings CIFAR dataset with synthesized noise. CIFAR-10/CIFAR-100 <cit.> dataset contains 10/100 classes, with 5000/500 images per class for training and 1000/100 images per class for testing. We applied two synthesized noises with different noise ratios: Asymmetric Noise labels are generated by corrupting labels only to visually similar classes, , trucks → automobiles, cat → dog, horse → deer. Experiments are over five noise ratios from 10% to 90%. For example, in the 90% noise ratio setting, 90% images in trucks, cat, and horse classes are mislabeled as their visual-similar classes. * Dominant Noise is a novel setting that simulates high-noise ratios in real-world datasets. We label classes as either "dominant" or "recessive," where samples mislabeled as the "recessive" class are likely from the "dominant" class. In CIFAR-10/CIFAR-100 <cit.> dataset, we set half categories as different "recessive" classes and the other half categories are different "dominant" classes. Noisy labels are generated by labeling images in "dominant" as "recessive". In contrast to symmetric noise, where noisy samples are uniformly distributed across multiple classes, assuming the existence of "dominant" noise source class(es) is more plausible. In addition, the number of clean samples in a class with high symmetric noise is still significantly higher than the number of noisy samples from each class. For example, in the 50% symmetric noise ratio CIFAR-10 setting, where 50% of the noise is uniformly distributed across the other 9 classes, resulting in approximately 6% noise from each class, the number of clean samples in a class still surpasses the number of noisy samples by a factor of 10. While in dominant noise, 50% of the noise is only from the "dominant" class, thus, the class distribution is more likely to be skewed by the noisy labels. Note that this breaks the informative dataset assumption used by prior work <cit.>. Cell dataset BBBC036 with natural noise. Cell images for our experiments are from the Cell Painting <cit.> datasets, which represent large treatment screens of chemical and genetic perturbations. The BBBC036 dataset is high-throughput compound screens testing 1500 bioactive compounds (treatments). The dataset[Available at <https://bbbc.broadinstitute.org/image_sets>] was obtained by exposing U2OS cells (human bone osteosarcoma) to the treatments. Each treatment is tested in 5 replicates, using multi-well plates, and then imaged with the Cell Painting protocol <cit.>, which is based on six fluorescent markers captured in five channels. Our goal is to classify the effects of treatments with cell morphology features trained by the model. The challenge of this task is that cells have different degrees of reaction to the treatment, , some treatments are so weak that little difference can be recognized from control features. Thus, the noisy labels in this dataset are those cell images that look like controls (doing-nothing group) but are labeled as treatments. In fact, around 1300 of the 1500 treatments show high feature similarity with the control group. The true noise ratio is unknown and for those weak treatments, the majority of the cell images might all be noisy. We reconstruct the cell dataset with 15 weak treatments and 85 normal-reaction treatments and report results on this dataset. Baselines. In addition to the methods we adapt, we also compare to Co-teaching<cit.>, a loss-based sample selection method that trains a pair of networks, where each samples small-loss examples as useful training data for its peer network. For the synthesized data, we also show the results of the vanilla method and the oracle method. , Vanilla is training with all the samples (no clean sample selection), and Oracle is training with all the clean samples. Metrics. Each dataset splits into training, validation, and test set, where training and validation contain noisy labels and the test is clean. For low-noise-ratio(lower than 0.5) and real noise settings, the model with the highest validation accuracy is saved to report the top-1 test accuracy. For high-noise-ratio settings, the model of the last epoch is saved for testing. Reported results are averages three runs, due to space constraints, we provide error bars in the supplementary. §.§ Results Asymmetric noise Table <ref> summarizes the performances in asymmetric noise settings, which shows the advantage of LNL+K in visually similar noise cases. Our adaptation methods CRUST^+k, FINE^+k and SFT^+k consistently outperform the original methods in most noise settings. The advantages are particularly evident in high noise ratios where the LNL methods' noise ratio upper bound is exceeded and the majority of samples in the noisy class have noisy labels. In the context of a 90% noise ratio on the CIFAR-100 dataset, the original LNL methods CRUST and FINE fail to outperform Vanilla's performance. In contrast, our adaptation methods demonstrate comparable or even superior performance to the Oracle. Fig. <ref> shows the embedding visualization of the four methods in a 90% asymmetric noise setting over CIFAR-10. We observe that the mislabeled confusing pairs are clustered together in the original methods, while are better separated in the adaptation methods. Dominant noise Table <ref> summarizes the performances in dominant noise settings, which shows the advantage of LNL+K moves beyond the noise ratio upper bound limit. Note that in the setting of 80% noise ratio over CIFAR-10 dataset, most methods can not even beat Vanilla's performance, indicating that noisy samples strongly impact the class distribution, CRUST^+k and FINE^+k still perform better. Natural noise The results for the noise in the cell dataset are shown in Table <ref>. Our adaptation methods have different degrees of improvement. The presence of high feature similarity between certain treatments and the "control" group can lead to significantly high noise ratios, ultimately strongly influencing the class distribution. This classification task is extremely challenging in that CRUST^+k is the only method that outperforms vanilla with 1.5% in top-1 accuracy. §.§ Discussion: Knowledge Absorption and Future Directions From the results in Section <ref>, we notice that the accuracy improvements of the adaptation methods vary in different noise settings and methods. We define knowledge absorption of method Q at task T as KA(Q,T) = (A(Q^+k, T) - A(Q, T))/A(Q, T), where A(Q,T) is the accuracy of method Q at task T and A(Q^+k, T) is the accuracy for adaptation method with knowledge. Knowledge absorption varies for the same method at different noise settings. The key factors about the noise settings are noise ratio and the cleanness of the noise source. SFT^+k has higher KA with lower noise ratios in the synthesized noise settings. It is probably due to the fact that the frequency of "fluctuation" in SFT <cit.> is relevant to the noise ratio. It would be future work to analyze KA changes in different noise settings and what is the noise threshold for each adaptation method to achieve the maximum KA. Knowledge absorption varies for different methods at the same noise settings. Considering the unified framework of detecting clean labels in Section <ref>, p(c\|x_i) and p(c_n\|x_i) are important factors to KA. SFT<cit.>, CRUST<cit.>, and FINE<cit.> represent three different methods of estimating p(c\|x_i). The results conclude that noise source knowledge might be more helpful to the feature-based clean sample detection methods in high noise ratios. KA indicates how well an LNL method can transfer to the LNL+K task with noise distribution knowledge, exploring ways to enhance the transferability of LNL methods and optimizing the value of KA are important areas for further investigation. Limitations. Our assumption is that the knowledge of the noise source is available. Although one potentially find this automatically by using a confusion matrix, we leave exploring methods to automate this to future work. In addition, in our experiment settings, the "dominant" class is free of noise. Future work could also investigate the influence of the "dominant" class noise ratio to KA. § CONCLUSION This paper introduces a new task, LNL+K, which leverages noise source distribution knowledge when learning with noisy labels. This knowledge is not only beneficial to distinguish clean samples that are ambiguous or out-of-distribution but also necessary when the noise ratio is so high that the noisy samples dominate the class distribution. Instead of comparing the "similarity" of the samples within the same class to detect the clean ones, LNL+K utilizes the "dissimilarity" between the sample and the noise source for detection. We provide a unified framework of clean sample detection for LNL+K which we use to adapt state-of-the-art LNL methods, CRUST^+k, FINE^+k, and SFT^+k, to our task. To create a more realistic simulation of high-noise-ratio settings, we introduce a novel noise setting called "dominant noise." Results show LNL+K methods have 5% average accuracy gains over asymmetric noise and up to 15% accuracy gains in the dominant noise setting. Finally, we discuss "knowledge absorption", which notes the ranking of LNL methods to our task varies from their LNL performance, indicating that direct investigation of LNL+K is necessary. Broader Impacts. The improved results on the cell dataset implies our work opens the door to LNL in scientific settings. At the same time, our work will have a social impact on domain experts, who can avoid some labor-intensive jobs such as correcting labels of medical images. However, we are also aware that LNL can enable bad actors to train a high-performing model as well. unsrtnat § IMPLEMENTATION DETAILS §.§ Datasets §.§.§ CIFAR dataset with synthesized noise Asymmetric noise. Labels are corrupted to visually similar classes. Pair (C_1, C_2) represents the samples in class C_1 are possibly mislabeled as C_2. Noise ratios in the experiments are only the noise ratio in class C_1, not the overall noise ratio. Here are the class pairs of CIFAR-10 and CIFAR-100 for asymmetric noise. CIFAR-10 (trucks, automobiles), (cat, dog), (horse, deer). CIFAR-100 (beaver, otter), (aquarium fish, flatfish), (poppies, roses), (bottles, cans), (apples, pears), (chair, couch), (bee, beetle), (lion, tiger), (crab, spider), (rabbit, squirrel), (maple, oak), (bicycle, motorcycle). Dominant noise There are "recessive" and "dominant" classes in dominant noise. For CIFAR-10, category index of the last 5 are "recessive" classes and the first five are "dominant" classes. In other words, category index 6-10 samples might be mislabeled as label index 1-5. Different numbers of samples are mixed for different noise ratios so that the dataset is still balanced after mislabeling. Table <ref> shows the number of samples per category for each noise ratio. §.§.§ Cell dataset BBBC036 For our experiments we subsampled 100 treatments to evaluate natural noise. Table <ref> shows the treatment list. ("NA" refers to the control group, no treatment group.) §.§ Model We used a pre-trained ResNet34 <cit.> on CIFAR-10/CIFAR-100 datasets for most approaches, except for Co-teaching, which uses a pre-activation ResNet18 <cit.> following the author's implementation. For experiments on BBBC036 we used an Efficient B0 <cit.> for all methods. To support the 5 channel images, we replaced the first convolutional layer in the network to support the new image dimensions. §.§ Hyperparameters For a fair comparison, we use the same hyperparameter settings as in prior work <cit.> for CIFAR-10/CIFAR-100 datasets. Hyperparameters of the cell dataset BBBC036 were set via grid search using the validation set. All the experiments use the same batch size of 128. "fl-ratio" of CRUST and CRUST^+k, which controls the size of selected clean samples is set as the same as the noise ratio in synthesized noise and set as 0.6 in cell dataset BBBC036. All the other hyperparameters for each dataset are summarized in Table <ref>. § DETAILED RESULTS We report the standard deviation of the accuracy, clean sample selection ratio, and selected-clean-sample number in Table<ref>-Table<ref>. We notice that our adaptation methods not only have higher average accuracy but also have higher clean ratios with a significantly larger number of clean samples. § ANALYSIS OF KNOWLEDGE WITH NON-NOISE-SOURCE CLASSES Noise source distribution knowledge not only helps classify classes with corrupted labels but is also beneficial to non-noise-source classes. Consider a non-noise-source class sample on the decision boundary, without knowledge, this sample is likely detected as noise and removed from training. Fig. <ref> demonstrates this point. Asymmetric noise pairs are not included as confusing pairs in the figure, , this figure only shows the confusing pairs between classes and their non-noise-source classes. Even those class objects are not visually similar, similar backgrounds can also lead to confusion, see Fig. <ref> for examples. There are significantly large numbers of confusing pairs between "frog" and "bird" in the CRUST classifier compared with CRUST^+k. Furthermore, CRUST exhibits ambiguity between 'deer' and 'bird,' whereas such ambiguity is less prominent or observable in CRUST^+k. One explanation is that "bird" is not in the noise source of "deer", thus bird samples on the decision boundary will be selected as clean samples. Training with these clean hard negatives helps the model better classify the confusing samples.
http://arxiv.org/abs/2306.03543v1	20230606094456	How to Select Which Active Learning Strategy is Best Suited for Your Specific Problem and Budget	[ "Guy Hacohen", "Daphna Weinshall" ]	cs.LG	[ "cs.LG" ]	Exchange renormalized crystal field excitation in a quantum Ising magnet KTmSe_2 Jun Zhao July 31, 2023 ================================================================================ In Active Learning (AL), a learner actively chooses which unlabeled examples to query for labels from an oracle, under some budget constraints. Different AL query strategies are more suited to different problems and budgets. Therefore, in practice, knowing in advance which AL strategy is most suited for the problem at hand remains an open problem. To tackle this challenge, we propose a practical derivative-based method that dynamically identifies the best strategy for each budget. We provide theoretical analysis of a simplified case to motivate our approach and build intuition. We then introduce a method to dynamically select an AL strategy based on the specific problem and budget. Empirical results showcase the effectiveness of our approach across diverse budgets and computer vision tasks. § INTRODUCTION Active learning emerged as a powerful approach for promoting more efficient and effective learning outcomes. In the traditional supervised learning framework, active learning enables the learner to actively engage in the construction of the labeled training set by selecting a fixed-sized subset of unlabeled examples for labeling by an oracle, where the number of labels requested is referred to as the budget. Our study addresses the task of identifying in advance the most appropriate active learning strategy for a given problem and budget. The selection of an active learning strategy is contingent on both the learner's inductive biases and the nature of the problem at hand. But even when all this is fixed, recent research has shown that the most suited active learning strategy varies depending on the size of the budget. When the budget is large, methods based on uncertainty sampling are most effective. When the budget is small, methods based on typicality are most suitable (see Fig. <ref>). In practice, determining the appropriate active learning strategy based on the budget size is challenging, as a specific budget can be considered either small or large depending on the problem at hand. This challenge is addressed in this paper. Specifically, we start by analyzing a simplified theoretical framework (Section <ref>), for which we can explicitly select the appropriate AL strategy using a derivative-based test. Motivated by the analysis of this model, we propose (Section <ref>), which incorporates a similar derivative-based test to select between active learning strategies. aims to provide a versatile solution for any budget, by identifying the budget domain of the problem at hand and picking an appropriate AL method from the set of available methods. is validated through an extensive empirical study using several vision datasets (Section <ref>). Our results demonstrate that is effective in identifying the best active learning strategy for any budget, achieving superior performance across all budget ranges. Relation to prior work. Active learning has been an active area of research in recent years, as can be appreciated from the surveys described in <cit.>. The traditional approach to active learning, which is prevalent in deep learning and recent work, focuses on identifying data that will provide the greatest added value to the learner based on what it already knows. This is typically achieved through the use of uncertainty sampling <cit.>, diversity sampling <cit.>, or a combination of both <cit.>. However, in small-budget settings, where the learner has limited prior knowledge and effective training is not possible before the selection of queries, such active learning methods fail <cit.>. <cit.> have shown that in this domain, a qualitatively different family of active learning methods should be used. These methods are designed to be effective in this domain and tend to seek examples that can be easily learned rather than confusing examples <cit.>. With the emergence of this distinction between two separate families of methods to approach active learning, the question arises as to which approach should be preferred in a given context, and whether it is possible to identify in advance which approach would be most effective. To the best of our knowledge , which selects a suitable AL strategy while taking into account the budget and the problem at hand, is the first work that addresses this challenge. § THEORETICAL ANALYSIS The aim of this section is to derive a theoretical decision rule that can be translated into a practical algorithm, thus enabling practitioners to make data-driven decisions on how to allocate their budget in active learning scenarios. Given an AL scenario, this rule will select between a high-budget approach, a low-budget approach, or a blend of both. Building upon this foundation, in Section <ref>, we use this rule as the motivation for a practical method that selects between different active learning strategies. In order to develop a test that can decide between high and low-budget approaches for active learning, we seek a theoretically sound framework in which both approaches can be distinctly defined, and show how they can be beneficial for different budget ranges. To this end, we adopt the theoretical framework introduced by <cit.>. While this framework is rather simplistic, it allows for precise formulation of the distinctions between the high and low-budget approaches. This makes it possible to derive a precise decision rule for the theoretical case, giving some insights for the practical case later on. In Section <ref>, we establish the necessary notations and provide a brief summary of the theoretical framework used in the analysis, emphasizing the key assumptions and highlighting the results that are germane to our analysis. Next, in Section <ref> we establish a derivative-based test, which is a novel contribution of our work, and which can be translated into a practical decision rule on budget allocation in active learning scenarios. In Section <ref>, we utilize this test to derive an optimal active learning strategy for the theoretical framework. To conclude, in Section <ref> we present an empirical validation of these results, accompanied by visualizations for further clarification. §.§ Preliminaries Notations. We consider an active learning scenario where a learner, denoted by , is given access to a set of labeled examples , and a much larger pool of unlabeled examples . The learner's task is to select a fixed-size subset of the unlabeled examples, referred to as the active set and denoted by ⊆, and obtain their labels from an oracle. These labeled examples are then used for further training of the learner. The goal is to optimally choose the active set , such that the overall performance of learner trained on the combined labeled dataset =∪ is maximal. We refer to the total number of labeled examples as the budget, denoted by B=\|\|=\|∪\|. This concept of budget imposes a critical constraint on the active learning process, as the learner must make strategic selections within the limitations of the budget. Model definition and assumptions. We now summarize the abstract theoretical framework established by <cit.>, which is used in our analysis. While this framework contains simplistic assumptions, its insights are shown empirically to be beneficial in real settings. This framework considers two independent general learners _ and _, each trained on a different data distribution 𝒟_ and 𝒟_ respectively. Intuitively, one can think of 𝒟_ as a distribution that is easier to learn than 𝒟_, such that _ requires fewer examples than _ to achieve similar error. The number of training examples each learner sees may vary between the learners. To simplify the analysis, the framework assumes that data naturally arrives from a mixture distribution 𝒟, in which an example is sampled from 𝒟_ with probability p and from 𝒟_ with probability 1-p. We examine the mean generalization error of each learner denoted by E_,E_:→ [0,1] respectively, as a function of the number of training examples it sees. The framework makes several assumptions about the form of these error functions: [(i)] * Universality: Both E_ and E_ take on the same universal form E(x), up to some constant >0, where E(x) =E_(x)=E_( x). * Efficiency: E(x) is continuous and strictly monotonically decreasing, namely, on average each learner benefits from additional examples. * Realizability: lim_x →∞E(x) =0, namely, given enough examples, the learners can perfectly learn the data. To capture the inherent choice in active learning, a family of general learners is considered, each defined by a linear combination of _ and _. <cit.> showed that when fixing the number of examples available to the mixture model, i.e, fixing the budget B, it is preferable to sample the training data from a distribution that differs from 𝒟. Specifically, it is preferable to skew the distribution towards 𝒟_ when the budget is low and towards 𝒟_ when the budget is high. §.§ Derivative-based query selection decision rule Our formal analysis delves into the question of whether it is advantageous to skew the training distribution towards the low or high-budget distribution. The answer we obtain is a derivative-based test, for the settings above, which can be calculated in closed form in these settings. Importantly, our empirical results (Section <ref>) demonstrate the effectiveness of an approximation of this test in deep-learning scenarios, where the closed-form solution could not be calculated. To achieve this, we define two pure query selection strategies – one that only queries examples from 𝒟_, suitable for the low-budget regime, and the other queries examples only from 𝒟_, beneficial in the high-budget regime. Given a fixed budget B, we analyze the family of strategies obtained by a linear combination of these pure strategies, parameterized by q∈[0,1], in which qB points are sampled from 𝒟_ and (1-q)B points are sampled using 𝒟_. The mean generalization error of learner on the original distribution 𝒟, where is trained on B examples picked by a mixed strategy q is E_(B,q) = p· E(q B) + (1-p)· E((1-q) B). By differentiating this result (see derivation in <ref>), we can find an optimal strategy for this family, and denote it by q̂. This strategy is defined as the one that delivers the lowest generalization error when using a labeled set of size B. The strategy is defined by q̂∈ [0,1] that holds: E^'(q̂B)/E^'((1-q̂)B) = (1-p)/p. If Eq. (<ref>) has a unique and minimal solution for q̂, it defines an optimal mixed strategy q̂_E(B,p,) for a given set of problem parameters. As p and are fixed for any specific problem, we get that different budgets may require different optimal AL strategies. Notably, if budget B satisfies q̂_E(B,p,)=p, then the optimal strategy for it is equivalent[Identity (in probability) is achieved when B→∞.] to selection from the original distribution 𝒟. We refer to such budgets as B_eq. It is important to note that with these budgets, using no active learning strategy is optimal. While B_eq may not be unique, for the sake of simplicity, we assume that it is unique in our analysis, noting that the general case is similar but more cumbersome. We propose to use Eq. (<ref>) as a decision rule, to determine whether a low-budget or high-budget strategy is more suitable for the current budget B. Specifically, given budget B, we can compute q̂_E(B,p,) and B_eq in advance and determine which AL strategy to use by comparing B and B_eq. In the current framework, this rule is guaranteed to deliver an optimal linear combination of strategies, as we demonstrate in Section <ref>. Visualization of the model's error as a function of the budget, for different values of q, can be seen in Fig. <ref>. §.§ Best mixture of active learning strategies With the aim of active learning (AL) in mind, our objective is to strategically select the active set in order to maximize the performance of learner when trained on all available labels =∪. To simplify the analysis, we focus on the initial AL round, assuming that is sampled from the underlying data distribution 𝒟. The analysis of subsequent rounds can be done in a similar manner. To begin with, let us consider the entire available label set =∪. Since comprises examples from 𝒟, 𝒟_ and 𝒟_, we can represent it using the (non-unique) notation (r_rand,r_,r_), where r_rand,r_,r_ denote the fractions of sampled from each respective distribution. Based on the definitions of q and q̂, we can identify an optimal combination for , denoted ^: ^ = (1-r̂,r̂,0) q̂>p B<B_eq (1,0,0) q̂=p B=B_eq (1-r̂,0,r̂) q̂<p B>B_eq r̂ = 1/1-p(q̂-p) q̂>p 1/1-p (p-q̂) q̂<p Attainable optimal mixed strategy. It is important to note that =∪, where the active learning (AL) strategy can only influence the sampling distribution of . Consequently, not every combination of is attainable. In fact, the feasibility of the optimal combination relies on the size of the set . Specifically, utilizing (<ref>), we can identify two thresholds, B_low and B_high, such that if B<B_low≤ B_eq or B>B_high≥ B_eq, it is not possible to achieve the optimal ^=^ ∪. The derivation of both thresholds can be found in <ref>. With (<ref>) and the thresholds above, we may conclude that the optimal combination of ^* is: ^* = S(0,1,0) B<B_low S(1-r̂\|\|/\|\|,r̂\|\|/\|\|,0) B_low≤ B<B_eq S(1,0,0) B=B_eq S(1-r̂\|\|/\|\|,0,r̂\|\|/\|\|) B_high≥ B > B_eq S(0,0,1) B > B_high^* = S(0,1,0) B<B_low S(1,0,0) B=B_eq S(0,0,1) B>B_high In other words, we observe that the optimal strategy (<ref>) is only attainable in non-extreme scenarios. Specifically, in cases of very low budgets (B<B_low), it is optimal to sample the active set purely from 𝒟_ because more than \|\| points from 𝒟_ are needed to achieve optimal performance. Similarly, in situations of very high budgets (B>B_high), it is optimal to select the active set solely from 𝒟_ since more than \|\| points from 𝒟_ are necessary for optimal performance. Small active set . Upon examining the definitions of B_low and B_high (refer to <ref>), we observe that lim_\|\|→ 0 B_low = lim_\|\|→ 0 B_high = B_eq. Consequently, as indicated in (<ref>), the optimal mixed strategy, in this scenario, actually becomes a pure strategy. When the budget is low, the entire active set should be sampled from 𝒟_low. Similarly, when the budget is high, should be sampled solely from 𝒟_high. In the single point where B_low=B_high=B_eq, should be sampled from 𝒟. Fig. <ref> provides a visualization of these strategies as the size of decreases. However, what should be done if \|\| is not small enough to justify the use of strategy (<ref>)? Our proposed solution is to implement query selection incrementally. By repeatedly applying (<ref>) to smaller segments of length m, we can iteratively construct , with each iteration becoming more computationally feasible. This strategy not only enhances robustness but also yields comparable performance to the optimal strategy (<ref>), as demonstrated by the empirical results in Section <ref>. Based on the analysis presented above, it becomes apparent that in practical scenarios, the optimal combination of active learning strategies can be achieved by sequentially sampling from pure strategies, while utilizing a derivative-based test to determine the most effective strategy at each step. This concept forms the core motivation behind the development of the practical algorithm , which is detailed in Section <ref>. §.§ Validation and visualization of theoretical results Visualization. In Fig. <ref>, we illustrate the error of the strategies defined in (<ref>) using the same exponential example as depicted in Fig. <ref>. The orange curve represents a relatively large active set, where \|\| is equal to 30% of the budget B, while the blue curve represents a significantly smaller active set, where \|\| is equal to 1% of the budget B. It is evident that as the size of decreases, the discrepancy between the optimal strategy and the attainable strategy diminishes. Fig. <ref> showcases the optimal mixture coefficient q̂ as a function of the budget size B for various values of \|\|, namely 1%, 30%, and 100% of B. According to our analysis, as the size of \|\| decreases, the optimal q̂ exhibits a more pronounced step-like behavior. This observation suggests that in the majority of cases, it is possible to sample the entire active set from a single strategy rather than using a mixture of strategies. Validation. Our theoretical analysis uses a mixture model of idealized general learners. We now validate that similar phenomena occur in practice when training deep networks on different computer vision tasks. Since sampling from 𝒟_ and 𝒟_ is not feasible in this case, we instead choose low and high-budget deep AL strategies from the literature. Specifically, we choose TypiClust as the low-budget strategy and BADGE as the high-budget strategy, as explained in detail in Section <ref>. We note that other choices for the low and high-budget strategies yield similar qualitative results, as is evident from Tables <ref>-<ref>. Fig. <ref> shows results when training 20 ResNet-18 networks using mixed strategies S(1-r\|\|/\|\|,0,r\|\|/\|\|) and S(1-r\|\|/\|\|,r\|\|/\|\|,0) on CIFAR-10 and CIFAR-100. We compare the mean performance of each strategy to the performance of 20 ResNet-18 networks trained with the random query selection strategy S(1,0,0). Inspecting these results, we observe similar trends to those shown in the theoretical analysis. As the budget increases, the most beneficial value of mixture coefficient r decreases until a certain transition point (corresponding to B_eq). From this transition point onward, the bigger the budget is, the more beneficial it is to select additional examples from one of the high-budget strategies. As in the theoretical analysis, when the budget is low it is beneficial to use a pure low-budget strategy, and when the budget is high it is beneficial to use a pure high-budget strategy. The transition area, corresponding to segment B_low≤ B≤ B_high, is typically rather short (see Figs. <ref> and <ref>). § : AUTOMATICALLY SELECT ACTIVE LEARNING STRATEGY In this section, we present – a method for automatically selecting between different active learning strategies in advance, by estimating dynamically the budget size of the problem at hand. The budget size estimation builds on the insights gained from the theoretical analysis presented in section <ref>. The suggested approach approximates the derivative-based test suggested in (<ref>), resulting in a variation of the attainable optimal mixed strategy outlined in (<ref>). comprises two steps. The first step comprises a version of the derivative-based rule from Section <ref> to determine if the current budget B for the problem at hand is considered "high" (B≥ B_high) or "low" (B≤ B_low). This is done by creating small perturbations of according to some low and high-budget strategies, predicting if the current amount of labeled examples is sufficient to be considered as a high-budget for the problem at hand. In the second step, we select the most competitive AL strategy from the relevant domain and use it to select the active set . This approach not only ensures good performance within the specified budget constraints but also provides robustness across a wide range of budget scenarios. It is scalable in its ability to incorporate any future development in active learning methods. §.§ Deciding on the suitable budget regime In the first step, determines if the current labeled set is considered low (B≤ B_low) or high-budget (B≥ B_high) for the problem at hand, without querying additional labels from . To accomplish this, requires access to a set of active learning strategies for both low and high-budget scenarios. We denote such strategies by S'_low and S'_high, respectively. Additionally, a random selection strategy, denoted by S_rand, is also considered. To determine whether the current budget is high or low, utilizes a surrogate test. Instead of requiring additional labels, we compute the result of the test with a derivative-like approach. Specifically, for each respective strategy separately, we remove a small set of points (size ϵ>0) from , and compare the reduction in generalization error to the removal of ϵ randomly chosen points. The proposed surrogate test also presents a new challenge: in most active learning strategies, particularly those suitable for high budgets, the outcome relies on a learner that is trained on the labeled set and is thus exposed to the points that are to be removed. This results in a bias that underestimates the cost of removing known points, as demonstrated in our empirical study (see Fig. <ref>). To overcome this, we restrict the choice of active learning strategies S'_low and S'_high to methods that rely only on the unlabeled set . S'_low, and S'_high are TypiClust and inverse-TypiClust respectively. Each strategy defines a training subset as follows: data_low⊂ is obtained by removing the most typical examples in each class, and data_high⊂ is obtained by removing the least typical examples in each class. Our final method can be summarized as follows (see Alg. <ref>): We generate three subsets from the original labeled set : data_low, data_high and data_rand. Each subset is obtained by asking the corresponding strategy – S'_low, S'_high, and S_rand – to choose a class-balanced subset of ϵ examples from . Note that this is unlike their original use, as AL strategies are intended to select queries from the unlabeled set . Importantly, since set is labeled, we can guarantee that the selected subset is class-balanced. Afterward, the selected set is removed from , and a separate learner is trained on each of the 3 subsets (repeating the process multiple times for S_rand). Finally, we evaluate the accuracy of each method using cross-validation, employing 1% of the training data as a validation set in multiple repetitions. The subset with the lowest accuracy indicates that the subset lacks examples that are most critical for learning. This suggests that the corresponding strategy queries examples that have the highest impact on performance. 0.4 0.57 §.§ Selecting the active learning strategy In its second step, selects between two active learning strategies, S_low, and S_high, which are known to be beneficial in the low and high-budget regimes respectively. Unlike S'_low and S'_high, there are no restrictions on {S_low, S_high}, from which Alg. <ref> selects, and it is beneficial to select the SOTA active learning strategy for the chosen domain. Somewhat counter-intuitively, is likely to use different pairs of AL strategies, one pair to determine the budget regime, and possible a different one for the actual query selection. This is the case because in its first step, S'_low and S'_high are constrained to use only the unlabeled set , which may eliminate from consideration the most competitive strategies. In contrast, and in order to achieve the best results, S_low and S_high are chosen to be the most competitive AL strategy in each domain. This flexibility is permitted because both our theoretical analysis in Section <ref> and our empirical analysis in Section <ref> indicate that the transition points B_low and B_high are likely to be universal, or approximately so, across different strategies. This is especially important in the high-budget regime, where the most competitive strategies often rely on both and . § EMPIRICAL RESULTS We now describe the results of an extensive empirical evaluation of our method as detailed in Alg. <ref>. After the AL strategy is obtained, it is used to query , and the training of the deep model proceeds as is customary in deep supervised learning, using all the available labels in ∪. §.§ Methodology Our experimental framework is built on the codebase of <cit.>, which allows for fair and robust comparison of different active learning strategies. While the ResNet-18 architecture used in our experiments may not achieve state-of-the-art results on CIFAR and ImageNet, it provides a suitable platform to evaluate the effectiveness of active learning strategies in a competitive environment, where these strategies have been shown to be beneficial. In the following experiments, we trained ResNet-18 <cit.> on CIFAR-10, CIFAR-100 <cit.> and ImageNet-50 – a subset of ImageNet <cit.> containing 50 classes as done in <cit.>. We use the same hyper-parameters as in <cit.>, as detailed in <ref>. requires two types of active learning strategies: restricted strategies that use only the unlabeled set for training, and unrestricted competitive strategies that can use both and (see discussion above). Among the restricted strategies, we select TypiClust <cit.> to take the role of S'_low, and inverse TypiClust for S'_high. In the latter strategy, the most atypical examples are selected. Note that inverse TypiClust is an effective strategy for high budgets, while relying solely on the unlabeled set (see <ref> for details). Among the unrestricted strategies, we select ProbCover <cit.> for the role of the low-budget strategy S_low, and BADGE <cit.> for the high-budget strategy S_high. Other choices yield similar patterns of improvement, as can be verified from Tables <ref>-<ref>. In the experiments below, we use several active learning strategies, including Min margin, Max entropy, Least confidence, DBAL <cit.>, CoreSet <cit.>, BALD <cit.>, BADGE <cit.>, TypiClust <cit.> and ProbCover <cit.>. When available, we use for each strategy the code provided in <cit.>. For low-budget strategies, which are not implemented in <cit.>, we use the code from the repository of each paper. §.§ Evaluating the removal of examples with AL in isolation We isolate the strategy selection test in Alg. <ref> as described in Section <ref>. To generate the 3 subsets of labeled examples data_low, data_high and data_rand, we remove 5% of the labeled data, ensuring that we never remove less than one data point per class. In the low-budget regime, removing examples according to S'_low yields worse performance as compared to the removal of random examples, while better performance is seen in the high-budget regime. The opposite behavior is seen when removing examples according to S'_high. More specifically, we trained 10 ResNet-18 networks on each of the 3 subsets, for different choices of budget B. In Fig. <ref>, we plot the difference in the mean accuracy of networks trained on data_low and data_high, compared to networks trained on data_rand, similarly to the proposed test in Alg. <ref>. In all the budgets that are smaller than the orange dashed line, chooses S_low. In budgets between the orange and the green dashed lines, chooses S_rand. In budgets larger than the green dashed line, chooses S_high. §.§ : results In Fig. <ref>, we present the average accuracy results of a series of experiments involving 10 ResNet-18 networks trained over 10 consecutive AL rounds using three AL strategies: S_low (ProbCover), S_high (BADGE), and our proposed method . We compare the accuracy improvement of each strategy to training without any AL strategy. In each AL round, selects the appropriate AL strategy based on Alg. <ref>. Specifically, selects S_low when the budget is below the orange dashed line, S_random when the budget is between the orange and green dashed lines, and S_high when the budget is above the green dashed line. We observe that while S_low and S_high are effective only for specific budgets, performs well across all budgets. It is important to note that, unlike Fig. <ref>, where the data distribution of set is sampled from the original distribution 𝒟 because we analyze the first round (see Section <ref>), in the current experiments the distribution is unknown apriori – in each iteration is conditioned on the results of previous iterations, and is therefore effectively a combination of S_low, S_high, and S_random. Consequently, the transition point determined automatically by Alg. <ref> occurs earlier than the one detected in Fig. <ref>. In Tables <ref>-<ref>, we show the performance of in comparison with the performance of the baselines (Section <ref>). In all these experiments, is successful in its identification of a suitable budget regime. As a result, it works well both in the low and high-budget regimes, matching or surpassing both the low and high-budget strategies at all budgets. Note that as chooses an active learning strategy dynamically for each budget, any state-of-the-art improvements for either low or high budgets AL strategies can be readily incorporated into . 0.52 0.44 Why S'_low and S'_high are Restricted? As discussed in Section <ref>, we have made a conscious decision to exclude strategies that rely on the labeled set while deciding which family of strategies is more suited to the current budget. We now demonstrate what happens when the selection is not restricted in this manner, and in particular, if S'_high is chosen to be a competitive AL strategy that relies on the labeled set for its successful outcome. Specifically, we repeat the experiments whose results are reported in Fig. <ref>, but where strategy S'_high – the one used for the removal of examples – is BADGE. Results are shown in Fig. <ref>. Unlike Fig. <ref>, there is no transition point, as it is always beneficial to remove examples selected by BADGE rather than random examples. This may be because the added value of all points used for training diminishes after training is completed. § SUMMARY AND DISCUSSION We introduce , a novel method for selecting active learning strategies that perform well for all training budgets, low and high. We demonstrate the effectiveness of through a combination of theoretical analysis and empirical evaluation, showing that it achieves competitive results across a wide range of budgets and datasets. Our main contribution is the introduction of the first budget-aware active learning strategy. Until now, selecting the most appropriate active learning strategy given some data was left to the practitioner. Knowing which active learning strategy is best suited for the data can be calculated after all the data is labeled, but predicting this in advance is a difficult problem. offers a solution to this challenge, by determining in advance which active learning strategy should be used without using any labeled data. plain § SUPPLEMENTARY § DERIVATION OF TRANSITION POINTS Recall that the mean generalization error of mixed strategy q is: E_() = p· E(q B) + (1-p)· E((1-q) B). for the differentiable function E. The mixture coefficient q, which obtains the minimal generalization error, must satisfy 0 = ∂ E_()/∂ q = pB E'(q B) - (1-p) B E'((1-q) B) ⟹ E^'( qB)/E^'((1- q)B) = (1-p)/p The transition points can now be defined as follows: * B_eq is obtained by solving (<ref>) with q=p. * B_low is obtained by solving (<ref>) with q=p+\|\|(1-p)/B. * B_high is obtained by solving (<ref>) with q=p-\|\|(1-p)/B. § HYPER-PARAMETERS §.§ Supervised Training When training on CIFAR-10 and CIFAR-100, we used a ResNet-18 trained over 50 epochs. We used an SGD optimizer, with 0.9 Nesterov momentum, 0.0003 weight decay, cosine learning rate scheduling with a base learning rate of 0.025, and batch size of 100 examples. We used random croppings and horizontal flips for augmentations. An example use of these parameters can be found at <cit.>. When training ImageNet-50, we used the same hyper-parameters as CIFAR-10/100, only changing the base learning rate to 0.01 and the batch size to 50. §.§ Unsupervised Representation Learning CIFAR-10/100 We trained SimCLR using the code provided by <cit.> for CIFAR-10 and CIFAR-100. Specifically, we used ResNet18 with an MLP projection layer to a 128 vector, trained for 500 epochs. All the training hyper-parameters were identical to those used by SCAN. After training, we used the 512 dimensional penultimate layer as the representation space. As in SCAN, we used an SGD optimizer with 0.9 momentum and an initial learning rate of 0.4 with a cosine scheduler. The batch size was 512 and a weight decay of 0.0001. The augmentations were random resized crops, random horizontal flips, color jittering, and random grayscaling. We refer to <cit.> for additional details. We used the L2 normalized penultimate layer as embedding. ImageNet-50 We extracted embedding from the official (ViT-S/16) DINO weights pre-trained on ImageNet. We used the L2 normalized penultimate layer as embedding. § ADDITIONAL EXPERIMENTAL RESULTS §.§ High Budget Strategies In Section. <ref>, we are required to use a high budget strategy S'_high, which relies in its computation only on the unlabeled set . We use inverse-TypiClust, which is calculated similarly to TypiClust, only using the most atypical example at each iteration instead of the most typical example. In Fig. <ref>, we plot the performance of such a strategy on CIFAR-10, as a function of budget B, similarly to the analysis in Fig. <ref>. We see that while inverse-TypiClust is not a competitive high-budget strategy, it still outperforms random sampling in the high-budget regime, making it a suitable AL strategy for this regime. §.§ Other Feature Spaces §.§.§ Other Feature Spaces: Removing Data In section <ref>, we propose an active learning method that determines the budget size by removing examples in a given feature space. The feature space used in section <ref> was obtained by SimCLR, as these features proved beneficial to several low-budget active learning methods. In this section, we check the dependency of MiSAL on the specific choice of feature space. In Fig. <ref>, we plot the strategy selection test as described in Alg. <ref> in Section <ref>. The plotted results are trained on CIFAR-10. In order to generate the 3 subsets of labeled examples data_l, data_h and data_r, we remove 5% of the labeled data (but not less than 1 datapoint per class). This test is done using 3 different feature spaces * MoCo <cit.>, a transformer based approach. * SimCLR, as done in section <ref>. * SCAN <cit.>. Similarly to the results reported in section <ref>, we can see that using any of the 3 feature spaces resulted in a similar result – MiSAL would behave similarly regardless of the choice of the underlying feature space. §.§.§ Other Feature Spaces in TypiClust In Table <ref> and Table <ref>, we plot the results of different AL strategies across different datasets and budgets. Low-budget strategies such as TypiClust and ProbCover require the choice of feature space to work properly. Following the original papers, we used the feature space given by SimCLR trained on the entire unlabeled pool . To check whether the choice of the feature space affects the results of the low-budget performance, we trained TypiClust on the TinyImageNet with various choices of feature spaces. 0.48 0.48 In Fig. <ref>, we plot 5 active learning iterations with an active set of \|\|=1000 of ResNet-50 trained on TinyImageNet. We considered 5 different feature spaces: * MoCo <cit.>, a transformer based approach. * DINO <cit.>, an SSL-based approach. * SimCLR, which was used in the original TypiClust paper. * SWAV an SSL-based approach. * A simple autoencoder on the pixel values (AE). We found that except for the AE, all methods perform similarly, suggesting that the choice of the representation space has little effect on the training of low-budget methods such as TypiClust.
http://arxiv.org/abs/2306.01425v2	20230602103123	Active Noise Control in The New Century: The Role and Prospect of Signal Processing	[ "Dongyuan Shi", "Bhan Lam", "Woon-Seng Gan", "Jordan Cheer", "Stephen J. Elliott" ]	eess.AS	[ "eess.AS", "cs.SY", "eess.SP", "eess.SY" ]	< g r a p h i c s > .5cm 1620 Active Noise Control in The New Century: The Role and Prospect of Signal Processing 1cm Dongyuan Shi[[email protected]], Bhan Lam[[email protected]], Woon-Seng Gan[[email protected]] School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore 50 Nanyang Avenue, Singapore 639798 .5cm Jordan Cheer[[email protected]], Stephen J. Elliott[[email protected]] Institute of Sound and Vibration Research, University of Southampton, SO17 1BJ, United Kingdom ABSTRACT Since Paul Leug's 1933 patent application for a system for the active control of sound, the field of active noise control (ANC) has not flourished until the advent of digital signal processors forty years ago. Early theoretical advancements in digital signal processing and processors laid the groundwork for the phenomenal growth of the field, particularly over the past quarter-century. The widespread commercial success of ANC in aircraft cabins, automobile cabins, and headsets demonstrates the immeasurable public health and economic benefits of ANC. This article continues where Elliott and Nelson's 1993 Signal Processing Magazine article <cit.> and Elliott's 1997 50th anniversary commentary <cit.> on ANC left off, tracing the technical developments and applications in ANC spurred by the seminal texts of Nelson and Elliott (1991), Kuo and Morgan (1996), Hansen and Snyder (1996), and Elliott (2001) since the turn of the century. This article focuses on technical developments pertaining to real-world implementations, such as improving algorithmic convergence, reducing system latency, and extending control to non-stationary and/or broadband noise, as well as the commercial transition challenges from analog to digital ANC systems. Finally, open issues and the future of ANC in the era of artificial intelligence are discussed. § HISTORY OF ANC AND KEY ANC APPLICATIONS Leug's patent, “Process of dampening sound oscillations", granted in 1936, is often attributed to the dawn of active noise control (ANC) technology <cit.>. Leug accurately outlined the acoustic noise suppression potential of a well-known acoustical phenomenon: two sound waves with the same frequency and a specified phase difference, when superimposed, will produce destructive interference. Owing to the physical nature of the acoustical phenomena, the principles of ANC described by Leug still form the backbone of ANC technology today. Figure <ref> depicts Leug's now classical formulation of ANC in an air duct T, where the microphone/sensor M detects the noise S1 produced by the “primary" noise source A. The electronic circuit V processes the sampled noise signal (“reference" signal) and drives the “secondary" loudspeaker L to generate the “anti-noise" S2. This anti-noise wave S2 has the same amplitude as the noise S2, but is 180^o out-of-phase, which effectively suppresses the noise. In order to generate the anti-noise S1 in time to achieve attenuation, the acoustic delay from S1 to L must be precisely measured, and that M, V and L must also possess good amplitude and frequency fidelity. Unfortunately, these requirements, which appear simple today, were difficult to meet with the electronics available in the 1930s. Following this pause in advancement, the 1950s was landmarked by two seminal works <cit.>. Olson and May described an electronic sound absorber consisting of a chamber, a microphone, an amplifier, and a loudspeaker <cit.>. This is a “feedback" variant of Leug's system that reduces the sound pressure level (SPL) due to the noise being near zero to create a “quiet zone" around the microphone next to the secondary loudspeaker. Around the same time, Conover attempted to reduce the noise produced by a 15000 V transformer <cit.> with ANC through a proposed automated tuning process. A 10 dB reduction in SPL on the façade of the transformer was demonstrated but increased the SPL in other areas. Although he was forced to abandon this solution, it inspired others to implement his automatically tuned ANC with analog circuits. However, the inflexibility of analog circuits and the complexity of the debugging procedures drove the field back into obscurity. The resurgence of ANC was marked by the introduction of microelectronics and landmark algorithmic developments in the late 1970s to 1980s, which sought to overcome the limitations of analog circuitry through adaptive systems. The modern adaptive ANC technique is generally regarded to originate from the adaptive noise canceller proposed by Widrow in 1975 <cit.>. Meanwhile, Morgan and Burgess developed the filter-x least mean square (FxLMS) algorithm <cit.>, which accounts for the acoustic latency in the plant response between the secondary source(s) and the error sensor(s), thereby significantly resolving the convergence issues of the LMS-based algorithm used in ANC applications. Burgess was the first to apply this algorithm to ANC and conducted numerical simulations for noise cancellation in an air duct <cit.>. With the invention of the first digital signal processor (DSP) by Texas Instruments in 1978, and the analog-to-digital (ADC) and digital-to-analog (DAC) chips by Intel in 1979, the electronic circuit was transformed from analog to digital. This technological advancement paved the way for the implementation of the adaptive ANC system. For instance, in 1996, Kuo implemented the FxLMS algorithm for ANC on a DSP device that was deployed in a one-dimensional air duct <cit.>. It obtained approximately 30 dB of reduction for tonal noise and demonstrated the efficacy of the FxLMS algorithm. The system implementation procedure outlined in the seminal text by Kuo and Morgan <cit.> served as a useful starting point for subsequent ANC systems. However, commercial implementations of ANC in ventilation ducts and power transformers eventually faltered in the 1990s due to unsustainable costs in installation, maintenance, and robustness of ANC systems. Through the mid-1980s to the mid-1990s, ANC research continued to advanced significantly, with the most notable research spearheaded by the Institute of Sound and Vibration Research, University of Southampton in the United Kingdom (Nelson and Elliott, 1993). The research on controlling low-frequency blade-pass noise in aircraft fuselages was successfully demonstrated on the BAe HS 748 propeller aircraft with a 7–13 dB reduction in the noise at the frequencies corresponding to the fundamental and harmonics of the blade passing frequency throughout the cabin <cit.>. From this solid foundation, ANC soon found its way into numerous civil and military propeller aircraft <cit.>, most of which are still in service today (e.g. Dornier 328, ATR42/47, A400M, Q400, C-130 variants, and OV-10 Bronco), which inadvertently demonstrated the robustness and stability of ANC in harsh, real-world conditions, as well as the first volume production and implementation of ANC technology. Its success was also perhaps financially and judicially motivated, whereby ANC was necessary to attain safe listening levels without adding too much weight (fuel efficiency) to the aircraft. During a similar time period, reduction of noise in the automobile cabin using ANC was also investigated. In 1988, Elliott et al applied ANC technology to reduce engine noise <cit.> and this was subsequently extended to the more challenging road noise control control problem in 1994 <cit.>. Despite Nissan introducing an elegant ANC solution for decreasing vehicle rumble in its 1992 Bluebird in Japan <cit.>, the limited attenuation performance and requirement of a separate electronic system meant it did not make economic sense for widespread industry adoption. It was only almost 20 years since the Bluebird when ANC was fully-integrated into the automobile audio system that it found its way back into mass-market luxury vehicles to actively control engine noise in the entire cabin <cit.>. Despite the success of automobile ANC systems for engine noise, the challenge of controlling the broadband noise associated with road-tyre interactions, eluded its commercial viability for another 10 years. The first mass-produced road noise ANC system, spurred by demand arising from silent engines of electric vehicles, was introduced in 2018 by Hyundai Motors <cit.>. Throughout the evolution of ANC, active headsets are arguably the most commercially successful. Intriguingly, work on active headsets also begun in the 1950s with Fogel's patent. This was followed by a long period of inactivity until the introduction of the first commercial ANC headset by Bose in 1989, after 10 years of development. Simultaneously, Sennheiser created their first ANC headset for airline pilots in 1987, the LHM 45 NoiseGard, which demonstrated the viability of analog ANC technology. Throughout the 1990s to 2000s, all active noise-canceling headphones were controlled by analog circuits in a “feedback" configuration. Analog circuitry is generally regarded to be delayless, is inexpensive, and is simple to manufacture; but its poor accuracy and tunability have hindered its market acceptance. It was only in 2008 that SONY introduced the first digital active noise-cancelling headphone, the MDR-NC500D, which incorporated a digital equalizer to significantly enhance the sound quality of headphones. Since then, digital ANC technology has gradually replaced traditional analog ANC headphones due to its high accuracy, reliability, and configurability to accommodate complex signal processing algorithms. As exemplified by the gap in commercial activity in headsets and automobiles, the promise of the 1990s was met with numerous challenges, some of which still remain open problems. Signal processing plays an ever critical role in digital ANC systems of today, and when combined with the knowledge of physical acoustics, electronics, material and mechanical sciences, can help edge the ANC system towards its physical limits. Notably, the boom in academic ANC research has persisted since the 1990s, but it was only in the 2010s that we experienced an exponential commercial interest. The trends in publications and patent activity are based on keyword searches in Scopus and Google patents databases, respectively, as illustrated in Figure <ref>. § SCIENTIFIC CHALLENGES AND MILESTONES Digital electronic systems are gradually replacing traditional analog circuits because of the booming semiconductor industry, and particularly the invention of DSP processors and ADC/DAC converters <cit.>. Digital ANC systems have become commonplace in academia and industry owing to their high degree of tuneability and adaptability, and the relative ease of design. This advancement lays the groundwork for the implementation of more complex and efficient control algorithms for ANC systems, providing potential such as improved performance, lower cost, and a greater variety of applicability and functionality. The proposal and development of adaptive algorithms, such as the FxLMS algorithm, made it possible for ANC systems to handle time-varying systems and noise sources. However, there are still a number of scientific and practical obstacles that impede its development. In practice, the ANC system places a high processing demand on the real-time processor, which must complete the reference signal sampling, processing, and generation of the anti-noise rapidly so that the anti-noise can effectively interact with the acoustic noise to attenuate it. This requirement poses a causality constraint on practical ANC systems. The challenge associated with the causality constraint is exacerbated in portable ANC systems, such as ANC headphones. Their diminutive size reduces the acoustic delay between the reference microphone and the error microphone, thereby limiting the available processing time window. Due to limitations of cost, size, and power, it is difficult to install a powerful processor in ANC headphones. This is the primary reason why current commercial headphones typically filter with fixed coefficients during ANC, despite the fact that adaptive algorithms offer significantly superior noise reduction performance <cit.>. For the portable devices <cit.>, the integration of ANC with other audio and communication functions, such as transparent listening, occlusion removal, acoustic echo cancellation, and focused listening, among others, would open the door to a variety of intriguing applications in hearables. This integration brought up many interesting challenges, including how to automatically activate certain functions in response to environmental noise. Another challenge associated with ANC systems is that associated with nonlinearity <cit.>. Nonlinearities are common in practical ANC systems due to imperfections, such as limited power capabilities of transducers used for sensing and actuation, and both vibration and acoustic propagation paths. Such nonlinearities can lead to divergence in conventional adaptive algorithms <cit.>. Therefore, many nonlinear adaptive algorithms have been proposed to address this issue <cit.>, but due to their high computational complexity, they have usually prevented them from being used in practical scenarios. To reduce the computational load on the real-time processor, many computationally-efficient adaptive algorithms <cit.>, have been proposed for use in mid-size ANC systems, which are typically used to achieve global noise reduction throughout a space, such as a bedroom, an airplane cabin, or a car's interior. Even though some modified adaptive algorithms can achieve a balance between convergence and computation cost, their less-than-ideal response time to rapidly varying noise still diminishes their perceptual instantaneity of noise reduction. Perhaps the most technically challenging, but arguably the most societally impactful is to achieve a large quiet zone with multichannel ANC (MCANC) systems in a fully- or partially-open space. Multiple-input, multiple-output (MIMO) technology and the corresponding adaptive algorithms have been incorporated into MCANC systems. There are, however, significant differences between MCANC and standard MIMO systems, such as those used in wireless communication. Typically, the performance of the MCANC system is limited by the boundary conditions of the complex acoustic environment. Traditional MCANC algorithms are primarily concerned only with the time-domain signal acquired by the microphones but are not conditioned to consider the acoustic boundary conditions of the whole control region. This diminishes the global control efficacy of the MCANC system in a large control region, even potentially resulting in a “spillover", increasing the sound pressure outside the control region. Despite the fact that recent spatial ANC techniques transform the sound wave from the time-domain to the wave-domain <cit.>, thereby incorporating acoustic boundary information and providing more efficient control over the space, their high computational requirements limit their use in real-time applications. In addition, the positions of the microphones and secondary sources are crucial to MCANC system performance in realistic scenarios. The conventional trial-and-error method is ineffective when applied to large-scale ANC systems with multiple control units. Some solutions based on metaheuristic optimization procedures, such as the genetic algorithm (GA), still require a substantial amount of human intervention in the measurement of the sound field. It is worth noting that in traditional ANC research, humans are often disregarded in the design of the controller, which simply focuses on minimizing the mean square of the error signal(s), for example. Therefore, an increasing number of researchers are examining this topic and attempting to combine psycho-acoustic concepts with conventional active control methods, such as noise masking and soundscape techniques <cit.>. Nonetheless, these techniques are still in their infancy and have not been broadly validated and implemented. § IMPACTS IN THE SOCIETY With cities rapidly urbanizing, our living space is becoming increasingly congested with intricate transportation networks, constant construction activities, and busy industrial zones, all of which generate significant and unwanted noise. Following this, urban acoustic noise ceaselessly afflicts humans in their everyday lives and thus impacts the health of the population. Low-frequency noise can have a significant impact on public health since it is not easy to control using traditional passive noise control solutions. However, ANC is most effective at reducing low-frequency noise, and can thus have a significant impact on public health. ANC systems can be implemented within a small form factor, and are thus widely used in portable audio devices, such as headphones, which can be used in any environment and thus have a significant influence on reducing the impact of environmental noise on the population. ANC has also gradually become a technology of significant interest within industrial and commercial applications, thus generating both significant research challenges and a massive market requirement. The core component of ANC technology is the algorithms, which have been developed, and continue to evolve, through decades of academic research in the field of signal processing. Although there are several successful ANC solutions in the market, present ANC technology, which is based on conventional signal processing techniques, still faces numerous practical obstacles. To address these practical problems, there have been many novel algorithms and control strategies proposed recently and these contributions lie directly within the academic research fields linked to the SPS community and its publications, ANC is also an important field. Meanwhile, there are many novel algorithms and control strategies are proposed recently to address these practical problems. Furthermore, due to the intricacy in the application of ANC technologies, it has also become a focal point for interdisciplinary research and in recent years has brought signal processing research together with acoustics, vibration, control, psycho-acoustics, machine learning, human-machine interaction, sensing, actuation, and many more areas. § CURRENT PERSPECTIVES AND RECENT ADVANCEMENTS IN ANC With the rapid advancement of artificial intelligence and its proliferation throughout SPS domains, several researchers have attempted to use deep learning algorithms to realize ANC systems that overcome practical challenges or offer augmented capabilities. To increase the efficacy of noise reduction for dynamic noise and reduce the impacts of system nonlinearity, complex neural networks have been utilized to directly replace the control filter and process the reference signal <cit.>. However, the limited computing capability of real-time controllers confines such computationally intensive deep-learning techniques to simulations. The computational complexity issue can be circumvented by a novel method that employs a lightweight convolutional neural network (CNN) model to select a pre-trained control filter based on the noise type. As the CNN model runs asynchronously on a co-processor using block computation and the real-time controller only executes the normal filter, a significant overhead of real-time computations is effectively avoided. In addition, since there is no feedback process involved, this method also increases the system's stability <cit.>. Notably, current manufacturers incorporate a filter-selection mechanism into their ANC chips, paving the path for the deployment of the deep-learning-based SFANC approach <cit.>. Furthermore, the conventional adaptive algorithm's hyper-parameter selection, such as step size and initial filter settings, affects the ANC system's convergence and stability. Data-driven approaches, such as Meta-learning <cit.>, have also been employed to learn these parameters for a noise dataset automatically. This strategy is a good solution to the conventional approach to determining the hyper-parameters through trial and error-based tuning. Recent spatial ANC technology utilizes the spherical harmonic-based decomposition to move the sound signal from the time domain to the wave domain in order to improve the noise control zone in the free field <cit.>. Utilizing the spatial information of the sound field, it is possible to create a wide zone of noise reduction. Typically, this strategy is utilized when the confined zone has a consistent shape, such as a spherical or columnar region. An increasing number of researchers are attempting to broaden the application of this approach and to develop effective computing methods for its implementation. When attempting to control noise actively within a zone for a particular user, such as the driver in an automobile cabin, the size of the generated quiet zone decreases with increasing frequency. This effectively limits the upper frequency of control, particularly when the user moves. To overcome this problem, head-tracking technology, based on image processing, has recently been used along with remote sensing strategies <cit.> to move the position of the zone of quiet with the user and thus increase the control bandwidth <cit.>. This technology has been applied within the automotive environment <cit.>, but has many more potential applications. There have been several other unique ANC applications in recent years <cit.>, including the ANC window system, which employs secondary sources implanted in the window frame to reduce incoming noise while maintaining natural ventilation and light ingress <cit.>. ANC techniques have also been used in conjunction with sound barriers to improve traffic noise cancellation performance <cit.>. ANC systems have also been utilized to cancel the high sound levels of the machinery, including the diverse applications of construction machines <cit.>, home appliances <cit.>, and the fMRI scanner <cit.>, with the aim of creating a quiet working environment for the operator or user. Some other applications attempt to eliminate acoustic noise in confined spaces, with novel systems incorporating an ANC system into a pillow to reduce snoring sounds <cit.>. Without the physical restrictions of wires, wireless sensors are also used in the ANC system and placed closer to the noise sources in order to gather the reference or error signal with a higher signal-to-noise ratio <cit.>. Many distributed ANC strategies have been created that take advantage of the cutting-edge decentralized technique to assign the computations to each sub-computing node in order to build the large-scale ANC system while reducing the huge computational complexity <cit.>. § CONCLUSIONS The proposed feature paper aims to provide a systematic review of the evolution of ANC technology over the past quarter-century via the lens of signal processing. The application of signal processing research results to the ANC sector is demonstrated to the reader. This article summarizes the main application areas and academic research results of ANC technology till now. It outlines the technical bottlenecks and opportunities encountered and looks forward to its future developments. § ACKNOWLEDGEMENTS This research/work is supported by the Singapore Ministry of National Development and National Research Foundation under the Cities of Tomorrow R&D Program: COT-V4-2019-1. Any opinions, findings, and conclusions or recommendations expressed in this material are those of the author(s) and do not reflect the views of the Singapore Ministry of National Development and National Research Foundation, Prime Minister’s Office, Singapore. unsrt
http://arxiv.org/abs/2306.05096v2	20230608105715	Diagnosing quantum phase transition via holographic entanglement entropy at finite temperature	[ "Huajie Gong", "Guoyang Fu", "Peng Liu", "Chongye Chen", "Xiao-Mei Kuang", "Jian-Pin Wu" ]	hep-th	[ "hep-th", "gr-qc" ]	[email protected] [email protected] [email protected] [email protected] [email protected] [email protected], corresponding author ^1 Center for Gravitation and Cosmology, College of Physical Science and Technology, Yangzhou University, Yangzhou 225009, China ^2 Department of Physics and Siyuan Laboratory, Jinan University, Guangzhou 510632, P.R. China We investigate the behavior of the holographic entanglement entropy (HEE) in proximity to the quantum critical points (QCPs) of the metal-insulator transition (MIT) in the Einstein-Maxwell-dilaton-axions (EMDA) model. Due to the fact that the ground state entropy density of the EMDA model is vanishing for insulating phase, but non-vanishing for the metallic phase, we used to expect that it is the HEE itself that characterizes the QCPs. This expectation is validated for certain case, however, we make a noteworthy observation: for a specific scenario, it is not the HEE itself but rather the second-order derivative of HEE with respect to the lattice wave number that effectively characterizes the quantum phase transition (QPT). This distinction arises due to the influence of thermal effects. These findings present novel insights into the interplay between HEE and QPTs in the context of the MIT, and have significant implications for studying QPT at finite temperatures. Diagnosing quantum phase transition via holographic entanglement entropy at finite temperature Jian-Pin Wu^1 July 31, 2023 ============================================================================================== § INTRODUCTION Quantum phase transition (QPT) usually involves strongly correlated electron system which is difficult to quantify <cit.>. As a non-perturbative method, holography builds a bridge between the strongly correlated system and the weakly coupled classical gravitational theory in the large N limit <cit.>, which is usually solvable. We can construct a gravitational dual model by holography to attack these strongly correlated problems and adress the associated mechanisms of QPT. As a prominent example of QPT, the metal-insulator transition (MIT) has been implemented in holographic framework <cit.> and the associated mechanism has also been addressed that the holographic MIT essentially can be depicted by geometry <cit.>. Usually, there are two ways implementing holographic MIT <cit.>. One is the infrared (IR) instability induced by the lattice operator, the other is the strength of lattice deformation that induces some kind of bifurcating solution. On the other hand, quantum entanglement has been playing an increasingly prominent role in the fields of condensed matter theory, quantum information, black hole physics, and so on. A good measure of quantum entanglement is the entanglement entropy (EE). The counterpart of EE in holography, dubbed as holographic entanglement entropy (HEE), has a simple geometric description that EE for a subregion on the dual boundary is proportional to the area of the minimal surface in the bulk geometry <cit.>. It has been shown that HEE can diagnose QPTs and thermodynamic phase transitions <cit.>. Particularly, it has been found that the HEE itself, or its derivatives with respect to system parameters exhibits extremal behavior near quantum critical points (QCPs) <cit.>. In this paper, we intend to further understand the relation between the EE and QPT. In <cit.>, the authors proposed a special Einstein-Maxwell-dilaton-axions (EMDA) model, for which the spatial linear dependent axion fields couple with a dilaton field. What is vitally important is that the IR geometries of this EMDA model can be analytically expressed such that at zero temperature limit, the scaling behavior of the direct current (DC) resistivity and the low-frequency alternating current (AC) conductivity can be worked out <cit.>. This model exhibits rich and meaningful phase structures which is addressed in <cit.>. Particularly, a novel holographic quantum phase transition from a normal metallic phase with AdS_2×ℝ_2 IR geometry to a novel metallic one with non-AdS_2×ℝ_2 IR geometry was found in <cit.>. The features of their low-frequency AC conductivity indicate that the normal metallic phase behaves as a coherent system while the novel metallic phase exhibits incoherent behavior <cit.>. Further, it is also found that the butterfly velocity or its first derivative exhibiting local extreme depends on the QPT mechanism <cit.>. In addition, the scaling behaviors of the butterfly velocity in the zero-temperature limit confirm that different phases are controlled by different IR geometries <cit.>. Therefore, it is exciting that this EMDA model is able to address so many important issues in the holography community and it is also expected to provide a good platform to attack the aforementioned problem, i.e., the relation between the EE and QPT. In principle, we should carry out our study at very low temperature as addressed in previous works <cit.>, however, it is extremely difficult to study QPTs within the low-temperature regime of the EMDA model due to the numerical challenges. Thus, here we focus on examining the MIT at finite temperatures, which is of particular importance for practical applications since all real-world systems operate at non-zero temperatures. The organization of the paper is as follows: Section <ref> provides a concise introduction to the special EMDA model, highlighting its key features and presenting the corresponding phase diagrams. In Sec.<ref>, we work out HEE and study the relation between HEE and QPT. Finally, Section <ref> contains the conclusions and discussions. § HOLOGRAPHIC BACKGROUND AND PHASE STRUCTURE The EMDA theory we consider takes the action <cit.> S= ∫ d^4x √(-g)[ R +6 coshψ - 3/2 [ (∂ψ)^2+4sinh^2ψ (∂χ)^2 ] - 1/4cosh^γ /3(3ψ)F^2 ] , where F is the Maxwell field defined by F=dA, χ is the axion field, and ψ is the dilaton field coupled with F and χ. γ is the coupling parameter, depending on which, the system exhibits rich phase structures as illustrated in Refs.<cit.>. We assume the following background ansatz: ds^2 =1/z^2[-(1-z)p(z)U(z)dt^2+dz^2/(1-z)p(z)U(z)+V_1(z) dx^2+V_2(z) dy^2], A =μ(1-z)a(z) dt, ψ =z^3-ϕ(z), χ =k̂ x, where p(z)=1+z+z^2-μ^2 z^3/4. is the conformal dimension of the dilaton field ψ. In the theory (<ref>), it is easy to conclude that =2. As Ref.<cit.>, here we focus on the anisotropic background that the axion field χ only depends on the x-direction of the dual boundary field theory, for which k̂ characterizes the lattice wave number. In our convention, z=1 and z=0 denotes the locations of the black hole horizon and AdS boundary, respectively. The system (<ref>) with the ansatz (<ref>) can be depicted by four second order ordinary differential equations (ODEs) for V_1 , V_2 , a , ϕ and one first order ODE for U. To preserve the asymptotic AdS_4 on the conformal boundary (z=0), we need impose the following boundary conditions: U(0)=1 , V_1(0)=1 , V_2(0)=1 , a(0)=1 , ϕ(0)=λ̂ , where λ̂ is the source of the dilaton field operator in the dual boundary field theory and depicts the strength of lattice deformation. Then, we impose the regular boundary conditions at the horizon (z=1). Further, we have the Hawking temperature: T̂=12-μ^2/16 π , where we have set the boundary condition as U(1)=1. We focus on the canonical ensemble and set the chemical potential μ as the scaling unit. Thus, for given parameter γ, this system is completely described by the three dimensionless parameters {T , λ , k }≡{T̂/μ , λ̂/μ , k̂/μ}. When χ=ψ=0, the background solution (<ref>) reduces to the RN-AdS black hole, whose IR geometry is AdS_2×ℝ_2. By studying the perturbations about this IR fixed point, we can obtain the scaling dimension of the dilaton field operator as δ_+^ψ=-1/2+1/6√(24 e^-2 v_10 k^2-3(12γ+1)) , where v_10 can be determined by the IR datas <cit.>. When the scaling dimension satisfies δ_+^ψ≥ 0, which gives 2e^-2 v_10k^2≥ 1+3γ , the IR solution is always RG stable. In addition, it is found that when the lattice wave number k vanishes, i.e., k=0, the scaling dimension δ_+^ψ is minimized. Based on the above observation, this system can be classified into the following three cases in terms of the parameter γ <cit.>: * Case I: -1<γ≤ -1/3 In this case, the relation δ_+^ψ>0 always holds at k≠ 0, which suggests an irrelevant deformation in IR. That is to say, the IR geometry is RG stable. * Case II: -1/3<γ≤ -1/12 When γ in the region of -1/3<γ≤ -1/12, δ_+^ψ<0 at k=0, which indicates the IR solution to be RG unstable. Further, if the lattice wave number is turned on, i.e., k≠ 0, the IR solution can be also RG unstable when the relation (<ref>) is violated as the case of k=0. Therefore, when reducing k or increasing λ, one has a RG unstable IR solution, which drives a MIT <cit.>. * Case III: γ>-1/12 When γ>-1/12, δ_+^ψ becomes complex at k=0. It means that the BF bound is violated resulting in a dynamical instability, which induces a novel black hole with scalar hair. Depending on the parameter γ, this novel black hole has different ground state at zero temperature that it is insulating for -1/12<γ<3, and metallic for γ>3, which can be determined by the DC and AC conductivities over the IR fixed point <cit.>. Then, in terms of the temperature behavior of DC conductivity at extremely low temperature, we can numerically work out the phase diagram over λ and k (Fig.<ref>). Though the IR geometry is RG stable for case I, we still observe a MIT emerging (the upper left in Fig.<ref>). It can be attributed to the existence of bifurcating solutions as argued in <cit.>. We would like to point out that thanks to the AdS_2×ℝ_2 IR geometry at zero temperature, when the strength of the lattice λ is small, the phase is metallic even for small k. Different from the case I, the MIT always exists for any λ in case II (the upper right plot in Fig.<ref>). It is because there is a transition from the AdS_2×ℝ_2 IR fixed point to a non-AdS_2×ℝ_2 IR fixed point when enhancing λ or reducing k, which induces a RG relevant lattice deformation. This mechanism is just the one of the original Q-lattice models studied in <cit.>. While for case III, since the system has different ground states depending on the parameter γ, it exhibits completely different phase structures (see the bottom plots in Fig.<ref>). For γ=1/2, the system exhibits an insulating ground state, and correspondingly there is a MIT when reducing k. The phase diagram is very similar to that of case II (the bottom left in Fig.<ref>). For γ=9/2, the system has a metallic ground state. The IR fixed point of this metallic phase is a non-AdS_2×ℝ_2 geometry, and thus we call it as novel metallic phase. Phase transition happens from the novel metallic phase to the normal metallic phase with AdS_2×ℝ_2 geometry when we increases k at fixed λ to exceed some critical values (see the right plot in Fig.<ref>). For more detailed discussions on the phase structures, please refer to <cit.>. § HOLOGRAPHIC ENTANGLEMENT ENTROPY NEAR QCP The HEE can be computed using the so-called Ryu-Takayanagi (RT) formula <cit.>[The RT formula is reformulated as the Hubeny-Rangamani-Takayanagi (HRT) formula for covariant cases <cit.>.]: S_A=Area(γ_A)/4G_N , where G_N is the bulk Newton constant and γ_A is the minimal surface extending from the boundary subregion A into the bulk. Without loss of generality, we investigate simply an infinite strip subsystem in the dual boundary, which can be formally characterized as A:={0 < x < l, -∞ < y < ∞}. We may explicitly write out the HEE and the associated width of the strip for the EMD-axions model investigated here: Ŝ= 2∫_0^z_[ z_^2√(V1(z))V2(z)/z^2 √(G(z))√(z_^4 V1(z) V2(z) - z^4 V1(z_) V2(z_))-1/z^2 ]dz-2/z_ , l̂= 2∫_0^z_[ z^2 √(V1(z_)V2(z_))/√(G(z) V1(z))√(z_^4 V1(z) V2(z) - z^4 V1(z_) V2(z_))]dz , where G(z)=(1-z)p(z)U(z). Here, a counterterm -1/z^2 has been inserted to cancel out the vacuum contribution. z_* indicates turning point of the minimal surface along z-direction. In what follows, we will primarily focus on the scaling-invariant HEE and width, denoted by S≡Ŝ/μ and l≡l̂μ, respectively. In this section, we will study the characteristics of HEE near QCP over this EMDA model. We firstly explore the behavior of HEE for case I. We would like to emphasize that the MIT in this scenario cannot be induced by the IR geometry instability because the IR geometry is RG stable <cit.>. A possible mechanism is that the MIT is driven by the strength of the lattice deformation, which results in the bifurcating solutions <cit.>. Without loss of generality, we choose γ=-2/3 and an extreme low temperature T=10^-6. Fig.<ref> illustrates the HEE itself and its first-order derivative with respect to k, i.e., ∂_k S_HEE as a function of k. In this scenario, neither the HEE nor its first-order derivative displays extremal or singular behavior near QCP. In contrast, HEE goes up and its first-order derivative goes down monotonically with k, even when the system changes from the insulating to metallic phase. We observe, however, that when transitioning from insulating to metallic phase, ∂_k S_HEE exhibits a significant reduction of orders of magnitude (right plot in Fig.<ref>). Based on this observation, it is expected that the QCP can be captured by the local extreme of the second-order derivative of HEE, i.e., ∂^2_k S_HEE. So, we further show ∂^2_k S_HEE as a function of k in Fig.<ref>. The left plot of this figure reveals that the local minimum of ∂^2_k S_HEE is located relatively close to the QCP, validating our inference. Also, we use the symbol Δ k to represent the difference between the location of the QCP and the local minimum of ∂^2_k S_HEE, as illustrated in the inset of the left plot in Fig.<ref>. We find that Δ k goes down monotonically as temperature drops. It indicates that in this case the QPT may be captured by the local extreme of ∂^2_k S_HEE in the limit of zero temperature. Additionally, we also show ∂^2_k S_HEE as a function of k for various l at T=10^-3. Notice that at low temperature and large l, the numerical calculation becomes more difficult and time consuming. As a result, we fix T=10^-3 in the right plot of Fig.<ref>. Nevertheless, we still observe that when l increases, the local minimum of ∂^2_k S_HEE approaches the QCP. It implies that in both limits of large l and zero temperature, the diagnosis of QCP using the local minimum of ∂^2_k S_HEE becomes evident. For Case II, MIT happens due to the IR geometry instability. This mechanism is identical to that of the standard Q-lattice model investigated in <cit.>. Left plot in Fig.<ref> shows S_HEE as a function of k at extremal low temperature T=10^-6. Here we have fixed γ=-1/6 and l=20. We observe that HEE itself displays a local maximum, which is different from case I. Similarly to Case I, we use Δ k to show the difference between the position of QCP and local maximum of S_HEE, as seen in the inset of the left plot of Fig.<ref>. We discover that Δ k falls monotonically as the temperature drops. Therefore, we conclude that in case II, the HEE itself is capable of diagnosing the QPT at the limit of zero temperature. This conclusion is compatible with the standard Q-lattice model <cit.>. We also show how S_HEE changes as a function of k for different l at T=10^-3 in the right plot of Fig.<ref>. We observe that as l goes up, the local maximum of S_HEE gets closer and closer to the QCP. It means that in both limits of large l and zero temperature, the diagnosis of QCP using the local maximum of S_HEE becomes evident. Now we come to case III, where MIT happens because a novel black hole with scalar hair develops when we change λ or k. This novel black hole exhibits different ground states at zero temperature depending on the parameter γ. Fig.<ref> shows the HEE behaviors at γ=1/2 and γ=9/2, where the ground state is insulating and metallic, respectively. We find that the HEE almost exhibits the same behaviors as case II. That is to say, the HEE itself is capable of diagnosing the QPT at the limit of zero temperature. § CONCLUSION AND DISCUSSION This paper builds upon previous investigations into the relationship between HEE and QPT. In our series of studies, we have made several key observations: * In <cit.>, we study the HEE behavior of holographic Q-lattice model. The ground state entropy density of this model vanishes in the insulating phase, while is non-vanishing in the metallic phase, reflecting an AdS_2 ×ℝ^2 near horizon geometry. Our findings reveal that the HEE exhibits local extremes in the vicinity of the QCPs of the MIT at extremely low temperatures. * In Gubser-Rocha model with Q-lattices <cit.>, both the metallic and insulating phases have a vanishing ground state entropy density. Consequently, diagnosing the QCPs solely using the HEE itself becomes challenging in this scenario. However, our findings reveal that it is the first-order derivative of the HEE with respect to the system parameter that effectively diagnoses the QCPs in the MIT. Our study provides compelling evidence that HEE can still effectively detect QPT in these circumstances, suggesting its potential for broader and more realistic applications in quantum many-body systems. * In our study, presented in <cit.>, we further examine a holographic axion model incorporating a non-minimal coupling between the matter field and the gravity theory. We discover that this model also displays a MIT. For both the metallic and insulating phases of this model, the IR geometry manifests as AdS_2, resulting in an identical non-vanishing ground state entropy density. We found that in this model, the second order derivative of HEE with respect to the axionic charge can effectively characterize the QPT. It is because the non-minimal coupling between the matter field and the gravity theory can modify the prescription of HEE, meaning that the matter field can influence HEE, thereby reflecting the QCPs, despite the geometry itself being no difference from AdS_2 ×ℝ^2. In comparison to our previous work, the ground state entropy density of the EMDA model is vanishing for insulating phase, but non-vanishing for the metallic phase in our current work, which is similar to that of holographic Q-lattice model <cit.>. It is expected that HEE itself can diagnose the QCPs, similar to the finding in <cit.>. In cases II and III, we have confirmed that HEE characterizes the QCPs, as expected. However, for case I, it is the second order derivative of HEE with respect to the lattice wave number that characterizes the QPT, but not the HEE itself. This distinction can be attributed to the influence of thermal effects. In case I, at low temperatures, finding the solutions of the minimum surfaces and their resultant HEE becomes numerically challenging, so our study was limited to higher temperatures. At these higher temperature, the signatures of the QCPs are potentially buried by thermal effects, making it difficult to diagnose them. Nonetheless, we show that even at finite temperatures, HEE can still reflect the QCPs, albeit through their second order derivatives, rather than HEE itself. This finding is of particular significance as it pertains to real-world systems, which are inherently finite temperature. By leveraging this approach, we can gain deeper insight into the underlying physics govering the QPT in quantum many-body system. Our investigation of the EMDA model has yielded valuable insights into the connection between HEE and the MIT at finite temperatures, and has opened up several exciting future avenues for research. One such direction would be to assess other QPT models at relatively higher temperatures and examine whether taking higher derivatives of HEE could expose the QCPs even further. This potentially opens up an new area of research into QPTs at finite temperatures. Moreover, this work provides a useful tool to identify QCPs in cases where locating them is a challenge. Analysis of second-order or even higher order derivatives can provide a signal to detect phase transitions at numerically accessible regions, making it easier to locate the critical points before digging deeper into the more time-consuming low-temperature details. This approach offers the potential to extend our understanding of phase transitions across more general models, opening up new avenues of QPT research in the holographic framework and even in the quantum many-body system. It is intriguing to delve deeper into the behaviors of various information measures, such as holographic mutual information, the holographic entanglement of purification, and the c-function, in the vicinity of holographic QCPs. One notable example is the holographic mutual information and the holographic entanglement of purification, which have been shown to be effective probes for studying thermal phase transitions <cit.>. In addition, the study in <cit.> has revealed that the c-function can serve as a novel and accurate probe for detecting the location of topological QCPs. This work is partly supported by the Natural Science Foundation of China under Grant No. 11905083, the Science and Technology Planning Project of Guangzhou (202201010655), Natural Science Foundation of Jiangsu Province under Grant No.BK20211601, Fok Ying Tung Education Foundation under Grant No.171006, and the Postgraduate Research & Practice Innovation Program of Jiangsu Province under Grant No.KYCX22_3451. Peng Liu would like to thank Yun-Ha Zha for her kind encouragement during this work. style1
http://arxiv.org/abs/2306.06183v1	20230609181957	Quantum Hall Effect in a Weyl-Hubbard Model: Interplay between Topology and Correlation	[ "Snehasish Nandy", "Christopher Lane", "Jian-Xin Zhu" ]	cond-mat.str-el	[ "cond-mat.str-el", "cond-mat.mes-hall" ]	([email protected] Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545, USACenter for Nonlinear Studies, Los Alamos National Laboratory, Los Alamos, NM, 87545, USATheoretical Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545, [email protected] Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545, USACenter for Integrated Nanotechnologies, Los Alamos National Laboratory, Los Alamos, New Mexico 87545, USA The interplay between topology and electronic correlation effects offers a rich avenue for discovering emergent quantum phenomena in condensed matter systems. In this work, starting from the Weyl-Hubbard model, we investigate the quantum Hall effect to explore the consequence of onsite Hubbard repulsion on nontrivial Weyl band topology in the presence of an external magnetic field. Within the Gutzwiller projected wavefunction method, we find the system to undergo multiple topological phase transitions, including two distinct Weyl phases with a different number of Weyl node pairs and a trivial narrow band insulator, by tuning on-site Coulomb interaction. Interestingly, these two Weyl phases can be identified by the sign of their chiral Landau levels. The possible experimental signature of these topological phases and correlation effects is provided by the magnetic-field dependent quantum Hall conductivity within the Kubo response theory. Quantum Hall Effect in a Weyl-Hubbard Model: Interplay between Topology and Correlation Jian-Xin Zhu July 31, 2023 ======================================================================================= § INTRODUCTION The three-dimensional (3D) Weyl semimetal (WSM) has been of great interest in the condensed-matter community over the last decade due to its unique non-trivial band topology. WSMs, which emerge from breaking either spatial inversion (IS) or time-reversal (TR) symmetries or both simultaneously, are characterized by hosting Weyl nodes in the bulk generated by momentum space touching of nondegenerate valence and conduction bands at isolated points <cit.>. The topological properties of WSMs are manifested in the fact that these Weyl nodes act as the source and sink of Abelian Berry curvature, and are protected by a nontrivial integral Chern number C=± 1, which is related to the strength of the magnetic monopole enclosed by the Fermi surface <cit.>. As a consequence, the WSMs host topologically protected surface states, so called Fermi arcs, and they connect the Weyl nodes with opposite monopole charges. According to the “no-go" theorem, the Weyl nodes in WSM come in pairs of positive and negative monopole charges (also called chirality) and the net monopole charge summed over all the Weyl nodes in the Brillouin zone vanishes <cit.>. After the discovery of the WSM phase in real materials, e.g., TaAs family and WTe_2, significant attention has been devoted to understanding the theoretical and experimental properties induced by non-trivial topology at the single particle level <cit.>. Moving beyond the single particle paradigm by including electron-electron correlation effects brings about an astonishingly rich and complex set of phases including unconventional superconductivity <cit.> and colossal magnetoresistance <cit.>, so the question arises “How does non-trivial band topology compliment or compete with correlated effects in quantum matter?" In this connection, several recent works have explored the interplay between Weyl-band topology and electronic correlations. Specifically, it has been proposed that intermediate electronic correlations can give rise to flat bands in WSMs <cit.>, whereas strong electron-electron interactions can gap out the bulk Weyl nodes, thus precipitating a phase transition towards either a Weyl-Mott insulator <cit.>, an axion insulator <cit.>, a topological superconducting phase <cit.>, a pair-density wave phase related to space-time supersymmetry <cit.>, or a Weyl-CDW phase <cit.>. Another possible consequence of electronic correlations is the emergence of a Weyl-Kondo semimetal, which has recently been experimentally realized in YbPtBi <cit.>, RAlGe compounds (with R= La and Ce) <cit.> and Ce_3Bi_4Pd_3 <cit.>. However, despite these vigorous efforts in just the last few years, very little has been done to examine the signature of the correlated WSM phase in the presence of an external magnetic field. The topological WSMs exhibit a plethora of intriguing transport phenomena due to their unique band topology in the presence of external fields, which makes the magneto-transport is one of the powerful ways to probe its band topology <cit.>. The magneto-transport in the strong-field limit in WSMs has attracted intensive attention of late due to its underlying Landau level (LL) characteristics. In particular, a 3D quantum Hall effect (QHE) induced by the LLs is predicted to occur in WSMs since the Fermi arcs at the top and the bottom surfaces form a closed loop via “wormhole" tunneling assisted by the Weyl nodes, and therefore, serving as a direct experimental probe of Weyl band topology <cit.>. Remarkably, the 3D QHE has been realized recently in a non-interacting Dirac semimetal Cd_3As_2 <cit.>. In light of the above discussions, it is natural to ask what will happen to the Landau level physics and related transport phenomena in a correlated WSM? In this article, we investigate the quantum Hall effect in an IS and TR broken Weyl-Hubbard (WH) system to explore the effect of onsite Hubbard Coulomb repulsion on the nontrivial Weyl band topology in the presence of an external magnetic field. By employing the Gutzwiller approximation to treat the electronic correlations, we find the WH system to exhibit multiple topological phases, including two Weyl phases with different pairs of Weyl nodes and a trivial narrow band insulator by tuning on-site Coulomb interaction. Interestingly, in the presence of an external magnetic field, we show the chiral Landau levels to change sign while crossing between Weyl phases. We calculate the magnetic-field dependent quantum Hall conductivity (QHC) within the Kubo response theory to explore possible signatures of the topological phase transitions and correlation effects. Our results on QHC can be directly validated by experiments. The recent discovery of correlated magnetic WSMs, such as Co_3Sn_2S_2 <cit.> and Pr_2Ir_2O_7 <cit.>, provide a platform to experimentally verify our predictions. § RESULTS §.§ Landau Level Spectrum in the Correlated Regime To investigate the effect of strong electron correlations on the quantum Hall transport properties of a Weyl semimetal, we consider a three-dimensional Weyl-Hubbard model system <cit.> in the presence of an external magnetic field (B). The B-field is introduced via the standard Peierls substitution. Within the Gutzwiller projected wavefunction method, the renormalized Weyl-Hubbard Hamiltonian can be written as H= ∑_j,ss^'{-t (e^-iB_zj_y√(α)_𝐣-𝐱sc^†_𝐣-𝐱 s+e^iB_zj_y√(α)_𝐣+𝐱sc^†_𝐣+𝐱 s) +m c^†_jsσ_x,ss^' -it^'(√(α)_𝐣-𝐲sc^†_𝐣-𝐲 s-√(α)_𝐣+𝐲sc^†_𝐣+𝐲 s)σ_y,ss^' -it^'(e^iB_xj_y√(α)_𝐣-𝐳,sc^†_𝐣-𝐳 s-e^iB_xj_y√(α)_𝐣+𝐳,sc^†_𝐣+𝐳 s)σ_z,ss^' -t[ (e^iB_xj_y√(α)_𝐣-𝐳sc^†_𝐣-𝐳 s+e^iB_xj_y√(α)_𝐣+𝐳sc^†_𝐣+𝐳 s)+ (√(α)_𝐣-𝐲sc^†_𝐣-𝐲 s+√(α)_𝐣+𝐲sc^†_𝐣+𝐲 s)]σ_x,ss^'} c_𝐣s^'+ Ud N_L, where t, t^' are the hopping parameters and U is the onsite Hubbard-interaction strength between two electrons carrying opposite spins. Here, m denotes the strength of an effective on-site in-plane spin Zeeman exchange splitting energy. In the above Hamiltonian, the B-field lies within the xz-plane, such that it can be represented by the vector potential A=(-yB_z, 0, yB_x) in Landau gauge, yielding B=∇× A = B_zẑ+B_xx̂. The parameters α_𝐢s and d are the renormalization factors and the double occupancy subject to self-consistency conditions within the Gutzwiller framework, as described in Ref. <cit.>, respectively, and N_L is the number of 3D lattice sites. It is important to note that we find the occupation/carrier density of each site to be same in the presence of magnetic field which is why we take the renormalization factors to be homogeneous, denoted by α. In the following discussions, energy and length are measured in units of t, and the cubic lattice constant a, respectively. Both t and a are assumed to be one unless specified otherwise. It is clear in the Hamiltonian that both k_x and k_z are good quantum numbers. To satisfy the y-direction periodicity, the magnetic field strength is restricted to 2π/Q where Q is commensurate with L_y such that Q = L_y/m reduces to an integer only. Here, L_y denotes the number of sites along y-direction. Interestingly, by increasing the onsite Coulomb interactions, the WH system undergoes two topological phase transitions: (i) from WSM phase-I to WSM phase-II and (ii) from WSM phase-II to trivial narrow band insulator. These two Weyl phases are characterized by the ratio of m and renormalized hopping parameter t_ nor=α t, in particular, m/2t_ nor < 1 and m/2t_ nor > 1 for Weyl phase-I and Weyl phase-II respectively <cit.>. We note that although the Hubbard U itself can lead to above-mentioned multiple phase transitions, the effect of external magnetic field on these transitions, i.e., on the renormalization parameter α, is negligible. Therefore, we use the values of α and d obtained from the zero-field calculation for rest of this work. The evolution of the Landau Level spectrum of WH system for various values of U (α) obtained by diagonalizing the above Hamiltonian is shown in Fig. <ref>. Here, we apply the external B parallel to the separation of the Weyl nodes of opposite chiralities (i.e., 𝐁∥x̂). In the WSM phase-I (α=1 and 0.5), a pair of doubly degenerate chiral modes (n=0^th LL with n is the Landau level index) clearly appear in the system traversing across the Weyl nodes at k_x=±cos^-1(m/2 t_ nor), with positive and negative slopes with respect to the applied field direction. The slope of the chiral LLs is determined by the monopole charge of the Weyl node, where a positive (negative) monopole charge gives rise to a chiral mode with a positive (negative) slope. The degeneracy of the Landau levels arises from the conservation of monopole charge. As onsite correlations U are introduced, the LLs flatten while maintaining characteristic band features. Figure <ref>(c) shows the LL spectrum of WSM phase-II with two Weyl nodes. Similar to WSM phase-I, a pair of chiral LLs with opposite slopes traverse across the Weyl nodes at k_x=±cos^-1(m/2 t_ nor -2). In contrast to WSM phase-I, however, the LLs are non-degenerate in this case. Interestingly, the chiral LLs change sign (slope) during the phase transition from WSM phase-I to WSM phase-II. Finally in the large-U limit [Fig. <ref>(d)], the LL spectrum is gaped, indicative of a correlated insulating phase, and all the LLs are non-degenerate. Clearly, chiral LLs do not exist in this phase, due to the gapping out of the Weyl nodes. It is important to note that the LL spectrum in each case is independent of the value of k_z. Furthermore, we would like to point out that when B is applied parallel to the z-axis, the counter propagating chiral LLs in each WSM phase cross each other linearly at k_z = 0 within the bulk gap, since they lie on the same momentum projection axis. Compared to the case 𝐁∥x̂, the main difference is that the bulk LLs are doubly degenerate for both WSM phases irrespective of momentum k_x. It is important to note that if we increase the strength of B by integer multiple, s, of B_0=2π/L_y for a fixed U, the degeneracy of the LLs will increase s-fold due to the Brillouin zone folding along the y-direction. §.§ Quantum Hall Effect To demonstrate the possible experimental signatures of the topological phase transitions as a function of U, we calculate the Hall conductivity using the Kubo linear-response theory, which can be expressed as: σ_ij^H=ie^2/hN∑_k_x, k_z∑_α, β≠αf_α-f_β/ϵ_α-ϵ_β⟨ψ_α\| v_i \|ψ_β⟩⟨ψ_β\| v_j \|ψ_α⟩/(ϵ_α-ϵ_β+iδ), where f_α denotes the Fermi-Dirac distribution function, ϵ_α represents the eigenvalue of the eigenstate \|ψ_α⟩, N=n_x n_z is the normalization factor (n_x and n_z are the lengths of the system along x and z directions respectively), v_i=∂ H/∂ k_i is the velocity operators, and disorder is included via the level broadening factor δ, i.e., δ→ 0 indicates clean system. We first investigate the two-dimensional sheet Hall conductivity (SHC) σ_ij^2D (k_l) with i ≠ j ≠ l, which can be obtained from the Eq. (<ref>) by summing over only the momenta parallel to B, with dimensionality e^2/h. Then the 3D Hall conductivity (QHC) can be written as σ_ij^3D =∑_k_lσ_ij^2D (k_l)/n_l with dimensionality e^2/h per length, where n_l is the length along the l-direction. Figure <ref> presents the SHC (σ_ij^H,2D) as a function of doping μ for various vallues of α. In this work, we restrict μ to lie within the bulk gap to clearly examine the contribution of the chiral LLs to the SHC signal. It is clear from Fig. <ref> that when 𝐁 is applied along the vector connecting Weyl nodes (i.e., x-direction), σ_yz^H,2D (k_x) in WSM phase I and II, as well as insulating phase, exhibit a quantized staircase profile with quantization changes when μ crosses from one k_z-independent flat LL to another. In the bulk gap, the SHC is purely composed of chiral LLs in the various WSM phases, whereas the SHC vanishes within the gap for the insulating phase due to the absence of chiral LLs. The width of the plateau of the SHC is determined by the gap size between two consecutive flat LLs. Interestingly, in WSM phase-I the quantization of the SHC changes in steps of ± 2 due to the two-fold degeneracy of LLs, whereas in WSM phase-II the SHC jumps by ± 1 since the LLs are non-degenerate. This fact allows us to track the phase transition between Weyl phases. In the case of B applied perpendicular to the vector connecting Weyl nodes, i.e., z-direction, the SHC σ_xy^H,2D (k_z) in both Weyl phases displays a similar staircase profile, but with quantization steps of ± 2 in both Weyl phases in contrast to the 𝐁=B_xx̂. We note that σ_ij^H,2D in WSM phase-II is symmric about μ=0 (σ_ij^H,2D (k, μ)=-σ_ij^H,2D (k, -μ)) due to particle-hole symmetric LL spectrum. On the other hand, the above relation does not hold in WSM phase-I, specifically when 𝐁∥x̂, σ_yz^H,2D (k_x, μ) ≠ -σ_yz^H,2D (k_x, -μ) due to the asymmetric nature of the flat LL spectrum. This striking sensitive dependence on the B direction allows us to distinguish different Weyl phases. The SHC profile we obtained as a function of doping for fixed B may also be realized by varying the magnetic field with μ kept fixed. We would like to point out that the k-resolved 3D WH system can be thought as an effective 2D system. This implies the 2D sheet longitudinal conductivity (σ_ii^2D) will be non-vanishing analogous to the integer quantum Hall regime in pure 2D systems, specifically, showing peaks with one-to-one correspondence to the step jumps in SHC only when the Fermi energy is within a Landau band where the backscattering process are present. To obtain the usual peak structure of σ_ii^2D one can simply include a small onsite disorder that broadens the LLs and has a minimal effect on the staircase profile of SHC, but we leave this to a future study. Having explained 2D SHC, we now turn our focus on 3D quantum Hall conductivity σ_ij^H,3D, which as a function of doping μ for various values of α are shown in Fig. <ref>. The different Chern insulator planes combine to yield the 3D QHC with quantized SHC along k_x direction. It is clear from the Fig. <ref> that the 3D QHC does not exhibit a staircase profile structure as observed for 2D SHC. Since there exists n_x/n_z degenerate LLs associated with each perpendicular momentum mode k_z/k_x, after the summation, the quantization is destroyed due to interference among various σ_ij^H,2D (k_z/k_x) profiles. We find that the 3D QHC varies linearly with μ within the bulk gap indicating solely the chiral LLs contribution in both WSM phases and vanishes in insulating phase. However, when μ is varied outside the bulk gap, the 3D QHC follows a nonlinear behavior in μ due to the admixture of bulk LLs, thereby destroying the linear behavior. The particle-hole asymmetric LL spectrum is inherited from its 2D SHC components for WSM phase-I, see Fig. <ref>. Moreover, the slope of 3D QHC within the bulk gap increases as we change the magnetic field direction from x-axis to z-axis in both Weyl phases. We further note that the magnitude of the 3D QHC is decreasing as we tune the system from the weakly interaction regime (WSM phase-I) to the strongly correlated phase (WSM phase-II) due to the flattening of the band dispersions and concomitantly reducing the band velocity. § DISCUSSIONS In summary, we study both 2D SHC and 3D QHC in a model Weyl-Hubbard system with both IS and TRS broken to explore the effect of onsite Hubbard correlations on nontrivial Weyl band topology in the presence of an external B-field. Interestingly, along with narrowing bandwidth, we find the chiral LLs change sign from WSM phase-I to WSM phase-II. We calculate the magnetic-field dependent quantum Hall conductivity within the Kubo response theory which shows distinct signatures of topological phase transitions and correlation effects. In particular, the 2D SHC in both Weyl phases depicts staircase profile as a function of doping and displays a qualitatively different quantization between two Weyl phases. However, since the 3D QHC is constructed from the sum of interfering 2D SHCs, it does not show any quantized profile. Interestingly, a linear-μ behavior appears within the bulk gap of WSM phases due to chiral LLs where its slope can be quantitatively changed by the changing the magnetic field direction. The recently proposed correlated magnetic WSMs such as Co_3Sn_2S_2, Pr_2Ir_2O_7 can be the candidate materials to verify the behavior of QHC obtained in this work directly in experiments. For a typical WSM such as TaAs, the lattice constant a ∼ 1 nm. Therefore, considering the length of the sample L=100 a gives the magnetic field strength B ∼ 41 T. In this case, the magnetic length turns out to be l_c ∼ 4 nm which satisfies the condition L>>l_c>>a (away from the Butterfly regime) and also within the well reach in experimental feasibility. We would like to point out that the surface Fermi arc contribution can also be important to QHC. However, in the present study, this contribution is negligible due to following reason: it has been shown that when the external B is greater than B_sat where B_sat=k_0/L with k_0 is the arc length of the Fermi arc, the majority of the magnetic cyclotron orbit takes place in the bulk and the surface Fermi arc contribution becomes negligibly small <cit.>. In the present case, we consider L>>l_c and B(=2π /L)>B_sat (i.e., B/B_sat=2π/k_0>1) leading to the fact that the QHC will be dominated by bulk LLs. In addition, we have considered periodic-boundary condition along the y-direction to reduce surface-state effects. Overall, our study demonstrates that the QHE persists even in the presence of strong electron-electron interactions and provides distinct signatures of different topological phases. This make QHE an efficient direct probe of band topology in correlated quantum materials. § ACKNOWLEDGEMENTS The work at Los Alamos National Laboratory was carried out under the auspices of the U.S. Department of Energy (DOE) National Nuclear Security Administration under Contract No. 89233218CNA000001. It was supported by the LANL LDRD Program, and in part by the Center for Integrated Nanotechnologies, a DOE BES user facility, in partnership with the LANL Institutional Computing Program for computational resources. apsrev4-2
http://arxiv.org/abs/2306.08288v1	20230614065132	System Information Decomposition	[ "Aobo Lyu", "Bing Yuan", "Ou Deng", "Mingzhe Yang", "Andrew Clark", "Jiang Zhang" ]	cs.IT	[ "cs.IT", "math.IT" ]	A reinforcement learning strategy for p-adaptation in high order solvers [ July 31, 2023 ======================================================================== In order to characterize complex higher-order interactions among variables in a system, we introduce a new framework for decomposing the information entropy of variables in a system, termed System Information Decomposition (SID). Diverging from Partial Information Decomposition (PID) correlation methods, which quantify the interaction between a single target variable and a collection of source variables, SID extends those approaches by equally examining the interactions among all system variables. Specifically, we establish the robustness of the SID framework by proving all the information atoms are symmetric, which detaches the unique, redundant, and synergistic information from the specific target variable, empowering them to describe the relationship among variables. Additionally, we analyze the relationship between SID and existing information measures and propose several properties that SID quantitative methods should follow. Furthermore, by employing an illustrative example, we demonstrate that SID uncovers a higher-order interaction relationships among variables that cannot be captured by current measures of probability and information and provide two approximate calculation methods verified by this case. This advance in higher-order measures enables SID to explain why Holism posits that some systems cannot be decomposed without loss of characteristics under existing measures, and offers a potential quantitative framework for higher-order relationships across a broad spectrum of disciplines. § INTRODUCTION Systems Science is a multidisciplinary field investigating the relationships and interactions among internal variables within a system, with applications spanning neuroscience, biology, social sciences, engineering, and finance <cit.>. Complex systems are defined by many interconnected variables that engage in intricate interactions, the understanding of which is critical for predicting emergent properties, devising novel treatments, and optimizing system performance. In the field of information theory, mutual information is a widely employed method for quantifying interactions between two variables by encapsulating shared information or the reduction in uncertainty facilitated by each variable <cit.>. However, mutual information is restricted to describing pairwise interactions, which often proves inadequate for analyzing complex systems that necessitate multivariate interaction assessments. As a solution, Beer et al. introduced the Partial Information Decomposition (PID) method, which characterizes information interactions between a target variable and multiple source variables by decomposing the mutual information shared among them <cit.>. In the past ten years, PID and related theories, such as Information Flow Modes <cit.> and integrated information theory <cit.>, have been applied in many fields, such as quantitative identification of Causal Emergence <cit.>, dynamical process analysis <cit.> and information disclosure <cit.>. However, PID-related techniques only decompose the partial information of a single target variable at a time. This leads to the fact that selecting or constructing a suitable and plausible target variable can be challenging or even unfeasible when addressing complex systems problems, and also raising questions as to why certain variables are prioritized as targets over others. Moreover, this variable-specific perspective results in a unidirectional relationship between the specified target variable and source variable, which makes information atoms bound to a specific target variable and insufficient for a comprehensive description of the relationships among variables. This further limits our exploration of system functions and properties, as many of them originate from the relationship between system variables rather than specific variables or its asymmetric properties. To overcome these limitations, we need a system analysis method based on a system perspective, analogous to the synchronization model <cit.> or the Ising model <cit.>, rather than a variable perspective like PID. Furthermore, this method should capture the nature and characteristics of the system without specifying or introducing any special variable, and also take into account all the interactive relationships among all variables in the system, including pairwise and higher-order relationships. Therefore, we propose System Information Decomposition (SID), an innovative method that treats all system variables equally and effectively captures their intricate interactions. This novel approach enhances our capacity to scrutinize and understand the complexities of multivariate systems. Specifically, we firstly expand the PID's conceptual framework to a system horizon by taking all variables in the system as target variable separately. Then, without relying on any PID quantitative method, we proving the symmetry properties of information decomposition based on a set theory perspective of information theory. That means the value of information atoms, the non-overlapping units obtained by decomposing variables' information entropy according to their relationship, will not be affected by the the choice of target variable. Therefore, we put forward a general SID framework, wherein redundant, synergistic, and unique information atoms become a multivariate system's property, reflecting the complex (pairwise and higher-order) relationships among variables. Furthermore, we explore the connections between existing information entropy indicators and the information atoms within the SID framework while proposing the necessary properties for information atom quantification and several variable calculation approaches. Through a detailed case analysis, we provide an intuitive demonstration that SID can unveil higher-order relationships within the system that cannot be captured by existing probability or information measures. Finally, we discuss the potential application scenarios and implications of SID from the philosophical perspective of system decomposition as well as from areas such as Higher-order Networks and theory of Causality. Our contributions to Information and System Science are twofold. Firstly, the SID framework broadens the application of information decomposition methods in complex systems by introducing a methodology to decompose all variables' entropy within a system. This achievement also unifies information entropy and information decomposition onto one Venn diagram, where three variables can be well represented on a two-dimensional plane. Secondly, this framework reveals previously unexplored higher-order relationship that cannot be represented by existing probability or information measures, providing a potential data-driven quantitative framework for Higher-order Networks related research. The remainder of this paper is organized as follows. Section <ref> reviews the development of information theory, PID and related research. Section <ref> extends the PID method to multivariate system scenarios, defines SID, shows the connections between existing information entropy indicators and the information atom. Section <ref> presents the characteristics of the SID framework through a case analysis. Then, Section <ref> gives the properties for information atom calculation and there possible calculation approaches. The significance and potential applications of SID are discussed in Section <ref>. § INFORMATION DECOMPOSITION §.§ Information Theory Framework Shannon's classical information theory has provided a robust foundation for understanding information entropy <cit.>. Mutual information and conditional entropy further decompose information and joint entropy according to the pairwise relationship between variables, which can be intuitively shown in Venn diagrams <ref>, a precise tool for depicting the information composition within systems. In this paper, we explore the potential of Venn diagrams to provide valuable insights into the complex decomposition of multivariate systems and extend the entropy decomposition methods of classical information theory. §.§ Partial Information Decomposition Framework In classical information theory, the joint mutual information may occasionally be larger or smaller than the sum of the mutual information between individual variables. Consequently, traditional redundant information calculations may yield negative values, contradicting our intuitive understanding. To address this phenomenon, Beer et al. proposed the Partial Information Decomposition (PID) framework <cit.>. The PID framework facilitates the decomposition of joint mutual information between multiple source variables and a target variable. Specifically, for a random target variable Y and a random source variables X=X_1, X_2, ⋯, X_n, the PID framework allows for the decomposition of the information that X provides about Y into information atoms, such as redundant, synergistic and unique information. These atoms represent the partial information contributed by various subsets of X, individually or jointly, providing a more nuanced understanding of the relationships between the target and source variables. Considering the simplest case of a system with three variables, one can employ a Venn diagram to elucidate their interactions <cit.>. The unique information Un(Y:X_1) from X_1 signifies the information that X_1 provides to Y, which is not provided by X_2 and vice versa. In other words, unique information refers to the contribution made by a specific source variable to the target variable that is exclusive to that variable and not shared by other source variables. Redundant information Red(Y:X_1,X_2) represents the common or overlapping information that X_1 and X_2 provide to Y. Synergistic information Syn(Y:X_1,X_2) captures the combined contribution of X_1 and X_2 to Y, which cannot be obtained from either variable individually. For an arbitrary multivariate system, we can select any variable as the target variable Y and the remaining variables as the source variables X_1,⋯ ,X_n. The redundant information Red(Y:X_1,⋯ ,X_n) denotes the common or overlapping information provided by the source variables <cit.>, which is contained in each source <cit.>. Redundant information has the following properties <cit.>: [Symmetry of source variables] Red(Y : X) is invariant to the permutation of X. For the source variables X_i and X_j from {X_1, ⋯ ,X_n},i,j ∈{1 ⋯ n} , there is Red(Y: X_i, ⋯ X_j) = Red(Y: X_j, ⋯ X_i). [Self-redundancy] When there is only one source variable, the redundant information is equivalent to the mutual information between the target variable Y and the source variable X_i, i.e. Red(Y:X_i) = I(Y:X_i). [Monotonicity] The redundancy should exhibit a monotonically decreasing behavior with the inclusion of additional inputs, i.e. Red(Y: X_1, ⋯ ,X_n) ≤ Red(Y: X_1, ⋯ ,X_n-1), where n ∈ N. Despite numerous quantitative methods for information atoms in PID, a widely accepted method still needs to be discovered, primarily due to negative solutions. Such inconsistencies undermine the notion of information entropy as a non-negative measure of uncertainty. To circumvent reliance on a specific quantitative method, we employ classical mutual information and conditional entropy for calculating the sum of the information entropy of certain information atoms. Although this approach does not permit the precise calculation of individual information atoms <cit.>, it ensures that the framework remains independent of any specific PID calculation methods. Consequently, when a particular PID calculation method computes the value of one information atom, the information entropy of the remaining information atoms is determined by the following Axiom: [Quantitative Computation] In a three-variable system with a target variable Y and source variables X_i and X_j, the following relationships hold: Un(Y: X_i) = I (X_i: Y) - Red(Y: X_i, X_j) Syn(Y: X_i, X_j)= I (Y: X_i\| X_j) - Un(Y: X_i) = H (Y \| X_j) - H (Y \| X_i, X_j) - Un(Y: X_i) Syn(Y: X_i, X_j) + Red (Y: X_i, X_j)+ Un(Y: X_i) + Un(Y: X_j) = I(Y: X_i, X_j) <cit.> Although several enlightening perspectives on PID have been proposed <cit.>, there is still no perfect quantitative definition. To make our work not rely on any specific computational method, we need to explore information decomposition and the properties of information atoms from a more conceptual perspective. Given the high similarity between information decomposition, especially the concept of redundant information, and the concept of inclusion and overlapping, set theory may allow us to explore the properties of PID more deeply. §.§ A Set-theoretic Understanding of PID Kolchinsky's remarkable work <cit.> offers an understanding based on set theory. Given that PID is inspired by an analogy between information theory and set theory <cit.>, the redundant information can be understood as information sets that the sources provide to the target. More specifically, the definition of set intersection ∩{X_i} in set theory means the largest set that is contained in all of the X_i, and these set-theoretic definitions can be mapped into information-theoretic terms by treating “sets” as random variables, “set size” as entropy, and “set inclusion” as an ordering relation ⊏, which indicates when one random variable is more informative than another. Considering a set of sources variables X_1, . . . ,X_n and a target Y, PID aims to decompose I(Y: X_i, X_j) and get Red(Y: X_1, ⋯ ,X_n), the total same information provided by all sources about the target, into a set of non-negative terms. Therefore, redundant information can be viewed as the "intersection" of the information contributed by different sources, leading to the following definition: For a variable-system, the redundant information from the source variables X_1, ⋯ ,X_n to the target variable Y is the information that all source variables can provide to the target variable, the largest mutual information between the target variable and a non-unique variable Q that has an ordering relation ⊏ with all source variables. That is Red(Y:X_1,⋯, X_n)= I_∩ (X_1,⋯,X_n→ Y) := sup_Q {I(Q:Y):Q⊏ X_i,∀ i∈{1⋯ n}} The ordering relation ⊏ is an analogy to the relation contained ⊆ in set theory, which is not specified but follows some assumptions: i) Monotonicity of mutual information, A ⊏ B ⇒ I(A:Y) ≤ I(B:Y). ii) Reflexivity: A ⊏ A for all variable A. iii) For all sources X_i, O ⊏ X_i⊏ (X_1,⋯, X_n), where H(O) = 0 and (X_1,⋯, X_n) indicates all sources considered jointly. One example of a partial order is Q ⊏ X if and only if H(Q\|X)=0. More derivative properties can be found in Kolchinsky’s work <cit.>. § SYSTEM INFORMATION DECOMPOSITION In this section, we develop a mathematical framework of SID. The objective of this framework is to decompose the information of all variables within a system based on their interrelationships. By addressing the limitation of PID, which focuses solely on a single target variable, we progress towards multi-variable information decomposition for systems. §.§ Extension of PID in a System Scenario The PID method only decomposes joint mutual information between multiple source variables and a specific target variable, as illustrated by the outermost circle of the Venn diagram in Figure <ref>. We redesign the Venn diagram to extend this method and encompass a system-wide perspective, as demonstrated in Figure <ref>. The system comprises two source variables,X_1 and X_2, and one target variable, Y, represented by the three intersecting circles. The area size within the figure signifies the information entropy of the variables or information atoms, and the central area denotes the joint mutual information, encompassing redundant, unique from X_1, unique from X_2, and synergistic information. This arrangement aligns with the Venn diagram framework of PID. To enhance the comprehensiveness of the framework, it is necessary to elucidate the unexplored section of the updated Venn diagram <ref>. In addition to the four sections of joint mutual information, the information entropy of the target variable Y contains an unaccounted-for area. According to Shannon's formula, this area corresponds to the joint conditional entropy of the source variables to the target variable H(Y\| X_1, X_2), which also characterizes the interrelationships between the target variable and the source variables. In the SID framework, numerous joint conditional entropy exist, including one that stands out: the joint conditional entropy originating from all variables except the target variable. To optimize the usefulness of the SID framework, we define this specific joint conditional entropy as the target variable's external information (Ext). The definition is grounded in the philosophical assumption that everything is interconnected. Since joint conditional entropy implies the uncertainty that cannot be eliminated by the internal variables of the system, the variables capable of providing this information must exist outside the system. To some extent, external information can emphasize the relationship between the target variable and the entire system rather than just a simple relationship with other variables. Therefore, we also consider it a kind of information atom within the SID framework. For a system containing variables Y and {X_1, ⋯, X_n}, the external information Ext(Y) is defined as Ext(Y)=H(Y\|X_1, X_2, ⋯, X_n). Thus, we have been able to decompose the target variable's entropy into a finite number of non-repeated information atoms according to the relationship between it and the other variables in the system. Furthermore, we can apply this information decomposition method to each variable in the system to decompose the entire information entropy of the system, which results in a preliminary version of the SID. For the convenience of expression, we use Un_i-j, Syn_ij-k, and Red_ij-k to represent Un(X_j,X_i), Syn(X_k:X_i,X_j), and Red(X_k:X_i,X_j) respectively. A Venn diagram for a three-variable system is shown in Figure <ref>: §.§ Properties of Information Atoms Although the preliminary version of SID can decompose all variables in a system, the decomposition of each variable is carried out separately, and the description of information atoms is directional (from source variables to the target variable). For instance, the unique information provided by X_1 to X_3 in Fig. <ref> is not directly related to the unique information provided by X_3 to X_1. To make information atoms better reflect the relationship among variables and unifies the Venn diagram of Shannon's framework<ref> and PID framework <ref>, it is necessary to further explore the properties of information atoms within the SID framework. In this subsection, we are going to prove the symmetry property of information atoms by demonstrating that unique, redundant, and synergistic information atoms remain stable when different variables are considered as target variables. Let X_1,⋯ , X_n be the variables in a system. In SID, there is only one redundant information Red(X_1,⋯, X_n), which implies that the redundant information is equal irrespective of the chosen target variable. Formally, we write Red(X_1,⋯, X_n) = Red(X_i:X_1,⋯ , X_n∖ X_i), ∀ i∈{1⋯ n}. Suppose we have a multivariate system containing a target variable Y and source variables X_1,⋯ , X_n. For the convenience of expression, we use 𝒳 to represent all the source variables X_1,⋯ , X_n. The proof is to show that Red(Y: 𝒳,Y) = Red(Y;𝒳) and Red(U: 𝒳, Y) = Red(Y: 𝒳, Y), where U is the union variable of Y and 𝒳, such that U = (𝒳, Y). Then, we can demonstrate that redundant information is equal regardless of which variable is chosen as the target variable. Step One, to prove Red(Y: 𝒳,Y) = Red(Y;𝒳): By Definition <ref>, Red(Y: 𝒳,Y) =sup_Q_j{I(Q_j:Y):Q_j⊏ Y, Q_j⊏ X_i,∀ i∈{1⋯ n}}. According to the Monotonicity property of redundant information (Axiom <ref>) that adding new source variables will only impose stricter restrictions on top of existing ones, and the Symmetry property of source variables (Axiom <ref>) that the order in which restrictions are imposed will not affect the results, we can make this optimization problem into two steps, such that: sup_Q_j{I(Q_j:Y):Q_j⊏ Y, Q_j⊏ X_i,∀ i∈{1⋯ n}} = sup_Q_j,Q_k{I(Q_j:Y):Q_j⊏ Y, Q_j⊏ Q_k, Q_k⊏ X_i,∀ i∈{1⋯ n}} = sup_Q_k{sup_Q_j{I(Q_j:Y):Q_j⊏ Y, Q_j⊏ Q_k}: Q_k⊏ X_i,∀ i∈{1⋯ n}} = sup_Q_k{sup_Q_j{H(Q_j):Q_j⊏ Y, Q_j⊏ Q_k}: Q_k⊏ X_i,∀ i∈{1⋯ n}}, since Q_j⊏ Y = sup_Q_k{I(Q_k:Y):Q_k⊏ X_i,∀ i∈{1⋯ n}}, since sup_Q_j{H(Q_j):Q_j⊏ Y, Q_j⊏ Q_k} = I(Q_k:Y). Therefore, Red(Y: 𝒳,Y) = Red(Y;𝒳) Step Two, to prove Red(U: 𝒳, Y) = Red(Y: 𝒳, Y): Building upon the conclusion that Red(Y: 𝒳, Y) = Red(Y: 𝒳), we can replace the target variable with the union variable U = (𝒳, Y), which combines the target variable Y and the source variables 𝒳. (The entropy of the union variable U can be expressed as H(U) = H(𝒳, Y).) Firstly, let's employ the contradiction method by assuming that Red(U: 𝒳, Y) < Red(Y: 𝒳, Y). That means that sup_Q_j{I(Q_j:U):Q_j⊏ Y, Q_j⊏ X_i,∀ i∈{1⋯ n}} < sup_Q_k{I(Q_k:Y): Q_k⊏ Y, Q_k⊏ X_i,∀ i∈{1⋯ n}}. Let Q_j^* and Q_k^* that satisfies or infinitely approaches the above conditions (I(Q_j^:U) = sup_Q_j{I(Q_j:U):Q_j⊏ Y, Q_j⊏ X_i,∀ i∈{1⋯ n}} - ε, ∀ε > 0, and Q_k^ can also be inferred similarly). Since Y ⊏ U from U=(𝒳,Y), we have I(Q_k^,Y) ≤ I(Q_k^,U). Given that Q_k^⊏ Y and Q_k^⊏ X_i (same with the restrictions of Q_j^), the mutual information I(Q_j^,U) should greater or equal to I(Q_k^,Y), which lead to a contradiction. Consequently, we can conclude that Red(U: 𝒳, Y) ≥ Red(Y: 𝒳, Y). Secondly, let's also use the contradiction method by assuming that Red(U: 𝒳, Y) > Red(Y: 𝒳, Y). In this case, sup_Q_j{I(Q_j:U):Q_j⊏ Y, Q_j⊏ X_i,∀ i∈{1⋯ n}} > sup_Q_k{I(Q_k:Y): Q_k⊏ Y, Q_k⊏ X_i,∀ i∈{1⋯ n}}. Let's focus on the Q_j^ and Q_k^* that satisfies or infinitely approaches the above conditions. Since Q_j^⊏ Y and Y ⊏ U from U=(𝒳,Y) (H(Y\|U)=0), we have I(Q_j^:U) = I(Q_j^:Y), which lead to a contradiction (I(Q_j^:Y) > I(Q_k^:Y) with the same restriction on Q_j^ and Q_k^). Therefore, we obtain Red(U: 𝒳, Y) ≤ Red(Y: 𝒳, Y). Since we have both Red(U: 𝒳, Y) ≥ Red(Y: 𝒳, Y) and Red(U: 𝒳, Y) ≤ Red(Y: 𝒳, Y), Red(U: 𝒳, Y) = Red(Y: 𝒳, Y) is proved. In Summary: Since we have established that Red(Y: 𝒳, Y) = Red(Y: 𝒳), and Red(U: 𝒳, Y) = Red(Y: 𝒳, Y), we can conclude that for all X_i in {𝒳}, Red(X_i: Y, {𝒳}∖ X_i) = Red(Y:{𝒳}). Therefore, Theorem <ref> is proved, and we can use Red(X_1,⋯, X_n) or Red_1⋯ n denote the redundant information within the system {X_1,⋯, X_n}. Let X_1,⋯, X_n be the variables in a system. In SID, the unique information of any two variables relative to each other is equal, regardless of which is chosen as the target variable. Formally, we write Un(X_i:X_j) = Un(X_j:X_i), ∀ i j where i, j ∈{1, ⋯, n}. According to Axiom <ref>, unique information is a part of the information provided by the source variable to the target variable, that is, mutual information minus redundant information. In a three-variable system {X_1,X_2,X_3}, we have Un(X_i:X_j)+ Red(X_i:X_j,X_k) = I (X_i; X_j), for all i j ∈{1,2,3}. Since I(X_i:X_j) = I(X_j:X_i) according to the symmetry of Shannon's formula <cit.>, and Red(X_i:X_j,X_k) = Red(X_j:X_i,X_k) = Red(X_i,X_j,X_k) according to Theorem <ref>, we have Un(X_i:X_j) = Un(X_j:X_i). Therefore, we can represent this information atom as Un(X_i,X_j), or Un_i,j. Let X_1,⋯ , X_n be the variables in a system. In SID, the synergistic information of any group of variables is equal, regardless of which is chosen as the target variable. Formally, we write Syn(X_1,⋯, X_n) = Syn(X_i:{X_1,⋯ , X_n}∖ X_i), ∀ i∈{1⋯ n}. According to Axiom <ref>, Theorem <ref>, Theorem <ref>, and the chain rule of Shannon formula, for a three-variable system with X_i, X_j, X_k: Syn(X_k:X_i,X_j) = H(X_k\|X_j) - H(X_k\|X_i,X_j) - Un(X_i,X_k) = (H(X_j,X_k) - H(X_j)) - (H(X_i,X_j,X_k) - H(X_i,X_j)) - Un(X_i,X_k) = H(X_j,X_k) + H(X_i,X_j) - H(X_j) - H(X_i,X_j,X_k) - Un(X_i,X_k) = (H(X_i,X_j) - H(X_j)) - (H(X_i,X_j,X_k) - H(X_j,X_k)) - Un(X_i,X_k) = H(X_i\|X_j) - H(X_i\|X_j,X_k) - Un(X_i,X_k) = Syn(X_i:X_j,X_k) Therefore, we proved Theorem <ref> and we can write synergistic information in the form of Syn(X_1,⋯, X_n) or Syn_1⋯ n. Based on the Theorem <ref> <ref> <ref> (the symmetry of information atoms), the SID framework can be merged into the formal version in Figure <ref>. In the formal version of SID, the concept of target variable is canceled, and all variables are equally decomposed according to their relationship with other variables. Specifically, redundant information and unique information are merged. redundant information (atoms) in any group of variables and unique information (atoms) between any two variables appear only shown one time in the Venn diagram, while synergistic information (atoms) appear in each participating variable with the same value, and each variable contains one external information (atom). So far, we can give the formal definition of SID: SID is a system decomposition framework based on information entropy, that can divide the whole information entropy of a multivariate system into non-overlapping information atoms according to the relationship among variables. In this framework, redundant information represents the common or overlapping information of all the variables; unique information represents information that is only owned by two variables but not by others; and synergistic information represents the information that can be known from any variable only when the other variables are observed simultaneously. In the SID framework, the Venn diagram unifies the Shannon's framework<ref> and PID framework <ref>. Considering that Venn diagrams cannot present the systems with more than three variables on a two-dimensional plane, we only present the simple case of three-variable system ({X_1, X_2, X_3}) in this paper. For the presentation of SID in systems with more than three variables, we will analyze it in the discussion section. §.§ SID and Information Measure In addition to Axiom <ref> and Definition <ref> for the relationship between SID and mutual information, conditional entropy and joint conditional entropy, there are still some important information measures that deserve our attention. [Joint Entropy Decomposition] For any subsystem with 3 variables, H (X_1, X_2, X_3) = Ext(X_1) + Ext(X_2) + Ext(X_3) + Un(X_1,X_2) + Un(X_1,X_3) + Un(X_2,X_3) + 2 Syn(X_1, X_2, X_3) + Red (X_1, X_2, X_3). Based on Corollary <ref>, which can be easily proved by Axiom <ref>, we can have a deeper understanding of information atoms, that is, any information atom can be understood as some kind of information stored by m variables, and at least n variables need to be known to obtain the information (m>n, m, n ∈ℤ). Specifically, the external information of the system is owned by the variable independently, so m=1 and n=1; redundant information is owned by all variables, so m = numberofvariables and n=1; unique information is owned by two variables, Therefore m=2 and n=1; synergistic information is shared by all variables, so m = numberofvariables and n = numberofvariables - 1. Therefore, the joint entropy decomposition is the sum of each information atom multiplied by its m-n quantity. This perspective will deepen our understanding of the essence of information atoms and facilitate our exploration of the joint entropy decomposition of systems with more than three variables. Besides, this phenomenon also reflects the differences between information measures and Venn diagrams. Considering that Venn diagrams cannot fully reflect the nature of information decomposition, alternative visualization solution will be discussed in the discussion section. [Total Correlation Decomposition] For any subsystem with 3 variables, TC (X_1, X_2, X_3) = Un(X_1,X_2) + Un(X_1,X_3) + Un(X_2,X_3) + Syn(X_1, X_2, X_3) + 2 * Red (X_1, X_2, X_3). [Intersection Information Decomposition] For any system with 3 variables, its Intersection Information CoI (X_1, X_2, X_3) = Red(X_1, X_2, X_3) - Syn(X_1, X_2, X_3). According to the calculation of CoI (X,Y, Z) = H (X_1, X_2, X_3) + H (X_1) + H (X_2) + H (X_3) - H (X_1, X_2) - H (X_1, X_3) - H (X_2, X_3), Col is symmetry and unique for a system, which also verifies the symmetry of information atoms (Syn and Red) to some extent. § CASE STUDIES In this section, through a series of case analyses, we elucidate the unique properties of the SID framework and its capacity to uncover higher-order relationships that surpass the capabilities of current information and probability measures. Without loss of generality, we can construct a case that includes both macro and micro perspectives, which can not only analyze the properties of SID at the macro level but also obtain "ground truth" through known micro properties. First, we construct six uniformly distributed Boolean variables a,b,c,d,e,f, ensuring that these variables are independent. We then create new variables by performing XOR operations on the existing variables: let g = c⊕ e, h = d⊕ f, i = c⊕ f, and j = d⊕ e, where ⊕ represents XOR. Next, we construct new macro variables by combining these micro variables: let X_1 = (a,b,c,d), X_2 = (a,b,e,f), X_3 = (c,d,e,f), X_4 = (a,c,e,h), X_5 = (a,b,g,h), X_6 = (a,b,i,j). The combination method involves simple splicing; e.g., when a=1, b=0, c=1, d=1, X_1 is equal to 1011. Appendix <ref> provides a concrete example that matches this design. As the micro-level variables are independent of each other, this combination ensures that the properties of the macro variables are a combination of the properties of the micro variables. Then, we fix X_1 and X_2 as constants and form different three-variable systems (Cases 1-4) by adding X_3, X_4, X_5, and X_6 respectively, as shown in Table <ref>. After knowing the microscopic dynamics of these cases, we can more intuitively analyze their characteristics under the SID framework. It is worth noting that these four cases yield identical results under existing probability theory and information theory measures. The system has 64 equally probable outcomes, each variable has 16 equally probable outcomes, the total information amount in the system is 6, the pairwise mutual information between variables is 2, and the conditional entropy is 2. Existing systems analysis methods cannot identify the differences observed in these four examples. However, the four systems exhibit three distinct internal characteristics under the SID framework. Since these examples comprise mutually independent micro variables, we can intuitively map the micro variables to the information atoms in each case. In Case 1, the micro variables a,b provide 2-bit unique information between X_1 and X_2 (c,d correspond to X_1 and X_3, e,f correspond to X_2 and X_3). In Case 2, micro variable a provides 1-bit redundant information, while b, c, and e provide 1-bit unique information between X_1 and X_2, X_1 and X_4, X_2 and X_4 respectively. The XOR relationship between d-f-h provides 1-bit synergistic information between variables. In Cases 3 and 4, micro variables a and b provide 2-bit redundant information, and XOR relationships of c-e-g, d-f-h, and c-f-i, d-e-j provide 2-bit synergistic information for the two cases, respectively. Figure <ref> displays the SID Venn diagrams for Cases 1–4. § CALCULATION OF SID Although we have proposed the framework of SID and proved the symmetry of information atoms, the problem of exact computation has not been fully resolved. Therefore, in this section, we alternatively propose the properties that the calculation method of the SID framework should satisfy, and accept any method that can meet these properties. Additionally, we propose a direct methods for some special cases and two novel methods for more general cases and validate their accuracy and applicability through the examination of the cases <ref>. §.§ Properties of Calculation Methods for SID [Shannon's formula] The sum of certain information atoms should equal to the mutual information and conditional information. For a three-variable system, it is Axiom <ref>. The information atoms can be regarded as a finer-grained division of Shannon’s information entropy calculation, so calculation methods such as information entropy, mutual information, and conditional entropy can accurately calculate the sum of some information atoms, which means that the SID’s calculation should conform to the Shannon formula. It is worth noting that when the specific PID calculation method calculates the value of one information atom, the rest of the information atoms will also get the results according to Axiom <ref>. This means that the calculation method of SID only needs to focus on one information atom in the system. [Computational Symmetry] The results of SID calculation should satisfy Theorems <ref>, <ref>, and <ref>. For the same system, the order of variables in the calculation method will not affect the results. This ensures that the SID framework provides a consistent decomposition of information entropy, regardless of the order of variables. Specifically, for redundant information and synergistic information, changing the order of any variable in the calculation method will not change the result; for unique information, exchanging the positions of the two focused variables or changing the order of the remaining variables will not change the result. [Non-negativity of information atoms] After applying SID, the value of any information atom is greater than or equal to zero. This non-negativity property holds because information measures, the degree of uncertainty are always non-negative as per the principles of information theory. Although the computational problem of information atoms has not been completely solved yet, just like finding the Lyapunov function, for a specific case, we can often use specific methods, analysis, and some intuition to get the result. For example, a direct and rigorous method is to use properties <ref> and <ref>. [Direct Method] If certain mutual information or conditional entropy is zero, we can directly draw the conclusion that: (1) the redundant information and the corresponding unique information are zero if some mutual information is zero, or (2) the synergistic information and the corresponding unique information are zero if some conditional entropy is zero. Then, we can obtain the values of the remaining information atoms. For a more general scenario, we are going to give a calculation formula that can be applied to most situations and a neural network method that can give approximate values. §.§ A Calculation Formula Although we can calculate some cases through the Direct Method <ref> or from the perspective of case construction like previous case analysis <ref>, in order to make the SID framework applicable in a wider range of scenarios, we need to find a general solution for information atoms. After analyzing a large number of known-result cases and combining some intuitions, we reveal the correspondence between the values of information atoms and certain structures on the data, which we called Synergistic Block and Unique Block. Based on this correspondence, we propose an identification method for unique information and synergistic information and further construct a formula for calculating synergistic information that is applicable in most cases. For a full probability table containing the values of all variables, if we fix a certain value of a variable (let X_1=x_1), we can get the possible values (jand k) of the remaining variables under this condition (j ∈{X_2\|X_1=x_1} , k ∈{X_3\|X_1=x_1}). Then, mark all these values (j and k) of the remaining variables (X_2, X_3) while the fixed variables take other values (X_2 = j \| X_1 x_1 , X_3 = k \| X_1 x_1). For all values of remaining variables where both occur simultaneously, such that X_2 = j and X_3 = k when X_1 x_1, we call it Synergistic Block. For all values of remaining variables where only one occurs, we call it Unique Block, such that X_2 = j and X_3 k when X_1 x_1 for X_2, or X_2 j and X_3 = k when X_1 x_1 for X_3. Take Table <ref> as an example, we fixed the value of X_1=0000, and marked the values of all variables in this scenario in yellow. Then, we mark the values where X_2 to X_6 still take the same value when X_1 0000 as pink. Taking X_1, X_2 and X_4 as examples, we marked the synergistic blocks in bold, and marked the unique blocks of X_2 and X_3 in italics. Besides, although not as obvious as the previous two, redundant information also has corresponding redundant blocks. [Information Atom Identification] The synergistic information is greater than zero if and only if the synergistic block exists. For a three-variable system {X_1,X_2,X_3}, Syn(X_1,X_2,X_3) > 0 iff P(X_2 = j, X_3 = k, X_1 x_1, j ∈{X_2\|X_1=x_1}, k ∈{X_3\|X_1=x_1}) > 0. The unique information between two variables is greater than zero if and only if fix any of them, the remaining variable have unique block for a three-variable system. That is Un(X_1,X_2) > 0 iff P(X_2 j, X_3 = k, X_1 x_1, j ∈{X_2\|X_1=x_1}, k ∈{X_3\|X_1=x_1}) > 0. Based on the Proposition <ref>, we construct a calculation formula that can calculate synergistic information. The specific calculation method for synergistic information for a three-variable system involving X_1, X_2, and X_3 is as follows: Syn(X_1, X_2, X_3) = (∑ P(x_1,x_2,x_3) * log ( P(X_2 = x_2, X_3 = k, k ∈{X_3\|X_1=x_1})/P(X_2 = x_2\|X_1 = x_1) * P(X_3 = x_3, X_2 = j, j ∈{X_2\|X_1=x_1})/P(X_3 = x_3\|X_1 = x_1) * P(X_1 = x_1)/P(X_2 = j, X_3 = k, j ∈{X_2\|X_1=x_1}, k ∈{X_3\|X_1=x_1}) ) ) - H(X_1\|X_2,X_3) In the previous case <ref>, since the data is relatively uniform, fixing any value of X_1 will have the same result, so we can quickly calculate the synergistic information of the four cases by fixing X_1=0000. In these cases, the log part of the formula can be intuitively understood as log (yellow + synergistic block / yellow), which is log (4/4) = 0 in case 1; log (8/4) = 1 in case 2; log(16/4)=2 in cases 3 and 4. Unique information can also be calculated by a similar method like log(yellow + unique block / yellow). §.§ An Approximate Method by Neural Information Squeezer Another possible method is to use a generalized form of neural information squeezer (NIS, a machine learning framework by using invertible neural networks proposed in Ref <cit.>) to numerically calculate the redundancy of the system, and then to derive other information atoms. As shown in Figure <ref>(a), the NIS framework has two parts: an encoder and a decoder. The encoder can accept any real vector variable with dimension p, and it contains two operators: a bijector ψ modeled by an invertible neural network (see details in <cit.>) with dimension p and a projector χ which can drop out the last p-q dimensions from the variable ψ_p(X) to form variable U. The remaining part (Ŷ_X) can be regarded as a low-dimensional representation of X which will be used to construct the target Y via another invertible neural network ϕ by mapping [V, Ŷ_X] into Ŷ, where V∼𝒩(0,I) is a p'-q dimensional random noise with Gaussian distribution, where p' is the dimension of Y. Then, we need to train the whole framework to conform that (1) Ŷ approximates the target variable Y, and (2) U follows a p-q dimensional standard normal distribution. It can be proven that the following proposition holds: For any random variables X with p dimension and Y with p' dimension, and suppose p and p' are very large, then we can use the framework of Figure <ref>(a) to predict Y by squeezing the information channel of Ŷ_X as the minimum dimension q^* but satisfying Ŷ≈ Y and U∼𝒩(0,I). Further, if we suppose H(X)>H(X\|Y)>0, then: H(Ŷ_X)≈ I(X;Y), and H(U)≈ H(X\|Y). We will provide the proof in the appendix. The reason why we require that the numbers of dimensions of X,Y are large is because the maximal q for accurate predictions may not be integer if p,p' are small. Therefore, we can enlarge the dimensions by duplicating the vectors. To calculate the redundancy for a system with three variables: X,Y,Z, we can use the NIS network twice, as shown in Figure <ref>(b). The first NIS network is to use the intermediate variable Ŷ_X, the dense low-dimensional representation of X with the minimum dimension q, to construct Y. Then, the second NIS network is to use Ẑ_Ŷ_X, the minimal dimensional dense low-dimensional representation of Ŷ_X to construct Z. After these two steps, the Shannon entropy of the intermediate variable of NIS_2: Ẑ_Ŷ_X can approach the redundancy. Thus, the redundancy of the system can be calculated approximately in the following way: Red(X,Y,Z)≈ H(Ẑ_Ŷ_X). To verify that Red(X,Y,Z) calculated in this way can be regarded as the redundancy of the system, we need to prove that Equation <ref> satisfies the property of symmetry for all the permutations of X,Y,Z, i.e., the following proposition: For a system with three random variables X,Y,Z, without losing generality, we suppose that the conditional information satisfy H(X)>H(X\|Y)>0 , H(X)>H(X\|Z)>0, and H(Y)>H(Y\|X)>0, then the redundancy calculated in Equation <ref> is symmetric: Red(X,Y,Z)≈ Red(X,Z,Y). To be noticed that Red(X,Z,Y)≈ H(Ŷ_Ẑ_X) is different from Red(X,Y,Z) in the way that the order of the predictions from X is Z and then Y. The proof of Theorem <ref> is also provided in the appendix. With the calculation of redundancy, we can easily calculate unique and synergistic information atoms. Furthermore, we can extend the method to systems with more variables by just stacking more NIS networks in the similar way as shown in Figure <ref> (b). However, there are two disadvantages to this method, one is that the calculation is inaccurate and requires a large number of training epochs. Second, the numbers of dimensions of all variables must be large enough such that the independent information among the variables can be discarded by dropping out the dimensions. Further studies are needed. To verify that the NIS framework can calculate redundant information, we conducted numerical experiments using Case3 as an example, as Figure<ref> shows, where the mutual information between each pair of variables and the redundant information is 2 bits. In this experiment, variable X_1 is used as the input of NIS1 in the framework, with X_2 predicted as the target Y, and the intermediate variable Ŷ_X is fed into NIS2 to predict X_3. In this experiment, both inputs and targets were expanded to 64 dimensions by direct replication of the original variables, and let the two intermediate variables in the NIS maintain consistent dimensions, both denoted by q . The minimum dimension of Ŷ_X and Ẑ_Ŷ_X are selected by monitoring the changes in the loss curves. From the above results, it can be seen that when q, the dimension of intermediate variable, is relatively large, the entropy of the intermediate variable is quite accurate for mutual information or redundant information. As the q drops below a threshold, the loss signally increases, indicating that the intermediate variable cannot capture all the mutual information and the redundant information. § DISCUSSION §.§ SID and PID As an information decomposition method compatible with PID's conceptual framework, SID has mainly completed two developments on the basis of it: i) The scope of information decomposed is expanded from the mutual information of the source variables and the target variable to the information of all variables in the system; ii) After decomposing all information in the system, SID show the symmetry of information atoms among different variables. Besides, it is worth noting that SID is not based on any existing PID calculation methods, but instead proposes a set of computational properties that should be satisfied. Based on these two changes, the biggest difference between SID and PID is the analysis perspective: PID focuses on the directed pairwise (second-order) relationship between the set of source variables and the target variable, while SID focuses on all relationship among variables in the system, from pairwise to undirected high-order relationship. This exhaustion of relationships enables SID to pay attention to the relationships among the source variables and the high-order symmetric relationships that PID ignores. Take Case <ref> as an example. From the perspective of PID, there are directional redundant, synergistic and unique information from X1 and X2 to the target variable, but the information interaction relationship between X1 and X2 is unknown. Also, it cannot be realized from PID that the synergistic information provided by X1, X2 to the target variable is only a partial understanding of the undirected synergistic effect among the three variables, and this effect also occurs when X1 or X2 as target. In addition, on the basis of being compatible with PID, SID adds more constraints, such as Theorem <ref> <ref> <ref>, so it provides more ways in the calculation of information decomposition. For example, in Proposition <ref>, it can be inferred that the redundant information is zero through the presence of variable pairs with zero mutual information in the variable set, which is not satisfied in some existing PID calculation methods. To sum up, SID extents the analysis scope and reveals several essential natures of information atoms on the basis of being compatible with the PID framework, and greatly expands the application scenarios of information decomposition, which will be discussed in the next few paragraphs. §.§ SID and Higher-order Measurement The holism-versus-reductionism debate persists in modern literature <cit.>. Those who hold a reductionist view believe that any system can be divided into many subsystems, and we can fully understand the entire system by studying the properties of the subsystems and their connections, which is also the research philosophy followed by most disciplines <cit.>. But holism holds that the system should be treated as a whole because the splitting of the system will inevitably lose the understanding of some of its properties <cit.>. This contradiction seems irreconcilable when we don't discuss in detail how to decompose the system. However, the SID offers a perspective that can explain this conflict by accounting for higher-order relationships in the system that are not captured by previous measures. To better divide the different measures, we divide information entropy into first-order measures, which reflect a certain attribute of a single variable. Mutual information and conditional entropy, on the other hand, can be divided into second-order measures, which capture some aspects of pairwise relationships between variables <cit.>. Although among the second-order measurement, information theory's cross-entropy can measure the information shared among multiple variables, it still captures linear superpositions of second-order relationships, which provides limited insight into multivariate interactions. But under the SID framework, redundant, synergistic, and unique information can be regarded as three- or higher-order measures, revealing a new dimension of multivariate relationships that is entirely distinct from the first and second orders and facilitating a deeper comprehension of higher-order system relationships. In the case analysis, the internal structure of Case 1 aligns well with the results of the second-order measures, and can be considered a reducible, decomposable system. Cases 2, 3, and 4, however, have internal structures that cannot be captured by second-order measures and are thus regarded by holism as systems that cannot be decomposed and understood individually. To some extent, SID and the case analysis offer an explanation that bridges the gap between holism and reductionism; that is, some of the system properties that holism insists cannot be understood separately might be explained by higher-order measures or decomposition methods. §.§ Potential Application In addition to philosophical discussions, higher-order measures can also be applied to many fields. A foreseeable application across many domains comes from that SID deepens our understanding of data, measures, and information. In the case studies <ref>, the data contains information about the construction of the four variable systems, but the inner relationship of the system cannot be captured by probability measures or existing information measures. That means the incompleteness of measures may limit our ability to analyze existing systems, even if we have obtained complete data. Therefore, conducting higher-order information measures in the analysis of complex systems may offer valuable insights, especially in the field where traditional information measures fail to capture the relationship among systems. A worth exploring direction the quantitative analysis Higher-order Networks <cit.>. Since SID can provide a data-driven framework for identifying and analyzing of high-order network structures, it may potentially impact the analysis and understanding of complex systems across various domains <cit.>. For example, in studying neural networks and brain connectivity <cit.>, the SID framework can provide further insights into the higher-order information flow between multiple neurons or brain regions, which will allow us to directly generate higher-order network models between neurons through the temporal data of multiple neurons, and use this model to explain the implementation of specific functions; in ecological <cit.>, financial, or social systems, the quantitative characterization of high-order relationships among multiple agents can assist in the development of more accurate models and forecasts, as well as the design of effective control methods. Also, this combination is also a two-way promotion: Since Venn diagrams have limitation on presenting more than three variable systems on a two-dimensional plane, hypergraphs in the field of Higher-order Networks may be a better tool for visualizing SID frameworks. Another field where SID may interact is Causal Science, since it is a field for studying the intrinsic relationships between multiple variables, just like the SID framework. One of the goals of causal science is to search for invariance in the system. We hope that the revealed properties of the system are independent of the distribution of the data. However, the results obtained from SID can vary with changes in the data distribution. Therefore, adopting the methods of causal science to reveal system invariance is one direction in which SID can be improved. In addition, conditional independence plays an important role in causal discovery and causal inference in multivariate systems <cit.>, while in the quantitative calculation of SID, conditional independence also plays a similar role in eliminating the uncertainty of higher-order relations, refer to the calculation method in the first way. Therefore, studying the properties of conditional independence within the framework of SID may provide a bridge between causal science and SID. The benefits of this association are mutual: from the perspective of Pearl Causal Hierarchy theory <cit.>, SID is a research technique that utilizes observational data, which is at the lowest rung of the causal ladder. Investigating whether lifting the approach to higher rungs of causal ladder can yield deeper insights into the system is an area worth exploring, for instance, by incorporating causal graphs (DAGs) into SID methods, etc. Apart from the above fields, SID may also has potential applications. Since information atoms provide a more refined division of information entropy, when the physical meaning of information atoms within the SID framework is revealed, specific information atoms may also become indicators for some optimization or learning problems; The symmetry property of synergistic information in SID may provide inspiration for the information disclosure, an important application of PID in information protection field. In summary, SID, as a progress in the underlying measurement, may play a role in many application scenarios, which is also the focus of our next stage of work. §.§ Limitations and Future Works In addition to the above-mentioned promising progress and expectations, there are still several limitations worthy of attention. The first limitation is the absence of a fully compatible quantitative method for the proposed framework, which restricts the practical application of SID in addressing real-world problems. As we continue to develop and refine the SID framework, it is a priority to develop robust computation methods for calculating SID components and consider how higher-order information measures can be integrated into existing analytical approaches. Furthermore, the existing proofs of framework properties and computational methods have only been established for three-variable systems. Although extending current work to general multivariate systems is not a formidable challenge, it contains many aspects of work, such as how to present the decomposition results of multivariate systems on a two-dimensional plane; how to optimize the calculation algorithm to avoid the exponential calculation cost as the number of variables increases, which will be considered in the next stage of research. For the above-mentioned and any possible problems, we cordially invite other scholars who share an interest in this field to collaborate on addressing the existing challenges of SID and contribute to the model's refinement. § CONCLUSION In this study, we introduced the System Information Decomposition (SID) framework, which offers novel insights for decomposing complex systems and analyzing higher-order relationships while addressing the limitations of existing information decomposition methods.By proving the symmetries of information atoms and connecting them to higher-order relationships, we show that the SID framework can provide insights and advance beyond existing measures in understanding the internal interactions and dynamics of complex systems.Furthermore, we explored the far-reaching implications that SID's unveiling of higher-order measures could have on the philosophical aspects of systems research, higher-order networks, and causal science. Despite the fact that current research on SID still faces challenges in terms of quantitative calculations and multivariate analysis, we believe that continued collaboration and exploration by the scientific community will help overcome these obstacles.In conclusion, the SID framework signifies a promising new direction for investigating complex systems and information decomposition. We anticipate that the SID analysis framework will serve as a valuable tool across an expanding array of fields in the future. § ACKNOWLEDGMENTS We sincerely thank all the non-authors who played a crucial role in its successful completion. Our heartfelt appreciation goes to the Swarma Club, an open academic community for Complex Systems, where the Causal Emergence reading club provided the foundation for the ideas presented in this paper. We are also very grateful to Professor Duguid at UC Berkeley, whose course steadied an author's orientation towards understanding systems from an information perspective, serving as the genesis of this paper. We are also very grateful to the reviewers for their constructive comments, which have improved the theoretical rigor and comprehensiveness of the paper. unsrt § APPENDIX §.§ Case Table \| c c c c \| c c c c \| c c c c \| c c c c \| c c c c \| c c c c \| 4\|c\|X_1 4c\|X_2 4c\|X_3 4c\|X_4 4c\|X_5 4c\|X_6 a b c d a b e f c d e f a c e h a b g h a b i j yellow 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 yellow 0 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 0 1 0 yellow 0 0 0 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 0 1 yellow 0 0 0 0 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0 0 1 pink0 pink0 pink0 pink0 0 1 0 0 pink0 pink0 pink0 pink1 pink0 pink0 pink0 pink1 pink0 pink0 pink0 pink1 0 0 0 1 pink0 pink0 pink0 pink1 0 1 0 1 pink0 pink0 pink0 pink0 pink0 pink0 pink0 pink0 pink0 pink0 pink1 pink1 0 0 0 1 pink0 pink0 pink1 pink0 0 1 1 0 pink0 pink0 pink1 pink1 pink0 pink0 pink1 pink1 pink0 pink0 pink0 pink0 0 0 0 1 pink0 pink0 pink1 pink1 0 1 1 1 pink0 pink0 pink1 pink0 pink0 pink0 pink1 pink0 pink0 pink0 pink1 pink0 0 0 1 0 pink0 pink0 pink0 pink0 1 0 0 0 0 1 0 0 pink0 pink0 pink1 pink0 pink0 pink0 pink1 pink0 0 0 1 0 pink0 pink0 pink0 pink1 1 0 0 1 0 1 0 1 pink0 pink0 pink1 pink1 pink0 pink0 pink0 pink0 0 0 1 0 pink0 pink0 pink1 pink0 1 0 1 0 0 1 1 0 pink0 pink0 pink0 pink0 pink0 pink0 pink1 pink1 0 0 1 0 pink0 pink0 pink1 pink1 1 0 1 1 0 1 1 1 pink0 pink0 pink0 pink1 pink0 pink0 pink0 pink1 0 0 1 1 pink0 pink0 pink0 pink0 1 1 0 0 0 1 0 1 pink0 pink0 pink1 pink1 pink0 pink0 pink1 pink1 0 0 1 1 pink0 pink0 pink0 pink1 1 1 0 1 0 1 0 0 pink0 pink0 pink1 pink0 pink0 pink0 pink0 pink1 0 0 1 1 pink0 pink0 pink1 pink0 1 1 1 0 0 1 1 1 pink0 pink0 pink0 pink1 pink0 pink0 pink1 pink0 0 0 1 1 pink0 pink0 pink1 pink1 1 1 1 1 0 1 1 0 pink0 pink0 pink0 pink0 pink0 pink0 pink0 pink0 0 1 0 0 0 1 0 0 pink0 pink0 pink0 pink0 pink0 pink0 pink0 pink0 0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 1 pink0 pink0 pink0 pink1 pink0 pink0 pink0 pink1 0 1 0 1 0 1 1 0 0 1 0 0 0 1 1 0 pink0 pink0 pink1 pink0 pink0 pink0 pink1 pink0 0 1 1 0 0 1 0 1 0 1 0 0 0 1 1 1 pink0 pink0 pink1 pink1 pink0 pink0 pink1 pink1 0 1 1 1 0 1 1 1 0 1 0 1 0 1 0 0 0 1 0 0 pink0 pink0 pink0 pink1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 pink0 pink0 pink0 pink0 0 1 0 0 0 1 1 1 0 1 0 1 0 1 1 0 0 1 1 0 pink0 pink0 pink1 pink1 0 1 1 1 0 1 0 0 0 1 0 1 0 1 1 1 0 1 1 1 pink0 pink0 pink1 pink0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 0 0 1 0 0 0 0 1 0 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 0 1 1 0 0 1 0 1 0 1 0 1 1 1 0 1 0 0 0 1 1 0 0 1 1 0 1 0 1 0 0 1 1 0 0 1 0 0 0 1 1 1 0 1 1 0 0 1 1 1 1 0 1 1 0 1 1 1 0 1 0 1 0 1 0 1 0 1 1 1 0 1 0 0 1 1 0 0 0 1 0 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 1 1 0 1 0 1 0 0 0 1 1 0 0 1 0 1 0 1 1 1 0 1 1 0 1 1 1 0 0 1 1 1 0 1 0 1 0 1 1 0 0 1 1 1 0 1 1 1 1 1 1 1 0 1 1 0 0 1 0 0 0 1 0 0 1 0 0 0 1 0 0 0 pink0 pink0 pink0 pink0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 0 0 1 0 0 1 pink0 pink0 pink0 pink1 1 0 0 1 1 0 0 1 1 0 1 0 1 0 0 0 1 0 1 0 pink0 pink0 pink1 pink0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 0 0 1 0 1 1 pink0 pink0 pink1 pink1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 0 1 1 0 0 0 0 1 0 0 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 0 1 0 1 1 0 0 0 1 0 0 0 1 0 1 1 1 0 0 1 1 0 1 0 0 1 1 0 1 0 1 1 1 0 1 1 1 0 0 0 1 0 0 1 1 0 1 1 0 1 1 1 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 0 1 0 0 0 1 1 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 0 0 1 1 0 0 1 1 1 0 1 1 0 1 1 1 0 0 0 1 0 1 0 1 0 1 0 1 0 1 0 1 1 1 0 1 0 0 0 1 0 1 1 1 0 1 0 1 0 1 1 1 0 1 1 1 1 1 1 1 0 0 1 1 0 0 1 1 0 1 1 1 0 0 0 1 1 0 0 1 1 0 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 0 1 1 1 0 1 1 1 0 0 1 0 1 0 1 0 0 1 1 0 1 1 1 0 1 0 1 1 1 0 1 1 1 1 1 0 0 1 1 0 1 0 1 0 1 1 1 0 1 1 1 1 1 1 1 1 1 0 1 0 0 0 1 0 0 0 1 1 0 0 1 1 0 0 pink0 pink0 pink0 pink0 1 0 0 0 1 1 0 0 1 1 0 0 1 1 0 0 1 1 0 1 pink0 pink0 pink0 pink1 1 0 0 1 1 1 0 1 1 1 1 0 1 1 0 0 1 1 1 0 pink0 pink0 pink1 pink0 1 0 1 0 1 1 1 0 1 1 0 1 1 1 0 0 1 1 1 1 pink0 pink0 pink1 pink1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 0 0 1 0 0 1 0 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 0 1 0 1 1 0 0 0 1 1 0 0 1 1 1 1 1 1 0 1 1 1 1 0 0 1 1 0 1 0 1 1 1 1 1 1 1 1 0 0 1 1 0 1 1 1 1 1 0 1 1 1 1 0 1 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 0 0 1 0 0 0 1 1 0 0 1 1 1 0 1 1 1 0 1 1 1 0 1 1 0 1 1 0 0 1 1 1 0 1 1 1 1 1 1 1 0 0 1 1 1 0 1 1 1 0 1 0 1 0 1 1 1 0 1 1 0 0 1 1 1 1 1 1 1 0 1 1 1 1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 1 0 0 1 1 0 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 0 0 1 1 1 0 1 1 0 1 1 1 1 1 1 1 1 0 1 1 1 0 1 1 1 1 1 1 0 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 0 0 1 1 0 0 §.§ Proof of Propositions for Neural Information Squeezer Network Here we provide mathematical proves for the two propositions of the neural network framework to calculate mutual information and redundancy. First, we rephrase the proposition 1 and then we give the proof here. Proposition 1: For any random variables X and Y, we can use the framework of Figure <ref>(a) to predict Y by squeezing the information channel of Ŷ_X as the minimum dimension but satisfying Ŷ≈ Y and U∼𝒩(0,I). And we suppose the conditional entropy H(X\|Y)>0 holds, then: H(Ŷ_X)≈ I(X;Y) The whole structure of the alternative NIS network (Figure <ref>(a)) can be regarded as the similar structure as in Ref <cit.>, but the dynamics learner is absent. However, we can understand the dynamic is a fixed identical mapping. In this way, all the conclusions proved in <cit.> can be applied here. Thus, we have: I(X;Y)≈ I(Ŷ_X;Ŷ_X)=H(Ŷ_X) if all the neural networks are well trained. The first equation holds because of Theorem 2 (information bottle-neck) and Theorem 3(mutual information of the model will be closed to the data for a well trained framework) in <cit.>, the second holds when q is minimized such that the information channel of Ŷ_X is squeezed as possible as we can and because of the property of mutual information. Further, because U is an independent Gaussian noise, therefore: H(U)=H(ψ(X))-H(Ŷ_̂X̂)≈ H(X)-I(X;Y)=H(X\|Y) The approximated equation holds because ψ is a bijector which can keep the entropy unchanged, and Equation <ref> holds. Therefore, we can prove proposition 1. To calculate the redundancy for a system with three variables we can further feed the variable of Ŷ_X into another NIS network to predict Z, and narrow down the information channel of the intermediate variable Ẑ_Ŷ_X to get the minimum dimension q^*' for Ẑ_Ŷ_X, then its Shannon entropy can approach the redundancy, and the redundancy satisfies the property of permutation symmetry for all the variables. We can prove the following proposition: Proposition 2: For a system with three random variables X,Y,Z, suppose the conditional information H(X\|Y)>0,H(X\|Z)>0, then the redundancy calculated by Equation <ref> is symmetric, which means: Red(X,Y,Z)≈ Red(X,Z,Y) If we accept the definition of Equation <ref>, then: Red(X,Y,Z)≈ H(Ẑ_Ŷ_X)=H(Ŷ_X)-H(U_Ŷ_X)=H(X)-H(X\|Y)-H(Ŷ_X\|Z), where U_Ŷ_X is the discarded Gaussian noise to predict Ŷ_Z. In another way, we can use X to predict Z, and the intermediate variable Ẑ_X can be used to predict Y, and the intermediate variable Ŷ_Ẑ_X can be used to approximate the redundancy which is denoted as Red(X,Z,Y). Therefore, Red(X,Z,Y)≈ H(X)-H(X\|Z)-H(Ẑ_X\|Y). Because the discarded noise variable U_Ŷ_X in the process of predicting Y by X is independent on all the variables, therefore: H(U_Ŷ_X)=H(U_Ŷ_X\|Z)=H(U_Ŷ_X\|Y,Z)=H(X\|Y,Z), Similarly, the discarded noise variable U_Ẑ_Ŷ_X in the process of predicting Z by Ŷ_X is also independent on all the other variables, and ψ(X) is the combination of U_Ŷ_X and Ŷ_X, thus: H(X\|Y,Z)=H(U_Ŷ_X\|Z)=H(X\|Z)-H(Ŷ_X\|Z). In the same way, we can obtain: H(X\|Z,Y)=H(U_Ẑ_X\|Y)=H(X\|Y)-H(Ẑ_X\|Y). Because H(X\|Y,Z)=H(X\|Z)-H(Ŷ_X\|Z)=H(X\|Y,Z)=H(X\|Y)-H(Ẑ_X\|Y), therefore: H(X\|Z)+H(Ẑ_X\|Y)=H(X\|Y)+H(Ŷ_X\|Z) and the Equation <ref> and <ref> lead to: Red(X,Y,Z)=Red(X,Z,Y). This equation is general for all the permutations of X,Y and Z, thus, the redundancy defined in the neural network NIS satisfies permutation symmetry.
http://arxiv.org/abs/2306.09528v3	20230615221532	Density distributions of tune shifts from space charge or beam-beam interactions in Gaussian bunches	[ "Tanaji Sen" ]	physics.acc-ph	[ "physics.acc-ph" ]	equationsection
http://arxiv.org/abs/2306.04113v2	20230607023809	Planar, infinite, semidistributive lattices	[ "George Grätzer" ]	math.RA	[ "math.RA", "06" ]	Planar, infinite, semidistributive lattice]Planar, infinite, semidistributive lattices G. Grätzer]George Grätzer [email protected] http://server.maths.umanitoba.ca/homepages/gratzer/ University of Manitoba An FN lattice F is a simple, infinite, semidistributive lattice. Its existence was recently proved by R. Freese and J. B. Nation. Let 𝖡_n denote the Boolean lattice with n atoms. For a lattice K, let K^+ denote K with a new unit adjoined. We prove that the finite distributive lattices: 𝖡_0^+, 𝖡_1^+,𝖡_2^+, … can be represented as congruence lattices of infinite semidistributive lattices. The case n = 0 is the Freese-Nation result, which is utilized in the proof. [ [ July 31, 2023 ================= § INTRODUCTION An FN lattice F is a simple, infinite, semidistributive lattice. Its existence was proved in R. Freese and J. B. Nation <cit.>. Let n denote the Boolean lattice with n atoms. For a lattice K, let K^+ denote K with a new unit adjoined and let K_+ denote K with a new zero adjoined. There is an infinite semidistributive lattice L_i such that the congruence lattice of i is isomorphic to i^+ for n = 0,1, 2,…. For n = 0, this statement is the recent result of R. Freese and J. B. Nation <cit.>. Note that Theorem <ref> for n = 1 claims that there is an infinite semidistributive lattices with the three-element as the congruence lattice. There is an infinite semidistributive lattice L_i such that the congruence lattice of i is isomorphic to i^++ for i = 0,1, 2, …. There is an infinite semidistributive lattice L_i such that the congruence lattice of i is isomorphic to 2 ∔ i for i = 0,1, 2, …. §.§ Basic concepts and notation. For a lattice K, we denote by K^+ and K_+ the lattice we obtain by adding a new unit and a new zero, respectively. A lattice L without bounds is a lattice with neither zero nor one. Let K and L be lattices. We denote by K + L the ordinal sum of K and L (L on top of K). If K has a unit and L has a zero, let K ∔ L denote the glued sum of K and L, that is, the ordinal sum of K and L, with the unit of K and the zero go L identified. The basic concepts and notation not defined in this note are in Part I of the book <cit.> (freely available for download). § SEMIDISTRIBUTIVITY A lattice L is meet-semidistributive, if the following implication holds (see Figure <ref>): w = x y = x z implies that w = x (y z) for x,y,z,w ∈ L. SD_ The following statement is well-known and needs no proof. Let L be a meet-semidistributive L with zero and a ∈ L. Then the set P_a = x ∈ La x = 0 the set of semi-complements of the element ais a prime ideal. Conversely, in a finite lattice L, if this property holds in every principal filter, then L is meet-semidistributive. Dually, L is join-semidistributive, if the following implication holds: u = x y = x z implies that u = x (y z) for x,y,z,u ∈ L.SD_ A lattice L is semidistributive if it is both meet-semidistributive and join-semidistributive. § DOUBLING AN ELEMENT Let L be a lattice and let u ∈ L. Define L[u] = (L - u) u_0, u_1 (disjoint union). We order the set L[u] (see my paper <cit.>) by the relation ≤_u as follows: For x,y ∈ L, * let (u_0,u_1, ≤_u) be isomorphic to the two-element chain; * let x ≤_u y be equivalent to x ≤ y for x,y u_0,u_1; * let u_i ≤_u y be equivalent to u ≤ y for i = 1,2; * let x ≤_u u_i be equivalent to x ≤ u for i = 1,2. The following statements hold: * The set L[u] ordered by ≤_u is an ordered set; * the ordered set L[u] is a lattice; * the element u_0 is meet-irreducible, the element u_1 is join-irreducible; moreover, u_0 ≺ u_1 in L[u]; * for u a,b,c, the join if a b = c in L is the same as the join a b = c in L[u] and dually; * for u ≠ a, the meet u_0 a in L[u] is the same as the meet u a in L and dually; * the congruence = u_0, u_1 on L[u] has only one nontrivial class, u_0,u_1; moreover, L[u] / L. These statements are trivial; we leave the details to the reader. See Figure <ref> for two illustrations. If L is a semidistributive lattice, then so is L[u]. Let x,y,z,w ∈ L and let (SD_) hold in L. If u x,y,z,w, then (SD_) holds by Lemma <ref>(iv). Let us assume that (SD_) fails for x,y,z,w in L[u] and let v = u (y z). So our assumption is that v > w. Let x,y,z,w ∈ L and let (SD_) hold. If u x,y,z,w, then (SD_) holds by Lemma <ref>(iv). Let us assume that (SD_) fails for x,y,z,w in L[u] and let v = u (y z). So we assume that v > w. By Lemma <ref>(vi), the map x → x/ is one-to-one on the set x,y,z,v,w of u_o,u_1 ∈x,y,z,v,w. In the first case, by Lemma <ref>(iv) and (SD_), we obtain that v = w, contradicting the assumption that v > w. In the second case, from Lemma <ref>(iv), we see that u_0 is meet-reducible, contradicting Lemma <ref>(iii). By duality, we are done. We define the congruence = u_0, u_1 on the lattice L[u]. The congruence is an atom in the congruence lattice, L[u], of the lattice L[u]. Since has only one nontrivial congruence class, namely, u_0,u_1, it is obviously at atom in L[u]. We can start with a finite antichain U L and define L[U] = (L - u) u_0, u_1u ∈ U (disjoint unions). We define ≤_U analogously. The obvious analogue of Lemma <ref> holds. In the lattice L[U], define the congruence _u = u_0, u_1 for u ∈ U. Then Lemma <ref> holds in L[U] for all _u. § REPRESENTING THE THREE-ELEMENT CHAIN In Section <ref>, we will utilize two constructions to represent the three-element chain as the congruence lattice of an infinite semidistributive lattice. Let F be an FN lattice. Define the lattice F^+ as the lattice F with a new zero adjoined. Then F^+ is an infinite semidistributive lattice and the congruence lattice of F^+ is the three-element chain. Obviously, the lattice F^+ is an infinite semidistributive lattice. Indeed, the only nontrivial congruence of the lattice F^+ is the congruence with one nontrivial congruence class, namely, F. Let F be an FN lattice and let u ∈ F. We double the element u and claim that F[u] is an infinite semidistributive lattice and the congruence lattice of F[u] is the three-element chain. By Lemma <ref>, the lattice F[u] is an infinite semidistributive lattice and by Lemma <ref>, the lattice F[u] has only one nontrivial congruence, namely, , so the congruence lattice of F[u] is the three-element chain. § PROVING THEOREM <REF> We define 0 as F. Since 0 is the one-element chain, so 0^+ is the two-element chain. To verify the first statement of Theorem <ref> for n = 0, we have to prove that the congruence lattice of 0 is the two-element chain, that is, F is simple, which holds by definition. Next we verify the first statement of Theorem <ref> for n > 0. We prove the following, slightly stronger, result. There is an infinite semidistributive lattice n without bounds whose congruence lattice is isomorphic to n^+ for n > 0. First, we note that the lattice F has antichain of any finite size, for instance, contained in the countably infinite antichain b_0, b_1, … using the notation in R. Freese and J. B. Nation <cit.>. We start with an antichain U F of n > 0 elements and define n = F[U]. For every V U, define [V] = _vv ∈ V, a congruence of n = F[U]. The congruences [V]V U form a sublattice C isomorphic to n of F[U], the congruence lattice of F[U]. The unit element of C is [U] and F[U]/[U] F. The zero element of C is [] and [] = _F[U]. It follows that the congruence lattice of F[U] consists of _F[U] and C, so it is isomorphic to n^+, that is n with a new unit adjoined. We have obtained a stronger form of Theorem <ref>. There is an infinite semidistributive lattices without bounds i such that the congruence lattice of i is isomorphic to i^+ for n = 0,1, 2, …. We can easily describe the lattice i. Let V_i = b_0, b_1, …, b_i for i = 0,1, 2,…. Then V_0 = b_0, V_1 = b_0, b_1, V_2 = b_0, b_1, b_2, …. The set V_i has i+1 elements. Then i = F[V_i]. Observe that Corollary <ref> follows from Theorem <ref> and Lemma <ref>. To verify Corollary <ref>, we start with L_0 = F^+_+. We obtain L_i by replacing F with F[U] as in the proof of Claim <ref>. 99 FN21 R. Freese and J. B. Nation, A simple semidistributive lattice. Internat. J. Algebra Comput. 31 (2021), 219–224. gG74 G. Grätzer, A property of transferable lattices. Proc. Amer. Math. Soc. 43 (1974), 269–271. LTF G. Grätzer, Lattice Theory: Foundation. Birkhäuser Verlag, Basel, 2011. CFL3 G. Grätzer, The Congruences of a Finite Lattice, A Proof-by-Picture Approach, third edition. Birkhäuser, 2023. Part I, free download arXiv:2104.06539
http://arxiv.org/abs/2306.06331v2	20230610020102	Investigating the Effectiveness of ChatGPT in Mathematical Reasoning and Problem Solving: Evidence from the Vietnamese National High School Graduation Examination	[ "Xuan-Quy Dao", "Ngoc-Bich Le" ]	cs.CL	[ "cs.CL", "cs.LG" ]	A Face-Upwinded Spectral Element Method [ July 31, 2023 ======================================== This study offers a complete analysis of ChatGPT's mathematics abilities in responding to multiple-choice questions for the Vietnamese National High School Graduation Examination (VNHSGE) on a range of subjects and difficulty levels. The dataset included 250 questions divided into four levels: knowledge (K), comprehension (C), application (A), and high application (H), and it included ten themes that covered diverse mathematical concepts. The outcomes demonstrate that ChatGPT's performance varies depending on the difficulty level and subject. It performed best on questions at Level (K), with an accuracy rate of 83%; but, as the difficulty level rose, it scored poorly, with an accuracy rate of 10%. The study has also shown that ChatGPT significantly succeeds in providing responses to questions on subjects including exponential and logarithmic functions, geometric progression, and arithmetic progression. The study found that ChatGPT had difficulty correctly answering questions on topics including derivatives and applications, spatial geometry, and Oxyz spatial calculus. Additionally, this study contrasted ChatGPT outcomes with Vietnamese students in VNHSGE and in other math competitions. ChatGPT dominated in the SAT Math competition with a success rate of 70%, followed by VNHSGE mathematics (58.8%). However, its success rates were lower on other exams, such as AP Statistics, the GRE Quantitative, AMC 10, AMC 12, and AP Calculus BC. These results suggest that ChatGPT has the potential to be an effective teaching tool for mathematics, but more work is needed to enhance its handling of graphical data and address the challenges presented by questions that are getting more challenging. § INTRODUCTION In recent years, artificial intelligence (AI) has drawn a lot of interest and been extensively discussed. AI represents a creative and imaginative advancement in many fields, including mathematics instruction. The current work analyzes a number of studies that looked into the application of AI in a number of contexts, including medical <cit.>, education <cit.>, <cit.>, <cit.>, <cit.> and pandemics <cit.>. The role of educators should not be replaced by AI in the educational process; rather, AI should be used to enhance it <cit.>. The implementation of AI in education faces a variety of challenges despite the potential benefits. In order to improve student learning outcomes and get around obstacles like a shortage of qualified teachers and resources <cit.>, <cit.>, using AI in education is becoming more popular <cit.>, <cit.>,<cit.>, <cit.>, <cit.>. According to research, AI is crucial for guaranteeing sustainable societal growth and can boost student accomplishment. Despite the fact that literature evaluations have been undertaken on the use of AI in education across a variety of subjects, little is known about how AI especially affects mathematics education, including its nature, target grade levels, and study methodologies. Achievement in mathematics is important for kids' academic progress, future employment prospects, and social growth, and it is connected to civil rights issues <cit.>, <cit.>. Therefore, preparing students with math skills and knowledge is crucial for adapting to a society that is changing quickly and ensuring sustainable development. A comprehensive literature review was undertaken by bin Mohamed et al. <cit.> to provide an overview of AI in mathematics education for students at all levels of education, one of the few studies on the effects of AI on mathematics education. This review contributes to the discussion about enhancing teaching and learning in mathematics education through the use of AI. In a different study, Hwang <cit.> used 21 empirical studies with 30 independent samples to conduct a meta-analysis to assess the overall impact of AI on elementary children' mathematical achievement. The results of the study revealed that AI had a negligible impact on primary kids' mathematical proficiency. The results showed that grade level and topic of mathematics learning variables considerably reduced the impact of AI on mathematical achievement. Other moderator variables' effects, however, were found to be insignificant. Based on the findings, this study offers both practical and theoretical insights that can help guide the appropriate application of AI in the teaching of mathematics to elementary school children. It is evident that additional meta-analysis is required to determine whether AI offers novel opportunities for mathematics learning <cit.>, <cit.>. Studies examining how moderating variables affect the connection between them are also necessary. The area of education could undergo a revolution owing to recent advancements in natural language processing (NLP), which have led to the development of increasingly complex language models like GPT-3. Due to its capacity to produce natural language answers to a variety of questions, ChatGPT, a large language model based on the GPT architecture, has attracted a great deal of interest in the educational community. In recent years, there has been an increase in interest in using chatbots, particularly ChatGPT, in education. Several research have investigated the possible advantages, issues, and difficulties of this practice. Halaweh <cit.> addressed educators' worries about the adoption of ChatGPT into educational contexts, arguing for its inclusion and offering guidelines for safe implementation. In a research on the potential effects of ChatGPT on education, Zhai <cit.> recommended changing instructional objectives to emphasize students' creativity and critical thinking. In their discussion of the possible advantages and difficulties of employing large language models in educational contexts, Kasneci et al. <cit.> placed emphasis on the requirement for competences and literacies to comprehend the technology and its constraints. The effectiveness of ChatGPT in assessments has also been examined in studies. (Kortemeyer, 2023) discovered that ChatGPT displayed several misconceptions and mistakes typical of a beginner learner yet would only about pass a calculus-based physics course. Katz et al. <cit.> conducted an experimental evaluation of GPT-4's zero-shot performance on the complete Uniform Bar Examination (UBE), demonstrating that it performed better than human test-takers and previous models on the Multistate Bar Examination (MBE), which is a multiple-choice test. Gilson et al. <cit.> assessed ChatGPT's performance on multiple-choice questions related to the USMLE Step 1 and Step 2 tests and discovered that its performance is comparable to a third-year medical student. These studies show the potential of chatbots to enhance education and legal services, but they also raise questions about their accuracy and dependability in assessments. Through the simulation of various use cases, Frieder et al. <cit.> conducted a study to evaluate the mathematical proficiency of ChatGPT and determine its potential as a helpful assistant to professional mathematicians. The outcomes revealed that ChatGPT participants' mathematical skills were significantly worse to those of the typical mathematics graduate student. However, it is critical to also assess ChatGPT's mathematical prowess at lower levels, such as high school. This evaluation would shed light on ChatGPT's capacity to support teachers and students in this level of mathematics learning. NLP has received a lot of attention recently as a vital study area. Chatbots, one of its implementations, have drawn attention for its capacity to mimic human interactions. While current research highlights the potential of chatbots to support students' learning in a variety of educational settings, their effectiveness in completing particular subjects, like mathematics, in high-stakes exams has received little attention. By evaluating ChatGPT's ability to complete mathematical challenges and pass the VNHSGE exam, this study aims to fill this knowledge gap in the literature. This will be achieved by contrasting ChatGPT's performance in our test with that of earlier assessments made by the OpenAI team <cit.>. This study intends to advance knowledge of the benefits of utilizing cutting-edge technology in education to enhance student results by studying the efficiency of AI-powered chatbots in assisting students in high-stakes tests. The results of this study may be especially helpful to educators and policymakers who want to use AI to enhance learning outcomes. In this article, we concentrate on examining ChatGPT's capability for resolving mathematical issues within the framework of the VNHSGE exam. The Vietnamese educational system places a high value on mathematics, which is frequently seen as a key predictor of student achievement. The promise of AI-powered tools for enhancing mathematics education can therefore be shown by analyzing ChatGPT's mathematical capabilities in the context of the VNHSGE mathematics dataset <cit.>. Our work seeks to evaluate ChatGPT's performance on mathematical inquiries in the VNHSGE exam critically and explore the prospects of deploying AI-powered tools to assist enhance mathematics teaching. § OBJECTIVES AND METHODOLOGY §.§ Objectives This study aims to offer a thorough analysis of ChatGPT's mathematical skills in relation to the mathematics evaluation for the VNHSGE exam. We seek to shed light on the possibilities of AI tools for educational support and investigate their role in changing the educational landscape by evaluating ChatGPT's performance in these areas. This study also attempts to illustrate ChatGPT's shortcomings when dealing with questions that differ from those present in the VNHSGE exam in terms of both structure and level of difficulty. §.§ Scope and Limitation By analyzing ChatGPT's responses to questions from the VNHSGE exam that involve mathematics, this study seeks to assess ChatGPT's mathematical capabilities. Our objective is to assess how well ChatGPT responds to these questions and to provide details on ChatGPT's potential in the context of Vietnamese education. It's important to remember that our evaluations are restricted to the unique the VNHSGE exam structure. The results of ChatGPT are incapable of being extrapolated to tests with other numbers or difficulty levels. This restriction highlights the need for caution when extrapolating from our results and making generalizations regarding ChatGPT's potential uses in educational contexts outside the scope of this study. §.§ Methods In this study, we evaluated the capability of the ChatGPT model to answer mathematical problems in the VNHSGE mathematics dataset <cit.>. Using a sequence-to-sequence methodology, the model was developed using a dataset of math problems after being trained on a sizable corpus of text. The mathematical problem was the model's input, and the solution was its output. We compared the produced answers from ChatGPT with the accurate responses given in the exam papers in order to evaluate its performance. We created a detailed process with many phases to carry out this examination. In the beginning, we gathered information from official test papers made available by the Vietnamese Ministry of Education and Training. We chose these questions as an accurate representation of the actual exam because they were all taken from high school mathematics exams. The data needs to be formatted in a way that ChatGPT could interpret afterward. The exam questions contained mathematical equations and symbols, which we transformed into LaTeX format to display in a uniform manner. The exam questions were then transformed from their LaTeX format into JSON (JavaScript Object Notation), a lightweight data transfer standard that is frequently used in web applications. We were able to give the questions to the pre-trained ChatGPT model and get its generated answers after formatting the data in a way that ChatGPT could understand. Finally, we determined ChatGPT's performance score by comparing the generated answers to the accurate responses provided by the exam papers. Overall, this methodology allowed us to thoroughly evaluate ChatGPT's capacity to answer mathematical problems in the VNHSGE exam. By outlining the specific procedures, we took, we intend to offer a framework for future research examining the efficiency of chatbots powered by AI in assisting students in demanding exams. § DATASET The VNHSGE mathematics test dataset for the academic years 2019–2023 was used in this investigation. 250 multiple-choice math questions covering a range of subjects, such as algebra, geometry, and calculus, make up the dataset. Based on Bloom's Taxonomy, these questions were divided into four difficulty levels: K (knowledge), C (comprehension), A (application), and H (high application). The Vietnamese Ministry of Education and Training publicly released the dataset, which is frequently used to evaluate students' mathematical aptitude. §.§ Question Levels Different levels of competence in comprehending and using mathematical concepts are necessary for solving mathematical problems. The dataset includes a range of levels of difficulty, from K-based questions that evaluate fundamental understanding to high-application questions that assess the capacity to analyze and synthesize information in order to solve complex problems. This allows for a thorough evaluation of ChatGPT's mathematical problem-solving abilities. Based on the sort of cognitive activity and verbs used in responding to the questions, the four levels of complexity—K, C, A and H—were established. We can learn more about ChatGPT's strengths and drawbacks when we evaluate its performance on a range of mathematical problems of varying degrees of difficulty. §.§ Question Topics The dataset provides a thorough assessment of ChatGPT participants' mathematical knowledge and abilities by encompassing a wide range of mathematical topics. M11A: Combinations and Probability; M11B: Number Series (Arithmetic progression, Geometric progression); M11C: Spatial Geometry; M12A: Derivatives and Applications; M12B: Exponential and Logarithmic Functions; M12C: Primitives and Integrals; M12D: Complex Numbers; M12E: Polyhedrons; M12F: Rotating Circle Block; and M12G: Oxyz Spatial Calculus. These topics were included to ensure a thorough evaluation of the ChatGPT's mathematical abilities by testing its understanding, application, analysis, and evaluation of mathematical concepts and principles. Researchers can learn about ChatGPT's strengths and limitations and identify opportunities for development by analyzing how well it performs across all of these issues. §.§ Knowledge matrix A key element of assessment systems that gives a thorough breakdown of the criteria and content to be evaluated is the question matrix. To create and compile questions for various tests and examinations, this technical design was deployed. It acts as a reference for test designers in choosing appropriate questions that appropriately reflect the educational and learning objectives of the assessment system. By ensuring that the test questions assess the desired knowledge, skills, and abilities of the examiners and that they are aligned with the learning outcomes, the question matrix aids in assuring the validity, reliability, and fairness of the assessment. As a result, the question matrix is an essential tool for creating high-quality tests that accurately assess student achievement and guide educational decisions. A knowledge matrix, which classifies each question according to its specific level and topic, can effectively depict the structure and substance of an exam. Administrators of exams and educators can gain a lot from employing a knowledge matrix since it can be used to determine where students' knowledge is strong and weak and to build focused interventions to boost performance. Additionally, the knowledge matrix makes sure that the exam covers a wide range of subjects and levels of difficulty, providing a thorough evaluation of student's knowledge and abilities. The usage of a knowledge matrix ensures that exam results accurately reflect students' abilities and accomplishments by increasing the validity and reliability of exam scores. The knowledge matrix for the VNHSGE exam in Mathematics for the years 2019-2023 is displayed in Table <ref>. We have a distribution of questions based on the topics and degree of difficulty. We can identify a specified number of question levels pertinent to the issue based on the distribution. The distribution of questions by level is shown in Figure 1 as follows: knowlegde 103 (41%), comprehension 77 (31%), application 41 (16%), and high application 29 (12%). M11A -10 (4%), M11B - 5 (2%), M12C - 8 (3%), M12A - 57 (23%), M12B - 39 (16%), M12C - 33 (13%), M12D - 26(10 %), M12E - 17(7 %), M12F - 14(6 %), and M12G - 41(16 %) are the breakdown of questions by type. Generally, the knowledge matrix offers a thorough overview of the exam's structure and content, making it possible to assess and enhance students' mathematical understanding and problem-solving skills. The exam framework does not have a uniform allocation of questions. There are some topics and problems that just call for knowledge and comprehension, not a high-level application. A majority of the questions-roughly 70 %-are focused on knowledge and comprehension. In addition, only 10 % of the questions concentrate on information from the 11th grade, while 90 % are at the 12th grade level. Questions on subjects like M12A, M12B, M12G, and M12C are plentiful. It should be emphasized, nonetheless, that the questions in topic M11B only call for a certain level of expertise. The distribution of question levels and topics as a percentage is shown in Figure <ref>. The topic M12A, which comprises 23% of the total questions, is distributed as follows: 9.60% at the K level, 6.00% at the C level, 2.40% at the A level, and 4.80% at the H level. We may analyze the performance of the student or ChatGPT specifically by level and topic based on the thorough distribution by level and topic. A comprehensive grasp of the distribution of questions across various levels and topics is made possible by this graphic portrayal. Insights into the areas where test takers are anticipated to perform well and those that could need more improvement can be obtained by examining Figure <ref>. It offers useful data that teachers and curriculum designers may use to better understand the strengths and weaknesses of their students and the efficiency of their instructional strategies. Overall, Table <ref> and Figure <ref> together give a thorough breakdown of the distribution of the questions and are an effective tool for educational study and practice. §.§ Prompt and Answer When asking questions to ChatGPT, we can receive answers in different formats. However, to make the process of handling results easier and ensure consistency, we kindly ask ChatGPT to provide replies in a specific structure. Figure <ref> and Table <ref> demonstrate an example of the required structure for ChatGPT responses. This table demonstrates the adaptability and versatility of the model by giving instances of how ChatGPT can respond to different cues in various formats. When we receive automatic responses, we utilize Word format on https://chat.openai.com/ but "OpenAI API" uses Json format. The table is divided into three columns: the first column reveals the prompt's format; the second column displays the prompt itself; and the third column provides the response that ChatGPT created. This table demonstrates the adaptability and versatility of the model by giving instances of how ChatGPT can respond to different prompts in various formats. When we receive automatic responses, we utilize Word format on https://chat.openai.com/ but "OpenAI API" uses Json format. The table shows how ChatGPT can provide responses to prompts in many formats, which is a useful feature for many applications. § RESULTS The VNHSGE dataset's mathematics exam is intended to evaluate ChatGPT's mathematical knowledge and problem-solving skills. The test consists of 250 questions in the VNHSGE mathematics dataset <cit.>, divided into ten topics (M11A, M11B, M11C, M12A-M12G) and four degrees of complexity (knowledge, comprehension, application, and high application). The exam aims to provide a thorough assessment of the mathematical knowledge and abilities of ChatGPT candidates by evaluating a wide range of topics. The questions are made to test ChatGPT's understanding, application, evaluation, and analysis of mathematical concepts and principles, ensuring a thorough evaluation of its mathematical skills. This rigorous assessment makes sure that ChatGPT's math-solving abilities are accurately measured and can be used to guide future NLP advances. §.§ ChatGPT score The results of the mathematics test taken by ChatGPT from 2019 to 2023 are shown in Table <ref> <cit.>, together with the number of right answers and corresponding score for each year. A score of 5 represents an average performance on a scale from 0 to 10. These outcomes show that ChatGPT performed better than average on the math test. The ChatGPT ranges from 0 to 7 points. This outcome can be attributed to ChatGPT's propensity to accurately respond to a significant portion of questions at the knowledge and comprehension levels, which make up 70% of the total questions. The middle-range ChatGPT score is clear from the fact that only a small number of questions at both the application and high application levels were correctly answered. Further clarification on this point will be provided in the upcoming sections. §.§ ChatGPT’s performance in order question Figure <ref> illustrates the average number of right responses given by ChatGPT for each question across all years. The data exhibits that the possibility of ChatGPT providing an accurate response reduces as the question's level of complexity rises. The ChatGPT correct answer rate is greater than 50% for questions 1 through 35, which are K and C-level questions. The accurate answer rate of ChatGPT, however, decreases below 50% for questions 35 to 50, demonstrating a decline proportional to the pattern of the questions. The graph demonstrates that as question difficulty grows, ChatGPT's accuracy declines. Given that questions at higher knowledge levels tend to be more complicated and need in-depth comprehension and problem-solving abilities, this pattern is to be expected. The findings imply that the difficulty and complexity of the questions have a significant impact on ChatGPT's capacity to provide accurate answers. This discovery has significant implications for the design of AI systems for educational applications since it emphasizes the need for more sophisticated and advanced models that are capable of handling difficult and challenging tasks. Additionally, it suggests that more investigation is required to identify the specific factors that influence ChatGPT's performance on various question types. This understanding can guide the creation of more efficient AI-based educational tools and interventions. The analysis of the model's performance in relation to the order of the questions can be beneficial in a number of ways, in addition to determining ChatGPT's accuracy in responding to the questions. In the first place, it can assist teachers in comprehending how the order of questions impacts ChatGPT's capacity to solve them and in optimizing the question sequence to produce a more useful evaluation. This is crucial because as an exam goes on, students may become cognitively fatigued, which may affect how well they perform on subsequent questions. Teachers can simulate how students could perform under various circumstances and create exams that are better suited to accurately assess their knowledge and abilities by studying ChatGPT's performance with regard to the configuration of questions. Understanding how the question sequence impacts ChatGPT's performance can also assist identify possible weak points in the model, which can guide future model improvements. §.§ ChatGPT’s performance in levels and topics According to the degree of difficulty, Table <ref> shows the percentage of accurate responses using ChatGPT for each year. The average percentage of right answers for K-level questions given by ChatGPT ranged from 90% in 2022 to 75% in 2023. The highest percentage of accurate answers for C-level questions was 75.22% in 2022, and the lowest was 40% in 2023. The highest and lowest percentages of right responses for questions at the A-level were 55.56% and 0%, respectively. For the years 2021, 2022, and 2023, ChatGPT did not offer any accurate responses to H-type questions. The highest percentages for the remaining years were 16.67% and 22.22%. These results show how ChatGPT has performed over time at various levels of difficulty. level 75.00, 90.00, 81.82, 89.47, 85.71 40.00, 72.22, 62.50, 62.50, 58.82 25.00, 0.00, 28.57, 55.56, 20.00 0.00, 0.00, 0.00, 16.67, 22.22 In accordance with the questions' degree of complexity, Figure <ref> depicts ChatGPT's accuracy from 2019 to 2023. For queries classified as type K, it indicates that ChatGPT attained an accuracy rate ranging from 75% to 90%, with a small standard deviation indicating a high rate of consistency. This demonstrates ChatGPT's exceptional skill in answering questions that are not too challenging. For questions of type C, the accuracy rate falls to 40-72%, demonstrating that ChatGPT performs less effectively when answering questions of intermediate difficulty. Type A questions show the greatest diversity in ChatGPT's accuracy rate, with correct answers ranging from 0% to 57% and the highest standard deviation. This shows that ChatGPT performs the least consistently when attempting to answer challenging type-A questions. The accuracy of ChatGPT's answers to the most difficult type H questions ranges from 0 to 22%, which is a quite low percentage. Based on these findings, it appears that ChatGPT performs better when answering questions that are easier to answer than those that are more complex. The percentage of correct responses offered by ChatGPT for different topics from 2019 to 2023 is depicted in Table <ref>. ChatGPT provided 100% accurate responses for all years for the topic M11B. Additionally, ChatGPT provided 100% accurate responses for topics M11A, M12D, M12F, and M11C for a number of years. In 2022, ChatGPT's accuracy rate for the M11C topic was 0%. With the exception of the M12A topic on graphs and diagrams, ChatGPT's accuracy rate for the other topics was rather high. topic 50, 0, 50, 100, 100, 100, 100, 100, 50, 50, 100, 100, 30, 50, 20, 46.1538461538462, 75, 75, 75, 62.5, 57.1428571428571, 71.4285714285714, 71.4285714285714, 42.8571428571429, 83.3333333333333, 66.6666666666667, 66.6666666666667, 100, 33.3333333333333, 66.6666666666667, 66.6666666666667, 66.6666666666667, 50, 66.6666666666667, 66.6666666666667, 100, 44.4444444444444, 62.5, 62.5, 75, Recently, a lot of attention has been paid to how well AI models perform, particularly when answering questions. Figure <ref> provides an informative examination of ChatGPT's accuracy in responding to various query kinds over the period of 2019–2023. The findings show that ChatGPT's accuracy varies depending on the type of question being answered. In particular, ChatGPT answered M11C questions with an accuracy rate of 0–100%, M11B questions with 100%, M11A questions with 50–100%, M12A questions with 20–50%, M12B questions with 62–75%, M12C questions with 42–80%, M12D questions with 40–100%, M12E questions with 33–80%, M12F questions with 33–100%, and M12G questions with 44–75%. The level of difficulty of the questions, the number and quality of training data, and the model's internal architecture are just a few of the variables that can affect how well ChatGPT performs while answering these questions. Therefore, comprehending the variations in performance across various question types can offer insights into the model's advantages and disadvantages as well as guide future developments to enhance its performance. A thorough analysis of ChatGPT's performance on various levels and topics is presented in Table <ref>. First, consider the difficulty of the questions; ChatGPT was able to accurately respond to 85 of 103 questions at level K. Out of 77 questions at level C, 48 were correctly answered by ChatGPT. Only 12 of the 49 questions in level A could be correctly answered by ChatGPT, while only 3 of the 29 questions in level H could be answered by ChatGPT. Second, ChatGPT's performance varied depending on the type of question. For M11A, M11B, M11C, and M12A, ChatGPT correctly answered 7 out of 10 questions, 5 out of 5 questions, 4 out of 8 questions, and 20 out of 57 questions, respectively. For M12B, M12C, M12D, M12E, M12F, and M12G, respectively, ChatGPT correctly answered 28 out of 39 questions, 21 out of 33 questions, 18 out of 26 questions, 11 out of 16 questions, 9 out of 15 questions, and 24 out of 41 questions. It is crucial to keep in mind that certain topics only contain questions at the knowledge and comprehension levels that are quite simple to respond to, and ChatGPT did well on these because of its aptitude for natural language creation. Therefore, ChatGPT's high scores on these topics do not necessarily reflect its understanding of mathematics or capacity for reasoning. Furthermore, it is challenging to give a precise rating solely based on topics because some topics have a preponderance of knowledge-level questions. Additionally, due to a lack of information, ChatGPT might not be able to respond to some knowledge-level questions. As an illustration, many questions in the topic of derivatives and applications (M12A) call for the interpretation of graphs or variable tables, which ChatGPT is unable to read from photos at this time. As a result, ChatGPT might be unable to respond to some inquiries that require an understanding of this subject. These findings show that ChatGPT has diverse degrees of competence in various math specialties. In general, ChatGPT performed well for some question types but poorly for others. These results collectively imply that while ChatGPT might be a valuable tool for addressing math-related queries, its accuracy varies between topics and levels. As a result, significant advancements are required to increase ChatGPT's math question-answering ability, especially in more difficult math subfields. Figure <ref> presents a more thorough breakdown of the percentage of right responses by difficulty level and topic so that users of ChatGPT can better understand how well it performs. For instance, in the case of M12G, ChatGPT attained a high accuracy rate of 76% for questions at the K level, followed by 67% for questions at the C level, 25% for questions at the A level, and 0% for questions at the H level. Notably, ChatGPT achieved a flawless accuracy rate of 100% when responding to questions at the K level for M11A, M11B, M11C, M12B, M12D, and M12F. Additionally, ChatGPT was able to correctly respond to H-level questions for M12A (Derivatives and Applications) and M12E (Polyhedron), demonstrating its competency in handling more difficult questions in these topics. These results indicate that the topic and difficulty level have an impact on ChatGPT's accuracy, and that ChatGPT performs differently depending on how these two factors are coupled. These findings suggest that these particular issues contain linguistic nuances or complexities that the model was unable to adequately capture. This result highlights the need for ongoing study to enhance the model's ability to handle a variety of linguistic complexities. This shortcoming might be brought on by the lack of training data or the intrinsic intricacy of the queries at this level. By evaluating how well language models—like ChatGPT—can respond to questions of varying degrees of cognitive complexity, one can assess the performance of these models. Knowledge, understanding, application, and strong application are the four categories for the levels of cognitive difficulty in answering questions. The ability to recognize and identify concepts, content, and issues is referred to as the recognition level. Understanding fundamental ideas and being able to articulate them in one's own words are requirements for the comprehension level. The application level necessitates applying concepts in unfamiliar or comparable circumstances. The high application level requires the capacity to apply fundamental ideas to an entirely new challenge. The effectiveness of ChatGPT was assessed by counting how many questions at each level of cognitive difficulty it correctly answered. Figure <ref> demonstrates that ChatGPT properly identified and recognized 83% of the ideas in the recognition level of the questions that were asked. 62% of the questions at the comprehension level were correctly answered by ChatGPT, demonstrating an adequate understanding of the fundamental ideas. At the application level, where it could only accurately answer 27% of the questions, its performance deteriorated dramatically. Only 10% of the questions were correctly answered by ChatGPT at the highest cognitive complexity level, the high application level, demonstrating a limited capacity to apply fundamental ideas to novel problems. According to this performance evaluation, ChatGPT may have some restrictions when it comes to employing newly learned concepts in novel contexts. By giving language models more sophisticated and advanced problem-solving abilities, future language model development might concentrate on enhancing the models' capacity to solve novel challenges. The performance of language models at the application and high application levels may also be enhanced by additional training data and focused training techniques, enabling them to more effectively apply acquired concepts in real-world circumstances. Figure <ref> demonstrates the astounding 100% correct answer rate for the M11B question that ChatGPT attained. It's crucial to remember that this particular topic only included K-type questions. The correct answer rates for the remaining topics ranged from 58.89% for M12G to 71.79% for M12B. Notably, M11C and M12A had the lowest rates of correctly answered questions. Most questions were in M12A, and the majority of them were at the K-level. The lack of information in the figure, however, prevented ChatGPT from being able to respond to all questions. Similarly, ChatGPT did not show much promise for topics like M11C on spatial geometry and M12G on spatial analysis Oxyz. However, if we ignore the questions that required information from the figure, ChatGPT demonstrated a solid capacity to respond correctly for more than 50% of all topics. This indicates that ChatGPT shows potential in some areas of the evaluated topics, but it may need more work to succeed in other areas that require more intricate inference and data interpretation. §.§ ChatGPT’s performance in VNHSGE and other exams We evaluated ChatGPT's success rate in a number of well-known math competitions, as reported by OpenAI <cit.> and shown in Figure <ref>, to determine its suitability for the VNHSGE mathematics exam. With a success percentage of 70%, ChatGPT's performance in the SAT Math competition is better than its performance in the VNHSGE mathematics exam, according to our study. With rates of 40% for AP Statistics, 25% for the GRE Quantitative, 10% for AMC 10, 4% for AMC 12, and only 1% for AP Calculus BC, ChatGPT performed much worse in the other competitions. It is important to note that these comparisons are just meant to be used as a guide because there are variations among math examinations in terms of their formats, structures, levels, and question kinds. As a result, it is impossible to assess the complexity of the VNHSGE exam just by looking at ChatGPT's performance in other competitions. However, this comparison provides a general idea of the VNHSGE exam's level of difficulty in relation to other math competitions. §.§ ChatGPT’s performance and Vietnamese students Figure <ref>-<ref> compare ChatGPT math scores across four years—specifically, 2019, 2020, 2021, and 2022—with Vietnamese students' scores. Notably, the findings show that across the investigated years, ChatGPT math scores have consistently been lower than those of the majority of Vietnamese pupils. Additional performance data analysis can shed light on potential causes of the performance gap between ChatGPT and human students. There may be a variance in performance due to elements such various learning styles and approaches, resource accessibility, and cultural background. Additionally, with additional training and model improvement, ChatGPT's performance might be enhanced. Another key drawback of this AI model is ChatGPT's inability to access, read, and comprehend graphical information in test questions. Tables, charts, and other graphical representations of data and information are frequently used in mathematics exams to visually communicate data and information. However, ChatGPT's inability to interpret graphical data limits its capacity to offer precise answers to this kind of query. This restriction is not specific to ChatGPT; many other AI models also have trouble comprehending graphical data. This is so because reading text takes a distinct set of abilities than analyzing images and other visual information. NLP is exploited by text-based AI models like ChatGPT to comprehend and process text-based inputs. In contrast, computer vision techniques are utilized by image-based AI models to comprehend visual inputs. Enhancing ChatGPT's capacity to comprehend visual data is one potential means of getting around this restriction. Adding computer vision capabilities to the model or creating a hybrid model that blends NLP and computer vision methods may achieve this. The test format could be changed to eliminate graphical data or to offer alternate text-based representations of the graphical data as a potential alternative. Though it might not always be possible, this solution would necessitate significant modifications to the test design. § DISCUSSION While ChatGPT has certain limitations in the field of mathematics <cit.>,<cit.>, <cit.>, it has the potential to be a beneficial resource for educators and learners in the field of education<cit.>, <cit.>. Nevertheless, ChatGPT must continue to prove its ability to earn trust. Therefore, we need to have in-depth and detailed studies of its capabilities in areas, like mathematics. The findings of this study demonstrate that ChatGPT, a big language model trained by OpenAI, is capable of solving math issues to a certain extent but still has difficulties comprehending and interpreting graphical data in test questions. Less than the typical success rate of Vietnamese students taking the same exam, ChatGPT's total success rate in the VNHSGE exam ranged from 52% to 66%. This shows that ChatGPT's capacity to tackle mathematical issues still needs to be enhanced. Further examination of ChatGPT's performance in resolving mathematical problems revealed that its success rate varied based on the level of difficulty and topic of the problems. The questions at the K-level had the greatest ChatGPT success rate, indicating a fundamental comprehension of the topic in question. However, the ChatGPT success rate significantly decreased as the question difficulty increased. This shows that ChatGPT has trouble solving more difficult math problems, particularly those that are at the H-level. Additionally, ChatGPT's performance varied depending on the topic. This conclusion suggests that ChatGPT's current iteration has limits in its capacity to understand mathematical ideas that call for the use of visual reasoning or the interpretation of graphical data. Future development should focus on ChatGPT's shortcomings in comprehending graphical information in test questions. This constraint could be overcome by creating algorithms and models that enable ChatGPT to read and evaluate visual data, which is crucial for resolving many mathematical issues. In summary, ChatGPT performs inconsistently across various topics and difficulty levels, although showing promising results when solving mathematical inquiries. ChatGPT's comprehension of intricate mathematical ideas, particularly those using graphical data, requires more refinement. In our study, we compared how well ChatGPT performed in a number of well-known math competitions, including SAT Math, VNHSGE mathematics, AP Statistics, GRE Quantitative, AMC 10, AMC 12, and AP Calculus BC. The degree of difficulty, the format, and the nature of the questions employed in these contests all differ. With a 70% success rate, ChatGPT had the highest success rate in the SAT Math competition, which is not surprising considering that the SAT Math test primarily evaluates high school math proficiency. The ChatGPT success rate for the VNHSGE Mathematics, on the other hand, was 58.8%. It is a more thorough test that covers a wider range of math topics and difficulty levels. It is important to note that, as was mentioned in our earlier investigation, ChatGPT performed better in some areas than others. With success rates of 25% and 1%, respectively, in the GRE Quantitative and AP Calculus BC competitions, ChatGPT performed much worse. These contests are renowned for their high degree of complexity and difficulty, with questions that call for highly developed problem-solving abilities and a thorough comprehension of mathematical ideas. These types of challenges are difficult for ChatGPT to understand and analyze, which underlines the shortcomings of current language models. Overall, our analysis of ChatGPT's performance in several math competitions reveals the advantages and disadvantages of the present language models for math problem-solving. Even though language models like ChatGPT have advanced significantly in recent years, they still have difficulties processing graphical data, comprehending intricate mathematical ideas, and working out difficult mathematical problem. The goal of future study could be to overcome these constraints and improve language models' capacity for mathematical problem solving. § CONCLUSION In this study, we assessed how well ChatGPT performed when it came to answering mathematics issues of various levels and topics. The findings revealed that ChatGPT performed poorly in some topics and levels while performing well in others. At Level K, ChatGPT correctly answered 83% of the questions, whereas at Levels C, A, and H, the accuracy rate dropped to 62%, 27%, and 10%, respectively. Additionally, the accuracy rates of ChatGPT varied depending on the topic, with M11B, M12B, M11A, and M12D having the highest rates and M12A, M11C, and M12G having the lowest rates. It's crucial to highlight that ChatGPT had difficulty with issues requiring graphical interpretation because it couldn't read and comprehend the images, which led to a poor accuracy rate for queries about derivatives and applications. Furthermore, ChatGPT math scores were consistently lower than those of Vietnamese students in the same years. This might be as a result of the language model's reliance on pre-existing data and algorithms, as well as its failure to comprehend the context and nuances of the Vietnamese language. In conclusion, ChatGPT had potential in resolving mathematical issues, but its effectiveness was constrained by elements like graphical interpretation and language understanding. Future studies might concentrate on addressing these limitations and investigating the possibilities of language models in math education. unsrt
http://arxiv.org/abs/2306.03388v1	20230606040434	Further study on the production of P-wave doubly heavy baryons from Z-boson decays	[ "Hai-Jiang Tian", "Xuan Luo", "Hai-Bing Fu" ]	hep-ph	[ "hep-ph" ]
http://arxiv.org/abs/2306.10997v1	20230619150519	Pulsar timing array detections of supermassive binary black holes: implications from the detected common process signal and beyond	[ "Yunfeng Chen", "Qingjuan Yu", "Youjun Lu" ]	astro-ph.HE	[ "astro-ph.HE", "astro-ph.GA" ]	GWB and BBH source detection via PTAs Chen, Yu, & Lu 0000-0001-5393-9853]Yunfeng Chen School of Astronomy and Space Science, University of Chinese Academy of Sciences, Beijing 100049, China National Astronomical Observatories, Chinese Academy of Sciences, Beijing, 100101, China; [email protected] Kavli Institute for Astronomy and Astrophysics, and School of Physics, Peking University, Beijing, 100871, China; [email protected] 0000-0002-1745-8064]Qingjuan Yu Kavli Institute for Astronomy and Astrophysics, and School of Physics, Peking University, Beijing, 100871, China; [email protected] 0000-0002-1310-4664]Youjun Lu National Astronomical Observatories, Chinese Academy of Sciences, Beijing, 100101, China; [email protected] School of Astronomy and Space Science, University of Chinese Academy of Sciences, Beijing 100049, China Qingjuan Yu Pulsar timing arrays (PTAs) are anticipated to detect the stochastic gravitational wave background (GWB) from supermassive binary black holes (BBHs) as well as the gravitational waves from individual BBHs. Recently, a common process signal was reported by several PTAs. In this paper, we investigate the constraints on the BBH population model(s) by current PTA observations and further study the detections of both the GWB and individual BBHs by current/future PTAs. We find that the MBH–host galaxy scaling relation, an important ingredient of the BBH population model, is required to either evolve significantly with redshift or have a normalization ∼0.86–1.1 dex higher than the empirical ones, if the GWB is the same as the common process signal. For both cases, the estimated detection probability for individual BBHs is too small for a positive detection by current PTAs. By involving either the constrained scaling relations or those empirical ones into the BBH population models, we estimate that the GWB may be detected with a signal-to-noise ratio ≳3 by the PTAs based on the Five hundred meter Aperture Spherical radio Telescope (CPTA) and the Square Kilometer Array (SKAPTA) after ∼2-3 (or ∼6-11) years' observation, if it is the same as (or an order of magnitude lower than) the common process signal. The detection time of individual BBHs by CPTA and SKAPTA is close to that of the GWB detection. We show that the BBH population model can be strongly constrained by the number and property distributions of BBHs to be detected by future PTAs. § INTRODUCTION Massive binary black holes (MBBHs, hereafter BBHs) are the natural products of frequent galaxy mergers <cit.> as a consequence of the ubiquitous existence of massive black holes (MBHs) in the centers of galaxies <cit.>. In the galaxy merger remnants, the BBHs interact with surrounding stars and gas, which leads to significant orbital decay (e.g., ). Once the orbital separations of these BBHs become sufficiently small, e.g., at mpc scales or smaller, they may emit large amounts of gravitational waves (GWs) with frequencies at the nano-Hertz band (∼ 10^-9-10^-7 Hz). Therefore, the cosmic population of BBHs can be taken as one of the primary targets of the pulsar timing arrays (PTAs). Two types of GWs from these BBHs are expected to be detected by PTAs in the near future. One is the stochastic background (GWB) produced by the incoherent combination of all the GW emissions from different BBH systems, and the other is the continuous gravitational wave (CGW) emitted from individual BBHs, which are resolvable if the signal stands out of the GWB. Note that some cosmic relics from the early universe (e.g., see a recent review by ) or some more exotic sources (e.g., ) may also contribute to the nHz GWB, which are ignored in the present paper. A number of PTAs have been operated for more than a decade, including the North American Nanohertz Observatory for Gravitational Waves (NANOGrav, ), the European PTA (EPTA, ), and the Parkes PTA (PPTA, ). These three PTAs regularly update their detection results, and combine together to form the International Pulsar Timing Array (IPTA, ). Recently, a common process signal has been reported by these PTAs <cit.>, which can be described by a power-law spectrum with the power-law index close to that of the stochastic GWB. However, its origin is still unclear as there has been no definitive evidence yet supporting that the signal has a spatial correlation described by the Hellings-Downs curve <cit.>. Nevertheless, it may suggest that the nano-Hertz GWB is close to be detected by PTAs. The GWB due to the cosmic population of BBHs, quantified by the characteristic strain amplitude, h, has been theoretically estimated extensively in the literature (e.g., ). The GWB strain amplitude estimated from different models can be different by more than one order of magnitude, depending on the model assumptions and settings. This suggests that those theoretical models can be effectively constrained if the GWB signal is detected or a stringent upper limit on the GWB can be given by PTAs (e.g., see ). Many studies have also explored the detectability of individually resolvable CGW sources, i.e., BBHs, in the literature (e.g., ), though a consensus has not been achieved. For example, based on a large ensemble of mock BBH populations, <cit.> concluded that the GWB is more likely to be detected first. On the other hand, by coupling the cosmic population of galaxies and MBHs from the Illustris cosmological hydrodynamic simulations to semi-analytic models of binary mergers, <cit.> concluded that individual BBHs are at least as detectable as the stochastic GWB (see also ). <cit.> found that the detection probability of local individual BBHs by the current generation of PTAs is negligible, e.g., ≪ 1%, by considering the possible BBH systems inside a sample of local galaxies from observations. As the GWB and the individual BBHs are expected to be detected by PTAs in the near future, many efforts have been made towards that goal in the past several decades. Indian PTA (InPTA, ) and China PTA (CPTA, ) recently also joined the searching for nano-Hertz GWs, which may be combined with IPTA together to improve the PTA sensitivity to the GWB and individual BBHs. The MeerTime Pulsar Timing Array (MPTA, ), which will finish its initial five-year programme in July2024, has already played an important role in the global efforts of IPTA in detecting GWs. Even more powerful PTAs have been planning based on the Square Kilometer Arrays (SKAPTA, ) and the next generation Very Large Array (ngVLA, ), which are anticipated to detect the GWB with high signal-to-noise ratio (SNR) and detect many individual BBHs. With these detections, the cosmic formation and evolution of BBHs is expected to be further constrained. However, how the BBH cosmic evolution model can be constrained jointly by both the GWB and individual BBH detections has not been fully explored. In this paper, we first investigate the possible constraints on the model of the underlying BBH population that can be obtained by assuming that the recently reported common process signal is indeed due to the GWB, and then explore the detectability of individual BBHs based on the constrained model(s) and beyond. Both the GWB strain amplitude and the occurrence rate of individual BBHs are controlled by the cosmic distribution of BBHs, which is in turn controlled by the cosmic BBH formation and evolution model. We adopt the cosmic BBH model in <cit.> (hereafter called CYL20), in which the following ingredients are involved, i.e., the galaxy stellar mass function (GSMF), the merger rate per galaxy (MRPG), the MBH–host galaxy scaling relation, and the time delays between BBH coalescences and their host galaxy mergers. For the constraints given by PTA observations, we focus on the mass scaling relation between MBHs and their host galaxies, and leave other ingredients fixed. This paper is organized as follows. In Section <ref>, we briefly introduce the main methods employed in this study. We present how to transfer the possible GWB signal recently reported to the constraints on the model of the BBH population in Section <ref> and the method of predicting the detection prospects of individual BBHs based on the constrained BBH population model in Section <ref>. In Section <ref>, we present the detailed model settings in this study, such as the MBH-host galaxy properties, the PTA configurations and their sensitivities, and the local sample of galaxies hosting the local BBH population. The main results obtained in this study are given in Section <ref>. Finally, the main conclusions are summarized in Section <ref>. § METHODS In Section <ref>, we introduce our model for obtaining constraints on the MBH–host galaxy scaling relation, by assuming that the stochastic GWB has a strain amplitude the same as or a fraction of the common process signal reported recently <cit.>. We explore both the case with the redshift-independent scaling relations and that with the redshift-dependent ones, highlighting the potential of using GWB “observations” (by using the quota marks here we mean assumed observation of the GWB signal being the same as or a fraction of the common process signal) to constrain the possible evolution of the scaling relation with cosmic time. In Section <ref>, we introduce the method for predicting the detection prospects of individual BBHs by current PTAs or future ones, adopting both the MBH-host galaxy scaling relations constrained by the GWB “observations” and some empirical ones shown in the literature. §.§ Constraining the MBH-host galaxy relationship from the GWB The characteristic strain amplitude of the stochastic GWB in the PTA band, h, produced by a cosmic population of BBHs at the GW frequency f (in the observer's rest frame) can be estimated as h^2(f)≃ 4/πG/c^2f^-2 ∭ dz dM dq\|dt/dz\| × R(M,q,z) 1/1+z\|dE/dln f\|, where c is the speed of light, G is the gravitational constant, t is the cosmic time at redshift z with dt/dz being the corresponding time derivative to z, f= (1+z)f is the frequency of the GW signal in the source's rest frame, and \|dE/dln f\| is the GW energy per unit logarithmic rest-frame frequency radiated by an inspiraling BBH with parameters (M, q, f) (see Eqs. 30–34 in CYL20 and also the derivation of ). Note that compared with Equation (33) in CYL20, we set that the BBH evolution is at the gravitational radiation stage in Eq. (<ref>), as we focus on the PTA band, where f is greater than the turnover frequency of the expected GWB shown in Fig. 19 in CYL20 and the coupling of the BBH orbital evolution with surrounding environment is negligible. In the above equation (<ref>), R(M,q,z) represents the coalescence rate of the BBHs, which is defined so that R(M,q,z) dt dM dq represents the comoving number density of BBH coalescences occurred during the cosmic time t → t+dt, with the descendant mass of the two component MBHs within the range M→ M+dM and the progenitor mass ratio of the two MBHs within the range q→ q+dq. The characteristic strain amplitude h (f) is determined by the BBH coalescence rate, which is in turn determined by the cosmic BBH evolution model consisting of several ingredients, including the GSMF n(M,z), the MRPG (q,z\|M), the MBH–host galaxy scaling relation, as well as the dynamical evolution of BBHs within the galaxy merger remnants (see CYL20). The GSMF is defined so that n(M,z) dM represents the comoving number density of galaxies at redshift z with stellar mass within the range M→ M+dM. The MRPG is defined so that (q,z\|M) dt dq represents the averaged number of galaxy mergers with mass ratio in the range q→ q+dq within cosmic time t → t+dt for a descendant galaxy with mass M. With these definitions, the BBH coalescence rate can be obtained through R (M,q,z(t)) = 1/N∑_i=1^N∬ dM dq × n(M,z_i) (q,z_i\|M) × p(M,q\|M,q,z_i)H(t-τ_a=0,i), where the BBH systems with coalescence timescales τ_a=0,i (i=1,2,...,N) are generated by the Monte-Carlo method according to the properties of the merged galaxies, H(t-τ_a=0,i) is a step function defined in the way that H(t-τ_a=0,i)=1 if t>τ_a=0,i and H(t-τ_a=0,i)=0 if t≤τ_a=0,i, z_i is the corresponding redshift of the cosmic time t-τ_a=0,i (see derivations in Section 3.1 of CYL20). In Equation (<ref>), p(M,q\|M,q,z) is the term through which the MBH–host galaxy scaling relation affects the BBH coalescence rate. It is defined so that p(M,q\|M,q,z) dM dq represents the probability of finding a BBH system with descendant total mass in the range M→ M+dM and with progenitor mass ratio in the range q→ q+dq if their host galaxies have descendant total mass M and progenitor mass ratio q merged at redshift z. To obtain Equation (<ref>), we substitute Equation (15) in CYL20 into Equation (22) therein. In the calculation, we ignore multiple galaxy major mergers that could occur before the BBH coalescence since their host galaxy merger, i.e., setting P_ intact=1 in Equation (22) of CYL20, which is plausible as the GWB at the PTA band is mainly contributed by galaxy or BBH mergers within redshift lower than 2 (see Fig. 21 in CYL20). We obtain the probability p(M,q\|M,q,z) in the following way. Let M and M (≤ M) denote respectively the stellar masses of the primary and secondary galaxies of a binary with total mass M and mass ratio q. Similarly, let M and M (≤ M) denote respectively the masses of the primary and secondary MBHs of a BBH system with the total mass M=M +M (where the mass loss due to the GW radiation is ignored) and mass ratio q (≤ 1). The probability distribution function p can be calculated through p (M,q\|M,q,z) = (M^2/M) ×[p(M\|M,z) p(M\|M,z) . .+ p(M\|M,z) p(M\|M,z) ], where p(M\|M,z) is defined so that p(M\|M,z) dM represents the probability of a galaxy with stellar mass M at redshift z containing a central MBH with mass within the range M→ M+dM. From Equation (<ref>), one observes that p in Equation (<ref>) is determined by the MBH–host galaxy scaling relation, such as the M–M relation or the M–σ relation, where M and σ represent the mass and stellar velocity dispersion of the spheroidal components of the host galaxies (i.e., elliptical galaxies themselves or bulges in spiral galaxies, throughout this work we use “bulge” to represent both cases), respectively. Without loss of generality, we express the MBH–host galaxy scaling relation as log M_ BH,1 = γ̃+ω̃log(1+z)+ β̃logσ_200+ α̃log M_ bulge,11, with an intrinsic scatter of ; and M_ BH,1, σ_200, and M_ bulge,11 represent the MBH mass in unit of the solar mass , the stellar velocity dispersion in unit of 200, and the bulge mass in unit of 10^11, respectively. The term log(1+z) in the above equation describes the redshift evolution of the scaling relation. If =0, the scaling relation does not evolve and is independent of the redshift. Specifically, Equation (<ref>) reduces to the M–M relations if =0, =0 and the M–σ relation if =0, =0. We leave in Equation (<ref>) as a free parameter to be constrained, not only because the GWB strain amplitude is sensitive to the value of , but also because the determination of has not yet converged in the literature. In addition, the derived relation with dynamical mass measurements of MBHs may suffer significant selection bias <cit.>. The MBH–host galaxy scaling relation may evolve with redshift as suggested by many authors (e.g., ), which may contain critical information about the co-evolution of MBHs with their host galaxies. In this work, we also demonstrate the potential of using GWB “observations” to set strong constraints on the redshift evolution of the MBH–host galaxy relationship. The GWB strain amplitude can be evaluated according to the dynamical evolution model for the cosmic BBHs as detailed in CYL20, which is mainly controlled by the GSMF, MRPG, MBH–host galaxy scaling relation, and time delays between the BBH coalescences and their host galaxy mergers. Reversely, we may apply the Bayesian inference and the Markov Chain Monte Carlo (MCMC) method to extract constraints on the model ingredients from the GWB “observations” in this paper. The GWB strain amplitude can be well described by a power law in the PTA band <cit.>, except that the small number variance becomes important at the high-frequency end <cit.> and a bending emerges at the low-frequency end due to the coupling of the BBH dynamical evolution by interactions with its environment (CYL20) and/or highly eccentric BBH orbits <cit.>. Therefore, the observable can be represented by , which is the characteristic strain amplitude at the observational frequency 1, i.e., h=(f/1)^-2/3. In this paper, we make the assumption that the stochastic GWB produced by the cosmic population of BBHs has the same amplitude as the common process signal recently reported by NANOGrav or smaller than it by a factor of either 2 or 4, if not otherwise stated. When constraining the BBH population model using , we focus on the MBH–host galaxy scaling relation (cf. Eq. <ref>), leaving the remaining ingredients being fixed to fiducial choices. Details of the model settings are described in Section <ref>. §.§ Detections of individual BBHs In this subsection, we describe how to explore the detectability of individual BBHs in the PTA band, based on the constraint given by the PTA observations on the GWB or the empirical relations given by observations. We assume a BBH on the circular orbit. In the source's rest frame, the BBH emits GWs at a frequency twice the orbital frequency, i.e., f=2f, which is then redshifted to frequency f=(1+z)^-1f in the observer's rest frame, where z represents the redshift of the BBH system. Note that f and f denote the GW frequencies of the stochastic GWB and the individual sources, respectively, in this paper. The corresponding sky and polarization angular-averaged strain amplitude of the BBH can be given by (see Eq. 55 in CYL20) h_0 = √(32/5)1/d_ L (G/c^2)^5/3 (π f/c)^2/3, where d_ L is the luminosity distance of the BBH system, = (1+z) represents the redshifted chirp mass, and = M^3/5M^3/5/M^1/5 is the chirp mass of the BBH system in the source rest frame. We investigate the detectability of individual BBHs by PTAs for those BBHs in the local universe and those as a cosmic population, respectively, by applying the scaling relation between the MBH mass and host galaxy properties constrained by the GWB “observations”, if not otherwise stated, under the cosmic evolution model of BBHs. * In the local universe (i.e., z≃ 0), we have the observations of each individual massive galaxy with well determined properties, e.g., stellar mass and luminosity distance <cit.>. Some of them may even have well determined MBH mass directly by gas/stellar kinematics. For those with direct M measurements, we take it as the total mass of the BBH, if any. For those without direct M measurements, we set the BBH total mass the same as the central MBH/BBH given by the MBH-host galaxy scaling relation constrained by the GWB. For each MBH in the local sample, it has a probability of being a BBH system emitting GWs in the PTA band. Therefore, we can evaluate its conditional probability distribution in the parameter space (q, f) at any given M, [i.e., (q,f,z=0\|M) in Eq. <ref> below; see also CYL20]. A similar approach can be found in <cit.>. * For the high redshift universe, we do not have full information of all individual galaxies. Therefore, we obtain the cosmic population of BBHs at high redshifts based on the probability distribution of BBHs in the parameter space (M,q,f,z) [i.e., P(M,q,f,z) in Eq. <ref> below], which can be obtained from the cosmic BBH formation and evolution model in CYL20. In this way, one can get a comprehensive view of the individual BBH detection by future PTAs, such as CPTA <cit.> and SKAPTA <cit.>, which are expected to detect a large number of BBHs. Below we denote the BBH systems derived from the two different approaches as the “local population” and the “global population”, respectively, and describe them in more details in Section <ref> and Section <ref>, respectively. §.§.§ The local population of BBHs The probability distribution (q,f,z\|M) is defined in the way that (q,f,z\|M) dq df represents the probability for a BBH system with total mass M at redshift z to have mass ratio in the range q→ q+dq and emit GWs in the frequency range f→ f+df. We also define (q,z\|M) to be the BBH specific coalescence rate (i.e., coalescence rate per BBH system) so that (q,z\|M) dq dt represents the averaged fraction of coalescences that BBH systems, with total mass M and the mass ratio in the range q→ q+dq, undergo during the cosmic time t → t+dt. The above two quantities are related to each other through (q,f,z\|M) = (q,z\|M)1/1+z\|dt/df\|, where dt=(1+z)dt and df/dt = 96/5π^8/3 (G/c^3)^5/3f^11/3. Note that an assumption of being a constant during the period for the BBH evolving from emitting GW at f to its final coalescence is used to obtain Equation (<ref>). In the observer's rest frame, the time to coalescence can be given by τ = 5/256(G/c^3)^-5/3 (π f)^-8/3 ≃ 26(8.7× 10^8/)^5/3 (10^-9/f)^8/3, where the reference value for is taken as 8.7× 10^8, the chirp mass of a binary composed of two equal-mass MBHs, each with a mass of 10^9 at z=0. As clearly seen from this equation that τ_ obs is sufficiently small that the change of over the coalescence time can be safely ignored. We define n(M,z) to be the MBH mass function so that n(M,z) dM represents the comoving number density of MBHs at redshift z to have mass in the range M→ M+dM. Then the BBH specific coalescence rate and the BBH coalescence rate R are related to each other through (q,z\|M) = R(M,q,z)/n(M,z). The mass function of MBHs is related to the mass function of their host galaxies (i.e., the GSMF) through the MBH–host galaxy scaling relation, i.e., n (M,z) = ∫ dM n(M,z) p(M\|M,z). In short, given p(M\|M,z) constrained by the stochastic GWB, we can obtain the BBH coalescence rate R(M,q,z) (Eq. <ref>) and the MBH mass function n(M,z) (Eq. <ref>), from which the specific coalescence rate of BBHs (q,z\|M) can be further obtained through Equation (<ref>). Then, we can give the conditional probability distribution (q,f,z\|M) from the specific coalescence rate of BBHs through Equation (<ref>). §.§.§ The global population of BBHs We now consider the global population of BBHs. Unlike the case of the local population, in which the total mass of each BBH system M is fixed and thus the conditional probability distribution (q,f,z\|M) is needed, here instead we need to know the number distribution of BBHs in the complete parameter space composed (M, q, f, z). We define this number distribution as P(M,q,f,z) and it can be obtained through P (M,q,f,z) = R(M,q,z)1/1+z\|dt/df\| \|dV_ c/dz\|, where \|dt/df\| can be obtained from Equation (<ref>), V_ c represents the comoving volume. Here R is also assumed to be a constant during the period for the BBH evolving from emitting GW at f_ gw to its final coalescence. The global BBH population emitting CGW signals can be realized according to the probability distribution P(M,q,f,z), which is different from the local BBH population, for which the total mass of each system is given and therefore the conditional probability distribution (q,f,z\|M) is employed to get the realizations. Comparing Equations (<ref>) and (<ref>), the two distributions differ from each other by the term n(M,z) (i.e., the MBH mass function) and the term \|dV_ c/dz\|. Since the MBH mass function also depends on the scaling relation between MBH mass and host galaxy properties, the realizations of the two populations may change in different ways if the constraints on the relation change. § MODEL SETTINGS In this section, we introduce the model settings. First, we briefly overview the common process signal obtained by PTA observations and introduce our settings on the PTA signals of the GWB in section <ref>. In section <ref>, we describe our settings on the galaxy properties relevant to the cosmic evolution model for BBHs, especially the MBH-host galaxy scaling relation. In section <ref>, we introduce our model setting on PTA configurations and the estimates about their sensitivity curves. We also describe the local sample of MBHs in section <ref>. §.§ PTA signals The common process signal has been reported by NANOGrav <cit.>, PPTA <cit.>, EPTA <cit.>, and IPTA <cit.>. The reported median magnitudes of by different PTAs range from ∼2× 10^-15 to ∼3× 10^-15, with a broad consistency at the 2–3σ level <cit.>. Among the different values, we choose the one reported by NANOGrav as the fiducial amplitude of the common process signal, which equals to 1.92^+0.75_-0.55× 10^-15, with the quoted value being the median and the quoted uncertainties for the 5%-95% confidence interval. This is equivalent to a mean value of -14.72 and a standard deviation of 0.09 dex for log_10 if we assume that follows a log-normal distribution. Whether it represents the stochastic GWB is not clear, as no conclusive evidence was obtained for the measured spatial angular correlation to be consistent with the Hellings-Downs curve <cit.>. Even if this signal is the real GWB, it is not clear whether this signal is all contributed by the BBH population. For example, cosmological origin GWs, such as those induced by quantum fluctuations at the inflation era, cosmic strings, domain walls, vacuum bubbles (see ), may also contribute partly to the reported common process signal. Nevertheless, we assume the following three cases to consider the possible constraints that may be obtained from the GWB “observations”, i.e., the real GWB or the fraction of the GWB contributed by the BBH population is assumed to be 1) the same as, 2) a half of, or 3) a quarter of the common process signal. §.§ MBH and Galaxy Properties LCCCCCcl Several empirical MBH–host galaxy scaling relations (see Eq. <ref> and Section <ref>) adopted to study the detectability of individual BBHs. Model log_10 Relation Reference 8.69 1.17 0.29 -15.28 M–M <cit.> 8.23 3.96 0.31 -15.70 M–σ <cit.> 7.70 4.50 0.50 0.25 -16.22 M–σ–M <cit.> The formation and evolution of the cosmic BBH population determines both the stochastic GWB and individual CGW sources. As described in the introduction section, the cosmic BBH formation and evolution model consists of several key ingredients, including the GSMF, MRPG, MBH–host galaxy scaling relation, and the time delays between BBH coalescences and their host galaxy mergers. The first three can be obtained directly from observations though with some uncertainties, and the last one is controlled by the BBH orbital evolution <cit.>. It has been shown that the resulting GWBs can be significantly different if adopting the MBH–host galaxy scaling relation given by different authors (see CYL20). Therefore, we focus on the MBH–host galaxy scaling relation (c.f., Eq. <ref>), and fix other related ingredients, if considering the possible constraints on the cosmic BBH population model from the GWB “observations”. Specifically, we choose the GSMF from <cit.> and the MRPG from <cit.>; to convert the masses of the galaxies to the masses of their bulge components, we adopt the prescription in <cit.>; and we adopt that the galactic bulge have the shape distribution described by <cit.>. For the time delay, we employ the dynamical evolution model of BBHs developed in <cit.> to calculate it as done in CYL20. For comparison, we also consider the extreme case whithout time delay. We focus on the MBH–host galaxy scaling relation (cf. Eq. <ref>) when considering the constraints that may be obtained from the GWB “observations” as mentioned above. In particular, we consider both the redshift-independent and redshift-dependent M–M relation. For the former case, we set =0, =0, but keep , , and as free parameters to be constrained. For the latter case, we set =8.69 (the same as that in the local M–M relation given by ) and =0, but keep , , and as free parameters to be constrained. We restrict the redshift evolution to be within z=3, above which the scaling relation is assumed to be the same as that at z=3. For the former case we assume that has a flat prior distribution within [7.0, 10.0], while for the latter case we assume that has a flat prior distribution within [-4.0, 4.0]. For both cases, we assume that and have flat priors within [0.8, 1.2] and [0.0, 0.6], respectively. We note here that in principle, one could set all the five parameters (i.e., , , , , and ) as free ones, and obtain constraints on them by the GWB spectrum observations. Furthermore, we also consider those cases that the MBH–host galaxy scaling relation is the same as that directly determined by the MBHs in nearby galaxies with dynamical mass measurements, without considering the constraints from the common process signal detected by PTAs. In those cases, we also assume the scaling relation does not evolve with redshift. Table <ref> lists several empirical relations, which are adopted to lead to the maximum, median, and minimum GWB strain amplitudes estimated in CYL20, respectively. Note that these empirical relations are only adopted as part of the cases to predict the detectability of individual sources. As described in Sections <ref> and <ref>, various models are considered in this study. For clarity, we describe the notations of the models in the following way (see Tabs. <ref>–<ref>). Regarding the scaling relation, these models can be divided into three groups as labeled by , ^z, and ^ e, respectively, corresponding to those admitting the z-independent and z-dependent scaling relations constrained by the stochastic GWB, and those admitting the scaling relations empirically determined. For those models admitting the constrained scaling relations, _1 , _1/2 , and _1/4 (or ^z_1, ^z_1/2, and ^z_1/4) correspond to the cases in which the stochastic GWB is assumed to have the amplitude equal to the common process signal scaled by a factor of 1, 1/2, and 1/4, respectively. For those models admitting the empirical scaling relations, ^ e_ max, ^ e_ med, and ^ e_ min represent the model that produces the maximum, medium, and minimum amplitudes of the stochastic GWB listed in CYL20, corresponding to the M–M relation from <cit.>, the M–σ relation from <cit.>, and the M–σ–M relation from <cit.>, respectively. Regarding the time delays between BBH coalescences and their host galaxy mergers, we use “delay” and “nodel” to indicate those cases in which the time delays are included and ignored, respectively. Note that the time delays given by CYL20 (Fig. 8 therein) have a wide distribution from ∼ 10^8 yr to 10^11 yr with a peak around a few Gyr depending on the BBH total mass and mass ratio. §.§ PTAs lCCCC Assumed parameters for some PTAs based on FAST and SKA (see Section <ref>). 2* Name σ_a T Δt (ns) (yr) (yr) conservative-CPTA 50 100 5 0.04 conservative-SKAPTA 100 100 5 0.04 optimistic-CPTA 100 20 20 0.02 optimistic-SKAPTA 1000 20 20 0.02 §.§.§ PTA configurations Here we introduce the configurations for those PTAs considered in this paper. We consider both the PTAs that have been operated for many years (e.g., EPTA, NANOGrav, and PPTA) and those new/future ones using FAST/SKA to explore the detection prospects of individual BBHs. For the former PTAs, the upper limits on individual BBH detection can be obtained by using the available data. For the latter ones, we consider four PTA configurations by using FAST and SKA, with properties (i.e., number of millisecond stable pulsars _ p, timing precision σ_a, cadence 1/Δ t, and observational time span T) listed in Table <ref>. We adopt two types of configurations for both CPTA and SKAPTA: one is a conservative configuration and the other is an optimistic configuration. Note that <cit.> listed the expected white noise of the ten best PPTA pulsars observed in the FAST/SKA era in their Table 4, where all the ten pulsars have σ_a well below 100 ns with a mean value of ∼ 30 ns and four pulsars have σ_a even below 20 ns. Therefore, we assume that the conservative configurations have a timing precision of σ_a =100 ns and the optimistic configurations have σ_a=20 ns. In this study, we also investigate the evolution of the detection prospects of both types of GW signals with the PTA observation time T, as presented in Section <ref>. For these investigations, we still adopt the PTA configurations listed in Table <ref> except that the PTA observation time is set as a free parameter (not fixed to those values listed in Tab. <ref>). We append a star symbol to the PTA names (e.g., conservative-CPTA^∗) to specially denote these cases. §.§.§ PTA sensitivity curves The sensitivity curves for these PTAs can be estimated based on the cross-correlation method (see Eq. 86 in , and see also ), i.e., ρ^2 = (-1)χ^4 h_0^4(f)T^2/S^2(f). Here ρ denotes the SNR, is the number of pulsars used by the PTA, χ is a geometric factor and it is 1/√(3) obtained by the far-field approximation for the distant sources. In Equation (<ref>), S(f)= 8π^2 f^2 σ_a^2 Δ t is the noise power spectrum density (PSD) and it is related to the noise amplitude h(f) through h(f) = √(fS(f)+h^2(f)), where the stochastic GWB is regarded as a source of noise. If the GWB strain is well determined, then the term h^2(f) in Equation (<ref>) may be dropped and thus h(f) ≃√(fS(f)). Note that when PTAs (such as the optimistic configurations of CPTA or SKAPTA in Section <ref>) are so sensitive that many individual sources, crowding in each resolvable frequency bin, have characteristic strain higher than the sensitivity curves, new challenges arise on how to extract the signal of each individual BBH and how many individual BBHs can be identified in each frequency bin. This is beyond the scope of the current work, but of interest for future studies. With Equation (<ref>), we can estimate the sensitivity curve for a given PTA configuration through h_0, th(f) = [ρ_ th^2/(-1) χ^4]^1/4 h(f)/√(fT). According to Equation (<ref>), we can see that h_0, th∝σ_a, h_0, th∝ T^-1/2 and h_0, th∝Δ t^1/2. When the number of pulsars is large, we also have h_0, th∝^-1/2 approximately. The sensitivity of a PTA can be improved by improving the timing precision, increasing the number of pulsars, the cadence, and the observation time. For the parameterized PTA configurations listed in Table <ref>, we apply ρ_ th=1 in Equation (<ref>) to evaluate their sensitivity curves and show the results in Figure <ref>. We define a BBH as “detectable” if its SNR is above 3. Below when studying the detection statistics of individual BBHs, we evaluate both the detection probability and (average) detection number of these sources. The former describes the fraction of GW sky realizations containing at least one detectable source, while the latter describes the average number of detectable sources in each realization. Assuming that the occurrence rate of individual BBHs follows the Poisson distribution when the number of “detectable” sources is small, a detection probability of 95% corresponds to a detection number of ∼ 3, and a detection number of 1 corresponds to a detection probability of ∼63%. Note that our treatments to these parameterized PTA configurations as described above are different from those with detection upper limits given by current PTAs, e.g., the EPTA sensitivity skymap taken from <cit.>. For the latter ones, we use the 95% upper limits as their sensitivity curves. For those BBHs with strain amplitudes h_0 above the sensitivity curves in this case, we regard them as detectable sources. The detection probability and detection number are the same as the parameterized PTA configuration case. Figure <ref> shows the expected sensitivity curves of those PTAs listed in Table <ref>. This figure also plots the simulated sky-averaged 95% upper limits for the current NANOGrav program followed by 10 years of ngVLA observations <cit.>. Note that the curves for the current PTAs and ngVLA denote the 95% upper limits, while the curves for those PTAs listed in Table <ref> denote the PTA sensitivity on h_0 with a threshold SNR ρ_ th=1 (see Eq. <ref>). As expected, future PTAs may achieve a sensitivity 1-2 orders of magnitude higher than the current ones. One may pay attention to the upper limits constrained by those currently available PTA observations. For example, the 95% upper limit skymap on the strain amplitude of individual BBHs was obtained by <cit.> at 86 frequencies log-uniformly distributed between 10^-9 and 10^-6 (the dots shown in Figure <ref>), based on the EPTA DR1 data set <cit.>. Note that we exclude the bad pixels and some pixels with suspicious upper limit values in the skymap, i.e., those with negative upper limit values and those with declination satisfying \|δ\|> 75^∘ and with values below 1× 10^-15 when \|δ\|< 55^∘ and below 4× 10^-15 when \|δ\|> 55^∘. §.§.§ SNR of the GWB expected by PTAs We also consider the expected SNR of the GWB for any given PTA, which can be estimated as (see Eq. 23.69 in ; ) SNR = [∑_ab∫_f_l^f_h df2T ζ^2_ab P^2_g(f)/[2σ_a^2Δ t+P_g(f)][2σ_b^2Δ t+P_g(f)] ]^1/2, where f_l=1/T, f_h=1/Δ t, P_g(f) = h^2(f)/(12π^2f^3) (see Eq. 23.51 in ), σ_a and σ_b are the timing precision of pulsars a and b, respectively, ζ_ab=3/2 C_ab with C_ab being the angular correlation function, i.e., the Hellings-Downs curve <cit.>. Note that the value of ζ_ab depends on the relative angle between the two pulsars θ_ab (see Eq. 23.48 in ). If PTA pulsars follow an isotropic distribution in the sky, θ_ab follows a probability distribution with dP(θ_ab)/dθ_ab = 1/2sinθ_ab. Therefore, when evaluating the expected SNR of the GWB, we replace ∑_abζ_ab^2 in Equation (<ref>) with ⟨∑_abζ_ab^2⟩ = _ p(_ p-1)/4 ∫_0^πζ_ab^2 sinθ_ab dθ_ab, under the assumption σ_a≃σ_b. Note that there are more pulsars in the Galactic plane and thus the real distribution of PTA pulsars may deviate from the isotropic one. We have checked and found that this may only lead to minor effects on our results. §.§ The local sample of MBHs The constrained BBH population model can be applied to a local sample of MBHs for exploring the detection statistics of individual BBHs in the local universe as described in Section <ref>. To do this, we adopt the sample of nearby galaxies as compiled by <cit.>. Below we briefly describe the sample. The local galaxy sample are selected by using the 2MASS K-band (2.2 μ m) with apparent magnitude m_K≤ 11.75, with a completeness of 97.6% to a distance of 300. It consists of 43,533 galaxies with spectroscopic redshifts in the 2MASS Redshift Survey (2MRS, ), and represents a census of galaxies in the local universe <cit.>. This sample has expanded in both the volume and the sample size considerably, compared with the local galaxy sample adopted in <cit.>. In the local sample, about 20% of the galaxies (8,625) have directly measured distances according to the Cosmicflows-3 catalog <cit.>. The distances in the catalog are measured with high-quality methods, such as the standard candles using the Cepheids, the tips of the red giant branch, or the type Ia supernovae, and also the methods relying on some empirical relations (e.g., the Tully-Fisher relation of spiral galaxies, the fundamental plane of elliptical galaxies, and the surface brightness fluctuations). In addition, the distances of ∼10% of the galaxies (4,533) can be obtained from the galaxy group catalog of <cit.>. For the remaining galaxies, their distances are estimated based on their redshifts. Within the local volume, corrections need to be made to the spectroscopically measured velocities when applying the Hubble's law to estimate distances, since they are significantly affected by the peculiar motions of the galaxies. The prescription of <cit.> is adopted to make such corrections. We assign a mass to the central MBH (BBH) of each galaxy in the local sample. Among these local galaxies, 77 have direct dynamical mass measurements and 29 have mass measurements via the reverberation mapping method. For these MBHs, their masses are fixed to the measured values, regardless of the changes of the constraints on the MBH–host galaxy scaling relations (Eq. <ref>). For the remaining MBHs, the MBH–host galaxy scaling relations are applied to evaluate their masses, such as the M–σ relation (2,206) and the M–M relation (41,221) as quoted from <cit.> (see Tab. 2 of for details). Note that for those MBHs without direct mass measurements, we adopt either the MBH–host galaxy scaling relations constrained by the GWB “observations” or the empirical ones given by the local MBH and galaxy observations to estimate the MBH masses. When necessary, we adopt the M–σ relation of <cit.> to make the conversion between the two quantities. § RESULTS We present our main results in this section, which are divided into two parts. As the GWB is expected to be detected before individual sources, in the first part, we focus on the constraints that can be extracted from the stochastic GWB “observations”, assuming that it is either the same as or a fraction of the common process signal recently detected by several PTAs <cit.>. In the second part, we focus on applying the new constraints on the MBH–host galaxy scaling relations obtained in the first part, as well as the empirical ones, given by the local MBH and galaxy observations to explore the detection prospects of individual BBHs by current and future PTAs. When the individual sources were detected after the detection of the GWB, the BBH population model can be further constrained by using both detections. §.§ Possible Constraints on the MBH–host galaxy scaling relation by the GWB “observations” We adopt the MCMC method (emcee; ) to obtain the constraints on the MBH–host galaxy scaling relation by matching the GWB produced from each BBH evolution model to the “observational” ones (assuming from BBHs), which is assumed to be either the same as or a fraction of the common process signal. We first consider the cases that the MBH-host galaxy scaling relation is redshift-independent and redshift-dependent in Sections <ref> and <ref>, respectively. The GWB contributed by BBHs is assumed to be the same as the common process signal, of which the likelihood adopted is a log-normal distribution of the NANOGrav posteriors. We obtain the constraints through by assuming the GWB spectrum follows the canonical f^-2/3 power-law. In Section <ref>, we also further consider the cases that the GWB contributed by BBHs is a fraction (1/2, or 1/4) of the common process signal for the models with both redshift-independent and redshift-dependent MBH-host galaxy scaling relations. In Section <ref>, we compare our results of constraining the cosmic BBH population using PTA observations with some literature works. lRRRCclRRRC Constraints on the MBH–host galaxy scaling relation from different models with different given values of A_ yr. See Section <ref>. 5cz-independenta 5cz-dependentb 1-5 7-11 Model log_10 Model log_10 9.55^+0.27_-0.26 1.01^+0.13_-0.13 0.32^+0.20_-0.21 -14.72 1.99^+0.53_-0.53 1.00^+0.13_-0.14 0.31^+0.20_-0.21 -14.72 8.95^+0.20_-0.19 1.01^+0.13_-0.14 0.31^+0.20_-0.21 -15.02 0.67^+0.53_-0.60 1.00^+0.14_-0.14 0.32^+0.20_-0.21 -15.02 8.50^+0.17_-0.17 1.00^+0.13_-0.14 0.31^+0.20_-0.21 -15.32 -1.00^+0.73_-0.89 0.99^+0.14_-0.13 0.33^+0.19_-0.22 -15.32 9.13^+0.18_-0.17 1.01^+0.13_-0.14 0.31^+0.20_-0.21 -14.72 1.26^+0.47_-0.57 0.99^+0.14_-0.13 0.33^+0.19_-0.22 -14.72 8.72^+0.15_-0.16 1.01^+0.13_-0.14 0.31^+0.20_-0.21 -15.02 -0.31^+0.80_-1.21 0.99^+0.14_-0.13 0.36^+0.17_-0.24 -15.02 8.35^+0.15_-0.16 1.00^+0.14_-0.14 0.31^+0.20_-0.21 -15.32 -2.52^+1.13_-0.99 1.02^+0.12_-0.14 0.24^+0.18_-0.16 -15.32 aThe scaling relation is assumed to be the same at different redshifts (z-independent), i.e., =0 and =0 in Eq. (<ref>). bThe scaling relation is assumed to be evolving with redshift (z-dependent), i.e., =8.69 and =0 in Eq. (<ref>). §.§.§ Redshift-independent cases Figure <ref> shows the constraints on the MBH–host galaxy scaling relations (cf. Eq. <ref>) obtained by assuming that the GWB has the same amplitude as the common process signal discovered in the NANOGrav 12.5-year data set <cit.>. Here we consider the redshift-independent scaling relation between M and M, i.e., =0 and =0. As seen from this figure, can be tightly constrained by the GWB “observations”. To produce a GWB with the same amplitude as the common process signal, the median value of needs to be 9.55 (or 9.13), about 0.86-1.09 dex (or 0.44-0.67 dex) higher than the empirical ones determined [e.g., =8.46 and 8.69 in <cit.> and <cit.>, respectively]. The posterior distributions of show a narrow distribution with a clear peak deviating from the prior boundaries, so that the constraint on is robust. Even though the posterior histogram of in panel (a) hits the right boundary of the prior distribution, we have checked that setting a larger boundary affects little on the constraint. The constraints on and only slightly deviate from their prior distributions, and the constraints on them are weak. Furthermore, there exists some degeneracy between the constraints on the parameter and the parameter or . The constraints on may be understood simply by the relation between the GWB characteristic strain amplitude h and . At a given frequency f, we divide the BBH systems into different subpopulations, with the i-th subpopulation containing N_i BBH systems characterized by their source-rest chirp mass _ c,i and redshift z_i. Then we have h^2= ∑_i N_i h_i^2 with h_i being the sky- and polarization-averaged strain amplitude of the GWs emitted by a BBH system in the i-th subpopulation, and h_i∝_ c,i^5/3. On the other hand, N_i∝_i \|ḟ\|^-1∝_i _ c,i^-5/3, with _i being the coalescence rate of BBHs in the i-th subpopulation. In total, we yield h∝^1/2_i _ c,i^5/6∝^1/2_i 10^5/6 if we keep other parameters in Equation (<ref>) fixed, and a larger means more massive MBHs (BBHs) in the host galaxies, and therefore leading to a larger GWB amplitude. For example, according to the scaling, to make the GWB strain amplitude larger by a factor of 2, need to be increased by ∼0.36 if _i is not significantly affected by the change of (which appears to be a reasonable approximation in the nodel model of Table <ref> below; see the difference of the constrained values between the model and the model, or between the model and the model). The constraints on the MBH–host galaxy scaling relations may also be affected by the consideration of time delays between BBH coalescences, as the time delays affect _i and thus the resulting GWB strain amplitude. To make these effects clear, we show the constraints obtained both with and without considering the time delays in Figure <ref> (see also Tab. <ref>). By comparing the two panels of Figure <ref>, it can be seen that whether or not including the time delays results in significantly different constraints on the scaling relation, especially on . The median values of is increased by ∼ 0.15-0.42 dex when considering the time delays compared with those cases without considering time delays. The reason is that the time delay effects affect _i and decrease the GWB signal amplitude (see Figs. 17 and 19 of CYL20), and thus a larger normalization for the scaling relation is required when considering the time delays. The degeneracy between the constraints on the parameter and the parameter or can be understood in the following way. As mentioned before, a larger means more massive MBHs (BBHs) in the host galaxies, and therefore leading to a larger GWB amplitude. Similarly, a larger means a more massive MBH (BBH) in a galaxy at the high stellar-mass end (see Eq. <ref>), and thus also leads to a larger GWB amplitude as the GWB is mainly contributed by the most massive BBHs. A larger also leads to many more MBHs at the high-mass end comparing with a smaller <cit.>, and thus a larger GWB amplitude. §.§.§ Redshift-dependent cases Figure <ref> shows the resulting posterior distributions of the parameters , , and obtained by assuming that the GWB amplitude is the same as the common process signal. As seen from this figure, a strong positive dependence of the scaling relation on redshift is required (=1.99 or 1.26 in the left or right panel), suggesting that MBHs at high redshifts are significantly larger than those inferred by the local MBH–host galaxy scaling relation. As expected, the required redshift evolution is more significant when considering the time delay effects, compared with that without considering these effects. Note that the constraints on the possible redshift evolutions of the MBH–host galaxy scaling relation are dependent on the model settings, especially the value of in Equation (<ref>), which may be determined by a large sample of MBHs with dynamical mass measurements. Nevertheless, our results demonstrate that the detection of the GWB can be used to obtain strong constraint on the potential redshift evolutions of the MBH–host galaxy scaling relation, and hence provide valuable information for understanding the coevolution history of MBHs and their host galaxies. §.§.§ Different amplitudes of We further consider some cases for which the real GWB contributed by the cosmic BBH population is assumed to be smaller than the common process signal by a factor of 2 or 4, different from the above cases in which the GWB is assumed to be the same as the common process signal (the fiducial cases in this paper). For these cases, we do similar analysis and obtain the “constraints” on the MBH–host galaxy scaling relation (both redshift-independent and dependent) as those for the fiducial cases described above. The resulting median values and 16%–84% quantiles of the parameters in Equation (<ref>) evaluated based on the posterior distributions are shown in Table <ref>. Below we summarize the results inferred from Table <ref>. * in the redshift-independent scaling relation case and in the redshift-dependent scaling relation case are the quantities most sensitive to both the model settings and the choices of the GWB amplitude. The median values of and change little for different model settings and GWB amplitudes, suggesting the weak constraining power of current “observations” on these two parameters. * If the scaling relation has no redshift evolution, the median value of decreases when the GWB amplitude is reduced. Moreover, if the time delays are not considered, the median values of are smaller than their counterparts in the cases where the time delays are considered. Those are consistent with that described in Section <ref> above. * If the scaling relation has redshift evolution, the median value of decreases when the GWB amplitude is reduced. If the time delays are not considered, the median value of are smaller than their counterparts in the cases where the time delays are considered. * The median value of decreases from a positive value to a negative one when the GWB amplitude decreases from the fiducial value to a quarter of the fiducial value, regardless of whether or not the time delays are considered. This reveals the degeneracy between and in the constraint. §.§.§ Comparisons with previous studies Some works in the literature have also tried to obtain effective constraints on the cosmic BBH population from the “detection” of or upper limits on the stochastic GWB (e.g., ). Among these works, <cit.> adopted a parameterized function to describe the cosmic distribution of BBH mergers. <cit.> explored thoroughly the constraining power of PTA detection of the GWB or a non-detection at the =10^-17 level on a large parameter space describing the GSMF, galaxy pair fraction and merger timescale, M–M scaling relation as well as the eccentricities of the BBHs. <cit.> developed a quasar-based BBH model, assuming the proportionality between the BBH population and the quasar population. We directly compare our constraints with those obtained in <cit.> and <cit.> as detailed below. However, it is not straightforward to compare our results with those by <cit.> and <cit.> because of significantly different model settings. <cit.> focused on constraining the MBH–host galaxy scaling relation by using the upper limit on the GWB of = 1× 10^-15 given by <cit.>, which is smaller than the common process signal by a factor of ∼ 2. They found that the resulting constrained scaling relations are compatible with the existing empirical ones <cit.> if considering the time delay effect, while they are not compatible with the empirical ones if ignoring the time delay effect. Our results on the requiring of the scaling relationship significantly different from the empirical ones are different from theirs, which are partly due to that (1) the GWB (assuming to be the same as the common process signal) we adopted is a factor of ∼2 times larger than the upper limit they adopted, and (2) we adopt a realistic and comprehensive BBH population model with detailed consideration of various underlying physics. <cit.> estimated the GWB strain amplitude based on a semi-analytical model allowing gas accretion during mergers to boost the MBH growth. They found that to match the common process signal <cit.>, the resulting MBH mass function at the massive end is higher by a factor of ∼ 3 than that derived from observations. In our study, if assuming that the scaling relation is redshift independent and the GWB has the same amplitude as the common process signal, i.e., model , the scaling relation is required to have a normalization about 0.86-1.1 dex larger than the empirically determined ones. By conversion, this suggests that the MBH mass function at M≳ 10^9 in model is higher than that obtained from the empirical relation by one order of magnitude. The constraints obtained by <cit.> are qualitatively consistent with ours, and the quantitative difference may be due to difference in the BBH models. §.§ Detections of individual BBHs With the BBH population model constrained by the GWB “observations”, we now proceed to estimate the occurrence rate of individual BBHs and confront them with the sensitivity curves of some ongoing and planned PTAs to investigate their detectability. §.§.§ Detection prospects for the Current PTAs Figure <ref> shows the distributions of individual “detectable” BBHs in the strain-frequency diagram and in the celestial sphere, obtained from realizations of the local population of BBHs by the procedures described in Section <ref>. The BBH population model adopted here is the model (see Tab. <ref>), which leads to a GWB with strain amplitude the same as the common process signal <cit.>. Among the 10,000 realizations conducted, 347 loud individual BBHs inside 344 skies are identified with the strain amplitude h_0 at the corresponding celestial coordinates (see the right panel of Fig. <ref>) and GW frequencies above the 95% upper limit skymap of individual BBHs for EPTA taken from <cit.>. We define these sources as “detectable” ones by the EPTA (as a representative of the current PTAs), which are plotted as color filled circles in the figure. For the 347 detectable sources, the maximum and median luminosity distances are ∼ 422 and ∼ 99, respectively, and the majority of them have luminosity distances being within ∼ 200. As also seen from Figure <ref>, for individual CGW sources, those most massive BBH systems (e.g., with chirp mass >10^9) tend to be detected first. Our estimate on the detection probability is larger than that obtained in <cit.> (i.e., 131 skies containing loud individual BBHs among 75,000 realizations) by a factor of ∼20. Both the larger sample size of the local galaxies and the larger normalization () of the adopted MBH–host galaxy scaling relation are responsible for the larger detection probability, especially the latter one. However, the predicted detection probability is still too small for the currently operative PTAs. We also plot these 347 “detectable” sources and the sky-averaged 95% upper limits on the strain amplitude of individual BBHs set by existing PTAs in the left panel of Figure <ref> <cit.>. A larger fraction of these sources are below the sky-averaged upper limits of the PTAs, which indicates that the detection probabilities are boosted when the angular sensitivities of the PTAs are accounted for especially in the regime of small detection probabilities (see also Fig. 1 of ). Figure <ref> shows the detection prospects of the global population of BBHs as individual CGW sources targeted by those existing PTAs. The adopted BBH population model is the same as that adopted in Figure <ref> (i.e., , see Tab. <ref>). To get the detection statistics, we also conduct 10,000 realizations of the global BBH population, among which 587 loud individual BBHs belonging to 563 skies are identified with h_0 at the corresponding sky locations and GW frequencies above the 95% upper limit skymap taken from <cit.>. The detection probability for the global BBH population is only mildly larger than that resulting from the local BBH population (by a factor 2), suggesting that the detection capabilities of the current PTAs on individual BBHs are still limited to relatively local volumes. In the right panels of Figures <ref> and <ref>, the six best millisecond pulsars among the EPTA pulsar set are shown by purple stars <cit.>. The “detectable” loud BBHs tend to accumulate around those best millisecond pulsars, though their sky locations have been isotropically generated in the realizations (see also ). Tables <ref> lists the expected numbers that characterize the detection probabilities of individual BBHs for different sets of models and for different PTAs. As for the models, we consider not only those newly constrained scaling relations in Section <ref> (see Tab. <ref>), but also those admitting the empirically determined ones in the literature (see Tab. <ref>) for comparisons. As for the PTA capabilities, we adopt the 95% upper limit skymap taken from <cit.> as a representative of the current PTA detection capability, and those by improving the <cit.> sensitivity skymap by a factor of 2, 4, 8, or 16, as the representatives for the evolution of the detection capability. Here the sensitivity being improved by a factor of X means the skymap being scaled downward by a factor of X. For each model, and represent the number of skies containing at least one loud individual source and the total number of loud individual sources in 1,000 realizations of the local BBH population, respectively; so are and , except that they are for the global BBH population. For each of the quantities, the median value and 16%–84% quantiles are listed in the Table. For clarity, the detection probabilities for different sets of models and for different PTA detection capabilities are also summarized in Figure <ref>. As seen from Table <ref> and Figure <ref>, the sensitivities of the current PTAs may be not sufficient for the detection of individual BBHs, unless they are improved by a factor of close to 10 or more. For example, adopting the model , the current sensitivity skymap only has a detection probability of 3.2% if limited to the local BBH population, and it increases to 5.9% if adopting the global population. To get a detection probability greater than 95%, the current sensitivity skymap needs to be improved by a factor of ∼ 8, in which case the detection probability reaches 100% and the number of individual BBHs that can be detected is about 9. If limited to the local BBH population, it needs to be improved by a factor of 16, under which circumstance the detection probability can reach 99% and the expected detection number is reduced about 4–5. In this case, the maximum luminosity distance of the detectable BBHs is ∼ 480, and the median luminosity distance is ∼ 90. We emphasize that the model adopted here is the quite optimistic one since the scaling relation in the model has a normalization being greater than that of those empirical ones by nearly one order of magnitude (see Tab. <ref>). As seen from Table <ref> and Figure <ref>, the results obtained from the model are slightly different from those described above by adopting the model . Although the models and produce the same GWB strain amplitude, the former requires more massive BBH systems in the local volume, while the latter requires a larger contribution from relatively higher redshifts. When the PTA detection capability is limited to be relatively local, the model yields a larger detection probability of individual BBHs. Note that in the model, adopting the current sensitivity skymap results in a slightly higher detection probability of the local BBH population compared to that of the global population (the left points of the blue curves in the middle panels of Fig. <ref> ), which is due to that the two populations are obtained in different ways as described in Sections <ref> and <ref>. For the similar reason, some other models (e.g., ; the green curves in the right panel of Fig. <ref>) also result in higher detection probability of the local BBH population compared with that of the global ones. As seen from Table <ref> and Figure <ref>, for detection of the BBH population, in the redshift-dependent model the current sensitivity skymap needs to be improved by a factor of 8 so that the detection probability for the global BBH population can reach 99.2% and the expected detection number is ∼ 5. If the sensitivity skymap is improved by a factor of 16, the detection probability for the local BBH population reaches 99.6% and the expected detection number is ∼ 6. Note that the sensitivity can be improved in different ways, as Section <ref> shows that at a given frequency the threshold sensitivity on the strain amplitude of individual sources h_0, th is proportional to different variable: σ_a, T^-1/2, Δ t^1/2, and ^-1/2 (see Eq. <ref>). For example, if we improve the timing precision by a factor of 16 (i.e., reducing σ_a by a factor of 16), the sensitivity can be improved by a factor of 16; or if we double both the observational period T and the cadence 1/Δ t, then the same improved sensitivity can be achieved by reducing σ_a by a factor of 8. As seen from Table <ref> and Figure <ref>, in the model, the resulting detection probabilities are significantly lower mainly due to the significant smaller in this model than that in the model. Quantitatively, the expected detection probability is merely 0.2%, for both the local and global BBH populations, according to the current sensitivity skymap for EPTA. Even the sensitivity is improved by a factor of 16, the detection probability can only reach 58.9% for the local BBH population and 76.7% for the global BBH population, both of which are smaller than 95%. §.§.§ Detection prospects for CPTA and SKAPTA We proceed to investigate the detection prospects of individual BBHs by CPTA and SKAPTA <cit.> (see Tab. <ref>), and the results are shown in Table <ref>, similarly as done in Table <ref>, and also in Figures <ref>-<ref>. For the conservative configurations of CPTA and SKAPTA, we use the same variables (, , , and ) as those listed in Table <ref>. However, for the optimistic configurations of both PTAs, the detection probabilities are high enough that the results from a single realization can give robust statistics. Therefore, we use and to represent the number of skies containing at least one loud individual source and the total number of loud individual sources in a single realization of the local BBH population. Similarly, we use and to represent the similar quantities, but for the global population. The mean values of the above quantities averaged over 100 realizations are listed in Table <ref>. As seen from Table <ref>, if adopting the conservative CPTA/SKAPTA configurations with T=5, a positive detection of individual BBHs can be achieved if the stochastic GWB has an amplitude close to the reported common process signal, and it can also be achieved for all other models listed in Table <ref> if adopting the optimistic CPTA/SKAPTA configurations with T=20 (Tab. <ref>). For example, given the sensitivities of the conservative-CPTA and the conservative-SKAPTA, the detection probabilities of the global population of BBHs are expected to be both 100% in the model, and 98.2% and 100%, respectively, in the model . If the model is adopted, the detection probabilities are expected to be both 100% for the two conservative PTA configurations, while if the model is adopted, the two detection probabilities are 93.0% and 99.9%, respectively. The detection probabilities reduce to 66.8% and 92.1%, respectively, if adopting the model . If adopting the optimistic CPTA configuration and the model , which produces a GWB with the smallest amplitude among those models considered in this paper, one may still expect to detect 182 and 798 BBHs for the local and global BBH populations, respectively. Figure <ref> shows the expected number of detectable BBHs and the expected SNR of the GWB by different PTAs as a function of the observation time T, where the PTA configurations are the same as those listed in Table <ref> except that T is taken as a free parameter. This figure illustrates how the detection probability/number of individual BBHs and the SNR for the GWB detection depend on the BBH population model and the PTA detection capabilities. The SNRs for the GWB detection is estimated by using Equation (<ref>), the SNRs of individual BBHs are estimated by Equation (<ref>), and the threshold sensitivities on the strain amplitude of individual sources are obtained by using Equation (<ref>). Because both the detection probability/number of individual BBHs and the SNR for the GWB detection depend on the BBH population model, we choose the following three different models to quantify their uncertainties: , , and . The model and the model set the upper and lower boundaries of both quantities as shown by the shaded regions in Figure <ref>, respectively. The results obtained for the two conservative PTA configurations and two optimistic PTA configurations are shown in the top and bottom panels, respectively. In each panel of the figure, we use the green filled circles to mark the observation times when the SNR of the GWB detection equals 3, 5, and 8, respectively. While we use the red filled diamonds to mark the times when the expected number of detectable BBHs reaches 1 and 3 (with a threshold SNR ρ_ th=3), respectively. As seen from Figure <ref>, the detections of the stochastic GWB and individual BBHs are expected to be realized at the time close to each other for those PTAs shown in the figure (see green circles and red diamonds). Taking the conservative-CPTA^∗ as an example, the GWB is expected to be detected with an SNR of 3 after an observation time of 2.8/4.9/8.5 when the model // is adopted. The corresponding observation time needed for a detection number of 3 for individual BBHs (corresponding to a detection probability of ∼ 95%, see Sec. <ref>) is 2.9/6.2/10.9. If increasing the detection SNR to 5 (or 8), the stochastic GWB is expected to be detected in 3.8/7.2/11.1 (or 5.8/10.4/17.3), and the time needed for a detection number of 3 for individual BBHs is 3.3/7.1/12.9 (or 3.7/8.0/14.8). When the conservative-SKAPTA^∗ is adopted, the detection of the GWB with an SNR of 3 (or 5 and 8) is expected in an observation time of 2.1/3.9/6.4 (or 2.6/4.6/7.9 and 3.2/6.0/9.5); and the detection of individual BBHs with 95% detection probability is expected in 2.4/5.2/9.2 (or 2.8/5.9/10.7 and 3.1/6.7/12.1). If the optimistic PTA configurations are considered, positive detections are expected in a shorter time. For the optimistic-CPTA^∗, both detections can be achieved in ∼ 1-3 years, and for the optimistic-SKAPTA^∗, both detections can be achieved in ∼ 1-2 years. Furthermore, the breakthrough of the individual BBH detection is expected to be followed by a quick cumulation of a sizable sample of BBHs as shown by the red shaded region in Figure <ref>. For example, the number of individual BBHs detectable by CPTA with the conservative configuration can amount to ∼ 100 in ∼ 5-18 years since the first detection of individual BBHs. For the optimistic configuration of SKAPTA, one can have ∼ 100 individual BBH detections in ∼ 1-3 years since the first detection of individual BBHs. We note again here that when the PTA sensitivity is sufficiently high, there may be many individual BBHs in a single frequency bin that have characteristic strain higher than the sensitivity curve, and there might be a limit on the total number of these individual BBHs that can be extracted from a single frequency bin. It is quite important to develop efficient data analysis methods for this as those done for a similar problem, i.e., extracting individual double white dwarfs in the low-frequency band for Laser Interferometer Space Antenna (LISA) <cit.>. The distributions of the properties of the detected BBHs contain critical information of the underlying population, and thus may be used to distinguish different BBH population models. Figure <ref> shows the total mass (M), mass ratio (q), redshift (z), and detection SNR (ρ) distributions of those individual BBHs detectable by the optimistic-CPTA and the optimistic-SKAPTA in the left and right panels, respectively. In this figure, the red and blue colors represent the models and , respectively. As seen from the left and right panels, the detectable individual sources resulting from the two models have similar distributions in the total mass M, mass ratio q, and detection SNR ρ, although the absolute number of detectable sources in the model is a little larger than that in the model. The main difference occurs in the redshift distribution. If the scaling relation has redshift evolution, there are less detectable sources at the low-redshifts (i.e., z≲ 1) while more detectable sources at the high-redshifts (i.e., 1≲ z≲ 2.4). By comparing the left and the right panels, one observes that the peak distributions of M and q move towards smaller values, because the optimistic-SKAPTA has a substantially higher sensitivity than the optimistic-CPTA does. Figure <ref> shows the comparison of the individual sources detectable by the conservative PTAs and the optimistic PTAs. As seen in the figure, the small sample of the BBHs detected by PTAs at the beginning do not follow the bulk distributions of the large samples to be accumulated later: they tend to have larger masses (peaking at ∼ 4×10^9M_⊙), larger mass ratios (close to 1), and lower redshifts (∼ 0.1), compared with the large BBH populations to be detected by the optimistic PTAs. § CONCLUSIONS In this paper, we conduct a joint study of the two types of GW signals in the PTA band, including both the stochastic GWB and individual CGW sources, originating from the cosmic population of BBHs. We adopt the formation and evolution model of the cosmic BBHs from CYL20, which is composed of several astrophysical ingredients, including the GSMF, the MRPG, and the MBH–host galaxy scaling relation. First, we set constraints on the BBH population model with the recently discovered common process signal by several different PTAs <cit.>, assuming that the stochastic GWB has a strain amplitude the same as or a fraction of the common process signal. Among the model ingredients, we focus on the constraints on the MBH–host galaxy scaling relation, leaving the other ingredients fixed to their fiducial choices set by current available observations. Both the redshift independent and redshift-dependent scaling relations are considered, the latter may contain important information about the coevolution of MBHs with their host galaxies. Second, with both the constrained scaling relations and those empirical ones from the literature, we explore the detection prospects of individual BBHs by both the PTAs that have been operated for many years and those new and/or future ones using more powerful radio telescopes. Third, we expect that the BBH model can be further constrained when the expected detection probabilities/numbers of the individual sources and the parameter distributions of these detectable sources are confronted with real detections in the future. Below we summarize the main conclusions of this study. * If the MBH-host galaxy scaling relation has no redshift evolution, in order to produce a stochastic GWB with the same amplitude as the common process signal reported by <cit.>, i.e., = 1.92× 10^-15, the median value of (i.e., the normalization factor) in the scaling relation (Eq. <ref>) needs to be 9.55. The constrained value is about 0.86–1.1 higher than the ones empirically determined in the M–M relations taken from <cit.> and <cit.>. If the scaling relation is redshift-dependent, then the stochastic GWB can be produced with the same amplitude as the common process signal by introducing significant redshift evolution to the scaling relation. We demonstrate that the GWB observation can be used to set strong constraints on the potential redshift evolution of the MBH–host galaxy scaling relation, therefore provide valuable information about the coevolution of MBHs and their host galaxies. * For PTAs with the current EPTA sensitivity, the detection probability of individual BBHs is low for all the models considered in this paper. For the model with those empirically determined MBH–host galaxy scaling relations, the detection probabilities of individual BBHs by the currently operative PTAs (e.g., ) are negligible. For example, with the 95% upper limit skymap of EPTA taken from <cit.>, the detection probability of individual BBHs is merely 0.2%, if we adopt the M–M relation from <cit.> in the model. However, with the constrained MBH–host galaxy scaling relations by the reported common process signal, the detection probability increases considerably, e.g., being boosted to 3.2%-5.9%. Despite this significant increase, the detection probabilities are still too small to guarantee a positive detection of individual BBHs by current PTAs. * The detection prospect of individual BBHs is promising, if the sensitivity of PTAs can be improved by an order of magnitude compared with the current EPTA sensitivity. With the redshift-independent scaling relation constrained by the reported common process signal, the detection probability of individual sources reaches 100% if the current EPTA sensitivity skymap is improved by a factor of 8, with about 9 detections being expected. If the detectable BBHs are limited to the local volume (≲ 500 Mpc), the detection probability reaches 99.0% among our realizations if the current EPTA sensitivity skymap is improved by a factor of 16, with 4–5 detections being expected. If adopting the constrained scaling relation with redshift evolution, the resulting detection probabilities and detection statistics of individual BBHs are somewhat smaller than those from the above case without redshift evolution. In addition, adopting the empirically determined scaling relations such as the M–M relation from <cit.>, the detection probability can only reach 58.9% for the local BBH population and 76.7% for the global BBH population even if the current EPTA sensitivity skymap could be improved by a factor of 16. * For CPTA and SKAPTA with the assumed configurations (Tab. <ref>), we estimate both the expected SNR of the GWB detection and the expected detection probability/number of individual BBHs, as a function of the PTA observation time, by considering a wide range of models. For these PTA configurations, it is expected that the detections of the GWB and individual BBHs come at the time close to each other. For the conservative configuration of CPTA, the GWB is expected to be detected with an SNR of 3 within an observation period of ∼3–9. The corresponding time needed for the detection of individual BBHs with a detection probability of 95% is ∼3–11. If increasing the detection SNR to 5 (or 8), the stochastic GWB is expected to be detected in ∼4–12 (or ∼6–18), while individual BBHs are expected to be detected with a probability of 95% in ∼4–13 (or ∼4–15). We emphasize here that both the GWB and individual BBHs can be detected by CPTA within an observation period of 3-4 years, if the contribution from cosmic population of BBHs to the GWB is the same as the common process signal. For the conservative configuration of SKAPTA, the required time for the GWB detection with an SNR of 3 (5, or 8) is ∼3–7 (∼3–8 or ∼4–10); and the required times for the detection of individual BBHs with an SNR threshold of 3 (5, or 8) with 95% detection probability is ∼3–10 (∼3–11, or ∼4–13). For the optimistic configurations of CPTA and SKAPTA, detections of both signals are expected in ∼ 1-3 and 1-2 years, respectively. * The breakthrough of individual BBH detection is expected to be followed by a quick accumulation of a sizable sample of individual sources (e.g., the number of detectable BBHs increases by two orders of magnitude in ∼ 1-12 years since the first detection depends on the PTA configurations). We demonstrate that different BBH population models are expected to be effectively distinguished as they lead to different parameter distributions of detectable sources. Our study shows that the possible redshift evolution of the MBH–host galaxy scaling relation can be constrained by the redshift distribution of the detectable individual BBHs. A positive redshift evolution of the scaling relation means less low-redshift sources and more high-redshift ones than the model in which the scaling relation has no redshift evolution but producing the same GWB strain amplitude. § ACKNOWLEDGEMENTS This work is partly supported by the National SKA Program of China and the National Key Program for Science and Technology Research and Development (grant No. 2020SKA0120101, 2022YFC2205201, 2020YFC2201400), the National Natural Science Foundation of China (grant nos. 11721303, 12173001, 11673001, 11991052), and the Strategic Priority Program of the Chinese Academy of Sciences (grant no. XDB 23040100). lRRRRcclRRRRcclRRRR Detection prospects of individual BBHs by EPTA and its scaled sensitivities. 5cz-independent 5cz-dependent 5cEmpirical relations 1-5 8-12 15-19 Model Model Model 19c Sensitivity skymap of EPTA 32^+4_-6 32^+5_-6 59^+5_-7 62^+4_-8 25^+6_-7 25^+6_-6 21^+6_-6 21^+6_-5 2^+1_-1 2^+1_-1 2^+1_-1 2^+1_-1 5^+3_-2 5^+3_-2 6^+3_-2 6^+3_-2 3^+2_-2 3^+2_-2 3^+3_-1 3^+3_-1 0^+0_-0 0^+0_-0 0^+1_-0 0^+1_-0 0^+1_-0 0^+1_-0 1^+1_-1 1^+1_-1 1^+1_-1 1^+1_-1 1^+2_-1 1^+2_-1 0^+0_-0 0^+0_-0 0^+0_-0 0^+0_-0 41^+6_-7 43^+6_-8 47^+7_-8 48^+7_-8 5^+3_-2 5^+4_-2 8^+2_-3 8^+3_-3 6^+2_-2 6^+2_-2 4^+2_-2 4^+2_-2 6^+3_-2 6^+3_-2 4^+2_-2 4^+2_-2 5^+2_-2 5^+2_-2 5^+2_-2 5^+3_-2 0^+0_-0 0^+0_-0 0^+1_-0 0^+1_-0 0^+1_-0 0^+1_-0 1^+1_-1 1^+1_-1 4^+2_-2 4^+3_-2 3^+2_-2 3^+2_-2 0^+0_-0 0^+0_-0 0^+0_-0 0^+0_-0 19c Sensitivity skymap of EPTA scaled downward by a factor of 2 118^+9_-14 125^+11_-15 281^+15_-13 326^+25_-14 109^+9_-10 115^+10_-10 121^+10_-9 129^+13_-10 11^+4_-3 11^+4_-3 9^+4_-2 9^+4_-2 28^+5_-6 28^+5_-6 31^+4_-5 32^+4_-5 17^+4_-4 17^+5_-4 17^+4_-3 18^+4_-4 0^+1_-0 0^+1_-0 1^+1_-1 1^+1_-1 4^+2_-2 4^+2_-2 5^+2_-2 5^+2_-2 7^+2_-2 7^+2_-2 7^+2_-2 7^+2_-2 0^+0_-0 0^+0_-0 0^+0_-0 0^+0_-0 148^+10_-9 161^+11_-12 236^+13_-12 269^+17_-15 28^+4_-6 28^+4_-5 58^+7_-7 59^+9_-8 30^+8_-5 31^+7_-6 21^+5_-3 22^+5_-4 31^+6_-5 32^+6_-6 24^+5_-3 24^+5_-3 28^+5_-6 28^+5_-5 26^+5_-5 27^+4_-6 1^+1_-1 1^+1_-1 1^+1_-1 1^+1_-1 4^+2_-2 4^+2_-2 4^+2_-2 4^+2_-2 25^+4_-6 25^+5_-6 12^+5_-3 12^+5_-3 0^+1_-0 0^+1_-0 0^+0_-0 0^+0_-0 19c Sensitivity skymap of EPTA scaled downward by a factor of 4 362^+14_-11 452^+16_-23 824^+11_-10 1752^+29_-51 372^+15_-16 465^+20_-23 554^+14_-14 804^+29_-26 53^+9_-7 54^+11_-6 48^+6_-6 49^+7_-7 122^+14_-12 131^+13_-15 161^+11_-11 175^+13_-13 83^+8_-8 87^+7_-9 93^+9_-10 97^+10_-10 3^+2_-2 3^+2_-2 4^+1_-2 4^+1_-2 24^+4_-6 24^+4_-5 22^+4_-4 22^+4_-4 36^+5_-6 36^+7_-6 34^+7_-5 34^+7_-5 1^+1_-1 1^+1_-1 0^+1_-0 0^+1_-0 424^+15_-19 548^+24_-20 770^+13_-15 1465^+42_-35 121^+8_-13 128^+10_-13 360^+16_-20 445^+26_-23 128^+9_-12 136^+13_-13 118^+15_-10 126^+14_-12 132^+12_-12 143^+13_-15 131^+10_-11 141^+11_-14 120^+9_-9 127^+10_-9 129^+11_-9 140^+12_-12 6^+2_-3 6^+2_-3 6^+2_-2 6^+2_-2 26^+5_-7 26^+5_-6 17^+3_-4 17^+3_-4 115^+12_-10 122^+12_-11 60^+8_-8 62^+9_-8 2^+2_-2 2^+2_-2 1^+1_-1 1^+1_-1 19c Sensitivity skymap of EPTA scaled downward by a factor of 8 776^+14_-13 1492^+35_-30 1000^+0_-0 9014^+93_-111 816^+14_-11 1701^+44_-40 992^+2_-4 4781^+70_-72 211^+11_-16 235^+13_-17 237^+9_-17 269^+14_-19 404^+18_-16 518^+25_-27 612^+15_-17 946^+32_-33 320^+16_-12 385^+22_-16 441^+16_-15 582^+26_-25 16^+4_-4 16^+4_-4 18^+4_-3 18^+4_-3 119^+10_-11 127^+10_-13 110^+9_-10 116^+11_-10 152^+11_-9 166^+12_-12 164^+10_-12 179^+10_-14 6^+2_-2 6^+2_-2 2^+2_-1 2^+2_-1 821^+10_-12 1712^+26_-41 1000^+0_-1 7553^+79_-101 394^+11_-15 502^+18_-19 954^+7_-7 3103^+40_-61 400^+18_-16 515^+17_-24 511^+13_-17 716^+24_-36 429^+18_-15 561^+22_-25 552^+14_-17 801^+27_-34 393^+14_-15 498^+20_-21 528^+16_-13 753^+26_-28 29^+6_-4 30^+6_-5 31^+5_-4 32^+5_-5 120^+10_-8 129^+9_-13 88^+7_-10 92^+9_-11 405^+12_-16 518^+22_-25 257^+12_-13 296^+16_-13 10^+2_-3 10^+2_-3 4^+2_-1 4^+2_-1 19c Sensitivity skymap of EPTA scaled downward by a factor of 16 990^+3_-4 4577^+60_-60 1000^+0_-0 44206^+179_-243 996^+2_-1 5698^+69_-72 1000^+0_-0 26368^+182_-135 589^+12_-17 885^+32_-29 767^+13_-16 1440^+41_-33 845^+14_-9 1884^+35_-51 995^+1_-3 5146^+67_-71 779^+16_-12 1515^+43_-45 968^+6_-5 3451^+59_-62 81^+8_-9 84^+10_-10 92^+8_-9 96^+10_-9 432^+17_-16 565^+23_-24 469^+15_-18 633^+24_-26 491^+17_-11 680^+17_-24 593^+17_-16 900^+30_-31 27^+5_-5 28^+4_-6 12^+4_-4 12^+4_-4 993^+3_-2 4880^+50_-60 1000^+0_-0 36718^+161_-156 832^+12_-9 1781^+41_-35 1000^+0_-0 19333^+131_-165 819^+10_-12 1713^+35_-34 977^+4_-4 3779^+73_-80 857^+10_-13 1952^+39_-50 988^+3_-4 4418^+71_-60 826^+12_-13 1745^+35_-45 981^+3_-5 3956^+56_-67 130^+6_-9 139^+9_-11 160^+12_-10 175^+13_-12 433^+16_-16 568^+26_-24 400^+19_-13 514^+25_-21 853^+10_-13 1907^+38_-40 760^+9_-14 1423^+28_-53 42^+7_-6 43^+7_-7 21^+6_-3 21^+6_-3 From left to right, the three big columns correspond to models in which the MBH–host galaxy scaling relations are constrained by the GWB “observations” with (left) and without (middle) redshift evolution, and the empirically determined scaling relations (right). From top to bottom, we adopt the 95% upper limit skymap taken from <cit.>, and those scaled by improving the <cit.> sensitivity skymap by a factor of 2, 4, 8, and 16, respectively. and represent the number of skies containing at least one detectable source and the total number of detectable sources in 1,000 realizations of the local BBH population (see Sec. <ref>). and represent the same quantities, but for the global BBH population (see Sec. <ref>). In the table, the median value and 16%–84% quantiles of each quantity are listed. See the details of the models and the results in Sections <ref> and <ref>. lRRRRcclRRRRcclRRRR Detection prospects of individual BBHs by future PTAs 5cz-independent 5cz-dependent 5cEmpirical relations 1-5 8-12 15-19 Model Model Model 19cSensitivity curve of conservative-CPTA 965^+6_-6 3391^+40_-58 1000^+0_-0 33341^+179_-184 983^+3_-5 4108^+58_-67 1000^+0_-0 20200^+136_-128 481^+12_-17 651^+21_-21 668^+15_-16 1106^+29_-33 750^+13_-17 1389^+37_-47 982^+3_-5 3948^+65_-70 671^+17_-16 1117^+36_-36 930^+7_-8 2675^+49_-64 66^+9_-5 69^+8_-7 71^+8_-7 74^+8_-8 349^+16_-14 429^+22_-21 385^+12_-17 487^+17_-23 401^+11_-17 513^+16_-24 494^+15_-16 683^+26_-27 23^+5_-4 23^+5_-4 9^+3_-2 9^+3_-2 974^+3_-6 3574^+57_-43 1000^+0_-0 27627^+154_-197 726^+14_-16 1293^+37_-34 1000^+0_-0 14981^+121_-149 710^+13_-15 1230^+39_-26 943^+7_-8 2875^+53_-72 754^+16_-11 1415^+24_-46 967^+5_-7 3382^+49_-57 722^+13_-19 1268^+41_-32 950^+7_-6 3017^+43_-60 102^+11_-10 108^+12_-11 127^+12_-12 135^+12_-10 351^+14_-17 426^+27_-20 329^+15_-15 399^+19_-20 746^+12_-11 1375^+31_-43 661^+10_-21 1067^+34_-29 35^+5_-5 35^+7_-5 17^+4_-3 17^+5_-3 19cSensitivity curve of conservative-SKAPTA 997^+2_-2 5786^+75_-75 1000^+0_-0 72261^+265_-354 999^+1_-0 7316^+91_-102 1000^+0_-0 45969^+273_-198 703^+17_-12 1220^+27_-38 921^+8_-7 2544^+42_-61 920^+10_-9 2551^+57_-56 1000^+0_-0 9085^+100_-112 882^+9_-12 2142^+30_-75 999^+1_-2 6460^+59_-95 138^+11_-10 150^+12_-14 159^+11_-15 173^+12_-16 578^+12_-16 860^+26_-27 685^+13_-21 1152^+33_-36 629^+16_-17 988^+31_-31 787^+14_-13 1556^+32_-41 46^+7_-7 48^+7_-8 21^+4_-4 21^+5_-4 998^+1_-2 5952^+61_-79 1000^+0_-0 59788^+178_-302 905^+8_-9 2358^+46_-45 1000^+0_-0 35772^+171_-212 888^+11_-11 2181^+52_-41 998^+1_-1 6471^+90_-94 920^+11_-5 2564^+38_-54 1000^+0_-1 7834^+98_-105 901^+9_-9 2304^+47_-45 999^+1_-1 6821^+78_-91 202^+11_-15 224^+15_-14 273^+14_-10 318^+21_-12 575^+12_-15 847^+35_-28 619^+15_-16 964^+28_-26 920^+8_-7 2518^+55_-41 904^+8_-13 2317^+56_-47 70^+8_-8 73^+9_-10 41^+5_-7 42^+5_-8 5cz-independent 5cz-dependent 5cEmpirical relations 1-5 8-12 15-19 Model Model Model 19cSensitivity curve of optimistic-CPTA 1.00 2020 1.00 711226 1.00 4687 1.00 658531 1.00 1581 1.00 65164 1.00 2577 1.00 212149 1.00 2868 1.00 204405 1.00 696 1.00 8187 1.00 1922 1.00 51281 1.00 1769 1.00 41896 1.00 182 1.00 798 1.00 2089 1.00 655622 1.00 2127 1.00 469602 1.00 1481 1.00 111955 1.00 2095 1.00 182566 1.00 2054 1.00 141318 1.00 762 1.00 13065 1.00 1656 1.00 43657 1.00 2182 1.00 33098 1.00 227 1.00 1372 19cSensitivity curve of optimistic-SKAPTA 1.00 3921 1.00 4213492 1.00 11373 1.00 4213838 1.00 4793 1.00 554767 1.00 6757 1.00 1671546 1.00 7985 1.00 1683315 1.00 2643 1.00 92162 1.00 6062 1.00 524924 1.00 5395 1.00 396741 1.00 739 1.00 7703 1.00 4683 1.00 4361618 1.00 5825 1.00 3299998 1.00 4162 1.00 884334 1.00 5670 1.00 1537738 1.00 5610 1.00 1209601 1.00 2732 1.00 137059 1.00 5121 1.00 461490 1.00 5944 1.00 263286 1.00 856 1.00 12509 The models in this table have similar meanings as those in Table <ref>, excep that the sensitivity curves of the conservative-CPTA, conservative-SKAPTA, optimistic-CPTA, and optimistic-SKAPTA are adopted, respectively (see Tab. <ref>). For the two conservative PTA configurations, and represent the number of skies containing at least one detectable source and the total number of detectable sources in 1,000 realizations of the local BBH population (see Sec. <ref>); while and represent the same quantities, but for the global BBH population (see Sec. <ref>). For the two optimistic PTA configurations, the corresponding quantities denoted by ⟨⟩ (instead of ) show the average results for one single realization (instead of the results of the total 1,000 realizations) of the BBH populations. 0 natexlab#1#1 [Aggarwal et al.(2019)]Aggarwal19cgw Aggarwal, K., Arzoumanian, Z., Baker, P. T., et al. 2019, https://ui.adsabs.harvard.edu/abs/2019ApJ...880..116A , 880, 116. doi:10.3847/1538-4357/ab2236 [Antoniadis et al.(2022)]Antoniadis22cps Antoniadis, J., Arzoumanian, Z., Babak, S., et al. 2022, https://ui.adsabs.harvard.edu/abs/2022MNRAS.tmp...73A . doi:10.1093/mnras/stab3418 [Arzoumanian et al.(2021)]Arzoumanian21 Arzoumanian, Z., Baker, P. T., Brazier, A., et al. 2021, https://ui.adsabs.harvard.edu/abs/2021ApJ...914..121A , 914, 121. doi:10.3847/1538-4357/abfcd3 [Arzoumanian et al.(2020)]Arzoumanian20cps Arzoumanian, Z., Baker, P. T., Blumer, H., et al. 2020, https://ui.adsabs.harvard.edu/abs/2020ApJ...905L..34A , 905, L34. doi:10.3847/2041-8213/abd401 [Babak et al.(2016)]Babak16cgw Babak, S., Petiteau, A., Sesana, A., et al. 2016, https://ui.adsabs.harvard.edu/abs/2016MNRAS.455.1665B , 455, 1665. doi:10.1093/mnras/stv2092 [Barausse et al.(2020)]Barausse20 Barausse, E., Dvorkin, I., Tremmel, M., et al. 2020, https://ui.adsabs.harvard.edu/abs/2020ApJ...904...16B , 904, 16. doi:10.3847/1538-4357/abba7f [Bécsy et al.(2022)]Becsy22 Bécsy, B., Cornish, N. J., & Kelley, L. Z. 2022, https://ui.adsabs.harvard.edu/abs/2022ApJ...941..119B , 941, 119. doi:10.3847/1538-4357/aca1b2 [Begelman et al.(1980)]BBR80 Begelman, M. C., Blandford, R. D., & Rees, M. J. 1980, https://ui.adsabs.harvard.edu/abs/1980Natur.287..307B , 287, 307. doi:10.1038/287307a0 [Behroozi et al.(2019)]Behroozi19 Behroozi, P., Wechsler, R. H., Hearin, A. P., et al. 2019, https://ui.adsabs.harvard.edu/abs/2019MNRAS.488.3143B , 488, 3143. doi:10.1093/mnras/stz1182 [Bell et al.(2003)]Bell03 Bell, E. F., McIntosh, D. H., Katz, N., et al. 2003, https://ui.adsabs.harvard.edu/abs/2003ApJS..149..289B , 149, 289. doi:10.1086/378847 [Berczik et al.(2006)]Berczik06 Berczik, P., Merritt, D., Spurzem, R., & Bischof, H.-P. 2006, http://adsabs.harvard.edu/abs/2006ApJ...642L..21B , 642, L21 [Bian et al.(2021)]Bian21 Bian, L., Cai, R.-G., Cao, S., et al. 2021, https://ui.adsabs.harvard.edu/abs/2021SCPMA..6420401B Science China Physics, Mechanics, and Astronomy, 64, 120401. doi:10.1007/s11433-021-1781-x [Casey-Clyde et al.(2022)]CC22 Casey-Clyde, J. A., Mingarelli, C. M. F., Greene, J. E., et al. 2022, https://ui.adsabs.harvard.edu/abs/2022ApJ...924...93C , 924, 93. doi:10.3847/1538-4357/ac32de [Chen et al.(2017a)]ChenSY17bbh Chen, S., Middleton, H., Sesana, A., et al. 2017, https://ui.adsabs.harvard.edu/abs/2017MNRAS.468..404C , 468, 404. doi:10.1093/mnras/stx475 [Chen et al.(2017b)]ChenSY17ecc Chen, S., Sesana, A., & Del Pozzo, W. 2017, https://ui.adsabs.harvard.edu/abs/2017MNRAS.470.1738C , 470, 1738. doi:10.1093/mnras/stx1093 [Chen et al.(2019)]ChenSY19 Chen, S., Sesana, A., & Conselice, C. J. 2019, https://ui.adsabs.harvard.edu/abs/2019MNRAS.488..401C , 488, 401. doi:10.1093/mnras/stz1722 [Chen et al.(2021)]ChenSiyuan21cps Chen, S., Caballero, R. N., Guo, Y. J., et al. 2021, https://ui.adsabs.harvard.edu/abs/2021MNRAS.508.4970C , 508, 4970. doi:10.1093/mnras/stab2833 [Chen et al.(2020)]CYL20bbh Chen, Y., Yu, Q., & Lu, Y. 2020, https://ui.adsabs.harvard.edu/abs/2020ApJ...897...86C , 897, 86. doi:10.3847/1538-4357/ab9594 (CYL20) [Cornish & Larson(2003)]Cornish03 Cornish, N. J. & Larson, S. L. 2003, https://ui.adsabs.harvard.edu/abs/2003PhRvD..67j3001C , 67, 103001. doi:10.1103/PhysRevD.67.103001 [Crook et al.(2007)]Crook07 Crook, A. C., Huchra, J. P., Martimbeau, N., et al. 2007, https://ui.adsabs.harvard.edu/abs/2007ApJ...655..790C , 655, 790. doi:10.1086/510201 [Decarli et al.(2018)]Decarli18 Decarli, R., Walter, F., Venemans, B. P., et al. 2018, https://ui.adsabs.harvard.edu/abs/2018ApJ...854...97D , 854, 97. doi:10.3847/1538-4357/aaa5aa [Desvignes et al.(2016)]Desvignes16 Desvignes, G., Caballero, R. N., Lentati, L., et al. 2016, https://ui.adsabs.harvard.edu/abs/2016MNRAS.458.3341D , 458, 3341. doi:10.1093/mnras/stw483 [D'Onofrio et al.(2021)]DOnofrio21 D'Onofrio, M., Marziani, P., & Chiosi, C. 2021, https://ui.adsabs.harvard.edu/abs/2021FrASS...8..157D Frontiers in Astronomy and Space Sciences, 8, 157. doi:10.3389/fspas.2021.694554 [Enoki & Nagashima(2007)]Enoki07 Enoki, M. & Nagashima, M. 2007, https://ui.adsabs.harvard.edu/abs/2007PThPh.117..241E Progress of Theoretical Physics, 117, 241. doi:10.1143/PTP.117.241 [Feng et al.(2020)]FengYi20 Feng, Y., Li, D., Zheng, Z., et al. 2020, https://ui.adsabs.harvard.edu/abs/2020PhRvD.102b3014F , 102, 023014. doi:10.1103/PhysRevD.102.023014 [Ferrarese & Merritt(2000)]Ferrarese00 Ferrarese, L. & Merritt, D. 2000, https://ui.adsabs.harvard.edu/abs/2000ApJ...539L...9F , 539, L9. doi:10.1086/312838 [Foreman-Mackey et al.(2013)]emcee Foreman-Mackey, D., Hogg, D. W., Lang, D., et al. 2013, https://ui.adsabs.harvard.edu/abs/2013PASP..125..306F , 125, 306. doi:10.1086/670067 [Gallazzi et al.(2006)]Gallazzi06 Gallazzi, A., Charlot, S., Brinchmann, J., et al. 2006, https://ui.adsabs.harvard.edu/abs/2006MNRAS.370.1106G , 370, 1106. doi:10.1111/j.1365-2966.2006.10548.x [Gebhardt et al.(2000)]Gebhardt00 Gebhardt, K., Bender, R., Bower, G., et al. 2000, https://ui.adsabs.harvard.edu/abs/2000ApJ...539L..13G , 539, L13. doi:10.1086/312840 [Goncharov et al.(2021)]Goncharov21cps Goncharov, B., Shannon, R. M., Reardon, D. J., et al. 2021, https://ui.adsabs.harvard.edu/abs/2021ApJ...917L..19G , 917, L19. doi:10.3847/2041-8213/ac17f4 [Gültekin et al.(2009)]Gultekin09 Gültekin, K., Richstone, D. O., Gebhardt, K., et al. 2009, https://ui.adsabs.harvard.edu/abs/2009ApJ...698..198G , 698, 198. doi:10.1088/0004-637X/698/1/198 [Guo et al.(2022)]GLY22nf Guo, X., Lu, Y., & Yu, Q. 2022, https://ui.adsabs.harvard.edu/abs/2022ApJ...939...55G , 939, 55. doi:10.3847/1538-4357/ac9131 [Haiman et al.(2009)]Haiman09 Haiman, Z., Kocsis, B., & Menou, K. 2009, , 700, 1952 [Hellings & Downs(1983)]HD83 Hellings, R. W. & Downs, G. S. 1983, https://ui.adsabs.harvard.edu/abs/1983ApJ...265L..39H , 265, L39. doi:10.1086/183954 [Hobbs et al.(2010)]Hobbs10 Hobbs, G., Archibald, A., Arzoumanian, Z., et al. 2010, https://ui.adsabs.harvard.edu/abs/2010CQGra..27h4013H Classical and Quantum Gravity, 27, 084013. doi:10.1088/0264-9381/27/8/084013 [Huchra et al.(2012)]Huchra12 Huchra, J. P., Macri, L. M., Masters, K. L., et al. 2012, https://ui.adsabs.harvard.edu/abs/2012ApJS..199...26H , 199, 26. doi:10.1088/0067-0049/199/2/26 [Izquierdo-Villalba et al.(2022)]IV22 Izquierdo-Villalba, D., Sesana, A., Bonoli, S., et al. 2022, https://ui.adsabs.harvard.edu/abs/2022MNRAS.509.3488I , 509, 3488. doi:10.1093/mnras/stab3239 [Jarrett et al.(2000)]Jarrett00 Jarrett, T. H., Chester, T., Cutri, R., et al. 2000, https://ui.adsabs.harvard.edu/abs/2000AJ....119.2498J , 119, 2498. doi:10.1086/301330 [Joshi et al.(2018)]Joshi18 Joshi, B. C., Arumugasamy, P., Bagchi, M., et al. 2018, https://ui.adsabs.harvard.edu/abs/2018JApA...39...51J Journal of Astrophysics and Astronomy, 39, 51. doi:10.1007/s12036-018-9549-y [Kelley et al.(2017)]Kelley17 Kelley, L. Z., Blecha, L., Hernquist, L., et al. 2017, https://ui.adsabs.harvard.edu/abs/2017MNRAS.471.4508K , 471, 4508. doi:10.1093/mnras/stx1638 [Kelley et al.(2018)]Kelley18 Kelley, L. Z., Blecha, L., Hernquist, L., et al. 2018, https://ui.adsabs.harvard.edu/abs/2018MNRAS.477..964K , 477, 964. doi:10.1093/mnras/sty689 [Khan et al.(2011)]Khan11 Khan, F. M., Just, A., & Merritt, D. 2011, http://adsabs.harvard.edu/abs/2011ApJ...732...89K , 732, 89 [Khan et al.(2013)]Khan13 Khan, F. M., Holley-Bockelmann, K., Berczik, P., & Just, A. 2013, http://adsabs.harvard.edu/abs/2013ApJ...773..100K , 773, 100 [Kormendy & Ho(2013)]KH13 Kormendy, J. & Ho, L. C. 2013, https://ui.adsabs.harvard.edu/abs/2013ARA , 51, 511. doi:10.1146/annurev-astro-082708-101811 [Kramer & Champion(2013)]Kramer13 Kramer, M. & Champion, D. J. 2013, https://ui.adsabs.harvard.edu/abs/2013CQGra..30v4009K Classical and Quantum Gravity, 30, 224009. doi:10.1088/0264-9381/30/22/224009 [Littenberg(2011)]Littenberg11 Littenberg, T. B. 2011, https://ui.adsabs.harvard.edu/abs/2011PhRvD..84f3009L , 84, 063009. doi:10.1103/PhysRevD.84.063009 [Maggiore(2018)]Maggiore18 Maggiore, M. 2018, Gravitational Waves: Vol. 2, Astrophysics and cosmology (Oxford University Press) [Moore et al.(2015)]Moore15pta Moore, C. J., Taylor, S. R., & Gair, J. R. 2015, https://ui.adsabs.harvard.edu/abs/2015CQGra..32e5004M Classical and Quantum Gravity, 32, 055004. doi:10.1088/0264-9381/32/5/055004 [Lauer et al.(2007)]Lauer07bh Lauer, T. R., Faber, S. M., Richstone, D., et al. 2007, https://ui.adsabs.harvard.edu/abs/2007ApJ...662..808L , 662, 808. doi:10.1086/518223 [Lee(2016)]LeeKJ16 Lee, K. J. 2016, https://ui.adsabs.harvard.edu/abs/2016ASPC..502...19L Frontiers in Radio Astronomy and FAST Early Sciences Symposium 2015, 502, 19 [Manchester et al.(2013)]Manchester13 Manchester, R. N., Hobbs, G., Bailes, M., et al. 2013, https://ui.adsabs.harvard.edu/abs/2013PASA...30...17M , 30, e017. doi:10.1017/pasa.2012.017 [Mayer et al.(2007)]Mayer07 Mayer, L., Kazantzidis, S., Madau, P., et al. 2007, Science, 316, 1874 [McConnell & Ma(2013)]MM13 McConnell, N. J. & Ma, C.-P. 2013, https://ui.adsabs.harvard.edu/abs/2013ApJ...764..184M , 764, 184. doi:10.1088/0004-637X/764/2/184 [McLaughlin(2013)]McLaughlin13 McLaughlin, M. A. 2013, https://ui.adsabs.harvard.edu/abs/2013CQGra..30v4008M Classical and Quantum Gravity, 30, 224008. doi:10.1088/0264-9381/30/22/224008 [McLure et al.(2006)]McLure06 McLure, R. J., Jarvis, M. J., Targett, T. A., et al. 2006, https://ui.adsabs.harvard.edu/abs/2006MNRAS.368.1395M , 368, 1395. doi:10.1111/j.1365-2966.2006.10228.x [Merloni et al.(2010)]Merloni10 Merloni, A., Bongiorno, A., Bolzonella, M., et al. 2010, https://ui.adsabs.harvard.edu/abs/2010ApJ...708..137M , 708, 137. doi:10.1088/0004-637X/708/1/137 [Middleton et al.(2016)]Middleton16 Middleton, H., Del Pozzo, W., Farr, W. M., et al. 2016, https://ui.adsabs.harvard.edu/abs/2016MNRAS.455L..72M , 455, L72. doi:10.1093/mnrasl/slv150 [Middleton et al.(2021)]Middleton21 Middleton, H., Sesana, A., Chen, S., et al. 2021, https://ui.adsabs.harvard.edu/abs/2021MNRAS.502L..99M , 502, L99. doi:10.1093/mnrasl/slab008 [Mingarelli et al.(2017)]Mingarelli17 Mingarelli, C. M. F., Lazio, T. J. W., Sesana, A., et al. 2017, https://ui.adsabs.harvard.edu/abs/2017NatAs...1..886M Nature Astronomy, 1, 886. doi:10.1038/s41550-017-0299-6 [Mohanty & Nayak(2006)]Mohanty06 Mohanty, S. D. & Nayak, R. K. 2006, https://ui.adsabs.harvard.edu/abs/2006PhRvD..73h3006M , 73, 083006. doi:10.1103/PhysRevD.73.083006 [Mould et al.(2000)]Mould00 Mould, J. R., Huchra, J. P., Freedman, W. L., et al. 2000, https://ui.adsabs.harvard.edu/abs/2000ApJ...529..786M , 529, 786. doi:10.1086/308304 [Muzzin et al.(2013)]Muzzin13 Muzzin, A., Marchesini, D., Stefanon, M., et al. 2013, https://ui.adsabs.harvard.edu/abs/2013ApJ...777...18M , 777, 18. doi:10.1088/0004-637X/777/1/18 [NANOGrav Collaboration(2018)]NANOGrav18 NANOGrav Collaboration 2018, https://ui.adsabs.harvard.edu/abs/2018arXiv181006594N arXiv:1810.06594 [Nan et al.(2011)]NanRendong11 Nan, R., Li, D., Jin, C., et al. 2011, https://www.worldscientific.com/doi/abs/10.1142/S0218271811019335 International Journal of Modern Physics D, 20, 989, doi:10.1142/S0218271811019335 [Padilla & Strauss(2008)]Padilla08 Padilla, N. D. & Strauss, M. A. 2008, https://ui.adsabs.harvard.edu/abs/2008MNRAS.388.1321P , 388, 1321. doi:10.1111/j.1365-2966.2008.13480.x [Phinney(2001)]Phinney01 Phinney, E. S. 2001, https://ui.adsabs.harvard.edu/abs/2001astro.ph..8028P astro-ph/0108028 [Porayko et al.(2018)]Porayko18 Porayko, N. K., Zhu, X., Levin, Y., et al. 2018, https://ui.adsabs.harvard.edu/abs/2018PhRvD..98j2002P , 98, 102002. doi:10.1103/PhysRevD.98.102002 [Preto et al.(2011)]Preto11 Preto, M., Berentzen, I., Berczik, P., & Spurzem, R. 2011, http://adsabs.harvard.edu/abs/2011ApJ...732L..26P , 732, L2 [Ravi et al.(2015)]Ravi15 Ravi, V., Wyithe, J. S. B., Shannon, R. M., et al. 2015, https://ui.adsabs.harvard.edu/abs/2015MNRAS.447.2772R , 447, 2772. doi:10.1093/mnras/stu2659 [Rodriguez-Gomez et al.(2015)]Rodriguez-Gomez15 Rodriguez-Gomez, V., Genel, S., Vogelsberger, M., et al. 2015, https://ui.adsabs.harvard.edu/abs/2015MNRAS.449...49R , 449, 49. doi:10.1093/mnras/stv264 [Roebber et al.(2016)]Roebber16 Roebber, E., Holder, G., Holz, D. E., et al. 2016, https://ui.adsabs.harvard.edu/abs/2016ApJ...819..163R , 819, 163. doi:10.3847/0004-637X/819/2/163 [Rosado et al.(2015)]Rosado15 Rosado, P. A., Sesana, A., & Gair, J. 2015, https://ui.adsabs.harvard.edu/abs/2015MNRAS.451.2417R , 451, 2417. doi:10.1093/mnras/stv1098 [Salviander et al.(2007)]Salviander07 Salviander, S., Shields, G. A., Gebhardt, K., et al. 2007, https://ui.adsabs.harvard.edu/abs/2007ApJ...662..131S , 662, 131. doi:10.1086/513086 [Schulze & Wisotzki(2014)]Schulze14 Schulze, A. & Wisotzki, L. 2014, https://ui.adsabs.harvard.edu/abs/2014MNRAS.438.3422S , 438, 3422. doi:10.1093/mnras/stt2457 [Sesana et al.(2008)]Sesana08 Sesana, A., Vecchio, A., & Colacino, C. N. 2008, https://ui.adsabs.harvard.edu/abs/2008MNRAS.390..192S , 390, 192. doi:10.1111/j.1365-2966.2008.13682.x [Sesana et al.(2009)]Sesana09 Sesana, A., Vecchio, A., & Volonteri, M. 2009, https://ui.adsabs.harvard.edu/abs/2009MNRAS.394.2255S , 394, 2255. doi:10.1111/j.1365-2966.2009.14499.x [Sesana(2013)]Sesana13cqg Sesana, A. 2013, https://ui.adsabs.harvard.edu/abs/2013CQGra..30v4014S Classical and Quantum Gravity, 30, 224014. doi:10.1088/0264-9381/30/22/224014 [Sesana(2013)]Sesana13 Sesana, A. 2013, https://ui.adsabs.harvard.edu/abs/2013MNRAS.433L...1S , 433, L1. doi:10.1093/mnrasl/slt034 [Sesana et al.(2016)]Sesana16 Sesana, A., Shankar, F., Bernardi, M., et al. 2016, https://ui.adsabs.harvard.edu/abs/2016MNRAS.463L...6S , 463, L6. doi:10.1093/mnrasl/slw139 [Shankar et al.(2016)]Shankar16 Shankar, F., Bernardi, M., Sheth, R. K., et al. 2016, https://ui.adsabs.harvard.edu/abs/2016MNRAS.460.3119S , 460, 3119. doi:10.1093/mnras/stw678 [Shannon et al.(2015)]Shannon15gwb Shannon, R. M., Ravi, V., Lentati, L. T., et al. 2015, https://ui.adsabs.harvard.edu/abs/2015Sci...349.1522S Science, 349, 1522. doi:10.1126/science.aab1910 [Siemens et al.(2013)]Siemens13 Siemens, X., Ellis, J., Jenet, F., et al. 2013, https://ui.adsabs.harvard.edu/abs/2013CQGra..30v4015S Classical and Quantum Gravity, 30, 224015. doi:10.1088/0264-9381/30/22/224015 [Simon & Burke-Spolaor(2016)]SB16 Simon, J. & Burke-Spolaor, S. 2016, https://ui.adsabs.harvard.edu/abs/2016ApJ...826...11S , 826, 11. doi:10.3847/0004-637X/826/1/11 [Smits et al.(2009)]Smits09 Smits, R., Kramer, M., Stappers, B., et al. 2009, https://ui.adsabs.harvard.edu/abs/2009A , 493, 1161. doi:10.1051/0004-6361:200810383 [Spiewak et al.(2022)]Spiewak22MPTA Spiewak, R., Bailes, M., Miles, M. T., et al. 2022, https://ui.adsabs.harvard.edu/abs/2022PASA...39...27S , 39, e027. doi:10.1017/pasa.2022.19 [Sykes et al.(2022)]Sykes22 Sykes, B., Middleton, H., Melatos, A., et al. 2022, https://ui.adsabs.harvard.edu/abs/2022MNRAS.511.5241S , 511, 5241. doi:10.1093/mnras/stac388 [Tremaine et al.(2002)]Tremaine02 Tremaine, S., Gebhardt, K., Bender, R., et al. 2002, https://ui.adsabs.harvard.edu/abs/2002ApJ...574..740T , 574, 740. doi:10.1086/341002 [Tully et al.(2016)]Tully16 Tully, R. B., Courtois, H. M., & Sorce, J. G. 2016, https://ui.adsabs.harvard.edu/abs/2016AJ....152...50T , 152, 50. doi:10.3847/0004-6256/152/2/50 [Verbiest et al.(2016)]Verbiest16gwb Verbiest, J. P. W., Lentati, L., Hobbs, G., et al. 2016, https://ui.adsabs.harvard.edu/abs/2016MNRAS.458.1267V , 458, 1267. doi:10.1093/mnras/stw347 [Wang & Mohanty(2017)]WangYan17 Wang, Y. & Mohanty, S. D. 2017, https://ui.adsabs.harvard.edu/abs/2017PhRvL.118o1104W , 118, 151104. doi:10.1103/PhysRevLett.118.151104 [Wu et al.(2022)]WuYM22 Wu, Y.-M., Chen, Z.-C., Huang, Q.-G., et al. 2022, https://ui.adsabs.harvard.edu/abs/2022PhRvD.106h1101W , 106, L081101. doi:10.1103/PhysRevD.106.L081101 [Wyithe & Loeb(2003)]WL03 Wyithe, J. S. B. & Loeb, A. 2003, https://ui.adsabs.harvard.edu/abs/2003ApJ...590..691W , 590, 691. doi:10.1086/375187 [Yu(2002)]Yu02 Yu, Q. 2002, https://ui.adsabs.harvard.edu/abs/2020ApJ...897...86C , 331, 935. doi:10.1046/j.1365-8711.2002.05242.x [Yu & Lu(2004)]YL04qso Yu, Q. & Lu, Y. 2004, https://ui.adsabs.harvard.edu/abs/2004ApJ...602..603Y , 602, 603. doi:10.1086/381049 [Zhang et al.(2012)]ZLY12 Zhang, X., Lu, Y., & Yu, Q. 2012, https://ui.adsabs.harvard.edu/abs/2012ApJ...761....5Z , 761, 5. doi:10.1088/0004-637X/761/1/5 [Zhang et al.(2021)]ZhangXH21 Zhang, X.-H., Mohanty, S. D., Zou, X.-B., et al. 2021, https://ui.adsabs.harvard.edu/abs/2021PhRvD.104b4023Z , 104, 024023. doi:10.1103/PhysRevD.104.024023 [Zhu et al.(2014)]ZhuXingjiang14cgw Zhu, X.-J., Hobbs, G., Wen, L., et al. 2014, https://ui.adsabs.harvard.edu/abs/2014MNRAS.444.3709Z , 444, 3709. doi:10.1093/mnras/stu1717
http://arxiv.org/abs/2306.01526v1	20230602132623	Group channel pruning and spatial attention distilling for object detection	[ "Yun Chu", "Pu Li", "Yong Bai", "Zhuhua Hu", "Yongqing Chen", "Jiafeng Lu" ]	cs.CV	[ "cs.CV", "cs.AI" ]	Yun Chu, Yong Bai, Zhuhua Hu, Yongqing Chen, Jiafeng Lu are with School of Information and Communication Engineering, Hainan University, Haikou, 570288, China Pu Li is with the School of Software and Microelectronics, Peking University, Beijing, 100871, China. Correspondence should be addressed to Yong Bai, E-mail: [email protected] Group channel pruning and spatial attention distilling for object detection Yun Chu Pu Li Yong Bai Zhuhua Hu Yongqing Chen Jiafeng Lu Received: date 2021.09 / Accepted: 2022.03 ================================================================================== Due to the over-parameterization of neural networks, many model compression methods based on pruning and quantization have emerged. They are remarkable in reducing the size, parameter number, and computational complexity of the model. However, most of the models compressed by such methods need the support of special hardware and software, which increases the deployment cost. Moreover, these methods are mainly used in classification tasks, and rarely directly used in detection tasks. To address these issues, for the object detection network we introduce a three-stage model compression method: dynamic sparse training, group channel pruning, and spatial attention distilling. Firstly, to select out the unimportant channels in the network and maintain a good balance between sparsity and accuracy, we put forward a dynamic sparse training method, which introduces a variable sparse rate, and the sparse rate will change with the training process of the network. Secondly, to reduce the effect of pruning on network accuracy, we propose a novel pruning method called group channel pruning. In particular, we divide the network into multiple groups according to the scales of the feature layer and the similarity of module structure in the network, and then we use different pruning thresholds to prune the channels in each group. Finally, to recover the accuracy of the pruned network, we use an improved knowledge distillation method for the pruned network. Especially, we extract spatial attention information from the feature maps of specific scales in each group as knowledge for distillation. In the experiments, we use YOLOv4 as the object detection network and PASCAL VOC as the training dataset. Our method reduces the parameters of the model by 64.7% and the calculation by 34.9%. When the input image size is 416×416, compared with the original network model with 256MB size and 87.1 accuracies, our compressed model achieves 86.6 accuracies with 90MB size. To demonstrate the generality of our method, we replace the backbone to Darknet53 and Mobilenet and also achieve satisfactory compression results. § INTRODUCTION In recent years, CNNs (Convolutional Neural Networks) have become the dominant methods for various computer vision tasks, such as image classification <cit.>, object detection <cit.>, and segmentation<cit.>. The classification networks include AlexNet <cit.>, ResNet <cit.>, MobileNets <cit.>, and the object detection networks include Faster-RCNN <cit.>, SSD <cit.>, YOLOv3 ∼ v4 <cit.>, <cit.>. The neural network models for those tasks have evolved from 8 layers to more than 100 layers. Though the large networks have strong feature representation ability, they consume more resources. As an example, the depth of the YOLOv4 network reaches 162 layers, the size of the model is 256 MB, and the number of parameters is 64 million. When processing a picture of 416×416 size, it needs 29G FLOPs (Floating Point Operations Per Second), and the intermediate variables will occupy more memory. Taking into account the size of the model, the memory needed for inferencing and the amount of computation are unbearable for resource-limited embedded devices. To address the deployment problem of neural networks in mobile or embedded equipment, many model compression works are based on pruning, quantification, knowledge distillation, and lightweight network design methods. In the pruning work, the pruning methods based on weight level were proposed <cit.> and <cit.> to reduce the number of parameters of the model without affecting the accuracy of the network. However, the pruned models based on weight level requires special hardware accelerators to be deployed, such as <cit.>. To save the cost of deployment, pruning methods based on filter level were proposed in <cit.>, <cit.>, and these methods will not require special hardware support. In the quantification work, the binary network and ternary network were proposed in <cit.> and <cit.>, respectively. In <cit.> and <cit.>, they combine the pruning with quantization and apply it to the classification network. In the work <cit.>, the information of pre-trained parameters is used to assign the compression ratio of each layer, and the method of the shared codebook is used to quantify and they achieve a good compression effect. Though the low-bit quantification network can reduce the size of the model, they bring great accuracy loss and usually need a special software acceleration library to support deployment. The above pruning and quantization investigations are mainly used in classification networks, and not much has been examined for applying them to detection networks. Pruning and quantization are to compress the existing network structure and parameters. In contrast, knowledge distillation and lightweight network design optimize or directly design a new network structure, that is avoid the accuracy loss caused by pruning or quantization. Knowledge distillation is an approach to improve the performance of the student network by using the teacher network. Hinton first applied the idea of distillation to the classification network <cit.>.Afterwards, knowledge distillation has been widely used in computer vision <cit.>,<cit.>,<cit.>, natural language processing <cit.>, speech recognition <cit.>. Although knowledge distillation can improve the performance of the student network to a certain extent, its effect on reducing the parameters and size of the model is far from pruning. Moreover, how to represent the knowledge to be distilled between the teacher network and the student network is a problem. The structural difference between the teacher and the student network has a great influence on the distillation effect. In <cit.> knowledge distillation is combined with representation learning to reduce the influence of structural difference on distillation. The work <cit.> gives a reference to use the representation learning to solve the problem of partial view alignment. <cit.> present a weakly supervised in object detection, this method require only image labels and counts of the objects of each class in the image, by this combination produce a clear localization of objects in the scene through a masking technique between class activation maps and regression activation maps, these work may solve the problem of knowledge representation in distillation to some extent. Lightweight network design is a direct design of small networks or modules, the article <cit.> presents a lightweight network application in object detection tasks, including attention feature module to improve network accuracy, constant channel module to save memory access costs. Two different encoder-decoder lightweight architectures for semantic segmentation tasks were proposed in <cit.> and <cit.>, respectively. The former work up-samples the convolution features of deep layer to the shallow deconvolution layers to enhance the contextual cues, and the later work uses channel split and shuffle modules in the encoder to reduce the number of parameters, and introduces an attention module in the decoder to improve the accuracy. By directly designing lightweight modules, a good balance between the accuracy and the size of the model can be achieved, these lightweight networks can be well combined with tasks in autonomous driving, like<cit.>. Such these well-designed modules or networks <cit.>, <cit.>, <cit.>, <cit.>, <cit.>, can normally run on laboratory host machines. However, if we want to deploy these networks successfully on edge devices, a lot of experiments and modifications are needed to verify their effectiveness. Before the network is deployed to the edge device, the parameters and network need to be quantified and compiled. Usually, some innovative modules or network layers cannot be compiled and passed (due to the limitation of the instruction set and basic operators on the hardware device), which hinders the deployment of these lightweight networks to edge devices and reduces the versatility of these modules. In the object detection task, model compression is mainly realized by knowledge distillation, and there exists little work to combine pruning with knowledge distillation. In short, the existing model compression works have the following limitations: 1. Most pruning and quantization models need special hardware circuits or software acceleration library support, which increases the cost to deploy these models to the edge device. 2. In the object detection networks, the model compression methods are mainly realized by knowledge distillation, and the compression effect is not satisfactory. Pruning is widely used in the classification network but directly applied in object detection. To tackle the above problems, we propose a three-stage model compression method for object detection tasks: dynamic sparse training, grouping channel pruning, and spatial attention distillation. As shown in Fig.1, we briefly describe the implementation of the proposed three-stage model compression method. Firstly, we sparsely train the network. Sparse training is to make the distribution of γ coefficient in the BN layer close to 0, and then the value of γ coefficient is used as the importance scale factor of the channel to select out the insignificant channels in the network. The traditional sparse training method uses a constant sparse rate in the training process, which is time-consuming and difficult to make a good balance between the sparsity and accuracy of the network. Therefore, we introduce a variable sparse rate to accelerate the sparse training of the network and achieve a good balance between the sparsity and accuracy of the network, details are in Section 4.1 Next, we prune the network. Most of the traditional pruning methods are used in classification networks, and all channels in the network are pruned with the same threshold. In contrast, we divide the detection network into multiple groups. In grouping, we mainly consider the scale of feature layers and the similarity of module structure in the network, the feature layers with the same scale and the layers have similar module structure are assigned to the same one group. After that, each group obtains the pruning threshold according to the current group's pruning ratio, then we prune the channels according to the pruning threshold in each group, thus achieving more accurate and efficient pruning of the detection network, details are in Section 4.2. At last, when pruning the channel of the detection network, we notice that with the increase of the detection category and pruning ratio, pruning will bring greater accuracy loss to the model. To recover the accuracy of the network after grouping pruning, we introduce knowledge distillation to the pruned network. Particularly, we extract spatial attention information from the feature maps of specific scales in each group as knowledge and distill the pruned network, details are in Section 4.3. To the best of our knowledge, the work to combine pruning with spatial attention distillation and apply it to object detection tasks is currently rarely explored. The main contributions of this paper are summarized as follows: 1) To improve the efficiency of sparse training, we design a dynamic sparse training method which use variable sparsity rate to accelerate the process of sparse training, the network achieves a better trade-off between sparsity and accuracy. 2) For the object detection network, we propose a novel pruning method, called group channel pruning. We divide the detection network into multiple groups. During the group, we comprehensively consider the scale of feature layers and the similarity of module structure in the network. After that, each group obtains the pruning threshold according to different pruning ratios, then we prune the channels in each group to achieve more accurate and efficient pruning of the detection network. 3) To recover the accuracy of the pruning network model, we introduce knowledge distillation to the network after grouping pruning. In particular, we extract spatial attention information only from the feature maps of specific scales in each group as knowledge and distill the pruned network. Furthermore, we demonstrate that our distillation method is not only suited for our pruning method but also can combine with other common pruning methods. 4) We conduct extensive experiments on the PASCAL VOC data set with the YOLOV4 network to verify the effectiveness of the proposed method. To demonstrate the generality of our method, we also use Darknet53 and Mobilenet as the backbone to construct the detection network, the experimental results show that our method has other applicability. In addition, we deploy the compression model on the edge device Jetson nano, which proves that our compression model can be deployed without special hardware support and can achieve an acceleration effect. § RELATED WORK In this section, we briefly review the related works of pruning and knowledge distillation. §.§ Network Pruning The idea of pruning is to reduce the redundancy of structure and parameters in neural networks so that the network becomes more lightweight and efficient. The research of pruning focuses on two aspects. One is what kind of objects in the network can be pruned, and the other is how to measure the importance of the content being pruned. From the perspective of the object being pruned, the current pruning method can be divided into unstructured pruning and structured pruning. Unstructured pruning refers to that the topological structure of the network becomes irregular and unstructured after the network is pruned, and they often prune the connection weights between neurons. For example, in <cit.> and <cit.>, the absolute value of the weight is taken as the metric of its pruning. The advantage of unstructured pruning is that the pruning rate can reach a high level without affecting the precision of the network. The disadvantage is that it needs the support of special hardware circuits, which increases the cost of deployment. Structured pruning means that the network topology has not changed after pruning. Usually pruning at the filter <cit.>, channel <cit.>, layer <cit.> levels. The work in <cit.> prunes the unimportant filter in the current layer by calculating the statistical information of the subsequent layer. Liu et al <cit.> propose a structured channel pruning method for classification networks, and the compressed model does not require special hardware and software support. The work in <cit.> uses the subspace projection method to measure the importance of the network layer, prunes the layer in the network, and verifies that the layer pruning is better than the filter pruning in resource utilization. The advantage of the structured pruning method is that the network after pruning does not need the support of special hardware circuits, and the disadvantage is that the pruning rate cannot reach very high. Rethinking the Value of Network Pruning <cit.> discussed the significance of network pruning. Their work pointed out that the role played by pruning was similar to that of network architecture search (NAS). After that, <cit.> bring the idea of NAS into pruning, proposes a batch normalization module to measure the importance of each structure in the network, and uses this NAS pruning method to the classification network. In this paper, we inherit the idea of sparse training in <cit.>, different from that, we introduce variable sparse rate to conduct dynamic sparse training on the network, which improves the trade-off between sparsity and accuracy of the network. §.§ Knowledge distillation The purpose of knowledge distillation is to transfer the knowledge learned from the teacher network to the student network to improve the performance of the student network. The research of knowledge distillation focuses on two aspects. One is which object in the network is selected as knowledge. The other is how to measure whether the student network learns the knowledge, which is reflected in how to design the loss function of distillation. Concerning what to be selected as knowledge, current distillation methods can be divided into three categories: 1. Using the final class information output of the teacher network as knowledge as in <cit.>, <cit.>, <cit.>. 2. Using the middle feature layer of teachers' network as knowledge as in <cit.>, <cit.>. 3. Using the structural relationship between the layers of teacher network as knowledge as in <cit.>. In the classification network, <cit.> proposed to extract the attention from the feature layer and express the attention information in a heat map. Then, the loss function is constructed using the attention of the teacher network and the student network. Search to Distill: <cit.> introduced the knowledge distillation method into NAS, and obtained the following conclusions through experiments, the structure of student network determines the upper bound that the distillation effect can reach, and the distillation effect is better when the network structure of students and teachers is similar. Inspired by the above research work, we combine pruning with knowledge distillation. In this paper, the idea of our distillation is inspired by <cit.>, and we improved the method to make it suitable for object detection. Especially, we extract spatial attention from the feature layers of each group and give each group spatial attention with different weights for distilling. § NETWORK ARCHITECTURE This paper takes YOLOv4 as an example to illustrate our pruning and distillation methods. Our pruning method can be applied to networks with BN modules. In this section, we briefly introduce the five core basic components of the network and the overall architecture of the network. §.§ Basic Components As shown in Fig.2, the five modules are CBM, Res Unit, CSP X, CBL, and SPP. Among them, the CBM module is composed of Conv, Batch Normalization <cit.> and Mish activation <cit.> function. Res Unit is composed of CBM and add operations, where the res block is derived from <cit.>. CSP X module is composed of CBM, X Res units, and concatenate operations. CBL module is composed of Conv, BN, and Leaky-Relu <cit.>. Spatial pyramid pooling (SPP) is proposed in <cit.>, herein SPP refers to feature fusion by pooling at four scales: 1×1, 5×5, 9×9, 13×13. §.§ Detection Network Through the above five basic components constitute the three parts of YOLOv4, i.e., backbone network, feature enhancement network, and detection head. These three parts have a total of 162 layers. Firstly, the backbone network is used to extract the feature of the object. Then, the feature enhancement network further fuses and enhances the features. At last, the detection head is responsible for classifying the input features and returning the location and size of the target. As shown in Fig.3m when the input size is 416 × 416, the down-sampling feature maps of 8, 16, 32 times are obtained through the backbone network, specifically, feature maps at scales 52×52, 26×26, 13×13, and then these feature maps are fed into the feature enhancement network. Finally, the detection head outputs the prediction at three scales. § PROPOSED APPROACH In this section, we describe the proposed three-stage model compression method in detail. Firstly, we train the network sparsely with the dynamic sparse rate. Then, the object detection network is divided into five groups, and each group uses different thresholds for channel pruning. After that, using the pruned network as the student network for knowledge distillation, the details are described as follows. §.§ Dynamic Sparse Training The purpose of sparse training is to select out the insignificant channels in the network layer. Referring to the<cit.> , we use γ as the important factor of the channel. The distribution of γ coefficients of all BN layers in the original network is in different ranges. Sparse training is to sparse the γ coefficient, making the distribution of the γ coefficient close to zero. The smaller γ value indicates the lower importance of the corresponding channel. As shown in (<ref>), γ is the scale parameter of the BN layer, β is the offset parameter of the BN layer, the value of γ and β are obtained by training the network. y_i=γx̂_i+β, x̂_i=x_i-μ_B/√(σ_B^2+ε), where x̂_i denotes the normalized output of a channel, and y_i denotes the output of x̂_i after γ scaling and β translation. x_i denotes a specified channel on the feature layer. As shown in (<ref>), μ_B is the mean value of the specified channel under batch-size number, σ_B^2 is the variance of the specified channel under batch-size number. To prevent denominator being 0, ε can be set a value at 1e-16. μ_B=1/m∑_i=1^m x_i, σ_B^2=1/m∑_i=1^m(x_i-μ_B)^2, In the process of dynamic sparse training, the L1 norm of γ is used as the regularization term, and the variable sparse rate s_d is introduced, which is added to the loss function for training, as shown in (<ref>). L=∑_(x, y) l(f(x, W), y)+s_d∑_γ∈Γ g(γ), where (x,y) represents the input of the network and the label of the data, W represents the parameters that can be trained, and the first summation term represents the original loss during CNN network training. The second summation, g(γ) represents the regularization term introduced, we use g(γ)=\|γ\|. s_d is a variable sparse rate. In the training process, the network will dynamically adjust its sparse rate according to the number of epochs of current training. When training to half the number of epochs, 70 % of the channel maintains the original sparse rate, 30 % of the channel sparse rate decay to 1 % of the original sparse rate, so that the final training network achieves a good balance between sparsity and accuracy. §.§ Group channel pruning In this section, we focus on the proposed group channel pruning method. It can be divided into three steps. Firstly, we divide the structure of the object detection network into five groups. Secondly, we obtain five different pruning thresholds according to the pruning proportion of each group and then generate the pruning mask matrix for most of the convolution layer in each group, which is used to prune the channels in the convolution layer. At last, we generate the public pruning mask matrix for the convolution layers associated with the shortcut layers. §.§.§ Network group Our grouping channel pruning is to divide the detection network layers into multi groups. In grouping, we comprehensively consider the scale of feature layers and the similarity of module structure in the network which means that the feature layers with the same scale and the layers that have similar module structure are assigned to the same group. In the experiment, we observe that when the unified pruning threshold is used for all structures, two detrimental situations will occur. One is that in structures with high redundancy, the real pruning threshold is higher than the unified pruning threshold, and the redundant channels in such structures will not be pruned. In the other case, in the structure with low redundancy, the real pruning threshold is lower than the unified pruning threshold and the significant channels may be pruned in this structure, which seriously affects the accuracy of the network. To solve this problem, we group the object detection network first. As shown in Fig.3, the blue dotted boxes represent the YOLOv4 network's backbone part, the feature enhancement part, and the detection part. The red dotted boxes represent the five groups. When input the size of 416×416 images into the network, the group1 include the scales of the feature layer from 416×416 to 52×52 and CSP module, group2 only include the feature layer at 26×26 scales along with the CSP module, group3 only include the feature layer at 13×13 scales along with the CSP and CBL module, group4 and group5 both include the feature layer from 52×52 scales to 13×13 scales and CBL module,however, for more precise pruning, we divide this two parts into two groups. Besides, the CSP module includes the CBM module as shown in Fig.2. The SPP, Concat, Upsample, and Downsample these modules are just operators, they do not contain the trainable parameters. The first three groups, Group1∼3 belong to the backbone network and are responsible for extracting the features of the object, these three groups contain all the residual modules in the network. Group4 belongs to the feature enhancement network, which is responsible for further enhancement and fusion of features. Group5 includes the detection head part which realizes the classification of features and the regression of object location. §.§.§ Pruning thread and mask matrix Due to the different redundancy in five groups, we need to obtain five pruning thresholds and a pruning mask matrix from five groups. Here we illustrate the steps using one group. Firstly, we calculate the ratio of the number of channels in the current group to the total number of channels that can be pruned in the whole network, we denote this ratio as 𝐩_i. Then, given a total pruning ratio of the whole network, we denote it as P. By multiplying 𝐩_i by P, we can obtain the pruning proportion of the current group, denote as 𝐠_i. After that, we sort all the γ coefficients in that group, according to the current group's pruning proportion(𝐠_i) we can get the current group's pruning threshold(denote as 𝐭_i). Finally, we use the pruning threshold 𝐭_i to compare with all the γ coefficients in this group to obtain the pruning mask matrix of the convolution layers, in that pruning mask matrix, the number 1 represents the channel in the corresponding position retained, and the number 0 represents the channel in the corresponding position will be pruned. As shown in Fig.4, we use the γ coefficient as the scale factor of the channel and compare the scale factor with the pruning threshold of the current group. When the value of the scale factor is lower than the pruning threshold, the channel corresponding to the scale factor will be pruned. Using the above method, we obtain the five pruning thresholds and the mask matrix of the convolution layer in each group. §.§.§ Public mask matrix The pruning mask matrix obtained by the above method can be used as the final pruning matrix of the most convolution layers in the network. However, another convolution layer associated with the shortcut layer needs to use the public mask pruning matrix. Because the number of channels to be added between the two layers must be consistent in the shortcut layer to perform the addition operation. Considering that the source layer of the shortcut may still be a shortcut layer, which will involve multiple convolution layers forward, and the pruning mask matrix of these convolution layers needs to be consistent. How to generate this public mask pruning matrix so that the channel pruning in each convolution layer reaches a higher amount and has little effect on precision. This is a question worth considering. To address such a question, we propose a voting method to generate the public pruning mask matrix. As shown in Fig.5. Firstly, we count the total number of convolution layers associated with the shortcut layer and denoted as N_conv. Then we count the total number of zeros at position (i,j) in the pruning mask matrix and denoted as Z_(i,j). The value of the public mask matrix at (i,j) position denoted as p_(i, j). When the Z_(i, j)≥(N_conv / 2),then p_(i, j)=0 ; otherwise, the p_(i, j)=1. §.§ Knowledge distillation loss In this section, we introduce the three parts of distillation loss. As shown in Fig.6, we use the original network as the teacher network, and the pruned network as the student network for knowledge distillation, the distillation loss includes three parts: 1. The difference in spatial attention between student network and teacher network denoted as L_AT; 2. The predicted value differences between student networks and teacher networks in object classification and location regression are denoted as L_soft; 3. The loss between the predicted value of the student network and the ground truth is denoted as L_hard. As in (<ref>), we use L_total to represent the total loss of the student network, and we will mainly consider the loss of L_AT and L_soft. L_total=L_AT+L_soft+L_hard, §.§.§ Group spatial attention loss As in (<ref>), L_AT denotes the difference in spatial attention information between student network and teacher network. We reduce this difference by allowing the student network to imitate the spatial attention of the teacher network. L_A T=∑_i=1^5β_iQ_T^i/Q_T^i_2^i-Q_S^i/Q_S^i_2_2, where i belongs to 1∼ 5, representing the five groups in the network. From these five groups, we extract the spatial attention only at specific scale feature maps as the knowledge, the scale feature maps are 208 × 208, 104 × 104, 52 × 52, 26 × 26 and 13 × 13, respectively, We extract these feature maps from five groups. β_i denotes the five group's loss gain coefficient, we give the different group's spatial attention with different weight. Q_T^i and Q_S^i are the 1-dimensional tensor forms of teacher and student network spatial attention, and each element in Q^i is normalized. As in (<ref>), one-dimensional Q^i is converted from the two-dimensional F(A^i) by the flattening operation. F(A_T^i) and F(A_S^i) are two-dimensional matrix forms of spatial attention in the network of teacher and students, respectively. Q_T^i=vec(F(A_T^i)), Q_S^i=vec(F(A_S^i)), The mapping function F(.) is given in (<ref>), where A denotes the feature map on the channel, A has H × W size, and C represents the number of all channels on the feature layer. The value of p is 2, which represents a power of 2 for each element in A. F(A)=F_s u m^p(A)=∑_j=1^c\|A_j\|^p, Spatial attention refers to extracting the spatial information of all channels on a certain feature layer in the form of a heat map. The extraction process is shown in Fig.7. One feature layer is selected from the network, and the size of the feature layer is C × H × W. C represents the number of channels on the feature layer. Through the mapping function F: F: A^C× H × W→A^H ×W, the 3-dimensional feature layer tensor is mapped to a 2-dimensional tensor on the channel dimension, which represents the spatial attention map of the feature layer. §.§.§ Soft target loss As in (<ref>), L_soft is composed of two kinds of prediction differences. One is the prediction difference of teacher and student networks in object classification. The other is the prediction difference of teacher and student networks in the location and size of the object box. L_soft=l_(t-s)(cls)+l_(t-s)(box), l_(t-s)(cls) denotes the prediction difference in object classification between teacher networks and student networks, as shown in (<ref>). l_(t-s)(cls)= 1/k∑_i=1^3∑_j=1^kM^(i, j)(log M^(i, j)-N^(i, j)), where i denotes the prediction of the network at three scales, k denotes the number of all prior boxes at the current scale. M^(i, j) denotes the predicted output of the teacher network after distillation. N^(i, j) denotes the predicted output of the student network after distillation. As in (<ref>) (<ref>), M^(i, j), N^(i, j) is obtained by softmax and logsoftmax function, where P_t^(i, j)(cls) denotes the classification probability predicted for each prior box in the teacher network and P_s^(i, j)(cls) denotes the classification probability predicted for each prior box in the student network. T is a temperature parameter used to make the output distribution of teacher and student network prediction more uniform. M^(i, j) =softmax(P_t^(i, j)(cls)/ T), N^(i, j) =log _-softmax(P_s^(i, j)(cls) / T), As in (<ref>), l_(t-s)(box) denotes the prediction difference between teacher network and student network on the location and size of the object box. l_(t-s)(box)=∑_i=1^3∑_j=1^kP_t^(i, j)(box)-P_s^(i, j)(box)_2, where i denotes the prediction of the network at three scales, and k denotes the number of remaining candidate boxes after meeting the IOU thread at the current scale. In the position corresponding to the object candidate box, in the student network the position and size of the predicted box was denoted by the P_s^(i, j)(box). In the teacher network, the position and size of the predicted box was denoted by the P_t^(i, j)(box). § EXPERIMENTS In the experiment, we take the YOLOv4 detection network and PASCAL VOC data sets as an example to illustrate and validate the effectiveness of the proposed model compression. Firstly, we sparsely train the network with a dynamic sparse rate. Secondly, we quantitatively analyze the effect of different pruning proportions on the model size, accuracy, and calculation. Then, we compare our group pruning with other current pruning methods on object detection data sets. At last, to prove the superiority of the distillation method, we compare the accuracy of the pruned network after fine-tuning and distilling. Furthermore, we combine our distillation method with other common pruning methods to demonstrate that our distillation method was suitable for other common pruning methods. §.§ Dataset and evaluation metrics For the dataset, we use Pascal VOC <cit.>. The voc2012train, voc2012val, voc2007train, and voc2007val, these four parts have 16551 pictures and we combine them used as the final training set. The voc2007test included 4952 pictures and was used as the final test set. Our experimental environment is Ubuntu 18.04, PyTorch = 1.8 version, GPU is a single RTX3090. For the evaluation metrics, we evaluate the performance of the pruned model from four aspects: model size, the number of parameters, calculation amount, and [email protected]. The computation is measured by FLOPS. The [email protected] represents the average value of all categories of AP when the IOU threshold is 0.5, AP represents the average precision of one category, and the specific calculation details are referred to in reference <cit.>. §.§ Dynamic Sparse training In the process of sparse training, the L1 norm of γ is added into the loss function as a regularization term to train together. As shown in Fig.8, the distribution of γ coefficients of all BN layers in the original network is in different ranges. The sparse training process is to make the γ coefficient distribution close to zero, so that is convenient to select out the unimportant channels in the network. During the experiment, we found that sparse training is the trade-off between accuracy and sparsity. A larger sparse rate s can bring a better sparse effect, but the accuracy loss is also large, even if the number of epochs of sparse training is increased in the future, the model still can not restore to good accuracy. A smaller sparse rate s has little effect on the accuracy but leads to a worse sparse effect. To solve this problem and make a good balance between sparse effect and accuracy, we put forward a dynamic sparse training method, which introduces a variable sparse rate s, and the sparse rate s will change with the training process of the network. During the dynamic sparse training, the degree of network sparsity can be adjusted by setting the sparsity rate s, the network will dynamically adjust its sparse rate according to the number of epochs of current training. For the YOLOv4 network, we set the initial sparse rate s = 0.00075, the initial learning rate lr0 = 0.002 and train 200 epochs. When training to half the number of epochs, 70 % of the channel maintains the original sparse rate, 30 % of the channel sparse rate decay to 1 % of the original sparse rate. Besides, the learning rate is updated by cosine annealing. When the input image size is 416×416, the batch size is set to 16, as shown in Fig.9, this figure represents the γ coefficient distribution in the network layers after dynamic sparse training, compared to the original the γ coefficient distribution (as shown in Fig.8), most of these γ coefficient is more close to the zero and it is convenient to select out insignificant channels. §.§ Group channel pruning In this section, we divide the network layers into five groups. YOLOv4 has 162 layers, during the group, we comprehensively consider the scale of feature layers and the similarity of module structure in the network which means that the feature layers with the same scale and the layers that have similar module structure are assigned to the same one group. When input the size of 416×416 images into the network, the group1 include the scales of the feature layer from 416×416 to 52×52 and the CSP module, group2 only include the feature layer at 26×26 scales along with the CSP module, group3 only include the feature layer at 13×13 scales along with the CSP and CBL module, group4 and group5 both include the feature layer from 52×52 scales to 13×13 scales and CBL module. The specific layers in each group are the following, including Group1: 0 ∼ 55 layers, Group2:56 ∼ 85 layers, Group3: 86 ∼ 116 layers, Group4:117 ∼ 136 layers, and Group5:136 ∼ 161 layers. §.§.§ Reducing model's parameters and computations Given a total pruning proportion of the whole network, according to the total pruning proportion the algorithm will calculate the five groups' pruning proportion. As shown in Table1, we demonstrate the details of five groups' pruning proportion. It can be seen from Table1 that in the backbone network part, the function of feature extraction is mainly realized by Group1 and Group2, and the redundancy in these two groups reaches 10% ∼ 25 %. The redundancy in Group3 reached more than 90%, this indicating that the channels in these feature layers have little effect on feature extraction in Group3. The redundancy in Group4 reaches more than 90%, and most channels in this Group play a little effect on feature enhancement. The redundancy in Group5 reaches about 45%. Through the above analysis, which is sufficient to indicate that the redundancy in various structural parts of the network is different. We use group pruning to make each group has different pruning thresholds, thus achieving more accurate and efficient pruning. In Table2, we present the effects of different pruning proportions on the model's parameters and computation, except the pruning proportion is different, we keep the size of input images is 416 × 416. Table2 demonstrates the effectiveness of our group channel pruning. §.§.§ Comparing with other current pruning methods As shown in Fig.10, to demonstrate the superiority of our proposed group channel pruning method in object detection, we quantitatively compare our method with other current pruning methods like Network Slimming <cit.>, Thinet <cit.>, Layer pruning <cit.> and Eagle eye <cit.>. We compare them at two aspects: model size and accuracy ([email protected]). During the pruning process, we keep the pruning proportion as the same for different pruning methods, the size of input images is 416 × 416. It can be seen from Fig.10, under the same pruning proportion, our method can obtain the best trade-off between the pruned model's accuracy and pruned model's size. In addition, in <cit.> they use a subspace projection approach to estimate the importance of the network layers, when using this pruning way, the layers can be pruned is limited since that if the pruning proportion is above 0.6 this pruning way will change the network architecture and accuracy significantly, this is inconvenient to recover the pruned models' accuracy.In <cit.>, they use a way similar to the network architecture search, during the pruning process, they search the pruned network not only consider the pruned model's size, accuracy, but also consider the pruned model's computations and selected the best trade-off model from 1000 candidate models. To ensure the work <cit.> pruning method is carried out under the same hardware conditions and the computational environment with other pruning methods (Our experimental environment is Ubuntu 18.04, PyTorch = 1.8 version, GPU is a single RTX3090), we choose the best model only from the five candidate pruning models, we also need to declare that this pruning method of architecture search has better performance when the number of candidate models is more, but this situation also puts forward higher requirements for computational power. §.§ Group spatial attention distilling In this section, we use the sparse network to conduct the group channel pruning and obtain the pruned network. The accuracy of the original network and the network after sparse training are 87.1 and 79.8, respectively. During the distillation experiments, we set the original network as the teacher network and the pruned network as the student network, the spatial attention information was extracted only at specific scale feature maps from five groups as the knowledge, the scale of feature maps are 208 × 208, 104 × 104, 52 × 52, 26 × 26 and 13 × 13, respectively. Besides, we give the five group's loss gain coefficient β_i with different weight, we set the β_1- β_3 as 1000 and the β_4- β_5 as 10000. §.§.§ Group spatial attention distilling with our pruning method To verify the effectiveness of group spatial attention distilling, we use it for the pruned model with our pruning method. Then, we fine-tune and group attention distills the compressed model, respectively. The comparison results were shown in Table 3, the [email protected] as the accuracy evaluation metric. It can be seen from Table 3 when directly fine-tune the pruned network, the highest accuracy restored can only reach 81.1. In contrast, using group spatial attention distilling can make the pruned network obtain higher accuracy. §.§.§ Group spatial attention distilling combine with other common pruning methods To show that our group spatial attention distillation scheme is not only suited for our pruning method, we combine the group spatial attention distillation method with other common pruning methods like Network Slimming <cit.> and Thinet <cit.>. The comparison results were shown in Table 4 ∼ 5, it can be seen from Table 4 ∼ 5 , when we directly fine-tune the pruned network, the highest accuracy restored can only reach 80.9. In contrast, using group spatial attention distilling can make the pruned network obtain higher accuracy. Besides, combing the group channel pruning with our pruning method can achieve a better effect. §.§.§ Comparing the compressed model with other object detection network on PASCAL and COCO To verify the effectiveness of our final compressed model, we compare the final compressed model with other normal network and lightweight detectors on PASCAL and COCO, respectively. The comparison results were shown in Table 6 and Table7, the [email protected] and [email protected]:0.95 as the accuracy evaluation metric for the PASCAL VOC and COCO dataset, respectively. The symbol * represent the final compressed model which has been used our group channel pruning, spatial attention distillation. It can be seen from above table, our method can achieve a best trade off between the network's accuracy and calculation or parameters. §.§ Deployment on the edge device In this section, we introduce the deployment of the pruned model on edge device-Jetson Nano. Jetson Nano is a small, powerful computer for embedded applications, it has 128 NVIDIA CUDA cores and 4 GB memories. We deployed the original network and five compressed models (using our group channel pruning method) on this edge device, and test the inference time of each model. The specific deployment steps are as follows: Firstly, on the host machine, we prepare the network model file and the corresponding weight file, then using PyTorch to convert it to the ONNX format model. After that, on the target device-Jetson Nano, we use TensorRT to generate the engine files according to the ONNX model. At last, we run the engine files of five compression models on Jetson Nano, and the inference results are shown in Table 6. It can be seen from Table 8 that the inference time of the original network model needs 414ms and the compressed model(68M) only needs 274ms. The above experiments show that the proposed group channel pruning method can be deployed to the edge device without designing special hardware or software and has an acceleration effect. § ABLATION STUDIES To demonstrate the generality and effectiveness of our method. In this section, we first use MobileNet, DarkNet53, and CSPDarknet as the backbone to construct the detection network. Next, we introduce the ablation experiments of dynamic sparse training, group channel pruning, and spatial attention distilling. At last, we test the pruning model after distillation. §.§ Ablation Studies for Dynamic Sparse Training During the sparse training, we set the total number of epochs for the sparse training and dynamic sparse training both are 200 epochs, all model's initial learning rate set as lr0 = 0.002 and the size of input images is 416 × 416. As shown in Fig.11, the top three pictures represent the common sparse training and the bottom three pictures represent dynamic sparse training for the CSPDarknet-Yolov4. In the dynamic sparse training process, the batch size =16, the initial sparse rate s = 0.00075, when it comes to 40 % of the total number epochs, 70 % of the channel maintains the initial sparse rate s, 30 % of the channel sparse rate decay to 1 % of the initial sparse rate s. It can be seen from Fig.11, the accuracy of the network through the common sparse training is 71.2, while the accuracy of the network through the dynamic sparse training is 79.8. Besides, the initial sparse rate s for DarkNet53-Yolov3 and MobileNet-Yolov3 are 0.003 and 0.005, respectively. The batch size for these two networks are both 32. For the MobileNet-Yolov3, DarkNet53-Yolov3, CSPDarknet-Yolov4, they have 96, 106, 162 network layers, respectively. It can be seen from the Table 9, the accuracy of the MobileNet-Yolov3, DarkNet53-Yolov3, CSPDarknet-Yolov4 are 72.8, 66.5, 79.8, respectively. With the increase of the number detection network layers, the dynamic sparse training method has achieved a better trade-off between sparsity and accuracy compare to the common sparse training. Besides, when network layers are less than 100 layers, we notice that increasing the batch size also can improve the trade-off between sparsity and accuracy. §.§ Ablation Studies for Group Channel Pruning In the group channel pruning experiments, we chose the dynamic sparse training model as the network to be pruned and use the same pruning proportion for the common pruning and group channel pruning. For the CSPDarknet-Yolov4, the pruning proportion was 40 %. For the DarkNet53-Yolov3 and MobileNet-Yolov3, the pruning proportion was 64 % and 65 %, respectively. It can be seen from the Table 10, comparing with the common pruning method <cit.>, our group channel pruning method can achieve a better balance between model's size and accuracy for different detection networks. §.§ Ablation Studies for Group Spatial Attention Distillation During the group spatial experiments, we choose the original network as the teacher network, the pruned network (through the group channel pruning method) as the student network. For the CSPDarknet-Yolov4 and Mobilenet-Yolov3, we extracted the spatial attention information at specific scale feature maps from five groups as the knowledge, the scales of feature maps are 208 × 208, 104 × 104, 52 × 52, 26 × 26 and 13 × 13, respectively. For the Darknet53-Yolov3, we extracted the spatial attention information at 104 × 104, 52 × 52, 26 × 26, and 13 × 13 scale feature maps from five groups. As shown in Table 11, comparing to fine tune the pruned network, group spatial attention distillation can achieve a better accuracy for different detection networks. In addition, we qualitatively demonstrate the effectiveness of the pruned network through group spatial attention distilling. As shown in Fig.13, (a),(b),(c) show the original CSPDarknet-Yolov4, DarkNet53-Yolov3, MobileNet-Yolov3, detection results, respectively. And (d),(e),(f) show the detection results of the pruned network. § CONCLUSIONS In this paper, we present a three-stage model compression approach for the object detection network, which is dynamic sparse training, group channel pruning, and spatial attention distillation. Firstly, we introduce dynamic sparse training to select out the insignificant channels in the layers and maintain a good balance of networks' sparsity and accuracy. Next, we propose a group channel pruning method. Under the same pruning rate, our group pruning method has less influence on the accuracy of the network and can obtain considerable model compression comparing with other pruning methods. After that, we extract each group's spatial attention information as the knowledge for distillation. Compared with the direct fine-tuning of the pruned model, our group spatial attention distilling method can recover the pruned network to higher accuracy. Furthermore, we deploy the compressed model on the edge device Jetson Nano to demonstrate that our method can be directly deployed without the support of special hardware or software and can achieve the acceleration effect. To demonstrate the generality and effectiveness of our proposed approach, in our experiments, we replace the backbone to MobileNet, DarkNet53, and CSPDarknet to construct the detection network and then use our proposed methods, the experimental results are satisfactory. We believe that the proposed methodology and approach are promising to be evaluated for compressing other object detection networks. This work was supported in part by the National Natural Science Foundation of China under Grant 61961014, 61963012 and the Hainan Provincial Natural Science Foundation of China under Grant 620RC556, 620RC564. ieeetr
http://arxiv.org/abs/2306.02582v1	20230605042100	Learning from Noisy Labels Generated by Extremely Point Annotations for OCT Fluid Segmentation	[ "Tengjin Weng", "Yang Shen", "Kai Jin", "Zhiming Cheng", "Yunxiang Li", "Gewen Zhang", "Shuai Wang" ]	cs.CV	[ "cs.CV" ]	Learning from Noisy Labels Generated by Extremely Point Annotations for OCT Fluid Segmentation Tengjin Weng Zhejiang Sci-Tech University, China [email protected] Yang Shen Lishui University, China [email protected] Kai Jin Second Afﬁliated Hospital of Zhejiang University, China [email protected] Zhiming Cheng Hangzhou Dianzi University, China [email protected] Yunxiang Li UT Southwestern Medical Center, Dallas, TX, USA [email protected] Gewen Zhang Lishui University, China [email protected] Shuai Wang Hangzhou Dianzi University, China [email protected] July 31, 2023 =============================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================== Automatic segmentation of fluid in OCT (Optical Coherence Tomography) images is beneficial for ophthalmologists to make an accurate diagnosis. Currently, data-driven convolutional neural networks (CNNs) have achieved great success in OCT fluid segmentation. However, obtaining pixel-level masks of OCT images is time-consuming and requires expertise. The popular weakly-supervised strategy is to generate noisy pseudo-labels from weak annotations, but the noise information introduced may mislead the model training. To address this issue, (i) we propose a superpixel-guided method for generating noisy labels from weak point annotations, called Point to Noisy by Superpixel (PNS), which limits the network from over-fitting noise by assigning low confidence to suspiciously noisy label pixels, and (ii) we propose a Two-Stage Mean-Teacher-assisted Confident Learning (2SMTCL) method based on MTCL for multi-category OCT fluid segmentation, which alleviates the uncertainty and computing power consumption introduced by the real-time characterization noise of MTCL. For evaluation, we have constructed a 2D OCT fluid segmentation dataset. Compared with other state-of-art label-denoising methods, comprehensive experimental results demonstrate that the proposed method can achieve excellent performance in OCT fluid segmentation as well as label denoising. Our study provides an efficient, accurate, and practical solution for fluid segmentation of OCT images, which is expected to have a positive impact on the diagnosis and treatment of patients in the field of ophthalmology. § INTRODUCTION The intricate anatomical structures and diverse disease symptoms associated with eye diseases often present substantial hurdles in diagnosis. Optical Coherence Tomography (OCT), a non-intrusive imaging technique <cit.>, offers high-definition, sectional imaging of the retina and optic nerve. This allows eye specialists to accurately observe and quantify retinal abnormalities. More specifically, retinal fluid in OCT, a key indicator in detecting and diagnosing eye conditions, is categorized into intraretinal fluid (IRF), subretinal fluid (SRF), and pigment epithelial detachment (PED) based on its location of accumulation. These fluids are vital biomarkers for ocular diseases like age-related macular degeneration (AMD) and retinal vein occlusion (RVO). Identifying the existence and location of these fluids assists eye doctors in diagnosing, monitoring, and planning effective treatment strategies to maintain vision. Nevertheless, manual analysis of OCT images can be time-consuming and prone to errors. Traditional segmentation methods, such as threshold-based <cit.>, graph-based <cit.>, and machine learning-based <cit.> techniques have been used in OCT segmentation, but often fall short due to varying image quality, the necessity for extensive specialized knowledge, and limited generalization abilities. In contrast to traditional segmentation methods that rely on carefully crafted handcrafted features, convolutional neural networks (CNNs) can automatically learn and extract image features from the data itself. Therefore, various CNN-based methods have been developed for performing segmentation tasks, such as FCN <cit.>, SegNet <cit.>, DeepLab <cit.>, and UNet <cit.>. The utilization of CNNs in medical image segmentation requires substantial amounts of data. Unfortunately, manual segmentation of medical images demands significant expertise and time. Obtaining an adequate quantity of accurately-labeled data from medical experts can be a difficult and challenging task, thereby posing obstacles to developing precise CNN models for medical image segmentation. Without enough clearly labeled pixel-level annotations, CNN-based segmentation methods often struggle to fit, leading to performance degradation. To address this problem, researchers choose to collect additional labeled data without quality control, such as crowd-sourcing or noisy pseudo-labeled data generated based on weak supervision. However, directly combining clean labels with noisy labels may confuse the network during training and lead to performance degradation, negating the benefit provided by clean labels <cit.>. Therefore, it is crucial to effectively and robustly utilize the additional information available in large amounts of noisy-labeled data. Initiatives to tackle the challenge of noisy labels, there are a range of label-denoising strategies. These strategies are generally divided into two categories, depending on the way input data is partitioned. The first category comprises methods that gather and amalgamate data from various sources to indiscriminately train the model. The second category is designed for practical scenarios where professionals are asked to label or perform quality checks on a small dataset, distinguishing between clearly-labeled and noisy-labeled data. Our research is centered on this second approach, where prior knowledge is employed to aid the network in differentiating between straightforward and ambiguous labeled data. For this purpose, several techniques have been suggested, one of which is Mean-Teacher-assisted Confident Learning (MTCL<cit.>), a classic method of distinguishing data sources. It can robustly learn segmentation from limited high-quality labeled data and abundant low-quality labeled data. Specifically, the framework of MTCL can leverage the extra dark knowledge in low-quality labeled images based on perturbation-based unsupervised consistency, and effectively exploit the beneficial information in low-quality noisy labels through explicit label refinement. However, the Confident Learning (CL) module based on Cleanlab can only be calculated on the CPU, and it is time-consuming to introduce CL characterization label noise for each iteration during training. Moreover, multi-category segmentation is more challenging than two-category segmentation leading to CL real-time characterization label noise that may be inaccurate. In this work, we illustrate the application of NLL to the OCT fluid segmentation task from the following two aspects: (i) We proposed Point to Noisy by Superpixel (PNS), which can generate noisy labels from weak point annotations via superpixels guidance, and generate label trust graphs to provide a confidence measure for each label pixel in the noisy labels. These label trust graphs can constrain the network from over-fitting noise by assigning lower confidence to suspected noisy label pixels. (ii) We choose MTCL as the NLL framework, which can robustly learn segmentation from limited high-quality labeled data and abundant low-quality labeled data. Considering that multi-category segmentation is more challenging than two-category segmentation, we propose a Two-Stage Mean-Teacher-assisted Confident Learning (2SMTCL) method for multi-category OCT fluid segmentation, which alleviates the uncertainty and computing power consumption introduced by the real-time characterization noise of MTCL. 2SMTCL trains two networks: a noisy network and a denoising network. Specifically, the first-stage noisy network is trained based on the teacher-student architecture, then introduce CL to characterize the pixel-level label noise and refine the noisy labels. Finally, the second-stage denoising network is trained by denoising labels. We evaluate the performance of 2SMTCL on the OCT fluid segmentation dataset employed in this study. The results show that our method can effectively exploit weak point annotations to improve segmentation performance, outperforming other competing methods. The contributions of our research are summarized as follows: ∙ To the best of our knowledge, we are the first researchers to apply NLL to the task of OCT fluid segmentation. ∙ We propose a superpixel-guided method for generating noisy labels from weak point annotations named PNS, which can constrain the network from over-fitting noise by assigning lower confidence to suspected noisy label pixels. ∙ We propose 2SMTCL, a two-stage method based on MTCL for multi-category OCT fluid segmentation, which alleviates the uncertainty and computing power consumption introduced by the real-time characterization noise of MTCL. ∙ We have constructed a 2D OCT image segmentation dataset with corresponding ground truth annotations and point annotations. This dataset can serve as a valuable resource for training and evaluating deep learning models aimed at achieving accurate fluid segmentation. § RELATE WORK §.§ CNN-Based OCT Fluid Segmentation Many successful OCT fluid segmentation methods use convolutional neural networks (CNNs) based on the UNet <cit.> architecture. Rashno et al. <cit.> incorporated a graph shortest path technique as a post-processing step to enhance the predictive results of UNet for OCT fluid segmentation. To exploit the structural relationship between retinal layers and fluids, Xu et al. <cit.> proposed a two-stage fluid segmentation framework. They first trained a retinal layer segmentation network to extract retinal layer maps which were used to constrain the fluid segmentation network in the second stage. Several other studies, such as <cit.>, employed a graph-cut method to generate retinal layer segmentation maps. These maps were then combined to train a UNet for fluid segmentation. Moreover, De et al. <cit.> proposed a UNet-based architecture that can simultaneously segment retinal layers and fluids, utilizing pixel-level annotations of retinal layer and fluid masks to enhance OCT segmentation performance. Although various methods have been proposed with little difference in performance, the effectiveness of current OCT fluid segmentation methods relies heavily on a large number of datasets with annotations. §.§ Weakly-Supervised Segmentation Given the inaccessibility of large amounts of fully annotated data, several researchers have developed various weakly supervised medical image segmentation methods. A prevalent approach involves generating noisy pseudo-labels from weak annotations and subsequently using these to train a segmentation model. Pu et al. <cit.> proposed a technique that utilizes a graph neural network based on superpixels to create noisy pseudo-labels from weak annotations like points or scribbles. Nevertheless, this method could introduce two sources of error: inaccuracies in the generated noisy pseudo-labels and the subsequent errors in learning segmentation from these labels. To circumvent these issues, some strategies directly train segmentation models on partial annotations. Bearman et al. <cit.>, for instance, combined point-supervised and self-supervised techniques to master object segmentation within images. Other strategies like <cit.> employ prior knowledge of constraint expressions to aid segmentation during training. In the realm of medical image segmentation, this prior knowledge can be incredibly useful, given the frequent availability of information about the target region in advance. While existing weakly supervised methods have demonstrated their potential in reducing manual labor and improving segmentation performance, their application to OCT fluid segmentation hasn't been extensively investigated. He et al. <cit.> introduced a method dubbed Intra-Slice Contrast Learning Network (ISCLNet) that relies on weak point supervision for 3D OCT fluid segmentation. However, in actual diagnoses, ophthalmologists typically only concentrate on a limited number of OCT images displaying fluid. The inter-image comparison technique deployed by ISCLNet can be challenging when dealing with incomplete OCT data. Motivated by NLL, we believe this method can be adapted to weakly supervised 2D OCT fluid segmentation. §.§ Learning Segmentation with Noisy Labels Previous work has pointed out that labeled data with noise can mislead network training and degrade network performance. Most existing noise-supervised learning works focus on image-level classification tasks <cit.>, <cit.>, <cit.> while more challenging pixel-wise segmentation tasks remain to be studied. Zhang et al. <cit.> proposed a TriNet based on Co-teaching <cit.>, which trains a third network using combined predictions from the first two networks to alleviate the misleading problem caused by label noise. Li et al. <cit.> proposed a method that employs superpixels to guide the network for noise-aware training and refinement of noisy labels. Zhang et al. <cit.> suggested a two-stage strategy for pre-training a network using a combination of different datasets, followed by fine-tuning the labels by Confident Learning to train a second network. Zhu et al. <cit.> proposed a module for assessing the quality of image-level labels to identify high-quality labels for fine-tuning a network. Xu et al. <cit.> developed the MTCL framework based on Mean-Teacher architecture and Confident Learning, which can robustly learn segmentation from limited high-quality labeled data and abundant low-quality labeled data. The KDEM <cit.> method is an extension of the semi-supervised learning approach proposed by <cit.>, which introduces additional techniques such as knowledge distillation and entropy minimization regularization to further improve the segmentation performance. Yang et al. <cit.> introduce a dual-branch network that can learn efficiently by processing accurate and noisy annotations separately. These methods demonstrate how to improve the network's ability to learn noisy labels and provide insights for future research in this area. Extensive experiments of many NLL methods on datasets such as JSRT <cit.> and ISIC <cit.> have achieved promising results, but limitations caused by the lack of OCT fluid segmentation datasets hinder the application of these methods in this field. Therefore, the effectiveness of NLL methods in OCT fluid segmentation remains largely unexplored. § METHODOLOGY §.§ Framework Overview Our method divides the dataset into two groups: clearly-labeled data (CD) and noisy-labeled data (ND). The noisy labels and label trust graphs of ND are generated using weak point annotations via PNS. To simplify the description of our methodology, we define M samples to represent the CD, while the remaining N - M samples represent the ND. We denote the CD as 𝐃_c={( 𝐗_(i), 𝐘_(i))}^M_i=1 and the ND as 𝐃_n={( 𝐗_(i), Ỹ_(i), 𝐔_(i))}^N_i=M+1, where 𝐗_(i)∈ℝ^Ω _i represents the input 2D OCT images. 𝐘_(i), Ỹ_(i)∈{0,1,2,3}^Ω _i (four types of segmentation tasks) denotes the clean segmentation label and noisy segmentation label of 𝐗_(i), respectively. The label trust graph 𝐔_(i) indicates the degree of trust of Ỹ_(i), where 𝐔_(i)⊆{0, 0.1, …, 1}^Ω _i. Fig. <ref> illustrates our method that aims to learn OCT fluid segmentation simultaneously from limited CD and abundant ND. The images of the CD are fed to the student model, and the images of the ND are both fed to the student model and teacher model. Simultaneously, the PNS method generates noisy labels and label trust graphs of ND. After obtaining the noisy network (student network) based on MT architecture, CL is used to characterize the label error in ND to obtain estimated error maps. The denoising network is trained with denoised labels and refined label trust graphs, which are obtained guided by the estimated error maps. Our method will be elaborated on the following two aspects: (i) How to generate noisy labels and label trust graphs to constrain the network from over-fitting noise. (ii) How 2SMTCL robustly learns multi-category OCT fluid segmentation from abundant noisy labels. §.§ Labels and Label Trust Graphs of ND Generated by PNS Our proposed PNS can generate noisy labels from weak point annotations via superpixels guidance, and generate label trust graphs to provide a confidence measure for each label pixel in the noisy labels. These label trust graphs can constrain the network from over-fitting noise by assigning lower confidence to suspected noisy label pixels. Fig. <ref> shows how noisy labels and label trust graphs are generated from point annotations via PNS. §.§.§ Superpixel-guided for Generating Noisy Labels from Weak Point Annotations Our OCT fluid segmentation dataset includes fully annotated labels and weakly annotated labels for three types of fluids: PED, SRF, and IRF. For weak annotation, use points to indicate the center of the fluid accumulation (for SRF and IRF) and lines (consisting of two or more points) to mark the bottom of the PED. This greatly simplifies the annotation process and reduces the required labor. The proposed PNS can generate noisy labels from these point annotations. Formally, give an image 𝐗, the weak label is represented by 𝐘' = {Y'_i}_i=1^n, Y'_i ∈{1,2...,C} where C is the number of semantic classes and n is the number of pixels. The superpixel image is obtained based on the SLIC <cit.> algorithm. We denote superpixel image as 𝐒 = {S_i}_i=1^n, where S_i ∈{1,2,..K} and the K is the number of superpixel blocks. Here S_j = k means that the pixel j belongs to the k^th superpixel block. We can represent all the pixels j that are included in the k^th superpixel block by 𝐒̅ = {S̅_k}_k=1^K, where S̅_k = {j: S_j = k}. Further, the superpixel label is represented by 𝐘̅ = {Y̅_k}_k=1^K and the initial values are zero. The following procedure illustrates how to convert weak label 𝐘' to superpixel label 𝐘̅: Y̅_k = c, ∃ (Y'_j = c), where j ∈S̅_k and c 0. From this, we get the initial superpixel label 𝐘̅. Due to a scarcity of pixel annotations in 𝐘', the majority of Y̅_k values are equal to zero. Identify and isolate all Y̅_k not equal to 0 and randomly select a superpixel block label Y̅_ms. The corresponding superpixel block is S̅_ms. We select one of the adjacent (all adjacent superpixel blocks for IRF and SRF, upper adjacent superpixel block for PED) superpixel blocks S̅_ns of S̅_ms and performs the following operations to infect Y̅_ns: Y̅_ns = Y̅_ms·𝕀(cos_dis(S̅_ms, S̅_ns) ≥ t), where cos_dis(S̅_ms, S̅_ns) represents the superpixel blocks similarity and t is the similarity threshold (the similarity threshold of IRF and SRF to 0.6, and the similarity threshold of PED to 0.5). The similarity of S̅_ms and S̅_ns as follows: cos_dis(S̅_ms,S̅_ns)=∑_v=0^255(𝐎_ms^v)(𝐎_ns^v)/√(∑_v=0^255(𝐎_ms^v)^2)√(∑_v=0^255(𝐎_ns^v)^2), where 𝐎_k^v represents the number of pixel values v contained in the k^th superpixel block. The number of each pixel value contained in the S̅_ms and S̅_ns are calculated by the following formula: 𝐎_ms^v = ∑_j:S_j=ms𝕀(𝐗[j] = v ), v=[0,255], 𝐎_ns^v = ∑_j:S_j=ns𝕀(𝐗[j] = v ),v=[0,255]. If cos_dis(S̅_ms,S̅_ns) ≥ t, we assign the value of Y̅_ms to Y̅_ns and it is obvious that the adjacent superpixel blocks of Y̅_ns are also very likely to be similar to Y̅_ms. Therefore, the adjacent superpixel blocks of S̅_ns will be regarded as the adjacent superpixel blocks of S̅_ms. The processing of Y̅_ms will not end until all the similarity values of adjacent superpixel blocks are less than threshold t. After processing all initial Y̅_k not equal to 0, the superpixel label 𝐘̅ will be converted to the pixel-wise noisy label Ỹ = {Ỹ}_i=1^n: Ỹ_i = Y̅_S_i. Fig. <ref> shows the visualization of our noisy labels generated from point annotations. Next, we will describe how to generate label trust graphs. §.§.§ Label Trust Graph for Noise-robust Learning In the process of generating noisy labels, it is unreasonable to give the same confidence to all noisy labeled pixels. Therefore, we propose a method to assign suitable confidence by measuring the actual distance of superpixel blocks. We introduce a pixel-wise label trust graph 𝐔 = {U_i}_i=1^n where U_i ⊆ (0, 0.1, …, 1). The label trust graph is used to adjust the influence of each pixel's label during training, which can help to mitigate the impact of noise on the network. Specifically, all values of U_i are set to 0.5 (the U_i value of the pixels contained in the initial Y̅_k not equal to 0 is set to 1) and update 𝐔 at the same time when updating 𝐘̅. If cos_dis(S̅_ms,S̅_ns) ≥ t, calculate the superpixel block distance between S̅_ms and S̅_ns and assign lower confidence values to the corresponding pixels on 𝐔 that are farther away from the S̅_ms. §.§ 2SMTCL for Multi-category OCT Fluid Segmentation We choose MTCL with one-stage two-category segmentation as the NLL framework. Based on MTCL, we propose a two-stage method 2SMTCL for multi-category OCT fluid segmentation. Unlike MTCL, which introduces CL in real-time during training for label noise characterization, 2SMTCL is a two-stage NLL framework. Specifically, after training the first-stage noisy network based on the teacher-student architecture, introduce CL to characterize the pixel-level noisy labels and refine the noisy labels, and then get the second-stage denoising network trained by the denoised label. Whether it is the first stage or the second stage, the network architecture is MT and keeps CD unchanged. Our motivation is as follows: (i) CL real-time characterize noise will mislead the training of the network because multi-category segmentation is more challenging than two-category segmentation. (ii) Under the premise of introducing label trust graphs to constrain network training, CL real-time characterize noise is unnecessary and time-consuming. More details about the framework of 2SMTCL are explained in the following. §.§.§ Training Noisy Network Based on Mean-Teacher Architecture Previous studies have demonstrated that noisy labels can have a detrimental effect on model training. To address this challenge, we choose MTCL with one-stage two-category segmentation as the NLL framework, which involves partitioning the dataset into two categories: confidently CD and non-confidently ND. The basic network architecture chooses the Mean-Teacher (MT) model, which is effective in Semi-Supervised Learning (SSL). The MT architecture comprises a student model (updated through back-propagation) and a teacher model (updated based on the weights of the student model at different training stages). A great strength of the MT framework is superior in its ability to leverage knowledge from image-only data using perturbation-based consistency regularization. Formally, we denoted the weights of the student model at training step t as θ_t. We updated the teacher model's weights θ_t using an exponential moving average (EMA) strategy, which can be formulated as follows: θ_t = αθ_t-1 + (1-α)θ_t, where α is the EMA decay rate, and it is set to 0.99, as recommended by <cit.>. Based on the smoothness assumption <cit.>, we encouraged the teacher model’s temporal ensemble prediction to be consistent with that of the student model under different perturbations, such as adding random Gaussian noise ξ to the input images. The student network in MT serves as our first-stage noisy network for pixel-level label noise characterization in the next stage. §.§.§ Confident Learning for Multi-Category Pixel-Wise Conditional Label Errors Despite the presence of label trust graphs 𝐔, which are designed to limit the impact of noisy labels on model learning, there remains the potential for label noise to be learned by the model. Confident Learning (CL) <cit.> is able to identify label errors in datasets and enhance training with noisy labels by estimating the joint distribution between the noisy (observed) labels ỹ and the true (latent) labels y^, as assumed by Angluin <cit.>. This estimation enables CL to assign higher confidence to instances with more reliable labels and lower confidence to instances with more questionable labels, resulting in finding the error labels. Zhang et al. <cit.> pioneered the application of CL to medical image segmentation and achieved promising results. Moreover, many follow-up studies <cit.>, <cit.> have proved the effectiveness of CL for medical image segmentation. However, most of the research is based on the segmentation task of binary classification, further research is needed to explore the effectiveness of CL for multi-category medical image segmentation. Specifically, given an ND image 𝐗 and we denote 𝐗 = (𝐱, ỹ)^n, where ỹ means the label of pixels and n = w × h means the number of pixels in 𝐗. We can obtain the predicted probabilities 𝐏̂ for m classes by the first-stage noisy network. Assuming that a pixel 𝐱 labeled ỹ = i has large enough predicted probabilities 𝐏̂_j(𝐱) ≥ t_j, there is a possibility that the current annotation for 𝐱 is incorrect, and it may actually belong to the true latent label y^ = j (i ∈𝒞_m, j ∈𝒞_m, 𝒞_m indicates the set of m class label). Here, we set the average predicted probabilities 𝐏̂_j(𝐱) of all pixels labeled ỹ = j as the threshold t_j: t_j := 1/ \| 𝐗_ỹ = j \| ∑_𝐱∈𝐗_ỹ = j𝐏̂_j(𝐱). Based on this assumption, we can construct the confusion matrix 𝐂_ỹ, y^* by counting the number of pixels 𝐱 that are labeled as ỹ = i and may actually belong to the true latent label y^* = j. The 𝐂_ỹ, y^[i][j] represents the count of such pixels for which the observed label is ỹ = i and the true latent label is y^ = j: 𝐂_ỹ, y^[i][j] := \| 𝐗̂_ỹ=i,y^=j \|, where 𝐗̂_ỹ=i,y^=j := {𝐱∈𝐗_ỹ=i: 𝐏̂_j(𝐱)≥ t_j, j=max_k ∈ M:𝐏̂_k(𝐱)≥ t_k 𝐏̂_k(𝐱 ) }. After obtaining the confusion matrix 𝐂_ỹ, y^ it needs to be normalized. Then, the joint distribution 𝐐_ỹ, y^* between the noisy labels and the true labels can be obtained by dividing each element in the confusion matrix by the total number of pixels: 𝐐_ỹ, y^[i][j]= 𝐂̃_ỹ, y^[i][j]/∑_i ∈𝒞_m, j ∈𝒞_m𝐂̃_ỹ, y^[i][j], where 𝐂̃_ỹ, y^[i][j]=𝐂_ỹ, y^[i][j]/∑_j ∈𝒞_m𝐂_ỹ, y^[i][j]· \| 𝐗_ỹ=i \|. In order to identify label noise, we adopt the prune by class noise rate (PBNR) strategy, which works by removing examples with a high probability of being mislabeled for every non-diagonal in the 𝐐_ỹ,y^[i][j] and select n ·𝐐_ỹ,y^[i][j] as mislabeled pixels. Considering our task is multi-category segmentation, we sort the returned error labels index by self-confidence (predicted probability of the given label) for each pixel and select the first 80% of error labels to form the binary estimate error map 𝐗_err, where "1" denotes that this pixel is identified as a mislabeled one. Such pixel-level error map 𝐗_err can guide the subsequent label refinement and label trust graph refinement process. §.§.§ Label Refinement and Label Trust Graph Refinement MTCL <cit.> proposes three different label refinement methods and the MTCL_Hard has the best performance. We highly trust the accuracy of the estimated error map 𝐗_err and impose the hard refinement on the given noisy labels Ỹ. The predicted label Ŷ = {Ŷ}_i=1^n is calculated by the prediction probability 𝐏̂: Ŷ_i=max_c𝐏̂(c, n). We denote 𝐘 = {Y}_i=1^n as the denoised label, which is formulated by: Ẏ_i = 𝕀(𝐗_err^i = 0)Ỹ_i + 𝕀(𝐗_err^i = 1)Ŷ_i. Similar to the noisy label 𝐘, the label trust graph 𝐔 requires modification since the previous graph represented the trustworthiness of the unreliable noisy label. We denote 𝐔={U}_i=1^n as the refined label trust graph, it can be formulated as: U̇_i=𝕀(𝐗_err^i = 0)U_i + 𝕀(𝐗_err^i = 1)δ, where δ∈ [0, 1] is the trust level of estimated error map 𝐗_err, we set as 1. §.§.§ Denoising Network Training We update {𝐘,𝐔} of ND using {𝐘, 𝐔} for the purpose of training the denoising network. The experimental parameters applied during the training of the noisy network were retained for the training of the denoising network. The student network obtained in the second stage of training is used as our final denoising network. §.§ Final Loss Function The overall loss function of the model in the first stage is consistent with that in the second stage. In general, Our total loss is divided into three parts: the supervised loss ℒ_c = ℒ_c^ce + ℒ_c^dice on CD, the perturbation-based consistency loss ℒ_con and the supervised loss ℒ_n = ℒ_n^ce·𝐔' + ℒ_n^dice on ND. The total loss is calculated by: ℒ = αℒ_c + β (ℒ_n) + λℒ_con. Here, 𝐔^' in ℒ_n is 𝐔 for training noisy network and will be replaced by 𝐔̇ for denoising network. Empirically, α and β are hyper-parameters and we set α = 1, β = 1. The ℒ_con are calculated by the pixel-wise mean squared error (MSE), λ is a ramp-up trade-off weight commonly scheduled by the time-dependent Gaussian function <cit.> λ(t) = w_max· e^(-5(1-t/t_max)^2), where w_max is the maximum weight commonly set as 0.1 <cit.> and t_max is the maximum training iteration. Such a λ weight representation avoids being dominated by misleading targets when starting online training. § EXPERIMENTS §.§ Datasets and Experimental Setup §.§.§ OCT Fluid Segmentation Dataset The data for our experiments come from the Eye Center at the Second Affiliated Hospital, School of Medicine, Zhejiang University. The dataset consists of OCT images from various patients, taken at different times and with two distinct resolutions of 1476 × 560 and 1520 × 596. Given the extensive background area in the original images, any other fluids appeared comparatively small. To address this, we centrally cropped all images and resized them to a resolution of 600 × 250. A subset of OCT images rich in the fluid was selected for comprehensive and weak point labeling. The total dataset consists of 1704 OCT images, with 1304 images designated for training and 400 for testing. To ensure the reliability of our results, we meticulously partitioned the dataset such that data from a single patient was used exclusively for either training or testing. A detailed overview of our dataset can be found in Table <ref>. §.§.§ Baseline Approaches Considering the lack of solid research on noisy label learning for OCT fluid segmentation, it is our objective to incorporate an extensive range of baselines to facilitate comprehensive and purposeful comparisons across diverse scenarios. This will enable us to provide insights for future research in this field. The baselines can be categorized as follows: ∙ Fully supervised baselines: (i) CD-Sup: uses only CD to train the backbone (2D U-Net <cit.>) network; (ii) ND-Sup: uses only ND to train the backbone network: (iii) CD&ND-Sup: mixes both CD and ND to train the backbone network. ∙ Mix CD and ND: (i) 2SRnT<cit.>: involves two stages for pre-training a network using a combination of different datasets, followed by fine-tuning the labels using confidence estimates to train a second network; (ii) Co-teaching<cit.>: a joint teaching method of the double network; (iii) TriNet<cit.>: a tri-network based noise-tolerant method extended from co-teaching. ∙ Separate CD and ND: (i) MTCL<cit.>: Mean-Teacher-assisted Confident Learning, which can robustly learn segmentation from limited high-quality labeled data and abundant low-quality labeled data; (ii) Dast<cit.>: a dual-branch network to separately learn from the accurate and noisy annotations. §.§.§ Implementation and Evaluation Metrics Our method is implemented in Python with PyTorch, using an NVIDIA GeForce RTX 3090 GPU with 24GB memory. The network is trained using the RMSprop optimizer (weight decay=1e-8,momentum=0.9). The learning rate is initialized as 1e-5 and divided by 10 every 2000 iterations. We totally trained 4000 iterations as the network converged. The batch size is set to (8, 8) for CD and ND separately and 16 when they are not distinguished during input to the network. We scale the size of the image uniformly to 256 × 128 and then directly input it into the student network. To conduct a comprehensive evaluation, we utilize three renowned indicators – dice score, average surface distance (ASD), and 95% Hausdorff distance (95HD). The dice scores for each category, excluding the background, are presented. §.§ Experiments on OCT Fluid Segmentation Table <ref> presents the comparison results under 10%, 20%, and 30% CD settings. Firstly, in the typical supervised settings of CD-Sup and CD&ND-Sup, the network performs poorly and can benefit from additional ND, although their labels contain noise. We hypothesize two possibilities: (i) The partially noisy labels generated by PNS are highly accurate and can provide reliable guidance for the network. The effect of ND-Sup can also reach 73.64%, which is also confirmed. (ii) Even with only 30% of the CD data, the network may still be under-fitting and potentially learn valuable features from the ND. When turning to the Mix CD and ND setting, the three baseline methods, 2SRnT, Co-teaching, and TriNet have shown effective performance in mitigating the negative effects caused by noisy labels. In contrast, under the Separate CD and ND settings, MTCL has demonstrated a steady improvement ranging from 10% to 30%. Although Dast has also shown improvement, it still falls short of the baseline performance (CD&ND-Sup). One possible explanation for this discrepancy is domain crossing since Dast was originally designed to perform COVID-19 pneumonia lesion segmentation. Under the 10% - 20% CD setting, Co-teaching and MTCL achieved highly competitive results, but 2SMTCL still outperforms them in most metrics. When we increased the proportion of CD to 30%, our method substantially surpassed other label-denoising methods. Overall, in the OCT fluid segmentation task, our method achieves satisfactory results, suggesting that the label trust graph and estimated error map can accurately characterize the location of label noise, enabling the network to fully exploit these informative denoised labels. Fig. <ref> presents the results of 2SMTCL and other approaches under the 30% CD setting and 70% ND setting. It is evident that the mask predicted by our method is closer to the ground truth, further demonstrating the effectiveness of 2SMTCL. §.§ Analytical Ablation Study To verify the effectiveness of each component, we propose different variants to perform ablation studies. Table <ref>, Table <ref>, and Table <ref> shows our ablation experiments. Our ablation experiments are performed on the denoising network and CD accounted for 30%, and ND accounted for 70%. Table <ref> demonstrates the impact of perturbation-based consistency learning and label trust graphs on the performance of the denoising network, where δ refers to the set of label trust graphs and MT denotes the Mean-Teacher architecture. Without the MT architecture, the model's average dice score decreased by 2.5% and performed worse than the noisy network. It shows that the network trained on MT architecture can effectively utilize the pure image information of ND to improve performance. Furthermore, Table <ref> indicates that the label trust information contained in the label trust graph can help the network avoid over-fitting noise. The average dice score of the final model's result was even less than 80% when trained without the label trust graph. In the Refinement stage, trust estimation error maps (set to 1) can improve the performance of the network compared to discarding the estimation error maps (set to 0) or leaving them unchanged. These experimental results surface that the components (perturbation-based consistency learning and label trust graphs) of the 2SMTCL can effectively mitigate the negative effects of noisy labels on the network for OCT fluid segmentation. Table <ref> displays the impact of different hyper-parameters α and β of the loss function (Equation <ref>) on the denoising network. As we already have the label trust graph to constrain the loss of ND, we chose to set α = 1 and β = 1, which performed optimally in terms of most metrics. 2SMTCL with appropriate hyper-parameters achieved superior results and proved effective in denoising labels for deep learning-based OCT fluid segmentation. As the bulk of the training data consists of noisy labels generated by point annotations, conducting ablation studies on the PNS method to yield the best noisy-labeled data is critical. We set the superpixel block size to 13 in our experiment, meaning each superpixel block encompasses approximately 169 pixels (13 × 13 on average). A pivotal factor to consider is the setting of the similarity threshold. If the threshold for creating noisy labels is excessively high, the labels may convey insufficient information, leading to network under-fitting. Conversely, if the threshold is too low, the noisy labels could introduce an overwhelming amount of noise, adversely affecting network performance. Therefore, careful selection of an appropriate threshold for generating noisy labels is essential to strike a balance between the amount of information and noise in the labels for optimum network performance. Compared to SRF and IRF, we noted that visually distinguishing PED fluids can be more challenging. Therefore, we set a smaller similarity threshold for PED when determining the threshold. Table <ref> presents the final impact of our generated noisy labels for network training under different similarity thresholds. We selected SI_t = 0.6, P_t = 0.5 due to its superior performance across most metrics. § DISCUSSION §.§ Visualization of Label Denoising The PNS method is heavily dependent on the similarity among superpixel blocks, leading to the generation of noisy labels with noticeable gaps. These gaps can substantially impact the training process of the model. To rectify this, we utilized the label denoising module to mend the noisy labels with the assistance of reliable guidance. The denoised labels generated by our proposed method are more closely aligned with the ground truths compared to the original noisy labels. Our module proficiently fills in the gaps and refines the edges of the labels, resulting in notable improvements. The superior effectiveness of our label-denoising process is highlighted both in the final performance of the model and in visual depictions of the label-denoising process. As evidenced by the results in Fig. <ref>, our label denoising module exhibits impressive effectiveness. §.§ Future Works In this research, we introduce a strategy that leverages point annotations to generate noisy labels, thereby decreasing the reliance on pixel-level annotations for training segmentation models. Our approach is capable of robustly learning OCT fluid segmentation from a limited volume of fully annotated data and a substantial amount of weakly annotated data. Although our methodology has demonstrated encouraging results, it currently still relies on a modest amount of fully annotated data. As a future direction, we will try to devise a training framework that is solely dependent on weakly supervised annotations, which would further lessen the model's requirement for high-quality annotations. § CONCLUSION In this study, we explored the efficacy of employing noisy label learning techniques for OCT fluid segmentation. Initially, we introduced a superpixel-guided method for generating noisy labels from weak point annotations, termed Point to Noisy by Superpixel (PNS). This technique restricts the network from over-fitting to noise by assigning low confidence to pixels with potentially noisy labels. Subsequently, we developed a Two-Stage Mean-Teacher-assisted Confident Learning (2SMTCL) method, designed for multi-category OCT fluid segmentation. This method is capable of segmenting OCT fluid utilizing limited clearly-labeled data and a significant quantity of noisy-labeled data. To substantiate the robustness and efficiency of our approach, we compiled an OCT fluid segmentation dataset. The empirical results displayed that our technique surpassed other label-denoising methods, delivering superior segmentation performance and demonstrating notable effectiveness in label denoising. Our study provides an efficient, accurate, and practical solution for fluid segmentation of OCT images, which is expected to have a positive impact on the diagnosis and treatment of patients in the field of ophthalmology. IEEEtran
http://arxiv.org/abs/2306.04374v1	20230607121416	Label Aware Speech Representation Learning For Language Identification	[ "Shikhar Vashishth", "Shikhar Bharadwaj", "Sriram Ganapathy", "Ankur Bapna", "Min Ma", "Wei Han", "Vera Axelrod", "Partha Talukdar" ]	cs.CL	[ "cs.CL", "cs.LG", "cs.SD", "eess.AS" ]	Label Shift Quantification with Robustness Guarantees via Distribution Feature Matching Bastien Dussap1Gilles Blanchard1 Badr-Eddine Chérief-Abdellatif2 [email protected] [email protected] [email protected] July 31, 2023 =============================================================================================================================================================================================== Speech representation learning approaches for non-semantic tasks such as language recognition have either explored supervised embedding extraction methods using a classifier model or self-supervised representation learning approaches using raw data. In this paper, we propose a novel framework of combining self-supervised representation learning with the language label information for the pre-training task. This framework, termed as Label Aware Speech Representation (LASR) learning, uses a triplet based objective function to incorporate language labels along with the self-supervised loss function. The speech representations are further fine-tuned for the downstream task. The language recognition experiments are performed on two public datasets – FLEURS and Dhwani. In these experiments, we illustrate that the proposed LASR framework improves over the state-of-the-art systems on language identification. We also report an analysis of the robustness of LASR approach to noisy/missing labels as well as its application to multi-lingual speech recognition tasks. Index Terms: speech representation learning, supervision and self-supervision, language identification. #1 § INTRODUCTION The conventional approach for deriving speech representations for non-semantic speech tasks, such as speaker and language recognition, involved the use of training deep neural models with a statistics pooling layer. Some of the popular methods in this direction include d-vectors <cit.> and x-vectors <cit.>, where a deep neural model is trained to classify the speaker/language labels on a large corpus of supervised data. However, recent trends in speech processing has seen a paradigm shift towards self-supervision based representation learning, mirroring the efforts in computer vision <cit.> and natural language processing <cit.>. Some popular examples of such approaches include contrastive predictive coding (CPC) <cit.>, wav2vec family of models <cit.>, and hidden unit BERT (HuBERT) <cit.>. These methods primarily rely on learning speech representations at the frame-level with its impact reported on semantic tasks such as low-resource speech recognition <cit.> or zero resource spoken language modeling <cit.>. These representations have also been investigated for speaker and language recognition tasks <cit.> through various benchmarks such as SUPERB <cit.> and NOSS <cit.>. In many learning paradigms, it is plausible to have portions of pre-training data along with the corresponding meta-data. In the broad spectrum of representation learning, where supervised and self-supervised frameworks constitute the two-ends of the spectrum, we hypothesize that a combination of supervision and self-supervision based methods may be more optimal than either of the two frameworks in isolation, for scenarios where parts of the pre-training have additional meta-data in the form of labels. In this paper, we propose a framework for Label Aware Speech Representation learning (LASR) for such scenarios. To the best of our knowledge, this is the first attempt to combine label information with a self-supervision loss for non-semantic speech tasks. The contributions from this work are as follows. * We propose , a framework for incorporating label information in self-supervised speech representation learning. * We demonstrate the effectiveness of for language identification task and establish its efficacy even with missing and noisy labels. * Our findings demonstrate that inclusion of language information in the pre-training phase results in state-of-art-results on the FLEURS dataset <cit.>. § RELATED WORK Supervised Learning: Deep learning methods for non-semantic speech tasks initially explored speech recognition models in the unsupervised i-vector framework <cit.>. Further, the embeddings derived from a classifier model, trained on large amounts of supervised pre-training data, showed promising results for speaker <cit.> and language recognition <cit.>. The initial architecture based on time-delay neural network (TDNN) <cit.> has since been improved with factorization <cit.>, residual networks <cit.> and more recently with channel attention based TDNN <cit.>. Most of these approaches use a pooling layer to convert frame level representations to an utterance level embedding followed by a cross-entropy based classification objective. However, our work investigates the combination of self-supervision objectives along with the supervised labels. Speech Self-Supervised Learning: Prior research in the field of speech self-supervised learning can largely be classified into two major categories: contrastive and predictive. The contrastive approaches learn by maximizing the similarity of an anchor with the positive samples, while simultaneously minimizing its similarity with the negative samples. The class of wav2vec models <cit.> fall in this category. On the other hand, predictive methods are based on masked language modeling (MLM) objective <cit.>. The examples include Discrete-BERT <cit.>, w2v-BERT <cit.>, HuBERT <cit.>, and BEST-RQ <cit.>. Our proposed framework enables integration of label information in both categories of methods. Non-Semantic Speech Representations: For tasks such as language identification, speaker diarization, and emotion detection, it is essential to also capture the non-semantic aspect of speech. TRILL <cit.> utilizes temporal proximity as supervision signal to learn non-semantic representation, with promising results on NOSS (non-semantic speech) benchmark. Further, methods such as FRILL <cit.> and TRILLsson <cit.> have enhanced the performance and efficiency of these models. Another approach named COLA <cit.> modifies the negative sampling scheme to learn more general purpose audio representation. All these works are specifically designed for contrastive techniques, whereas can be integrated with any self-supervised speech representation learning method. Joint learning: Talnikar et. al. <cit.> explored the combination of supervised (connectionist temporal cost (CTC)) and self-supervised (contrastive prediction loss (CPC)) losses for speech recognition. Similarly, UniSpeech <cit.> used CTC labeling and phonetically-aware contrastive learning in a multi-task learning framework. Bai et. al. <cit.> used the self-supervised MLM loss and the speech recognition loss for a multi-lingual speech recognition system. However, all these approaches learn frame-level representations for a semantic task. In our work, the LASR framework combines utterance-level label supervision with frame-level self-supervision. § LASR FRAMEWORK A comprehensive illustration of the framework is depicted in Figure <ref>. A self-supervised speech encoding model f:x→Z, such as wave2vec-2.0 <cit.> or w2v-BERT <cit.>, transforms a raw audio waveform 𝒳 into the frame-level speech representations Z = [z_1, z_2, ..., z_T]. In our proposed LASR framework, the pre-training dataset is denoted as D={(X_1, l_1), (X_2, l_2),..., (X_n, l_n)}, where each speech utterance X_i is accompanied by its corresponding language label l_i. The remaining unlabeled samples will solely be utilized for optimizing the self-supervised objective. Subsequently, we employ an aggregation function g: Z→h to obtain an utterance level embedding h = g(Z). Here, g can, in general, take the form of a neural network such as LSTM or an attention model <cit.>. In our case, g is an average pooling, i.e., h = g(Z) = 1T∑_tz_t. For an anchor speech utterance X_i with aggregate representation h_i and language label l_i, we select a positive and negative sample: X^+_i and X^-_i such that l^+_i = l_i and l^-_i ≠ l_i. We use the triplet-loss objective, as proposed in <cit.>, i.e., L_ = ∑_imax[0, γ + d(h_i, h_i^+) - d(h_i, h_i^-) ], where γ is the margin and d(·, ·) is the distance metric employed. In this work, we use angular distance as the distance metric. We also explore the hard triplet mining strategy <cit.>, where the most distant positive and closest negative sample within the mini-batch are selected to form the triplet. L_ = ∑_imax [0, γ + max_j ∈ i^+ d(h_i, h_j) - min_j ∈ i^- d (h_i, h_j) ] Here, j ∈ i^+ denotes the set of utterances in the mini-batch that have the same label l_j= l_i and j ∈ i^- denotes the set of utterances with a different label, i.e., l_j ≠ l_i. The total loss function used in the proposed approach is given by, L _ = L_ + λ·L_. Here, L_ is the loss corresponding to the self-supervised speech encoding method f and λ decides the trade-off between the SSL objective and hard-triplet objective. In our experiments, we find that having the SSL objective is crucial for achieving the best language recognition performance. In Section <ref>, we also assess the significance of altering the parameter λ. In addition to the triplet loss (Eq. <ref>), we also examine generalized end-to-end loss <cit.>. L_ = ∑_i 1 - σ (max_j ∈ i^+ d(h_i, h_j) ) + σ ( min_j ∈ i^- d (h_i, h_j) ). § EXPERIMENTAL SETUP §.§ Dataset Pre-training Data: In our experiments, we employ a large set of open source speech data for pre-training, totaling about 429k audio hours. This consists of 372k hours of speech data across 23 languages from VoxPopuli dataset <cit.>, 50k hours of speech from 25 languages in Common Voice dataset <cit.>, 50k hours of read speech in 8 European languages from Multilingual LibriSpeech (MLS) corpus <cit.>, and 1000 hours of telephone conversation data across 17 African and Asian languages from BABEL dataset <cit.>. Overall, this combined dataset has speech utterances from 75 languages. Evaluation Data: In our experiments, we employ FLEURS <cit.> and Dhwani <cit.> datasets for spoken language identification. Additionally, we utilize Multilingual Librispeech dataset <cit.> for Automatic Speech Recognition (ASR). The FLEURS dataset consists of speech data for 102 languages, with approximately 12 hours of speech per language, derived from translated versions of 2009 English Wikipedia sentences. All the translations are human generated with training, development and test containing 1500, 150 and 359 sentences respectively. Each sentence was spoken by at least 3 native speakers of the language. The Dhwani dataset encompasses multilingual speech data from 40 Indian languages, downloaded from YouTube and the news platform . For our experiments, we use only the publicly accessible YouTube split, which consists of 12.6k hours of speech in 22 Indian languages. Unlike the FLEURS dataset, the Dhwani dataset is highly noisy and also contains substantial amounts of code-mixing, which challenges the label information based learning in the proposed method. §.§ Baseline systems We compare framework with several other established benchmarks namely, (i) wav2vec-2.0 (w2v) model <cit.> pre-trained with SSL contrastive loss, (ii) w2v-BERT <cit.> model, trained using the SSL MLM loss, and (iii) BEST-RQ <cit.> model, which uses a random quantizer with the MLM loss. Since the LASR approach is agnostic to the choice of the SSL objective function, we explore the combination of wav2vec-2.0, w2v-BERT and BEST-RQ model with the hard-triplet based LASR objective. All models are fine-tuned on the respective training split of the downstream task before evaluation. Implementation details: Most of the hyper-parameters are directly adopted from prior works <cit.>. All the SSL baseline systems are pre-trained for 1.5M epochs. For LASR training, the pre-trained SSL model at 1M epochs is used as initialization, followed by 0.5M steps of training with the LASR objective. All the models are fine-tuned on the supervised training data for an additional 50k epochs, with a batch size of 64. We choose λ from {2, 4, 8, 16}. The Adam optimizer <cit.> is used in conjunction with a Transformer learning rate scheduler <cit.> that has 40k warm-up steps. The learning rate is increased to 6e^-4, followed by an inverse square root decay. We report mean of three runs for all the results. § RESULTS The language recognition performance is measured using accuracy, equal error rate (EER) and macro-F1 score. These results are reported in Table <ref>. The languages in the test set (FLEURS/Dhwani) are split into two categories - a) the set of languages which overlap with the ones in the pre-training (denoted as O, 48 classes in the FLEURS dataset and 5 classes in the Dhwani dataset), and b) the set of languages which do not have any overlap with the set of languages in the pre-training data (denoted as NO, 54 classes in the FLEURS dataset and 17 classes in the Dhwani dataset). Further, the overall results are also reported. The following are the key takeaways from the results reported in Table <ref>. * On the FLEURS dataset, the LASR approach improves the BEST-RQ model relatively by 7.7%, 8.7%, and 58.3% in terms of accuracy, F1 and EER metrics, respectively. Similarly, on Dhwani dataset, the relative improvements from for BEST-RQ are 6.4%, 8.5%, and 5.0% on the above metrics. This trend is consistent across other pre-training methods as well. Thus, LASR framework improves over the baseline SSL results for both the datasets and for all the pre-training models (wav2vec-2.0, w2v-BERT and BEST-RQ). * The improvements observed for the LASR approach are also consistent with the overlap and the non-overlap subsets of the test data, and on all the three metrics reported. * For all the systems compared, the performance on the overlap set is consistently better than the non-overlap set. This indicates that, even when the pre-training objective did not explicitly use language labels (baseline SSL approaches), the language information is implicitly captured by the models. Fully-Supervised Setting: In Table <ref>, we report the performance for the scenario where a supervised pre-training is performed using the combined data of all the languages (pre-training and training data) with the cross-entropy loss. The label set is the union of the languages in the pre-training data and the fine-tuning data. The supervised model architecture is identical to the SSL and LASR models reported in Table <ref>. We also experiment with three different initialization choices for this supervised model - i) random initialization, ii) BEST-RQ model trained with SSL, and iii) BEST-RQ model trained with LASR objective. Our findings show that, on both the datasets, the fully-supervised setting does not achieve satisfactory results without weight initialization using a pre-trained model. While the accuracy of the supervised model improves over the SSL and LASR models in Table <ref>, EER and F1 scores are substantially worse for the supervised models. Nevertheless, the performance in this setting also improves with initialization. § DISCUSSION Effect of different optimization objectives - Table <ref> compares various supervised loss functions. These experiments used the BEST-RQ <cit.> model evaluated on the FLEURS dataset. The first two experiments of Table <ref> use only the MLM loss (SSL loss) or only the supervised loss (Hard-triplet loss). The remaining experiments use the combined LASR loss (Eq. <ref>). As seen here, the hard-triplet loss improves over other choices of semi-hard triplet loss or GE2E loss. Choice of supervised loss weight λ - For the hard-triplet loss in the LASR objective function (Eq. <ref>), we have experimented with different choices of λ. These results are reported in Fig. <ref>. The optimal choice of λ is found to be 16, which indicates that a higher weight for the supervised component is beneficial for the language recognition performance. However, a larger value, for example, λ = 32, degrades the performance. Pre-training with missing/noisy labels - All experiments reported thus far used the language label information for the entire pre-training data. We experiment with the robustness of the LASR approach for cases where the label information is either missing or noisy. For these experiments reported in Fig. <ref>, we assume p% of the pre-training data to either have missing labels or have noisy labels (randomly corrupted to other language labels in pre-training set). As expected, the language recognition performance degrades as p increases. However, even when 75% of the pre-training data labels are missing, LASR is significantly better than the baseline approach. The experiments highlight that the LASR approach can also yield performance improvements on pre-training data with noisy/missing labels. Impact on downstream ASR tasks - In this section, we fine-tune LASR models on a semantic task, namely ASR. In particular, we run experiments for multilingual ASR on the MLS dataset. We follow a similar setup for ASR fine-tuning as was done in <cit.>. To be more specific, we use the RNN-transducer model <cit.>, where the decoder uses unidirectional LSTM. We do not employ shallow fusion with an external language model. The ASR WER (%) results are reported in Table <ref>. As seen in this table, the LASR based objective does not degrade the overall ASR performance even when the label information used in the LASR loss is an utterance-level non-semantic label. Thus, the representations learned using the LASR approach improve the language recognition tasks without any degradation on semantic tasks such as ASR. § CONCLUSION In this paper, we introduce a method for enhancing self-supervised speech representation learning by incorporating non-semantic language label information. Our proposed approach, Label Aware Speech Representation (LASR) learning, utilizes a triplet-based objective in addition to the self-supervised loss function. The results from language recognition experiments demonstrate that the LASR approach provides substantial overall improvements, particularly on subsets of test data that do not overlap with pre-training languages. Additionally, experiments on the automatic speech recognition (ASR) task indicate that the LASR model produces speech representations that do not compromise performance for semantic tasks. IEEEtran
http://arxiv.org/abs/2306.06625v1	20230611085327	Are Intermediate Layers and Labels Really Necessary? A General Language Model Distillation Method	[ "Shicheng Tan", "Weng Lam Tam", "Yuanchun Wang", "Wenwen Gong", "Shu Zhao", "Peng Zhang", "Jie Tang" ]	cs.CL	[ "cs.CL", "cs.AI" ]	Spanning subdivisions in dense digraphs Hyunwoo Lee Department of Mathematical Sciences, KAIST, South Korea and Extremal Combinatorics and Probability Group (ECOPRO), Institute for Basic Science (IBS). E-mail: [email protected]. Supported by the National Research Foundation of Korea (NRF) grant funded by the Korea government(MSIT) No. RS-2023-00210430, and the Institute for Basic Science (IBS-R029-C4). ========================================================================================================================================================================================================================================================================================================================================================================================================= [1]This work was done when the author visited Zhipu.AI. [2]Corresponding authors. The large scale of pre-trained language models poses a challenge for their deployment on various devices, with a growing emphasis on methods to compress these models, particularly knowledge distillation. However, current knowledge distillation methods rely on the model's intermediate layer features and the golden labels (also called hard labels), which usually require aligned model architecture and enough labeled data respectively. Moreover, the parameters of vocabulary are usually neglected in existing methods. To address these problems, we propose a general language model distillation (GLMD) method that performs two-stage word prediction distillation and vocabulary compression, which is simple and surprisingly shows extremely strong performance. Specifically, GLMD supports more general application scenarios by eliminating the constraints of dimension and structure between models and the need for labeled datasets through the absence of intermediate layers and golden labels. Meanwhile, based on the long-tailed distribution of word frequencies in the data, GLMD designs a strategy of vocabulary compression through decreasing vocabulary size instead of dimensionality. Experimental results show that our method outperforms 25 state-of-the-art methods on the SuperGLUE benchmark, achieving an average score that surpasses the best method by 3%. [The code is available at <https://github.com/aitsc/GLMKD>.] § INTRODUCTION The exponential increase in the scale of pre-trained language models has impeded their deployment on a wider range of devices. To mitigate the inference cost of large-scale pre-trained language models, researchers have increasingly focused on model compression methods, aiming to compress a large model into a small one with as little performance loss as possible <cit.>. While model compression can yield very small models, maintaining performance without degradation is still a challenging task, particularly when the large and small models have a significant discrepancy in parameter size <cit.>. There are various methods of model compression <cit.>, including network pruning <cit.>, quantization <cit.>, neural architecture search <cit.>, parameter sharing <cit.>, matrix decomposition <cit.>, and knowledge distillation <cit.> etc. Currently, knowledge distillation is an important research direction, which allows for the transfer of knowledge from a large model (the teacher) to a small one (the student). There are two main optimization objectives of the earliest knowledge distillation methods <cit.>: increasing the similarity between the student's prediction probabilities for the task and those of the teacher (soft targets); increasing the similarity between the student's predictions and the golden labels (hard targets). When the knowledge distillation method is applied to language models, there are typically two directions for improvement: leveraging the intermediate layer features of the teacher model, such as hidden states and attention, to obtain additional hidden state knowledge <cit.>; and refining the two objectives (soft targets and hard targets) and weights of objectives <cit.>. As shown in Table <ref>, these methods all rely on intermediate layer features or hard labels of the model. However, using intermediate layer features and hard labels is often accompanied by certain limitations, such as the requirement for the teacher and student models to have the same structure and dimensions, or the need for additional data and labels. These limitations make the implementation of distillation complex and hinder the applicability of these methods to a wider range of models and data. Moreover, existing methods often reduce the parameter scale of the model by decreasing the number of layers and hidden dimensions, neglecting the impact of vocabulary size. To address these problems, we propose a general language model distillation (GLMD) method that performs two-stage (pre-training and task-specific stages) word prediction distillation and vocabulary compression. Specifically, GLMD distills the model using only the language modeling word prediction logits during the pre-training stage, which is similar to the soft labels used in general methods. The key to this stage is that we distill both masked and unmasked tokens. In the task-specific stage (fine-tuning), GLMD distills both the language modeling word prediction logits and the soft labels. The language modeling word prediction logits is crucial in this stage, making the distillation more consistent between the pre-training and task-specific stages. In these two stages, GLMD eliminates the need for complicated intermediate layers and golden labels and does not require the selection of intermediate layers or labeled dataset. Meanwhile, GLMD uses the teacher vocabulary to map low-frequency words to the most similar high-frequency words, further compressing the model with almost no performance loss. In summary, our major contributions are: * We propose a general language model distillation (GLMD) method that saves the tedious work on intermediate layer features and golden labels, and does not require the selection of intermediate layers or labeled dataset. We demonstrate through analysis that GLMD allows models to autonomously learn intermediate layer features that are similar to those of the teacher. * We propose a vocabulary compression strategy based on the long-tailed distribution of words in data, which reduces the vocabulary size without reducing dimensions of the model. Additionally, our vocabulary compression strategy can be used in conjunction with other dimensionality reduction strategies with very little performance loss. * We verify that GLMD outperforms 25 state-of-the-art model distillation methods on the SuperGLUE benchmark, achieving an average score that surpasses the best method by 3%. Furthermore, our vocabulary compression strategy also outperforms other 2 dimensionality reduction strategies. We also investigate distillation of ultra-large-scale language models (10B-scale) for the first time. § RELATED WORK Language Model Distillation Since the introduction of knowledge distillation to pre-trained language models by PKD <cit.>, an increasing number of researchers have recognized the importance of knowledge distillation. During the early stage of the research, PD <cit.> employed simple baseline (soft targets) distillation for language models, resulting in a relatively limited transfer of knowledge for the model. Subsequent research had primarily focused on the use of intermediate layer features in language models <cit.>, including distillation of models during pre-training stage <cit.>, task-specific stage <cit.>, and two-stage <cit.> approaches. Given the typically large amount of intermediate layer features, some work had utilized features from only a single intermediate layer <cit.>, while other work had examined methods for reducing the scale of features <cit.>. Recent work has explored ways to utilize better intermediate layer features, for example, CoDIR <cit.> and LRC-BERT <cit.> utilized cross-sample feature relationships through contrastive learning; ALP-KD <cit.> and Universal-KD <cit.> combined all intermediate layer features through attention mechanisms; Meta-KD <cit.> and HRKD <cit.> used meta-learning to assign appropriate weights to intermediate layer features; RAIL-KD <cit.> randomly selected different intermediate layers for distillation; CKD <cit.> and MGSKD <cit.> used some variety of similarity calculation methods for intermediate layer features; DIITO <cit.> allowed student models to learn counterfactual outputs by swapping intermediate layer features between different samples. However, the use of intermediate layer features has additional limitations, such as requiring the same model structure <cit.> for both teacher and student, or requiring linear transformations <cit.> to ensure consistency in dimensions between teacher and student. There were also methods that only used soft and hard targets, for example, Annealing-KD <cit.> and Continuation-KD <cit.> gradually increased the weight of soft targets through simulated annealing; RW-KD <cit.> adjusted the weight of soft and hard targets through meta-learning and a dev set; MetaDistil <cit.> allowed the teacher to learn how to output better soft labels through meta-learning and a quiz set. These approaches relied on hard labels and may have even required additional datasets for partitioning. Additionally, there had been approaches that distilled multiple teachers <cit.> or teacher assistants <cit.> at the same time, but they still relied on intermediate layer features or hard labels. In comparison, GLMD can achieve the strongest performance in a more broadly applicable context without intermediate layer features or hard labels. Vocabulary Compression Vocabulary compression refers to reducing the parameter size of the vocabulary in a language model. In the knowledge distillation of language models, reducing the parameter size of the model is mainly used to reduce the number of model layers or dimensions <cit.>. MobileBERT <cit.> and ALBERT <cit.> independently reduced the dimensions of the vocabulary to achieve vocabulary compression. MobileBERT needed to restore the dimension of the vocabulary in the calculation of the pre-training loss due to the requirement to ensure consistency between the vocabulary dimension and the model output dimension. On the other hand, ALBERT used a linear layer to alter the output dimension of the model. However, these vocabulary compression methods only reduced the dimensionality and ultimately required dimensionality restoration. In contrast, our vocabulary compression method reduces the number of words through mapping, further compressing the model with almost no impact on performance. § PRELIMINARIES In this section, we introduce the objective function for knowledge distillation of language models, and formalize the language modeling word prediction logits. §.§ Knowledge Distillation Knowledge distillation aims to transfer the knowledge of the teacher T to the student S. The knowledge and transfer method can be formalized as model features and distance metrics respectively. Formally, knowledge distillation for language models typically consists of the following three objective functions: [ ℒ_soft=^2KL(σ(f_l^S(𝐱)/), σ(f_l^T(𝐱)/)); ℒ_hard=CE(σ(f_l^S(𝐱)), 𝐲); ℒ_inter=d(f^S(𝐇^S), f^T(𝐇^T)) ] where denotes the softening parameter (temperature), KL(·,·) denotes the KL divergence, σ denotes the softmax function, 𝐱∈ℝ^l denotes the input sequence (token ids) of length l for the language model, f_l^S(𝐱) and f_l^T(𝐱) denote the logits output by the student and the teacher before computing the task loss respectively, CE(·,·) denotes the cross entropy, 𝐲 denotes the hard labels, d(·) denotes the distance metric (e.g., KL divergence and mean square error), 𝐇^S and 𝐇^T denote the intermediate layer features (e.g., hidden states and attention) of the student and the teacher respectively, f^S(·) and f^T(·) denote custom transformations (e.g. linear transformations) of the student and teacher features, respectively. Currently, mainstream methods employ different combinations and weighting schemes of the three objective functions in the pre-training and task-specific stages. For example, TinyBERT <cit.> optimizes ℒ_inter in the pre-training stage and optimizes ℒ_inter and ℒ_soft in the task-specific stage, while MetaDistil <cit.> only optimizes ℒ_soft and ℒ_hard in the task-specific stage. Notably, to ensure feature dimension matching between the teacher and student, ℒ_inter relies on complex custom transformations, such as linear transformations (f(𝐇)=𝐖𝐇) and pair-wise scaled dot-product (f(𝐇)=𝐇𝐇^T/√(dimensionality)). In contrast, our method does not rely on ℒ_inter and ℒ_hard. §.§ Language Modeling Word Prediction Logits Language modeling typically refers to unsupervised tasks in the pre-training stage, such as causal language modeling for GPT <cit.>, masked language modeling for BERT <cit.>, and autoregressive blank filling for GLM <cit.>. This process typically requires a decoder to decode the model's output into a prediction logits for each word. The decoder is typically a linear transformation using the vocabulary parameters as weights. The language modeling word prediction logits can be formulated as follows: LM(𝐱)=f_t(𝐱)𝐖_v^T where 𝐖_v∈ℝ^v× h denotes the vocabulary parameters (weight of embeddings-layer), and f_t(𝐱)∈ℝ^l× h denotes the output of the final layer of transformer. The scalar value l denotes the length of the text sequence, v denotes the number of tokens in the vocabulary, and h denotes the dimensionality of the hidden layer. It is worth noting that the LM(·) can also be computed at the task-specific stage. § METHOD In this section, we propose a general language model distillation (GLMD) method with two-stage word prediction distillation and vocabulary compression. Figure <ref> shows the overview framework of GLMD, which implements a vocabulary compression strategy while performing a two-stage word prediction distillation process. We next provide a detailed description of these two components. §.§ Two-stage Word Prediction Distillation To eliminate the reliance on intermediate layer features and hard labels in distillation, we propose a two-stage word prediction distillation process based on the language modeling word prediction logits. It allows teacher models and students models to have different model structures and does not need the selection of intermediate layers. This process makes the distillation goal more closely aligned with the model's task and makes the model's distillation more consistent across both the pre-training and task-specific stages. During the pre-training stage, we optimize the student model with the objective function ℒ^'_sp. We then optimize the student again using ℒ^'_sp during the task-specific stage. After these two training phases, we finally optimize the student with the objective function ℒ_st from the task-specific stage. Our objective functions ℒ_st and ℒ^'_sp are defined as: [ ℒ_st=ℒ_soft; ℒ^'_sp=ℒ_sp⊙𝐦_p; ℒ_sp=^2KL(σ(LM^S(𝐱)/), σ(LM^T(𝐱)/)) ] where ⊙ denotes the Hadamard product, and 𝐦_p∈ℝ^l denotes the mask vector, which only masks the pad while preserving the masked and unmasked tokens. We find that unmasked tokens are typically not predicted by language modeling, but they can provide more knowledge for distillation. ℒ^'_sp and ℒ_st represent the soft targets for the pre-training and task-specific stages, respectively. It is worth noting that ℒ^'_sp can be used in both pre-training and task-specific stages, making the optimization objectives more consistent across the two stages. §.§ Vocabulary Compression To further compress the parameter scale of the model, we propose a vocabulary compression strategy that reduces the number of tokens in the vocabulary. Because word frequencies have a long-tailed distribution, some low-frequency words can still be understood by the language model after being replaced with similar words. Let the compression rate of the vocabulary be r_v, and the number of all tokens before compression be v. We sort the tokens in the pre-trained corpus according to their frequency of occurrence. The tokens ranking in the top vr_v are treated as the compressed tokens 𝐰_c∈ℝ^vr_v, while the remaining tokens 𝐰_m∈ℝ^v(1-r_v) are to be mapped. Figure <ref> illustrates the key aspect of our vocabulary compression strategy, which includes replacing low-frequency words with similar words through token mapping and aligning the weight matrix of the embedding-layer through weight mapping. The token mapping aims to map w_m∈𝐰_m to w_c∈𝐰_c, and the mapping function is defined as: f_tm(w_m)=argmax_w_c∈𝐰_c (Sim(v(w_m),v(w_c))) where v(w_m) and v(w_c) denote the token vectors of w_m and w_c in the pre-trained teacher's vocabulary weight 𝐖_v_t, respectively. Sim(·,·) is a function of calculating similarity using the inner product, which is similar to the decoding in Equation <ref>. The weight mapping aims to remove 𝐰_m from 𝐖_v_t, and the mapping function is defined as: f_wm(𝐖_v_t)=𝐖_v_t[𝐰_c] where [·] denotes a slicing operation, specifically obtaining all vector of w_c∈𝐰_c from 𝐖_v_t. § EXPERIMENTS In this section, we demonstrate the effectiveness of the GLMD on models with different parameter scales (110M, 340M, and 10B) and analyze the role of different components and why they are effective. All experiments were conducted on 40 NVIDIA A100 GPUs and completed within 4 months, utilizing the PyTorch framework. §.§ Experimental Setup Datasets To evaluate our GLMD method, we conduct experiments on the more challenging SuperGLUE <cit.> benchmark instead of GLUE <cit.>. The use of more difficult tasks allows for a better display of the discrepancy between different distillation methods. We use the average score across 8 tasks in SuperGLUE as the evaluation metric. We use BooksCorpus <cit.> and English Wikipedia as the data (19GB) for the distillation of pre-training stage for all methods. Baselines We compare 25 commonly used distillation methods as listed in Table <ref>. We provide a more detailed description of these methods in Appendix <ref>. Language Models Student and teacher models of all methods have the standard GLM <cit.> architecture. GLM (General Language Model) is a more advanced language model that inherits the advantages of both autoencoding and autoregression. We choose GLM for two reasons: it performs stronger than the commonly used BERT <cit.> and RoBERTa <cit.>; it has open-source pre-trained language models with 10B-scale or even 100B-scale parameters <cit.>. All pre-trained models, with the exception of MobileBERT, which was trained by us based on GLM, were obtained from the official GLM website [https://github.com/THUDM/GLM]. Both the teacher and student models were trained with half-precision floating-point (fp16). The model sizes used in this paper are shown in Table <ref>. Hyperparameters For our method, the temperatures for the loss ℒ^'_sp and ℒ_st are set to 15 and 1, respectively. All baselines use the best parameters from their respective papers. For all methods that rely on the pre-training stage, the batch size, peak learning rate, and number of iterations are set to 64, 4e-4, and 150000, respectively. For all single-teacher methods, we use grid search to find the best parameters during the task-specific stage, including the learning rate {5e-6,1e-5,2e-5} and batch size {16,32}. The multi-teacher and teacher assistant methods are similar to the single-teacher methods in the core method, with differences in the weighting and assistant of teachers. The other parameters for the task-specific stage are kept consistent with the fine-tuned teacher, using the best parameters provided by GLM. The results for all experiments (w/o T_3-S_3) are the average of 3 random seeds. For more details on the hyperparameters, refer to Appendix <ref>. §.§ Main Results In Table <ref>, we report the average scores of all methods on the SuperGLUE dev set. GLMD_-vc denotes GLMD without vocabulary compression strategy. GLMD_-vc+mo and GLMD_-vc+al denote the use of MobileBERT and ALBERT vocabulary compression strategies on GLMD, respectively. GLMD_+al denotes the combination of ALBERT and our vocabulary compression strategies on GLMD. GLMD achieves the highest performance among 25 baselines on T_1-S_1, T_1-S_2, and T_2-S_2 scales, with a 0.1%, 0.1%, and 3.1% improvement over the best method (TinyBERT), respectively. More importantly, in a fair environment without vocabulary compression, GLMD_-vc outperforms the best method by 0.7%, 0.7%, and 3.0%, respectively. This demonstrates that high-performance distillation does not necessarily require intermediate layer features or hard labels, whether reducing the number of layers or the dimensionality of the student model. GLMD significantly outperforms TinyBERT in the distillation process on the scale of 10B to 2B, indicating that TinyBERT is not suitable for ultra-large-scale model distillation on the SuperGLUE benchmark. The use of vocabulary compression in GLMD still maintains strong competitiveness in further compressing the model. GLMD outperforms the best vocabulary compression strategy (GLMD_-vc+al) by 0.1% on T_1-S_1 scale, confirming that reducing the vocabulary size is an effective strategy. It is worth noting that our vocabulary compression strategy can be combined with other dimensionality reduction methods, such as GLMD_+al, which can maintain the original performance even with only one-fourth of the vocabulary parameters. Additionally, some recent baselines did not show the strongest performance, we discuss more factors affecting baseline performance in appendix <ref>. §.§ Ablation Study After having validated the effectiveness of GLMD and GLMD_-vc, we further analyze in Table <ref> the key design factors that impact the performance of the two components in greater detail. (1) Two-stage word prediction distillation. The results indicate that both removing 𝐦_p (row 4) or removing unmasked tokens (row 5) from 𝐦_p do not perform as well as GLMD_-vc (row 3), which confirms the effectiveness of 𝐦_p in ℒ^'_sp. The use of 𝐦_p in ℒ^'_sp in the task-specific stage makes the distillation of the student more consistent in the pre-training and task-specific stages, which is verified by row 6. The performance degradation observed upon incorporating intermediate layer features (row 7) or hard labels (row 8) into the loss function in GLMD_-vc further confirms that such features and labels are not necessary. Additionally, we find that the KL divergence performed better than the MSE (mean square error) in both ℒ^'_sp and ℒ_st (rows 9 and 10). (2) Vocabulary compression. In addition to mapping low-frequency tokens to similar tokens using the decoder approach, we also attempt to use Cosine similarity (row 13), Euclidean distance (row 14), and direct replacement with [UNK] (row 15) to map similar tokens. We found that these mapping methods did not perform as well as GLMD (row 12), which may be because the mapping method used in GLMD is closer to the decoding approach used in language modeling task. The result of line 12 outperforming line 16 verifies that token mapping is only applicable for students. § ANALYSIS In this section, we analyze the reasons behind the work of GLMD and the impact of hyperparameters on performance in GLMD. §.§ Why Does GLMD Work? Compared to methods using only soft or hard labels, the ℒ^'_sp in GLMD_-vc clearly provides more knowledge, but it is still unclear why the intermediate feature is not necessary. We hypothesize that ℒ^'_sp reduces inductive bias and allows the model to spontaneously learn intermediate features that should be similar to the teacher. To verify this hypothesis, we calculate the spearman correlation between the distance d(f^S(𝐇^S), f^T(𝐇^T)) and ℒ^'_sp during pre-training stage of GLMD_-vc. The red part in Figure <ref> shows that as ℒ^'_sp decreases, not all the distance of features between teacher and student is getting close during distillation so that it may not be necessary to draw all the intermediate features close as in existed methods, supporting our hypothesis. We hypothesize that the success of the vocabulary compression strategy is based on the long-tail distribution of tokens, where some low-frequency tokens can still be understood by the language model after being replaced with similar tokens. Figure <ref> verifies the long-tail distribution of tokens. The result in row 16 of Table <ref> shows that using token mapping for teacher results in a decrease in performance. This verifies that even when some low-frequency tokens are replaced with similar tokens, students can still learn the meaning of these tokens from teachers without token mapping. §.§ Hyper-parameter Analysis In Table <ref>, we analyze the impact of these hyperparameters on performance: in ℒ^'_sp and ℒ_st, batch size in pre-training stage, and r_v in GLMD_-vc. We find that the temperature hyperparameter () has a significant impact on the performance of ℒ^'_sp (rows 4-7) but little effect on ℒ_st (rows 8-14). Similarly, in ℒ^'_sp, we observe that the batch size during the pre-training stage is roughly proportional to performance (rows 15-18). The compression ratio (r_v) in our vocabulary compression strategy (rows 21-23) also follows this trend as a higher r_v results in more parameters being retained. It is worth noting that the teacher models (T_1 and T_2) required a batch size of 1024 during the pre-training process, which is significantly larger than the batch size we used in distillation. §.§ Limitation Due to limitations in time and computational resources, we limited our experiments to using GLM and SuperGLUE benchmark[Given the requirement for grid search and seed averaging, we have run over a thousand SuperGLUE averages.]. While transformer-based language models and the SuperGLUE benchmark are representative, further validation is necessary when applied to a wider range of models and tasks. Additionally, we found that the performance of GLMD_-vc (10B→2B) at 85.28% was marginally lower than that of GLM-2B at 85.91%. However, it's noteworthy that GLM-2B leverages a substantially greater scale in the pre-training stage with a batch size, iterations, and GPU count of 7168, 17k, and 224 respectively, far exceeding the respective parameters of 64, 15k, and 8 employed by GLMD_-vc (10B→2B) in its distillation during the pre-training stage. We plan to further investigate these potential limitations in future work. § CONCLUSIONS In this paper, we introduce a general language model distillation method called GLMD. GLMD has two main advantages: improving distillation performance without relying on intermediate layer features and hard labels and reducing vocabulary parameters without reducing dimensions. We also had two important findings: distillation of intermediate layer features is unnecessary, and a vocabulary compression strategy that reduces the number of tokens is feasible and can be combined with a method that reduces dimensions. In the future, we plan to explore model distillation on a 100B-scale and apply it to more real-world scenarios. § ETHICAL STATEMENT This paper aims to compress language models using knowledge distillation methods, and the proposed method do not raise ethical problems or potential biases. All language models, baselines, and datasets used in this work are publicly available and widely used. § ACKNOWLEDGEMENTS This work is supported by Technology and Innovation Major Project of the Ministry of Science and Technology of China under Grant 2020AAA0108400 and 2020AAA0108402, the Natural Science Foundation of China under Grant No. 61836013, the Major Program of the National Social Science Foundation of China under Grant No. 18ZDA032, and funds from CCF-Zhipu.AI and Beijing Academy of Artificial Intelligence (BAAI). The GPUs used are sponsored by Zhipu.AI. acl_natbib § IMPLEMENTATION DETAILS In this section, we provide a detailed overview of all baselines and hyperparameters for the benefit of researchers interested in a deeper analysis. §.§ Baselines In Table <ref>, we show the differences between 25 baseline methods in the features used. Using only hard labels for the training process is equivalent to pre-training or fine-tuning without distillation. Of these methods, 22 are specifically designed for language models, while the remaining 3 (KD, TAKD, and DGKD) are from computer vision. Figure <ref> illustrates the differences between our vocabulary compression strategy and the other two strategies. Next, we provide a brief overview of these methods, as well as some strategies we adopted and adaptations for GLM. KD <cit.> was originally from computer vision and was not designed for the pre-training stage. We used randomly initialized parameters during the pre-training stage. PD <cit.> removed the use of hard labels from KD, but used a pre-trained student model to initialize the student for the task-specific stage. The same hyperparameters are used for pre-training of the student model, regardless of whether distillation is performed. PKD <cit.> was based on KD and added distillation loss for the [CLS] token in the intermediate layers. It was the first approach to initialize the student model for the task-specific stage by assigning some of the fine-tuned teacher's parameters to the student. DistilBERT <cit.> was the first approach to use distillation during the pre-training stage and only require fine-tuning during the task-specific stage. Theseus <cit.> implemented distillation by continuously replacing intermediate layers in the teacher with smaller intermediate layers. TinyBERT <cit.> was the first approach to use distillation during both the pre-training and task-specific stages. We did not use data augmentation here. SID <cit.> gradually increased the the number of layers for distillation as the number of epochs increased. We used the Exp3.4 strategy from the original paper. MobileBERT <cit.> implemented a large-scale reduction of model parameters without reducing the number of model layers using an inverted-bottleneck structure. Since it required modifying the teacher's structure, we spent a week using the same hyperparameters as GLM-Large to pre-train an inverted-bottleneck structure of GLM-Large on 16 NVIDIA A100 GPUs. We used the PKT (progressive knowledge transfer) strategy from the original paper. MiniLM <cit.> distilled the attention probability matrix and the value matrix of the final layer transformer during the pre-training stage. MiniLMv2 <cit.> replaced the attention probability matrix from MiniLM with query and key matrices, and modified the distillation of the final layer to other layers. ALP-KD <cit.> fused the features of all layers in the teacher model through an attention mechanism, allowing each layer in the student model to capture information from all layers in the teacher. LRC-BERT <cit.> constructed a loss on intermediate layer features based on contrastive learning, causing the intermediate layer features of the teacher model for other samples in the same batch to be dissimilar to the intermediate layer features of the student model for the current sample. We did not use gradient perturbation as in the original work. Annealing-KD <cit.> gradually increased the weight of teacher features during the process of distilling soft targets. Continuation-KD <cit.> built upon Annealing-KD by merging two training processes at the task-specific stage, resulting in the weight of hard targets increasing with the number of iterations. In addition, soft targets were not used when the value of the soft target loss was relatively small. CKD <cit.> used the distance between any two or three tokens in the hidden state features as context features for the teacher and student, and then the distance between the teacher and student on these context features was used as the loss. CKD proposed task-agnostic and task-specific distillation losses, and we used task-specific distillation loss. Universal-KD <cit.> used a similar attention mechanism to ALP-KD, but applied an additional linear transformation to the intermediate layer features to ensure consistency in the hidden state dimensions of the teacher and student. The original paper provided three strategies for constructing the loss, and we adopted Universal-KD^(IL). DIITO <cit.> allowed the student model to learn counterfactual outputs by exchanging intermediate layer features between different samples. This process required two forward propagations per batch, the first to extract intermediate layer features and the second to exchange them. The original paper provided multiple strategies for aligning and exchanging the intermediate layer features, and we adopted DIITO_FULL+ℒ_Cos^DIITO. RAIL-KD <cit.> randomly used different intermediate layers of the teacher for distillation in each epoch of training in order to improve the generalization ability of the student model. It used a pre-trained distilled model of DistilBERT to initialize the task-specific stage. In cases where initialization with DistilBERT was not possible due to dimensional constraints (e.g. T_1-S_1 and T_2-S_2), we used MiniLM for initialization. MGSKD <cit.>, based on CKD, used avg pooling to transform the hidden state features into features with three levels of granularity (token, span, sample) and constructed the loss on different layers using these granularities separately. For span representation, we randomly selected the token spans whose start positions and lengths are sampled from some distributions. TMKD <cit.> introduced the multi-teacher method for language model distillation for the first time, with the aim of making the output of the student model as close as possible to the output of all the teacher models. There are two differences in our implementation compared to the original method: (1) We were unable to implement the multi-header layer, which transforms the output of the student model, due to the differences between GLM and BERT. (2) Since the original pre-training data is not publicly available, we used the same pre-trained corpus as other methods. MT-BERT <cit.> first used co-finetuning to fine-tune all the teachers simultaneously, and then used the reciprocal of each teacher's loss on the task as the weight for the loss between each teacher and the student. Due to the differences between GLM and BERT, the use of co-finetuning significantly degraded the performance of the teacher models, so we did not use co-finetuning. RL-KD <cit.> used reinforcement learning to select appropriate teachers for distillation at each iteration, and the final loss was the average of the loss between each selected teacher and the student. We used the reward_1 from the original paper as the method for calculating the reward. Uncertainty <cit.> used the entropy of the student's predicted results as a criterion for selecting the teacher at each iteration. The lower the entropy, the more confident the student was and the more it learned from the larger scale teacher, a process referred to as dynamic teacher adoption. We employed the hard selection strategy from the original paper. TAKD <cit.>, for the first time, used a teacher assistant approach in which the teacher was distilled to a mid-sized teacher assistant before being distilled to the student, rather than distilling the teacher directly to the student. DGKD <cit.>, building upon TAKD, used all previously distilled teachers and assistants to distill the current model. It randomly discarded teachers or assistants at each iteration to serve as a regularizer. §.§ Hyperparameters To ensure the reproducibility of all methods, we present in Table <ref> the learning rates and batch sizes for each method on each dataset in the SuperGLUE benchmark, including the hyperparameters obtained via grid search. Table <ref> further shows the additional hyperparameters for the task-specific stage, which follow the settings of GLM. § ADDITIONAL ANALYSIS In this section, we further explore the various factors that influence the performance of the baselines and examine the necessity of intermediate layer features. §.§ What Factors Affect Performance? In the implementation of baselines, we discover that certain methods for initializing the student parameters led to a decrease in performance, surpassing even the advantages brought about by the method innovation. Specifically, these include the following three ways: (1) using truncated teacher parameters in the case of different dimensions of teacher and student hidden layers. Many methods that do not distill in the pre-training stage will use the parameters of the first few layers of the fine-tuned teacher as student parameters in a task-specific stage. In the case of different dimensions of teacher and student hidden layers, we can only truncate some parameters per layer. As shown in Table <ref>, Universal-KD <cit.> in T_1-S_2 performs much better than T_1-S_2 and T_2-S_2, TAKD <cit.> and DGKD <cit.> also performs badly due to this reason. (2) Using less data to pre-train a student model as initialization. To ensure fairness, regardless of whether distillation is used, we set the batch size of all methods in the pre-training stage to 64, which is equivalent to only using one-sixteenth of the full data (batch size=1024). Some methods that use a pre-trained student as initialization for a task-specific stage may be affected by this, for example, PD <cit.>, SID <cit.>, LRC-BERT <cit.>, Annealing-KD <cit.>, Continuation-KD <cit.>, and CKD <cit.>. (3) Randomly initializing the parameters of the student model. As can be seen from Table <ref>, KD <cit.> using random initialization are obviously inferior to PD <cit.> using pre-trained students and soft labels. The above analysis demonstrates that methods without pre-training distillation are sensitive to the initialization of the student's parameters. To achieve optimal performance, methods based on truncating teacher parameters require the hidden dimensions of the teacher and student to be identical or else, other methods would require a significant cost in pre-training a student model. Therefore, utilizing a subset of the corpus for knowledge distillation during the pre-training stage is a more favorable option. §.§ Why are Intermediate Layers not Necessary? In Section <ref>, we have verified that the ℒ^'_sp in GLMD_-vc can enable the model to spontaneously learn intermediate layer features that should be similar to those of the teacher. We further validate in Figure <ref> that training with a loss function focused on the intermediate layer features does not lead to a reduction in ℒ^'_sp and cannot even lower the perplexity (PPL) of language modeling. In the process of distillation using GLMD_-vc and TinyBERT methods, we have quantified the spearman correlation between the distance of student and teacher features, including the perplexity of the student model on the validation set, and the loss function values. We observe that there is no correlation between the loss function values of TinyBERT and ℒ^'_sp, nor with the perplexity of the validation set. This suggests that we may not require a significant inductive bias towards the intermediate layer features. § DETAILED RESULTS Due to space constraints, we do not present results for all datasets in the SuperGLUE benchmark in the main text but only show the averages. Table <ref> shows the results for all methods on each dataset in the SuperGLUE benchmark, rounded to two decimal places.
http://arxiv.org/abs/2306.12217v2	20230621121917	Lumbar spine segmentation in MR images: a dataset and a public benchmark	[ "Jasper W. van der Graaf", "Miranda L. van Hooff", "Constantinus F. M. Buckens", "Matthieu Rutten", "Job L. C. van Susante", "Robert Jan Kroeze", "Marinus de Kleuver", "Bram van Ginneken", "Nikolas Lessmann" ]	eess.IV	[ "eess.IV", "cs.CV" ]	Python Framework for Modular and Parametric SPICE Netlists Generation Sergio Vinagrero Gutiérrez, Giorgio Di Natale, Elena-Ioana Vatajelu Univ. Grenoble Alpes, CNRS, Grenoble INP, TIMA, 38000 Grenoble, France {sergio.vinagrero-gutierrez,giorgio.di-natale,ioana.vatajelu}@univ-grenoble-alpes.fr July 31, 2023 ====================================================================================================================================================================================================================================== This paper presents a large publicly available multi-center lumbar spine magnetic resonance imaging (MRI) dataset with reference segmentations of vertebrae, intervertebral discs (IVDs), and spinal canal. The dataset includes 447 sagittal T1 and T2 MRI series from 218 patients with a history of low back pain. It was collected from four different hospitals and was divided into a training (179 patients) and validation (39 patients) set. An iterative data annotation approach was used by training a segmentation algorithm on a small part of the dataset, enabling semi-automatic segmentation of the remaining images. The algorithm provided an initial segmentation, which was subsequently reviewed, manually corrected, and added to the training data. We provide reference performance values for this baseline algorithm and nnU-Net, which performed comparably. We set up a continuous segmentation challenge to allow for a fair comparison of different segmentation algorithms. This study may encourage wider collaboration in the field of spine segmentation, and improve the diagnostic value of lumbar spine MRI. § BACKGROUND & SUMMARY Low back pain (LBP) causes the largest burden of disease worldwide, with most years lived with disability of any disease.<cit.> As a consequence, lumbar spine magnetic resonance imaging (MRI) for LBP is one of the most used imaging procedures within musculoskeletal imaging.<cit.> In the United States, 93% of the lumbar MRI referrals were appropriate according to the American College of Radiology guidelines, even though only 13% of the scans contributed in the clinical decision making.<cit.> Automatic image analysis might be the key to improve the diagnostic value of MRI by enabling more objective and quantitative image interpretation. A first step toward automatic assessment of lumbar spine MRI is segmentation of relevant anatomical structures, such as the vertebrae, intervertebral discs (IVDs) and the spinal canal. With recent advances in machine learning and artificial intelligence (AI), state-of-the-art spine segmentation algorithms are generally learning-based algorithms that require well-curated training data. The development of vertebra segmentation algorithms for CT images has considerably benefitted from multiple large publicly available datasets with CT images and reference segmentations.<cit.> Currently no comparable large high quality datasets are available for lumbar spine MRI. Existing available datasets are either small, only segment the vertebral body<cit.>, or are only annotated in the midsagittal slice (2D)<cit.>. Moreover, most datasets are limited to only one of the many anatomical structures that are most relevant for assessing multifactorial disorders such as LBP, i.e., only the vertebrae<cit.> or the IVDs<cit.>. To advance the development of segmentation algorithms, and ultimately automatic image analysis, for lumbar spine MRI, this study has three primary goals: To present a large multi-center lumbar spine MR dataset with reference segmentations of vertebrae, IVDs and spinal canal. * To introduce a continuous lumbar spine MRI segmentation challenge that allows algorithm developers to submit their models for evaluation. * To provide reference performance metrics for two algorithms that segment all three spinal structures automatically: a baseline AI algorithm, which was used in the data collection process, and the nnU-Net, a popular algorithm for 3D segmentation tasks for which training and inference code is publicly available. § MATERIALS AND METHODS §.§ Data Collection In total, 218 lumbar spine MRI studies from patients with a history of LBP were retrospectively collected, with each study consisting of up to three MRI series. The complete dataset comprises 447 series. The study was approved by the institutional review board at Radboud University Medical Center (IRB 2016-2275). Informed consent was exempted, given the retrospective scientific use of deidentified MRI scans and clinical data. Studies were collected from four different hospitals in the Netherlands, including one university medical center, two regional hospitals and one orthopedic hospital (data acquired between January 2019 and March 2022). Lumbar spine imaging at the university medical center includes a T2 SPACE sequence that produces images with almost isotropic spatial resolution. We included a random selection of lumbar spine studies with both a standard sagittal T1 and T2 sequence (voxel size: 3.30 x 0.59 x 0.59 mm) and a sagittal T2 SPACE sequence (voxel size: 0.90 x 0.47 x 0.47 mm). At the other three hospitals, we included random selections of lumbar spine studies with at least a sagittal T1 or a sagittal T2 sequence. The voxel size of these images ranged from 3.15 x 0.24 x 0.24 mm to 9.63 x 1.06 x 1.23 mm. Additional dataset characteristics are given in Table <ref>. In all included MRI series, all visible vertebrae (excluding the sacrum), intervertebral discs, and the spinal canal were manually segmented. The segmentation was performed by a medical trainee who was trained and supervised by both a medical imaging expert and an experienced musculoskeletal radiologist. Three-dimensional MRI annotation is a complex and laborious task, especially for the vertebral arch of the lumbar vertebrae. Therefore, we worked with an iterative data annotation approach in which our automatic baseline segmentation method (baseline 1: iterative instance segmentation) was trained with a small part of the dataset, enabling semi-automatic segmentation of the remaining images. During semi-automatic segmentation, the automatic method was used to obtain an initial segmentation, which was subsequently reviewed and manually corrected. This process was repeated several times by retraining the automatic segmentation model until the entire dataset was annotated. Initially, twenty randomly selected high resolution T2 (SPACE) series of the university medical center data were manually annotated using 3D Slicer version 5.0.3<cit.>. All structures were segmented in their entirety, which for the vertebrae also includes the vertebral arch. This was done since the vertebral arch is essential in the diagnosis of disorders such as foraminal stenosis, facet joint arthrosis, and spondylolysis. The initial manual annotations were performed only on high resolution series because the near-isotropic resolution enables detailed viewing in sagittal, axial and coronal directions. Annotations of the corresponding standard sagittal T1 and T2 images were obtained by resampling the T2 SPACE segmentations to the resolution of the T1 and T2 images. The resampled segmentations were reviewed for misalignment due to patient movement between the acquisitions and corrected if needed. All other segmentations were created by first generating initial segmentations using the automatic segmentation method trained with already annotated data, followed by review and manual correction in 3D Slicer. The vertebrae were not given a correct anatomical label, since accurately determining the anatomical type of vertebra requires information from multiple planes of MRI images, including axial and coronal views, in addition to sagittal views. These additional views are essential to ensure accurate identification of the ribs which is needed to determine the lowest thoracic vertebra and correctly label the lumbar levels. As only sagittal views were available for the majority of studies in this dataset, accurate anatomical labeling of vertebrae was considered infeasible. Therefore, the reference segmentations provided in this dataset are labeled from the bottom up with the most caudal vertebra (usually L5) labeled as 1. The dataset was divided into a training set (179 out of 218 studies, 82%) and a validation set (39 out of 218 studies, 18%). This data-split was used during training of the iterative instance segmentation algorithm, however it is not mandatory to maintain the same training and validation split when using this dataset. Series belonging to the same patient were always placed in the same set. §.§ Baseline 1: Iterative instance segmentation By presenting this baseline algorithm, we establish a reference point for evaluating performance and provide users with an understanding of the algorithm employed in generating the dataset. This section summarizes the iterative instance segmentation (IIS) method. An automatic AI-based segmentation algorithm for vertebra segmentation<cit.> was extended to segment also the IVDs and the spinal canal. This algorithm uses a 3D patch-based iterative scheme to segment one pair of vertebra and the corresponding inferior IVD at a time, together with the segment of spinal canal covered by the image patch. A schematic image of the network architecture is shown in Figure <ref>. §.§.§ Instance memory Because the MR volume is segmented by consecutively analyzing 3D patches, one vertebral level at a time, a method is needed to keep track of its progress. An instance memory volume is used to save the structures that have been segmented, and is used as an extra input channel to remind the network of the structures that can be ignored because they are already segmented. In contrast to the original vertebra-focused method, we introduced separate memory state volumes for the vertebrae, IVDs, and the spinal canal. The spinal canal memory state is only used to save the segmentation progress, not as an extra input for the network, as the spinal canal is an elongated structure that cannot be covered by a single patch. Therefore, the network is trained to always segment any visible portion of the spinal canal, which is then stitched together for all patches that are fed through the network. In total, the network has three input channels, two memory states, and the corresponding image patch. §.§.§ Network architecture The segmentation approach is based on a single 3D U-net-like fully-convolutional neural network. Unlike the vertebra segmentation algorithm as described in the original paper<cit.>, a patch size of 64 x 192 x 192 voxels with a resolution of 2 x 0.6 x 0.6 mm was used, as the created dataset contains sagittal MR images exclusively. These generally have a higher slice thickness compared to the data used by Lessmann et al.<cit.> A higher in-plane resolution of the predicted segmentation is achieved while still ensuring the patch is large enough that a vertebra completely fits within one patch. The network has three output channels, one for each anatomical structure. §.§.§ Iterative segmentation approach The patch-based scheme is structured in such a way that only relevant parts of the MR volume are being processed. The patch systematically moves through the image until it finds a fragment of the first vertebra, in this case always the lowest vertebra. Subsequently, the patch moves to the center of mass of that fragment after which a new segmentation is made. This process continues until the vertebra's volume stabilizes, which means that the detected vertebra is completely visible within the patch. Binary masks of that vertebra, its underlying IVD, and the spinal canal are then added to their respective memory states. The same patch is segmented again with the updated memory states as input, which causes a fragment of the next vertebra to be segmented. This iterative process, illustrated in Figure <ref>, continues until no more vertebra fragments are detected or when the top of the MR volume is reached. §.§.§ Completeness and label prediction The most cranial vertebra is often only partially visible within the field of view of the MR image. The segmentation method includes an additional compression path after the compression path of the U-net, which has a single binary value as output, predicting the completeness of a vertebra. The original vertebra segmentation method also contained a similar compression path for predicting the anatomical label. However, this output was not used in our experiments since no accurate anatomical labels regarding lumbosacral transitional vertebrae were present in our dataset. §.§.§ Training of the algorithm Preprocessing of the images consisted of resampling to a standard resolution of 2 x 0.6 x 0.6 mm and orientation in axial slices. Standard data augmentation steps were implemented, such as random elastic deformation, the addition of random Gaussian noise, random Gaussian smoothing, and random cropping along the longitudinal axis. The loss function used during training consisted of three parts: (1) The segmentation error was defined by the weighted sum of false positives and false negatives combined with the binary cross-entropy loss. (2) The labeling error was defined by the absolute difference between the predicted label and the ground truth. (3) The completeness classification error was defined as the binary cross-entropy between the true label and the predicted probability. §.§ Baseline 2: nnU-Net In addition to adapting a segmentation method that was specifically developed for vertebra segmentation, reference results for nnU-Net are provided. nnU-Net is a self-configuring, deep learning-based framework for medical image segmentation.<cit.> It has been widely accepted in the medical image analysis community as a state-of-the-art approach to 3D image segmentation tasks after winning the Medical Segmentation Decathlon<cit.> and performing well in several other segmentation challenges. A 3D full resolution nnU-Net was trained on the training and validation datasets with 5-fold cross validation, which is its recommended training strategy.<cit.> Data pre-processing, network architecture and other training details were automatically determined by the nnU-Net framework. The network was trained on both the T1- and T2-weighted MRI series after which the overall performance was compared to the IIS baseline algorithm. §.§ Evaluation The segmentation performance was evaluated using two metrics: (1) The Dice coefficient to measure the volume overlap, and (2) the average absolute surface distance (ASD) as an indication of the segmentation accuracy along the surface of all structures. Both metrics were calculated separately for all individual structures and were averaged per anatomical structure (vertebrae, IVDs, or spinal canal). Additionally, the average Dice coefficient and average ASD per MRI sequence (T1 vs. T2) were calculated for each anatomical structure. To ensure the Dice score and ASD are not influenced by labeling differences, the individual structures of the reference segmentation are matched to the structured in the predicted segmentation based on the largest found overlap. The completeness classification performance was determined by the percentage of accurate predictions, as well as the average number of false positives and false negatives. Evaluation was performed on a sequestered test set which is a subset of the presented dataset. § DATA RECORDS To generate this dataset, a total of 218 lumbar MRI studies of patients with low back pain were included. Each study consisted of up to three sagittal MRI series which were either T1-weighted or T2-weighted (regular resolution, or high resolution generated using a SPACE sequence) with a total of 447 series. Of all included patients, 63% were female. A total of 3125 vertebrae, 3147 IVDs, and 447 spinal canal segmentations were included over all series combined. An overview of the complete dataset divided by the different hospitals is shown in Table <ref>. An overview of the training and validation sets and all included structures is shown in Table <ref>. All MR images and their corresponding segmentation masks used in this study are stored in MHA format in separate directories. Both files have the same name, which is a combination of the MRI study identifier and the specific sequence type (T1, T2, or T2 SPACE). It is important to note that all MRI series from the same MRI study have the same identifier. § TECHNICAL VALIDATION The performance of the IIS baseline algorithm, which was used to generate initial segmentation masks of unseen images from the dataset, was assessed on a hidden test set. These results are presented to assess the data-annotation strategy, as well as establish a reference performance for users of the dataset. The results for the different structures and the different sequences are shown in Table <ref>. The overall mean (SD) Dice score was 0.93 (± 0.05), 0.85 (± 0.10) and 0.92 (± 0.04) for the vertebrae, IVDs and spinal canal respectively. The overall mean (SD) ASD was 0.49 mm (± 0.95 mm), 0.53 mm (± 0.46 mm) and 0.39 (mm ± 0.45) mm for the vertebrae, IVDs and spinal canal respectively. The spinal canal was identified in all scans. One of the 656 vertebrae and nine (three in T1 images and six in T2 images) of the 688 IVDs were not found. The completeness prediction was correct in 650 of the 656 vertebrae (99.1%). A nnU-Net was trained on the same training data to enable comparison between the IIS baseline algorithm and nnU-Net baseline. The results of both networks is displayed in Table <ref>. Figure <ref> shows a collection of segmentations obtained by both networks. The IIS model demonstrates strong performance on our dataset, which is comparable to other MR segmentation methods in the literature.<cit.> These results are nearly identical to the results of the nnU-Net baseline model, which is considered the gold-standard in medical image segmentation. This indicates that the IIS baseline model is a reasonable benchmark for comparison and was an accurate tool in the iterative data annotation workflow. The used iterative data annotation approach showed to be an effective strategy. One strength of this approach is its ability to improve the quality of the dataset over time by incorporating corrections from segmentation predictions into the training data. This helps to reduce errors and increase accuracy in subsequent iterations. Additionally, this approach was faster and more efficient compared to fully manual annotations. However, there are several limitations that should be addressed. Firstly, the iterative process of training the network on a small dataset, generating segmentation predictions on unseen images, and manually correcting the predictions before adding them to the dataset, can introduce bias in the final dataset. Moreover, the use of only high-resolution T2 series for the initial manual annotation may not be representative of the entire population, as it is limited to patients from one hospital who underwent this specific imaging modality. In the era of machine learning and AI algorithms, lumbar spine segmentation can serve as the basis for automated, accurate lumbar spine MR analysis, assisting clinical radiologists and imaging-minded spinal surgeons in their daily practice. It will be able to generate robust, quantitative MR results that can serve as inputs into larger models of lumbar spine disease in clinical practice and research settings. The availability of public datasets and benchmarks plays a crucial role in advancing the field. While datasets exist for CT vertebra segmentation, such as VerSe which is the largest available vertebra segmentation dataset<cit.>, currently no public datasets for MRI spine segmentation are available. Our dataset is of similar size to VerSe<cit.> and provides full segmentation of all relevant spinal structures on MR images. This allows for wider participation and collaboration in the field of spine segmentation, as it can be used to train and evaluate algorithms, as well as to compare to other datasets. The presented algorithms are the baseline results to which other algorithms can be compared. § USAGE NOTES All training and validation data can be found at <https://doi.org/10.5281/zenodo.8009680> and are available under the CC-BY 4.0 license. In order to allow for a fair comparison between different algorithms, including both baseline algorithms, a public segmentation challenge is hosted on the grand-challenge.org platform. The training and validation sets are made publicly available for everyone to develop and train their AI algorithms on. The test set will remain hidden on the Grand Challenge platform to avoid overfitting on it and enable a fair comparison. The test set consists of 39 lumbar MRI studies of unique patients, which includes 15 out of the 20 fully manually annotated studies. The remaining studies originate from the same four hospitals in a similar distribution as the presented dataset. Participants are invited to submit a trained algorithm to the platform, which automatically executes the algorithm and determines its performance on the hidden test set. The challenge can be accessed on <https://spider.grand-challenge.org/>. § CODE AVAILABILITY The original code of the IIS baseline algorithm is publicly available at: <https://github.com/DIAGNijmegen/SPIDER-Baseline-IIS>. The nnU-Net baseline algorithm from Isensee et al. can be found here: <https://github.com/MIC-DKFZ/nnUNet>. Both trained algorithms can also be used on the grand challenge platform: * <https://grand-challenge.org/algorithms/spider-baseline-iis/> * <https://grand-challenge.org/algorithms/spider-baseline-nnu-net/> § ACKNOWLEDGMENTS This study was funded by Radboud AI for Health (ICAI) § AUTHOR CONTRIBUTIONS Jasper W. van der Graaf created the segmentation dataset, developed and trained the presented segmentation algorithms, and wrote the manuscript. Miranda L. van Hooff, Marinus de Kleuver, and Bram van Ginneken provided oversight for the project and revised the manuscript. Constantinus F. M. Buckens assisted with the MRI segmentation. Matthieu Rutten, Job van Susante, and Robert Jan Kroeze provided MRI data from their respective hospitals and revised the manuscript. Nikolas Lessmann helped with the development and training of the presented segmentation algorithms, provided overall project management, and revised the manuscript. § COMPETING INTERESTS Nikolas Lessmann is an employee at Stryker. Bram van Ginneken is CSO at Thirona. unsrt
http://arxiv.org/abs/2306.09375v1	20230615053725	Symmetry-Informed Geometric Representation for Molecules, Proteins, and Crystalline Materials	[ "Shengchao Liu", "Weitao Du", "Yanjing Li", "Zhuoxinran Li", "Zhiling Zheng", "Chenru Duan", "Zhiming Ma", "Omar Yaghi", "Anima Anandkumar", "Christian Borgs", "Jennifer Chayes", "Hongyu Guo", "Jian Tang" ]	cs.LG	[ "cs.LG", "physics.chem-ph", "q-bio.QM" ]	Med-MMHL: A Multi-Modal Dataset for Detecting Human- and LLM-Generated Misinformation in the Medical Domain Chang-Tien Lu Received: date / Accepted: date =========================================================================================================== Artificial intelligence for scientific discovery has recently generated significant interest within the machine learning and scientific communities, particularly in the domains of chemistry, biology, and material discovery. For these scientific problems, molecules serve as the fundamental building blocks, and machine learning has emerged as a highly effective and powerful tool for modeling their geometric structures. Nevertheless, due to the rapidly evolving process of the field and the knowledge gap between science (, physics, chemistry, & biology) and machine learning communities, a benchmarking study on geometrical representation for such data has not been conducted. To address such an issue, in this paper, we first provide a unified view of the current symmetry-informed geometric methods, classifying them into three main categories: invariance, equivariance with spherical frame basis, and equivariance with vector frame basis. Then we propose a platform, coined Geom3D, which enables benchmarking the effectiveness of geometric strategies. Geom3D contains 16 advanced symmetry-informed geometric representation models and 14 geometric pretraining methods over 46 diverse datasets, including small molecules, proteins, and crystalline materials. We hope that Geom3D can, on the one hand, eliminate barriers for machine learning researchers interested in exploring scientific problems; and, on the other hand, provide valuable guidance for researchers in computational chemistry, structural biology, and materials science, aiding in the informed selection of representation techniques for specific applications. The source code is available on https://github.com/chao1224/Geom3Dthe GitHub repository.=-1 § INTRODUCTION Artificial intelligence (AI) for molecule discovery has recently seen many developments, including small molecular property prediction <cit.>, small molecule design and optimization <cit.>, small molecule reaction and retrosynthesis <cit.>, protein property prediction <cit.>, protein folding and inverse folding <cit.>, protein design <cit.>, and crystalline material design <cit.>. One of the most fundamental building blocks for these tasks is the geometric structure of molecules. Exploring effective methods for robust representation learning to leverage such geometric information fully remains an open challenge that interests both machine learning (ML) and science researchers. To this end, symmetry-informed geometric representation <cit.> has emerged as a promising approach. By leveraging physical principles (, group theory for depicting symmetric particles) into spatial representation, they facilitate a more robust representation of small molecules, proteins, and crystalline materials. Nevertheless, pursuing geometric learning research is still challenging due to its evolving nature and the knowledge gap between science (, physics) and machine learning communities. These factors contribute to a substantial barrier for machine learning researchers to investigate scientific problems and hinder efforts to reproduce results consistently. To overcome this, we introduce , a benchmarking of the geometric representation with four advantages, as follows. [In what follows, we may use “molecule” to refer to “small molecule” for brevity.]=-1 [18]r0.5 < g r a p h i c s > Three categories of geometric modules. (a) Invariant models only consider type-0 features. Equivariant models use either (b) spherical harmonics frames or (c) vector frames by projecting the coordinate vectors. (1) A unified and novel aspect in understanding symmetry-informed geometric models. The molecule geometry needs to satisfy certain physical constraints regarding the 3D Euclidean space. For instance, the molecules' force needs to be equivariant to translation and rotation (see SE(3)-equivariance in <Ref>). In this work, we classify the geometric methods into three categories: invariant model, SE(3)-equivariant model with spherical frame basis and vector frame basis. The invariant models only consider features that are constant w.r.t. the SE(3) group, while the two families of equivariant models can be further unified using the frame basis to capture equivariant symmetry. An illustration of three categories is in <Ref>. Building equivariant models on the frame basis provides a novel and unified view of understanding geometric models and paves the way for intriguing more ML researchers to explore scientific problems. (2) A unified platform for various scientific domains. There exist multiple platforms and tools for molecule discovery, but they are (1) mainly focusing on molecule's 2D graph representation <cit.>; (2) using 3D geometry with customized data structures or APIs <cit.>; or (3) covering only a few geometric models <cit.>. Thus, it is necessary to have a platform benchmarking the geometric models, especially for researchers interested in solving scientific problems. In this work, we propose , a geometric modeling framework based on PyTorch Geometric (PyG) <cit.>, one of the most widely-used platforms for graph representation learning. benchmarks geometric models on solving scientific tasks, and these tasks include the three most fundamental molecule types: small molecules, proteins, and crystalline materials. Each of them requires distinct domain-specific preprocessing steps, , crystalline materials molecules possess periodic structures and thus need a particular periodic data augmentation. By leveraging such a unified framework, serves as a comprehensive benchmarking tool, facilitating effective and consistent analysis components to interpret the existing geometric representation functions in a fair and convenient comparison setting. (3) A framework for a wider range of ML tasks. The geometric models in can serve as a building block for exploring extensive ML tasks, including but not limited to studying the molecule dynamic simulation and scrutinizing the transfer learning effect on molecule geometry. For example, pretraining is an important strategy to quickly transfer knowledge to target tasks, and recent works explore geometric pretraining on 3D conformations (including supervised and self-supervised) <cit.> and multi-modality pretraining on 2D topology and 3D geometry <cit.>. Other transfer learning venues include multi-task learning <cit.> and out-of-distribution or domain adaptation <cit.>, yet no geometry information has been utilized. All of these directions are promising for future exploration, and serves as an auxiliary tool to accomplish them. For example, as will be shown in <Ref>, we leverage to effectively evaluate pretraining methods with benchmarks.=-1 (4) A framework for exploring data preprocessing and optimization tricks. When comparing different symmetry-informed geometric models, we find that in addition to the model architecture, there are two important factors affecting the performance: the data preprocessing (, energy and force rescaling and shift) and optimization methods (, learning rate, learning rate schedule, number of epochs, random seeds). In this work, we explore the effect of four preprocessing tricks and around 2-10 optimization hyperparameters for each model and task. In general, we observe that each model may benefit differently in different tasks regarding the preprocessing and optimization tricks. However, data normalization is found to help improve performance hugely in most cases. We believe that is an effective tool for exploring and understanding various engineering tricks. § DATA STRUCTURES FOR GEOMETRIC DATA Small molecule 3D conformation. Molecules are sets of points in the 3D Euclidean space, and they move in a dynamic motion, as known as the potential energy surface (PES). The region with the lowest energy corresponds to the most stable state for molecules, and molecules at these positions are called conformations, as illustrated in <Ref>. For notation, we mark each 3D molecular graph as = (, ), where and are for the atom types and positions, respectively. Crystalline material with periodic structure. The crystalline materials or extended chemical structures possess a characteristic known as periodicity: their atomic or molecular arrangement repeats in a predictable and consistent pattern across all three spatial dimensions. This is the key aspect that differentiates them from small molecules. In <Ref>, we show an original unit cell (marked in green) that can repeatedly compose the crystal structure along the lattice. To model such a periodic structure, we adopt the data augmentation from CGCNN <cit.>: for each original unit cell, we shift it along the lattice in three dimensions and connect edges within a cutoff value (hyperparameter). For more details on the two augmentation variants, please check <Ref>. Protein with backbone structure. Protein structures can be classified into four primary levels, , the primary structure represents the linear arrangement of amino acids within a polypeptide chain, where each amino acid is a small molecule. The geometric models can be naturally adopted to the higher-order structures, and in , we consider the tertiary structure, which encompasses the complete three-dimensional organization of a single protein. Regarding the data structure, we consider the tertiary structure: each amino acid has an important backbone structure N-C_α-C structure, and the C_α is bonded to the side chain. There are 20 common types of side chains corresponding to 20 amino acids, as illustrated in <Ref>. Considering the long-sequence issue in proteins, existing works <cit.> mainly model the backbone structures for computational efficiency. § SYMMETRY-INFORMED GEOMETRIC REPRESENTATION §.§ Group Symmetry and Equivariance Symmetry means the object remains invariant after certain transformations <cit.>, and it is everywhere on Earth, such as in animals, plants, and molecules. Formally, the set of all symmetric transformations satisfies the axioms of a group. Therefore, the group theory and its representation theory are common tools to depict such physical symmetry. Group is a set G equipped with a group product × satisfying: (1) ∃∈ G, × = ×, ∀∈ G; (2) ×^-1 = ^-1× = ; (3) × (×) = ××. Group representation is a mapping from the group G to the group of linear transformations of a vector space X with dimension d (see <cit.> for more rigorous definition): ρ_X(·) : G →ℝ^d × d s.t. ρ() = 1 ∧ ρ_X() ρ_X() = ρ_X(×), ∀, ∈ G. During modeling, the X space can be the input 3D Euclidean space, the equivariant vector space in the intermediate layers, or the output force space. This enables the definition of equivariance as below.=-1 Equivariance is the property for the geometric modeling function f: X → Y as: f(ρ_X() ) = ρ_Y() f(), ∀∈ G, ∈ X. As displayed in <Ref>, for molecule geometric modeling, the property should be rotation-equivariant and translation-equivariant (, SE(3)-equivariant). More concretely, ρ_X() and ρ_Y() are the SE(3) group representations on the input (, atom coordinates) and output space (, force space), respectively. SE(3)-equivariant modeling in <Ref> is essentially saying that the designed deep learning model f is modeling the whole transformation trajectory on the molecule conformations, and the output is the transformed ŷ accordingly. Further, we want to highlight that, in addition to the network architecture or representation function, the input features can also be represented as an equivariant feature mapping from the 3D mesh to ℝ^d̃ <cit.>, where d̃ depends on input data, , d̃ = 1 (for atom type dimension) + 3 (for atom coordinate dimension) on small molecules. Such features are called steerable features in <cit.> when only considering the subgroup SO(3)-equivariance. Invariance is a special type of equivariance, defined as: f(ρ_X() ) = f(), ∀∈ G, ∈ X, with ρ_Y() as the identity ∀∈ G. The group representation helps define the equivariance condition for f to follow. Then, the question boils down to how to design such an equivariant f. In the following, we will discuss geometric modelings from a novel and unified perspective using the frame.=-1 §.§ Invariant Geometric Representation Learning The simple way of achieving SE(3) group symmetric in molecule geometry is invariant modeling. It means the model considers only the invariant features or type-0 features <cit.> when modeling, and such type-0 features are invariant with respect to rotation and translation. Specifically, several works have been adopting the invariant features for modeling, including but not limited to pairwise distance (SchNet <cit.>), bond angles (DimeNet <cit.>), and torsion angles (SphereNet <cit.> and GemNet <cit.>). Note that the torsion angles are angles between two planes defined by pairwise bonds. We also want to highlight that, from a mathematical perspective, equivariance and invariance can be transformed to each other by the scalarization technique. Please check <cit.> for details. §.§ Equivariant Geometric Representation Learning Invariant modeling only captures the type-0 features. However, equivariant modeling of higher-order particles may bring in extra expressiveness. For example, the elementary particles in high energy physics <cit.> inherit higher order symmetries in the sense of SO(3) representation theory, which makes the equivariant modeling necessary. Such higher-order particles include type-1 features like coordinates and forces in molecular conformation. There are many approaches to design such SE(3)-equivariant model satisfying <Ref>. There are two main venues, as will be discussed below. Spherical Frame Basis. This research line utilizes the irreducible representations <cit.> for building SO(3)-equivariant representations, and the first work is TFN <cit.>. Its main idea is to project the 3D Euclidean coordinates into the spherical harmonics space, which transforms equivariantly according to the irreducible representations of SO(3), and the translation-equivariant can be trivially guaranteed using the relative coordinates. Following this, there have been variants combining it with the attention module (Equiformer <cit.>) or with more expressive network architectures (SEGNN <cit.>, Allegro <cit.>).=-1 Vector Frame Basis. This is an alternative solution by using the vector (in physics) frame basis. It builds the frame in the vector space, and the SO(3)-equivariance can be satisfied with the Gram-Schmidt process. Works along this line for molecule discovery include EGNN <cit.> and PaiNN <cit.> for geometric representation, 3D-EMGP <cit.> and MoleculeSDE <cit.> for geometric pretraining, and ClofNet <cit.> for conformation generation. For macromolecules like protein, the equivariant vector frame has been used for protein design (StructTrans <cit.>) and protein folding (AlphaFold2 <cit.>). The spherical frame basis can be easily extended to higher-order particles, yet it may suffer from the high computational cost. On the other hand, the vector frame basis is specifically designed for the 3D point clouds; thus, it is more efficient but cannot generalize to higher-order particles. Meanwhile, we would like to acknowledge other equivariant modeling paradigms, including using orbital features <cit.> and elevating 3D Euclidean space to SE(3) group <cit.>. Please check <Ref> for details.=-1 §.§ Geometric Pretraining Recent studies have started to explore single-modal geometric pretraining on molecules. The GeoSSL paper <cit.> covers a wide range of geometric pretraining algorithms. The type prediction, distance prediction, and angle prediction predict the masked atom type, pairwise distance, and bond angle, respectively. The 3D InfoGraph predicts whether the node- and graph-level 3D representation are for the same molecule. GeoSSL is a novel geometric pretraining paradigm that maximizes the mutual information (MI) between the original conformation _1 and augmented conformation _2, where _2 is obtained by adding small perturbations to _1. RR, InfoNCE, and EBM-NCE optimize the objective in the latent representation space, either generative or contrastive. GeoSSL-DDM <cit.> optimizes the same objective function using denoising score matching. 3D-EMGP <cit.> has the same strategy and utilizes an equivariant module to denoise the 3D noise directly. We illustrate these algorithms in <Ref>. Another research line is the multi-modal pretraining on topology and geometry. GraphMVP <cit.> first proposes one contrastive objective (EBM-NCE) and one generative objective (VRR) to optimize the MI between the 2D topologies and 3D geometries in the representation space. 3D InfoMax <cit.> is a special case of GraphMVP, with the contrastive part only. MoleculeSDE <cit.> extends GraphMVP by introducing two SDE models for solving the 2D and 3D reconstruction.=-1 §.§ Discussion: Reflection-antisymmetric in Geometric Learning Till now, we have discussed the SE(3)-equivariance, , the translation and rotation equivariance. As highlighted in the recent work <cit.>, the molecules needlessly satisfy the reflection-equivariant, but instead, they should be reflection-antisymmetric <cit.>. One standard example is that the energy of small molecules is reflection-antisymmetric in a binding system. Each of the two equivariant categories discussed in <Ref> can solve this problem easily. The spherical frame basis can achieve this by adding the reflection into the Wigner-D matrix <cit.>. The vector frame basis can accomplish this using the cross-product during frame construction <cit.>. § GEOMETRIC DATASETS AND BENCHMARKS In <Ref>, we introduce a novel aspect for understanding symmetry-informed geometric models. In this section, we discuss utilizing framework for benchmarking geometric models over tasks. For the detailed dataset acquisitions and task specifications (, dataset size, splitting, and task unit), please check <Ref>. also covers 7 1D models and 10 2D graph neural networks (GNNs) and benchmarks the pretraining algorithms to learn a robust geometric representation. Additionally, we want to highlight enables exploration of important data preprocessing and optimization tricks for performance improvement, as will be introduced next. §.§ Small Molecules: QM9 QM9 <cit.> is a dataset consisting of 134K molecules, each with up to 9 heavy atoms. It includes 12 tasks that are related to the quantum properties. For example, U0 and U298 are the internal energies at 0K and 298.15K, respectively, and U298 and G298 are the other two energies that can be calculated from H298. The other 8 tasks are quantum mechanics related to the density functional theory (DFT) process. On the QM9 dataset, we can easily get the 1D descriptors (Fingerprints/FPs <cit.>, SMILES <cit.>, SELFIES <cit.>), 2D topology, and 3D conformation. This enables us to build models on each of them respectively: (1) We benchmark 7 models on 1D descriptors, including multi-layer perception (MLP), random forest (RF), XGBoost (SGB), convolution neural networks (CNN), and BERT <cit.>. (2) We benchmark 10 2D GNN models on the molecular topology, including GCN <cit.>, ENN-S2S <cit.>, GraphSAGE <cit.>, GAT <cit.>, GIN <cit.>, D-MPNN <cit.>, PNA <cit.>, Graphormer <cit.>, AWARE <cit.>, GraphGPS <cit.>. (3) We benchmark 9 3D geometric models on the molecular conformation, including SchNet <cit.>, DimeNet++ <cit.>, SE(3)-Trans <cit.>, EGNN <cit.>, PaiNN <cit.>, GemNet-T <cit.>, SphereNet <cit.>, SEGNN <cit.>, Equiformer <cit.>. The evaluation metric is the mean absolute error (MAE). The detailed training tricks are in <Ref>. The results of these 26 models are in <Ref>, and two important insights are below: (1) There is no one universally best geometric model, yet PaiNN, GemNet, and SphereNet perform well in most tasks. However, GemNet-T and SphereNet take up to 5 GPU days per task, and PaiNN takes less than 20 GPU hours. (2) The geometric conformation is important for quantum property prediction. The performance of using 3D conformation is better than all the 1D and 2D models by orders of magnitudes.=-1 §.§ Small Molecules: MD17 and rMD17 MD17 <cit.> is a dataset of molecular dynamics simulation. It has 8 tasks corresponding to eight organic molecules, and each task includes the molecule positions along the PES (see <Ref>). The goal is to predict each atom's energy and interatomic forces for each molecule's position. We follow the literature <cit.> of using 8 subtasks, 1K for training and 1K for validation, while the test set (from 48K to 991K) is much larger. However, the MD17 dataset contains non-negligible numerical noises <cit.>, and it is corrected by the revised MD17 (rMD17) dataset <cit.>. 100K structures were randomly chosen for each task/molecule in MD17, and the single-point force and energy calculations were performed for each structure using the PBE/def2-SVP level of theory. The calculations were conducted with tight SCF convergence and a dense DFT integration grid, significantly minimizing the computational noises. The results on MD17 and rMD17 are in <Ref>. We select 12 subtasks for illustration, and more comprehensive results can be found in <Ref>. We can observe that, in general, PaiNN and Equiformer perform well on MD17 and rMD17 tasks. We also report ablation study on data normalization. NequIP <cit.> and Allegro <cit.> introduce a normalization trick: multiplying the predicted energy with the mean of ground-truth force (reproduced results in <Ref>). We plot the performance gap, MAE(w/o normalization) - MAE(w/ normalization), in <Ref>, and observe most of the gaps are positive, meaning that adding data normalization can lead to generally better performance.=-1 §.§ Small Molecules: COLL [9]r0.45 89 Results on energy and force prediction in COLL. 120k for training, 10k for val, 9.48k for test. The metric is the mean absolute error (MAE). max width= Model Energy (eV) ↓ Force (eV/Å) ↓ SchNet 0.178 0.130 DimeNet++ 0.036 0.049 EGNN 1.808 0.234 PaiNN 0.030 0.052 GemNet-T 0.017 0.028 SphereNet 0.032 0.047 SEGNN 7.085 0.642 Equiformer 0.036 0.030 The COLL dataset <cit.> comprises energy and force data for 140K random snapshots obtained from molecular dynamics simulations of molecular collisions. These simulations were conducted using the semiempirical GFN2-xTB method. To obtain the data, DFT calculations were performed utilizing the revPBE functional and def2-TZVP basis set, which also incorporated D3 dispersion corrections. The task is to predict the energy and force for each atom in each molecule, and we consider 8 most advanced geometric models for benchmarking. The results are in <Ref>, and two invariant models (GemNet and SphereNet) reach more optimal performance. §.§ Small Molecules & Proteins: LBA & LEP The binding affinity measures the strength of the binding interaction between a small molecule (ligand) to the target protein. In , we consider modeling both the ligands and proteins with their 3D structures. During binding, a cavity in a protein can potentially possess suitable properties for binding a small molecule, and it is called a pocket <cit.>. Due to the large volume of protein, follows existing works <cit.> by only taking the binding pocket instead of the whole protein structure. Specifically, models up to 600 atoms for each ligand and protein pair. For the benchmarking, we consider two binding affinity tasks. (1) The first task is ligand binding affinity (LBA) <cit.>. It is gathered from <cit.>, and the task is to predict the binding affinity strength between a ligand and a protein pocket. (2) The second task is ligand efficacy prediction (LEP) <cit.>. The input is a ligand and both the active and inactive conformers of a protein, and the goal is to classify whether or not the ligand can activate the protein's function. The results on two binding tasks are in <Ref>, and we can observe that PaiNN, GemNet, and SEGNN are generally outstanding on the two tasks. §.§ Proteins: EC and Fold [7]r0.5 Results on EC and Fold classification, and metric is the accuracy. The data splits are in <Ref>. max width=0.5 2Model 2EC (%) 4cFold (lr)3-6 Fold (%) Sup (%) Fam (%) Avg (%) GVP-GNN <cit.> 63.936 34.819 52.711 95.047 60.859 GearNet-IEConv <cit.> – 39.694 59.330 98.506 65.843 GearNet <cit.> 78.836 29.109 43.062 95.991 56.054 ProNet <cit.> 84.251 52.089 69.378 98.270 73.246 CDConv <cit.> 86.887 60.028 79.904 99.528 79.820 An essential aspect of proteins is their ability to serve as bio-catalysts, known as enzymes. Enzyme Commission (EC) number <cit.> is a numerical classification scheme that describes the enzyme functionalities. Here we follow a recent work <cit.> in predicting 37K proteins with 384 EC types. Another protein geometric task we consider is protein folding. It is an important biological task in predicting the 3D structures from 1D amino acid sequences. Here we apply the folding pattern classification task <cit.>, comprising 16K proteins and 1,195 fold patterns. We further consider three testsets (Fold, Superfamily, and Family) based on the sequence and structure similarity <cit.>. The detailed specifications are in <Ref>. The results of 5 models are in <Ref>, and CDConv <cit.> outperforms other methods by a large margin.=-1 §.§ Crystalline Materials: MatBench and QMOF MatBench <cit.> is created specifically to evaluate the performance of machine learning models in predicting properties of inorganic bulk materials covering mechanical, electronic, and thermodynamic material properties <cit.>. Here we consider 8 regression tasks with crystal structures, including predicting the formation energy (Perovskites, E_form), exfoliation energies (E_exfo), band gap, shear and bulk modulus (log_10 G and log_10 K), etc. Please check <Ref> for more details. Quantum MOF (QMOF) <cit.> is a dataset of over 20K metal-organic frameworks (MOFs) and coordination polymers derived from DFT. The task is to predict the band gap, the energy gap between the valence band and the conduction band. The results of 8 geometric models on 8 MatBench tasks and 1 QMOF task are in <Ref>, and we can observe that the performance of all the models is very close; only PaiNN, GemNet, and Equiformer are slightly better. We also conduct ablation study on periodic data augmentation. We note that there are two data augmentation (DA) methods: gathered and expanded. Gathered DA means that we shift the original unit cell along three dimensions, and the translated unit cells will have the same node indices as the original unit cell, , a multi-edge graph. However, expanded DA will assume the translated unit cells have different node indices from the original unit cell. (A visual demonstration is in <Ref>). We conduct an ablation study on the effect of these two DAs, and we plot MAE(expanded DA) - MAE(gathered DA) on six tasks in <Ref>. It reveals that for most of the models (except EGNN), using gathered DA can lead to consistently better performance, and thus it is preferred. For more qualitative analysis, please check <Ref>. §.§ Geometric Pretraining on Small Molecules We run pretraining algorithms, including one supervised pretraining: the pretraining dataset (, PCQM4Mv2 <cit.>) possess the energy or energy gap label for each conformation, which can be naturally adopted for pretraining. The benchmark results of using SchNet as the backbone model pretrained on PCQM4Mv2 and fine-tuning on QM9 tasks are in <Ref>. We observe that MoleculeSDE and GeoSSL-DDM utilizing the geometric denoising diffusion models outperform other pretraining methods in most cases. On the other hand, supervised pretraining (pretrained on energy gap ∇ℰ) reaches outstanding performance on ∇ℰ downstream task, yet the generalization to other tasks is modest. Please check <Ref> for more pretraining results with different backbone models.=-1 § CONCLUSION AND FUTURE DIRECTIONS provides a unified view on the SE(3)-equivariant models, together with the implementations. Indeed these can serve as the building blocks to various tasks, such as geometric pretraining (as displayed in <Ref>) and the conformation generation (ClofNet <cit.>, MoleculeSDE <cit.>), paving the way for building more foundational models and solving more challenging tasks. Limitations on models and tasks. includes 10 2D graph models, geometric models, pretraining methods, and diverse tasks. We would also like to acknowledge there exist many more tasks (, Atom3D <cit.>, Molecule3D <cit.>, OC20 <cit.>) and more geometric models (, OrbNet <cit.>, MACE <cit.> and LieTransformer <cit.>). We will continue adding them in the future. Multi-modality as future exploration. Recently, there have been quite some explorations on building multi-modal applications on molecules, especially by incorporating textual data <cit.>. However, these works mainly focus on the 1D sequence or 2D topology, and 3D geometry is rarely considered. We believe that can support this for future exploration. § ACKNOWLEDGEMENT The authors would like to thank Zichao Rong, Chengpeng Wang, Jiarui Lu, Farzaneh Heidari, Zuobai Zhang, Limei Wang, and Hanchen Wang for their helpful discussions. This project is supported by the Natural Sciences and Engineering Research Council (NSERC) Discovery Grant, the Canada CIFAR AI Chair Program, collaboration grants between Microsoft Research and Mila, Samsung Electronics Co., Ltd., Amazon Faculty Research Award, Tencent AI Lab Rhino-Bird Gift Fund, and a National Research Council of Canada (NRC) Collaborative R&D Project. This project was also partially funded by IVADO Fundamental Research Project grant PRF-2019-3583139727. plain tocsectionAppendix PART: Appendix § DATA STRUCTURE AND DATA PREPROCESSING §.§ Small Molecules In the machine learning and computational chemistry domain, existing works are mainly focusing on the molecule 1D description <cit.> and 2D topology graph <cit.>. Especially as the 2D graph, where the atoms and bonds are treated as nodes and edges, respectively. To model this graph structure, a message-passing graph neural network model family has been proposed. In <Ref>, we provide a comparison of models on 1D descriptions, 2D topological graphs, and 3D geometric conformations. The observation verifies the necessity of using conformation for quantum property prediction tasks. §.§ Proteins Protein structures can be classified into four primary levels. The primary structure represents the linear arrangement of amino acids within a polypeptide chain. Secondary structure arises from local interactions between adjacent amino acids, resulting in the formation of recognizable patterns like alpha helices and beta sheets. The tertiary structure encompasses the complete three-dimensional organization of a single protein, involving additional folding and structural modifications beyond the secondary structure. Quaternary structure emerges when multiple polypeptide chains or subunits interact to form a protein complex. Specifically for geometric modeling, we are now focusing on the protein tertiary structure, which can be constructed based on different structural levels, namely the all-atom level, backbone level, and residue level. We explain the details below, and you can find an illustration in <Ref>. * At the all-atom level, the graph nodes represent individual atoms, capturing the fine-grained details of the protein structure. * At the backbone level, the graph nodes correspond to the backbone atoms (N-C_α-C), omitting the side chain information. This level of abstraction focuses on the essential backbone structure of the protein. * At the residue level, the graph nodes represent amino acid residues. The position of each residue can be represented by the position of its C_α atom or calculated as the average position of the backbone atoms within the residue. This level provides a higher-level representation of the protein structure, grouping atoms into residue units. §.§ Crystalline Materials Periodic structure. The crystalline materials or extended chemical structures possess a characteristic known as periodicity: their atomic or molecular arrangement repeats in a predictable and consistent pattern across all three spatial dimensions. This is the key aspect that differentiates them from small molecules. In <Ref>, we show an original unit cell (marked in green) that can repeatedly compose the crystal structure along the lattice. To model such a periodic structure, we adopt the data augmentation (DA) from CGCNN <cit.>, yet with two variants as explained below. Data augmentation 1: Gathered. Gathered DA means that we will shift the original unit cell along three dimensions, and the translated unit cells will have the same node indices as the original unit cell. An example is in <Ref>. Data augmentation 2: Expanded. Expanded DA refers that we shift the original unit cell in the same way as Gathered, but the translated unit cells have different node indices from the original unit cell. An example is in <Ref>. Once we have these two augmentations, we have the augmented nodes and corresponding periodic coordinates. The edge connection needs to satisfy three conditions simultaneously: * The pairwise distance should be larger than 0 and no larger than the threshold τ, , the distance is within (0, τ). * At least one of the linked nodes (bonded atoms) belongs to the anchor unit cell. * No self-loop. In specific, we give an example of the two DAs below. We take the same simple cubic crystal in <Ref> for illustration, and we assume that the edge length in the unit cell is l. The threshold for building the edge is τ = l. * Gathered DA. (0, 1) satisfies the conditions; (0, 3') violets the condition; (0, 4') violets the conditions; (0', 1') violets the conditions. * Expanded DA. (0, 1) satisfies the conditions; (0, 11) violets the conditions; (0, 12) violets the condition; (8, 9) violets the conditions. In terms of implementation, this can be easily achieved by calling the pymatgen <cit.> package. Such data augmentation is merely one way of handling the periodic data structure in crystalline materials. There could be more potential ways, and we would like to leave them for future exploration. § DATASET ACQUISITION AND PREPARATION & BENCHMARK HYPERPARAMETERS For the dataset download, please check https://github.com/chao1224/Geom3Dthis GitHub repository for detailed instructions. §.§ Small Molecules: QM9 Task specification. QM9 <cit.> is a dataset of 134K molecules, consisting of 9 heavy atoms. It includes 12 tasks that are related to the quantum properties. For example, U0 and U298 are the internal energies at 0K and 298.15K, respectively, and H298 and G298 are the other two energies that can be transferred from U298, respectively. The other 8 tasks are quantum mechanics related to the DFT process. Task unit. We list the units for 12 QM9 tasks below. Dataset size and split. There are 133,885 molecules in QM9, where 3,054 are filtered out, leading to 130,831 molecules. For data splitting, we use 110K for training, 10K for validation, and 11K for testing. Others. Current work is using different optimization strategies and different data splits (in terms of the splitting size). During the benchmark, we find that: (1) The performance on QM9 is very robust to either using (i) 110K for training, 10K for validation, 10,831 for test or using (ii) 100K for training, 13,083 for validation and 17,748 for test. (2) The optimization, especially the learning rate scheduler, is very critical. During the benchmarking, we find that using cosine annealing learning rate schedule <cit.> is generally the most robust. §.§ Small Molecules: MD17 Task specification. MD17 <cit.> is a dataset on molecular dynamics simulation. It includes eight tasks, corresponding to eight organic molecules, and each task includes the molecule positions along the potential energy surface (PES), as shown in <Ref>. The goal is to predict the energy-conserving interatomic forces for each atom in each molecule position. Task unit. The MD17 aims for energy and force prediction. The unit is kcal/mol for energy and kcal/mol·Å for force. Dataset size and split. We follow the literature <cit.> of using 1K for training and 1K for validation, while the test set (from 48K to 991K) is much larger, and we list them below. Others. There are multiple ways to predict the energy, , using the SE(3)-equivariant to predict the forces directly. In , we first predict the energy for each position; then, we take the gradient w.r.t. the input position. The Python codes are attached below: [language=Python] from torch.autograd import grad positions = batch.positions # input positions energy = model_3D(batch) # energy prediction force = -grad(outputs=energy, inputs=positions) # force prediction Notice that this holds for all the force prediction tasks, like rMD17 and COLL, which will be introduced below. Additionally, in <Ref>, we will discuss the data normalization for MD prediction. §.§ Small Molecules: rMD17 Task specification. The revised MD17 (rMD17) dataset <cit.> is constructed based on the original MD17 dataset. 100K structures were randomly chosen for each type of molecule present in the MD17 dataset. Subsequently, the single-point force and energy calculations were performed for each of these structures using the PBE/def2-SVP level of theory. The calculations were conducted with tight SCF convergence and a dense DFT integration grid, significantly minimizing noise. Task unit. The rMD17 aims for energy and force prediction. The unit is kcal/mol for energy and kcal/mol·Å for force. Dataset size and split. We use 950 for training, 50 for validation, and 1000 for test. §.§ Small Molecules: COLL Task specification. COLL dataset <cit.> is a collection of configurations obtained from molecular dynamics simulations on molecular collisions. Around 140,000 snapshots were randomly taken from the trajectories of the collision, for each of which the energy and force were calculated using density functional theory (DFT). Task unit. The rMD17 aims for energy and force prediction. The unit is eV for energy and eV/Å for force. Dataset size and split. The published COLL dataset has split the whole data into 120,000 training samples, 10,000 validation samples, and 9,480 testing samples. §.§ Small Molecules & Proteins: LBA & LEP Task specification. Ligand-protein binding is formed between a small molecule (ligand) and a target protein. During the binding process, there is a cavity in a protein that can potentially possess suitable properties for binding a small molecule, called pocket <cit.>. Due to the large volume of protein, follows existing works <cit.> by only taking the binding pocket, where there are no more than 600 atoms for each molecule and protein pair. For the benchmarking, we consider two binding affinity tasks. (1) The first task is ligand binding affinity (LBA) <cit.>. It is gathered from <cit.>, and the task is to predict the binding affinity strength between a small molecule and a protein pocket. (2) The second task is ligand efficacy prediction (LEP) <cit.>. We have a molecule bounded to pockets, and the goal is to detect if the same molecule has a higher binding affinity with one pocket compared to the other one. Task unit. LBA is to predict pK = -log(K), where K is the binding affinity in Molar units. LEP has no unit since it is a classification task. Dataset size and split. The dataset size and splitting are listed below. §.§ Proteins: EC Task Specification EC The Enzyme Commission(EC) Number is a numerical classification of enzymes according to the catalyzed chemical reactions <cit.>. Therefore, the functions of enzymes and the chemical reaction type they catalyze can be represented by different EC numbers. An example of EC number is EC 3.1.1.4: 3 represents Hydrolases (the first number represents enzyme class); 3.1 represents Ester Hydrolases (the second number represents enzyme subclass); 3.1.1 represents Carboxylic-ester Hydrolases (the third number represents enzyme sub-subclass); 3.1.1.4 represents Phospholipases (the fourth number represents the specific enzyme). The EC dataset was constructed by Hermosilla et al. <cit.> for the protein function prediction task. The enzyme reaction data with Enzyme Committee annotations were originally collected from the SIFTS database <cit.>. Then, all the protein chains were clustered using a 50% similarity threshold. EC numbers that were annotated for at least five clusters were selected and five proteins with less than 100% similarities were selected from each cluster, annotated by the EC number. Task unit. No unit is available since it is a classification task. Dataset size and split. EC contains 37,428 protein chains, which were split into 29,215 for training, 2,562 for validation, and 5,651 for testing. §.§ Proteins: FOLD Task specification. Proteins can be hierarchically divided into different levels: Family, Superfamily, and Fold based on their sequence similarity, structure similarity, and evolutionary relations <cit.>. Proteins with (1) ≥30% residue identities or (2) lower residue identities but have similar functions are grouped into the same Family. A Superfamily is for families whose proteins have low residue identities but their structural and functional features suggest a possible same evolutionary origin. A Fold is for proteins sharing the same major secondary structures with the same arrangement and topological connections. Based on the SCOP 1.75 database, all the fold categories can be grouped into seven structural classes with in total of 1195 fold types <cit.>: (a) all α proteins (primarily formed by α-helices, 284 folds), (b) all β proteins (primarily formed by β-sheets, 174 folds), (c) α/β proteins (α-helices and β-strands interspersed, 147 folds), (d) α+β proteins (α-helices and β-strands segregated, 376 folds), (e) multi-domain proteins (66 folds), (f) membrane and cell surface proteins and peptides (58 folds), and (g) small proteins (90 folds). DeepSF <cit.> proposed a three-level redundancy removal at fold/superfamily/family levels, resulting in three subsets for testing. * Fold testing set Firstly, the proteins are split into Fold-level training set and testing set, where the training set and testing set don’t share the same superfamily. * Superfamily testing set Then, the Fold-level training set is split into Superfamily-level training set and testing set, where they don’t share the same family. * Family testing set Finally, the Superfamily-level training set is split into Family-level training set and testing set, where for proteins in the same family, 80% of them are used for training and 20% of them are used for testing. Task unit. No unit is available since they are classification tasks. Dataset size and split. FOLD contains 16,292 proteins, and we follow <cit.>: 12,312 training samples, 736 validation samples, 3,244 testing samples. The testing samples contain 3 sub testsets: 718 for folding testset, 1,254 for superfamily testset, and 1,272 for family testset. §.§ Crystalline Materials: MatBench Task specification. MatBench <cit.> is a test suite for benchmarking 13 machine learning model performances for predicting different material properties. The dataset size for these tasks varies from 312 to 132k. The MatBench dataset has been pre-processed to clean up the task-irrelevant and unphysical-computed data. For benchmarking, we take 8 regression tasks with crystal structure data. These tasks are <cit.> Formation energy per Perovskite cell (Per. E_form), Refractive index (Dielectric), Shear modulus (log_10 G), Bulk modulus(log_10 K), exfoliation energy (E_exfo), frequency at last phonon PhDOS peak (Phonons), formation energy (E_form), and band gap (Band Gap). Detailed explanations are as below: * Perovskites: predicting formation energy from the crystal structure. * Dielectric: predicting refractive index from the crystal structure. * log_10 G: predicting DFT log10 VRH-average shear modulus from crystal structure. * log_10 K: predicting DFT log10 VRH-average bulk modulus from crystal structure. * E_exfo: predicting exfoliation energies from the crystal structure. * Phonons: predicting vibration properties from the crystal structure. * E_form: predicting DFT formation energy from the crystal structure. * Band Gap: predicting DFT PBE band gap from the crystal structure. Task unit. The unit for each task is listed below. Dataset size and split. The dataset size for each task is listed above. For benchmarking, we take 60%-20%-20% as training-validation-testing for all 8 tasks. §.§ Crystalline Materials: QMOF Task specification. QMOF <cit.> is a database containing 20,425 metal–organic frameworks (MOFs) with quantum-chemical properties generated using density functional theory (DFT) calculations. The task is to predict the band gap, the energy gap between the valence band and the conduction band. Task unit. The unit for the band gap task is eV. Dataset size and split. As mentioned above, there are 20,425 MOFs, and we take 80%-10%-10% for training-validation-testing. § GROUP REPRESENTATION AND EQUIVARIANCE Symmetry is everywhere on Earth, such as in animals, plants, and molecules. The group theory is the most expressive tool to depict such physical symmetry. In this section, we would like to go through certain key concepts in group theory. Symmetry is the collection of all transformations under which an object is invariant. The readers can easily check that these transformations are automatically invertible and form a group, where the group multiplication is identified with the composition operation of two transformations. From a dynamical system point of view, symmetries are essential for reducing the degree of freedom of a system. For example, Noether's first theorem states that every differentiable symmetry of a physical system with conservative forces has a corresponding conservation law <cit.>. Therefore, symmetries form an important source of inductive bias that can shed light on the design of neural networks for modeling physical systems. §.§ Group A group is a set G equipped with an operator (group product) ×, and they need to follow three rules: * It contains an identity element ∈ G, s.t. = = , ∀∈ G. * Associativity rule () = (). * Each element has an inverse ^-1 = ^-1 =. Below we list several well-known groups: * O(n) is an n-dimensional orthogonal group that consists of rotation and reflections. * SO(n) is a special orthogonal group that only consists of rotations. * E(n) is an n-dimensional Euclidean group that consists of rotations, translations, and reflections. * SE(n) is an n-dimensional special Euclidean group, which comprises arbitrary combinations of rotations and translations (no reflections). * Lie Group is a group whose elements form a differentiable manifold. All the groups above are specific examples of the Lie Group. §.§ Group Representation and Irreducible Group Representation Group representation is a mapping from the group G to the group of linear transformations of a vector space X with dimension d (see <cit.> for more rigorous definition): ρ_X(·) : G →ℝ^d × d s.t. ρ() = 1 ∧ ρ_X() ρ_X() = ρ_X(×), ∀, ∈ G. During modeling, the X space can be the input 3D Euclidean space, the equivariant vector space in the intermediate layers, or the output force space. This enables the definition of equivariance as in <Ref>. Group representation of SO(3) can be applied to any n-dimensional vector space. If we map SO(3) to the 3D Euclidean space (, n=3), the group representation has the same formula as the rotation matrix. Irreducible representations of rotations The irreducible representations (irreps) of SO(3) are indexed by the integers 0, 1, 2, ..., and we call this index l. The l-irrep is of dimension 2l+1. l=0 (dimension 1) corresponds to scalars and l=1 (dimension 3) corresponds to vectors. §.§ Equivariance and Invariance Equivariance is the property for the geometric modeling function f: X → Y, and we want to design a function f that is equivariant as: f(ρ_X() ) = ρ_Y() f(), ∀∈ G, ∈ X. How to understand this in the molecule discovery scenarios? ρ_X(g) is the group representation on the input space, like atom coordinates; and ρ_Y(g) is the group representation on the output space Y=f(X), , the force field space. Equivariance modeling in <Ref> is essentially saying that the designed deep learning model f is modeling the whole transformation trajectory (, rotation for SO(3)-group) on the molecule conformations, and the output is the transformed ŷ accordingly. Note that in deep learning, a function with learned parameters can be abstracted as f: W × X → Y, where w ∈ W is a choice of learned parameters (or weights). The parameters are scalars, , they don't transform under a transformation of E(3)/SE(3). This implies that weights are scalars and are invariant under any choice of coordinate system. Invariance is a special type of equivariance where f(ρ_X() ) = f(), ∀∈ G, ∈ X, with ρ_Y(g) as the identity ∀ g ∈ G. Thus, group and group representation help define the equivariance condition for f to follow. Then, the question turns to how to design such invariant or equivariant f. * In <Ref>, we introduced the invariant geometric models. * In <Ref>, we briefly discussed two main categories of equivariant geometric models: the spherical frame basis model and the vector frame basis model. In the following, we will introduce both in more detail in <Ref>, respectively. Through lifting from the original geometric space to its frame bundle (see <cit.> for the precise definition), equivariant operations like covariant derivatives are realized in an invariant way. From a practical perspective, the lifting operation can be alternatively replaced by scalarization by equivariant frames. See <cit.> for an illustration. Therefore, invariance and equivariance are just two equivariant descriptions of characterizing symmetry that can be transformed into each other through frames. One thing we want to highlight is that convolutional neural networks (CNNs) on images are translation-equivariant on ℝ^2, which demonstrates the power of encoding symmetry into the deep neural network architectures.=-1 § EQUIVARIANCE WITH SPHERICAL FRAME BASIS First, we would like to give a high-level idea of this basis: * It introduces the spherical harmonics as the basis and maps all the points into such a space. * The mapping from 3D Euclidean space to the spherical harmonics space satisfies the E(3)/SE(3)-equivariance property as defined <Ref>. * Based on such basis, we can design a message-passing framework to learn the desired properties. Then, we would like to refer to Figure 2 in SEGNN https://arxiv.org/abs/2110.02905ArXiv version v3. It nicely illustrates how the equivariance works in the spherical harmonics space. Spherical Harmonics The spherical harmonics are functions from points on the sphere to vectors, or more rigoriously: The spherical harmonics are a family o functions Y^l from the unit sphere to the irrep D^l. For each l=0,1,2..., the spherical harmonics can be seen as a vector of 2l+1 functions Y^l(x⃗) = ( Y^l_-l(x⃗), Y^l_-l+1(x⃗), ..., Y^l_l(x⃗) ). Each Y^l is equivariant to SO(3) with respect to the irrep of the same order, , Y_m^l(R x⃗) = ∑_n=-1^l D^l(R)_mn Y_n^l(x⃗), where R is any rotation matrix and D^l are the irreducible representation of SO(3). They are normalized Y^l(x⃗) = 1 when evaluated on the sphere x⃗ = 1. According to <Ref>, <Ref> satisfies the equivariance property: the input space X is the 3D Euclidean space, and the output space Y is the Spherical Harmonics space. Some key points we would like to highlight: * Sphere 𝕊^2 is not a group, but it is a homogeneous space of SO(3). * The decomposition into the irreducible group representations makes it steerable. * The parameter l is named the rotation order. Model Design With the spherical basis, we can design our own geometric models. Notice that during the modeling process, all the variables are tensors. For instance, we can take the vector _j-_i as the vector in Y_m^l (_j - _i/_j - _i ). As shown in <Ref>, this is rotation-equivariant. And we can easily see _j-_i is translation-equivariant. This term can be naturally adopted for the edge embedding under the message passing framework <cit.>, and we can parameterize it with a radial term <cit.> as: _i,j = Radial (_j - _i) Y_m^l (_j - _i/_j - _i ), where the radial function is invariant with the pairwise distance as the input. This is for the message function. Then generally, for the update and aggregate function of node-level tensor _i, we have two options: _i = _i + ∑_j ∈𝒩(i)_i,j + _j _i + ∑_j ∈𝒩(i)_i,j⊗_j, where the update can be done either with plus or multiplication. Note that ⊗ is the tensor product, which can be calculated using the Clebsch-Gordan coefficients. Please refer to <cit.> for more details. § EQUIVARIANCE WITH VECTOR FRAME BASIS In physics, the vector frame is equivalent to the coordinate system. For example, we may assign a frame to all observers, although different observers may collect different data under different frames, the underlying physics law should be the same. In other words, denote the physics law by f, then f should be an equivariant function. Since there are three orthogonal directions in 𝐑^3, a vector frame in 𝐑^3 consists of three orthogonal vectors: F = (_1,_2,_3). Once equipped with a vector frame (coordinate system), we can project all geometric quantities to this vector frame. For example, an abstract vector ∈𝐑^3 can be written as = (r_1,r_2,r_3) under vector frame F, if: = r_1 _1 + r_2 _2 + r_3 _3. An equivariant vector frame further requires the three orthonormal vectors in (_1,_2,_3) to be equivariant. Intuitively, an equivariant vector frame will transform according to the global rotation or translation of the whole system. Once equipped with an equivariant vector frame, we can project equivariant vectors into this vector frame: = r_1 _1 + r_2 _2 + r_3 _3. We call the process of →r:= (r_1,r_2,r_3) the projection operation. Since r_i = _i ·_i is expressed as an inner product between equivariant vectors, we know that r consists of scalars. To incorporate equivariant frames with graph message passing, we assign an equivariant vector frame to each node/edge. Therefore, we call them the local frames. For example, consider node i and one of its neighbors j with positions _i and _j, respectively. The orthonormal equivariant frame ℱ_ij := (^ij_1,^ij_2,^ij_3) in Clofnet <cit.> is defined with respect to _i and _j as follows: (_i - _j/_i - _j, _i ×_j/_i ×_j,_i - _j/_i - _j×_i ×_j/_i ×_j). Note that this frame is translation invariant if the system's mass is set to zero during data prepossessing. On the other hand, MoleculeSDE <cit.> implemented the Clofnet's output layers for transforming 2D representation into 3D equivariant output. Finally, it's worth mentioning that global frames can be built by pooling local frames. For example, a graph-level equivariant frame is obtained by aggregating node frames and implementing the Gram-Schmidt orthogonalization. However, the Newton dynamics experiments in <cit.> demonstrated that the global frame's performance is worse than edge local frames. Therefore, although edge-, node-, and global- frames are equal in terms of equivariance, the optimization properties of different equivariant frames depend varies according to different scientific datasets. § OTHER GEOMETRIC MODELING (FEATURIZATION AND LIE GROUP) We also want to acknowledge other equivariant modeling methods. Featurization. OrbNet <cit.> models the atomic orbital, the description of the location and wave-like behavior of electrons in atoms. This possesses a finer-grained featurization level than other methods. Voxel means that we discretize the 3D Euclidean space into bins, and recent work <cit.> empirically shows that this also applies to geometry learning tasks. Equivariance modeling with Lie group. In previous sections, equivariant algorithms are viewed as mappings from a 3D point cloud (which discretizes the 3D Euclidean space) to another 3D point cloud, or as mappings to invariant quantities. From this point of view, the symmetry group E(3)/ SE(3) manifests itself as a group action transforming the Euclidean space. However, it is worth noting that this action is transitive in the sense that any two points in 3D Euclidean space can be transformed from one to the other through a combination of translation and rotation. In mathematical terms, the 3D Euclidean space is a homogeneous space of the group E(3). Exploiting this observation, LieConv <cit.> and LieTransformer <cit.> elevate the 3D point cloud to the E(3) group and perform parameterized group convolution (and attention) operations, ensuring equivariance, to obtain an equivariant embedding on the group E(3). Finally, by projecting the result back to 𝐑^3 (taking the quotient), an equivariant map from 𝐑^3 to the output space is obtained. The main limitation of Lie group modeling lies in the convolution operation, which often involves high-dimensional integration and requires approximation for most groups. For more in-depth insights into the properties of convolution on groups, we refer readers to <cit.>. Another lifting of 𝐑^3 is to lift it to the SO(3) frame bundle, such that the SO(3) group transforms one orthonormal frame to another orthonormal frame transitively. This lifting also inspires the design of <cit.>. § EXPRESSIVE POWER: FROM INVARIANCE TO EQUIVARIANCE Equivariant neural networks are constructed for equivariant tasks. That is, to approximate an equivariant function. Comparing with ordinary neural networks, a natural question arises: Does an equivariant neural network have the universal approximation property whiten the equivariant function class?. By the novel D-spanning concept <cit.>, this question is partially answered. The author further proposed two types of equivariant architectures that can enjoy the D-spanning property: 1. the G-equivariant polynomials enhanced TFN; 2. the minimal universal architecture constructed by tensor products. Therefore, at least in terms of universal approximation, an equivariant neural network doesn't necessarily require irreducible representations and Clebsch-Gordan decomposition. The reader can check <cit.> for how to realize the minimal universal architecture in an invariant way through equivariant frames and tensorized graph neural networks (, <cit.>). Informally, we conclude that an invariant graph neural network equipped with a powerful message-passing mechanism can achieve the universal approximation property. Another proof strategy of the universality of invariant scalars that doesn't rely on theories of tensorized graph neural networks can be found in <cit.>. However, the mainstream GNN is usually based on a 1-hop message passing mechanism (although tensorized graph neural networks have empirically shown competitive performances in molecular tasks) for computational efficiency. For 1-hop message passing mechanisms (including node-based transformers), our previous conclusion no longer holds, and vector (or higher order tensors) updates are necessary for enhancing the expressiveness power. The reader can consult the concrete example from PaiNN <cit.> to illustrate this point. More precisely, We denote the nodes in Figure 1 of <cit.> as {a: white, b: blue, c: red, d: white}, and we consider whether the message of b and c received from their 1-hop neighbors can discriminate the two different geometric structures. For node b, the invariant geometric information we can get from 1-hop neighbors are the relative distance d_ab and d_bc and their intersection angle α_1. Since the relative distances of the two structures remain equal, only the angle information is useful. Similarly, for node c, we have the intersection angle α_2. Unfortunately, the intersection angles α_1 and α_2 of the two structures are still the same, and we conclude that invariant features are insufficient for discriminating the two different structures. On the other hand, <cit.> showed that by introducing directional vector features (type-1 equivariant steerable features), we are able to solve the problem in this special case, which proves the superiority of 'equivariance' over 'invariance' within 1-hop message passing mechanisms. Another invariant way of filling in this type of expressiveness gaps systematically is to introduce the information of frame transitions FTE, as was demonstrated in <cit.>. Vector update is just a special case of the more general higher-order tensor updates. To merge general equivariant tensors into our GNN, we can either utilize tensor products of vector frames <cit.>, or introduce the concepts of spherical harmonics, which form a complete basis in the sense of irreducible representations of group SO(3) and O(3). However, to express the output of the tensor product between spherical harmonics as a combination of spherical harmonics is nontrivial. Fortunately, this procedure has been studied by quantum physicists, which is named after the Clebsch-Gordan decomposition (coefficients) <cit.>. Combining these blocks, we can build convolution or attention-based equivariant graph neural networks, see <cit.> for detailed constructions. § ARCHITECTURE FOR GEOMETRIC REPRESENTATION In this section, we are going to give a brief review of certain advanced geometric models, and a summary of more methods can be found in <Ref>. Meanwhile, we will keep updating more advanced models. We include all the hyperparameters in https://github.com/chao1224/Geom3Dthis GitHub repository. We are sure that we won't be able to tune all the hyperparameters, yet we want to claim that our reported results are reproducible using the hyperparameters listed above. In the future, we appreciate any contribution to do more searching on this. Generally, all the algorithms can be classified into two categories: SE(3)-invariant and SE(3)-equivariant. Note that, rigorously, SE(3)-invariant is also SE(3)-equivariant. Here we follow the definition in <cit.>[Also a video by Tess et al, link is https://www.youtube.com/watch?v=q9EwZsHY1skhere.]: * SE(3)-invariant models only operate on scalars (l=0) which interact thought simple scalar multiplication. These scalars include pairwise distance, triplet-wise angle, etc, that will not change under rotation. In other words, the SE(3)-invariant pre-compute the invariant features and throw away the coordinate system. * SE(3)-equivariant models keep the coordinate system and if the coordinate system changes, the outputs change accordingly. These models have been believed to empower larger model capacity <cit.> with l>0 quantities. There are other variants, like the activation functions, the number of layers, normalization layers, etc. In this section, we will stick to the key module, , the SE(3)-invariant and SE(3)-equivariant modules for each backbone model. The aggregation function is the same as: h_i' = aggregate_j ∈𝒩(i)(m_ij). In the following, we will be mainly discussing the message-passing function as below. §.§ Invariant Models SchNet SchNet <cit.> simply handles a molecule by feeding in the pairwise distance and throws them into the message-passing style GNN. m_ij = MLP(h_j, RBF(d_ij)). where RBF(·) is the RBF kernel. DimeNet The directional message passing neural network (DimeNet and DimeNet++) <cit.>. The message passing function in DimeNet is two-hop instead of one-hop. Such message-passing step is similar to directed message-passing neural network (D-MPNN) <cit.>, and it can reduce the redundancy during the message passing process. m_ji^l+1 = ∑_k ∈𝒩_j\{i}MLP(m_ji^l, RBF(d_ji), SBF(d_kj, α_∠ kij)), where SBF_ln(d_kj, α_∠ kij) = √(2/c^3 j^2_l+1(z_ln)) j_l(z_ln/cd_kj) Y_l^0(α) is the spherical Fourier-Bessel (spherical harmonics) basis, a joint 2D basis for distance d_kj and angle α_∠ kij. SphereNet SphereNet <cit.> is an extension of DimeNet by further modeling the dihedral angle. It first adopts the spherical Fourier-Bessel (spherical harmonics) basis for dihedral angle modeling, namely SBF(d,θ,ϕ) = j_l(β_l_n/c d) Y_l^m(θ,ϕ). In addition, the basic operation of SphereNet is based on the quadruplets: r, s, q_1, and these three nodes formulate a reference plan to provide the polar angle to the point q_2. However, SphereNet provides an acceleration module, by projecting all the neighborhoods of s, in an anticlockwise direction, and the reference plan for each node q_i is determined by r, s and q_i-1. Thus, the computational complexity is reduced by one order of magnitude. SphereNet further considers the following for distance and angle modeling: CBF_ln(d_kj, α_∠ kij) = √(2/c^3 j^2_l+1(z_ln)) j_l(z_ln/cd_kj) Y_l^0(α), RBF_ln(d_kj) = √(2/c)sin (nπ/cd)/d. GemNet GemNet <cit.> further extends DimeNet and SphereNet. It explicitly models the dihedral angle. Notice that both GemNet and SphereNet are using the SBF for dihedral angle modeling, yet the difference is that GemNet is using edge-based 2-hop information, , the torsion angle, while SphereNet is using the edge-based 1-hop information. Thus, GemNet is expected to possess richer information, while the trade-off is the larger computational efficiency (by one order of magnitude): GemNet has complexity of O(n k^3) while SphereNet is O(n k^2). §.§ Spherical Frame Basis Equivariant Model TFN Tensor field network (TFN) <cit.> first introduces using the SE(3)-equivariance group symmetry for modeling the geometric molecule data. As will be introduced later, the translation-equivariance can be easily achieved by considering the relative coordinates, , = _i - _j. Then the problem is simplified to design an SO(3)-equivariant model. To handle this, TFN first proposes a general framework by using the spherical harmonics as the basis satisfying the following for all ∈ SO(3) and : Y_m^l(R() ) = ∑_m'=-l^l D_mm'^(l)() Y_m'^(l)(), where = /, and D^l is the irreducible representations of SO(3) to (2l+1) × (2l+1)-dim matrices (, the Wigner-D matrices). This is one design criterion for SE(3)-equivariant neural networks with the spherical harmonics frame. In specific, to design an SE(3)-equivariant network, we take the following form: F() = W() Y(), where =, W(·) is the learnable function. Thus we are separating the spherical harmonics basis and the radial signal. For modeling, we only need to learn the W(·) on the radial. Then we use the Clebsch-Gordan tensor product for message passing on node i, which is: _i = _i + ∑_j ∈𝒩(i) F(_ij) ⊗_j, where ⊗ is the Clebsch-Gordan tensor product. Note that for brevity and to give the audience a high-level idea of the spherical frame basis modeling, we omit the rotation order and the channel index in <Ref>. First, we want to acknowledge that the rotation order is the key to conducting the message passing along tensors, and please refer to the original paper for details. Then for the channel or depth of the message passing layers (notation c in the TFN paper), they are important to expand the model capacity. To sum up, by far, we can observe that TFN only considers the pairwise information (, 1-hop neighborhood) for SE(3)-equivariance. SE(3)-Transformer SE(3)-Transformer <cit.> extends the TFN by introducing an attention score, , _i = _i + ∑_j ∈𝒩(i)α_ij F(_ij) ⊗_j, where α_ij is the attention score. To calculate the attention score, first, we need to define the following: _i = ⊕_l ≥ 0∑_k ≥ 0 W_Q^lk_i^k, _ij = ⊕_l ≥ 0∑_k ≥ 0 F_K^lk(_j - _i) ⊗^k_j, where k and l correspond to the rotation order of the input and output tensor, W_Q is a learnable linear matrix, F_K follows the same formation as <Ref>, and ⊕ is the direct sum. Then we can obtain the attention coefficients with dot product as: α_ij = exp(_i^T _ij)/∑_j' ∈𝒩_i ∖ iexp (_i^T _ij') Equiformer SE(3)-Trans adopts the dot product attention, and Equiformer <cit.> extends this with an MLP attention and with higher efficiency. We also want to mention that during modeling, Equiformer has an option of adding extra atom and bond information, and we set this hyperparameter as False for a fair comparison when comparing with other geometric models. NequIP Neural Equivariant Interatomic Potentials (NequIP) <cit.> is a follow-up of TFN, which mainly focuses on improving the force prediction. Originally, TFN was directly predicting the l=1 tensor for the force prediction. In NequIP, the output only includes the l=1 tensor, while the force is obtained by taking the gradient with respect to the energy. There are also other minor architecture design updates, such as adding the skip-connection <cit.>. Please refer <cit.> for more details. Allegro Allegro <cit.> is a follow-up of NequIP by further modeling a local frame around each atom. In specific, the standard message-passing framework is based on the nodes (or atoms here), while Allegro focuses on the edge-level information. Difference with Spherical Harmonics in Invariant Modeling As you may notice, the invariant models also adopt the spherical harmonics (or spherical Fourier-Bessel), , <Ref> in DimeNet and <Ref> in SphereNet and GemNet. However, their usage of the spherical harmonics is different from the spherical frame models discussed in this section. * In invariant models, the spherical harmonics are used for embedding the angle information, either bond angles or dihedral angles. Such angles are type-0 features, and they are invariant w.r.t. the SO(3) group. Note that this embedding is related to quantum mechanics since the spherical harmonics appear as general solutions of the Schrödinger equations. * In the spherical frame models, the spherical harmonics are used to serve as the basis for transforming the relative coordinates into tensors, utilizing the fact that spherical harmonics are equivariant functions with respect to SO(3) group. Thus, they may follow the same numerical calculation, but their physical meanings are different. §.§ Vector Frame Basis Equivariant Model From a very high-level view, we can view this as first constructing the tensor and then conducting the message-passing between the type-0 tensor and type-1 tensor. EGNN E(n)-equivariant graph neural network (EGNN) <cit.> has a very neat design to achieve the E(n)-equivariance property. It constructs the message update function for both the atom positions and atom attributes simultaneously. Concretely, for edge embedding , input node embedding and coordinate =, the l-th layer updates are: _ij = W_e( _i^l, _j^l, _i^l - _j^l , _ij) _i^l+1 = _i^l + ∑_j i (_i^l - _j^l), W_v (_ij) _i = ∑_j i_ij h_i^l+1 = W_h (_i^l, _i), where W_e, W_v, W_h are learnable parameters. The equivariance can be proved easily and with good efficiency. However, one inherent limitation of EGNN is that it is essentially a global vector frame model and utilizes only one projection (scalarization) dimension, and it does not satisfy the reflection-antisymmetric condition for certain tasks like binding. PaiNN Polarizable atom interaction neural network (PaiNN) <cit.> utilizes a multi-channel vector aggregation method, which contains more expressive equivariant vector information than <Ref>. More precisely, each node of PaiNN maintains a multi-channel vector: _i ∈𝐑^F × 3, where F denotes the channel number. Comparing with <Ref>, the _i ∈𝐑^1 × 3 of EGNN restricted the expressiveness power. <cit.> provides a geometric explanation of the updating method of PaiNN ((9) of <cit.>) by the frame transition functions between local vector frames. § COMPLETE RESULTS In the main body, due to space limitations, we cannot provide the results on certain tasks. Here we would like to provide more comprehensive results. For the results not listed either in the main body or in this section, there are two possible reasons for us to exclude them: (1) We cannot reproduce them using the reported hyperparameters in the original paper, and we may need to do more hyperparameter tuning as the next steps. (2) Some models are too large to fit in the GPU memory, even with batch-size=1. §.§ Small Molecules: MD17 and rMD17 In <Ref>, we select 6 subtasks in MD17 and 6 subtasks in rMD17. Next we will show the complete results of MD17 and rMD17 are in <Ref>. §.§ Geometric Pretraining Single-modal Pretraining. Recent studies have started to explore single-modal geometric pretraining on molecules. The GeoSSL paper <cit.> covers a wide range of geometric pretraining algorithms. The type prediction, distance prediction, and angle prediction predict the masked atom type, pairwise distance, and bond angle, respectively. The 3D InfoGraph predicts whether the node- and graph-level 3D representation are for the same molecule. GeoSSL is a novel geometric pretraining paradigm that maximizes the mutual information (MI) between the original conformation _1 and augmented conformation _2, where _2 is obtained by adding small perturbations to _1. RR, InfoNCE, and EBM-NCE optimize the objective in the latent representation space, either generative or contrastive. GeoSSL-DDM <cit.> optimizes the same objective function using denoising score matching. GeoSSL-DDM-1L <cit.> is a special case of GeoSSL-DDM with one layer of denoising. 3D-EMGP <cit.> geometric pretraining is specifically built on equivariant models, and the goal is to denoise the 3D coordinates directly using a diffusion model. We illustrate these seven algorithms in <Ref>. 2D-3D Multi-modal Pretraining. Another promising direction is the multi-modal pretraining on topology and geometry. GraphMVP <cit.> first proposes one contrastive objective (EBM-NCE) and one generative objective (variational representation reconstruction, VRR) to optimize the mutual information between the 2D and 3D modalities. Specifically, VRR does the 2D and 3D reconstruction in the latent space. 3D InfoMax <cit.> is a special case of GraphMVP, with the contrastive part only. MoleculeSDE <cit.> extends GraphMVP by introducing two SDE models for solving the 2D and 3D reconstruction. An illustration of them is in <Ref>. In <Ref>, we show the pretraining results of using SchNet as the backbone and fine-tuning on QM9. The pretraining results of using SchNet as the backbone and fine-tuning on MD17 are in <Ref>. The pretraining results of using PaiNN as the backbone and fine-tuning on QM9 and MD17 are in <Ref>. For MD17, as will be discussed in <Ref>, we do not consider the data normalization trick. Notice that some pretraining results are skipped due to the collapsed performance. § ABLATION STUDIES We have the following challenges in the literature: (1) Different data splits, , with different seeds or different train-valid-test sizes. (2) Different running epochs. (3) Different optimizers (SGD, Adam) and learning rate schedulers. (4) Different preprocessors, including data augmentations and normalization strategies. These factors can significantly affect performance, and is a useful tool for careful scrutinization. §.§ Ablation Studies on the Effect of Latent Dimension d Recent works <cit.> have found that the latent dimensions play an important role in molecule pretraining, and here we list the comparison between latent dimension d=128 and latent dimension d=300. * The performance comparison for QM9 is in <Ref>, and we visually plot the performance gap MAE(d=128) - MAE(d=300) in <Ref>. The results with d=300 are reported in <Ref>. * The performance (w/ normalization) comparison for MD17 and rMD17 is in <Ref>. The results with d=300 are reported in <Ref> except NequIP and Allegro. Their results in <Ref> (w/ normalization) are reported <Ref>. * The performance comparison for COLL is in <Ref>, and results with d=300 are reported in <Ref>. * The performance comparison for LBA & LEP is in <Ref>, and results with d=300 are reported in <Ref>. §.§ Ablation Study on Data Normalization for Molecular Dynamics Prediction Allegro <cit.> and NequIP <cit.> introduce a normalization strategy for molecular dynamics (energy and force) prediction on MD17 and rMD17 datasets: ŷ_E = y_E * Force Mean + Energy Mean * # Atom, where y_E is the original predicted energy, and ŷ_E is the normalized prediction. We find this trick important and would like to systematically test it here. Notice that as shown in <Ref>, the latent dimension is an important factor, and here we would like to conduct the ablation studies on both factors.=-1 * MD17 w/o normalization and d=128 in <Ref>, d=300 in <Ref>. rMD17 w/o normalization and d=128 in <Ref>, d=300 in <Ref>. * In the following tables, we test: MD17 w/ normalization and d=128 in <Ref>, d=300 in <Ref>. rMD17 w/ normalization and d=128 in <Ref>, d=300 in <Ref>. §.§ Ablation Studies on Reproduced Results of NequIP and Allegro Here we would like to further discuss NequIP and Allegro. * NequIP has no explicit molecule-level representation, and we directly put its results below. * Allegro adopts d=512 by default (by far we are mainly checking d=128 and d=300). * We can reproduce NequIP and Allegro results w/ data normalization, as shown below. §.§ Ablation Study on the Data Split of Crystalline Material In the main paper, we report the results on MatBench with 60%-20%-20% for train-valid-test split. To verify the reproducibility correctness of , we carry on an ablation study with the same setting as MatBench <cit.>. Notice that MatBench adopts the setting in KGCNN <cit.>: with seed 18012019 and 80% for training and 20% for the test. The reproduced results are in <Ref>. The mean evaluation metrics of SchNet and DimeNet++ with cross-validation are reported in https://matbench.materialsproject.org/Benchmark §.§ Ablation Study on the Data Augmentation of Crystalline Material The default latent dimension d=300 for most of the models, except for EGNN and SEGNN, which lead to the out-of-memory exception. Besides, SEGNN may collapse with gathered DA, so we skip that in the comparison. §.§ An Evidence Example On The Importance of Atom Types and Atom Coordinates First, it has been widely acknowledged <cit.> that the atom positions or molecule shapes are important factors to the quantum properties. Here we carry out an evidence example to empirically verify this. The goal here is to make predictions on 12 quantum properties in QM9. The molecule geometric data includes two main components as input features: the atom types and atom coordinates. Other key information can be inferred accordingly, including the pairwise distances and torsion angles. We consider corruption on each of the component to empirically test their importance accordingly. * Atom type corruption. There are in total 118 types of atom types, and the standard embedding option is to apply the one-hot encoding. In the corruption case, we replace all the atom types with a hold-out index, , index 119. * Atom coordinate corruption. Originally QM9 includes atom coordinates that are in the stable state, and now we replace them with the coordinates generated with MMFF <cit.> from RDKit <cit.>. We take SchNet and PaiNN as the backbone 3D GNN models, and the results are in <Ref>. We can observe that (1) Both corruption examples lead to performance decrease. (2) The atom coordinate corruption may lead to more severe performance decrease than the atom type corruption. To put this into another way is that, when we corrupt the atom types with the same hold-out type, it is equivalently to removing the atom type information. Thus, this can be viewed as using the equilibrium atom coordinates alone, and the property prediction is comparatively robust. This observation can also be supported from the domain perspective. According to the valence bond theory, the atom type information can be implicitly and roughly inferred from the atom coordinates. Therefore, by combining all the above observations and analysis, one can draw the conclusion that, for molecule geometry data, the atom coordinates reveal more fundamental information for representation learning. §.§ Ablation on the Effect of Residue Type As discussed in <Ref>, proteins have four levels of backbone structures. In <Ref>, we carefully check the effect of atom types and atom coordinates in small molecules, and here we would like to check the effect of side residue type in protein geometry-related tasks. For experiments, we take one of the most recent works, CDConv <cit.>, as the backbone geometric model. The ablation study results are as in <Ref>. We observe that the performance drops on all the tasks, and the performance drops on Sup and Fam are much more significant. This reveals that the effect of residue type may differ for different tasks, yet it is preferred to have them encoded for geometric modeling. § RESOURCES We use a single GPU (V100 or A100) for each task. Note that we try to run all the models with the same epoch numbers, yet some models are too large in terms of computational memory and time, so we have to reduce the computational time. Thus, we list the running time for the main tasks below for readers to check. In total, it takes over 639 GPU days (without any hyperparameter tuning, random seeds, or ablation studies). It takes around 1370 GPU days if we include ablation studies discussed in <Ref>. We would also like to acknowledge the following nice implementations and tutorials of geometric models: * e3nn: Euclidean Neural Networks, by Tess <cit.> * TFN <cit.> * MaterialProject <cit.> and MatBench <cit.> * Keras Graph Convolution Neural Networks (KGCNN) <cit.> * DIG <cit.> * TorchDrug <cit.>
http://arxiv.org/abs/2306.01444v1	20230602110713	Unsupervised Extractive Summarization of Emotion Triggers	[ "Tiberiu Sosea", "Hongli Zhan", "Junyi Jessy Li", "Cornelia Caragea" ]	cs.CL	[ "cs.CL" ]	[ D. Thévenin July 31, 2023 ================= Tiberiu Sosea and Hongli Zhan contributed equally. Understanding what leads to emotions during large-scale crises is important as it can provide groundings for expressed emotions and subsequently improve the understanding of ongoing disasters. Recent approaches <cit.> trained supervised models to both detect emotions and explain emotion triggers (events and appraisals) via abstractive summarization. However, obtaining timely and qualitative abstractive summaries is expensive and extremely time-consuming, requiring highly-trained expert annotators. In time-sensitive, high-stake contexts, this can block necessary responses. We instead pursue unsupervised systems that extract triggers from text. First, we introduce , augmenting <cit.>'s abstractive dataset (in the context of the COVID-19 crisis) with extractive triggers. Second, we develop new unsupervised learning models that can jointly detect emotions and summarize their triggers. Our best approach, entitled Emotion-Aware Pagerank, incorporates emotion information from external sources combined with a language understanding module, and outperforms strong baselines. We release our data and code at <https://github.com/tsosea2/CovidET-EXT>. § INTRODUCTION Language plays a central role in social, clinical, and cognitive psychology <cit.>, and social media presents a gold mine for such analysis: people turn to social media to share experiences around challenges in their personal lives and seek diagnosis, treatment, and emotional support for their conditions <cit.>. During crises, such as natural disasters or global pandemics, large-scale analysis of language on social media — both how people feel and what's going on in their lives to lead to these feelings — can have a profound impact on improving mental health solutions as well as helping policymakers take better-informed decisions during a crisis. Recent work <cit.> taps into this broad challenge by jointly detecting emotions and generating a natural language description about what triggers them (triggers include both objective events and subjective appraisals of those events <cit.>). Trigger explanation is formulated as a supervised, abstractive summarization task that is emotion-specific. Unlike generic summarization however, due to the high cognitive load to provide judgments for each emotion, obtaining human-written summaries for this task is time-consuming and requires significant annotator training. This results in small, domain-specific datasets that are difficult to scale — especially in the face of new crisis events where the timing of such analysis is often pivotal. This work instead takes a fully unsupervised approach such that we do not rely on any labeled data, thus becoming agnostic to distributional shifts in domain or types of crisis, and robust for time-critical events. We posit that emotion triggers can be summarized effectively in an extractive manner where unsupervised methods are well-suited; we thus tackle the challenge of simultaneous emotion prediction and trigger extraction. For this new task, we first introduce , augmenting <cit.>'s CovidET with manually annotated extractive summaries corresponding to each of their abstractive summaries. The result is a dataset of 1,883 Reddit posts about the COVID-19 pandemic, manually annotated with 7 fine-grained emotions (from CovidET) and their corresponding extractive triggers (Figure <ref>). For every emotion present in a post, our annotators highlight sentences that summarize the emotion triggers, resulting in 6,741 extractive summaries in total. Qualitative analyses of the dataset indicate good agreement among the annotators, and follow-up human validations of the annotations also reveal high correctness. provides an ideal test bed to facilitate the development of extractive (supervised or unsupervised) techniques for the tasks of emotion detection and trigger summarization in crisis contexts. =-1 We propose Emotion-Aware PageRank (EAP), a novel, fully unsupervised, graph-based approach for extractive emotion trigger summarization from text. The core of our method is to decompose the traditional PageRank <cit.> ranking algorithm into multiple biased PageRanks <cit.>, one for each emotion. To bias our model towards various emotions, our approach harnesses lexical information from emotion lexicons <cit.>. Critically, unlike previous graph-based unsupervised approaches <cit.>, which represent the text as a bag-of-words or word embeddings, EAP incorporates a language understanding module leveraging large language models to ensure that the summaries for an emotion are coherent in the context of that emotion. Results on our indicate the effectiveness of our EAP, which significantly pushes the Rouge-L score of our summaries by an average of 2.7% over strong baselines. Our contributions are as follows: 1) We introduce , a manually annotated benchmark dataset for the task of emotion detection and trigger summarization. 2) We propose Emotion-Aware PageRank, a variation of PageRank that combines a language understanding module and external emotion knowledge to generate emotion-specific extractive summaries. 3) We carry out a comprehensive set of experiments using numerous baselines to evaluate the performance on and show that our proposed EAP significantly outperforms strong baselines. § BACKGROUND AND RELATED WORK Emotion Tasks. Most of the prior work on emotions on social media focuses solely on detecting emotions or emotional support from text <cit.>. Our task is directly related to emotion cause extraction <cit.> which focused on identifying phrase-level causes from Chinese news or micro-blogs, which are distinct from the spontaneous writing on social media. In our context, similar to the work of <cit.>, what triggers an emotion includes both what happened and how the writer appraised the situation. A major difference of our work from <cit.> is that we consider extractive summaries instead of abstractive and take a fully unsupervised perspective, eliminating the reliance on labeled data. For a comprehensive overview of introduced by <cit.>, refer to Appendix covid-et. Unsupervised Extractive Summarization. Extractive summarization aims to condense a piece of text by identifying and extracting a small number of important sentences <cit.> that preserve the text's original meaning. The most popular approaches in unsupervised extractive summarization leverage graph-based approaches to compute a sentence's salience for inclusion in a summary <cit.>. These methods represent sentences in a document as nodes in an undirected graph whose edges are weighted using sentence similarity. The sentences in the graph are scored and ranked using node centrality, computed recursively using PageRank <cit.>. In contrast, our EAP considers words instead of sentences as nodes in the graph and employs multiple separate biased PageRanks <cit.> to compute an emotion-specific score for each word, which is combined with a sentence-similarity module to produce one sentence score per emotion, indicating the salience of the sentences under each emotion. § DATASET CONSTRUCTION Since there is no annotated data for extractive emotion triggers summarization in crisis contexts, we first bridge this gap by extending , <cit.>'s abstractive-only dataset with extractive trigger summaries. Doing so (a) creates benchmark data for extractive systems; (b) allows in-depth analyses to understand how and when emotion triggers are expressed on social media. This will also create a parallel abstractive-extractive dataset for future research. We name our new dataset (CovidET {extractive, extension}). Annotating Emotion Triggers. Given a post from annotated with an emotion e, we ask annotators to highlight sentences in the post that best describe the trigger for e. An overview of our annotation scheme can be viewed in Appendix appendix:annotation-scheme. We recruit both undergraduate students (in a Linguistics department) as well as pre-qualified crowd workers (from the Amazon Mechanical Turk) for this task.[These crowd workers have an ongoing working relationship with our group and have prior experience in related complex tasks, and we make sure they are paid at least $10/hr.] Each post is annotated by two annotators. We monitor the annotation quality and work with the annotators during the full process. Similar to CovidET, the test set is annotated by undergraduate students. Benchmark Dataset. We follow the benchmark setup in <cit.> with 1,200 examples for training, 285 examples for validation, and 398 examples for testing. If two annotators highlight different sentences as triggers for the same emotion, we consider both sets of sentences as the gold summaries and evaluate them using multi-reference ROUGE. We anonymize . Note that since we explore unsupervised methods, the training set is not used in our summarization models. Nevertheless, we emphasize that while the focus of this work is the unsupervised setup, we hope that can spur further research into both supervised and unsupervised methods, hence we maintain the splits in <cit.>. For completeness, we carry out experiments in a fully supervised setup in Appendix supervised-extractive-summarization. Human Validation. We validate the annotated extractive summaries of emotion triggers in through inspections from third-party validators on the Amazon Mechanical Turk crowdsourcing platform. A subset of our training data including 300 randomly selected examples which contain annotations of extractive summaries of emotion triggers are validated. Given an annotated extractive trigger summary, we first ask the validators whether the summary leans towards the annotated emotion. It yes, we ask the validator to further point out if the trigger — rather than the emotion itself — is present in the summary. The percentage of examples that validators confirm for the two steps is shown in Table <ref>. Overall, the human validation results showcase moderately high correctness in the annotations of , considering the subjective nature of our task.[The same sentence can be interpreted to be triggers for different emotions. For example, the sentence “I miss my room and I dont have many clothes or my meds here, but hes hitting these mics every fucking night and Im scared of contracting it” expresses anger, sadness, and fear simultaneously under the same context.] Inter-Annotator Agreement. We measure the inter-annotator agreement between two extractive trigger summaries for the same emotion in a post, as shown in Table <ref>. Results show that, within the examples where we find emotion overlaps, 29.9% of the extractive summaries of triggers for the same emotion share completely identical annotations from both annotators, and 25.6% have partial sentence-level overlaps. In total, we find overlaps in 55.5% of the summaries, and the experts who were responsible for the test set (65.8%) have more overlapping summaries than the crowd workers who were responsible for the training and validation sets (52.3%). Furthermore, the average Fleiss' kappa <cit.> is 0.89 across all the emotions in . This suggests substantial agreement among our annotators. In addition, we also employ automatic metrics including self-BLEU (with smoothing methods 1) and self-ROUGE to capture the overlap between annotators' summaries. To establish a baseline, we report these metrics between the annotators' work and a randomly selected sentence from the original post. We repeat this process five times. Results reveal that both the self-BLEU and self-ROUGE of our annotations significantly outperform that of the random baseline (as shown in Table <ref>). We also observed higher values of these measures for student annotators compared with crowd workers. (c.f. Appendix agreement). These results indicate strong accordance among our annotators. Dataset Statistics. Here we elaborate on the overview of . On average, there are 1.35 sentences (std.dev = 0.79) consisting of 32.54 tokens (std.dev = 20.68) per extractive summary of emotion trigger in . As shown in Figure <ref>, when broken down into unique trigger sentences, fear has the most trigger sentences in the dataset, closely followed by anticipation. On the other hand, trust has the lowest number of trigger sentences. This can be attributed to the calamitous nature of the domain of our dataset. Besides, unlike generic news summarization <cit.>, the emotion-trigger extractive summarization task is not lead-based. This is manifested through our scrutiny of the position of emotion trigger sentences in the original posts (Figure <ref> and Figure <ref>, Appendix appendix:data-analysis), where a large number of triggers cluster in the later parts of the post. Additional analyses of can be found in Appendix appendix:data-analysis. Emotion Explicitness. To examine the explicitness of emotions in the extractive summaries of emotion triggers, we apply EmoLex <cit.>, an English lexicon for the Plutchik-8 primary emotions. Specifically, for the extractive summaries of triggers to a certain emotion e, we measure the average ratio of e's words in EmoLex being present in the sentence-level lemmatized summaries. The results are presented in Figure <ref>. Interestingly, we notice that sadness is the most explicit emotion in the annotated extractive summaries of triggers in our dataset, while anger is the most implicit one. § UNSUPERVISED EXTRACTIVE SUMMARIZATION In this section we introduce Emotion-Aware Pagerank (EAP), our fully unsupervised, graph-based, emotion trigger extractive summarization method that incorporates information from emotion lexicons to calculate a biased PageRank score of each sentence in a post. EAP then fuses this score with an additional similarity-based sentence-level score that ensures the summary for a specific emotion e does not diverge in meaning from other summaries of the same emotion e. We show an overview of our model architecture in Figure <ref>. Task Formulation. Let P be a Reddit post. P is composed of an ordered sequence of n sentences: P = {s_1, s_2, ..., s_n}. Generic extractive summarization aims to output an ordered set of sentences S with S ⊂ P that captures the essence of post P. In our emotion trigger summarization, however, we aim to generate multiple extractive summaries conditioned on the expressed emotions. To this end, we are interested in a set of summaries S^emo = {S_e_1, S_e_2, ..., S_e_m} where m is the total number of emotions present in P and S_e_i is the summary of the triggers that lead to the expression of emotion e_i with S_e_i⊂ P. Note that P usually conveys a subset of emotions, in which case the summaries for the emotions that are not present in text are empty. Graph Construction. We build an undirected graph G=(V, E), where V is vocabulary set of words. To build V we employ various processing and filtering techniques. First, we only select nouns, adjectives, verbs, adverbs and pronouns and remove any punctuation. Next, we stem all the selected words to collapse them in a common base form. Finally, we remove infrequent words which appear less than 20 times in the entire training set. The remaining words form the vocabulary V. A pair of words (w_i, w_j) ∈ E defines an edge between w_i and w_j and the operator β(w_i, w_j) denotes the weight of edge (w_i, w_j). We compute the weight of an edge in our graph using word co-occurences in windows of text. Given a window size of ws, we say that two words w_i and w_j co-occur together if the number of words between them in text is less than ws. We build a co-occurence matrix C of size \|V\|×\|V\| from the documents in our training set where C_ij is the number of times words w_i and w_j co-occur together. Using C we simply define the weight of an edge as: β(w_i, w_j) = 2 × C_ij/∑_k=0^\|V\|(C_ik + C_jk) Intuitively, the more frequently two words co-occur together, the higher the weight of the edge between them becomes. Emotion Decomposition. In PageRank, the importance or relevance ℛ(w_i) of an arbitrary word w_i is computed in an iterative fashion using the following formula: ℛ(w_i) = λ∑_k = 1^\|V\|β(w_k, w_i)ℛ(w_k) + (1-λ)1/\|V\| where \|.\| is the set size operator and λ is the damping factor, a fixed value from 0 to 1 which measures the probability of performing a random jump to any other vertex in the graph. The idea of PageRank is that a vertex or word is important if other important vertices point to it. The constant term 1/\|V\| is called a random jump probability and can be viewed as a node preference value, which in this case assigns equal weights to all the words in the graph, indicating no preference. In this current formulation, the PageRank model calculates the weights of words irrespective of the expressed emotion. We claim that for our purpose words should bear different importance scores in different emotion contexts. For example, the word agony should have a higher importance in the context of sadness or fear than in the context of joy. To this end, we propose to decompose the text into multiple components, one for each emotion, where the relevance of a word differs from component to component. Biased PageRank <cit.> is a variation of PageRank where the second term in Equation <ref> is set to be non-uniform, which can influence the algorithm to prefer particular words over others. We propose to run a separate biased PageRank for each emotion and leverage a custom importance function i_e(w_i) that yields high values for words that are correlated with an emotion e and low values otherwise. Formally, the relevance computation for the PageRank corresponding to emotion e becomes: ℛ_e(w_i) = λ∑_k = 1^\|V\|β(w_k, w_i)ℛ_e(w_k) + (1-λ)i_e(w_i)/N where N is a normalization factor such that ∑_w ∈ Vi_e(w)/N = 1. Since the model prefers those vertices with higher random jump probabilies, using an accurate importance function i_e(w_i) for emotion e can lead to accurate relevance scores in the context of e. We define this function using the NRC emotion intensity <cit.> lexicon. EmoIntensity associates words with their expressed emotions and also indicates the degree of correlation between a word and a particular emotion using real values from 0 to 1. For example, outraged has an intensity for anger of 0.964 while irritation has an intensity of 0.438. In our context, assigning importance values using intensity is appropriate since a sentence containing high intensity words for an emotion e is more likely to be relevant in the context of e compared to a sentence containing lower intensity words. Denoting the set of words in EmoIntensity correlated with emotion e by ℐ_e, all words w ∈ℐ_e also come with intensity value annotations denoted by int_e(w). Therefore, we define the importance function as: i_e(w)= {[ int_e(w) if w ∈ℐ_e; c if w ∈ V ∖ℐ_e; ]. where c is a constant that we find using the validation set. Since our summaries are at the sentence level, we simply score a sentence s_i as the average relevance of its words: R_e(s_i) = ∑_w_j∈ s_i R_e(w_j)/\|s_i\| Encoding the meaning. A major drawback of prior graph-based approaches is that they exclusively represent the input as a bag-of-words, ignoring the structure of text. We propose to solve this drawback by introducing a language model-based component to encode the meaning of a sentence. Our component is based on the assumption that a sentence s that is highly relevant for an emotion e should be similar in meaning to other sentences s_i relevant to e. We capture this property by scoring each sentence based on its similarity with other important (i.e., in the context of e) sentences. We leverage the popular Sentence-BERT <cit.> model, which produces meaningful sentence embeddings that can be used in operations such as cosine similarity. Given a sentence s_i, let 𝐬_𝐢 be its embedding and sim(𝐬_𝐢, 𝐬_𝐣) be the cosine similarity between the embeddings of sentences s_i and s_j. Denoting by 𝒯 the set of sentences in the entire dataset, we score s_i in the context of emotion e as follows: M_e(s_i) = ∑_s ∈𝒯^ sim(𝐬_𝐢, 𝐬) ℛ_e(s)/\|𝒯\| Intuitively, M_e(s_i) yields high values if s_i is similar in meaning to sentences relevant in the context of emotion e. Constructing the Summaries. Given a post P = {s_1, s_2,...,s_n}, we first combine the meaning and the relevance scores into a final, sentence level, per-emotion score, which we use to score every sentence s_i in P along all the emotions: ℱ_e(s_i) = ℛ_e(s_i) * M_e(s_i) =-1 We use this per-emotion score to rank the sentences in the post P. For an emotion e, we only select the sentences s_i where ℱ_e(s_i) > t to be part of the final summary for e. t is a threshold value that we infer using our validation set. Note that given P, we compute the score ℱ_e for every emotion e. In the case that none of the sentences in P exceed the threshold for a particular emotion, we consider that the emotion is not present in the post (i.e., we do not generate a summary). § EXPERIMENTS AND RESULTS In this section, we first introduce our emotion-agnostic and emotion-specific baselines. Next, we present our experimental setup and discuss the results obtained by EAP against the baselines. Emotion-agnostic baselines. We explore two standard heuristic baselines, namely 1) Extracting the first sentence in the post (1 sent) and 2) Extracting the first three sentences in the post (3 sent). Next, we design three graph centrality measure-based methods: 3) PacSum <cit.>, 4) PreSum <cit.> and word-level 5) TextRank <cit.>. Note that these methods are emotion-oblivious and the generated summary will be identical for different emotions. Emotion-specific baselines. We first employ two lexical-based methods: 6) EmoLex - we use the EmoLex <cit.> lexicon to identify lexical cues that indicate the expression of emotions. If a sentence contains a word that is associated with an emotion e, we consider the sentence to express e. The final summary for e contains all sentences expressing e. 7) EmoIntensity - we leverage the NRC Affect Intensity Lexicon <cit.> to build a more fine-grained approach of identifying if a sentence expresses an emotion or not. For each sentence and emotion, we calculate the average emotion word intensity and compare it to a pre-defined threshold t. If the average intensity for e is higher than t we label the sentence with e. t is a tunable parameter that we select based on our validation set performance. Finally, we leverage models trained on emotion detection datasets to build our emotion-specific summaries. For a post P, we use our model to make predictions on each sentence in P and build summaries by concatenating sentences that express the same emotions. We mainly experiment with a model trained on the 8) GoEmotions <cit.> dataset. Experimental Setup. We carry out our experiments on an Nvidia A5000 GPU. We use the HuggingFace Transformers <cit.> library for our Sentence-BERT implementation and we will make the code for our methods and data available for reasearch purposes. We report the performance in terms of Rouge-2 and Rouge-L <cit.> to evaluate the summarization performance. Additionally, we also calculate the performance in terms of F1 and show the results in Appendix <ref>. We provide extensive details about the hyperparameters used in EAP and the baselines, such as our various thresholds and constants in Appendix hyperparameters. Results. We show the results obtained in Table <ref>. First, we note that emotion-specific approaches outperform the emotion-oblivious methods considerably. Notably, EmoIntensity outperforms PacSum by an average of 1.1% in Rouge-2. Among the emotion-specific baselines, EmoIntensity, which uses the intensity of emotion words to extract relevant sentences for a particular emotion obtains good performance, outperforming the EmoLex method by 5.1% Rouge-2 on disgust and 3.3% on fear. This result emphasizes that having a degree of association between a word and an emotion (i.e., the intensity) is a stronger signal than the plain word-emotion association in our emotion-based extractive summarization context. EAP consistently yields the highest results both in terms of Rouge-2 and Rouge-L compared to the other approaches. Concretely, we obtain an average improvement of 2.7% in Rouge-L and 2.5% in Rouge-2 score over our strongest EmoIntensity baseline. For example, on anger and joy we see improvements in Rouge-2 of 1.7% and 6.3% respectively. Moreover, our emotion-aware PageRank considerably outperforms TextRank <cit.> by as much as 5.5% Rouge-L and 4.5% Rouge-2 on average. Emotion Detection. While EAP shows strong results in our emotion trigger summarization experiments, we want to evaluate our approach in a traditional emotion detection task. To this end, we ask how well EAP can detect emotions at the post level. Given a post P, we label the post with emotion e if we identify any sentence s ∈ P as a summary for e. If no sentence is selected to be included in the summary, we consider that EAP does not predict e. We show the results obtained in Table <ref>, where we compare EAP to lexical methods (EmoLex and EmoIntensity) and a domain adaptation method, which trains a BERT <cit.> model on the GoEmotions dataset <cit.>. We observe that EAP consistently outperforms prior work on all the emotions by an average of 0.9% in F1 score. Notably, we see 1.5% improvements in F1 on fear and 1.9% on anticipation. Ablation Study. We perform a thorough ablation study to tease apart and analyze the components lead to the success of EAP. First, we analyze the influence of emotion intensity on the performance of the model. Here, we slightly modify the importance function from Equation <ref> to a constant value. Instead of using the variable int_e(w) we use a constant value c^e where c^e > c. Intuitively, we still bias the model towards a particular emotion e, however, every word associated with e weighs equal in this ablated version of EAP. We denote this modification of the algorithm by -int. Second, we remove the meaning score M_e from our algorithm and use only the word-based relevance ℛ_e. This approach is denoted by -sim. We also analyze the behaviour of EAP when removing both components. We show the results obtained in Table <ref>. Removing emotion intensity leads to a performance degradation of 1% in Rouge-L while the lack of our similarity module decreases the performance by 1.2% in Rouge-L. Removing both further decreases the performance by 2.9% in Rouge-2. These results emphasize that both similarity and intensity are core components of EAP and both consistently contribute to its success. =-1 Anecdotal Evidence. To offer additional insights into our EAP, we provide anecdotal evidence in Figure <ref>, where we show a post expressing both joy and fear. We indicate for each word both its relevance for joy and for fear. Additionally, we show the meaning score for each sentence and emotion. Interestingly, we observe that the scores produced by our model are very relevant. For instance, protection has a very large value for joy of 0.531 and a very small value of 0.076 for fear. Along the same lines, worried has a relevance of 0.523 for fear and 0.074 for joy. The similarity scores are also accurate. For example, glad I am fully vaccinated has a score for joy of 0.463, 9 times as large of the score of the same sentence for fear. We show additional analysis on the effect of the most relevant terms on EAP performance in Appendix model_analysis. § CONCLUSION =-1 We introduce , a new benchmark dataset composed of 1,883 Reddit posts annotated for the task emotion detection and extractive trigger summarization in the context of the COVID-19 pandemic. Our proposed Emotion-Aware Pagerank approach yields strong results on our datasets, consistently outperforming prior work in an unsupervised learning context. In the future, we plan to study abstractive trigger summarization from an unsupervised point of view to bridge the gap between the extractive and abstractive summarization performance. § LIMITATIONS Since our EAP builds its graph representation from social media data, our method may carry inductive biases rooted in this type of data. Moreover, note that the scope of our study is limited to English social media posts and our approach does not consider inputs larger than 512 tokens. Therefore using our approach in long document summarization may be challenging. Finally, the general applicability of EAP in a different domain is highly dependent on the existence of high-quality lexicons for the domain in question, which may not be available. § ACKNOWLEDGEMENTS This research was partially supported by National Science Foundation (NSF) grants IIS-1912887, IIS-2107487, ITE-2137846, IIS-2145479, IIS-2107524, IIS-2107487. We thank Jamie Pennebaker for useful discussions and comments. We also thank our reviewers for their insightful feedback and comments. acl_natbib § COVIDET[<HTTPS://GITHUB.COM/HONGLIZHAN/COVIDET>] <cit.> was the first to introduce the combined labeling of both emotions and (abstractive) summaries of their triggers on the domain of spontaneous speech (i.e., Reddit posts). They presented , a corpus of 1,883 Reddit posts manually annotated with 7 emotions (namely anger, anticipation, joy, trust, fear, sadness, and disgust) as well as abstractive summaries of the emotion triggers described in the post. The posts are curated from [<https://www.reddit.com/r/COVID19_support/>], a sub-Reddit for people seeking community support during COVID-19. To ensure the diversity of the data distribution, consists of Reddit posts from two different timelines (before and during the Omicron variant). The posts in are lengthy and emotionally rich, with an average of 156.4 tokens and 2.46 emotions per post. serves as an ideal dataset to spur further research on capturing triggers of emotions in long social media posts. Nevertheless, the combined labeling of emotions and free-form abstractive summarization of their triggers is difficult and time-consuming as it requires annotators to comprehend the document in depth. This fails to meet the time-sensitivity requirement in the face of major crises like COVID-19. Our work instead proposes to generate an extractive summarization of emotion triggers and studies the task of emotion detection and trigger summarization from an unsupervised learning perspective, which is robust to domain variations and beneficial in boosting understanding in time-critical periods. § ANNOTATION SCHEME OF The process of collecting annotations for is shown in Figure <ref>. Given a post and its annotations containing emotion e from , we ask annotators to highlight sentences in the post that best describe the trigger for emotion e. Rather than selecting text that expresses the emotion itself, we specifically instruct annotators to extract the events and how people make sense of the events that lead to the expression of the emotion. We use detailed examples provided by <cit.> to help our annotators better interpret the definition of emotion triggers. § CROWD WORKERS Both groups of annotators for come from the United States. The crowd workers are recruited from the Amazon Mechanical Turk crowdsourcing platform, with restrictions that their locale is the US and that they have completed 500+ HITs with an acceptance rate of at least 95%. The undergraduate students are hired from a university in the United States. § INTER-ANNOTATOR AGREEMENT AMONG UNDERGRADUATE STUDENTS AND CROWD WORKERS As shown in Table <ref>, the inter-annotator performance of the undergraduate students consistently exceeds the crowd workers. § ADDITIONAL ANALYSES OF Trigger Positions. We examine the position of the emotion trigger sentences in the original posts. The sentence-level distribution of the annotated triggers is reported in Figure <ref>. Results reveal that the trigger sentences spread evenly across the posts, with a large number of triggers clustering in the later parts of the post. This means that the emotion-trigger extractive summarization task is not lead-based, unlike generic news summarization <cit.>. This is especially true for anticipation, as demonstrated in Figure <ref>. Trigger Components. In addition to the explicitness of emotion triggers, we also examine the syntactic components of the extractive summaries of emotion triggers. Results are shown in Figure <ref>. We observe that nouns and verbs take up the majority of triggers, closely followed by the use of pronouns. Pronoun Distributions. Psycho-linguistic studies reveal that the analysis of function words such as pronouns can disclose psychological effects of life experiences and social processes <cit.>. Specifically, overusing the first-person singular pronouns may imply a high level of self-involvement, whereas the increased use of other pronouns may signify improvement of social engagement <cit.>. We evaluate the percentage of personal pronoun usage per annotated emotion trigger sentence. In particular, we discover an inverse correlation between first-person singular pronouns (e.g., I, me, my, mine, myself) and second-person pronouns (e.g., you, your, yours, yourself, yourselves). We provide the average percentage of the personal pronouns per emotion trigger in Figure <ref>. Further statistical tests reveal negative Pearson correlations between the percentage distribution of first-person singular pronouns and second-person pronouns in each emotion (with substantial significance in all 7 emotions; shown in Table <ref>). We note that when expressing negative emotions such as sadness and fear, authors used more first-person singular pronouns in triggers. On the other hand, authors used more second-person pronouns in expressing the triggers for positive emotions like joy and trust. The inverse correlation between first-person singular pronouns and second-person pronouns suggests more self-involvement in negative emotions and more social engagement in positive emotions in . Topical Variations. To better interpret the annotated emotion triggers, we train a multi-class bag-of-words logistic regression model to predict the emotion label of each annotated extractive emotion trigger sentence. The trained model's weights pertaining to each class of emotions are then extracted to locate the tokens that are most indicative of each emotion. The multi-class logistic regression model achieved a micro F1 score of 0.33 after training and evaluating on our benchmark dataset. The most indicative tokens associated with each emotion are reported in Table <ref>. Connections to . To understand the ties between and , we measure the self-BERTScore between the extractive summaries of triggers from and the abstraction summaries of triggers from . Results reveal that the average BERTScore F1 is 0.872 between the extractive and abstractive summaries, indicating strong correlations between the two datasets. Same Triggers for Different Emotions. The status of overlapping trigger sentences for different emotions is shown in Figure <ref>. Specifically, we measure the percentage of sentences that are triggers for an emotion i that are also triggers for emotion j in . § SUPERVISED EXTRACTIVE SUMMARIZATION Although our focus is exclusively on unsupervised approaches to eliminate the reliance on labeled data, we note that Covid-EXT can be a suitable benchmark for developing supervised methods as well. In this section, we compare two supervised methods against our unsupervised EAP. We experiment with two methods for emotion trigger extraction. 1) First, we experiment with the BART-FT-JOINT <cit.> model which is trained to jointly predict emotions and their summary. We train this model on the training set of Covid-EXT in a supervised manner. Second we employ a simple 2) BERT <cit.> classifier that is trained in a supervised manner to detect emotions at sentence level. We consider as positive examples the sentences that are included in the summary, and negative examples the rest of the sentences. Note that we train 7 different models, one for each emotion. We show the results obtained in Table <ref>. We observe that BART-FT-JOINT outperforms our EAP considerably by 1.5% in Rouge-L score. However, we see that the BERT-based approach is much closer to the performance of the unuspervised EAP, outperforming it by less than 1% in Rouge-L and F1. § HYPERPARAMETERS In this section we detail the values of the hyperparameters used and the search space considered in the development of our EAP. First in terms of the constant c in Equation <ref>, we experiment with values in the range 0.1 → 0.5 but observed that 0.1 works well. We mentioned that the minimum frequency of a word necessary for selection in our vocabulary V is 20. We also experimented with other values ranging from 5 to 50. The threshold t from Equation <ref> is emotion-specific and inferred using the validation set. We experiment with values between 0.2 and 0.7 and observed that 0.35 works well in general. § MODEL ANALYSIS To offer additional insights into our approach, we show in Figure <ref> an analysis on the effect of the top relevant terms on the performance of EAP. For each emotion, we experiment with completely dropping the top k most relevant terms (i.e., words) in the graph, with k ranging from 1 to 40 and report the average performance obtained. This analysis can be seen as a way to measure the reliance of EAP and the top relevant words. We observe that the performance drops considerably while dropping the first 28 terms and the starts to plateau. § EXTRACTIVE SUMMARIZATION RESULTS IN TERMS OF F1 In Table <ref> we present the performance on extractive summarization in terms of F1. While Rouge captures the overlap between extracted summaries and human references at word level, F1 measures the number of extracted sentences from the post that are correctly part of the gold summary (human references). Specifically, we compute F1 as if we dealt with a traditional classification problem. For every emotion, the sentences belonging to the trigger summaries are positive examples, and all the other sentences are negative examples. If our EAP model selects a sentence that does not appear in the trigger summary, we view it as a false positive. On the other hand, if our EAP model does not extract a sentence which belongs to the trigger summary, we count it as a false negative. We calculate F1 as the harmonic mean between precision and recall.
http://arxiv.org/abs/2306.04487v1	20230607145721	Embracing Uncertainty: Adaptive Vague Preference Policy Learning for Multi-round Conversational Recommendation	[ "Gangyi Zhang", "Chongming Gao", "Wenqiang Lei", "Xiaojie Guo", "Shijun Li", "Lingfei Wu", "Hongshen Chen", "Zhuozhi Ding", "Sulong Xu", "Xiangnan He" ]	cs.IR	[ "cs.IR" ]	^1University of Science and Technology of China, ^2 Sichuan University, ^3 JD.COM Silicon Valley Research Center, ^4 JD.COM <ccs2012> <concept> <concept_id>10002951.10003317.10003331</concept_id> <concept_desc>Information systems Users and interactive retrieval</concept_desc> <concept_significance>500</concept_significance> </concept> <concept> <concept_id>10002951.10003317.10003347.10003350</concept_id> <concept_desc>Information systems Recommender systems</concept_desc> <concept_significance>500</concept_significance> </concept> <concept> <concept_id>10002951.10003317.10003331.10003271</concept_id> <concept_desc>Information systems Personalization</concept_desc> <concept_significance>300</concept_significance> </concept> <concept> <concept_id>10003120.10003121.10003129</concept_id> <concept_desc>Human-centered computing Interactive systems and tools</concept_desc> <concept_significance>300</concept_significance> </concept> </ccs2012> [500]Information systems Users and interactive retrieval [500]Information systems Recommender systems [300]Information systems Personalization [300]Human-centered computing Interactive systems and tools Conversational recommendation systems (CRS) effectively address information asymmetry by dynamically eliciting user preferences through multi-turn interactions. Existing CRS widely assumes that users have clear preferences, i.e., users have a firm belief about the fine-grained preference for one or multiple target items. Under this assumption, the agent will completely trust the user feedback and treat the accepted or rejected signals as strong indicators to filter items and reduce the candidate space, which may lead to the problem of over-filtering. However, in reality, users' preferences are often vague and volatile, with uncertainty about their desires and changing decisions during interactions. To address this issue, we introduce a novel scenario called Vague Preference Multi-round Conversational Recommendation (VPMCR), which considers users' vague and volatile preferences in CRS. VPMCR employs a soft estimation mechanism to assign a non-zero confidence score for all candidate items to be displayed, naturally avoiding the over-filtering problem. In the VPMCR setting, we introduce an solution called Adaptive Vague Preference Policy Learning (AVPPL), which consists of two main components: Uncertainty-aware Soft Estimation (USE) and Uncertainty-aware Policy Learning (UPL). USE estimates the uncertainty of users' vague feedback and captures their dynamic preferences using a choice-based preferences extraction module and a time-aware decaying strategy. UPL leverages the preference distribution estimated by USE to guide the conversation and adapt to changes in users' preferences to make recommendations or ask for attributes. Our extensive experiments demonstrate the effectiveness of our method in the VPMCR scenario, highlighting its potential for practical applications and improving the overall performance and applicability of CRS in real-world settings, particularly for users with vague or dynamic preferences. Embracing Uncertainty: Adaptive Vague Preference Policy Learning for Multi-round Conversational Recommendation Gangyi Zhang^1, Chongming Gao^1, Wenqiang Lei^2, Xiaojie Guo^3, Shijun Li^1, Lingfei Wu^3, Hongshen Chen^4, Zhuozhi Ding^4, Sulong Xu^4 and Xiangnan He^1 July 31, 2023 ============================================================================================================================================================= § INTRODUCTION Conversational recommendation systems (CRS) have drawn a lot of research attention recently. These systems interact with users to elicit preferences, understand motivations, and address the long-standing information asymmetry problem <cit.>. Despite considerable progress, CRS is far from mature, and researchers have focused on specific scenarios <cit.> to address particular challenges. One widely adopted scenario <cit.> is Multi-round Conversational Recommendation (MCR), where the system can ask for attributes or make recommendations multiple times, and the user accepts or rejects accordingly. However, MCR assumes that users have a clear single preferred item in mind, which may not be realistic, as users may have more than one preferred item in mind. To address this, the Multi-Interest Multi-round Conversational Recommendation (MIMCR) scenario <cit.> was proposed, allowing users to have multiple preferences. In this setting, a user may accept multiple attribute instances (e.g., red and black) of an attribute type (e.g., color). Despite the improvement, MIMCR can still fall short because it assumes that users have clear preferences in mind during the conversation. This can be impractical as users' preferences can be vague or change dynamically over time, leading to randomness in their answers and potential regret for previous choices. In practical applications, users exhibit vague or dynamic preferences, but MIMCR (or MCR) fails to account for the uncertainty in users' feedback, treating it as a hard indicator to filter the candidate item set. This results in over-filtering, as numerous potential items are removed when the user selects or does not select corresponding attributes. In Fig. <ref> (a), we illustrate a toy example showing a conversation (tailored for vague settings) under the MIMCR scenario. The CRS incorrectly interprets the user's non-clicking attributes (i.e., “plaid” in the first turn) and removes potential target items (i.e., “item-1” in the first turn), causing the user's preference distribution over items to collapse suddenly as shown in the left side of Fig. <ref> (b). This wrong inference will naturally affect the reasoning of the subsequent conversation, leading to the wrong preference estimation (i.e., in Fig. <ref> (a), the “black” color of “item-1” was not displayed in the third turn). To address over-filtering in MIMCR and MCR and maintain diversity and accuracy in the CRS, we propose a new scenario called Vague Preference Multi-round Conversational Recommendation (VPMCR). This scenario uses a soft estimation mechanism to account for users' vague or dynamic preferences by assigning non-zero confidence scores to all candidate items, avoiding the rigid filtering strategy of MIMCR and MCR. Fig. <ref> (c) shows an example of the VPMCR, which, in contrast to MIMCR, captures changes in preference distribution of the entire item space as shown in the right side of Fig. <ref> (b). In the VPMCR scenario, several challenges need to be addressed, including estimating the uncertainty of the user's vague feedback, capturing the user's dynamic preference throughout the conversation, and making conversational decisions that consider the user's vague or dynamic preferences. To tackle these challenges, we propose an enhanced solution called Adaptive Vague Preference Policy Learning (AVPPL), which consists of: 1. Uncertainty-aware Soft Estimation (USE): USE estimates the uncertainty of the user's vague feedback in each turn using a choice-based preference extraction method. It captures both explicit and implicit preferences (distinguished based on whether the user explicitly clicks the item), effectively estimating the uncertainty of users' vague feedback. To capture users' dynamic preferences, USE employs a time-aware preference decay strategy, which gives more weight to recent preferences while gradually reducing the influence of historical preferences. 2. Uncertainty-aware Policy Learning (UPL): Leveraging the preference distribution estimated by USE, UPL implements a unified policy learning framework to guide the conversation and adapt to changes in the user's preferences to make recommendations or ask for attributes. The soft estimation scores from USE's preference distribution are utilized as edge weights to construct a dynamic heterogeneous graph of the conversation. We also introduce a preference-guided action pruning strategy to expedite the RL sampling process. To address the challenges in the VPMCR scenario, particularly considering the uncertainty of users' vague feedback, we employ a Deep Q-Network (DQN) algorithm for UPL. In summary, our contributions are as follows: * We identify the limitations of existing CRS settings and introduce the VPMCR scenario, which accounts for users' vague and volatile preferences in CRS. * We propose the AVPPL solution for the VPMCR setting, utilizing a unified policy learning framework to make decisions that consider users' current vague preferences and account for their fading historical preferences. * Our extensive experiments on four real-world datasets demonstrate the effectiveness of AVPPL in the VPMCR scenario, highlighting its potential for practical applications. § RELATED WORK We briefly introduce the related works in conversational recommendation, reinforcement learning, and graph learning. §.§ Conversational recommendation system (CRSs) is a novel solution to recommendation that leverage natural language to effectively elicit dynamic user preferences that align with their real needs through multiple rounds of real-time interaction. CRS is considered to be a cutting-edge discipline that incorporates dialogue systems, recommendation systems, and interactive systems <cit.>. According to the focus on different functions and settings, existing CSR methods can be roughly divided into two types: dialogue-based recommendation <cit.> and multi-round conversational recommendation (MCR) <cit.>. In this work, we focus on the MCR setting. MCR is considered to be the most realistic setting in CRS. Unlike dialogue-based recommenders that need to extract information or generate responses through raw natural language <cit.>, MCR focuses on the core logic of the interaction strategy which involves asking questions <cit.> and making recommendations. The traditional MCR setting allows users to select only one preferred attribute value at a time, which restricts users' expression in the interaction. To overcome this issue, <cit.> propose the MIMCR setting, where a user is allowed to select multiple options for a certain attribute. Though effective, they follow the recommendation philosophy in MCR to directly filter out the items that the user has not mentioned by attributes, which leads to failure as users may not be sure what they want precisely. In our proposed VPMCR setting, we specifically consider users' vague preferences and adjust the recommendation mechanism to consider the items with unmentioned attributes, which better reflect users' needs. §.§ RL-based Recommendation Reinforcement Learning (RL) is a type of Machine Learning. It considers how an agent (e.g., a machine) should automatically make decisions within a specific context to pursue a long-term goal. The agent learns and adjusts its policy based on the reward feedback (i.e., reinforcement signals) given by the environment. Recently, RL has shown its effectiveness in recommendation <cit.>. As fitting user interest is not a bottleneck for now, recommenders care more about users' long-term satisfaction <cit.>. For instance, <cit.> use RL to generate the proper questions that can maximally make the system help users search desired products. <cit.> integrate causal inference into offline RL to maximize users' long-term satisfaction by removing filter bubbles. <cit.> propose an RL-based dispatching solution for ride-hailing platforms that can conduct robust and efficient on-policy learning and inference while being adaptable for full-scale deployment. In this work, we use RL to learn a policy that can automate question-asking and item recommendation. §.§ Graph-based Recommendation Graph-based recommender systems have drawn a lot of research attention <cit.>. By arranging the various entities (e.g., users, items, and attributes) in a heterogeneous graph, we can leverage lots of properties in modeling the collaborative signals. In CRS, the knowledge graph is utilized in enriching the system with additional knowledge <cit.>. For example, to better understand concepts that a user mentioned, <cit.> propose to incorporate two external knowledge graphs (KGs): a word-oriented KG providing relations (e.g., synonyms, antonyms, or co-occurrence) between words and an item-oriented KG carrying structured facts regarding the attributes of items. With the increasing of nodes, the computational overhead is too large to satisfy the requirement of real-time interaction. Hence, we propose a pruning strategy to overcome this work. § PROBLEM DEFINITION Vague Preference Multi-round Conversational Recommendation (VPMCR). In the VPMCR scenario, we consider a dynamic conversation between a user and a conversational recommendation system (CRS). The user has a clear preference space, denoted as 𝒞_CI (e.g., "style" in Fig. <ref>), and a vague preference space, denoted as 𝒞_VI (e.g., "color" and "pattern" in Fig. <ref>). The conversation begins with the user specifying a query attribute p_0 (e.g., "T-shirt"), which initializes the candidate item set containing all relevant items (e.g., all "T-shirts") and the candidate attribute set containing all attributes of those items. During the conversation, the CRS can either ask questions about attributes or provide recommendations. When the CRS asks questions, the user responds accordingly with their behavior depending on whether the attribute type c belongs to their clear or vague preference space. If c ∈𝒞_CI, the user honestly accepts or rejects the displayed attributes. However, if c ∈𝒞_VI, the user may randomly accept or reject a potentially preferred attribute. When the CRS provides recommendations, the user can accept or reject one or more items from the recommended set 𝒱_rec. The conversation proceeds through multiple iterations of the CRS asking/recommending and the user responding, until a successful recommendation is made or the maximum number of turns is reached. The VPMCR scenario differs from previous MCR or MIMCR settings in that it does not filter 𝒱_cand based on the user's clicking or non-clicking attributes. Instead, it only removes 𝒱_rec from 𝒱_cand when the recommendation fails. Additionally, all candidate attributes linked to candidate items are maintained in 𝒫_cand. The main challenges in the VPMCR scenario include estimating the uncertainty of the user's vague feedback, capturing the user's dynamic preference throughout the conversation, and making conversational decisions that consider the user's vague or dynamic preferences. § METHODOLOGY To address the challenges in the Vague Preference Multi-round Conversational Recommendation (VPMCR) scenario, we propose the Adaptive Vague Preference Policy Learning (AVPPL) solution. AVPPL consists of two main components: Uncertainty-aware Soft Estimation (USE) and Uncertainty-aware Policy Learning (UPL). The USE component estimates the uncertainty of users' vague feedback and captures their dynamic preferences, while the UPL component leverages the preference distribution estimated by USE to guide the conversation and adapt to changes in users' preferences. By incorporating the VPMCR scenario and the AVPPL solution, we aim to improve the overall performance and applicability of conversational recommendation systems in real-world settings, particularly for users with vague or dynamic preferences. §.§ Uncertainty-aware Soft Estimation Uncertainty-aware Soft Estimation (USE) aims to estimate the uncertainty of the user's vague feedback in each turn by considering both explicit and implicit preferences. USE focuses on understanding users' decision-making processes <cit.>, which reflect the trade-offs they make when providing non-binary feedback. To capture users' dynamic preferences throughout the conversation, USE employs a time-aware preference decay strategy that combines users' recent preferences with fading historical preferences. In the VPMCR setting, we model the signals of clicking and non-clicking separately based on the decision-making consciousness of users in choice-based questions. For each turn, preference implied by clicking and non-clicking choices is extracted, then the decay mechanism is used to weaken the preference of historical turns. Finally, in the soft estimation, we derive the user's preference distribution toward items and attributes. §.§.§ Preference Extraction with Choice-based Approach In each turn of interaction, user preference can be divided into personalized user preference and choice-based preference. We adopt a common personalization modeling strategy <cit.> to represent the static preference of user u for item v as: w_vu = e_u^⊤ e_v, where e_u and e_v denote the embedding vectors of user u and item v, respectively. To model users' decision-making processes, USE employs a choice-based preference extraction method that considers the trade-offs users make when providing non-binary feedback. This approach captures both explicit preferences (when users actively select an attribute) and implicit preferences (when users do not select an attribute but may still have some preference for it) by estimating the importance of clicking choices and non-clicking choices separately. For item v, we estimate the importance of clicking choices and non-clicking choices, respectively. In turn t, the formula for capturing the user's explicit preference towards clicking choices 𝒫_click^(t) and implicit preference towards non-clicking choices 𝒫_noclick^(t) are shown as follows: w_vclick^(t) = 1/\|𝒫_click^(t)\|∑_p ∈𝒫_click^(t)(e_v^⊤ e_p - w_vavg^(t)), w_vnoclick^(t) = 1/\|𝒫_noclick^(t)\|∑_p ∈𝒫_noclick^(t)(e_v^⊤ e_p - w_vavg^(t)), where \|𝒫_click\| and \|𝒫_noclick\| indicates the number of attributes related to clicked items and non-clicked items, respectively. w_vavg^(t) measures the average preference towards all unshown attribute types and is used to mitigate over-estimation of the system-displayed choices, which is defined as: w_vavg^(t) = ∑_p ∈𝒫_noshow^(t) e_v^⊤ e_p / \|𝒫_noshow^(t)\|, where e_v and e_p represent the embedding vectors of item v and attribute p, respectively, and 𝒫_noshow^(t) refers to the set of all unshown attributes associated with the specified attribute type in turn t. By considering both the personalized preferences and the choice-based preference in turn t, the users' preference for item v in turn t can be calculated as: w_v^(t) =σ (w_vu + λ_1 w_vclick^(t) + λ_2 w_vnoclick^(t)), where σ is the sigmoid function. λ_1 and λ_2 represent the information intensity coefficients of the information contained in the user's clicked attribute and the user's unclicked attribute, respectively. §.§.§ Time-aware Preference Decay In dynamic conversation interactions, the user's global preferences should be viewed as a combination of preferences across all turns. We employ a decay mechanism to adjust the influence of historical preferences, enabling the model to focus more on the user's real-time feedback in the current turn and mitigating the over-emphasized impact related to the user's clicking behavior. To combine the user's current preference with historical decay preferences, the user's global preference toward the item is estimated as follows: w_v^(t) = w_v^(t) + γ w_v^(t-1), which can be unfolded as: w_v^(t) = ∑_i=0^t-1γ^t-i-1 w_v^(i), where γ is a decay factor satisfying 0 ≤γ≤ 1. The farther the interaction history is from the current turn, the less impact it will have on the current turn. γ should be carefully chosen to balance the influence of historical preferences and the user's real-time feedback. Finally, for turn t, the user's global preference distribution for items f_u^(t)(v) can be calculated by estimating the user's global preference w for each item v in the candidate item set 𝒱_cand. When the size of the candidate item set is n, the soft estimation distribution for items is shown as follows: f_u^(t)(v) = { w_v_1^(t), w_v_2^(t), ..., w_v_n^(t)} Similarly, by replacing items with attributes in the aforementioned equations, we derive the user's global preference distribution towards the candidate attribute set 𝒫_cand. When the size of the candidate attribute set is m, the soft estimation for attributes is depicted by the following distribution: f_u^(t)(p) = { w_p_1^(t), w_p_2^(t), ..., w_p_m^(t)} §.§ Uncertainty-aware Policy Learning (UPL) In the Uncertainty-aware Policy Learning (UPL) module, we address the challenge of making conversational decisions that consider users' vague or dynamic preferences in a Conversational Recommendation System (CRS). We utilize the preference distribution estimated by the Uncertainty-aware Soft Estimation (USE) module to guide the conversation and adapt to preference changes. By constructing a dynamic heterogeneous graph and employing a preference-guided action pruning strategy, we streamline the Reinforcement Learning (RL) sampling process. We adopt a Deep Q-Network (DQN) algorithm for UPL, which is effective in learning action policies in dynamic environments. The UPL module, as part of the Adaptive Vague Preference Policy Learning (AVPPL) solution, aims to enhance CRS performance for users with vague or dynamic preferences. §.§.§ Graph-based Conversation Modeling In the Graph-based Conversation Modeling section, we represent the current state of the conversation at turn t using a dynamic undirected graph 𝒢_u^(t) = (𝒩^(t), 𝐀^(t)). This graph is a subgraph of the heterogeneous graph, which consists of users, items, and attributes. The dynamic graph is constructed based on the preference distribution estimated by the Uncertainty-aware Soft Estimation (USE) module, which sets it apart from previous work <cit.>. The nodes in the graph, 𝒩^(t), are defined as follows: 𝒩^(t)={u}∪𝒫_click∪𝒫_nclick∪𝒫_cand^(t)∪𝒱_sample^(t) Here, 𝒫_click and 𝒫_nclick represent the user's historical clicking and non-clicking attributes throughout the conversation. 𝒫_cand^(t) and 𝒱_sample^(t) indicate the candidate attribute set and the randomly sampled candidate item set at turn t, respectively. The weighted adjacency matrix, 𝐀^(t), is defined as: [ A_i, j^(t)={[ w_v^(t), if n_i=u, n_j∈𝒱; 1, if n_i∈𝒱, n_j∈𝒫; 0, otherwise ]. ] The weight w_v^(t) denotes the user's estimated preference for the item v, which is calculated via Eq. (<ref>) within the USE module. The weights of the edge between the item and its associated attributes are set to 1. To address the issue of a large number of candidate items in the VPMCR setting, we implement a sampling strategy for candidate items 𝒱_sample^(t) by randomly selecting from the candidate items in each turn t. This node sampling strategy is similar to node dropout <cit.> in graph learning and helps reduce the scale of the dynamic graph while enhancing training convergence and the robustness of graph learning <cit.>. We employ a Graph Convolutional Network (GCN) <cit.> to refine all node representations ℰnode by capturing the information of changing interrelationships for the current conversation state 𝒢_u^(t): ℰ_node = GCN(𝒢_u^(t)). Following the design from Deng et al. <cit.>, the explicit clicking history session 𝒫_click is encoded by a Transformer <cit.> to learn the sequence information of the conversation history ℐ_his^(t): ℐ_his^(t)= Transformer(e_click^1, e_click^2, ... e_click^l). Here, l denotes the length of the sequence and \|𝒫_click\| is the number of clicking attributes in a whole conversation. The input to the Transformer is an embedding sequence corresponding to a sequence of clicking attributes 𝒫_click, where each embedding e_click is learned from the embeddings in ℰ_node. Finally, the final conversation state representation S_conv^(t) is obtained by a mean polling layer. s_conv^(t)= MeanPool(ℐ_his^(t)). §.§.§ Preference-guided Action Pruning In the unified policy learning framework <cit.>, the action space includes all candidate attributes and all candidate items. Such a large action space in reinforcement learning can negatively impact sampling efficiency. To address this issue, we propose an effective action-pruning strategy based on user preferences. As described in Section <ref>, we can estimate the user's preference distribution f_u. Item v or attribute p with higher confidence values are more likely to be preferred by the user. To construct the pruning action space 𝒜_action^(t), we first calculate the user's preference distribution over items using Eq. (<ref>) in USE. Then, we select the top-N items 𝒱_top^(t) with the highest confidence and include them in the pruning action space. Additionally, we select the top-N attributes 𝒫_top^(t) with the highest confidence and add them to the pruning action space. The pruning action space is defined as: 𝒜_action^(t) = 𝒱_top^(t) + 𝒫_top^(t) §.§.§ Deep Q-Network for Policy Learning Following UNICORN <cit.>, we introduce a unified policy learning framework that can systematically integrate the conversation and recommendation component to solve the decision making problem in CRS. We employ a Deep Q-Network (DQN) algorithm to address the challenge of making conversational decisions that consider users' vague or dynamic preferences in CRS. The DQN algorithm has been proven effective in learning action policies in dynamic environments, such as Markov Decision Processes (MDPs), making it well-suited for predicting the next decision based on a series of historical choices. The Q-value function Q(s_t, a_t) of a policy π is defined to measure the expectation of the accumulated rewards based on the state s and the action a. We adopt the same Dueling DQN and prioritized experience replay as in UNICORN <cit.> to optimize the Q-function Q^∗(s_t, a_t): Q^(s_t, a_t) = max_π𝔼[R_t+1 + γmax_a Q^π(s_t+1, a) \| s_t, a_t] where π is the policy, R_t+1 is the reward at turn t+1, γ is the discount factor, and Q^π(s_t+1, a) is the estimated action-value function for the next state and action. For policy learning, the input conversation state s_conv^(t) is learned by the graph-based conversation modeling module. The pruning action space 𝒜_action^(t) is determined by employing a preference-guided action pruning strategy, which expedites the RL sampling process. The reward R follows the previous MCR setting <cit.>, and the detailed settings will be described in the experimental section. § EXPERIMENTS In this section, we evaluate the proposed method in VPMCR. We use the following research questions (RQs) to guide our experiment. RQ1. How does our AVPPL method perform in comparison to state-of-the-art CRS methods in the VPMCR scenario? * RQ2. How do the key components contribute to the overall performance of our AVPPL method? * RQ3. How do the hyperparameters of our method affect its performance? * RQ4. Can AVPPL effectively make recommendations based on users' vague preferences during the conversation? §.§ Dataset Description We introduce four datasets, whose statistics are shown in table <ref>. * Yelp and LastFM <cit.>: Yelp[https://www.yelp.com/dataset/] and LastFM[https://grouplens.org/datasets/hetrec-2011/] datasets are used for business and music artist recommendations, respectively. We follow the multiple attribute question settings, retaining the original attribute instances in LastFM and Yelp, and extracting the attribute types they depend on. In Yelp, we utilize the 2-layer taxonomy designed by <cit.>, resulting in 29 categories in the first layer as attribute types and 590 attributes in the second layer as attribute instances. For LastFM, we follow <cit.>, retaining the original 8,438 attributes as attribute instances and employing clustering to obtain 34 attribute types. * Amazon-Book <cit.>: Amazon Book[http://jmcauley.ucsd.edu/data/amazon.] is a widely used product recommendation dataset. We retain users and items with at least 10 interaction records and consider entities (e.g., science fiction) and relations (e.g., genre) in the knowledge graph as attribute instances and attribute types, respectively. * MovieLens: Movielens is a movie rating dataset. We adopt MovieLens-20M[https://grouplens.org/datasets/movielens/] dataset, following <cit.>, and retain interactions with ratings greater than 3. We select entities and relations in the knowledge graph (KG) as attribute instances and attribute types, respectively. §.§ Experimental Setup §.§.§ User Simulator in VPMCR Conversational recommendation systems (CRSs) are interactive and require training and evaluation through user interactions. However, obtaining data directly from users in a research lab is impractical, so employing a user simulator is a common practice <cit.>. The user simulator simulates users' interaction records in the training and test sets. In the VPMCR scenario, we adopt a user simulation strategy similar to that in MIMCR <cit.>, considering the reasonableness of the multi-interest setting. For a given observed user-items interaction pair (u, 𝒱_u), we simulate a conversation session. Each item v in 𝒱_u is treated as a ground-truth target item, and the union of attribute types and attributes associated with each item are considered as the user's ground-truth intent space 𝒞_u and ground-truth attribute space 𝒫, respectively. The conversation session is initialized when the user specifies a common attribute p_0 to all 𝒱_u, and the user's clear preference space 𝒞_CI and user's vague preference space 𝒞_VI are randomly initialized from the ground-truth intent space 𝒞_u. During the interaction, we use the ground-truth attribute space 𝒫 as a criterion for the user simulator's acceptance or rejection. The detailed interaction process follows the “system asks or recommends and user responds” rules outlined in Section <ref>. §.§.§ Action Inference The action inference involves either recommending items or asking an attribute-related question. (1) Recommendation: If an item v in the action space has the highest Q-value, the CRS make a recommendation, resulting in a new action space 𝒜^(t) = 𝒱_top^(t). (2) Questioning: If an attribute p in the action space has the highest Q-value, the CRS asks a question. In a multiple-choice setting, a two-level decision process is employed: first selecting an attribute type, then presenting several attributes within that type. A sum-based strategy <cit.> is used to determine the attribute type for questioning. Specifically, Q-values of all attributes within the attribute action space 𝒫_top^(t) are summed and allocated to their respective attribute types. The attribute type with the highest total value is selected for questioning, and the top K attributes with the highest Q-values within that type are presented to the user. §.§.§ Baselines We use the following baselines. For fairness, all baselines are compared in the VPMCR scenario. * Max Entropy. It selects the attribute with the maximum information entropy and inversely relates the probability of making a recommendation to the length of candidate items. * CRM <cit.>. It employs a belief tracker to record user preferences as conversation state representation vectors and applies them to a reinforcement learning decision module and factorization machine (FM) recommendation modules. * EAR <cit.>. This method adopts the three-stage solution framework to enhance the interaction between the conversation component and the recommendation component. * SCPR <cit.>. SCPR leverages graph-based path reasoning to prune useless candidate attributes. It separates attribute selection from reinforcement learning, which is only used for determining when to ask and recommend. * UNICORN <cit.>. A state-of-the-art method for the MCR scenario that proposes a unified policy learning framework using dynamic graphs to model conversation states and employs a preference-based scoring to reduce reinforcement learning action space. * MCMIPL <cit.>. It considers the user's multi-interest space and extends the MCR scenario to a more realistic MIMCR scenario. This method also follows the graph-based unified reinforcement learning framework and employs the multi-interest encoder to learn the conversation state. §.§.§ Training Details We divide each dataset into training, validation, and testing sets using a 7:1.5:1.5 ratio. In the user simulator, we set the maximum conversation turn T to 15 and the number of target item sets 𝒱_u for the user to 2. We initialize the user's vague preference space and clear preference space using uniform sampling. In the Uncertainty-aware Soft Estimation (USE) module, we set the information intensity coefficients λ_1 and λ_2 to 0.1 and 0.01, respectively, and the decay discount factor to 0.1. In the Uncertainty-aware Policy Learning (UPL) module, when constructing the dynamic graph, random sampling is employed to select candidate items when the available number of candidates exceeds 5000. The graph-based conversation modeling architecture consists of two GNN layers and one Transformer layer. We fix the embedding size and hidden size at 64 and 100, respectively. For action pruning in RL, we set the size of the item space and attribute space to 10 (i.e., N=10). For action inference, we set the number of attributes displayed to the user to 2 (i.e., K=2). Following <cit.>, we use TransE <cit.>, implemented throughKE <cit.>, to pre-train the graph node embeddings. During DQN training, we ensure a fair comparison with other benchmarks by conducting online training for 10,000 episodes and adopting the same reward setting with r_rec-suc=1, r_rec-fail=-0.01, r_ask-suc=-0.1, r_ask-fail=-0.1, and r_quit=-0.3. We set the experience replay buffer to 50,000 and the mini-batch size to 128. The learning rate is fixed at 1e-4 with an L2 regularization of 1e-6, using the Adam optimization algorithm. §.§.§ Evaluation Metrics This study employs success rate (SR@T) and average turn (AT) to evaluate the recommendation performance. SR@T measures the percentage of successful recommendations within T turns. A higher SR@T indicates better performance. AT measures the average number of turns in a conversation. A lower AT demonstrates greater efficiency. We also use hierarchical normalized discounted cumulative gain (hDCG@(T, K)) to evaluate the ranking performance of the top-K recommendations within T turns. hDCG assigns higher scores to recommendations that are more relevant to the user. A higher nDCG@(T, K) indicates a better ranking performance. §.§ Performance comparison of AVPPL with existing models (RQ1) Table <ref> reports the SR@15, AT and hDCG@(15, 10) for AVPPL and baseline models. AVPPL achieved significantly higher scores on all metrics and datasets, demonstrating its effectiveness in the VPMCR scenario. The performance gap was largest on MovieLens, likely because movie recommendations are a relatively simple task and AVPPL better models user preferences for items. Fig. <ref> shows the relative success rate (SR) of each model at every turn compared to the MCMIPL baseline (represented by the dark green line at y=0). Observing the variation trend of curves in Fig. <ref>, we have the following findings: AVPPL almost consistently and substantially surpassed all baselines over the entire conversation session across datasets. Specifically, AVPPL achieved a high recommendation success rate in the first a few turns on MovieLens, demonstrating its ability to precisely capture users' preferences. * As the conversation continues, the performance gap between AVPPL and other baselines widened, especially compared to Max Entropy. The lack of an adaptive policy caused Max Entropy to require excessive turns, while AVPPL dynamically predicts the best action at each turn based on the user responses and the personalized recommendation policy learned via reinforcement learning. * Reinforcement learning-based methods like CRM and EAR lag behind more advanced models, as they directly apply RL to a large decision space without effectively representing the conversation state, hindering optimal policy learning. In contrast, graph-based models such as SCPR, UNICORN, and MCMIPL leverage graph structures to achieve state-of-the-art performance on some datasets, but still fall short of AVPPL's performance. §.§ Evaluating Key Design in AVPPL (RQ2) §.§.§ Key Components of AVPPL We examine the effectiveness of Uncertainty-aware Soft Estimation (USE), our framework's main design, in guiding conversations and adapting to user preference changes in VPMCR scenarios. We separately remove the USE module for items and attributes (Section <ref>) and replace them with a preference-based scoring strategy <cit.>, which models user preferences using historical click or non-click attributes as mixed signals. Table <ref> rows (a-b) display the ablation study results. Removing the USE module for both items and attributes significantly degrades performance across all datasets, emphasizing the importance of considering user preference uncertainty. The USE module allows our model to learn a sophisticated conversational state representation and prune a more reasonable action space for the Unified Policy Learning (UPL) module, enhancing the upper bound for unified policy learning. We also find that the USE component is more effective in measuring user preferences for items than attributes in VPMCR scenarios, suggesting that click behavior provides more direct item-related information. §.§.§ Key Components of USE Table <ref> rows (c-e) present the ablation experiments for the USE component. Row (c) shows that personalized information for user modeling is crucial; without it, the model cannot capture personalized preferences, severely limiting performance. Removing the average preference in Equation <ref> (Row (d)) degrades performance across all datasets, with LastFM suffering the most. This may be due to LastFM's numerous attributes and the significant impact of non-displayed attribute information on user preference estimation. Additionally, we remove the historical decay preference in time-aware preference decay (Row (e)), leading to performance degradation on three datasets except for MovieLens. On MovieLens, USE without decaying information reliably estimates preferences in the current turn, and recommendations succeed within 1-2 rounds. Thus, introducing historical decay preference in short interactive rounds may weaken preference inference on MovieLens. Overall, the results confirm the USE module's importance and the proposed AVPPL framework's effectiveness. §.§.§ VPMCR vs. MIMCR Scenarios To comprehensively evaluate AVPPL's effectiveness in modeling user preferences based on click behaviors, we relax the scenario assumption and employ the MIMCR scenario involving multi-choice question interactions. In MIMCR, user feedback signals are treated as strong indicators to filter items. Table <ref> compares AVPPL's performance with advanced baselines in the MIMCR scenario. Our method shows significant advantages on Yelp, Amazon-book, and Movielens datasets. On LastFM, although slightly inferior to MCMIPL in SR and AT, AVPPL outperforms all w.r.t. hDCG. These results confirm AVPPL's effectiveness in eliciting user preferences in multi-choice question scenarios, demonstrating its universality and effectiveness in handling both VPMCR and MIMCR scenarios. §.§ Model Parameter Analysis RQ3 The previous work on graph-based policy learning <cit.>, has conducted relevant hyperparameter analysis regarding policy learning. Here we focus on the analysis of the hyperparameter impact of the core module (USE) in AVPPL in the VPMCR scenario. Due to the limited space, we only present results for Yelp and Amazon-Book, but note that LastFM and Movielens exhibit similar trends. §.§.§ Hyperparameter Analysis in USE We identified two key hyperparameters: (1) The information intensity coefficients λ_1 and λ_2 control the importance of explicit versus implicit preferences. The results presented in Table <ref> show that larger λ_1 and smaller λ_2 resulted in higher success rates, indicating that explicit preferences (λ_1) are more crucial than implicit preferences (λ_2) in VPMCR. Notably, performance decreases when both λ_1 and λ_2 are large, especially for sparser datasets like Yelp, posing a challenge to the model's robustness. (2) The decay factor γ controls the trade-off between recent and historical preferences. Fig. <ref> shows that a moderate decay factor (0.6-0.8) performs best, suggesting that a balance between recent and historical preferences is optimal. Extreme values (0.1 and 1.0) perform poorly, indicating that disregarding historical preferences or solely relying on recent ones is suboptimal. §.§.§ Proportion of Vague Preferences We conducted experiments with varying vague preference proportions (0.1 to 1). In Fig. <ref>, higher success rates occurred at moderate vague preference proportions. With a moderate level of vague preferences (around 40-50%), the model balances the ability to utilize both vague and explicit preferences, resulting in better recommendations. However, when vague preferences dominated (over 70-80%), the model struggled to accurately determine user needs, hampering performance. §.§ Case Study RQ4 In this case study from the Yelp dataset (Fig. <ref>), the user initiated a conversation with a clear preference of finding a beverage shop, prompting the initialization of the user's distribution space across all potential locations. The user had a clear preference for “tea & coffee” but was vague about their preferences for “price” and “leisure food”. Our proposed method takes into account the user's click/non-click behavior to update the user's preference distribution on all beverage establishments accordingly. This is in contrast to the traditional approach of filtering out items based on click/non-click signals. After the third turn of conversation, the combination of the user's immediate feedback (clicking on “dessert” and not clicking on “smoothies” and historical feedback (“price” and “tea & coffee”) resulted in identifying two target items, “ID:69761” and “ID:25587”, with the highest preference estimate. § CONCLUSION We propose a realistic Vague Preference Multi-round Conversational Recommendation (VPMCR), which considers the user's vague and volatile preferences. By addressing the limitations of existing CRS scenarios and incorporating the VPMCR scenario and AVPPL solution, we aim to improve the overall performance and applicability of CRS in real-world settings, particularly for users with vague or dynamic preferences. We hope the findings will provide valuable insights into developing user-centric CRSs that can handle users' vague and dynamic preferences. In future work, we plan to explore more sophisticated vague preference modeling and more efficient policy learning techniques to further enhance the performance and generalizability of AVPPL in VPMCR. ACM-Reference-Format
http://arxiv.org/abs/2306.03502v1	20230606084102	Russo-Ukrainian War: Prediction and explanation of Twitter suspension	[ "Alexander Shevtsov", "Despoina Antonakaki", "Ioannis Lamprou", "Ioannis Kontogiorgakis", "Polyvios Pratikakis", "Sotiris Ioannidis" ]	cs.SI	[ "cs.SI", "cs.AI", "cs.LG" ]	Pseudo session-based recommendation with hierarchical embedding and session attributes Yuta Sumiya1 Ryusei Numata2 Satoshi Takahashi10000-0001-5573-7841 ====================================================================================== On 24 February 2022, Russia invaded Ukraine, starting what is now known as the Russo-Ukrainian War, initiating an online discourse on social media. Twitter as one of the most popular SNs, with an open and democratic character, enables a transparent discussion among its large user base. Unfortunately, this often leads to Twitter's policy violations, propaganda, abusive actions, civil integrity violation, and consequently to user accounts' suspension and deletion. This study focuses on the Twitter suspension mechanism and the analysis of shared content and features of the user accounts that may lead to this. Toward this goal, we have obtained a dataset containing 107.7M tweets, originating from 9.8 million users, using Twitter API. We extract the categories of shared content of the suspended accounts and explain their characteristics, through the extraction of text embeddings in junction with cosine similarity clustering. Our results reveal scam campaigns taking advantage of trending topics regarding the Russia-Ukrainian conflict for Bitcoin and Ethereum fraud, spam, and advertisement campaigns. Additionally, we apply a machine learning methodology including a SHapley Additive explainability model to understand and explain how user accounts get suspended. § INTRODUCTION On 24 February 2022, Russia invaded Ukraine, also known now as the Russo-Ukrainian War, which sparked an online conversation on social media, several disputes for the form of social media usage, censorship, provocative posts <cit.> and finally, a restriction of several social media including Twitter from Russia <cit.>. Twitter is one of the most important social networks with millions of registered users, providing an open platform that enables a transparent and democratized discussion among the large masses. Unfortunately, the nature of these open media can lead to manipulation and propaganda as well. Social media moderators handle this phenomenon by either account suspension and finally deletion, causing reactions from the user base since the main reason is not publicly clear. The analysis of the content posted by the users can shed light on the phenomenon of Twitter suspension and the factors that can lead to this. In the direction of this goal, we capture a significant part of the discourse on the Russo-Ukrainian War, by obtaining a dataset initiated on 23 February 2022 containing 107M tweets. We focus on the Twitter suspension and the characteristics (features) of the accounts that may lead to this phenomenon. In order to identify the reasoning behind a Twitter suspension decision, we extract multiple feature categories, containing 1565 unique features extracted from public account data. These features are utilized for the implementation of multiple machine learning classification models, and for further investigation, an explainability model (SHapley Additive exPlanations) is used, in order to identify the feature values providing a higher impact on the suspension decision. We manage to identify the exploitation of popular topics related to the Russo-Ukrainian War on Twitter. Specifically, the contributions of our study include: * The identification of spam and advertisement campaigns within this corpus. * The amplification of specific content, or spam tweets (via post share or retweet). * The reveal of scam campaigns taking advantage of the Russia-Ukrainian conflict for Bitcoin and Ethereum fraud. * The presentation of the characteristics of suspended accounts through the extraction and comparison of multiple feature categories. * The evaluation of our methodology in two different time periods in order to identify short and long-term features that can describe user suspension. Upon the paper's acceptance, our dataset and source code will be publicly available. § RELATED WORK Similar works on Twitter suspension focus on the suspension factors based on Twitter policy topics <cit.>, which can include the violation of Twitter rules and policies <cit.>, hateful and abusive activities <cit.>, violation of civil integrity <cit.> and spam campaigns <cit.>. One of the initial and highly influential works on Twitter suspension was from Vern Paxson <cit.>, where they examine a dataset of 1.8 billion tweets. They characterize the spamming methodologies of 1.1M suspended accounts posting 80M tweets, examine the features of these accounts, evaluate the abuse of URLs, and provide an in-depth analysis of five spam campaigns. Finally, this study first reveals and analyses the marketplace of spam-as-a-service on Twitter. Also, in <cit.> the authors detect compromised accounts in a dataset of 14M victims on Twitter and apply clustering for the suspended and deleted users. Similar to our study, in <cit.> after they obtain a Russian, Spanish, and English Twitter corpus regarding the Russia-Ukraine conflict during 2014, they analyze the suspension and deletion factors. The authors utilize multiple approaches of feature extraction based on n-grams, Latent Semantic Analysis, text embeddings, topics, emotions, and images and reveal the major differences between the deleted and suspended accounts. In <cit.> in a Twitter dataset of 2.7K suspended accounts they study how dedicated accounts ('trolls') are involved in spreading disinformation, the type of content they disseminate, and their influence on the information ecosystem. The authors in <cit.> explore the Russian trolls and the accounts acting on behalf of the Russian state, in a dataset of 170K control Twitter accounts. They highlight interesting quantitative covariates among the flagged/suspended accounts as an indication of Russian trolls. An additional work analyzing the Twitter suspension mechanism was done during the 2020 US Presidential Election period <cit.>. This work shows that suspended accounts have a higher probability to post hateful tweets, using hashtags related to conspiracy theories and belong to mostly younger accounts, in terms of account registration date. Most of the aforementioned works mainly mobilize machine learning techniques in their methodology. Explainability models in ML have also been incorporated in Twitter research towards prediction and sentiment analysis <cit.>, towards identification of bots <cit.>, or fake news detection <cit.>. Most of the recent studies concentrate on explainable ML implementations, where the models are utilized in order to describe the differences between the suspended and normal accounts. For example, in <cit.>, the authors analyze the Indian 2019 general elections dataset and compare the differences between three categories of accounts; normal, suspended, and restored. They show the differences between all three classes with the usage of SHAP explainability method. This approach reveals that suspended accounts, in comparison with other user categories have a higher retweet rate proportion, average unique hashtags count, and average number of tweets per hour. Additionally, there is a plethora of studies analyzing bot detection and suspension on Twitter <cit.>. For example, <cit.> provides a public API to inquire whether an account is a social bot or not, trained over thousands of Twitter users' account features. The most common approach towards this goal includes, as an initial step, the acquisition of a dataset through Twitter API <cit.> and a ground truth, which includes the labeling of users and tweets. This can be accomplished either by manual labeling through human experts <cit.>; through crowd-sourcing <cit.> including Amazon Mechanical Turk and Crowdflower; automatic by labeling from shortening services <cit.>; or consulting from external resources like online spam classification tools<cit.> or online blacklist services classification <cit.>. The ML approaches require the split of the dataset into the training and test sets and the feature extraction like in <cit.>. In <cit.> they study social spam bots by showing how Twitter applies detection and suspension, by bench-marking state-of-the-art techniques, in order to conclude that detection is challenging for humans and Twitter itself, while in <cit.> they present a model to increase the recall in bot detection, while they show several approaches to build classifiers including suspended user lists. Other relevant works on Twitter suspension warnings and patterns include <cit.>, where they demonstrate how suspension warnings on Twitter can influence hate speech. In <cit.> they study the properties of bullies and aggressors, by extracting text, user, and network-based attributes, as well as the features that distinguish them from regular users. They compare their results with the suspension and deletion of accounts of seemingly undetected users on Twitter. Additionally, authors in <cit.> explore the patterns of suspended users on Twitter, while they show that removing suspended users has no significant impact on the network structure. Linking the social network of Twitter and the suspended accounts, a study in a dataset of 41,352 suspended spammer accounts, <cit.> reveals the users connected to them, investigates link farming in the Twitter network and then explores the mechanisms to discourage this activity. Finally, in <cit.> they show a large Twitter community whose activity supports ISIS propaganda diffusion in varying degrees. They apply Iterative Vertex Clustering and Classification (IVCC) and leverage clustering and Twitter suspensions to infer positive case instances that give partition to the training set with 96% accuracy. § DATA For the purposes of our study, we collected a Twitter corpus related to the Russo-Ukrainian War. We used the Twitter API to retrieve public tweets using popular hashtags related to the selected topic (table: <ref>). Our data collection contains [group-separator=,]107735220 tweets from [group-separator=,]9851176 users starting from February 23, 2022. To label suspended accounts, we also use Twitter API on a daily basis to identify the exact date of account suspension. Based on this labeling method, we identify [group-separator=,]433466 suspended accounts and 86,630 deactivated accounts. In order to extract normal users with a high probability of being normal, we remove all suspended and deactivated accounts. § METHODOLOGY As mentioned earlier, in this study we focus on the type of content shared among the suspended accounts on Twitter, during the 2022 Russia-Ukrainian War. Towards this direction, we extract raw text from tweets of [group-separator=,]433466 suspended accounts with a total volume of 4.8M documents, by applying some primitive filtering (drop URL links and user mentions). Due to the large volume of extracted documents, the identification of shared content via manual analysis is a challenging task. To overcome this issue we translate posted documents via text embeddings. In our case, we use LaBSE (Language-agnostic BERT Sentence Embedding) <cit.> model which allows us to overcome two main issues; the multi-language similarity (since our dataset contains posts from a variety of languages) and the normalization of text length and semantics similarity (embeddings of texts with similar semantics are very close to each other). A common approach used to identify similar topics is to use similarity and clustering methods. However, this methodology is highly time-consuming, especially in our case with large volumes and high vector dimensionality of the extracted embeddings. In order to handle this issue we apply PCA dimensionality reduction. This procedure reduces vector dimensionality from 768 to only 20 and reduces the complexity of the text clustering. The developed vectors are clustered via the cosine similarity clustering algorithm which identifies [group-separator=,]48486 unique clusters. We utilize the centroid of each cluster in order to analyze the text of the shared content. Besides the shared content identification, we are also investigating whether the feature categories can contribute to a powerful and accurate model for detecting user suspension. This procedure includes the implementation of a model based on each separate feature category, as well as, a combination model that contains all the extracted features. Our methodology consists of a model creating a pipeline that includes feature selection, K-Fold cross-validation, and the measurement of the performance on two separated dataset portions. To develop a generalizable model, we select a restricted time window for the feature extraction and performance estimation. The time restriction helps reduce the model's complexity. In our case, we choose a time window of 21 days, which reduces the time required for user monitoring (in the case of a real-time application) and helps the ML model capture generic feature patterns. To identify the features that are effective in a long-term scenario, we extract two separate data portions; the first for a 21-day monitoring period to simulate a real-case scenario where the initial data are collected for feature selection, model fine-tuning, and initial evaluation; the second portion is used as unseen data for proper model performance evaluation and comparison. Testing the model on the second part of 21 days of data, allows us to measure its performance in a real-case scenario, where the model is fed with data points from different periods of time containing different activity patterns. The first dataset includes 21 days from February 23, 2022, to March 15, 2022, and represents the initial training sample. The second portion also contains exactly 21 days, but from a different time period, starting on March 16, 2002, until April 6, 2022. The rest of the paper will refer to the second data portion as the second test data. The extracted data portions contain 37,195 suspended accounts within the first 21 days and 11,716 suspended accounts within the second data portion. To extract normal users, we use an under-sampling methodology and randomly select an equal volume of normal users for each data period. Based on the first 21 days of data, we extracted the following feature categories: the profile, activity timing, textual, post embeddings, and graph embeddings. Our main goal in this study is to identify which of the presented feature categories are used by the Twitter suspension mechanism, as well as which feature values have the greatest impact on the model's decision. To achieve this, we create a model for each feature category and a combination model that contains all the extracted features. The following section explains the extracted feature categories. §.§ Profile features In this section, we describe the feature extraction of Twitter users' profile objects. The profile objects contain user metadata, including the username, the description, the number of followers and friends, etc. The profile features provide information about the account creator, e.g. how similar the username and screen name is, whether an account provides a long description, or whether it uses a default profile and background pictures. In the case of automatically created accounts, these features can be shared between multiple accounts, while the username and screen name have high similarity. Additionally, it is possible to evaluate the account dynamics according to the profile age, number of followers, number of friends, or number of post activities, using the following formula: by_age(A) = A/Days since account creation where A is the number of specific actions performed by a user (number of tweets/followers/friends etc.). In our case, we can also calculate the growth of these parameters/values, during the monitoring period and calculate the growth of friends, followers and number of tweets between the first and the last object of the monitoring feature extraction period. The formula that calculates the growth (G) is: G(A_start, A_end) = A_start + A_end/A_start where A_start is the value of actions from the first user object and A_end is the last action value, during the feature extraction period. Based on our collected dataset, we extract 54 profile features that are presented in table <ref>. §.§ Activity timing features A particular feature category is based on the statistical measurements of a user's actions (shared posts). We measure two categories of user activity patterns; the user actions according to which part of the day they happen (hour) and the index of the day within a week; the second category measure is the statistics of the collected user posts (tweets, retweets and quotes) that are collected during the feature extraction period. In the case of activity per hour of the day, we measure the number of user actions (tweets, retweets and quotes), according to the daily hours. Based on these measurements, we calculate the percentage of the user's activity and identify the hours within a day that users are most active. This feature provides the unique characteristic of the user activity during the day. Similarly, we compute the user activity, according to the days of the week. This feature may also provide unique information about the user activity; for example, identify whether the users are more active during the weekends. Furthermore, we measure the statistics of the user actions during the feature extraction period. For this purpose, we utilize a certain statistical measurement based on the action time (retweet time and quote time), where we calculate the time difference between the original post creation and the user response action time. This metric shows the average time between the user's reaction to other users' activity; the accounts that have a very "quick" reaction time with a high probability, we consider that they are bots (automated accounts that are controlled by computer software). Additionally, we identify the most common form of user activity, by measuring the percentage of user actions; tweets, retweets, and quotes. The combination of the described measurements provides information about the user activity timing, according to multiple characteristics like the hours of the day, the days of the week, and the general user profile preferences of content sharing. §.§ Textual features Except for the information that can be extracted from the user profile and actions pattern, we need to collect the content users share since Twitter users mostly communicate via content sharing. For this reason, we utilize two techniques of content analysis. Initially, we extract content metadata statistics, regarding the semantics users adopt to enrich their shared content and the text semantics via sentence embedding. In this section, we describe the first category based on the text metadata semantics. We separate this feature category into three subcategories: tweets, retweets, and quotes. For each one, we extract separate metadata since they are created under different contexts(e.g. RTs are not written by the user herself, but already created by another user). For each category, we retrieve the number of hashtags, URLs, and mentions. For each of these measurements, we take into account the minimum, maximum, average, and standard deviation. These metrics not only provide a picture of the volume but also describe the distribution of the particular feature usage. Also, since some of the hashtags may be very popular, while others may be uniquely created and used only by a particular user, we compute the Term Frequency - Inverse Document Frequency (TF-IDF), which shows whether a particular hashtag is trending across other users or not. This information allows us to identify whether an account utilizes mostly popular entities (hashtags, user mentions). The last measurement of content metadata we compute is the user vocabulary size. §.§ Post embedding features In the previous section, we describe how we extract metadata from the user-shared objects. However, this analysis lacks text semantics. Our collected dataset contains posts in 65 different languages, which makes the extraction of text semantics very challenging. In order to eliminate this issue, we use pre-trained text embedding solutions. We utilize the LaBSE (Language-agnostic BERT Sentence Embedding) Neural Network model <cit.> which is trained over more than 100 languages. The particular model was selected for two reasons; it provides a large space of already trained languages and does not require the alignment of input text sequences. Based on the selected model, we manage to parse all user posts and export 384 features for each of them. Additionally, we store the categories of the user posts (tweets, retweets, or quotes) as one hot encoding. This particular information allows the transformation of textual information (that can't be processed by an ML model) into a numeric vector space and allows the processing by a classification model. §.§ Graph embedding features Twitter as a modern social network provides multiple social interactions between registered users (retweets, mentions, and quotes). In this section, we answer the research question of "which type of social relations are important for suspension detection". To answer this question we extract the social relations between the users in a graph form. In this social graph, the nodes represent the users, and the edges represent the relations between users. Graph representations cannot be used directly by an ML model for training and prediction; in order to solve this issue modern solutions utilize Neural Network (NN) implementations <cit.>. In the case of a NN implementation, the model learns the graph relations between the nodes and provides a representation (also known as node embedding) in the form of a numerical vector for each relational node of the graph. The provided representation allows the utilization of the graph relational knowledge as an input to the ML model. For this purpose we use PyTorch Big Graph Neural Network model <cit.> since the particular implementation allows us to feed and process very large graphs with millions of nodes, without any restriction concerning the number of social relations (also known as graph layers). The particular implementation allows us to experiment between the single relation and the multi-relational graph embeddings. Twitter provides multiple user-to-user interactions, namely retweets, mentions, and quotes. In our implementation, we are interested in the identification of a social interaction that provides the most important information about a user-to-user relationship. For this purpose, we extract four different social interaction graphs, quotes, mentions, retweets, and a combination of them (also known as a multi-layer graph). As a metric of social interaction importance, we keep learning the performance (MRR and AUC) of our Neural Network model for each graph, since the performance of the NN model affects immediately the performance of the ML classification model. We permit our model to learn accurately the user-to-user relations since it achieves higher MRR and AUC scores according to the presented performance in table:<ref>, specifically the multi-relational graph (combination of social interactions) with the embedding size equal to 150. § EXPERIMENTAL RESULTS §.§ Shared content As mentioned in the methodology section, we are interested in malicious activity during the 2022 Russo-Ukrainian War. In order to shed light on the suspension mechanism, we identify the discussion topics and the toxicity of the user tweets that may also lead to the suspension of the user accounts. For this purpose, we analyze the posts of the suspended accounts towards topic clustering and text toxicity. To do this, we transform the posted text into numeric vectors (also known as embeddings) using the LaBSE (Language-agnostic BERT Sentence Embedding) model <cit.>. For the clustering of similar text, we select a cosine similarity score to group very similar posts. In order to reduce the time and resource complexity of our computation we manage to reduce the embedding output of our model from 768 dimensions to only 20 via PCA dimensionality reduction. This methodology allows us to reduce dramatically the resource and time requirements for data processing and clustering, without sacrificing the final outcome. This pipeline produced [group-separator=,]48486 clusters. In order to analyze the shared content we extract a sample of 10 tweets for each cluster and perform manual analysis over the largest clusters, as seen on tables <ref> and <ref>. According to our results, we identify that the most popular category of suspended content is correlated to 'Crypto', 'NFT', and 'giveaways'. We assume that content creators in order to trigger user attention, use trending topics and keywords like the ones regarding the Russo-Ukrainian War since during the first months of were trending topics on Twitter. Additionally, we identify similar content injection, where different users share identical content and in some cases, they mention different people. This kind of activity pattern is very similar to botnet activity where a particular group of accounts shares identical content at almost identical times. Besides similar content, we also identify large spam and advertisement campaigns where accounts maliciously use popular hashtags and trending topics to promote their products. Since we identify that the most popular discussion topics were 'Crypto' and 'NFT', we initialize a search for related keywords like 'crypto', 'NFT' and 'donation' within the clusters. It seems that the keywords of 'crypto' and 'donation' are very popular across the suspended users' conversations <cit.>. After a dynamic search and manual inspection, we reveal that multiple accounts are sharing messages similar to:'Stand with the people of Ukraine. Now accepting Bitcoin donations: BTC'. These messages trigger the attention of users to donate money in the form of Bitcoin and Ethereum with a wallet address. More specifically, we count 14 Bitcoin and 9 Ethereum wallets with a total of 16 transactions since the Russian invasion and collect in total 0.02896581 Bitcoins and 0.97419 Ethereum coins. More specifically, we expose those wallets posting tweets that support both sides, Ukraine and Russia. Below we show some examples of tweets in an effort to steal non-fungible tokens (NFTs) (usernames and mentions that have been removed). Furthermore, we execute measurements of content toxicity posted by suspended accounts, in order to identify whether toxicity plays an important role in the current suspension decisions. In order to answer this question we use a Neural Network model <cit.>, already trained over multiple languages. Our analysis shows that only 2.1% of the suspended account posts are toxic. Based on this result we assume that toxicity did not play an important role in the Twitter suspension decision. §.§ Performance Besides the content shared of suspended accounts we are focusing on building an ML model and a feature set that can achieve high detection performance. In order to evaluate the performance of our model, we utilize multiple testing sets with K-Fold cross-validation. During the initial step, we measure the performance of our models based on the average F1 score, during the K-Fold cross-validation. The cross-validation measurement provides the first impression of the model performance over the training and validation of the data set portion. In the following step, we measure the performance of each model, based on the testing (hidden) data that was not seeded during the feature selection, the model fine-tuning, and the cross-validation. The performance of the test data provides crucial information about the model generalization ability and the over/under-fitting issues. Based on these results (see table: <ref>) of the K-Fold cross-validation and test data-set performance, we identify that the best performance is achieved by a single model that contains the combination of the features and the user profile model, with a slightly better performance of the combination model over the validation and test data-sets. Since both validation and test data portions were extracted from the exact same time period, we are interested in the identification of the performance of new data that were created by the users in different time periods. For this reason, we retrieve a second testing dataset containing unseen normal and suspended users from the next 21 days period. The extracted dataset contains exactly the same feature categories. Each feature is extracted based only on the next 21 days period, in order to avoid information leaking, except the graph embedding. In the case of graph embeddings, we keep the training data user relation as well, in order to properly allocate the node positions in an N-dimensional output space. The extracted dataset contains exactly the same feature space and keeps class balance within the dataset, with the usage of an under-sampling method, as well as within the training, validation, and test data portions. During the performance measurement, we train our model over the entire dataset of the first 21 days and measure how the model performs on unknown data originating from a different time period. Based on the results presented in table <ref>, we notice that the performance of multiple models drops significantly, especially in the case of embeddings (text and graph). The drop in the embeddings features shows that the embeddings are strongly correlated to the user content (or activity, in the case of graph embeddings). Also, we notice that a slight change in the user actions leads to completely different results of embedding techniques. Despite this, some models achieve decent performance even in the next time period, such as the profile and the combination model. The profile model provides the lowest performance drop, in comparison to any other model. This outcome allows us to assume that the user profiles remain almost the same even after a 21 days period. §.§ Model explainability Based on the measured performance, seen in table <ref>, we manage to identify two models that allow us to detect suspended accounts. Additionally, within this study, we are interested in the identification of the differences between normal and suspended accounts on Twitter. Toward this goal, we are building an ML model in order to spot the differences between the feature values of suspended and normal accounts. We achieve this with the usage of SHAP (SHapley Additive exPlanations), based on a game theoretic approach to explain the output of the ML model. We select the profiles and the combination of the feature models, in order to explain these value differences. In figure <ref> we can see that both models identify similar patterns; suspended accounts have a low account age and a short period of activity (specifically notice the 'activity_time_range' in figure <ref>) and at the same time high values of status, according to the account age. These results show that suspended accounts are mostly fresh registered accounts posting high volumes of tweets, within a short time period. Additionally, suspended accounts grow their friends' relationship networks faster than normal users. Based on the identified results, the activity patterns of the suspended accounts on Twitter are very similar to those of the automated bot accounts. § BROADER PERSPECTIVE, ETHICS, AND COMPETING INTERESTS This study explores the features leading to Twitter suspension, which can be reused by the research community for the analysis of this phenomenon. The current work could be leveraged to build a real-time detection for vulnerable accounts for suspension or deletion, which is included in our future work. This could be utilized to detect censorship and violation of regulations of Twitter towards a specific political inclination or other means promoting unlawful content. Our dataset contains personally identifiable information (user name, screen name, user id) which due to Twitter's sharing and access policy we remove in order to keep user anonymity. We keep the user ids as a reference if the account changes status (deactivation or suspension) and the user id no longer provides personal information. Motivation.In order to shed light on the discourse on social media regarding the Russo-Ukrainian War, we analyze the Twitter suspension mechanism on the corpus we retrieve from Twitter API. The dataset is created by the authors, but due to the double-blind review process, we cannot refer to specific names or the projects that funded them until the publication of the study. Composition. The instances are 9.8M anonymized Twitter users and 107.7M anonymized messages. We consider that the dataset covers completely the Russo-Ukrainian War since the collection is based on the complete set of related HTs. The instances contain JSON data as returned from Twitter API along with a suspended flag of each account. The instances compose a network of relations in the Twitter graph. As indicated in the section methodology the dataset is being split into train and test sets. There are no indications of noise or redundancies in the dataset. The dataset is entirely self-contained. Our dataset contains publicly available anonymized data from Twitter with no offensive content or sensitive information. Collection Process. As mentioned in the methodology section we retrieve the dataset through Twitter API based on the related HTs, starting on 23/2/2022 until today, with no ethical review processes, not from individuals. Preprocessing/cleaning/labeling. These procedures are described in the dataset section and the preprocessed data was saved internally which will be available after the paper's publication. Uses. The dataset was used in a parallel study and details cannot be revealed due to the double-blind review process. Also, it could be used for further Twitter analysis and topic modeling. The composition of the dataset may impact future uses only in case Twitter alters data sharing policy. Distribution. The dataset will be available, after the paper's publication under its legal terms, with no third parties, imposed IP-based restrictions, and no export controls or other regulatory restrictions, except Twitter's sharing and access policy. Maintenance. The dataset files will be shared and the authors will be available for contact via the link of an online service, with no further updates after uploading, after the publication of the study. In case of a potential extension please contact the authors. AAAI Ethics and Diversity<cit.> We conform with the following paragraphs regarding: GENERAL ETHICAL PRINCIPLES 1.1 Contribute to society and to human well-being, acknowledging that all people are stakeholders in computing; 1.2 Avoid harm; 1.3 Be honest and trustworthy; 1.4 Be fair and take action not to discriminate; 1.5 Respect the work required to produce new ideas, inventions, creative works, and computing artifacts.; 1.6 Respect privacy; 1.7 Honor confidentiality. 2. PROFESSIONAL RESPONSIBILITIES 2.1 Strive to achieve high quality in both the processes and products of professional work; 2.2 Maintain high standards of professional competence, conduct, and ethical practice; 2.3 Know and respect existing rules pertaining to professional work; 2.4 Accept and provide appropriate professional review; 2.5 Give comprehensive and thorough evaluations of computer systems and their impacts, including analysis of possible risks; 2.6 Perform work only in areas of competence; 2.7 Foster public awareness and understanding of computing, related technologies, and their consequences; 2.8 Access computing and communication resources only when authorized or when compelled by the public good; 2.9 Design and implement systems that are robustly and usably secure. 3. PROFESSIONAL LEADERSHIP PRINCIPLES 3.1 Ensure that the public good is the central concern during all professional computing work; 3.2 Articulate, encourage acceptance of, and evaluate fulfillment of social responsibilities by members of the organization or group; 3.3 Manage personnel and resources to enhance the quality of working life; 3.4 Articulate, apply, and support policies and processes that reflect the principles of the Code; 3.5 Create opportunities for members of the organization or group to grow as professionals; 3.6 Use care when modifying or retiring systems; 3.7 Recognize and take special care of systems that become integrated into the infrastructure of society; 4. COMPLIANCE WITH THE CODE 4.1 Uphold, promote, and respect the principles of the Code; 4.2 Treat violations of the Code as inconsistent with membership in the AAAI. § CONCLUSION In this study, we manage to collect and analyze a large corpus of user discussions on Twitter, during the Russo-Ukrainian War. Initially, we study the suspended accounts' posts and show that the toxicity of the suspended accounts is very low. Additionally, we manage to reveal different discussions of suspended accounts via clustering of the posted texts by cosine similarity. Based on this methodology, we identify Bitcoin and Ethereum fraud campaigns taking advantage of the official state campaign to help both sides involved in the War conflict. Also, we identify malicious usage of Twitter popular hashtags for the purposes of spam and promotion. Based on the collected dataset, we extract and analyze the impact of multiple feature categories over the Twitter suspension decision. Our analyses show that the combination of multiple feature categories achieves higher suspension detection in terms of efficiency, within a short time period with 0.88 F1 and 0.95 ROC-AUC scores (first test), while profile features achieve better performance over a larger time period with 0.79 F1 and 0.9 ROC-AUC scores (second test). Furthermore, with the usage of SHAP explainability methods, we identify particular feature values that trigger the model decision; for example the lower age of a user profile and the volume of the posted tweets.
http://arxiv.org/abs/2306.07565v1	20230613062840	deController: A Web3 Native Cyberspace Infrastructure Perspective	[ "Hao Xu", "Yunqing Sun", "Zihao Li", "Yao Sun", "Lei Zhang", "Xiaoshuai Zhang" ]	cs.NI	[ "cs.NI", "cs.SY", "eess.SY" ]	deController: A Web3 Native Cyberspace Infrastructure Perspective Hao Xu, Yunqing Sun, Zihao Li, Yao Sun, Lei Zhang and Xiaoshuai Zhang This paper is submitted to IEEE for potential publication and it might be removed without notices. Corresponding authors: Xiaoshuai Zhang (main) and Lei Zhang. Hao Xu E-mail: [email protected]. Yunqing Sun is with Department of Computer Science, McCormick School of Engineering and Applied Science, Northwestern University, Evanston, IL, US, E-mail: [email protected]. Zihao Li, Yao Sun, Lei Zhang and Xiaoshuai Zhang are with University of Glasgow, Glasgow, G12 8QQ, UK, E-mail: [email protected]; {Yao.Sun; Lei.Zhang; Xiaoshuai.Zhang}@glasgow.ac.uk. =================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================== Web3 brings an emerging outlook for the value of decentralization, boosting the decentralized infrastructure. People can benefit from Web3, facilitated by the advances in distributed ledger technology, to read, write and own web content, services and applications more freely without revealing their real identities. Although the features and merits of Web3 have been widely discussed, the network architecture of Web3 and how to achieve complete decentralization considering law compliance in Web3 are still unclear. Here, we propose a perspective of Web3 architecture, deController, consisting of underlay and overlay network as Web3 infrastructures to underpin services and applications. The functions of underlay and overlay and their interactions are illustrated. Meanwhile, the security and privacy of Web3 are analyzed based on a novel design of three-tier identities cooperating with deController. Furthermore, the impacts of laws on privacy and cyber sovereignty to achieve Web3 are discussed. Web3 architecture, overlay and underlay, decentralized infrastructure, blockchain, DAO § INTRODUCTION Web3, an emerging term of decentralized world-wide-web (WWW) based on distributed ledger technology (DLT) and crypto economy, has been foreseen as a dynamic-driven factor for the next generation of the Internet. Web3 is seen as a catalyst for the future Internet to provide content, services, and applications for users without centralized servers. Since the introduction of blockchain by Bitcoin in 2008, the decentralized network started its unprecedented journey and has been thriving for more than a decade. With the advances of blockchain, cryptocurrencies and decentralized autonomous organizations (DAO) have shifted the world to embrace the value of decentralization to deconstruct the well-established centralized WWW ecosystems with the decentralized governance, underlay and overlay network infrastructures, as shown in Fig. <ref>, detailed in the following sections. Currently, Web3 has reached the moment towards inclusive top-down solutions and the soil for its growth in industrial, commercial and public networks without the involvement of any centralized things, solidifying the lifeline of Web3 value and consensus. However, such a top-down architecture of Web3 has not been sculptured with considering its challenges as well as the interactions of network infrastructure, DLT, security and privacy, judicature, etc., comprehensively. §.§ Challenge and opportunity With a great boost on security, privacy and cyber sovereignty (cyber sovereignty refers to the cyber boundary established by a country or region for exercising national control and implementing specific legislation) of user data, the challenges faced in achieving Web3 and opportunities are significant. §.§.§ Web3 is running on centralized things! “Read, write and own" endorses the fundamental value in Web3; however, if the access to the space of Web3 is denied, ownership means little or nothing to the owner who is blocked from accessing the WWW. Meanwhile, the value of privacy offered by Web3 becomes void if the user can be tracked at the beginning and the end of Internet access. It is necessary to ensure the user will never be unplugged from the network or illegally tracked due to centralization causes. Most importantly, Web3 shall secure itself from running the whole network on the infrastructure offered by centralized resource controllers. Another distinct challenge is the authentication in access control of Web3 because all identities in the decentralized network are anonymous, i.e., the authentication should not reveal any personal information of Web3 users. However, the authentication information of users is known by the central controller in the centralized model. Therefore, the architecture to achieve anonymous authentication for decentralized Web3 should be further investigated. §.§.§ Opportunities Since the current web structure is highly centralized, Web3 could facilitate the shift from centralized Internet to decentralized Internet based on DLT, distributed network, NEAT (Network Encrypted Address Translation, detailed later), etc. Such a self-governance evolution may enable people to access and own Internet resources more freely and equally, boosting investments in Web3 network infrastructure, and owning the actual Web3 network. Privacy is also an opportunity as anonymity may challenge the legislation and jurisdiction. As a nature of Web3, anonymous identities can protect users' real identities to avoid censorship when users are involved in various activities and applications. It is inspiring to enable a fully private and connected universe for all via encrypted address, a.k.a. BCADD, and the encrypted infrastructure through the ideology of decentralized and encrypted infrastructure. In this case, anyone who onboards the Web3 network can have permissionless access to the Web3 infrastructure. Apart from technological innovations, Web3 has the potential to provide new opportunities for legal governance of cyberspace due to its privacy-driven design. The core privacy issue in Web 1.0/2.0 is centralized services since service providers may exploit the surplus of online content creators without permission infringing users’ privacy and data protection rights, and even act as unsupervised police. Web3, embedded a native decentralization and encryption, offers users more control over their personal data and privacy in the Internet access where they own their autonomy to make choices, which is essentially aligned with the objectives of GDPR (General Data Protection Regulation) in the EU. §.§ Motivation and contribution There will be emerging scenarios relying on decentralization as its core value. Hence, it is necessary to prepare the existing network, security and privacy infrastructure to embrace the world of decentralization, meaning the infrastructure as a whole needs to stand with decentralization value rather than an unavoidable connection with centralization. Therefore, we propose the enabling decentralization infrastructure controller, deController, for Web3 native infrastructure. This paper contributes to Web3 in three aspects: (a). the Web3 network architecture with the detailed description of deController consisting of the overlay and underlay network; (b). the security, privacy and identity in a fully decentralized manner; (c). the operational principles regarding law and governance for Web3 infrastructure as shown in Fig. <ref>. § WEB3 OUTLOOK IN NETWORK AND SERVICES Compared with the centralized network, such a decentralized network structure brings different considerations in Web3 such as where the data are stored, how to ensure the data validity, etc. On the other hand, existing peer-to-peer routing and network protocols, such as Chord and Distributed Hash Table (DHT) can enable overlay connectivity. §.§ Web3 architecture overview The network architecture of Web3 is depicted in Fig. <ref>. Compared with the network architecture of Web 1.0/2.0 using a centralized web server to provide web services as shown in the left of Fig. <ref>, the Web3 server runs in a more decentralized manner. Specifically, the Web3 server only provides frontends of services while data storage and backends of applications are provided in a distributed manner. Users can access an application via the blockchain address of the corresponding smart contracts, in which the application backend is contained. Blockchain addresses can be routed by the Web3 network in accessing the application. The data content of users and applications (images, voice, videos, etc.) may be stored in a distributed storage to avoid data corruption or loss. Lawful agreements on access control policies can be applied to user data stored by service providers. To protect the real identities of users, a 3-tier identity architecture is proposed in Section <ref> to avoid personal information leakage and identity tracing. In addition, the data of identity mapping to the network and transactions between users and applications, such as payments and records of purchased items/services, can be recorded by DLT in public ledgers as they are small data compared to the content data. Such records can only be written into public ledgers after being verified by consensus mechanisms in the Web3 network, so the records are transparent, undeniable and immutable. Therefore, users and service providers cannot forge records or distort the existing records. Even if applications are shut down by service providers, users' assets in applications are kept in public ledgers, where users can access their assets seamlessly at their own discretion. Such a feature is difficult to be natively supported by applications in Web 1.0/2.0 since user data is fully controlled by service providers in centralized servers. §.§ Overlay and underlay decentralization of Web3 network The decentralization of network has never been easier with the help of blockchain. Regardless of the consensus type, each blockchain full node operates a full stack of networking and servicing protocols, making them a perfect nexus for the decentralized network. In fact, the existing blockchain delivery network makes the suitable alternative for the Web3 overlay network, as shown in Fig. <ref>. The underlay can be regarded as the 5-layer common computer network to provide physical network connections for the overlay. NEAT is used to resolve the association of BCADD with any network device identifiers, network ports and domain names. By linking the BCADD to specific identifiers, deController is able to lookup the BCADD globally and establishes the overlay network in any given underlay network. With the underlay network used by the blockchain delivery network, the underlay network will grow in the decentralization's interest, hence becoming the decentralized underlay network operated under the principle of fully decentralized infrastructure, which is illustrated in detail later in Section <ref>. In the Web3 context, the role of underlay network nodes overlaps with the blockchain nodes in the overlay owned by different stakeholders such as companies and organizations. These nodes also play the pivotal role of supplying computing power and networking capacity of the blockchain network. In fact, blockchain nodes can also provide the necessary overlay tunneling and routing capabilities, hence becoming the pillar of the Web3 overlay network. §.§.§ Decentralized Applications and Services The Web3 features the owner economy, which boosts the decentralized applications (dApp). The dApp is a smart contract powered autonomous code running on decentralized networks. Once the code is deployed on the blockchain, it becomes a public asset for any entities within the network. However, the dApp only works as an agent passing on the value between users; it cannot offer demanding services, e.g., video streaming, chatting room or online gaming. To enrich the context of Web3 ecosystem, service providers can use dApp to securely provide services to users using encrypted identities and exchange tokens, hence becoming a decentralized service provider. §.§.§ Decentralized Network Infrastructure In the scope of network infrastructure, the aforementioned Web3 network architecture is logically divided into two layers, the underlay and the overlay, as shown in Fig. <ref>. Similar to the traditional network, the underlay in Web3 architecture can be divided into multiple segments, which are later tagged by the overlay blockchain node with the optimal topological resolution. The entities within each segment perform particular network functions in a decentralized way, which is critically different from traditional networks. As mentioned, two decentralization manners, P2P (Peer-to-Peer) and DAO2DAO <cit.> (federated), can be exploited in underlay depending on the function performed. For example, multiple computing servers organized by a DAO in the edge network segment can provide route optimization service for the Web3 overlay network, collaborating with different DAOs in a decentralized manner, while the entities' data flow can be organized in a P2P manner that matches an optimal route offered by the Web3 overlay network, in order to manage the packet delivery for users. The overlay is built above the underlay to control and manage this decentralized network in the Web3 architecture <cit.>. Generally, the main entity in the overlay is the controller in charge of all the network management functions including authentication (identity and access), data packet routing, computing resource allocation, etc. These functions will be elaborated in Section <ref>. §.§.§ Integration: An identity prospect of view Since Web3 aims for a decentralized network where users can control their data and identity revocation or reservation, most user identities are self-sovereign identities (self-sovereign refers to empowering users to control their own identity information in cyberspace) rather than centralized or federated identities. However, a hierarchy and decentralized identity management infrastructure is necessary to construct a uniform identity authentication scheme that crosses the different worlds and domains. A 3-tier identity management is proposed to bridge the real identity to virtual identity from the perspective of users and services in Fig. <ref>. A real user identity can be linked to several virtual user identities to represent the user in Web3 networks. Meanwhile, a virtual user identity can derive the identities of multiple applications and services since a user may operate different applications and services. Therefore, a user's identity in the real world is regarded as the first level identity, named RealID. RealID is confidential and never revealed in Web3. The second level identity is the address of the user's wallet, which is called BCADD <cit.>. BCADD is derived from RealID locally by a one-way function and used by network operators. The third level identity is regarded as the application ID, which is used as the identity in different services, named APPID. APPID is derived from the current BCADD together with properties of the service by one-way function or verified random function (VRF) <cit.>. The APPIDs are the self-sovereign identities in the applications, end-to-end routing, and services of Web3 but both BCADDs and APPIDs are hardly being traced without the parameters of the one-way function. Since the overlay network hosted by blockchain networks can lookup every BCADDs in a global view and route every traffic between them, the direct connections between two encrypted identities can be established. Hence, the user can use a unified address authentication based on the public-key identity. As the decentralization, anonymity and privacy are the prominent factors of Web3, where public keys are used as identities, CAs (certificate authorities) are not required for the authenticity endorsement of identities and ownership of public keys. However, the use of public-key-based identity poses a security threat to the regulatory management of citizen networks, as they are fully anonymous and self-issued. It is a challenge to obtain the real identity of users without knowing a prior identity association to the public-key-based address. Therefore, the regulator should require mandatory registrations of active public-key-based identities to comply with the regulation. On the other hand, the legal interception can also be implemented into the deController through steering and duplication of traffics. Here, we first define the visibility of the three layers' identities followed by their security levels. RealID is only held by the user and registered at the regulatory body where necessary. BCADD is public to the cryptocurrency system and other authorized infrastructure, including the Mobile Network Operator (MNO) and Internet Service Providers (ISP). When the BCADD is derived from the RealID, the user can decide to involve more information in the BCADD using VRF and zero-knowledge proof (ZKP) <cit.> via the regulatory body. As required in Web3, personal information could not be revealed in the network. However, when any information is needed in the network or applications, the regulatory body can apply zero-knowledge proof on the user's registered information and publish a proof to the network. In this way, the user can prove to the Web3 application that it has the information or attribute as required. For example, a user can state its age is over 18 without revealing the actual age using ZKP and VRF in the statements linked to BCADD. ZKP and VRF enable service providers to verify the authenticity of the statement using the BCADD. In addition, APPID is visible to any service providers on Web3. To resist tracking attacks and protect users’ contextual privacy, the identity information should be updated in the user-defined privacy time slot. To be consistent with regular updates of wallet addresses, once the BCADD is updated, the APPID should also be updated at the service provider. In this case, the APPID of the same user may be linked to different wallets to impair the service consistency and interruptions. By having the 3-tier identity hierarchy in Fig. <ref>, it is ensured that different identities in different domains with different security levels. BCADD should be known to the operator to determine if a subscription for the network access is valid. The APPID is used as both the network interface indicator and the service authentication account. Since APPID is derived from BCADD, the authentication of APPID by the AAA (Authentication, Authorization, and Accounting) server can be done over the distributed network provider when the routers and RAN (Radio Access Network) authenticate and trust the BCADD. The detailed architecture of BCADD in-network accessing and APPID in application service with security and privacy authentication are shown in Fig. <ref> and described as follows. §.§ Security and privacy In Web3 infrastructure, all the blockchain nodes and user identities should be registered and updated to the blockchain platform by sending a bootstrapped transaction. The transaction should include the blockchain node’s BCADD to support network service, or APPID together with the access control information to support application services. The access control information may include a Non-Fungible Token (NFT) or other legacy server addresses. NFT has been recognized as a unique identifier of key digital assets, so the possession of certain assets represents the privilege of objects in the form of ownership in a manner of attribute-based access. Such adoption of the ownership concept can be migrated into access control aspects, where the ownership represents the access privilege. After registration, once the blockchain node requires a service from a third-party application server (AS), it will initiate a decentralized mutual authentication<cit.> of APPID between them. To be compatible with the protocol in <cit.>, we let all the routers check the APPIDs directly and pass the packets transparently to continue the authentication between users and AS. After the authentication procedures are finished, the AS will check the authenticated APPID’s corresponding authority by searching the access control information in the blockchain platform. When the APPIDs are renewed together with BCADD, users can decide to keep service consistency by notifying the new APPID in the previous session or the old APPID in the new session. The checking procedure executed by the first router is as follows. Authentication between the user and the communications network is first implemented to authenticate BCADD and support communications. By the derivation relation between BCADD and APPID, the APPID can be verified and authenticated given BCADD. Once the user can prove to the router that the APPID’s holder has a valid BCADD and has initiated a valid transaction for this session without revealing any information, the first router will forward the message to the destination. The traditional AAA server still exists in Web3 in case decentralized authentication is incompatible with any third-party AS or user. A legacy registered AAA server can run the General Bootstrapping Architecture (GBA) protocol <cit.> to generate a secure channel between the user and AS. The legacy AAA server should also register to the blockchain platform to be compatible with the blockchain network infrastructures, as shown in Fig. <ref>. The blockchain in the Web3 network can be regarded as a random oracle to execute computation under public supervision. Meanwhile, new privacy-preserving techniques, like public verifiable ZKP, can be introduced and implemented in the blockchain platform to provide Web3 transparent and regulated privacy protection. § DAO FOR DECENTRALIZED COMMUNICATION INFRASTRUCTURE: RESHAPING THE UNDERLAY NETWORK As aforementioned, decentralization is identified as the core interest of Web3, led by the blockchain (DLT), dApp, DeFi, and DAO. Communities of decentralization have become the beneficiary of decentralized networks, regardless of the fact that the current whole network is built on top of centralized communication infrastructures. However, dApps cannot be considered fully decentralized with their roots in centralized infrastructures. Therefore, there is a requirement that the underlay of the whole decentralized network, namely communication infrastructure operators, become decentralized. §.§ Motivation of DAO-based infrastructure operator With the requirement of full decentralization, DAO has the potential to fully decentralize the infrastructure operator. Unlike the traditional telecommunication business entities (e.g., state-owned, private-owned, public-limited, and limited liability companies), the DAO-based infrastructure operator has decentralized structures in essence. Firstly, the DAO-based infrastructure operator can flatten out the entire corporate management structure. There is no centralized management role to really control the organization. Instead, the vital decision can be proposed and made by every member of the organization, namely, DAO stakeholders. Secondly, the organization’s rules are encoded using innovative contract technology in a permissionless blockchain. Traditional organizations do not have to maintain complex and costly administrative departments. DAOs also make it virtually impossible to commit fraud since every transaction is open to public and consortium scrutiny. Another feature of a DAO is that the decisions are executed automatically via votes on the blockchain using smart contracts, which are transparent and non-repudiate. Once a proposal has been successfully voted upon, change occurs automatically without the need for further human involvement. DAOs represent a radical rethink of how infrastructure can be structured and operated, including changes in ownership, governance, decision-making and profit distribution. Decentralized infrastructure operators can not only inspire the investment in Web3 infrastructures, but also reshape legal consortium through the use of smart contracts, as shown in Fig. <ref>. With the demand of full decentralization, DAO could extend to telecommunication infrastructural operators <cit.>, operating the entire underlay and overlay network nodes with its own natural resources, such as spectrum, computing resources and energy. Furthermore, DAOs are always motivated to add more value to their content and services created in Web3. However, the value based on decentralization and consensus cannot be secured if the underlay network and storage are built upon the centralized infrastructure. Therefore, another major motivation for DAOs to invest in decentralized infrastructures is to protect their key assets in Web3, while making communal profits from serving Web3 people in the future. Although DAO-based infrastructure operators have many advantages, one of the biggest challenges is the risks of legal compliance to cyber sovereignty and data protection law when infrastructure operators become decentralized and multinational. §.§ A legal view on decentralized infrastructure of Web3 As illustrated in Fig. <ref>, the decentralized underlay of Web3 significantly impacts law, privacy and cyber sovereignty. Although the decentralized infrastructure has the potential to address the cybersecurity and sovereignty risks associated with data cross-board flow, there are still some potential frictions between the decentralized underlay and the current legal system. Firstly, full anonymization is still difficult to be achieved since operators or governments are possible to retrieve personal data through a combination of data from network activities even though the 3-tier identity is applied. However, the recovery possibility is also necessitated by the government's legitimate surveillance requirements, which can be a tool for cyberspace regulation. In such a scenario, the government should define anonymization in data protection laws clearly <cit.> and obey the purpose limitation principle by complementing legislation to mitigate risks. The second potential friction is users can actually own partial Web3 network and contribute to it under the decentralized infrastructure. However, they may make themselves “network operators” or “data processors” within the meaning of the Cybersecurity Law or Data Protection Law (e.g., GDPR). Thus, they theoretically have to bear the corresponding legal responsibilities for data protection. Such a design does not fully consider the challenges posed by decentralization and the decentralized infrastructure. Therefore, it leads to the critical reflection of regulatory philosophy in this decentralized privacy-friendly architecture, which requires a new legal paradigm of cyberspace regulation. Government-led regulatory impact sandboxes could act as stabilizers to calibrate the law and technology for industry compliance, maximizing the compatibility of Web3 with existing legal systems and regulatory regimes. Moreover, the decentralized infrastructure may result in data flowing to different jurisdictions, indicated in Fig. <ref>, creating jurisdictional conflicts and jeopardizing national cybersecurity and sovereignty. The legal consortium introduced in Fig. <ref> may enable different jurisdictions to reach a consensus by smart contracts on issues of judicial jurisdiction. Therefore, it may eliminate unauthorized cross-border movements of data and ensure national cybersecurity and sovereignty. § THE WEB3 DECONTROLLER FOR NETWORK INFRASTRUCTURE: RESHAPING THE OVERLAY NETWORK When a user accesses a Web3 application as shown in Fig. <ref>, the overlay of deController routes the encrypted application address to the corresponding smart contract deployed by the service provider. Then, a link from the user to the application can be established via the underlay of deController. After that, the user can authenticate the application and then use the smart contract to access the application via the BCADD. The overlay network offers ultimum connectivity to decentralized users and services. However, it is still a challenge to bridge the decentralized services to the underlay physical network in a decentralized manner. In the following, we propose our deController, the nexus for the decentralized overlay and universal network underlay. §.§ Identity and access with decentralized identity manager One fundamental function for decentralized controllers is the authentication, including identity and service access. As discussed in Fig. <ref> and Fig. <ref>, we introduce a hierarchy and decentralized identity management infrastructure, where RealID, BCADD and APPID are used to achieve authentication in a privacy-preserving way. With these BCADDs, one critical innovation for Web3 architecture is to enable access with BCADDs, which should be achieved in the overlay network with the help of an embedded deController, shown in Fig. <ref>. Users can access decentralized services starting from bottom to top. The left part contains network functions. Meanwhile, the smart contracts are shown on the right for user mobility and identity association updates with minor status changes recorded on the blockchain. Therefore, the blockchain is intended for small data such as identity associations and topological updates. Specifically, the controller acts as the agency for entities to interact with the blockchain and relay the information to entities who may not support blockchain access, thus building the encrypted tunnel between two entities. Hence, the native interpretation of encrypted identities can significantly improve the security, integrity and scalability of Web3 services while pushing the boundary of decentralization towards communication infrastructures. §.§ Network and application integration: entity discovery Another key function that the deController in the overlay network should perform is the network segment routing for data delivery. In the decentralized architecture, there is no central controller to determine and update the routing table for the whole network. Therefore, deControllers determine the routing for users without using conventional network addresses. In our proposed overlay network, shown in Fig. <ref>, deControllers can rely on the blockchain network to perform routing optimization. Specifically, each access node is identified by its BCADD or APPID, and the serving blockchain access points can be bound to addresses with the topological information. Hence, finding a data transmission path for two users is equivalent to finding a path between the two associated blockchain nodes. Thereby, a logical tunnel between two users is established with users' BCADD or APPID, and further encrypted by the keys exchanged between two blockchain access points. Furthermore, the blockchain network can be mapped into multiple segments of the network, and each blockchain segment represents the overlay access point of the nearby network. The global routing topology will be collected from all blockchain routing nodes to find the routing path among different segments. §.§ Identity association with encrypted address translation Ledger records contain the information needed for routing and switching, which are essential to the self-claimed identities from clients and their current addresses' bindings. They together make up the identity registry and association services offered by deController in Fig. <ref>. In the case of switching, the local record utilizes the bound network interface of the entity's BCADD. By having the BCADD as the pointer, the endpoint router can perform NEAT (an address lookup protocol based upon hash table and bloom filter) to steer the traffic between any entities tagged within the BCADD and the connected interfaces. §.§ Decentralized services sessions As one entity can be identified with an BCADD, per-session routing for each service entity can also be considered, while the traffic can be steered using the BCADDs, as indicated on the top of Fig. <ref>. During the per-session routing, mutual authentications are performed in every handshake between two encrypted identities via the required security socket layers. Meanwhile, the subsequent service status is updated by the identity manager, who keeps tracking the service quality, aliveness and most importantly, the service identity. § CONCLUSION In this paper, we propose deController, a perspective of Web3 architecture for future decentralized Web3 infrastructures, consisting of overlay and underlay to catalyze more free and fair web access for people. The functions of deController are illustrated in a top-down sculpture of Web3 architecture with the considerations of concealed identity, security and privacy, and law. The term Web3 shall also enable not only the decentralization of giant Internet companies, but also the decentralization from the de-facto centralized infrastructure controller. Our solution proposed in this paradigm can be a potential starting point for the real Web3 infrastructure investment, which allows the true ownership of Web3 beyond the content. IEEEtran Hao Xu received the PhD in Electrical Engineering from University of Glasgow. He is going to be with Wireless Network Research Department, Huawei Technologies (UK). His research interests cover wireless communication, wireless blockchain consensus and blockchain-enabled radio access network. Yunqing Sun is currently working toward a Ph.D. degree in Computer Science, Northwestern University, US. Her research interests mainly focus on security and privacy. She is working on multi-party computation and oblivious transfer. Zihao Li is currently a PhD candidate in CREATe Center, School of Law, University of Glasgow. His research interests concentrate on the relationship between law, data and information technology. Yao Sun is currently a Lecturer with the James Watt School of Engineering, the University of Glasgow, Glasgow, U.K. His research interests include intelligent wireless networking, network slicing, blockchain system, Internet of Things and resource management in mobile networks. Lei Zhang (Senior Member, IEEE) is a Professor at the University of Glasgow. He has academia and industry combined research experience on wireless communications and networks, and distributed systems for IoT, blockchain, autonomous systems. He is the founding Chair of IEEE Special Interest Group on Wireless Blockchain Networks in Cognitive Networks Technical Committee. Xiaoshuai Zhang is currently a Research Associate in James Watt School of Engineering of University of Glasgow. He received his Ph.D. from Queen Mary University of London. His current research interests include blockchain, distributed consensus, applied cryptography, privacy preservation and IoT.
http://arxiv.org/abs/2306.05725v2	20230609074557	Privacy, Security, and Usability Tradeoffs of Telehealth from Practitioners' Perspectives	[ "Faiza Tazi", "Archana Nandakumar", "Josiah Dykstra", "Prashanth Rajivan", "Sanchari Das" ]	cs.HC	[ "cs.HC" ]	Multimodal Explainable Artificial Intelligence: A Comprehensive Review of Methodological Advances and Future Research Directions Nikolaos Rodis, Christos Sardianos, Georgios Th. Papadopoulos, Panagiotis Radoglou-Grammatikis, Panagiotis Sarigiannidis and Iraklis Varlamis N. Rodis is with the Department of Informatics and Telematics, Harokopio University of Athens, e-mail: [email protected]. C. Sardianos is with the Department of Informatics and Telematics, Harokopio University of Athens, e-mail: [email protected]. G. Th. Papdopoulos is with the Department of Informatics and Telematics, Harokopio University of Athens, e-mail: [email protected]. P. Radoglou-Grammatikis is with the Department of Electrical and Computer Engineering, University of Western Macedonia and K3Y Ltd, e-mail: [email protected], [email protected]. P. Sarigiannidis is with the Department of Electrical and Computer Engineering, University of Western Macedonia, e-mail: [email protected]. I. Varlamis is with the Department of Informatics and Telematics, Harokopio University of Athens, e-mail: [email protected]. July 31, 2023 ============================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================== Faiza Tazi 1, Archana Nandakumar2, Josiah Dykstra3, Prashanth Rajivan2, Sanchari Das1 1 Department of Computer Science, University of Denver, Colorado, USA 2 Department of Industrial and Systems Engineering, University of Washington, Seattle, USA 3 Designer Security, LLC 6in The COVID-19 pandemic has significantly transformed the healthcare sector, with telehealth services being among the most prominent changes. The adoption of telehealth services, however, has raised new challenges, particularly in the areas of security and privacy. To better comprehend the telehealth needs and concerns of medical professionals, particularly those in private practice, we conducted a study comprised of 20 semi-structured interviews with telehealth practitioners in audiology and speech therapy. Our findings indicate that private telehealth practitioners encounter difficult choices when it comes to balancing security, privacy, usability, and accessibility, particularly while caring for vulnerable populations. Additionally, the study revealed that practitioners face challenges in ensuring HIPAA compliance due to inadequate resources and a lack of technological comprehension. Policymakers and healthcare providers should take proactive measures to address these challenges, including offering resources and training to ensure HIPAA compliance and enhancing technology infrastructure to support secure and accessible telehealth. 2 § INTRODUCTION The COVID-19 outbreak, declared a global pandemic by the World Health Organization in 2020, had a profound impact on healthcare systems and patients worldwide. In response, telehealth services experienced an unprecedented surge with a record growth of 64.3% in 2020 <cit.>. The use of telehealth technologies however raises privacy and security concerns given the sensitive health information they transmit and store. This information is vulnerable to cyberattacks, theft, and data breaches which can lead to unauthorized access, manipulation, or destruction of telehealth systems and data. To mitigate these risks, healthcare providers and technology companies must comply with legal and regulatory requirements such as the Health Insurance Portability and Accountability Act (HIPAA) and the General Data Protection Regulation (GDPR), which may require the implementation of robust security measures including encryption, multi-factor authentication, and security updates <cit.>. Medical professionals play critical roles in healthcare, yet research on their privacy and security perspectives is limited, particularly in private practice telehealth <cit.>. Audiology and speech-language pathology represent two important components of allied healthcare where telehealth has the potential to revolutionize service delivery. Ensuring the privacy and security of patients' sensitive health information is crucial for the success of any telehealth service. Unfortunately, the severe lack of research in this area is concerning. To address this gap, we conducted 20 semi-structured individual interviews with audiologists and speech-language pathologists (SLPs) to gain insights into how telehealth is used to provide care and therapy for patients. This paper aims to (1) identify privacy and security concerns of audiologists and SLPs in the telehealth context, (2) understand the perceptions of audiologists and SLPs towards HIPAA compliance during telehealth sessions, and (3) examine providers' experience and sentiment towards telehealth. § METHODS This study investigates the current understanding and perception of privacy and security among audiologists and speech-language pathologists (SLP) in private practice. Through this research, we focus on the use of telehealth technologies in these practices. To gather data for the study, the research team designed and conducted semi-structured interviews with 20 audiologists and SLPs who are practicing in the United States. For flexibility to the interviews and given the research theme, we conducted the interviews online using Zoom between August 2022 and January 2023. Through this study, we aim to answer the following research questions: * RQ1: How do audiologists and speech-language pathologists in private practice utilize telehealth technologies in their clinical work? What are the perceived benefits and challenges of using telehealth technologies in the practices of audiologists and speech-language pathologists? * RQ2: What is the current understanding and perception of privacy and security among audiologists and speech-language pathologists practicing in private practice settings? How do audiologists and speech-language pathologists ensure the privacy and security of patient data when using telehealth technologies in their practices? §.§ Recruitment We began the recruitment process for the study after obtaining the necessary Institutional Review Board (IRB) approval from relevant institutions. Given the nature of the study, we worked closely with the IRB to ensure we followed the standard ethical practices. We implemented a multi-pronged approach, interviewing 20 participants until we reached the qualitative data collection standards. Initially, we advertised the study in various social media groups specific to speech-language pathology and audiology professionals. We also circulated the recruitment emails across various mailing lists, which the researchers knew focused on our targeted participant pool. We also implemented snowball sampling to identify potential participants. However, there needed to be more outreach than these methods since we focused on participants who used telehealth technologies for a considerable time (at least two years). To overcome this recruitment challenge, the research team contacted the two professional organizations for audiologists and speech-language pathologists, the American Speech-Language-Hearing Association (ASHA) and the Academy of Doctors of Audiology (ADA). These organizations were instrumental in recruiting participants for the study, as they sent emails to their affiliated members on behalf of the research team. By the end of the recruitment phase, we obtained a diverse sample of 20 interview participants from the United States. The sample comprised 10 audiologists and 10 speech-language pathologists with varying years of medical expertise and experience with telehealth technologies. This diversity in expertise and experience provided valuable insights and perspectives on using telehealth technologies in private practices. We provide the demographic details of our participants in Table <ref>. §.§ Interviews After distributing recruitment materials, potential participants reached out to the research team via the provided email. We confirmed that 21 of the 104 people who contacted us were indeed audiologists or SLPs and we scheduled online interviews with all 21 of them. One participant had to cancel their interview. All of the participants appreciated the flexibility of the online interview. We conducted the interviews between August 2022 to January 2023, and each interview lasted an average of 46 minutes (min=32 minutes, max=90 minutes). Each participant received an electronic gift card of USD $50 for their participation in the study. We designed the questions to be open-ended, encouraging participants to provide detailed and in-depth discussions. The semi-structured interviews began with a brief explanation of the study and the obtaining of verbal consent, including permission for a Zoom recording and general consent to participate in the study. All but one participant agreed to have their interview recorded on Zoom. §.§ Data Analysis Our data analysis was broken down into several stages. The first included a verbatim transcription of the interviews. Because only one participant refused to be recorded, the interview administrator took notes of the responses provided while the remaining participants were audio recorded and transcribed. These notes and transcriptions were then anonymized. The second phase of our study consisted of a qualitative analysis approach using thematic analysis. One research team member conducted inductive coding and generated an initial codebook based on the research questions and the initial coding of two transcripts. A separate team member conducted independent coding on these two transcriptions using previously generated codes to ensure inter-rater reliability (IRR). These two team members independently coded the remaining 17 transcripts and the one interview note. The coders then discussed changes or additions to the codebook as they arose to refine the codebook and group codes into themes. Once the coding was complete, data were organized into tables and figures to represent the findings visually. Additionally, we used quotes from the transcripts to support the findings and give voice to the participants. § FINDINGS AND DISCUSSION Across both specialties, our participants reported a remarkably similar workflow. A telehealth session will typically begin a few minutes before the appointment time. This additional time allows the providers to review the patient's history, prepare their materials, and ensure that their software is operational. When the patient joins the session, the disparities between participants begin to manifest. Some participants agreed that they will first confirm the patient's identity before beginning a session, while others like P9 said they do not: Most of the people that I'm doing telehealth with…I know these patients…I know their face. The services provided during these telehealth sessions varied by specialty, with SLPs providing services ranging from initial evaluations to therapy treatments. Among our participants, telehealth services for audiologists included follow-up appointments, consultations, and hearing aid programming. Moreover, our participants reported using a variety of telehealth platforms: Athena, Blink session, Blueprint, CounselEar, doxy.me, Google Meet, Modmed, Televote, Theraplatform, Tuned, SimplePractice, and Zoom. Qualitative analysis produced four overarching themes described below: (1) technological disparity, (2) flexibility with telehealth, (3) HIPAA confusion, and (4) training. §.§ Technological Disparity §.§.§ Privacy and security concerns Some of our participants were aware of the threats they face when delivering telehealth services or simply utilizing an Electronic Medical Record (EMR) system; as a result, these participants implemented security measures to safeguard both the practice and the patients, despite knowing that these safeguards can never be 100% failsafe. As P5 noted: We don't have patient data just randomly saved places…we're doing the best that we can…It's why I make sure when we're doing those telehealth visits we are in our EMR and not on Zoom or not on Teams or on FaceTime When asked about the security measures put in place to protect telehealth sessions, seven participants mentioned enabling waiting rooms. This is especially critical for ensuring that patients are not unintentionally or purposely exposed to the personal health information of other patients. In addition, only two passwords plus a password manager. Likewise, only two people mentioned using a secure internet connection. Five participants affirmed that they do not record any telehealth sessions, with one stating that even though they do not record their sessions with patients they still include it in their consent forms in case [the provider] make a mistake. We also identify participants who are cognizant of the importance of privacy and security but are unconcerned about it, either because they have an IT department managing security or because they chose a secure software provider they trust. P3's note on Blueprint is an example of this trust: So Blueprint has their own server in-house they show us their security they haven't been hacked or anything like that. It's a very well protected, well funded, high quality secure service, and again that's why we chose them. There's a lot of choices out there but that's why we chose them as our office management software. Furthermore, some participants were unconcerned about the privacy and security of their telehealth sessions, justifying their apathy by claiming that the confidential healthcare information disclosed during telehealth meetings is restricted and of little utility to bad actors. As P11 put it: Of all the things on this earth for them to want to hack I don't think that our therapy appointments are going to be the biggest priority and if they do they'll just come in and see us playing games online and practicing speech sounds. §.§.§ Usability When asked about the reason behind their software choices, eight participants mentioned that ease of use was an essential consideration for both their patients and themselves. Subsequently, participants confirmed the discontinuation of telehealth software use that was difficult for their patients to use, navigate, or comprehend. This is especially true for participants who serve communities in difficult socioeconomic situations and older populations who have difficulty using telehealth, as P15 stated: [Zoom] wasn't as easy as just click on this button and you can enter my teletherapy space…It was just too many steps for the population I was working with, and so it ended up just being very frustrating for them. So I ended up using Google Meet mostly because it was easier for the families to join the meeting… These participants revealed that usability is critical to ensuring continuity of care, especially during COVID-19, as patients may be less likely to use a telehealth platform if it is difficult to use. §.§.§ Cost When deciding on telehealth platforms, cost is an essential consideration, particularly for providers in small private practice facilities (4 full-time employees or less) or solo practitioners. These providers must manage their budgets efficiently while still providing high-quality care to patients. Some telehealth platforms can be costly, and when the cost is prohibitively expensive, some of our participants decided to switch platforms, occasionally sacrificing functionality to reduce costs. Although none of our participants compromised HIPAA compliance, as P11 stated: …We needed [an] alternative. So what are the cost effective alternatives out there? Google Meet. Can we make it HIPAA compliant?…and once we have the [Business Associate Agreement] in place was when I felt most comfortable using Google [Meet] §.§.§ Resource Availability Despite the availability of online resources to help providers select and use telehealth, it can be challenging for them to identify the most relevant ones for their needs and situations, according to some of our participants. For instance, some needed help finding guidance for maintaining HIPAA compliance when offering telehealth. Some of our participants also struggled with finding a platform suitable for offering telehealth service, as P1 mentions: To be honest I'm not entirely sure what else is available [other than Google Meet]… This could be because telehealth is a relatively new field, so fewer established resources may be available than there are for conventional healthcare services. Furthermore, the telehealth landscape quickly evolves with new technologies and regulations, making it challenging to keep up with the most recent information. This has led some participants to choose a specific platform for the resources and information it offered them. This is primarily because readily available information, especially when it is from a HIPAA-compliant source, will help providers make informed decisions while improving productivity and saving time and resources, as P9 mentions: I don't have time and my job is not to do cyber security; my job is to take care of patients §.§ Flexibility with Telehealth §.§.§ COVID Considerations When asked about the reasons for providing telehealth, our participants stated that telehealth enabled patients to access healthcare services without physically visiting a clinic or hospital, which was especially important at a time when social isolation was required to slow the spread of COVID-19. Furthermore, by eliminating the need for in-person visits, telehealth reduces the risk of infection for patients and healthcare workers. This assisted in protecting our participants as well as their vulnerable patients from COVID-19 exposure. Notably, many participants emphasized the importance of telehealth in enabling patients to continue receiving care from their regular healthcare providers, thereby ensuring care continuity. This was especially essential for patients with chronic illnesses who needed continuous care and monitoring; P14 confirms this in their statement: We had a lot of medically fragile children…we got together and did not want our patients to go without services…that's when we started learning about teletherapy. §.§.§ Physical Harm Telehealth enabled healthcare providers to provide care virtually, reducing the need for in-person visits and reducing the risk of physical harm or violence. This was especially essential for healthcare providers who deal with patients who exhibit aggressive behavior or work in environments where they feel unsafe. This is the case of two of our interviewees who agreed that physical safety is one of the reasons they choose to provide telehealth services. These participants also claimed that they no longer feel safe delivering in-person care in “high-risk schools” because the environment can impact therapy quality. As P17 puts it: I kind of worked in a school that had a lot of violence. The school I was in…it was definitely something I had to be monitoring for and very aware of all the time. So that made me feel more secure doing teletherapy, just like the safety of my own physical safety was not a concern which was like a very normal part of my day…that can all distract from therapy goals and take time out of your day §.§ HIPAA §.§.§ HIPAA Confusion HIPAA is a complex federal law with provisions and regulations that can be challenging for non-legal experts to understand and implement. This may lead to misconceptions or misunderstandings concerning HIPAA requirements which can further confuse healthcare providers and make understanding and complying with the legislation problematic. Some participants were confused about HIPAA compliance when using platforms such as Google Meet and Zoom. Furthermore, the regulatory framework may have yet to keep up with the rate of change in the telehealth sector, mainly after COVID-19 has spurred the adoption of the technology and given rise to new use cases. As a result, there may be some uncertainty and ambiguity around how HIPAA regulations apply to telehealth technologies. As stated by P9: HIPAA, but not with telehealth, I think that's still a gray area. I think there's not a real defined protocol for telehealth as it pertains to HIPAA. We're told what HIPAA is and how we need to define it and what is considered a breach, but when it comes to these different areas…I mean telehealth is kind of underneath that umbrella. I mean, do I really know if something's HIPAA compliant? I don't think the administrators even know. §.§.§ HIPAA Violations Some of our participants acknowledged breaking HIPAA laws. Indeed, P16 stated that they could not keep a telehealth talk from being overheard because they did not have a soundproof space in their home. This could be considered a violation since HIPAA requires covered entities to protect the privacy and security of PHI, which includes information about an individual's health status or healthcare services obtained: During COVID it was hard because I'm working from home and my husband was here and he could very easily hear my sessions and would hear me use patients names and things like that and we didn't talk about the patients…but he knew what my patients names were because he was in the house so I feel like that kind of thing was understood as something that is unavoidable and inevitable when everyone is working from home and on lockdown. Furthermore, some healthcare workers may be unfamiliar with the security features and requirements of the telehealth platform they are using, potentially resulting in unintentional HIPAA violations. This is the case of some interviewees who described utilizing FaceTime for telehealth or saw other clinicians using it in a telehealth session. While the U.S. government temporarily relaxed HIPAA enforcement for the use of FaceTime and other non-public telehealth technologies during the COVID-19 public health emergency, enforcement is scheduled to return in 2023. Finally, HIPAA violations may be due to a lack of training if healthcare workers are not sufficiently knowledgeable of HIPAA regulations, particularly with regards to telehealth. §.§ Training According to the law, and confirmed by our study participants, healthcare personnel who work with PHI must complete periodic HIPAA training. HIPAA training is intended to inform healthcare professionals of the law's obligations and show them how to manage PHI per its guidelines. Several participants opt to enroll in continuing education programs to fulfill the required training. HIPAA does not, however, mandate any telemedicine-specific training for telehealth providers. Nevertheless, telehealth education is crucial because, unlike conventional in-person healthcare, telehealth calls for unique skills and knowledge. Healthcare professionals should thus undergo telehealth training, given that it can help them provide high-quality care to patients who cannot access in-person care. As a result, more patients will be able to obtain care, particularly those who reside in isolated or underserved locations or find it challenging to leave their homes. As a result, only four participants indicated that their states' laws required them to complete telehealth training, as reported by P20: In Massachusetts they technically require [telehealth] training for all speech pathologists. § FUTURE WORK AND LIMITATIONS The study provides valuable insights into the privacy and security perspective of audiologists and SLPs regarding telehealth. However, limitations exist due to the qualitative nature and small sample size of 20 participants. To enhance the generalizability of findings, future studies should include a broader range of healthcare professionals from various geographical locations. This would provide a more comprehensive understanding of privacy and security concerns in telehealth. Additionally, future research could explore the use of telehealth technologies in other medical specialties and how privacy and security concerns differ. Finally, examining the impact of privacy policy regulations changing landscapes could further inform the development of privacy-preserving telehealth technologies. § CONCLUSION Protecting and securing medical data while maintaining privacy is essential in all aspects of healthcare, particularly when using third-party telehealth services that lie beyond the scope of medical institutions' policy management. Therefore, we conducted 20 interviews with audiologists and SLPs from private practices in the United States to understand their perspective on telehealth, including their usage, technology selection, and privacy and security considerations. Our data analysis revealed valuable insights into the telehealth landscape from the audiologists' and SLPs' viewpoint. A key finding was that the providers are concerned and motivated to ensure the security and privacy of their telehealth patients but do not have access to necessary resources to enforce them with little uncertainty. The main barriers appear to be cost, training, usability and workflow in these telehealth systems. Privacy and security were also emphasized as crucial factors, with participants often relying on the services they use for data protection. Finally, our study highlights the need for continued education and training in telehealth to address challenges such as navigating HIPAA regulations and selecting appropriate telehealth platforms. Further research is necessary to identify barriers to telehealth adoption and optimize it to meet audiologists' and SLPs' needs. This information can aid in developing targeted training and education programs to support effective telehealth implementation in private practices. § ACKNOWLEDGEMENT We would like to thank our participants for their time and input and acknwoledge the Inclusive Security and Privacy focused Innovative Research in Information Technology (InSPIRIT) Laboratory at the University of Denver. This research has been funded by CISCO Research Award. Any opinions, findings, conclusions, or recommendations expressed in this material are solely those of the authors and not of the organization or the funding agency. apacite § 0PT 0pt2ex -11cm
http://arxiv.org/abs/2306.02831v1	20230605122722	MM-DAG: Multi-task DAG Learning for Multi-modal Data -- with Application for Traffic Congestion Analysis	[ "Tian Lan", "Ziyue Li", "Zhishuai Li", "Lei Bai", "Man Li", "Fugee Tsung", "Wolfgang Ketter", "Rui Zhao", "Chen Zhang" ]	stat.ML	[ "stat.ML", "cs.LG" ]	The work is done during the author's internship in SenseTime. 0009-0005-8331-1190 [email protected] Tsinghua University Beijing China 0000-0003-4983-9352 [email protected] University of Cologne Cologne Germany 0000-0003-3408-6300 [email protected] SenseTime Research Shanghai China 0000-0003-3378-7201 [email protected] Shanghai AI Laboratory Shanghai China 0000-0003-3701-7722 [email protected] Hong Kong University of Science and Technology Hong Kong 0000-0002-0575-8254 [email protected] Hong Kong University of Science and Technology Hong Kong 0000-0001-9008-142X [email protected] University of Cologne Cologne Germany 0000-0001-5874-131X [email protected] SenseTime Research China 0000-0002-4767-9597 Corresponding author. [email protected] Tsinghua University Beijing China This paper proposes to learn Multi-task, Multi-modal Direct Acyclic Graphs (MM-DAGs), which are commonly observed in complex systems, e.g., traffic, manufacturing, and weather systems, whose variables are multi-modal with scalars, vectors, and functions. This paper takes the traffic congestion analysis as a concrete case, where a traffic intersection is usually regarded as a DAG. In a road network of multiple intersections, different intersections can only have some overlapping and distinct variables observed. For example, a signalized intersection has traffic light-related variables, whereas unsignalized ones do not. This encourages the multi-task design: with each DAG as a task, the MM-DAG tries to learn the multiple DAGs jointly so that their consensus and consistency are maximized. To this end, we innovatively propose a multi-modal regression for linear causal relationship description of different variables. Then we develop a novel Causality Difference (CD) measure and its differentiable approximator. Compared with existing SOTA measures, CD can penalize the causal structural difference among DAGs with distinct nodes and can better consider the uncertainty of causal orders. We rigidly prove our design's topological interpretation and consistency properties. We conduct thorough simulations and one case study to show the effectiveness of our MM-DAG. The code is available under <https://github.com/Lantian72/MM-DAG>. <ccs2012> <concept> <concept_id>10002950.10003648.10003649.10003655</concept_id> <concept_desc>Mathematics of computing Causal networks</concept_desc> <concept_significance>500</concept_significance> </concept> <concept> <concept_id>10010147.10010178.10010187.10010192</concept_id> <concept_desc>Computing methodologies Causal reasoning and diagnostics</concept_desc> <concept_significance>500</concept_significance> </concept> <concept> <concept_id>10010147.10010257.10010258.10010262</concept_id> <concept_desc>Computing methodologies Multi-task learning</concept_desc> <concept_significance>500</concept_significance> </concept> </ccs2012> [500]Mathematics of computing Causal networks [500]Computing methodologies Multi-task learning MM-DAG: Multi-task DAG Learning for Multi-modal Data - with Application for Traffic Congestion Analysis Chen Zhang Received 21 February, 2023; accepted 5 June, 2023 ======================================================================================================= § INTRODUCTION Directed Acyclic Graph (DAG) is a powerful tool for describing the underlying causal relationships in a system. One of the most popular DAG formualtions is Bayesian Network (BN)<cit.>. It has been widely applied to the biological, physical, and social systems <cit.>. In a DAG, nodes represent variables, and directed edges represent causal dependencies between nodes. By learning the edges and parameters of the DAG, the joint distribution of all the variables can be analyzed. Urban traffic congestion becomes a common problem in metropolises, as urban road network becomes complicated and vehicles increase rapidly. Many factors will cause traffic congestion, such as Origin-Destination (OD) demand, the cycle time of traffic lights, weather conditions, or a road accident. Causal analysis of congestion has been highly demanded in applications of intelligent transportation systems. There is emerging research applying classical DAGs for modeling the probabilistic dependency structure of congestion causes and analyzing the probability of traffic congestion given various traffic condition scenarios <cit.>. When mining the causality for traffic congestion, as the classical DAG-based solution, a traffic intersection is usually regarded as a DAG, whereas different congestion-related traffic variables (e.g., lane speed and signal cycle length) are treated as nodes. However, there are still some challenges to be solved. (1) Multi-mode: First, so far, to our best knowledge, all the current DAGs consider each node as a scalar variable, which may deviate from reality: In complex systems such as transportation, variables are common in different modes, i.e., scalar, vector, and function, due to the variables' innate nature and/or being collected from different kinds of sensors, as shown in Fig. <ref>.(a)-(c). A scalar node is defined as a node that only has a one-dimensional value for each sample, e.g., the cycle time of traffic lights is usually fixed and scarcely tuned. So its signals are sampled at low frequency, and only one data point is fed back in one day. A vector node instead records a vector with higher but finite dimensions, e.g., the congestion indicator variable is calculated per hour, thus a fixed dimension of 24 per day. A functional node records a random function for each sample, with the function being high dimensional and also infinite, e.g., the real-time mean speed of lanes can be recorded every second and its dimension goes to infinity for one day. So far, there is no DAG modeling able to deal with multi-modal data. (2) Multi-task with Overlapping and Distinct Variables: We define a task as a DAG learning, e.g., for each intersection in the traffic case. In complex systems, different tasks can only have some overlapping variables, with some particular variables only distinctly occurring in some specific tasks. We define this officially as overlapping and distinct observations (variables). As such, each task can be regarded as only observing a unique subset of all possible variables. This may be due to their different experiences and hardware availability. For example: 1) Distinct: a signalized intersection (e.g., Task 3) has the node variable related to traffic light parameter (e.g., x_6), such as phase length, whereas a road segment (e.g., Task 1) and an unsignalized intersection (e.g., Task 2) do not have x_6; 2) Overlapping: Task 1-3 all have x_1, x_2, x_5 in Fig. <ref>.(d). The different availability of nodes in each task is the dissimilarity of our multi-task setting. In multi-task learning <cit.>, two important concepts are exactly the dissimilarity and similarity of tasks. (3) Consistent Causal Relations: Despite the different nodes on each task, we assume the causal relations of each DAG should be almost consistent and non-contradictory. For instance, x_1 is the cause of x_3 in Task 1, and this causal relation is not likely to be reversed in another task. This is because although with different subsets of the nodes, the DAGs are sharing and reflecting the similar fundamental and global causal reasoning of the system. This fundamental causal reasoning is usually consistent, usually due to the inherent physical, topological, biochemical properties, and so on. The consistent causal reasoning commonly shared by all the tasks is the similarity of our multi-task setting. However, it is worth mentioning that because nodes vary in each task, the corresponding causal relation structure will undoubtedly adapt, even with significant differences sometimes. For example, as illustrated in Task 1 and 2 in Fig <ref>.(d), because node x_3 is uninvolved in Task 2, all the edges from its predecessors {x_1, x_2, x_4 } will be transited to its successors (x_5) directly, rendering a big difference of edges (yet still consistent). The core challenge is thus to define structure differences between DAGs with different but overlapping sets of nodes, yet still learn the causal reasoning consistently. To this end, it is essential to learn these tasks jointly so that each DAG provides complementary information mutually and learns toward globally consistent causal relations. On the contrary, if separately learned, the causal structure of each task could be partial, noisy, and even contradicting. Motivated by the three challenges, this paper aims at constructing DAG for multi-modal data and developing a structure inference algorithm in a multi-task learning manner, where the node sets of different tasks are overlapping and distinct. To achieve it, three concrete questions need to be answered: (1) how to extract information for nodes with different dimensions and model their causal dependence? (2) how to measure the differences in causal structures of DAGs across tasks? (3) how to design a structural learning algorithm for DAGs of different tasks? Unfolded by solving the above questions, we are the first to construct multi-task learning for multi-modal DAG, named MM-DAG. First, we construct a linear multimode-to-multimode regression for causal dependence modeling of multi-modal nodes. Then we develop a novel measure to evaluate the causal structure difference of different DAGs. Finally, a score-based method is constructed to learn the DAGs across tasks with overlapping and distinct nodes such that they have similar structures. Our contributions are: * We propose a multimode-to-multimode regression to represent the linear causal relationship between variables. It can deal with nodes of scalar, vector, and functional data. * We develop a novel measure, i.e., Causality Difference (CD), to evaluate the structure difference between pairwise DAGs with overlapping and distinct nodes. It can better handle graphs with distinct nodes and consider the uncertainty of causal order. A differentiable approximator is also proposed for its better compatiblity with our learning framework. * We conduct a score-based structure learning framework for MM-DAGs, with our novelly-designed differentiable CD function to penalize DAGs' structure difference. Most importantly, we also prove theoretically the topological interpretation and the consistency of our design. * We apply MM-DAG in traffic condition data of different contexts to infer traffic congestion causes. The results provide valuable insights into traffic decision-making. It is to be noted that considering even for the most commonly used causal structural equation models (SEM), there is no work of multi-task learning for DAG with multimode data. Hence we focus on linear multimode-to-multimode regression, as the first extension of SEM to multi-modal data. We hope to shed light upon this research field since the linear assumption is easy to comprehend. However, our proposed CD measure and multi-task framework can be easily extended to more general causal models, including some nonlinear or deep learning models, with details in Sec. <ref>. The remainder of the paper is organized as follows. Section <ref> reviews the current work about DAG, multi-task learning, and traffic congestion cause analysis. Section <ref> introduces the model construction of MM-DAG in detail and discusses how to extend our model to nonlinear cases. Section <ref> shows the experimental results, including the synthetic data and traffic data by SUMO simulation. Conclusions and future work are drawn in Section <ref>. § RELATED WORK §.§ DAG Structure Learning Algorithm Structure learning for DAG, i.e., estimating its edge sets and adjacency matrix, is an important and well-studied research topic. The current methods can be categorized into constraint-based algorithms and score-based algorithms. (1) Constraint-based algorithms employ statistical hypothesis tests to identify directed conditional independence relationships from the data and construct a BN structure that best fits those directed conditional independence relationships, including PC <cit.>, rankPC <cit.>, and fast causal inference <cit.>. However, constraint-based algorithms are built upon the assumption that independence tests should accurately reflect the (in)dependence modeling mechanism, which is generally difficult to be satisfied in reality. As a result, these methods suffer from error propagation, where a minor error in the early phase can result in a very different DAG. (2) For score-based methods, a scoring function, such as fitting mean square error or likelihood function, is constructed for evaluating the goodness of a network structure. Then a search procedure for the highest-scored structure, such as stochastic local research <cit.> or dynamic programming <cit.>, is formulated as a combinatorial optimization problem. However, these methods are still very unpractical and restricted for large-scale problems. Some other algorithms for structure learning have been developed to reduce computation costs recently. The most popular one is NoTears <cit.>. It represents acyclic constraints by an algebraic characterization, which is differentiable and can be added to the score function. The gradient-based optimization algorithm can be used for structure learning. Most recent DAG structural learning studies follow the insights of NoTears <cit.>. Along this direction, there are also emerging works applying the Notears constraint into nonlinear models for nonlinear causality modeling. The core is to add the Notears constraint into original nonlinear model's loss function to guarantee the graph's acyclic property. For example, <cit.> proposes a general nonparametric modeling framework to represent nonlinear causal structural equation model (SEM). <cit.> proposes a deep graph convolution model where the graph represents the causal structure. §.§ Multi-task Learning Algorithm for DAG Multi-task learning is common in complex systems such as manufacturing and transport <cit.>. In DAG, multiple-task modeling is first proposed for tasks with the same node variables and similar causal relationships <cit.>. To learn different tasks jointly, it penalizes the number of different edges among tasks and uses a heuristic search to find the best structure. <cit.> further introduces a task-relatedness metric, allowing explicit control of information sharing between tasks into the learning objective. <cit.> proposes to penalize the number of edge additions which breaks down into local calculations, i.e., the number of differences of parent nodes for different tasks, to explore shared and unique structural features among tasks in a more robust way. <cit.> proposes to model multiple DAGs by encoding the relationships between different DAGs into an undirected network. As an alternative solution for multi-task graph learning, hidden structures are exploited to fuse the information across tasks. The idea is first to find shared hidden structures among related tasks and then treat them as the structure penalties in the learning step<cit.>. Later, to better address the situation that the shared hidden structure comes from different parts of different DAGs, <cit.> proposes to use a non-negative matrix factorization method to decompose the multiple DAGs into different parts and use the corresponding part of the shared hidden structure as a penalty in different learning tasks. However, these methods penalize graph differences based on their general topology structure, which yet does not represent causal structure. To better add a penalty from a causality perspective, <cit.> proposes to regularize causal orders of different tasks to be the same. However, all the above methods should assume different tasks share the same node set and cannot be applied for tasks with both shared and specific nodes. §.§ Congestion Causes Analysis Smart transport has been an essential chapter, yet with many works focusing on demand prediction <cit.>, trajectory <cit.>, or etc. Congestion root analysis instead should gain more attention since it is safety-related. It uses traffic variables to classify congestion into several causes. <cit.> uses linear regression to diagnose and assign observed congestion to various causes. <cit.> propose a real-time classification framework for congestion by vehicular ad-hoc networks. <cit.> uses BN to estimate the conditional probability between variables. <cit.> divides the nodes in BN into three groups, representing the environment, external events, and traffic conditions, and uses the discrete BN to estimate the causal relationships between nodes. However, the studies above did not involve the correlations between different congestion causes and just classified the congestion into several simple categories. Besides, BN <cit.> has also been applied to congestion propagation <cit.>. Other propagation models include the Gaussian mixture model <cit.>, congestion tree structure <cit.>, and Bayesian GCN <cit.>. Yet we focus on the root causes analysis instead of congestion propagation. § METHODOLOGY We assume there are in total L tasks. For each task l=1,…, L, we have P_l nodes, with the node set _l={1,…,P_l}. The node j in task l is denoted as x_j (l)∈ℝ^T_j(l) representing a variable with dimension T_j(l). Depending on T_j(l), a node x_j(l) can represent multi-modal data: x_j(l) is a scalar when T_j(l)=1, a vector when T_j(l)∈ [2,∞), and a function if T_j(l) = ∞. We aim to construct a DAG for task l, i.e., _l=(_l,_l), where the edge set _l∈ℝ^P_l× P_l and an edge (j, k) represents a causal dependence x_j(l)→ x_k(l). In Section <ref>, we temporarily focus on a single task and assume that the causal structure is known. We construct a probabilistic representation of multi-mode DAG by multimode to multimode regression, called mulmo2 for short. Then in Section <ref>, we consider all the L tasks and propose a score-based objective function for structural learning. Its core is how to measure and penalize the causal structure difference of different tasks. Here we provide a novel measure, CD, together with its differentiable variant DCD, which tries to keep the transitive causalities among overlapping nodes of different tasks to be consistent, as elaborated in Section <ref>. Finally, in Section <ref>, we give the optimization algorithm for solving the score-based multi-task learning. §.§ Multi-mode DAG with Known Structure We temporarily focus on single-task learning. For notation convenience, we remove the subscript l of _l in Section <ref>. Besides, we temporarily assume that causal structure , i.e., the parents of each node, are known. We denote the parents of the node j as pa_j={j'\| (j',j)∈)}. Thus, the joint distribution for sample n is the production of the conditional distribution of each node. p(x^(n)_1,…,x^(n)_P) = ∏_j=1^P p(x^(n)_j\|pa_j) When the multi-mode nodes have finite dimensions, the relationships among a multi-mode node j and its parent j'∈ pa_j can be represented by the following mulmo2 regression model: x^(n)_j = ∑_j' ∈ pa_jℓ_j'j(x^(n)_j') + e_j^(n) where ℓ_j'j is the linear transform of x_j' for (j',j) ∈, e_j^(n) is the noise of x_j^(n) with the expectation 𝔼[e_j^(n)]=0. We consider ℓ_j'j for four cases by whether T_j or T_j' is infinite, as shown in Fig. <ref>. If T_j or T_j' is infinite, we consider x_j or x_j' as a functional variable. From the following, by abuse of notation, we define a vector node as _j, a function node as x_j(t), t ∈Γ. Without loss of generality, we assume the Γ=[0,1] is a compact time interval for all the function nodes. Case 1: Both of two nodes have finite dimensions, i.e., T_j, T_j' < ∞. Then the transition equation is a normal regression: ( ℓ_j'j(_j'^(n)))_t = ∑_s=1^T_j' c_j'jst_j's^(n), t= 1,…, T_j. Here c_j'jst is the coefficient of component s of the vector _j' to component t of the vector _j and (j',j) ∈. Case 2: _j has finite dimensions (vector) and x_j'(t) has infinite dimensions (function), i.e., T_j < ∞, T_j' = ∞. Then ℓ_j'j is: (ℓ_j'j(x_j'^(n)(s)))_t = ∫_0^1 γ_j'jt(s) x^(n)_j'(s) ds,t= 1,…, T_j. Here γ_j'jt(s) is the coefficient function for component t in vector _j and (j',j) ∈. Case 3: x_j(t) has infinite dimensions (function) and _j' has finite dimensions (vector), i.e., T_j = ∞, T_j' < ∞. In this case, the linear regression between vector-to-function regression is: ℓ_j'j(_j'^(n))(t) = ∑_s=1^T_j'γ_j'js(t) ^(n)_j's, where γ_j'js(t) is the coefficient function for s-th component in vector _j' and (j',j) ∈. Case 4: Both of two nodes have infinite dimensions, i.e., T_j, T_j' = ∞, Then, the linear function-to-function (func2func) regression is: ℓ_j'j(x_j'^(n))(t) = ∫_0^1 γ_j'j(t,s) x^(n)_j'(s) ds, where γ_j'j(t,s) is the coefficient function for (j',j) ∈. For any node j∈{j∈\|T_j=∞}, x_j(t) is in infinite dimensions and hard to be estimated directly. It is common to decompose them into a well-defined continuous space for feature extraction: x_j^(n)(t) = ∑_k=1^K_jα_jk^(n)β_jk(t) + ε_j^(n)(t), where β_jk(t) is the orthonormal functional basis, with ∫_0^1 β_jk(t)^2 dt = 1 and ∫_0^1β_jk(t)β_jk'(t) dt = 0 for k,k'=1,… K_j and k k', α_jk^(n) is the corresponding coefficient. α_jk^(n) and β_jk(t) can be obtained by Functional Principal Component Analysis (FPCA) <cit.>, and ε_j^(n)(t) is the residual of FPCA. After decomposing the functional variables x_j(t), we describe transition γ in Cases 2, 3, and 4 using the corresponding basis set: γ_j'jt(s) =∑_k'=1^K_j' c_j'jtk'β_j'k'(s) γ_j'js(t) =∑_k=1^K_j c_j'jskβ_jk(t) γ_j'j(t,s) =∑_k=1^K_j∑_k'=1^K_j' c_j'jk'kβ_jk(t)β_j'k'(s). Plugging Eqs. (<ref>) and (<ref>) into Eqs. (<ref>), (<ref>), (<ref>), (<ref>) and (<ref>), we have the general expression of our mulmo2 regression: ^(n)_j = ∑_j' ∈ pa_j_j'j^T ^(n)_j' + ^(n)_j, where a^(n)_j = ^(n)_j ∈ℝ^T_j T_j < ∞ ^(n)_j ∈ℝ^K_j T_j = ∞ , _j^(n)=[α_j1^(n),…,α_jK_j^(n)] is the PC score of node j in sample n, and _j'j∈ℝ^d(_j') × d(_j) represents the transition matrix from node j' to node j, with (_j'j)_uv = c_j'juv and d(_j) as the dimensions of _j. _j^(n)∈ℝ^d(_j) is the noise, with 1) _j^(n) = _j^(n) if T_j<∞, and 2) (_j^(n))_k = ∫_0^1 e_j^(n)(t) β_jk(t) dt, if T_j=∞. We have 𝔼[_j^(n)] = 0 in these two cases. It is to be noted that we can also conduct PCA to perform dimension reduction for vector variables like _j^(n) = ∑_k=1^K_jα_jk^(n)_jk + _j^(n), and replace the finite cases in Eq. (<ref>) by _j^(n)=_j^(n)∈ℝ^K_j, K_j ≤ T_j. We assume noise _j follows Gaussian distribution independently and interpret Eq. (<ref>) as linear Structural Equation Model (SEM): ^(n) = ^T ^(n) + ^(n). Here ^(n) = [^(n)_1,…,^(n)_P]∈ℝ^M, ^(n)=[_1^(n),…,_j^(n)]∈ℝ^M is the noise vector, and = [_j'j] ∈ℝ^M× M is the combined matrix where M = ∑_j d(_j). §.§ Multi-task Learning of Multi-mode DAG Now we discuss how to estimate the DAG structures for all the tasks. First, we introduce the concept of causal order π(·), which informs possible “parents” of each node. It can be represented by a permutation over 1, 2, …, P. If we sort the nodes set by their causal orders, the sorted sequence satisfies that the left node is a parent or independent of the right node. A graph =(,) is consistent with a causal order π if and only if: (i,j) ∈⇒π(i) < π(j). In SEM of Eq. (<ref>), we focus on estimating the transition matrix and its causal order π. The non-zero entries of the matrix denote the edges of the graph =(,) that must consistent with π, i.e., _ij_F^2>0 ⇒π(i) < π(j). We denote _ij = _ij_F^2 to represent the weight of edge from node i to node j, where _ij>0 means (i,j)∈. Based on the acyclic constraint proposed by NoTears <cit.>, our score-based estimator of single-task is: = min1/2N - _F^2 + λ_1 subject to h() = tr(e^) - P = 0 . where =[^(1),…,^(N)]^T∈ℝ^N× M. For all the tasks l=1,…,L, we denote their corresponding SEMs as: _(l) = _(l)^T _(l) + _(l), where _(l)∈ℝ^N_l × M_l, _(l)∈ℝ^M_l × M_l, and _(l)=[_(l)^(1),…,_(l)^(N_l)]^T∈ℝ^N_l × M_l is the noise matrix of N_l samples of task l. The core of multi-task learning lies in how to achieve information sharing between tasks. To this end, we add the penalty term to penalize the difference between pairwise tasks and derive a score-based function of multi-task learning as follows: _(1),...,_(L) = _(1),...,_(L)min∑_l=1^L 1/2N_l_(l) - _(l)_(l)_F^2 + ρ∑_l_1,l_2 s_l_1,l_2 DCD(_(l_1), _(l_2)) + λ∑_l=1^L _(l)_1 s.t. h(_(l)) = tr(e^_(l)) - P_l = 0, ∀ l where _(l)ij = _(l)ij_F^2, s_l_1,l_2 is the given constant reflecting the similarity between tasks l_1 and l_2. The penalty term DCD(_(l_1), _(l_2)) is defined as Differentiable Causal Difference of the DAGs between task l_1 and task l_2 (discussed in Section <ref>). ρ controls the penalty of the difference in causal orders, where larger ρ means less tolerance of difference. λ controls the L_1-norm penalty of _(l) which guarantees that _(l) is sparse. §.§ Design the Causal Difference We propose a novel differentiable measure to quantify causal structure difference between two DAGs. First, we introduce the current most commonly used measures for graph structure difference. They are limited when formulating the transitive causality between two DAGs (details below). Then we introduce the motivation of Causal Difference measure CD and its definition. Finally, we propose DCD as the differentiable CD and discuss its asymptotic properties. Current metrics for graph structure difference include spectral distances, matrix distance, feature-based distance <cit.>. A simple idea is to directly count how many edges are different between two graphs, denoted as Δ(_u, _v). It is a special case of matrix distance _u - _v_0, and _u, _v is the adjacency matrix of graph _u, _v. Δ(_u, _v) defines the edge difference of _u and _v: Δ(_u,_v) = ∑_i ∈_u ∩_v∑_j ∈_u ∩_v𝕀(𝕀((i,j)∈_u) 𝕀((i,j) ∈_v) ) where _u, _v ⊆{1, 2, …, P } are the node sets of the graph _u, _v, respectively. 𝕀(·) is the indicator function. If node i and node j both appear in _u, _v, the difference is increased by one if the edge (i,j) appears in _u but not in _v and vice versa. However, Δ(_u, _v) does not consider the edges of distinct nodes of _u, _v. This is reasonable since, in our context of multi-task learning, we only need to penalize the model difference for the shared parts, i.e., the graph structure for the overlapping nodes. A novel measure considering transitive causality: Δ(_u, _v) performs well if we only focus on the graph structure difference. However, it cannot reveal the transitivity of causal relationships in graphs. We use the three graphs _a, _b, _c in Fig. <ref> to demonstrate this point. (1) Case I: The difference between _a and _b. In this case Δ(_a, _b) = 2 since the edges X → W, Y → W appear in _a, not in _b. But from another perspective, if we sort the nodes set by their causal orders, the sorted sequence in _a is X,Y,Z,W, and the sorted sequence in _b is X,Y,W. If we remove Z in _a, the sorted sequence of _a and _b are exactly the same. The edge difference between _a and _b is due to the transitive causality passing Z, which is excluded in _b. Thus, the ideal Causal Difference measure should be CD(_a, _b)=0, which is formally defined in Def. <ref>. (2) Case II: The difference between _a and _c. To solve the problem of Case I, at first glance, we can use causal order <cit.> and kernels for permutation <cit.> as a causal difference measure directly. However, it has an uncertainty problem, as shown in Fig. <ref>.(b). In _c, the sorted sequence is either X,Y,Z,W or Y,X,Z,W, which are equivalent. But in _a, the sorted sequence is unique X,Y,Z,W. This difference is caused by that there is an edge X → Y in _a, which determines the causal order that π(X)<π(Y), but not in _c. In this case, the causal difference measure between the two graphs should be considered, i.e., CD(_a,_c) > 0. Our design: The two cases mentioned above motivate us to propose a new measure to evaluate the causal difference. Instead of using causal order, which is a one-dimensional sequence, here we define a transitive causal matrix to better consider causal order with uncertainty. Define the transitive causal matrix ^() as: ^()_ij∈ℝ^\|\| × \|\| = 1 π(i)<π(j) for all π consistent with 0 π(i)>π(j) for all π consistent with 0.5 Otherwise We can see that when the causal order of nodes i and j is interchangeable, instead of randomly setting their orders either as i→ j or j → i, we deterministically set their causal relation ^()_ij= ^()_ji=0.5 symmetrically. Then we define our CD measure, which is the difference between the overlapping parts of the transitive causal matrices of two graphs: Define the Causal Difference between _u, _v as CD(_u, _v) with following formula: CD(_u, _v) = ∑_i ∈_u ∩_v∑_j ∈_u ∩_v (^(_u)_ij - ^(_v)_ij)^2. By Definitions <ref> and <ref>, we can see CD(_u, _v) describes the transitive causal difference between DAGs better. Fig. <ref> illustrates our design of ^_a, ^_b and ^_c, which can be viewed as “fully-connected” versions of _a, _b and _c. We obtain the causal effect behind the graph and obtain graph ^. From Fig. <ref>, we show that the edges X → W and Y → W appear in both ^_a and ^_b, which indicates CD(_a, _b)=0. Meanwhile, in _a^, the edge X → Y is directed with weight 1, but in graph _c^, this edge is bi-directed with weight 0.5. From Eq. (<ref>), CD(_a, _c) = 0.5^2 + 0.5^2 = 0.5. Topological Interpretation: We further give a topological interpretation of ^* and CD(_u, _v). By showing that ^* lies in a T_0 space (or Kolmogorov space <cit.>), we prove that CD is equivalently defined by the projection and a distance metric of T_0 spaces. Define _ is the set of ^* matrix generated by node set , i.e., _={^()\|=(,), ∀}. _ is a finite T_0 space with \|_\|=α(\|\|), where α(n) is the number of distinct T_0 topologies with n points, and ^() ∈_ corresponds to a unique T_0 topology. Since ^() is a bi-directed transitive causality on the set , Lemma <ref> is proved by <cit.>. Define D__(^(_1),^(_2))=^(_1)-^(_2)_F^2, ∀^(_1),^(_2) ∈_, which is a distance metric of space _. Define the projection function f_,':_→_' as f(^())= ^(') where ' ⊆, ' = (',') with '={(i,j) \| (i,j) ∈, i,j ∈' }. The causal difference CD in Eq. (<ref>) can be represented by the following formula: CD(_u,_v) = D__(f__u,(^(_u)), f__v,(^(_v))) where _u=(_u, _u), _v=(_v, _v), and =_u ∩_v, D__ means the distance metric in space _. D(f__u,(^(_u)), f__v,(^(_v))) = f__u,(^(_u)) - f__v,(^(_v)) _F^2 = ∑_i ∈∑_j ∈ (f__v,(^(_v))_ij - f__v,(^(_v))_ij)^2 = ∑_i ∈_u, _v∑_j ∈_u, _v (^(_u)_ij - ^(_v)_ij)^2 = CD(_u, _v) Lemma <ref> shows that our design ^() lies in a T_0 space _. Using Def. <ref> and <ref>, we define the distance metric in T_0 space and the projection function of two T_0 spaces. Finally, Theorem <ref> shows that our difference measure CD(_u,_v) can be represented by the distance in space _, where =_u ∩_v, as shown in Fig. <ref>. Continuous Trick : Although ^* and CD(_u,_v) have such good properties, they are incompatible with the current score-based algorithm in Eq. (<ref>) since ^* is discrete thus without gradient. To still guarantee our structure learning algorithm can be solved with gradient-based methods, we further derive a differentiable design as an approximation of ^* in Def. <ref>, and also prove the consistency for the conversion. Define the differentiable transitive causal matrix as () = S(c(l() - l()^T)), where l() = + ∑_i=1^P^i. c is a positive constant, is the adjacency matrix of graph =(,), _ij > 0 means (i,j) ∈, function S is the element-wise Sigmoid function for matrix with S()_ij = 1/1 + exp(-_ij). If is the adjacency matrix of graph =(,). The differentiable transitive relation matrix () converges to the transitive relation matrix ^() as c →∞. In Eq. (<ref>), l()=++^2+⋯, where the entries of matrix power ^k_ij are the sum of the weight products along all k-step paths from node i to node j. Therefore, l()_ij=0 means that node j cannot be reached from node i in graph , l()_ij > 0 means that node j can be reached from node i in graph . Since is acyclic, l()_ij and l()_ji have three cases: (1) l()_ij>0, l()_ji=0, representing the case π(i)<π(j): lim_c →∞()_ij = lim_c →∞ Sigmoid(cl()_ij) = 1 = ^()_ij (2) l()_ij=0, l()_ji>0, representing the case π(i)>π(j): lim_c →∞()_ij = lim_c →∞ Sigmoid(-cl()_ji) = 0 = ^()_ij (3) l()_ij=0, l()_ji=0, representing the case that the relationship between π(i) and π(j) is not sure, and ()_ij = Sigmoid(0)=^()_ij=0.5. Combining cases (1) to (3): lim_c →∞() = ^() Theorem <ref> proves the consistency of and ^ when c→∞. In the algorithm, c can be set to a relatively large constant and avoid floating point overflow. Therefore, the Differentiable Causal Difference DCD is given by: DCD(_u, _v) = ∑_i ∈_u, _v∑_j ∈_u, _v ((_u)_ij - (_v)_ij)^2, which is used in our multi-task score-based algorithm in Eq. (<ref>). §.§ Structural Learning Algorithm To solve Eq. (<ref>), following the algorithm proposed by <cit.>, we derive a structural learning algorithm based on the Lagrangian method with a quadratic penalty, which converts the score-based method in Eq. (<ref>) to an unconstrained problem: F(_(1),...,_(L)) = _(1),...,_(L)minmax_β>0 f(_(1),...,_(L)) + ∑_l=1^L β h(_(l)) + α^2/2 h(_(l))^2, where f = ∑_l=1^L 1/2N_l_(l) - _(l)_(l)_F^2 + ρ∑_l_1,l_2 s_l_1,l_2DCD(_(l_1), _(l_2)) + λ∑_l=1^L _(l)_1. β is dual variable, α is the coefficient for quadratic penalty. We solve the dual problem by iteratively updating f(_(1),...,_(L)) and β. Due to the smoothness of objective F, Adam <cit.> is employed to minimize F given β, and update β by β←β + α∑_l=1^L h(_(l)). The overall steps are summarized in Algorithm <ref> and the convergence property of our algorithm is fully discussed by <cit.>. The partial derivative function of F for _(1), …, _(L) are computed by the following three parts: (1) Derivative of _(l) - _(l)_(l)_F^2: ∂_(l) - _(l)_(l)_F^2/∂_(l) = -2 ^T_(l) (_(l) - _(l)_(l)). (2) Derivative of h(_(l)): ∂ h(_(l))/∂_(l)ij = ∂ h(_(l))/∂_(l)∂_(l)/∂_(l)ij. where ∂ h(_(l))/∂_(l) = e^_(l), ∂_(l)/∂_(l)ij can be obtained from the definition _(l)ij=_(l)ij_F^2. (3) Derivative of DCD(_(l_1), _(l_2)): ∂ DCD(_(l_1), _(l_2))/∂_(l)ij = ∂ DCD/∂ l(_(l_1))∂ l(_(l_1))/∂_(l_1)∂_(l_1)/∂_(l_1)ij ∂ DCD/∂ l(_(l_1))_ij = 2Q(cl(_(l_1))_ij-cl(_(l_1))_ji, cl(_(l_2))_ij-cl(_(l_2))_ji) where Q(x,y) = 2c e^x (e^x - e^y)/(1 + e^x)^3 (1 + e^y) ∂ l(_(l_1))_kl/∂_(l_1)ij = ∑_p=1^P ∑_r=1^p (_(l_1)^r_ij_(l_1)^(p-r-1))_kl where _ij is a P_l_1× P_l_1 matrix with (_ij)_ij=1 and 0 in other entries. Denote P=max P_l and M=max M_l, in each Adam iteration, the overall computation complexity is O(LNM+L^2P^2M^2+LP^6). The detailed math is in Appx. <ref>. §.§ Extension to nonlinear cases Our model can be extended to nonlinear models with ease. To model a nonlinear system, we would need to design two components. Firstly, we develop the transition function in DAG, which can be expressed as 𝔼(X_j\|X_pa_j)=g_j(f_j(X)), where f_j:ℝ^T→ℝ and g_j:ℝ→ℝ. In our design, we utilized mo2mo regression to construct f_j and g_j. However, these functions can also be constructed using kernel or deep methods such as graph neural network <cit.>. Secondly, we would need to construct an adjacency matrix of the causal graph, W, that satisfies the condition f_ij 0 → W_ij>0. An easy way to achieve this is by setting W_ij=\|\|f_ij\|\|_L^2. Then the objective loss function can be constructed and the Notears constraints can be added. By following this procedure, our multitask design with the CD constraints can also be added. Consequently, our multi-task learning framework can be easily extended to nonlinear models. § EXPERIMENTAL STUDY §.§ Synthetic Data The set of experiments is designed to demonstrate the effectiveness of MM-DAG. We first generate a “full DAG” _0 with P nodes: _0 ∈{0, 1}^P × P with [_0]_ij = 𝕀([e^]_ij>0), where is generated by Erdös-Rényi random graph model <cit.>. Nodes 1, 2, …, ⌊ P/2⌋ are set as scalar variables, and nodes ⌊ P/2+1⌋, …, P are functional variables with the same K Fourier bases ν_1(t), …, ν_K(t). Therefore, the node variables can be represented by: ^(n)_j = ^(n)_j for scalar nodes ∑_k=1^K a_jk^(n)ν_k(t) for functional nodes , Then, we sample L sub-graphs from _0 as different tasks. For task l with _(l), we randomly select node set _(l)⊆{1,2,...,P} with P/2 ≤ \|_(l)\| ≤ P, and denote node i in task l as node[l,i], that is, {node[l,i]\|i∈_(l)} = _(l). To generate N samples for L tasks, we first generate _(l)ij = c_(l)ij * _(l)ij * [_0]_node[l,i], node[l,j], where c_(l)ij is sampled from the uniform distribution 𝒰(-2, -0.5) ∪ (0.5,2) and _(l)ij is a matrix whose diagonal is 1, with the dimension the same as _(l)ij. Thus, we ensure the causal consistency of tasks _(l) generated by _0. Then we generate _j^(n) according to Eq. (<ref>) with _j^(n)∼ N(0,𝐈). For evaluation, F1-score (F1), false positive rate (FPR), and true positive rate (TPR) <cit.> are employed as the quantitative metrics. Higher F1 (↑) and TPR (↑) indicate better performance, whereas FPR is reversed (↓). We compare our MM-DAG with four baselines. (1) Separate based on NoTears <cit.> is to learn the multi-modal DAG for each task separately by optimizing Eqs. (<ref>) and (<ref>). (2) Matrix-Difference is to use the matrix distance Δ as the difference measure in the multi-task learning algorithm, which has limitations to handle Case I. (3) Order-Consistency is the multi-task causal graph learning of <cit.>, which assumes all the tasks have the same causal order. It has limitations in dealing with Case II (See Fig. <ref>). (4) MV-DAG: Instead of mo2mo regression, MV-DAG implements a preprocessing method for functional data by dividing the entire time length of the function into 10 intervals and averaging each interval. This transforms each functional data into a ten-dimensional vector. We show the difference between the five models in Table <ref>. Relationship between model performance and sample size: We first fix the number of tasks (DAGs) L=4. The evaluation metrics are shown in Fig. <ref> under different sample sizes. We see that MM-DAG outperforms the baselines, with the highest F1 score and a +2.95% gain than the best peers, i.e., order-consistency, when N=50, and +11.9% gain than Matrix-Difference when N=200, 400. The performance of the four methods improves as the number of samples N increases. Notably, we discover that the F1 score of baseline Matrix-Difference is stable at 0.83 even if we increase N from 100 to 400. This is attributed to biased estimates caused by the fact that the matrix difference incorrectly penalizes the correct causal structure of the task. This bias cannot be reduced by increasing the number of samples. Thus, the F1 score of Matrix-Difference cannot reach 100%. By comparing our proposed MM-DAG model to the MV-DAG model, we verify the contribution of the multi-modal design. Relationship between model performance and the number of tasks: We set the sample size N=10, and investigate the effect of task size L. The results are shown in Fig. <ref>, from which the salient benefits of our proposed MM-DAG can be concluded: As the number of tasks increases, the performance of our method improves the fastest, but the baseline Separate holds. Promisingly, our method gains a maximum +16.1% gain on F1 against its best peers, i.e., order-consistency, when L=32. It can successfully exploit more information in multi-task learning since it can better deal with the uncertainty of causal orders. All of those demonstrate the superiority of MM-DAG. Visualization: We also visualize the learned DAGs in Fig. <ref>, which shows the estimated adjacent matrix (edge weights) _l of MM-DAG, Order-Consistency, and Matrix-Difference. MM-DAG derives the most accurate results, which indicates that it achieves the best performance in estimating the DAG structure. Appx. <ref> shows the detailed experiments result in the case that N=20, L=10 and shows that our MM-DAG have best F1 score. Ablation study of CD penalty and L1-norm penalty: We conduct an ablation study with number of nodes N=20 and number of tasks L=10. The results of MM-DAG(λ=0.01,ρ=0.1), MM-DAG(λ=0,ρ=0.1) and MM-DAG(λ=0.01,ρ=0) are shown as follows. The result shows that the L_1 penalty imposed by λ can reduce overfitting and reduce FDR. The causal difference penalty imposed by ρ can combine task information to decrease FDR and increase TPR. §.§ Congestion Root Causes Analysis For the traffic scenario application, we apply our method to analyze the real-world congestion causes of five intersections in FenglinXi Road, Shaoxing, China, including four traffic light-controlled intersections and one traffic light-free intersection, as shown in Fig. <ref> in Appendix <ref>). The original flow is taken from the peak hour around 9 AM. We reconstruct the exact flow given our real data. According to reality, the scenario is reproduced in the simulation of urban mobility (SUMO) <cit.>. There are three types of variables in our case study, as summarized in Table <ref>: (1) The scalar variables X, such as Origin-Destination (OD) or intersection turning probability, represent the settings of SUMO environment and can be adjusted. (2) The functional variables Y(t) represent the traffic condition variables such as mean speed or occupation. (3) The vector variables R represent the congestion root cause. Since these types of variables are obtained at a lower frequency compared with the traffic condition variables, we can regard them as vectors. For each sample, we set different levels on each variable of X, then Ys are collected by the sensor in SUMO, and Rs are obtained with rule-based algorithms. The characteristics of five intersections are summarized in Table <ref>. The second intersection has no traffic light; thus, it has only six nodes without traffic light-related variables X_3, R_1, R_2, R_4. Since the number of lanes is different, the number of X varies across tasks, which leads to a different number of samples. Practically, traffic setting variables affect the congestion situations, and the different types of congestion can lead to changes in traffic condition variables. Therefore, it is assumed that there is only a one-way connection from X to R and from R to Y (This hierarchical order, i.e., scaler → vector → functional data, is only specific to this domain, which should not be generalized to other domains). Furthermore, considering the setting variables are almost independent, there are no internal edges between different Xs. Additionally, we assume that some congestion causes may produce others, which should be concerned about. To this end, the interior edges in R are retained when estimating its causal structure. In the multi-task settings, we assign the task similarity s_i,j as the inverse of the physical distance between intersection i and intersection j. For the functional PCA, the number of principal components is chosen as K=5. Fig. <ref> shows the results of our multi-task learning algorithm. One can figure out the results by analyzing the points of commonalities and differences in the 5 tasks. The variables (nodes) in each task (DAG) are divided into three hierarchies, i.e., X, R, and Y for better illustration. We can find some interesting insights from the results. For the four intersections with traffic lights, the causal relationships are similar to local differences. Generally, for edges from X → R, changes in OD demand affect traffic congestion, irrational phase sequences, and long cycle times. Turning probability adjustments can slightly result in congestion and irrational phase sequences with lower likelihoods, whereas traffic light adjustments may cause long signals or short signal times and irrational phase sequences. For edges from R → R, we can see both irrational phase sequences and congestion may lead to an irrational guidance lane. For edges from R → Y, congestion, irrational phase sequences, and irrational guidance lanes can cause high occupancy and yet low speed. It is to be noted that for tasks 4 and 5, the cycle time of the traffic light will not lead to its short cycle time. This might be because they are three-way intersections and have smaller traffic flows. Consequently, short cycle time may not occur. For the traffic light-free intersection Task-4, its causal relations are the same as the overlapping parts of the other four. We can draw some primary conclusions from Fig. <ref>(a) that: (1) The change of OD demand is the most critical cause for traffic congestion, whereas the impact of turning probability on it is slight (edge weight < 0.1). (2) Cycle time does not directly cause congestion, but sometimes it can produce irrational phase sequence and thus cause congestion indirectly. In Appendix <ref>, we further test our model when dealing with a more complex and realistic case where all the intersections are connected and interdependent. § CONCLUSION This paper presents the multi-task learning algorithm for DAG to deal with multi-modal nodes. It first conducts mulmo2 regression to describe the linear relationship between multi-modal nodes. Then we propose a score-based algorithm for DAG multi-task learning. We propose a new CD function and its differentiable form to measure and penalize the difference in causal relation between two tasks, better formulating the cases of unincluded nodes and uncertainty of causal order. We give important theoretical proofs about topological interpretation and the consistency of our design. The experiments show that our MM-DAG can fuse the information of tasks and outperform the separate estimation and other multi-task algorithms without considering the transitive relations. Thus, our design of causal difference has a strong versatility, which can be extended to other types of multi-task DAG in future work, such as federated multi-task DAG learning <cit.>. It is worth mentioning that we start the multi-task DAG learning for multi-modal data with a linear model first since this field is still unexplored and linear assumption is easy to comprehend. ACM-Reference-Format APPENDIX This appendix provides additional details on our paper. Appendix <ref> analyzes the complexity of our algorithm for each Adam iteration. Appendix <ref> presents detailed results from our numerical study. Appendix <ref> introduces a new SUMO scenario and compares the results with those from the old scenario. Appendix <ref> discusses the potential future work. § COMPUTATION OF THE COMPLEXITY The most computationally heavy part is computing the gradients in Section <ref>. We calculate the computation complexity of each iteration in the gradient-based algorithm as follows: * Derivative of 𝐀_(l) - 𝐀_(l)𝐂_(l)_F^2: the computation complexity is O(N_lM_l). Therefore, for all tasks, the computation complexity is O(∑ N_lM_l). * Derivative of h(W_(l)): the computation complexity is O(P_l^2M^2_l). Therefore, for all the tasks, the computation complexity is O(∑ P^2_lM^2_l). * Derivative of DCD(W_(l_1), W_(l_2)): We can preprocess ∂ l(W_(l_1))_kl/∂ W_(l_1)ij for all i, j, k, l ∈{1,…,P_(l_1)}. The complexity of this part is O(P_l_1^6). Then for all DCD(W_(l_1), W_(l_2)), we use O(P_l_1P_l_2M_l_1M_l_2) to compute its derivative. Therefore, for all pairs of tasks, the computation complexity is O(∑_l_1∑_l_2P_l_1P_l_2M_l_1M_l_2+∑_l P_l^6). Denote P=max P_l and M=max M_l; in each Adam iteration, the overall computation complexity is O(LNM+L^2P^2M^2+LP^6). § DETAILED RESULT OF NUMERICAL STUDY Table <ref> presents a comprehensive overview of the numerical study with N=20 and L=10. In the following analysis, we will delve into the results and draw a conclusion based on the performance presented in the table. Explanation of the difference between MV-DAG and MM-DAG: The MV-DAG approach cuts each functional data into a 10-dimensional vector by averaging the values within each of the 10 intervals. Compared to MM-DAG, MV-DAG has a 61.7% lower F1 score, and we believe the reasons are twofold: * This preprocessing approach, working as a dimension reduction technique, may result in the loss of critical information of functional data. * in MM-DAG, we delicately design a multimodal-to-multimodal (mulmo2) regression, which contains four carefully-designed functions, i.e., regular regression, func2vec regression, vec2func regression, and func2func regression (as shown in Fig. <ref>); whereas the MV-DAG only contains regular regression since all the function data have been vectorized. The contribution of CD design: The performance of these three baselines (order-consistency, Matrix-Difference, Separate) in the new settings as in Table <ref> above. It is worth mentioning that all three baselines underwent the same multimodal-to-multimodal regression and got the same matrix A. The table clearly indicates that our 'CD' design significantly contributed to improving the F1 score: MM-DAG has another +6.7% F1 gain compared to order-consistency, as well as another +23.8% F1-score gain compared to Matrix-Difference. These performance gains come purely from our CD design. The effectiveness of multitask learning: By comparing MM-DAG with the baseline Separate, we show that it is essential to train the multiple overlapping but distinct DAGs in our multitask learning manner. Conclusion: We compared our proposed MM-DAG model to the MV-DAG model to verify the contribution of the multi-modal design. Additionally, we compared MM-DAG to the Order-Consistence, Matrix-Difference, and Separate models to demonstrate the effectiveness of our Causal Difference design. By combining these two comparisons, we have shown the effectiveness of both designs. § NEW SUMO SCENARIO We constructed a more complex traffic scenario in SUMO, where 5 neighbor intersections in FengLinXi Road are used. In this case, the 5 intersections are not independent of the others. The detailed SUMO settings are as follows: * For the OD demand, we set OD demand as the number of total OD pairs in a scenario and randomly assign the origin and destination for each OD pair in the SUMO. * For the turning probability, we calculate the turning vehicles at each intersection and divide by the total number of vehicles. * The definition and collection of the remaining variables remain unchanged. * In this new scenario, there is a new cause of congestion: [sup-demand], corresponding to OD demand exceeds the capacity of the intersection, as shown in Task 2 of our new results in Fig. <ref>. Yet this cause of congestion never occurred in the old scenario, so we did not plot this node in the DAGs of the old case study. We have 96 samples in total, where each sample corresponds to a scenario in FengLinXi Road (Seeing Fig. <ref>). For each task, the data is collected by the sensors of the corresponding intersection. The result is shown in Fig. <ref>. We give an interpretation of the difference in DAGs between the old scenario and the new scenario. In the old scenario, the 5 intersections are independent. But in the new scenario, the 5 intersections are cascaded and dependent. The variable [OD-demand] is shared in all the DAGs since all the tasks used the same OD-demand. In the future revised manuscript, we will add both the independent case and dependent case, and the two cases have their own real-world applications. * Independent case: In the starting phase of deploying the traffic control systems, usually several single intersections are selected for the trial and cold-start. This trial period sometimes will last for more than one year and those intersections are usually scattered around different regions of a city. * Dependent case: When the traffic signal control systems scale up and more intersections are signaled, sub-areas will be set up where up to eight intersections will be connected. As we could observe in the Fig. <ref>: * The results of the two cases are different, which are reasonable given the two different assumptions. * But we could still observe that the two results share quite consistent causal relations. For example, the thickest edges with weight > 0.5 are quite consistent in both independent and dependent cases. * And we do admit that in the Dependent Case, the DAGs have unexpectedly better properties: (1) The DAGs are more sparse; (2) There are more shared edges across five different tasks. For example, the edge "Lane-Irrational" to "Congestion" appears in all five tasks. § POTENTIAL FUTURE WORK In future work, we may like to try some deep learning methods. For example, we can consider incorporating layers able to deal with functional data <cit.>, and then extracting nonlinear features for all the nodes using graph neural network <cit.>. § ACKNOWLEDGEMENTS This paper was supported by the SenseTime-Tsinghua Research Collaboration Funding, NSFC Grant 72271138 and 71932006, the BNSF Grant 9222014, Foshan HKUST Projects FSUST20-FYTRI03B and the Tsinghua GuoQiang Research Center Grant 2020GQG1014.
http://arxiv.org/abs/2306.10429v1	20230617214407	An Architectural Design Decision Model for Resilient IoT Application	[ "Cristovao Freitas Iglesias Jr", "Claudio Miceli", "Miodrag Bolic" ]	cs.SE	[ "cs.SE" ]	Star-formation driven outflows in local dwarf galaxies as revealed from [CII] observations by HerschelHerschel is an ESA space observatory with science instruments provided by European-led Principal Investigator consortia and with important participation from NASA. M. RomanoE-mail: [email protected],2 A. Nanni1,3 D. Donevski1,4,5 M. Ginolfi6 G. C. Jones7 I. Shivaei8 Junais1 D. Salak9,10 P. Sawant1 Accepted 16 June 2023 ========================================================================================================================================================================================================================================================================= The Internet of Things is a paradigm that refers to the ubiquitous presence around us of physical objects equipped with sensing, networking, and processing capabilities that allow them to cooperate with their environment to reach common goals. However, any threat affecting the availability of IoT applications can be crucial financially and for the safety of the physical integrity of users. This feature calls for IoT applications that remain operational and efficiently handle possible threats. However, designing an IoT application that can handle threats is challenging for stakeholders due to the high susceptibility to threats of IoT applications and the lack of modeling mechanisms that contemplate resilience as a first-class representation. In this paper, an architectural Design Decision Model for Resilient IoT applications is presented to reduce the difficulty of stakeholders in designing resilient IoT applications. Our approach is illustrated and demonstrates the value through the modeling of a case. § INTRODUCTION Internet of Things (IoT) application is defined as a collection of automated procedures and data integrated with heterogeneous entities (hardware, software, and personnel) that interact with each other and with their environment to reach common goals <cit.>. IoT application has caused a significant social and economic impact due to the application domain such as industrial, smart city, and healthcare domain <cit.>. Thus, any threat affecting the availability of IoT applications can be crucial financially and for the safety of the physical integrity of users. In this sense, one of the most critical domains is healthcare, where failures in monitoring patients' vital signs can significantly impact patient safety <cit.>. This feature calls for IoT applications that remain operational and efficiently handle threats that could occur <cit.>. However, designing an IoT application that can handle threats is a challenge for stakeholders due to the highly susceptible threats of IoT applications and the lack of a modeling approach that contemplates resilience as a first-class representation. In the following, will be discussed these difficulties. High susceptibility to Threats of IoT applications occurs for several reasons. First, it is the fundamental characteristics of IoT that naturally predispose applications to potential failures. These include heterogeneity, interconnectivity, and expansive scale regarding devices, which collectively create a broad attack surface and multiple failure points. With the increasing sophistication of systems coupled with rising interoperability and maintenance issues, the complexity of managing such diverse objects continues to grow, surpassing the capabilities of human oversight <cit.>. Second, the typical deployment environments of IoT devices are often dynamic, uncontrolled, sometimes remote, and potentially hostile. The reliability of connections in such settings is generally low, providing ample opportunities for attackers to execute physical attacks and compounding the security management challenge <cit.>. Third, wireless technology for communication in IoT devices is another point of vulnerability. This mode of communication is inherently prone to interference and interception. This susceptibility makes it an easy target for adversaries who, with enough determination, could launch disruptive attacks such as Denial of Service. Fourth, most IoT setup components, particularly end devices, need higher computing resources. This deficiency impedes the implementation of advanced security protocols, leaving the IoT components critically vulnerable to threats. The range of threats are diverse, encompassing communication loss between devices, process crashes, system unavailability due to power outages, malicious software, hacking attempts, inadequate security policies, physical accidents, malfunctions, outdated systems or software, and man-in-the-middle (MITM) attacks. Finally, the dynamic nature of the IoT device's world, marked by rapid and unexpected context changes, contrasts starkly with the more stable environment of computers. Despite these changes, the expectation is for reliable IoT system functioning. To achieve robust and trustworthy IoT systems, incorporating redundancy at several levels and the ability to adapt automatically to changing conditions is essential <cit.>. In essence, mitigating the high susceptibility of IoT applications to threats requires comprehensive strategies to enhance resilience, a critical focus of this study. One way to minimize the abovementioned problems is to design an IoT application as a resilient system. A resilient system can resist various types of disturbances and recover fully or partially <cit.>. One IoT application containing the constraints for resilience, such as redundancy, self-configure, self-heal, self-optimize, and self-protect, is a solution for dealing with any threat that may occur <cit.>. However, resilience should be addressed in the early stages of the design phase, and one way of doing this would be with Architecture design decisions (ADDs) <cit.>. They are considered first-class entities when architecting software systems. ADDs capture potential alternative solutions and the rationale for deciding among competing solutions <cit.>. However, most of the models of ADDs present in the literature are generic. They do not present the necessary and specific concepts for dealing with the resilience design in IoT applications <cit.>. The <cit.> indicates that creating resilience meta-models for constructing models of resilient IoT applications can help the stakeholders in the design phase to create an architectural foundation. These models will be used to analyze all possible behaviors, reducing complexity and allowing a global view of the system due to the high level of abstraction. Once behaviors are recognized, understood, and classified in a model, they will be used as insights into architecting, designing, and engineering resilient ultra-large-scale systems. Given the points raised above, we propose Architectural Design Decision for Resilient IoT (ADD4RIOT) Application. More specifically, it is a meta-model for designing a resilient IoT Application. It provides a common lexicon and taxonomy, defining the main resilient concepts and their relationships to model IoT applications able to handle threats, restore operations and adapt to environmental changes. It can enable a common understanding between stakeholders about a target resilient IoT system by providing an approach that helps to capture precisely state requirements and domain knowledge. ADD4RIOT can generate a primary representation of an IoT Application architecture from the point of view of resilience so that group of stakeholders can communicate. This paper brings four contributions: * First, the requirements for modeling a Resilient IoT application are presented. * Second, it defines Resilient IoT Applications based on the resilience requirements raised. * Third, a Meta-Model to define a common understanding of a field of interest from the point of view of resilience, through the definition of its vocabulary and key resilient constraints. * Fourth, it presents a modeling process to use the ADD4RIOT to design resilient IoT applications; such a process allows the separation of responsibilities between the different experts involved in constructing an IoT application. This paper is organized as follows. Section 2 presents the requirements for modeling a resilient IoT application. In section 3, the ADD4RIOT is described. Section 4 presents the modeling process for resilient IoT application design. Section 5 illustrates the use and demonstrates value of the ADD4RIOT by modeling a case. We briefly discuss related work in section 6, and the paper concludes with future work and conclusions in section 7. § REQUIREMENTS FOR MODELING A RESILIENT IOT APPLICATION Resilient systems can endure and successfully recover from disturbances by identifying problems and mobilizing the available resources to cope with the disturbance. Resiliency techniques allow a system to recover from disruptions, variations, and degradation of expected working conditions <cit.>. A Biological system such as the Immune System (IS) is resilient <cit.>. The Immune System is highly adaptive and scalable, able to cope with multiple data sources, fuse information together and make decisions. The IS has multiple interacting agents, operates in a distributed manner over multiple scales and has a memory structure to enable learning. The IS is considered an excellent example of a resilient system because it is a complex system that is in operation in most living beings on our planet and has been improving itself over millions of years through the process of evolution called natural selection <cit.>. Furthermore, the IS has already inspired some works in computer science <cit.>. Given the advantages mentioned above of the IS, this paper inspires the resilience requirements for IoT application modeling on some fundamental resilience properties of the IS. The IS has five resilience key properties: (i) Monitoring, (ii) Detection, (iii) Protection, (iv) Restoration, and (v) Memorization <cit.>. The following subsections describe these five key resiliency properties of the Immune System that are used as requirements for the resilient IoT application modeling. §.§ Monitoring IS property: The Immune System has cells called Leukocytes that are produced or stored in many locations in the body, including the thymus, spleen, and bone marrow. The two basic types of leukocytes are (i) phagocytes, cells that chew up invading organisms, and (ii) lymphocytes, cells that allow the body to remember and recognize previous invaders and help the body destroy them. The leukocytes circulate via lymphatic vessels and blood vessels between the organs and nodes. In this way, the immune system works coordinated to monitor the body for detecting germs or substances that might cause problems <cit.>. IoT requirement: The monitoring of the resilient IoT application is essential. The monitoring should inspect operational resources, data flow, devices, services, and energy efficiency. The data from monitoring should be stored in Knowledge Base for other components such as protection, detection, and restoration to retrieve and perform their respective operations. Using an IoT Gateway could be an effective way to monitor the behavior of any system in several layers: application, network, and physical <cit.>. IoT gateways may not be used only for communication, to connect the sensors to the internet, or to collect data from sensors. Such IoT gateways can perform the function of monitoring the system. For example, if a sensor is damaged, it must be replaced automatically. An IoT gateway is essential to building an efficient, secure, and easy-to-maintain system <cit.>. §.§ Detection IS Property: The immune system operates like an advanced detection system for pathogens (disease-causing agents such as bacteria and viruses). It identifies these harmful invaders by recognizing their unique molecular structures. Once identified, the immune system designs highly specific molecules, known as antibodies, which fit the pathogen's molecules with lock-and-key precision. These antibodies are not just identifiers; they are equipped with the mechanisms necessary to neutralize or destroy the pathogen, thus effectively eliminating the threat to the body's health <cit.>. IoT Requirement: An essential first step for an IoT application in dealing with threats is their identification. Threats, defined as any potential danger to IoT systems, can arise from faults, failures, and errors, with the primary sources being natural events, hardware limitations, and human actions. Natural threats encompass events like earthquakes, hurricanes, floods, fires, and power outages. These threats are uncontrollable and unpredictable, often causing severe disruptions to IoT systems. Hardware threats stem from the physical and technical limitations of the IoT devices themselves. These can include energy and memory constraints, natural wear and tear, malfunctions, computational limitations, mobility issues, scalability concerns, communications media faults, device multiplicity, and low battery life. Human threats, on the other hand, are actions by individuals or groups, either internal (those with authorized access) or external (entities operating outside the network), aiming to harm or disrupt an IoT application. These threats can target any of the three main layers of an IoT application: the Application Layer, Network Layer, and Physical Layer. Given the diversity and complexity of these threats, the process of detection should begin with systematic monitoring to pinpoint the causes of threats. The data obtained from this detection process should be stored in a knowledge base, serving as a valuable resource for future threat restoration and application optimization. Depending on the specific scenario, various detection algorithms may be employed. The knowledge gained from identifying and understanding these threats can then update the knowledge base, equipping the IoT application with improved defenses for future protection. §.§ Protection IS Property: The immune system safeguards the body against external threats like bacteria, viruses, fungi, or parasites and internal threats like cancer cells. This protective property is carried out through redundant cells and a series of bodily reactions responding to infections or cancer cells <cit.>. IoT Requirement: In an IoT application, protection serves dual roles: it acts both defensively and offensively against major threats. The defensive aspect focuses on shielding the system from threats and continuously updating the knowledge base with the new threat information. Conversely, the offensive aspect ensures the system can fend off recurrent attacks that have previously caused harm. Two key mechanisms employed to achieve protection are self-protection and redundancy, both of which can also aid in restoration. Self-protection refers to safeguarding the entire system from threats. A comprehensive system failure can be a result of either a malicious attack or a cascading series of component failures. Self-protection strategies aim to counteract not only individual failures or attacks that might affect the entire system's behavior but also anticipate and prevent such situations <cit.>. The importance of self-protection in the context of IoT is straightforward and hardly requires further emphasis. Redundancy is a fundamental strategy for ensuring resilience. Typically, redundancy implies having more components within a system than is strictly required for functionality. Functional redundancy involves the overlap of functions across different components. It enables the substitution of a failed component with a different one, thus restoring all or part of the lost functionality <cit.>. §.§ Restoration IS Property: The immune system not only identifies and eliminates pathogens but also ensures the body continues to function with minimal resources until a stable state is restored. This restoration is achieved through complex and organized processes, such as inflammation and healing <cit.>. IoT Requirement: Restoration in an IoT application implies recovering the system to its normal functioning state after a catastrophic event. This component should administer healing to the weakened parts of the application, enabling them to resume their regular functions. Threat detection is accomplished by the detection component, aided by the monitoring component. Several strategies can be employed for restoration, including Redundancy, Self-Configuration, Self-Healing, Fault-Recovery, and Disaster Recovery. Dynamic reconfiguration of components should be considered when workload increases to ensure optimal application performance. If full restoration is not achieved, Self-Optimization should be employed. Now let's describe some architectural constraints: i) Self-Configuration: This allows the system to readjust itself when the environment changes or when trying to achieve a set objective for the system <cit.>. ii) Self-Optimization: This feature enables the system to gauge its current performance and compare it to an optimal performance level. The system will adjust its operations to approach optimal performance. It can also alter its operations to accommodate new user-set policies <cit.>. iii) Self-Healing: This allows the system to recover from or avoid faults. Self-healing can be implemented in two different modes: reactive and proactive. In reactive mode, the system detects and recovers from faults as they occur and attempts to repair faulty functions if possible. In proactive mode, the system monitors its state to detect and adjust its behavior before reaching an undesired state <cit.>. §.§ Memorization IS Property: The immune system's ability to rapidly and effectively respond to previously encountered pathogens is referred to as memorization. This response is possible due to the existence of a clonally expanded population of antigen-specific lymphocytes, which are immune cells that have learned to recognize and react to these specific threats <cit.>. IoT Requirement: In a resilient IoT application context, the knowledge base component serves as its memory. This database maintains various information, including monitoring data, restoration data, a list of system vulnerabilities, and comprehensive data about different types of attacks and the corresponding preventive measures. Monitoring data is gathered by the gateway, which cooperates with all system components and is essential for operating these components. Detection data collected during the detection phase contains information about the identified faults. The restoration component utilizes this data to facilitate the recovery of the resilient IoT application. § ADD4RIOT Before delving into the details of the ADD4RIOT, we must first establish our working definition of a Resilient IoT Application. This is necessary due to the absence of a universally accepted definition, despite keen interest from both industry and academia. We define a Resilient IoT Application as follows: A set of interconnected infrastructures comprising connected devices, which facilitate their management, enable data extraction, and provide access to the data they generate, aiming to achieve common goals. These applications possess the ability to: 1) consistently monitor the system, 2) detect both new and existing threats that could harm the system, 3) protect the application from internal and external threats, 4) recover to a stable state and/or adapt its structure to function with minimal resources, and 5) record all impacts that threats may inflict on IoT Services, Resources, and Devices. This, in turn, facilitates faster and more effective responses to future threats. The ADD4RIOT model was developed to align with this definition and to aid in the design of Resilient IoT Applications. It aims to streamline the identification of common threats during the design process and encapsulate the core elements of resilience, i.e., monitoring, protection, recovery, and memory, as primary components of the architecture. It also proposes decision-making principles to guide the selection or rejection of countermeasures against potential threats. ADD4RIOT consists of four main components: Inputs, Issues, Countermeasures (Mitigation strategies), and Decisions. The Inputs represent the elements of an IoT application's domain model, including critical objects that may be affected by threats. The Issues encapsulate the potential threats and call for possible Countermeasures. The Countermeasures component provides solutions that could mitigate these threats. Lastly, the Decisions component encapsulates the principles to guide the selection or rejection of countermeasures. These components collectively provide a comprehensive structure to facilitate the design of Resilient IoT Applications. In the following sections, we will elaborate on each of these components. In summary, the ADD4RIOT brings i) the main threats described in the literature to speed up the threats identification procedure in the design process; ii) the tactics, constraints, and properties of resilience represented as the first class to make explicit and allow to capture potential alternative resilient solutions, iii) architectural design decisions principles, such as Issues (IoT Threats), Solutions (Resilient Countermeasures) and Decisions, to support the decision of select or reject resilient countermeasures to mitigate the threats, and iv) Group decision Making principles to driving the way stakeholders make collaborative decisions. The ADD4RIOT is divided into four packages to facilitate the understanding and use of the meta-model. The four packages are Inputs (colorful elements in dark orange), Issues (colorful elements in red), Countermeasures (colorful elements in green), and Decisions (colorful elements in yellow). Figure <ref> depicts all packages, the principal elements, and the relationships between them. The Inputs package contains classes representing the elements of an IoT application domain model, such as IoT Critical Objects that are affected by IoT Threats. The Issues package formalizes the concept of IoT Threats and requests Resilient Countermeasures as a possible solution. The Countermeasures package describes the concept of Resilient Countermeasures that mitigates IoT Threats. Lastly, the Decisions package formalizes the decision to select and reject a resilient countermeasure for addressing IoT Threats. The following will explain in detail each package. §.§ Input Package The Inputs package is described in Figure <ref>. This package defines all ADD4RIOT inputs as IoT critical objects. It represents an element that can be affected by IoT threat and was proposed in <cit.>. These IoT critical objects can be identified in an IoT application domain model, user story, storyline, and functional requirements. Examples of domain models are IoT Domain Model (IoT-DM) and Personalized Monitoring System Domain Model (PMS-DM) <cit.>. Through the Input package, we must identify the objects with the highest chance of being affected by a threat and damage to the system's functioning. A Critical Object can be IoT Hardware and IoT Software components <cit.>. The IoT Hardware components are classified as Device, Tag, Sensor, and Actuator. The IoT software components are classified as: Active Digital Artefacts, Passive Digital Artefact, Service, Resource, Network Resource and On-Device Resource. Details about these components can be found in <cit.>. §.§ Issue Package The Issues package is highlighted in Figure <ref> and has 15 elements. This package brings a set of concepts, entities, and relationships describing the main IoT threats that can damage an IoT application. In ADD4RIOT, an IoT Threat is an action that takes advantage of security weaknesses in an IoT Application and has a negative impact on it. The Motivation and Cause elements should describe the IoT Threat. A Motivation element should explain why the IoT Threat is a problem, and the Cause element should explain the reason for this IoT Threat. IoT Threats can originate from three primary sources: Nature source, Hardware source, and Human sources. In <cit.>, a detailed description of each threat type that composes the enumerations: Hardware Threat Type, Nature Threat Type, Application Layer Threat Type, Network Layer Threat Type, and Physical Layer Threat Type. §.§ Countermeasures Package This Package is highlighted in Figure <ref> and has 24 elements. It brings together a set of technologies available to implement the resilience properties that enable an IoT application to handle an IoT Threat. This Package has five fundamental properties that allow addressing the definition of Resilient IoT Application that are: Monitoring, Protections, Detection, Restoration and Memorization (knowledge base). A Resilient Countermeasure can be classified in four properties: Monitoring, Protections, Detection and Restoration and interacts with knowledge base. Monitoring: it performs monitoring on Operational resources, Data flow, Energy Efficiency components and help to protection, detection and restoration to work. The Monitoring of IoT application can be performed by a Gateway. The monitoring data will be stored in Knowledge base for other resilient solution to retrieve and perform the necessitated operations. The monitoring of IoT Application through IoT gateways can be performed using Autonomic Architectures (the architectures that compose the enumeration called Autonomic Architectures kind enumeration are described in <cit.>). Protection: it can be implemented through 9 tactics of Redundancy and 29 Self-protection techniques. The Protection update knowledge base when, for example, get a new attacks and retrieve old situation from knowledge base. The tactics that compose the enumeration Redundancy Technique Kind and Self Protection Technique Kind are described in <cit.>. Detection: it detects the vulnerabilities and the weak points of the Resilient IoT Application. The processes of detection is performed by monitoring through the implementation of Detection Techniques (all techniques that compose the enumeration Detection Technique Kind are described in <cit.>) to find some IoT Threat. Detection techniques are algorithms and the vulnerabilities detected will be stored in the vulnerability list in knowledge base for future Protection and can be utilized by Restoration resilient solution in order to perform restoration and optimization of Resilient IoT Application. Restoration: the main responsibility of it is to bring back the Resilient IoT Application to its normal state after catastrophic situation. The restoration will perform Self-Healing on weakened parts of the Resilient IoT Application and empower them to perform their regular functions. The weak parts will be detected by the detection resilient solution with the help of the monitoring resilient solution. Self-Configuration will be used to reconfigure the components when workload is increased to achieve optimization of Resilient IoT Application. Self-Optimization will also be used in case when full restoration is not achieved by the restoration. The Restoration resilient solution can implement Disaster Recovery Strategy like backup and contingency plans that are the best approaches to secure systems against natural threats. Finally, the restoration resilient solution can implement too Fault Recovery techniques important to deal with IoT Threats in WSN. All techniques to implement Restoration that compose the enumeration: Self Configuration Technique Kind, Self-Healing Technique Kind, Self-Optimization Technique Kind, Fault Recovery Technique Kind, Disaster Recovery Strategy Technique Kind are described in <cit.>. §.§ Decision Package The Decision Package is highlighted in Figure <ref>. This Package combines Architecture design decisions and Group decision making principles and methods to enable group of stakeholders to find the best resilient countermeasure to be to address an IoT Threat identified by the Issues Package. This Package allows a model instantiated from ADD4RIOT be a primary representation of the architecture. A primary representation of architecture consists of architectural decisions and good architecture results from making good architectural decisions <cit.>. Decision package has 13 elements and the main classes of this package is Decision, from is possible select or reject a resilient countermeasure to addresses an IoT Threat. The other elements of Decision Package use the same concepts of the two meta-models in the literature the Archium meta-model <cit.> and Architecture design decisions Meta-model with Group Decision making <cit.>. Due to limited space they are explain in details in <cit.>. § MODELLING PROCESS This section presents the steps required to design a resilient IoT application using the ADD4RIOT. It is divided into four phases that are executed in an iterative way as depicted in Figure <ref>. The activities are performed by the main group of IoT application stakeholders. The set of actors in our process is composed of: Domain expert: responsible for instantiates the IoT Domain model by identifying the domain elements, such as virtual entities, resources, devices, services and users. It has ability to understand domain concepts, including the data types produced by the sensors, consumed by actuators, accessed from storages, user interactions, and how the system is divided into regions. Resilience Expert: responsible for identifying the critical objects in IoT Domain Model and lists the threats and associated countermeasures. It has experience on fault, failures and error in IoT device and software, and knowledge on security, self-management and resilient constraints. Device developer: responsible for writing drivers for the sensors, actuators, storages, and end-user applications used in the domain. It has a deep understanding of the inputs/outputs, and protocols of the individual devices. Software designer: responsible for defining the structure of an IoT application by specifying the software components and their generate, consume, and command relationships. It has Software architecture concepts, including the proper use of interaction modes such as publish/subscribe, command, and request/response for use in the application. Network Manager: responsible for install the application on the system at hand; this process may involve the generation of binaries or bytecode, and configuring middleware. It has a deep understanding of the specific target area where the application is to be deployed. Figure <ref> depicts the UML Activity Diagram illustrating the modelling process with its phases and actors (or stakeholders). The first phase of the modelling process (Phase 1) encompasses the modelling IoT Application (activity 1a). This activity is performed by Domain Expert that should instantiate the application domain model, since from it will be identified the IoT Threats and IoT Critical Objects. For this activity could be used any Domain meta-model of literature such as IoT Domain Model (IoT-DM) <cit.> and Personalized Monitoring System Domain Model (PMS-DM) <cit.>. The second phase of the modelling process (Phase 2) encompasses two activities: Identify IoT Threats (activity 2a) and IoT Critical Objects (activity 2b). These activities will be performed by Device developer and Software designer and to help them carry out these activities we provide a table called Relationship between IoT Application Domains, IoT Critical Objects and IoT Threats (available in <cit.>) based on <cit.>. It gathers the main IoT Threats and critical IoT Objects for the three main domain of IoT Application: Industrial, Smart city and Health well-being. In this table we have the relation between the main elements that can be classified as IoT Critical Objects and the main source of IoT Threats that can affect the workings of these elements. Furthermore, the Relationship between IoT Application Domains, IoT Critical Objects and IoT Threats table has relation with IoT Threats Tables available in <cit.>. The third phase of the modelling process (phase 3) encompasses one activity: List possible Resilient Countermeasures (activity 3). It will be performed by Resilience Expert that should list the main resilient countermeasures to mitigate the IoT threats identified in the previous phase. To help the Resilience Expert carry out this activity the enumeration tables of ADD4RIOT (available in <cit.>) gathers the main Resilient Countermeasures. Furthermore, the IoT Threats Tables has relation with Resilient Countermeasures tables. This relation is of many to many. The fourth phase encompasses two activities. Select the Resilient Countermeasures (activity 4a). In this activity all stakeholders will participate and use architecture design decisions and group decision using principles and methods through Decision package. It will help to find the best resilient Countermeasures from of the selected in the previous phase, in activity (3). Others stakeholders can be included in the group to participate in modelling processes such as software architects, developers, designers, testers, users, etc. Update modelling IoT Application Domain Model (activity 4b). Before finished the modelling processes must be checked if there is need update in IoT Application due to selection made in activity 4a. § CASE: RESILIENT NURSING HOME IOT APPLICATION In this section, we validate our approach by applying it on a case. It is used to illustrate the utilization of ADD4RIOT modelling process to generate a primary representation of a Resilient Nursing Home IoT Application architecture. First, the case is introduced, after the modelling processes of resilient IoT application case is presented in more detail. §.§ Case Overview The nursing home IoT application case was inspired in <cit.>. Our case presents the design of an IoT application that aims to perform early detection, rapid, and appropriate response to help in the monitoring of patients who are under care in separate rooms into a nursing home. Therefore, this application also must be resilient because any failure of the system can cause serious damage to patients. The application includes sensors that are being used by patients to capture vital signs and alerts when signals outside the normal patterns are detected. For example, if occurs an abnormal increase in body temperature (that can indicate some infection), the medical staff receive one alert. §.§ Modelling of Resilient Nursing Home IoT Application §.§.§ Phase 1: This phase encompasses the activity related to modelling of Nursing home IoT application domain. Activity 1: This modelling was done using the IoT Domain Meta-model of IoT-ARM <cit.> and is depicted in Figure <ref>. The element HumanUser represents the medical team that subscribes to the alarm service, provided by the system through an Android app or a desktop application. The Android and Desktop applications are Active Digital Artefacts (from the IoT Domain Meta-Model) and invoke their respective alarm services: Alarm Panel and Alarm message to alert the medical staff in case of abnormal situation with patients. Alarms represent the communication system interface with the user. The Alarm Panel service is invoked by the desktop computer application and displays an alarm on the PC screen. On the other hand, the Alarm message service is invoked by the Android application and displays a message on the mobile screen of the users that make up the medical team. The Android and Desktop applications to invoke the alarm services them subscribes another service called Human Vital Data Measurement that will read the user vital data from the Database and evaluate if they are out of normal ranges for human health. The database is represented by an element of type Network Resource and is associated with an element of type PassiveDigitalArtefact called Vital Sign Data that represent a Physical Entity called Patients. The vital data captured by sensors are inserted in the database through a service called Store Vital Data that receives the data from the resource Human Vital data, which is an element of type On-DeviceResource that is hosted within the Device. In this case, the On-DeviceResource is a software component that provides a way to connect to the data obtained by the sensors. For example, this data can be exposed through an XBee/ZigBee network. The Device is represented by a microcontroller board, for example, an Arduino, which is connected to the three types of sensors that are collecting the vital patient data. The three types of sensors are: Blood Pressure Sensor, Heart Rate Sensor, and Body Temperature Sensor. §.§.§ Phase 2: This phase raises the issues that can damage the Nursing Home IoT application. Activity 2a: The Software attacks and Malfunction/Faulty hardware are the threats that will be addressed in Nursing Home IoT application. i) The Software attacks can occur due to Negligence of medical staff, because changes and updates in desktop computer configuration can cause system malfunctioning. Medical staff may install contaminated software upgrades that propagates virus into the desktop computer. A cause of this can be lack of IT team to take care of security and the work overload of medical staff. ii) The Malfunctions/Faulty hardware can occur due to incorrect use, because improper use for a long period can lead to a malfunction and can cause interruption of availability of application. A motivation of this is hiring a new member for medical team. A cause of this can be Lack of training. This IoT Threats are represented by the colored elements in red in the Figure <ref>. Activity 2b: A total of six elements were classified as IoT Critical Objects in function of IoT threats selected in previous activity and with the help of table called Relationship between IoT Application Domains, IoT Critical Objects and IoT Threats available in <cit.>. The elements that were identified as IoT critical object are: i) Active Digital Artefacts called PcDesktopApp and AndroidApp and ii) Device called Microcontroller Board and the Sensors called Blood Pressure, Heart Rate and Body Temperature. These are the main objects that can be affected by the identified threats in the activity 2a. See colorful elements in orange on Figure <ref>. §.§.§ Phase 3: this phase raises the some possibles Resilient Countermeasures in functions of Threats and critical object identified in the Nursing Home IoT application domain model. Activity3: Selection made based on the enumeration tables available in <cit.>, where the references and the explanation for each tactic can be found. The Figure <ref> exposes the countermeasures (see colorful elements in green). Four countermeasures were selected to mitigate the Malfunctions/Faulty hardware that the Incorrect use of sensors and devices can cause in application. i) Monitoring using IoT Gateway Autonomic architecture. In <cit.> was presented an intelligent architecture which consists of a large number of sensing objects for monitoring purposes that can be used in IoT application. An embedded-based gateway for use in a monitoring system was proposed in an IoT network. The gateway is a critical component for collecting, recording and forwarding data obtained from sensors. It is programmable, low-cost, real-time and flexible. The software and hardware for wired and wireless communication interfaces are successful and suitable for field trials. ii) Detection using Group Detection. The goal of fault detection is to verify that the services being provided are functioning properly, and in some cases to predict if they will continue to function properly in the near future. In <cit.> a detection mechanism is proposed to identify faulty sensor nodes. Algorithm is based on the idea that sensors from the same region should have similar values unless a node is at the boundary of the event-region. The algorithm start by taking measurements of all neighbors of a node and uses the results to calculate the probability of the node being faulty iii) Redundancy using Element replication. The structure and functionality of a replica are exactly the same as that element so that they can substitute each other without problem <cit.>. In case of Nursing Home IoT application the sensors and device could be replicated. iv) Fault Recovery using Self-Election. When passive replication is applied, the primary replica receives all requests and processes them. In order to maintain reliability between replicas, the state of the primary replica and the request information are transferred to the backup replicas atraves de self-election <cit.>. Three countermeasures were selected for mitigate Software attacks that Negligence of medical staff can allow that affect the software component of application. i) Self-Protection using Intrusion prevention system. To follow this tactic the Cumulative-Sum-based Intrusion Prevention System (CSIPS) can be applied. It which detects malicious behaviors, attacks and distributed attacks launched to remote clients and local hosts based on the Cumulative Sum (CUSUM) algorithm <cit.>. ii) Self-Protection using Anti-virus, Anti-spyware and anti-adware in application layer. Security software like antivirus or anti spyware is important for the reliability, security, integrity and confidentiality of the IoT system and desktop computer. ii) Self-Protection using Firewalls in application layer. This is an extra effective layer of security that will help block attacks that authentication, encryption and ACLs would fail to do so. Authentication and encryption passwords can be broken if weak passwords were selected. A firewall can filter packets as they are received, blocking unwanted packets, unfriendly login attempts, and DoS attacks before even authentication process begins. All these countermeasures are related to the knowledge base. It is a resilience requirement that the application has memorization of all occurrences. §.§.§ Phase 4: Select the countermeasures that best fit the concerns of the Resilient Nursing Home IoT application stakeholders. Activity 4a: Here the stakeholders of the case made two decisions: i) the Decision to Avoid Malfunctions/Faulty hardware was to select Detection using Group detection technique and Monitoring using Gateway system architecture as resilient countermeasures. Because to achieve the concern of low cost solution the rationale is reject Redundancy using Element replication and Fault Recovery using self-election. Since this increase in the number of sensors and devices and thus increases the cost of the project. ii) the Decision to Avoid software attacks was to select self-protection using Anti-virus, Anti-spyware and Anti-adware in application layer and self-protection using Firewalls in application layer as resilient countermeasures. Because to achieve the concern of low effort to implement this solutions in the application the rationale is reject Self-protection using Intrusion Prevention system. Since the implementation will require the use of complex algorithms that will order more qualified workers in project. Activity 4b: Update in Nursing Home IoT application Domain Model. As a gateway is going to be used it will be necessary to update the model by inserting this new element. § RELATED WORK Some projects try to address the challenge of deal of resilience in Iot Application. But them present some drawbacks. Here we will highlight three important projects developing IoT architectures <cit.>. IoT-A <cit.> is a European project that proposes an Architectural Reference Model (ARM) for IoT. But the IoT ARM is not an IoT architecture per se, but a set of best practices, guide-lines, and a starting point to generate specific IoT architectures <cit.>. The unique resiliency treatment presented by IoT-ARM is through an architectural perspective called Availability and Resilience in which it presents a design choice catalog with only 9 generic tactics used in software architecture. The ADD4RIOT presents a total of 82 tactics to implement the resilient constraints such as redundancy, self-configure, self-heal, self-optimise and self-protect specific for IoT application architecture. BeTaaS <cit.> is a project that proposes an architecture for the IoT and Machine-to-machine (M2M) communication, to enable running applications over a local cloud of gateways. Betaas focuses in Dependability, but presents aspect of resilience. It is handled via the Failure Analysis Approach component that is responsible for the identification of potential causes of failures and for providing solutions to properly manage them. However presents no concept of ADDs and GDM in order to select possible solutions for failures as well as ADD4RIOT features. In addition to not specifying which elements can and should be classified as critical. The EU FP7 OpenIoT research project, has introduced an IoT architecture <cit.>. OpenIoT is based on IoT-ARM to achieve alignment, architecture development and specification. OpenIoT Address resilience only partly and places the focus on resilience in terms of mitigation. For that, OpenIoT maintains an up-to-date inventory of entities and dynamically restructures the dependencies between entities, e.g., reconnects a service to another sensor in case of sensor failure. Thus, fail-over and recovery are integral parts of OpenIoT. The projects above mentioned are solutions to specific problems of system information and do not consider the specification of resilience for IoT application. Furthermore, they do not provide elements to express resilience accurately in the early stages of development. They do not provide modelling mechanisms that contemplate resilience as first class representation to design a resilient IoT application like ADD4RIOT. § CONCLUSION In this paper, we presented an Architectural Design Decision Model for Resilient IoT Application, called ADD4RIOT, due to high susceptible to threats of IoT Application and lack of modelling approaches contemplating resilience as first class representation to design Resilient IoT Application. It provides a common lexicon and taxonomy, defining the main resilient concepts and their relationships, and a modelling process needed to generate a common understanding and facilitate decision making between stakeholders about a target resilient IoT application in question. The ADD4RIOT concepts were exemplified with the modelling of a Resilient Nursing Home IoT Application. The modelling of the case allow to note how ADD4RIOT can reduces the difficulty of design an IoT application with resilient concepts. The ADD4RIOT generated a primary representation of Resilient Nursing Home IoT Application architecture so that group of stakeholders were able to communicate. The ADD4RIOT allowed to identify IoT Critical Objects in Nursing Home IoT Application domain and IoT Threats that could affect them. Next, it was possible to find possible Resilient Countermeasures in functions of IoT Threats and IoT Critical Objects, and select which would be the best ones for the case. In the future work, we intend to integrate ADD4RIOT in an framework to automatic design resilient IoT applications. unsrt
http://arxiv.org/abs/2306.11485v2	20230620121631	Explicit Syntactic Guidance for Neural Text Generation	[ "Yafu Li", "Leyang Cui", "Jianhao Yan", "Yongjing Yin", "Wei Bi", "Shuming Shi", "Yue Zhang" ]	cs.CL	[ "cs.CL" ]	Cooperative effects in dense cold atomic gases including magnetic dipole interactions C. Genes July 31, 2023 ===================================================================================== [1] Work was done during the internship at Tencent AI lab. [2] Corresponding authors. Most existing text generation models follow the sequence-to-sequence paradigm. Generative Grammar suggests that humans generate natural language texts by learning language grammar. We propose a syntax-guided generation schema, which generates the sequence guided by a constituency parse tree in a top-down direction. The decoding process can be decomposed into two parts: (1) predicting the infilling texts for each constituent in the lexicalized syntax context given the source sentence; (2) mapping and expanding each constituent to construct the next-level syntax context. Accordingly, we propose a structural beam search method to find possible syntax structures hierarchically. Experiments on paraphrase generation and machine translation show that the proposed method outperforms autoregressive baselines, while also demonstrating effectiveness in terms of interpretability, controllability, and diversity. § INTRODUCTION Natural language generation (NLG), such as paraphrase generation <cit.>, text summarization <cit.>, machine translation <cit.>, and language models <cit.>, have shown remarkable progress in the past few years. Most of the highest-performing NLG models train the model based on source-target correspondence and conduct autoregressive inference, which achieves competitive empirical performances yet deviates from a range of desirable attributes of human language generation, e.g., lack of interpretability <cit.>. It has been shown that humans generate language by learning and manipulating language grammar <cit.>, which generative grammar <cit.> considers as a finite rule set that combines words to form grammatical sentences, thereby avoiding enumeration of surface sequences, which can significantly increase data sparsity and reduce learning efficiency. In this process, syntax plays a crucial role, imposing constraints on how to construct sentences. Syntax knowledge has been found implicitly contained by deep neural models <cit.> and also useful for NLG tasks <cit.>. However, relatively little recent work has considered explict syntax in NLG <cit.>. Inspired by the above psycholinguistic observation, we propose a syntax-guided generation scheme, which generates text by following a well-defined grammar. As shown in Figure <ref>, instead of sequential generation, the model generates the sentence in a hierarchically top-down manner guided by the constituency parse tree, starting with the root node <>. Syntactic categories such as noun phrases <> and verb phrases <> are integrated with tokens in the generation process, and the model simultaneously considers multiple syntax structures at each tree depth, hierarchically exploring the syntax tree for reasonable hypotheses. Intuitively, such a generation paradigm has the following advantages compared with autoregressive generation. First, akin to the language learning process of human beings, grammar learning breaks down non-enumerable surface sequences into finite pieces, acting as a training curriculum. Second, it provides an effective and interpretable pathway to probe into the generation process. Consequently, generation errors can be traced back to specific constituent expansion at the respective tree depth. Third, one can manipulate the generation process by exerting versatile control at arbitrary depths, e.g., modifying the translation of a verb phrase and constraining the paraphrase style with syntax templates. Forth, diverse sequences can be generated by exploring various syntax structures hierarchically throughout the syntax tree. We implement the above process on Transformer <cit.>. As shown in Figure <ref>, the generation process proceeds under the guidance of syntactic grammar. Starting from the root node “<>”, the model recursively generates the infilling texts (e.g., “he” and ”seems <>”) for each constituent in the current lexicalized syntax context (e.g, “<> <>.”.), and infills each one accordingly to construct the next-level lexicalized syntax context (e.g., “he seems <>.”). The generation proceeds until there is no remaining constituent. The infilling texts are predicted by a Transformer-based model, which is trained by maximizing the likelihood of infilling texts for each constituent in the syntax context based on the source input. To explore more syntactically diverse and reasonable hypotheses during inference, we propose structural beam search, which searches promising syntax structures over the entire syntax tree in a top-down manner, as shown in Figure <ref>. To isolate the effect of syntax and avoid the influence of other transformation factors, we conduct experiments on two sequence-to-sequence (seq2seq) tasks with semantic equivalence between the source and target sequences: paraphrase generation and machine translation. Empirical results demonstrate that our method can generate sequences with higher quality than the seq2seq baselines. Quantitative analysis demonstrates that the generation process can be interpreted effectively. In addition, our method demonstrates the capability of executing control from both syntax templates and fine-grained manual modifications. Finally, we show the diversity advantage through both automatic evaluation and human evaluation. We release the code on <https://github.com/yafuly/SyntacticGen>. § RELATED WORK Syntax as Extra Input. A line of work incorporates syntax knowledge as extra input to boost task performance. In paraphrase generation, <cit.>, <cit.>, <cit.> and <cit.> additionally encode a constituency tree to produce controllable paraphrases. For machine translation, researchers utilize syntactic information to boost the neural machine translation system using syntactic encoders <cit.>, position encoding <cit.>, attention mechanism <cit.>, and auxiliary training objectives <cit.>. Syntax for Generation Guidance. Different from the above work, we focus on guiding generation explicitly following syntactic grammar. Typically, <cit.> and <cit.> learn the mapping from sequences to linearized constituency trees to improve machine translation. <cit.> proposes a hybrid decoder with RNNG <cit.> to jointly learn parse actions and word predictions. <cit.> and <cit.> design a syntactic tree decoder based on LSTM <cit.>, with an extra rule decoder. <cit.> introduce a syntax-guided soft target template as extra prompts in Transformer. Different from their work, our method leverages Transformer strengths and breaks down the sequence-to-sequence generation process into a hierarchically top-down generation guided by the syntax tree. § METHOD §.§ Baseline Transformer Transformer models the correspondence between the source sequence 𝐱={x_1,…,x_\|𝐱\|} and the target sequence 𝐲={y_1,…,y_\|𝐲\|} in an end-to-end fashion. The Transformer encoder transforms the discrete source sequence 𝐱 into a continuous representation, which the Transformer decoder utilizes to generate the target sequence. The conditional probability p(𝐲\|𝐱) can be factorized in an autoregressive way: p_θ(𝐲\|𝐱) = ∏_t=1^\|𝐲\| p_θ(y_t\|𝐱,y_1:t-1), where θ denotes the model parameters. Given a source-target training set 𝒟={𝐱^i, 𝐲^i}\|_i=1^\|𝒟\|, the model is optimized by minimizing the cross-entropy (CE) loss: ℒ_ce^𝒟 = - ∑_i=1^\|𝒟\|∑_t=1^Tlog p_θ(y_t^i\|𝐱^i,y_1:t-1^i). §.§ Syntax-guided Generation In this section, we introduce syntax-guided generation, which generates texts by hierarchically expanding constituents in syntax contexts throughout the syntax tree, while also leveraging the strengths of Transformer. In general, the generation process can be decomposed into two stages: (1) neural generation: the neural decoder (Section <ref>) generates the infilling sequences based on the source sequence and the syntax context; (2) constituent expansion: predicted infilling sequences are mapped and filled into each constituent in the syntax context accordingly (Section <ref>), forming the next-level syntax context. To facilitate parallelism during training, we decompose the sequence-to-sequence dataset to a triplet set, where the neural decoder is optimized to maximize the probability of the infilled sequence (e.g., "<> I <> ate <> .") given the lexicalized syntax context (e.g., "<> <> ."), as shown in Figure <ref>. §.§.§ Triplet Construction Given a target sequence 𝐲, the corresponding constituency parse tree of depth \|𝕋\| can be composed by a set of labeled spans 𝕋: 𝕋 = {𝕋_d}\|_d=1^\|𝕋\| = {{(a_k,b_k,d,l_k)}\|_k=1^\|𝕋_d\|}\|_d=1^\|𝕋\|, where a_k and b_k represent the k-th constituent span's fencepost positions at depth d, and l_k represents the constituent label. Our model is optimized to predict the next-level span sets 𝕋_d given the previous one and the source input, i.e., p_θ(𝕋_d\|𝕋_d-1,𝐱). Given the set of labeled spans at depth d, i.e., 𝕋_d, we transform the target sequence into a lexicalized syntax sequence of length \|s_d\|: s_d={s_d;1,s_d;2,…,s_d;\|s_d\|}, by keeping the lexical tokens and replacing the constituent spans with corresponding labels. For instance, the sequence “I ate an apple .” is transformed to s_2={<>,<>,.} at depth 2, and is transformed to s_3={I,ate,<>,.} at depth 3, as shown in Figure <ref>. The alignment between s_2 and s_3 can be modeled as a text-infilling task. For example, the {<>}, {<>} and at depth 2 are replaced by {I} and {ate <>} at depth 3, respectively. To generate the whole s_3 based on s_2 in one pass, we concatenate all the infilling texts with a special token “<>”, yielding an infilling sequence f_2= {<>,I,<>,ate,<>}. Similarly for each syntax context s_d, we collect the respective infilling texts for each constituent in the lexicalized sequence at depth d+1, and concatenate them to construct the target infilling sequence of length \|f_d\|: f_d = {f_d;1,f_d;2,…,f_d;\|f_d\|}. In this way, a triplet is constructed for a source-target sequence pair at depth d: {(𝐱,s_d,f_d)}. We traverse the target syntax tree in level-order to obtain the full set Φ of training triplets for a training instance: Φ = {Φ_d}\|_d=1^\|𝕋\|-1 = {(𝐱,s_d,f_d)}\|_d=1^\|𝕋\|-1. Given a sequence-to-sequence training set 𝒟={𝐱^i, 𝐲^i}\|_i=1^\|𝒟\|, we go through the full training set to construct the complete triplet set Ψ: Ψ = {Φ^i}\|_i=1^\|𝒟\| = {(𝐱^j,s^j,f^j)}\|_j=1^∑ _i=1^\|𝒟\|\|Φ^i\|. §.§.§ Neural Decoder Given a triplet instance Ψ^j, we construct the neural decoder based on Transformer to model the generative probability p_θ(f^j\|𝐱^j,s^j). The neural decoder takes the source sequence and the lexicalized syntax context as input and generates the corresponding infilling texts, as shown in Figure <ref>. Besides the encoder that encodes source context, we introduce an extra Transformer encoder, i.e., syntax context encoder, to encode the lexicalized syntax context into a representation. On top of self-attention and source context attention, we insert an extra attention layer (syntax context attention) into each decoder layer to incorporate syntax contexts, as shown in the right part of Figure <ref>. Similarly, the probability of the infilling sequence can be factorized as: p_θ(f\|𝐱,s)=∏_t=1^\|f\|p_θ(f_t\|𝐱,s,f_1:t-1). We define the scoring function for an infilling sequence as the sum of the log probabilities: score(𝐱,s,f)=∑_t=1^\|f\|log p_θ(f_t\|𝐱,s,f_1:t-1). We adopt the standard cross-entropy loss (CE loss) to optimize our model, where the loss for the j-th triplet in the training set Ψ can be written as: ℒ_ce^j = - ∑_t=1^\|f^j\|log p_θ(f_t^j\|𝐱^j,s^j,f_1:t-1^j), and the CE loss across the whole triple set Ψ becomes: ℒ_ce^Ψ = ∑_j=1^\|Ψ\|ℒ_ce^j. §.§.§ Generation Process Given a source sequence, our model generates the target sequence in a top-down manner which is grounded on syntactic grammar rules. As shown in Figure <ref>, the neural decoder first encodes the source sequence 𝐱 into the source context representation 𝐡_src, which remains fixed and can be reused throughout the generation process. Initially, the neural decoder generates the infilling sequences 𝐭_0 given x and s_0={<>}, based on Equation <ref>. Then the model proceeds with the generation process via iteratively generating infilling texts and expanding constituents. At each iteration step (i.e., tree depth), the neural decoder generates the infilling sequence f_d for the syntax context s_d: f_d = _f'p_θ(f'\|𝐱,s_d) Then the constituent expansion function yields the next-level syntax context given the syntax context and the infilling sequences predicted by the neural decoder: s_d+1=expand(s_d,f_d). Specifically, we first separate the infilling sequences by the special separator “<>” into a group of infilling texts, e.g., spliting f_2={{<>,I,<>,ate,<>}} to {{I},{ate <>}}. Then we fill in each of the infilling texts into the corresponding constituent in the syntax context s_2 to obtain the syntax context at the following level, e.g., s_3={I,ate,<>,.}. The syntax context encoder encodes the updated syntax context s_d+1 and starts the next iteration. The remaining decoding process loops between these two stages, until there is no constituent label in the syntax context, or a maximum tree depth is reached, as shown in Figure <ref>. As the model behavior on expanding constituents over the entire syntax tree is completely accessible, the generation process can be effectively interpreted, as shown in Section <ref>. Moreover, manual modifications can be directly incorporated into the expansion process for each constituent throughout the syntax tree (Section <ref>). Finally, more than one syntax structure can be considered simultaneously at each tree depth, enabling searching for hypotheses of better syntactical diversity(Section <ref>). §.§.§ Structural Beam Search By default, our model selects the best infilling texts greedily in each iteration. We introduce structural beam search to explore the hypothesis space for a more accurate and diverse generation. Similar to standard beam search <cit.>, structural beam search maintains a beam width of candidates at each iteration. Thanks to explicitly traversing the constituency parse tree during inference, our method is able to search promising syntax structures throughout the syntax tree in a top-down manner. We show a real example of our model generating a paraphrase in Figure <ref>. At each level, we apply standard beam search for neural generation and keep top k infilling texts along with their scores, computed by Equation <ref>. Taking previous predictions into consideration, we introduce a moving average mechanism to trade off confidence between the predictions from lower levels and the current-level prediction. Specifically, suppose s_i is the i-th syntax context in the k-width beam at the current depth, with an accumulated score of δ_s_i; and f_j;s_i is the j-th infilling sequence candidate from the neural generation beam given the syntax context s_i, with a score of δ_f_j;s_i. A beam of next-level syntax contexts is constructed, by filling in the current syntax context with the corresponding infilling sequences: s_ik+j=expand(s_i,f_j;s_i). The updated score for each of the next-level syntax contexts in the beam is given by: δ_ik+j = αδ_s_i + (1-α) δ_f_j;s_i, where α is a hyper-parameter (accumulation weight) that determines how much weight is put on predictions at lower levels. Then the beam is further pruned by their updated scores to maintain the beam width. For example, the first two candidate syntax contexts are selected at depth 2 in Figure <ref>. Algorithm implementation details can be referred to in Appendix <ref>. § EXPERIMENT SETUP Datasets For paraphrase generation, we experiment on ParaNMT-small <cit.>, which contains 500K sentence-paraphrase pairs for training, 500 for validation, and 800 for testing. Both validation and test sets are provided with human-annotated sentence exemplars from which syntax information can be extracted for controlling paraphrase generation. For machine translation, we use NIST Chinese-English (Zh-En), WMT'16 Romanian-English (Ro-En), WMT'14 English-German (De-En), and WMT'14 English-German (En-De). For WMT datasets, we follow the official split for validation and testing. For NIST Zh-En, we use MT06 as the validation set and choose MT02, MT03, MT04, MT05, and MT08 as the test sets. For all datasets, we use Berkeley Parser <cit.> to obtain constituency parse trees and use the most frequent constituents (e.g., <>, <>, <> and <>) for syntactic guidance. Model Settings For Transformer baselines, we adopt the Transformer_Base configuration which consists of a 6-layer encoder and decoder. For our model, we keep the 6-layer source context encoder, and set the number of layers for both the syntax context encoder and the decoder as 3, resulting in a similar model size with Transformer_Base. The accumulation weight α is as 0.8 for structural beam search based on validation experiments. For machine translation, we adopt sequence-level distillation <cit.> for both our model and the corresponding baseline Transformer. More details are shown in Appendix <ref>. Evaluation We use the BLEU score <cit.> to evaluate machine translation performance. For paraphrase generation, we also adopt ROUGE <cit.> and METEOR <cit.> as reference-based metrics. Besides, we report iBLEU <cit.>: iBLEU = r ·BLEU(hypothesis,reference) - (1-r)·BLEU(hypothesis,source), which evaluates the generation fidelity with novelty to the source sentence considered[r is set as 0.7.]. Following <cit.>, we consider two reference-free metrics: (1) lexical diversity score, i.e., 𝐃_lex, which is the normalized character-level minima edit distance between the bag-of-words; and (2) syntax diversity score, i.e., 𝐃_syn, which is the normalized tree edit distance. Both scores measure generated paraphrases with the source sequences unless specified. § RESULTS Paraphrase We compare our method with the baselines and previous work on syntax-control paraphrase generation. Another two baselines are also listed, i.e., copy the source input and use the reference as the output. The results are shown in Table <ref>. For paraphrase generation without syntax control (the center section in Table <ref>), our method achieves higher performance than the seq2seq Transformer, in both greedy and beam search settings. Typically, our method under greedy decoding obtains comparable results with the Transformer under beam search, and even outperforms under some metrics. The advantage of our method becomes larger for metrics such as iBLEU, 𝐃_lex, and 𝐃_syn, which consider generation novelty compared with the source input. For example, compared with Transformer (beam 5), our method (beam 5) gives a much lower self-BLEU score (16.4 v.s. 33.8) and higher diversity scores (21.5 v.s. 16.2 for lexical diversity and 25.1 v.s. 18.1 for syntax diversity), indicating better generation diversity and contributing to a significant improvement on iBLEU (8.6 v.s. 2.2). With annotated exemplars (the lower section in Table <ref>), our model obtains further improvement over the non-exemplar setting and achieves better performance compared to previous work which utilizes full syntactic parse. We extend our method to the pre-trained language model (PLM) setting and present the result in Table <ref> (Details in Appendix <ref>). It can be seen from the table that the utilization of BART <cit.> improves the generation diversity for the sequence-to-sequence model significantly. Despite the narrowed gap, our model outperforms the seq2seq counterpart in terms of iBLEU and lexical diversity by a considerable margin. Machine Translation As shown in Table <ref>, our method achieves consistent performance (BLEU score) improvement over the Transformer baseline. The improvement is larger for the greedy setting (+1.5 BLEU scores on average), compared with the beam search setting (+1.2). This indicates that using syntax to guide and constrain generation yields more reasonable and high-quality hypotheses than the greedy autoregressive generation, and thus relies less on search algorithms (e.g., beam search). Note that compared with the English-oriented datasets, our model obtains a smaller performance improvement on WMT'14 En-De. This can be because the German parser is less accurate than the English one (92.1 v.s. 96.3 for F1 score), resulting in a training set with lower quality. § ANALYSIS We first discuss the influence of grammar quality, then we understand the potential advantages of our method from three perspectives, i.e., interpretability, controllability, and diversity. §.§ The Influence of Grammar Quality Intuitively, learning syntactic grammar of higher quality results in better generation performance, e.g., the advantage of our method on English-oriented datasets is larger than the German-oriented one. To further explore the influence of grammar quality, we randomly replace a certain ratio of the constituent labels with a random one to simulate a less accurate parser. We conduct experiments on the WMT'16 Ro-En dataset. By injecting noise of ratios of 0.2 and 0.4, the model performance deteriorates from 34.9 to 34.6 and 32.3 accordingly, indicating the quality of syntactic grammar exerts a large influence on model's generation performance. §.§ Interpretability We evaluate the model's interpretability based on its capability of providing explanations in understandable terms to a human <cit.>, i.e., whether it generates texts following language grammar. We trace each constituent expansion during generation and compare the model-induced tree with the tree parsed by a benchmark parser, e.g., Berkeley Parser. Specifically, we use the Berkeley parser to parse the same generated hypotheses by our model and treat the corresponding parsing results as golden parses. Quantitative results (Figure <ref>) show that our model achieves an average F1 score of 94.6 , which demonstrates the generation process highly corresponds to the syntactic grammar and thus can be effectively interpreted. Note that the score for WMT'14 En-De is lower (89.0), possibly due to the less accurate German parser for constructing the syntactic grammar, as discussed in Section <ref>. §.§ Controllability Control with Complete Syntax Template To leverage control signals from delexicalized syntax templates (e.g., “( () ( ()))” for the sequence “I ate an apple.”), we introduce a reward γ into Equation <ref>: δ_ik+j = αδ_s_i + (1-α) δ_f_j;s_i + γ. If the updated syntax context s_ik+j matches the corresponding template pattern at depth d+1, the γ is a positive value otherwise 0. For example, the syntax context “<> <>” in Figure <ref> matches the pattern “(()())” at depth 2. Intuitively, the reward encourages the model to favor beam candidates that match the syntax template. We set the reward value as 0.32 based on validation results (Appendix <ref>). The testset of ParaNMT-small is provided with human-annotated exemplars and we use it to control generation, with results shown in Table <ref>. More generally, golden templates can be derived by parsing the reference sentences for each dataset with a parser (e.g., the Berkeley Parser). We present the results in Table <ref>. Guided by the reference syntax template, our model obtains consistent improvement in terms of hypothesis similarity with references, which is reflected by the decreased syntax edit distance to the references, i.e., 𝐃_syn^ref. For the multi-reference dataset NIST Zh-En, our model can generate translations of different styles which are prompted by alternative syntax templates from multiple references. Control with Partial Syntax Template We further explore whether the model can handle fine-grained arbitrary controls. Specifically, we ask three annotators to modify the intermediate syntax contexts output by the model, based on the source input. 100 instances are randomly selected from the NIST Zh-En test set and each annotator gives different modifications for each instance. The modified contexts are fed to the model to predict the infilling texts. We then ask the annotators to evaluate whether their controls (i.e., modifications) are safely responded to by the model. We show some of the control examples in Appendix <ref>. The average control success rate is 81%, which demonstrates the capability of our model to handle arbitrary fine-grained controls. §.§ Diversity Beam Diversity We expect the model to generate diverse hypotheses under beam search, while also maintaining generation quality. To this end, we measure the model's beam diversity by computing two average scores: (1) the average of the mutual diversity scores of every two of the beam candidates, i.e., 𝐃_lex^beam and 𝐃_syn^beam; (2) the average generation quality of the beam candidates, measured by BLEU scores. The results for paraphrase generation are shown in Table <ref>. In terms of generation quality, our model generates consistently better beam candidates on average than the baseline model. Besides, we can see that structural beam search can yield more diverse beam candidates, indicated by the higher mutual diversity (i.e., 𝐃_lex^beam and 𝐃_syn^beam) among beam candidates. Effects of Accumulation Weight A larger accumulation weight (α in Eq. <ref>) indicates a larger weight on previous decisions when re-ranking the newly updated beam candidates. As a result, early determined syntax structures are less likely to be surpassed throughout the whole structural beam search. On the contrary, a smaller α encourages the model to explore promising candidates at higher levels, and can therefore find more diverse hypotheses. We explore the effects of α with results shown in Figure <ref>. As the weight grows smaller, the model generates sequences of better syntactic diversity, i.e., 𝐃_syn. However, an overly small weight deteriorates generation quality (iBLEU), which can be caused by the model's overconfidence in local predictions without considering the predictions of syntax contexts at lower levels. Such deterioration is also seen for overly large weights (>0.95), due to limited exploration at higher levels. Human Evaluation We further conduct a human evaluation to evaluate generation quality and diversity on paraphrase generation. We ask three annotators to vote for one of the two candidates: hypotheses from the seq2seq baseline and our method. The annotators are required to decide, which one is better by considering Fidelity, Novelty, and Diversity (See Appendix <ref> for details). The results are shown in Table <ref>. As can be seen from the table, our method achieves much better generation novelty and beam diversity compared with the baseline, while maintaining semantic fidelity, which further validates the results of the automatic evaluation. § CONCLUSION We proposed a syntax-guided generation paradigm, which leverages the strengths of Transformer and generates sequences by hierarchically expanding constituents in the lexicalized syntax contexts throughout the syntax tree. The neural decoder was trained by maximizing the likelihood of the infilling texts for each constituent in the syntax contexts given the source sequence. Moreover, we proposed the structural beam search to better explore the hypothesis space. Empirical results demonstrated the advantage of generation quality over the seq2seq baseline, and also the effectiveness in terms of interpretability, controllability, and diversity. Our method can be seen as a step towards explicit modelling of psycholinguistic structures during neural text generation , helping the model to have a degree of control over what it intends to generate, which can potentially address salient issues of current neural NLG, such as hallucination <cit.> and ethical issues <cit.>, if semantics, pragmatics, and other factors are also integrated. § LIMITATIONS Despite the competitive performance, there are several limitations of this work: (1) As discussed in Section <ref>, the generation performance relies on the parser performance, which is strong enough for English but still less satisfactory for other languages. Dedicated methods need to be considered to compensate for the weak parser performance if we want to extend our method to more languages. (2) In this work, we consider two NLG tasks with semantic equivalence to testify if the proposed method can convey the source semantics accurately by following the target syntactic grammar. Other tasks such as summarization and dialogue generation can also be tested, where the semantics are not equivalent between the source and target. (3) To train the neural decoder parallelly, we break down the source-target dataset into a triple set. However, the global dependency of the syntax parse tree is not considered, which can deteriorate generation performance. (4) Due to the recursive encoding of the syntax contexts, our model's inference speed is approximately half that of the seq2seq counterpart (Appendix <ref>). (5) Future work should include experiments on large language models <cit.>. to further demonstrate the effectiveness of our method beyond pre-trained language models. § ETHICS STATEMENT We honor the ACL Code of Ethics. No private data or non-public information is used in this work. For human annotation (Section <ref> and Section <ref>), we recruited our annotators from the linguistics departments of local universities through public advertisement with a specified pay rate. All of our annotators are senior undergraduate students or graduate students in linguistic majors who took this annotation as a part-time job. We pay them 60 CNY an hour. The local minimum salary in the year 2022 is 25.3 CNY per hour for part-time jobs. The annotation does not involve any personally sensitive information. The annotated is required to rank the system output and label factual information (i.e., syntactic annotation). § ACKNOWLEDGEMENT We would like to thank all reviewers for their insightful comments and suggestions to help improve the paper. We thank Deng Cai and Xinting Huang for their insightful suggestions. This work is funded by the Ministry of Science and Technology of China (grant No. 2022YFE0204900). acl § ALGORITHMS The scoring algorithm <ref> can be rewritten with the source context 𝐱 encoded into 𝐡_src: score(𝐡_src,s,f)=∑_t=0^\|f\|logp_θ(f_t\|𝐡_src,s,f_1:t-1) The algorithm of structural beam search is demonstrated in Algorithm <ref>, which employs the standard beam search for autoregressive generation, depicted in Algorithm <ref>. The termination function in Algorithm <ref> (i.e., terminated(·)) returns true if the there is no remaining constituent in the input sequence. [1]1em→ #1 [1]1em→ #1 § EXPERIMENT DETAILS For NIST Zh-En, we use parts of the bitext provided within NIST’12 OpenMT[LDC2005T06, LDC2004T07, LDC2003E07, LDC2000T46, LDC2000T47, LDC2000T50, LDC2003E14, LDC2005T10, LDC2002E18, LDC2007T09, LDC2004T08] and the final train set consists of about 1.8M sentence pairs. We apply BPE <cit.> on all datasets: the number of BPE operations is 6K for ParaNMT-small, and 40K for the other datasets. We implement our model using Fairseq <cit.>. We train the model using Adam <cit.> optimizer. The learning rate increases to 7·10^-4 in the first 10K steps and then anneals exponentially. We set the weight decay as 0.01 and label smoothing as 0.1. The dropout is 0.3 for ParaNMT-small, and 0.1 for the other datasets. The batch size is 64K tokens for ParaNMT-small, 256K for WMT'16 Ro-En and NIST Zh-En, and 512K for WMT'14 De↔En. All models are trained for a maximum update of 300K steps unless early stopped. We train the model using 4 V100s and increase gradient accumulation steps for large batch sizes. We choose the 5 best checkpoints based on validation sets and average them for inference. We set the beam width as 5 for beam search. For machine translation, the teacher models for knowledge distillation are Transformer_Base for NIST Zh-En and WMT'16 Ro-en, and Transformer_Big for WMT'14 De↔En. § MODEL ARCHITECTURE We conduct experiments to compare different model architectures to incorporate syntax context on the WMT'16 Ro-En validation set. We consider the following settings: * Concat: concatenate the syntax context with the source sequence, with the vanilla Transformer unmodified. * Extra-attention: reuse the source encoder for encoding syntax context and insert an extra attention layer, i.e., the syntax context attention, into each decoder layer. * Extra-encoder: introduce an additional encoder for encoding syntax context and also uses the syntax context attention. Empirical results are shown in Table <ref>. Based on validation results, we adopt the Extra-encoder model in all experiments except for training on BART (Table <ref>), where we adopt the Concat model. § EXPERIMENTS ON PLM In this section, we introduce our experiment settings of PLM. Following previous work <cit.>, we use BART-base <cit.> as our base model. All models are finetuned for 10 epochs with a batch size of 64k tokens. The learning rate is 3e-5 and the linear decay schedule, as recommended in BART's official repository[<https://github.com/facebookresearch/fairseq/tree/main/examples/bart>]. We use the Concat (Appendix <ref>) model architecture for extending our method to BART. The source text and the syntax context are concatenated with a special token “<>”, e.g., “I ate an apple . <> <> <> .”. To effectively employ our method with BART, whose inputs are tokenized sequences byte-level, as same as <cit.>, we make several modifications. In the pre-processing, we make sure our special tokens (e.g., <>, <>, <>, <>) are not split and add extra byte-level spaces before and after the special token. Thanks to the unused tokens in BART embeddings, we do not need to modify the embedding matrix. Instead, we assign our special tokens to unused token indexes. Finally, in the inference stage, we find the constituency expansion causes a discrepancy between inputs of train and test. Thus, we first detokenize each layer's outputs and then tokenize them back with the same procedure in the preprocessing to avoid such a gap. § GENERATING LINEARIZED TREES DIRECTLY A baseline method to induce grammar simultaneously during generation is generating linearized parse trees directly, i.e., training a seq2seq model which takes in source sequences and outputs linearized parse trees. We compare it with our method on WMT'16 Ro-En. Specifically, the BLEU score for WMT'16 Ro-En is only 27.6 compared to the seq2seq baseline (34.1) and our method (34.9). This can be because the additional parentheses and constituency tags in linearized trees may deteriorate sequence coherence, making learning more difficult. Our method, on the other hand, breaks down syntax trees into level pieces to create a better learning curriculum. Furthermore, Generating linearized parse trees is much slower than the seq2seq counterpart, since the average sequence length of linearized tree sequences is longer (152.3 vs 28.4). As a result, the average speed for generating linearized parse trees is only 0.8 sentences/s compared to 3.6 sentences/s for the seq2seq baseline. Our method achieves an inference speed of 1.7 sentences/s under the same computing condition (V100 GPU). Additionally, generating a linearized parse tree is not easily interpretable or controllable, due to the black-box nature of the sequence-to-sequence paradigm. § EFFECTS OF CONTROL REWARD The magnitude of the reward γ determines how much priority is given to beam candidates that match the syntax exemplar. We experiment with different reward values to give a quantitative demonstration, shown in Figure <ref>. It can be seen that the control effectiveness grows with the increase of the reward value until 0.64, which suggests that all possible matched beam candidates are re-ranked to the top in the search space. § CONTROL WITH PARTIAL SYNTAX TEMPLATE We present 3 sample cases to demonstrate fine-grained controls over the generation process, shown in Figure <ref>. Each Chinese source sentence is paired with 3 manual controls from three annotators. The model takes in the annotated syntax context and proceeds to obtain the respective translations. § HUMAN EVALUATION FOR PARAPHRASE GENERATION We ask three annotators to conduct side-by-side human evaluations and report averaged results of their annotations. For each instance, the annotators vote for one of the two outputs by the baseline and our model. The outputs contain top-5 beam candidates under beam search. The annotators are asked to evaluate both the best candidate and the beam results as a whole, based on the following three aspects: * Fidelity: Whether the best candidate is semantics-equivalent with the input. * Novelty: Whether the best candidate modifies the input sentence structure. * Diversity: Whether the generated five candidates are different from each other given the input.
http://arxiv.org/abs/2306.03320v1	20230606001757	A parametrisation method for high-order phase reduction in coupled oscillator networks	[ "Sören von der Gracht", "Eddie Nijholt", "Bob Rink" ]	math.DS	[ "math.DS", "37D10" ]	shadows, arrows plain thrTheorem[section] mthrMain theorem lem[thr]Lemma prop[thr]Proposition cor[thr]Corollary definition defi[thr]Definition ex[thr]Example remark remkRemark remark equationsection percentA parametrisation method for high-order phase reduction in coupled oscillator networks Sören von der GrachtDepartment of Mathematics, Paderborn University, Germany, mailto:[email protected]@uni-paderborn.de, Eddie Nijholt, Bob Rink July 31, 2023 =============================================================================================================================================================================================== We present a novel method for high-order phase reduction in networks of weakly coupled oscillators and, more generally, perturbations of reducible normally hyperbolic (quasi-)periodic tori. Our method works by computing an asymptotic expansion for an embedding of the perturbed invariant torus, as well as for the reduced phase dynamics in local coordinates. Both can be determined to arbitrary degrees of accuracy, and we show that the phase dynamics may directly be obtained in normal form. We apply the method to predict remote synchronisation in a chain of coupled Stuart-Landau oscillators. § INTRODUCTION Many systems in science and engineering consist of coupled periodic processes. Examples vary from the motion of the planets, to the synchronous flashing of fireflies <cit.>, and from the activity of neurons in the brain <cit.>, to power grids and electronic circuits. The functioning and malfunctioning of these coupled systems is often determined by a form of collective behaviour of its constituents, perhaps most notably their synchronisation <cit.>. For example, synchronisation of neurons plays a critical role in cognitive processes <cit.>. In this paper, we consider the situation where the coupling between the periodic processes is weak, a case that is amenable to rigorous mathematical analysis. Specifically, we assume that the evolution of the processes can be modelled by a system of differential equations of the form ẋ_j = F_j(x_j) + ε G_j(x_1, …, x_m) x_j ∈ℝ^M_j j=1, …, m . The vector fields F_j: ℝ^M_j→ℝ^M_j in (<ref>) determine the dynamics of the uncoupled oscillators: we assume that each F_j possesses a hyperbolic T_j-periodic orbit X_j(t). In the uncoupled limit—when ε=0—equations (<ref>) thus admit a normally hyperbolic periodic or quasi-periodic invariant torus 𝕋_0 ⊂ℝ^M (where M := M_1 + … + M_m), consisting of the product of these periodic orbits. The functions G_j in (<ref>) model the interaction between the oscillators, for example through a (hyper-)network. The interaction strength 0 ≤ε≪ 1 is assumed small, so that the unperturbed torus 𝕋_0 persists as an invariant manifold 𝕋_ε for (<ref>), depending smoothly on ε, as is guaranteed by Fénichel's theorem <cit.>. The process of finding the equations of motion that govern the dynamics on the persisting torus 𝕋_ε is usually referred to as phase reduction<cit.>. Phase reduction has proved a powerful tool in the study of the synchronisation of coupled oscillators, especially because it often realises a considerable reduction of the dimension—and hence complexity—of the system. Various methods of phase reduction have been introduced over the past decades, the most well-known appearing perhaps in the work on chemical oscillations of Kuramoto <cit.>. We refer to <cit.> for an extensive overview of established phase reduction techniques, and refrain from providing an overview of these methods here. Most existing phase reduction methods provide a first-order approximation of the dynamics on the persisting invariant torus in terms of the small coupling parameter. However, there are various instances where such a first-order approximation is insufficient, see <cit.>, in particular when the first-order reduced dynamics is structurally unstable. For instance, it was observed in <cit.> that “remote synchronisation”<cit.> cannot be analysed with first-order methods. More accurate “high-order phase reduction” techniques (that go beyond the first-order approximation) have only been introduced very recently <cit.>. They have already been applied successfully, for example to predict remote synchronisation <cit.>. However, to the best of our knowledge, mathematically rigorous high-order phase reduction methods have only been derived in the special case that the unperturbed oscillators are either Stuart-Landau oscillators <cit.> or deformations thereof <cit.>. In that setting, phase reduction can be performed by computing an expansion of the phase-amplitude relation that defines the invariant torus. However, this procedure does not generalise to arbitrary systems of the form (<ref>). This paper presents a novel method for high-order phase reduction, that applies to general coupled oscillator systems of the form (<ref>). Our method works by computing an expansion (in the small parameter ε) of an embedding e: (ℝ/2πℤ)^m →ℝ^M of the persisting invariant torus 𝕋_ε. In addition, it computes an expansion of the dynamics on 𝕋_ε in local coordinates, in the form of a so-called “reduced phase vector field” f: (ℝ/2πℤ)^m →ℝ^m on the standard torus (ℝ/2πℤ)^m. We find these e and f by solving a so-called “conjugacy equation”. Our method is thus inspired by the work of De la Llave et al. <cit.>, who popularised the idea of finding invariant manifolds by solving conjugacy equations. In fact, this idea was used in <cit.> to design a quadratically convergent iterative scheme for finding normally hyperbolic invariant tori. However, in <cit.> these tori are required to carry Diophantine quasi-periodic motion, not only before but also after the perturbation. The phase reduction method presented in this paper is more similar in nature to the parametrisation method developed in <cit.>. There the idea of parametrisation is used to calculate expansions of slow manifolds and their flows in geometric singular perturbation problems <cit.>. Just like the method in <cit.>, the phase reduction method presented here yields asymptotic expansions to finite order, but it poses no restrictions on the nature of the dynamics on the invariant torus. We now sketch the idea behind our method. Let us write F_0 for the vector field on ℝ^M = ℝ^M_1×…×ℝ^M_m that governs the dynamics of the uncoupled oscillators in (<ref>), that is, F_0(x_1, …, x_m) := (F_1(x_1), …, F_m(x_m)) . Our starting point is an embedding of the invariant torus 𝕋_0 for this F_0. Recall our assumption that every F_j possesses a hyperbolic periodic orbit X_j(t) of minimal period T_j>0. We denote the frequency of this orbit by ω_j:= 2π/T_j. An obvious embedding of 𝕋_0 is the map e_0: (ℝ/2πℤ)^m →ℝ^M defined by e_0(ϕ) = e_0(ϕ_1, …, ϕ_m) := (X_1( ω_1^-1ϕ_1 ), …, X_m(ω_m^-1ϕ_m ) ) . In fact, this e_0 sends the periodic or quasi-periodic solutions of the ODEs ϕ̇= ω := (ω_1, …, ω_m) on (ℝ/2πℤ)^m to integral curves of F_0. In other words—see also Lemma <ref> below—it satisfies the conjugacy equation e_0' ·ω = F_0 ∘ e_0 . The idea is now that we search for an asymptotic approximation of an embedding of the persisting torus 𝕋_ε by solving a similar conjugacy equation. We do this by making a series expansion ansatz for such an embedding, of the form e = e_0 + ε e_1 + ε^2 e_2 + … : (ℝ/2πℤ)^m →ℝ^M , as well as for a reduced phase vector field f = ω + ε f_1 + ε^2 f_2 + …: (ℝ/2πℤ)^m →ℝ^m . Indeed, writing F = F_0 + ε F_1: ℝ^M→ℝ^M, with F_0 as above, and F_1(x) := (G_1(x), …, G_m(x)) denoting the coupled part of (<ref>), we have that e maps integral curves of f to solutions of (<ref>), exactly when the conjugacy equation e' · f = F∘ e holds. If this is the case, then 𝕋_ε = e((ℝ/2πℤ)^m) is the persisting invariant torus, whereas the vector field f on (ℝ/2πℤ)^m represents the dynamic on 𝕋_ε in local coordinates, that is, it determines the reduced phase dynamics. We will see that the conjugacy equation for (e, f) translates into a sequence of iterative equations for (e_1, f_1), (e_2, f_2), …. We will show how to solve these iterative equations, which then allows us to compute the expansions for e and f to any desired order in the small parameter. Because the embedding of the torus 𝕋_ε is not unique, neither are the solutions (e_j, f_j) to these iterative equations. We characterize the extent to which one is free to choose these solutions, and we show how this freedom can be exploited to obtain f_j that are in normal form. This means that “nonresonant” terms have been removed from the reduced phase equations to high order. A crucial requirement for the solvability of the iterative equations is that the torus 𝕋_0 is reducible. Reducibility is a property of the unperturbed dynamics normal to 𝕋_0. We shall define it at the hand of an embedding of the so-called fast fibre bundle of 𝕋_0. We call such an embedding a fast fibre map. The fast fibre map is an important ingredient of our method. An invariant torus for an uncoupled oscillator system is always reducible. We show in Section <ref> how, in this case, the fast fibre map can be obtained from the Floquet decompositions of the fundamental matrix solutions of the periodic orbits X_j(t). We remark that by using fast fibre maps, we are able to avoid the use of isochrons <cit.> to characterise the dynamics normal to 𝕋_0. Our parametrisation method is therefore not restricted to the case where the periodic orbits X_j(t) are stable limit cycles—it suffices if they are hyperbolic. We also stress that our method is not restricted to weakly coupled oscillator systems: it applies whenever the unperturbed embedded torus 𝕋_0 is quasi-periodic, normally hyperbolic and reducible. This paper is organised as follows. In section <ref> we discuss the conjugacy problem for (e, f) in more detail, and derive the iterative equations for (e_j, f_j). In section <ref> we introduce fast fibre maps and use them to define when an embedded (quasi-)periodic torus is reducible. In section <ref> we explain how the fast fibre map can be used to solve the iterative equations for (e_j, f_j). We give formulas for the solutions, and discuss their properties. Section <ref> shows how to compute the fast fibre map for a coupled oscillator system, treating the Stuart-Landau oscillator as an example. We finish with an application/illustration of our method in section <ref>, in which we prove that remote synchronisation occurs in a chain of weakly coupled Stuart-Landau oscillators. § AN ITERATIVE SCHEME We start this section with a proof of our earlier claim about the embedding e_0. In the formulation of Lemma <ref> below, we use the notation ∂_ω e_0 := e_0'·ω = . d/ds\|_s=0 e_0( · +s ω) for the (directional) derivative of e_0 in the direction of the vector ω∈ℝ^m. Like e_0 itself, ∂_ω e_0 is a smooth map from (ℝ/2πℤ)^m to ℝ^M. The embedding e_0 defined in (<ref>) satisfies the conjugacy equation ∂_ωe_0 (= e_0' ·ω) = F_0 ∘ e_0 . Recall from (<ref>) that (e_0)_j(ϕ) = X_j(ω_j^-1ϕ_j), where X_j is a hyperbolic periodic orbit of F_j. It follows that (∂_ω e_0)_j(ϕ) = . d/ds\|_s=0 (e_0)_j(ϕ + s ω) = . d/ds\|_s=0 X_j(ω_j^-1(ϕ_j + sω_j)) = Ẋ_j(ω_j^-1ϕ_j) = F_j(X_j(ω_j^-1ϕ_j)) = ( F_0)_j ( (e_0 (ϕ)) , because Ẋ_j(t) = F_j(X_j(t)) for all t ∈ℝ. Lemma <ref> implies that e_0 sends integral curves of the constant vector field ω on (ℝ/2πℤ)^m to integral curves of the vector field F_0 given in (<ref>). Because the integral curves of the ODEs ϕ̇= ω on (ℝ/2πℤ)^m are clearly either periodic or quasi-periodic, we call 𝕋_0 = e_0((ℝ/2πℤ)^m) an embedded (quasi-)periodic torus. At this point we temporarily abandon the setting of coupled oscillators and consider a general ODE ẋ = F_0(x) defined by a smooth vector field F_0: ℝ^M→ℝ^M. That is, we do not assume that this ODE decouples into mutually independent ODEs. However, we will assume throughout this paper that F_0 possesses a normally hyperbolic periodic or quasi-periodic invariant torus 𝕋_0 which admits an embedding e_0:( ℝ/2πℤ)^m →ℝ^M that semi-conjugates the constant vector field ω on ( ℝ/2πℤ)^m to F_0. In other words, we assume that e_0 and F_0 satisfy ∂_ωe_0 = F_0 ∘ e_0 , just as in Lemma <ref>. We return to coupled oscillator systems in section <ref>. We now study any smooth perturbation of F_0 of the form F = F(x) = F_0(x) + ε F_1(x) + ε^2 F_2(x) + … : ℝ^M →ℝ^M . Fénichel's theorem <cit.> guarantees that, for 0≤ε≪ 1, the perturbed ODE ẋ = F(x) admits an invariant torus 𝕋_ε close to 𝕋_0, that depends smoothly on ε. Our strategy to find 𝕋_ε will be to search for an embedding e: (ℝ/2πℤ)^m →ℝ^M close to e_0, and a reduced vector field f: (ℝ/2πℤ)^m →ℝ^m close to ω satisfying the conjugacy equation ℭ(e, f) := e' · f - F∘ e = 0 . Any solution (e, f) to (<ref>) indeed yields an embedded F-invariant torus 𝕋_ε:=e((ℝ/2πℤ)^m) ⊂ℝ^M, as we see from (<ref>) that at any point x=e(ϕ) ∈𝕋_ε the vector F(x) lies in the image of the derivative e'(ϕ), and is thus tangent to 𝕋_ε. Moreover, e semi-conjugates f to F, that is, f is the restriction of F to 𝕋_ε represented in (or “pulled back to”) the local coordinate chart (ℝ/2πℤ)^m. As explained in the introduction, we try to find solutions to (<ref>) by making a series expansion ansatz e = e_0 + ε e_1 + ε^2 e_2 + … f = ω + ε f_1 + ε^2 f_2 + … for e_1, e_2, … : (ℝ/2πℤ)^m →ℝ^M and f_1, f_2, … : (ℝ/2πℤ)^m →ℝ^m. Substitution of this ansatz in (<ref>), and Taylor expansion to ε, yields the following list of recursive equations for the e_j and f_j: [ ( ∂_ω - F_0'∘ e_0 )· e_1 + e_0' · f_1 = F_1∘ e_0 =: G_1; ( ∂_ω - F_0'∘ e_0 )· e_2 + e_0' · f_2 = F_2∘ e_0 + ( F_1'∘ e_0)· e_1; + 1/2( F_0”∘ e_0)(e_1, e_1) - e_1'· f_1 =: G_2; ⋮ ⋮ ⋮; ( ∂_ω - F_0'∘ e_0 )· e_j + e_0' · f_j = … =: G_j; ⋮ ⋮ ⋮ ] Here, each G_j: (ℝ/2πℤ)^m →ℝ^M is an “inhomogeneous term” that can iteratively be determined and depends on F_1, …, F_j, f_1, …, f_j-1 and e_1, …, e_j-1. Concretely, G_j is given by G_j :=. 1/j!d^j/dε^j\|_ε=0[ ( F_0 + ε F_1 + … + ε^j F_j) (e_0+ ε e_1 + … + ε^j-1 e_j-1); - (e_0 + ε e_1 … + ε^j-1 e_j-1)' · (ω + ε f_1 +… + ε^j-1 f_j-1) ] . Explicit formulas for G_1 and G_2 are given in (<ref>). Note that equations (<ref>) are all of the form 𝔠(e_j, f_j) = G_j j = 1,2, … , in which 𝔠(e_j, f_j) := ( ∂_ω - F_0'∘ e_0 )· e_j+ e_0' · f_j is the linearisation of the operator ℭ defined in (<ref>) at the point (e, f) = (e_0, ω), where ε=0. This linearisation 𝔠 is not invertible, but we will see that 𝔠 is surjective under the assumption that 𝕋_0 is reducible. This implies that equations (<ref>) can iteratively be solved. We think of ℭ and 𝔠 as operators between function spaces. For example, for F_0∈ C^r+1(ℝ^M, ℝ^M), F∈ C^r(ℝ^M, ℝ^M), and e_0∈ C^r+1((ℝ/2πℤ)^m, ℝ^M), ℭ, 𝔠: C^r+1((ℝ/2πℤ)^m, ℝ^M) × C^r((ℝ/2πℤ)^m, ℝ^m) → C^r((ℝ/2πℤ)^m, ℝ^M) . The solutions to equation (<ref>) are not unique because an invariant torus can be embedded in many different ways. In fact, if e: (ℝ/2πℤ)^m →ℝ^M is an embedding of 𝕋_ε and Ψ: (ℝ/2πℤ)^m → (ℝ/2πℤ)^m is any diffeomorphism of the standard torus, then also e∘Ψ is an embedding of 𝕋_ε. The operator ℭ defined in (<ref>) is thus equivariant under the group of diffeomorphisms of (ℝ/2πℤ)^m. As a consequence, solutions of (<ref>) are not unique either. For the interested reader we provide additional details on Remark <ref>. Let us denote by Ψ^f the pullback of the vector field f by Ψ defined by the formula (Ψ^f)(ϕ) := (Ψ'(ϕ))^-1· f(Ψ(ϕ)) for all ϕ∈ (ℝ/2πℤ)^m. We claim that ℭ(e∘Ψ, Ψ^f) = ℭ(e, f)∘Ψ . This follows from a straightforward calculation. Indeed, ℭ(e∘Ψ, Ψ^f)(ϕ) = e'(Ψ(ϕ))·Ψ'(ϕ)·(Ψ'(ϕ))^-1· f(Ψ(ϕ)) - F((e ∘Ψ)(ϕ)) = e'(Ψ(ϕ))· f(Ψ(ϕ)) - ( F∘ e)(Ψ(ϕ)) = ℭ(e, f)(Ψ(ϕ)) . As we may view vector fields as infinitesimal diffeomorphisms, this allows us to find many elements in the kernel of 𝔠. Namely, if X is any vector field on (ℝ/2πℤ)^m with corresponding flow φ_t, then .d/dt\|_t=0(e_0 ∘φ_t, φ_t^ ω) = (e_0' · X, [X, ω]) ∈𝔠. Here [X, ω] = -X'·ω = -∂_ω X denotes the Lie bracket between X and ω. Formula (<ref>) may also be verified directly. Differentiating the identity ℭ(e_0, ω)(ϕ) = e_0'(ϕ) ·ω - ( F_0 ∘ e_0)(ϕ) = 0 at any ϕ, in the direction of any vector u, we first of all find that e_0”(ϕ) (ω, u) - ( F_0' ∘ e_0)(ϕ) · e_0'(ϕ) · u = 0 . From this we see that indeed 𝔠(e_0' · X, [X, ω]) = (∂_ω - F_0' ∘ e_0)· e_0' · X - e'_0 ·∂_ω X = e_0” (ω, X) + e_0' ·∂_ω X - ( F_0' ∘ e_0) · e_0' · X - e'_0 ·∂_ω X = e_0” (ω, X) - ( F_0' ∘ e_0) · e_0' · X = 0 , where the last step follows from equation (<ref>). § REDUCIBILITY AND THE FAST FIBRE MAP As was indicated in Remarks <ref> and <ref>, the solutions to the iterative equations 𝔠(e_j, f_j) = G_j are not unique. However, we show in section <ref> that solutions can be found if we assume that the unperturbed torus 𝕋_0 is reducible. We define this concept by means of a parametrisation of the linearised dynamics of F_0 normal to 𝕋_0. But we start with the observation that the linearised dynamics tangent to 𝕋_0 is trivial. Recall that if e_0: (ℝ/2πℤ)^m →ℝ^M is an embedding of 𝕋_0 ⊂ℝ^M, then the tangent mapTe_0 :(ℝ/2πℤ)^m ×ℝ^m →ℝ^M×ℝ^M defined by Te_0(ϕ, u) = (e_0(ϕ), e_0'(ϕ)· u) is an embedding as well. Its image is the tangent bundle T𝕋_0 ⊂ℝ^M ×ℝ^M. Assume that the embedding e_0: (ℝ/2πℤ)^m →ℝ^M semi-conjugates the constant vector field ω∈ℝ^m on (ℝ/2πℤ)^m to the vector field F_0 on ℝ^M. Then Te_0 sends solution curves of the system of ODEs ϕ̇= ω , u̇ = 0 (ℝ/2πℤ)^m ×ℝ^m to integral curves of the tangent vector field T F_0 on ℝ^M×ℝ^M defined by T F_0(x,v) := ( F_0(x), F_0'(x)· v) . Our assumption simply means that ∂_ω e_0 = F_0 ∘ e_0. As we already observed in (<ref>), differentiation of this identity at a point ϕ∈ (ℝ/2πℤ)^m in the direction of a vector u ∈ℝ^m yields that e_0”(ϕ) (u, ω) = F_0'(e_0(ϕ))· e_0'(ϕ) · u . From this it follows that ( Te_0)'(ϕ,u)· ( ω, 0) = . d/ds\|_s=0 Te_0(ϕ+s ω, u) = . d/ds\|_s=0( e_0(ϕ+sω), e_0'( ϕ+sω) · u ) = ( (∂_ω e_0)(ϕ), e_0”(ϕ) (u, ω) ) = ( F_0(e_0(ϕ)), F_0'(e_0(ϕ)) · e_0'(ϕ)· u ) = T F_0 ( Te_0(ϕ, u)) . In the last equality we used Definitions (<ref>) and (<ref>). Lemma <ref> shows that Te_0 trivialises the linearised dynamics of F_0 in the direction tangent to 𝕋_0. In what follows, we assume that something similar happens in the direction normal to 𝕋_0, that is, we assume that 𝕋_0 is reducible. We define this concept now. Assume that the embedding e_0: (ℝ/2πℤ)^m →ℝ^M semi-conjugates the constant vector field ω∈ℝ^m on (ℝ/2πℤ)^m to the vector field F_0 on ℝ^M. We say that the (quasi-)periodic invariant torus 𝕋_0 = e_0( (ℝ/2πℤ)^m) is reducible if there is a map Ne_0 : (ℝ/2πℤ)^m ×ℝ^M-m→ℝ^M ×ℝ^M of the form Ne_0(ϕ, u) := (e_0(ϕ), N(ϕ)· u) , for a smooth family of linear maps N: (ℝ/2πℤ)^m →ℒ(ℝ^M-m, ℝ^M) , with the following two properties: i)Ne_0 is transverse to Te_0. By this we mean that ℝ^M = im e_0'(ϕ) ⊕ im N(ϕ) ϕ∈ (ℝ/2πℤ)^m . In particular, every N(ϕ) is injective. ii) There is a linear map L: ℝ^M-m→ℝ^M-m such that Ne_0 sends solution curves of the system of ODEs ϕ̇= ω , u̇ = L · u (ℝ/2πℤ)^m ×ℝ^M-m to integral curves of the tangent vector field T F_0 on ℝ^M×ℝ^M. When 𝕋_0 is reducible, the matrix L is called a Floquet matrix for 𝕋_0, and its eigenvalues the Floquet exponents of 𝕋_0. If L is hyperbolic (no Floquet exponents lie on the imaginary axis) then 𝕋_0 is normally hyperbolic, and we call Ne_0 a fast fibre map for 𝕋_0. Its image N𝕋_0 := Ne_0 ((ℝ/2πℤ)^m ×ℝ^M-m) ⊂ℝ^M×ℝ^M is then called the fast fibre bundle of 𝕋_0. We note that the map Ne_0 appearing in Definition <ref> is an embedding because e_0 is an embedding and the linear maps N(ϕ) are all injective. Therefore its image N𝕋_0 is a smooth M-dimensional manifold. Condition i) ensures that N𝕋_0 is in fact a normal bundle for 𝕋_0. We finish this section with an alternative characterisation of property ii) in Definition <ref>. Assume that the embedding e_0: (ℝ/2πℤ)^m →ℝ^M semi-conjugates the constant vector field ω to the vector field F_0. Let L: ℝ^M-m→ℝ^M-m be a linear map, and let Ne_0 be a map of the form (<ref>) for a smooth family of linear maps N: (ℝ/2πℤ)^m →ℒ(ℝ^M-m, ℝ^M). The following are equivalent: i)Ne_0 sends solution curves of the system of ODEs ϕ̇= ω , u̇ = L · u (ℝ/2πℤ)^m ×ℝ^M-m to integral curves of the tangent vector field T F_0 on ℝ^M×ℝ^M; ii)N=N(ϕ) satisfies the partial differential equation ∂_ω N + N · L= ( F_0' ∘ e_0) · N (ℝ/2πℤ)^m . It holds that ( Ne_0)'(ϕ, u) · (ω, L· u ) = . d/ds\|_s = 0(e_0(ϕ + s ω), N(ϕ + s ω) · (u+s L· u ) ) = ((∂_ω e_0)(ϕ), ∂_ω N(ϕ) · u + N(ϕ)· L· u) . At the same time, T F_0( Ne_0(ϕ, u)) = ( F_0(e_0(ϕ)), F_0'(e_0(ϕ))· N(ϕ)· u) . It holds that ∂_ω e_0 = F_0∘ e_0 by assumption, so the first components of these two expressions are equal. The conclusion of the lemma therefore follows from comparing the second components. Reducibility of a (quasi-)periodic invariant torus of an arbitrary vector field F_0 can only be quaranteed under strong conditions, e.g., that F_0 is Hamiltonian <cit.>, or that the frequency vector ω satisfies certain Diophantine inequalities <cit.>. We do not assume such conditions here. Even the question whether reducibility is preserved under perturbation is subtle <cit.>. However, hyperbolic periodic orbits (which are one-dimensional normally hyperbolic invariant tori) are always reducible (at least if we allow the matrix L to be complex, see Section <ref>). This relatively well-known fact is a consequence of Floquet's theorem <cit.>, as we show in Theorem <ref>. The (quasi-)periodic torus occurring in an uncoupled oscillator system such as (<ref>) is a product of hyperbolic periodic orbits, and is therefore reducible as well, see Lemma <ref>. § SOLVING THE ITERATIVE EQUATIONS We now return to solving the iterative equations (<ref>), assuming from here on out that 𝕋_0 is an embedded (quasi-)periodic reducible and normally hyperbolic invariant torus for F_0. The main result of this section can be summarised (at this point still somewhat imprecisely) as follows. Assume that 𝕋_0 = e_0((ℝ/2πℤ)^m) ⊂ℝ^M is a smooth embedded (quasi-)periodic reducible normally hyperbolic invariant torus for F_0. Then i) there are smooth solutions (e_j, f_j) to the iterative equations 𝔠(e_j, f_j)= G_j for every j∈ℕ, for which we provide explicit formulas in this section; ii) the component of each e_j tangential to 𝕋_0 can be chosen freely, but every such choice for e_1, …, e_j-1 uniquely determines the component of e_j normal to 𝕋_0 (see Theorem <ref>); iii) the tangential component of e_j can be chosen in such a way that f_j is in “normal form” to arbitrarily high order in its Fourier expansion. We say that f_j is in normal form if it is a sum of “resonant terms” only (see Corollary <ref>). The precise meaning of the statements in this theorem will be made clear below. Theorem <ref> follows directly from the results presented in this section. To prove the theorem, recall that (because 𝕋_0 is reducible) we have at our disposal a fast fibre map Ne_0 for 𝕋_0, defined by a family of injective matrices N=N(ϕ) that satisfies ℝ^M = im e_0'(ϕ) ⊕ im N(ϕ) for every ϕ∈ (ℝ/2πℤ)^m. This enables us to make the ansatz e_j(ϕ)_[ ∈; ℝ^M ] = e_0'(ϕ)_[ ∈; ℒ(ℝ^m, ℝ^M) ]· g_j(ϕ)_[ ∈; ℝ^m ] + N(ϕ)_[ ∈; ℒ(ℝ^M-m, ℝ^M) ]· h_j(ϕ)_[ ∈; ℝ^M-m ] , for (unknown) smooth functions g_j: (ℝ/2πℤ)^m →ℝ^m and h_j: (ℝ/2πℤ)^m →ℝ^M-m. This ansatz decomposes e_j into components in the direction of the tangent bundle Te_0 and the fast fibre bundle Ne_0. The ansatz (<ref>) transforms equation (<ref>) into 𝔠(e_j, f_j) = e_0' ·( ∂_ω g_j + f_j ) + N ·(∂_ω - L)( h_j) = G_j . We use our definitions, and results derived above, to compute: G_j = 𝔠(e_j, f_j) = ( ∂_ω - F_0'∘ e_0 )· e_j+ e_0' · f_j = ( ∂_ω - F_0' ∘ e_0 )·( e_0' · g_j + N· h_j ) + e_0' · f_j = e_0”( g_j, ω) + e_0' ·∂_ω g_j + ∂_ωN · h_j + N ·∂_ω h_j - ( F_0'. ∘ e_0) · e_0' · g_j - ( F_0' ∘ e_0)· N · h_j + e_0' · f_j = e_0”( g_j, ω) - ( F_0'. ∘ e_0) · e_0' · g_j _=0 + e_0' ·∂_ω g_j + e_0' · f_j + N ·∂_ω h_j + ∂_ωN · h_j - ( F_0' ∘ e_0)· N · h_j_=-N · L · h_j = e_0' ·( ∂_ω g_j + f_j ) + N ·(∂_ω - L ) · h_j . We clarify these equalities below: 1. The first equality is (<ref>); 2. In the second equality, we used (<ref>); 3. The third equality is our ansatz (<ref>); 4. The fourth equality follows from the product rule (applied twice); 5. In the fifth equality, the terms in the sum were re-ordered; 6. The final equality follows from (<ref>) and (<ref>). This proves the lemma. Lemma <ref> allows us to solve equation (<ref>) by splitting it into a component along the tangent bundle T𝕋_0 and a component along the fast fibre bundle N𝕋_0 of 𝕋_0. In what follows we denote by π: (ℝ/2πℤ)^m →ℒ(ℝ^M, ℝ^M) the family of projections onto the tangent bundle along the fast fibre bundle. That is, each π(ϕ): ℝ^M→ℝ^M is the unique projection that satisfies π(ϕ)· e_0'(ϕ) = e_0'(ϕ) π(ϕ)· N(ϕ) = 0 . Proposition <ref> below provides an explicit formula for π(ϕ). It is clear from this formula that π depends smoothly on the base point ϕ∈ (ℝ/2πℤ)^m. Applying π and 1-π to (<ref>) produces, respectively, e_0' · ( ∂_ω g_j + f_j ) = π· G_j , N · (∂_ω - L)( h_j) = (1-π)· G_j . Because e_0'(ϕ) and N(ϕ) are injective, these equations are equivalent to [ ∂_ω g_j + f_j = (e_0')^+·π· G_j =: U_j ,; (∂_ω - L)( h_j) = N^+·(1-π)· G_j =: V_j . ] Here, A^+ := (A^TA)^-1A^T denotes the Moore-Penrose pseudo-inverse, which is well-defined for an injective linear map A. Clearly, (e_0')^+ and N^+ depend smoothly on ϕ∈(ℝ/2πℤ)^m. We give these equations a special name. We call the first equation in (<ref>), ∂_ω g_j + f_j = U_j , the j-th tangential homological equation. The second equation in (<ref>), (∂_ω - L)( h_j) = V_j , is called the j-th normal homological equation. To recap, we note that (<ref>) and (<ref>) are inhomogeneous linear equations for the three unknown smooth functions f_j, g_j, h_j and with the inhomogeneous right hand sides U_j, V_j. The domains and co-domains of these functions are given by f_j, g_j, U_j : (ℝ/2πℤ)^m →ℝ^m h_j, V_j: (ℝ/2πℤ)^m →ℝ^M-m . The following theorem shows how the homological equations can be solved. Explicit expressions for the Fourier series of the solutions are given in formulas (<ref>) and (<ref>), that appear in the proof of the theorem. For any smooth functions g_j, U_j: (ℝ/2πℤ)^m →ℝ^m and V_j: (ℝ/2πℤ)^m →ℝ^M-m, there are unique smooth functions f_j: (ℝ/2πℤ)^m →ℝ^m and h_j:(ℝ/2πℤ)^m →ℝ^M-m that solve (<ref>) and (<ref>). The tangential homological equation (<ref>) can be rewritten as f_j = U_j - ∂_ω g_j . This shows that for any smooth g_j and U_j there exists a unique solution f_j. However, in view of Corollary <ref> below, we would also like a formula for the solution of the tangential homological equation in the form of a Fourier series. To this end, we expand U_j and g_j in Fourier series as U_j(ϕ) = ∑_k∈ℤ^m U_j,k e^i⟨ k, ϕ⟩ g_j(ϕ) = ∑_k∈ℤ^m g_j,k e^i⟨ k, ϕ⟩ . We use the notation ⟨ k, ϕ⟩ := k_1 ϕ_1 + … + k_m ϕ_m for what is often called the k-th combination angle. Note that the Fourier coefficients U_j,k, g_j,k∈ℂ^m are complex vectors satisfying U_j,-k = U_j,k and g_j,-k = g_j,k, because U_j and g_j are real-valued. We similarly expand f_j in a Fourier series by making the solution ansatz f_j(ϕ) = ∑_k∈ℤ^m f_j,k e^i⟨ k, ϕ⟩, with f_j,k∈ℂ^m. In terms of these Fourier series, equation (<ref>) becomes ∑_k∈ℤ^m (i⟨ω,k⟩ g_ j,k + f_j,k) e^i⟨ k, ϕ⟩ = ∑_k∈ℤ^m U_j,k e^i⟨ k, ϕ⟩ , or, equivalently, i⟨ω,k⟩ g_ j,k + f_j,k = U_j,k k∈ℤ^m . This shows that for any choice of Fourier coefficients U_j,k for U_j and g_j,k for g_j there are unique Fourier coefficients f_j,k for the solution f_j to the tangential homological equation. These coefficients are given by f_j,k = U_j,k - i⟨ω,k⟩ g_ j,k k∈ℤ^m . It is clear from this equation that f_j,-k = f_j,k so that f_j is real-valued. We proceed to solve the normal homological equation (<ref>). We again use Fourier series, and thus we expand h_j and V_j as h_j(ϕ) = ∑_k∈ℤ^m h_j,k e^i⟨ k, ϕ⟩ V_j(ϕ) = ∑_k∈ℤ^m V_j,k e^i⟨ k, ϕ⟩ , for h_j,k, V_j,k∈ℂ^M-m satisfying V_j,-k = V_j,k. Substitution of (<ref>) into (<ref>) produces ∑_k∈ℤ^m (i⟨ω, k ⟩ - L ) h_j,k e^i⟨ k, ϕ⟩ = ∑_k∈ℤ^m V_j,k e^i⟨ k, ϕ⟩ , so that we obtain the equations ( i⟨ω,k⟩ - L ) h_j,k = V_j,k k∈ℤ^m . Because L has no eigenvalues on the imaginary axis, the matrix i⟨ω,k⟩ - L is invertible. Each of the equations in (<ref>) therefore possesses a unique solution, which is given by h_j,k = ( i⟨ω,k⟩ - L )^-1 V_j,k . Because the matrix L is real, it follows that h_j,-k = h_j,k. This proves the theorem. Formulas (<ref>) and (<ref>) allow us to estimate the smoothness of the solutions f_j and h_j to equations (<ref>), (<ref>) in terms of the smoothness of g_j, U_j and V_j. To see this, let A: (ℝ/2πℤ)^m →ℂ^p be a function with Fourier series A(ϕ) = ∑_k∈ℤ^m A_ke^i⟨ k, ϕ⟩ . For k∈ℤ^m, define \|k\|:= ( \|k_1\|^2+…+\|k_m\|^2 )^1/2, and let W_\|k\|∈ℝ_>0 be weights satisfying W_\|k\|→∞ as \|k\|→∞. When \|\|·\|\| is any norm on ℂ^p, then \|\| A\|\|_W := ( ∑_k∈ℤ^m \|\|A_k\|\|^2 W_\|k\|^2 )^1/2 defines a norm of A that measures the growth of its Fourier coefficients. For example, when W_\|k\|=(1+\|k\|^2)^s/2 for some s > 0, then it is a Sobolev norm. It follows directly from (<ref>) that \|\| f_j \|\|_W ≤ \|\|U_j\|\|_W + \|\| ∂_ω g_j\|\|_W, which shows that f_j is at least as smooth as U_j and ∂_ω g_j. To find a similar bound for \|\| h_j\|\|_W, note that the hyperbolicity of L implies that the function λ↦ \|\|(iλ - L)^-1\|\|_ op on ℝ, that assigns to λ the operator norm of (iλ - L)^-1, is well-defined, and therefore also continuous. It converges to 0 as λ→±∞. Hence it is uniformly bounded in λ. In particular, \|\|(i⟨ k, ω⟩ - L)^-1\|\|_ op≤ C_L := max_λ∈ℝ \|\|(iλ - L)^-1\|\|_ op . It thus follows from (<ref>) that \|\| h_j\|\|_W ≤ C_L \|\|V_j\|\|_W . This means that h_j is at least as smooth as V_j. Theorem <ref> shows that one can choose g_j (and thus the component of e_j tangent to 𝕋_0) freely when solving the homological equations (<ref>) and (<ref>). This reflects the fact that the embedding of 𝕋_ε is not unique. Corollary <ref> below states that it is possible to choose g_j in such a way that f_j is in “normal form”. We first define this concept. Let f = ω + ε f_1 + ε^2 f_2 + … : (ℝ/2πℤ)^m →ℝ^m be an asymptotic expansion of a vector field on (ℝ/2πℤ)^m. Assume that the Fourier series of f_j is given by f_j(ϕ) = ∑_k∈ℤ^m f_j, ke^i⟨ k, ϕ⟩ f_j,k∈ℂ^m . For k∈ℤ^m, denote \|k\|= ( \|k_1\|^2+…+\|k_m\|^2 )^1/2 as before. We say that f_j is in normal form to order K∈ℕ∪{∞} in its Fourier expansion if f_j,k = 0 k∈ℤ^m ⟨ω, k ⟩≠ 0 \|k\|≤ K . We remark that f_j is in normal form to order K in its Fourier expansion, if and only if its truncated Fourier series f_j^K(ϕ) := ∑_\|k\|≤ K f_j,k e^i⟨ k, ϕ⟩ depends only on so-called resonant combination angles. A combination angle ⟨ k, ϕ⟩ is called resonant when ⟨ k, ω⟩ =0. The following result shows that we can arrange for the reduced phase vector field to be in normal form to arbitrarily high-order in its Fourier expansion. For any (finite) K∈ℕ the function g_j can be chosen in such a way that the solution f_j to the tangential homological equation ∂_ω g_j + f_j = U_j is in normal form to order K in its Fourier expansion. Recall that the tangential homological equation reduces to the equations i⟨ω,k⟩ g_ j,k + f_j,k = U_j,k for the Fourier coefficients of f_j, g_j and U_j—see (<ref>). Given K∈ℕ, choose [ g_j,k = U_j,k/i ⟨ k, ω⟩ ⟨ k, ω⟩≠ 0 \|k\|≤ K,; g_j,k = 0 ⟨ k, ω⟩ = 0 \|k\|> K. ] The (unique) solutions to (<ref>) are then given by [ f_j,k=0 ⟨ k, ω⟩≠ 0 \|k\|≤ K,; f_j,k=U_j,k ⟨ k, ω⟩ = 0 \|k\|> K. ] With these choices, g_j is a smooth function, as its Fourier expansion is finite. It is also clear that f_j is in normal form to order K in its Fourier expansion. Recall that the flow of the ODE ϕ̇= ω on (ℝ/2πℤ)^m is periodic or quasi-periodic and given by the formula ϕ↦ϕ + ω t (2πℤ)^m. It follows that the time-average over this (quasi-)periodic flow, of a complex exponential vector field f_k e^i⟨ k, ϕ⟩ (with f_k∈ℂ^m) is given by lim_T→∞1/T∫_0^T f_ke^i⟨ k, ϕ + ω t ⟩ dt = {[ f_k e^i⟨ k, ϕ⟩ ⟨ k, ω⟩ = 0 ,; 0 ⟨ k, ω⟩≠ 0 . ]. This shows that f_k e^i⟨ k, ϕ⟩ is resonant (that is: it depends on a resonant combination angle) precisely when it is equal to its average over the (quasi-)periodic flow, whereas f_ke^i⟨ k, ϕ⟩ is nonresonant precisely when this average is zero. For an arbitrary (and sufficiently regular) Fourier series it follows that lim_T→∞1/T∫_0^T ( ∑_k∈ℤ^m f_k e^i⟨ k, ϕ+ω t⟩) dt = ∑_[ k∈ℤ^m; ⟨ω, k⟩ = 0 ] f_k e^i⟨ k, ϕ⟩ . We conclude that averaging a Fourier series removes its nonresonant terms, while keeping its resonant terms untouched. Corollary <ref> shows that it can be arranged that the term f_j in the reduced vector field f is a sum of resonant terms only (to arbitrarily high order). We may thus loosely interpret Corollary <ref> as a high-order averaging theorem, see <cit.>. We include the following result for completeness. Applied to A=e_0'(ϕ) and B=N(ϕ) it gives a formula for the projection π(ϕ) onto the tangent space to 𝕋_0 at e_0(ϕ) along the fast fibre at that point. This formula is not only useful for practical computations, but also shows explicitly that π(ϕ) depends smoothly on ϕ. A proof of Proposition <ref> is given in <cit.>. Let 1≤ m ≤ M and assume that A ∈ℒ(ℝ^m, ℝ^M) and B ∈ℒ(ℝ^M-m, ℝ^M) are linear maps satisfying ℝ^M = im A ⊕ im B. We denote by π∈ℒ(ℝ^M, ℝ^M) the “oblique projection” onto the image of A along the image of B, i.e., π is the unique linear map satisfying π A = A and π B=0. Then π is given by the formula π = A (A^Tπ(B)^⊥ A)^-1A^Tπ(B)^⊥ π(B)^⊥ := (1 - B(B^TB)^-1B^T) . The T denotes matrix transpose. All the inverses in this formula exist. Note that π(B)^⊥ is the orthogonal projection onto B^T along im B. Maybe there is a nice way to estimate the norm of (i⟨ω,k⟩ - M_0 )^-1 in terms of the norm of M_0^-1. For any real matrix A and real number Ω we will have \|\|A+iΩ\|\|^2_ Frob = tr (A+iΩ)(A^T-iΩ) = tr( AA^T + Ω^2) ≥ tr( AA^T) = \|\| A\|\|^2_ Frob . We also have \|\|A\|\|^2_ Op = sup_v^v=1 v^(A^T-iΩ)(A+iΩ) v = sup_v^v=1 v^(A^TA+Ω^2) v = Ω^2 + sup_v^v=1 v^A^TA v = Ω^2 + \|\|A\|\|_ Op^2 because iΩ v^(A^T-A)v=0 because A^T-A is anti-symmetric. How do we use this for an estimate for the inverse? § REDUCIBILITY FOR OSCILLATOR SYSTEMS In this section we show that the invariant torus of a system of uncoupled oscillators (see the introduction) is reducible. We also give a formula for the fast fibre map for such a torus. The results in this section are a consequence of Floquet's theorem, which implies that the invariant circle defined by a single hyperbolic periodic solution of an ODE is reducible. The results in this section should thus be considered well-known, but for completeness we include them in detail. We start with the result for single hyperbolic periodic orbits. Let X: ℝ→ℝ^M be a hyperbolic T-periodic orbit of a smooth vector field F: ℝ^M→ℝ^M. Then the invariant circle 𝕋_0=X(ℝ) ⊂ℝ^M is reducible and normally hyperbolic. Its fast fibre map is given by formula (<ref>). Assume that the ODE ẋ = F(x) ℝ^M possesses a hyperbolic periodic orbit X = X(t) with minimal period T>0. We think of it as an invariant circle 𝕋_0 embedded by the map e_0: ℝ/2πℤ→ℝ^M defined by e_0(ϕ) := X(ω^-1ϕ), where ω:=2π/T. Let Φ = Φ(t) ∈ GL(ℝ^M) be the principal fundamental matrix solution of the linearisation around this periodic orbit. This means that Φ̇(t) = F'(X(t))·Φ(t) Φ(0)= Id_ℝ^M . Floquet's theorem <cit.> states that Φ(t) admits a factorisation Φ(t) = P(t) e^Bt P(t+T) = P(t) P(0)= Id_ℝ^M . The constant (and perhaps complex) Floquet matrix B satisfies e^BT = Φ(T), for example B=1/TlogΦ(T) for a choice of matrix logarithm. Note that a matrix logarithm of Φ(T) exists because Φ(T) is invertible. We shall assume here that B is a real matrix. This can always be arranged by replacing T by 2T and considering a double cover of 𝕋_0 if necessary, but we ignore this (somewhat annoying) subtlety here. Substituting the Floquet decomposition in the definition of the fundamental matrix solution, we obtain that Ṗ(t) e^Bt + P(t) B e^Bt = F'(X(t)) P(t) e^Bt. Thus, Ṗ(t)+ P(t) B = F'(X(t)) P(t) . This implies that we found a solution to Equation (<ref>) in Lemma <ref>. Indeed, if we define L̃=B Ñ(ϕ) = P(ω^-1ϕ) , then we have, recalling that e_0(ϕ)=X(ω^-1ϕ)), ∂_ωÑ(ϕ) + Ñ (ϕ)·L̃ = Ñ'(ϕ)·ω + Ñ(ϕ) ·L̃ = Ṗ(ω^-1ϕ) + P(ω^-1ϕ) · B = F'(X(ω^-1ϕ)) · P(ω^-1ϕ) = F'(e_0(ϕ))·Ñ(ϕ) . However, this does not yet prove that the periodic orbit is reducible, because Ñ=Ñ(ϕ) defines a family of M× M-matrices, and hence the image of Ñ(ϕ) is not normal to the tangent vector ω e_0'(ϕ) = Ẋ(ω^-1ϕ) to the periodic orbit. To resolve this issue, recall that Φ(T) always has a unit eigenvalue. This follows from differentiating the identity Ẋ(t) = F(X(t)) to t, which gives that d/dtẊ(t) = F'(X(t))·Ẋ(t), so that Ẋ(0) = Ẋ(T) = Φ(T)·Ẋ(0) . Because Φ(T) = e^BT, we conclude that B has a purely imaginary eigenvalue in 2π i /Tℤ. Our assumption that X is hyperbolic implies that none of the other eigenvalues of B lie on the imaginary axis. Because B is real and its eigenvalues must thus come in complex conjugate pairs, we conclude that the purely imaginary eigenvalue of B must in fact be zero. We now choose an injective linear map A: ℝ^M-1→ℝ^M whose image coincides with the (M-1)-dimensional image of B. For any such choice of A there is a unique map L: ℝ^M-1→ℝ^M-1 for which A · L = B · A . Clearly, the eigenvalues of L are the nonzero eigenvalues of B, showing that L is hyperbolic. We also define N: ℝ/2πℤ→ℒ(ℝ^M-1, ℝ^M) by N(ϕ) := P(ω^-1ϕ) A . By definition, im N(0)= im A = im B is transverse to the tangent vector Ẋ(0) ∈ B to the periodic orbit. Because each P(t) is invertible, this transversality persists along the entire orbit. Indeed, writing t = ω^-1ϕ, note that Ẋ(t) = Φ(t) Ẋ(0) = P(t) e^BtẊ(0) = P(t) Ẋ(0) ∈ P(t)( ker B) is transversal to im N(ϕ) = im(P(t)A) = P(t) ( im B). Finally, we compute ∂_ωN(ϕ) + N(ϕ)L = N'(ϕ) ω + N(ϕ)L = Ṗ(ω^-1ϕ) A + P(ω^-1ϕ) A L = Ṗ(ω^-1ϕ) A + P(ω^-1ϕ) B A = F'(X(ω^-1ϕ)) P(ω^-1ϕ)A = F'(e_0(ϕ)) N(ϕ) . This proves that the invariant circle 𝕋_0 defined by X(t) is reducible. As an example consider a single Stuart-Landau oscillator ż = (α + i β) z + (γ + i δ) \|z\|^2 z z ∈ℂ≅ℝ^2 . Here α, β, γ, δ∈ℝ are parameters. We assume that αγ < 0 and αδ - βγ≠ 0, so that (<ref>) possesses a unique (up to rotation) circular periodic orbit X(t) = R e^iω t R := √(-α /γ) ω := β - αδ / γ≠ 0 . Thus, the embedding e_0: ℝ/2πℤ∋ϕ↦ z := R e^i ϕ∈ℂ sends solutions of ϕ̇= ω on ℝ/2πℤ to solutions of (<ref>). The Floquet decomposition of the fundamental matrix solution around this periodic orbit can be found by anticipating that P(t)=e^iω t and thus making the ansatz Φ(t) = e^iω t e^Bt for an unknown linear map B: ℂ→ℂ. With this in mind we expand solutions to (<ref>) nearby the periodic orbit as z(t)=R e^iω t + ε e^iω t v(t) . To first order in ε this gives the linear differential equations v̇ = v̇_1 + i v̇_2 = 2 R^2 (γ + i δ) v_1 , which shows that the Floquet map B: ℂ→ℂ must be given by B(v_1 + i v_2)= 2 R^2 (γ + i δ) v_1 . This B has an eigenvalue 0 (with eigenvector i corresponding to the tangent space to the invariant circle) and an eigenvalue 2γ R^2 = - 2 α≠ 0 (with eigenvector γ +iδ). We conclude that the map Ne_0: (ϕ, u) ↦ (R e^iϕ, e^iϕ (γ + i δ) u) ℝ/2πℤ×ℝ ℂ×ℂ sends solutions of ϕ̇= ω , u̇ = - 2α u ϕ∈ℝ/2πℤ u ∈ℝ to solutions of the linearised dynamics of (<ref>) on ℂ×ℂ around the invariant circle. In particular, we have L= - 2 α and N(ϕ)= e^iϕ ( γ + i δ ). The projection onto the tangent bundle of the invariant circle along its fast fibre bundle is given by the formulas π(0)· (x + i y) = i (y - (δ / γ) x) π(ϕ) = e^iϕ·π(0)· e^-iϕ . Indeed, it is easy to check that π(ϕ)· i e^iϕ = i e^iϕ and π(ϕ)· e^iϕ ( γ + i δ ) = 0. We now extend the result of Theorem <ref> to systems of multiple uncoupled oscillators, that is, systems of the form ẋ_1 = F_1(x_1) , … , ẋ_m = F_m(x_m) x_j∈ℝ^M_j , that each have a hyperbolic T_j-periodic orbit X_j(t). Recall that the product of these periodic orbits forms an invariant torus. The fact that this torus is reducible follows from the following lemma. Its proof is straightforward, but included here for completeness. Let 𝕋_1⊂ℝ^M_1 and 𝕋_2⊂ℝ^M_2 be embedded reducible normally hyperbolic (quasi-)periodic invariant tori for the vector fields F_1 and F_2 respectively. Then the product torus 𝕋_0:=𝕋_1×𝕋_2 ⊂ℝ^M (with M:=M_1+M_2) is an embedded reducible normally hyperbolic quasi-periodic invariant torus for the product vector field F_0 on ℝ^M defined by F_0(x_1, x_2) :=( F_1(x_1), F_2(x_2)). Assume that e_j:(ℝ/2πℤ)^m_j→ℝ^M_j (for j=1, 2) is an embedding of a reducible normally hyperbolic (quasi-)periodic invariant torus for the vector field F_j. This means that there are frequency vectors ω_j∈ℝ^m_j such that ∂_ω_je_j = F_j ∘ e_j and fast fibre maps Ne_j: (ℝ/2πℤ)^m_j×ℝ^M_j-m_j→ℝ^M_j×ℝ^M_j of the form Ne_j(ϕ_j, u_j) = (e_j(ϕ_j), N_j(ϕ_j)· u_j) satisfying ∂_ω_jN_j + N_j · L_j = ( F_j'∘ e_j) · N_j for certain hyperbolic Floquet matrices L_j. If we now define m:=m_1+m_2, ω:=(ω_1, ω_2)∈ℝ^m and e_0: (ℝ/2πℤ)^m→ℝ^M by e_0(ϕ) = e_0(ϕ_1, ϕ_2) := (e_1(ϕ_1), e_2(ϕ_2)), then e_0 is clearly an embedding of 𝕋_0 and the equality ∂_ωe_0 = F_0 ∘ e_0 holds. In other words, the product torus 𝕋_0 is an embedded quasi-periodic invariant torus for F_0. If we also define N(ϕ) · u = N(ϕ_1, ϕ_2) · (u_1, u_2) := (N_1(ϕ_1)· u_1, N_2(ϕ_2)· u_2), then clearly N(ϕ) is injective, and therefore Ne_0: (ℝ/2πℤ)^m→ℝ^M ×ℝ^M defined by Ne_0((ϕ_1, ϕ_2), (u_1, u_2)) = (e_0(ϕ_1, ϕ_2), N(ϕ_1, ϕ_2)·(u_1, u_2)) is a fast fibre map for 𝕋_0 that satisfies ∂_ωN + N · L = ( F_0' ∘ e_0)· N. Here L: ℝ^M-m→ℝ^M-m is defined by L(u_1, u_2) := (L_1 u_1, L_2 u_2). This L is hyperbolic, its eigenvalues being those of L_1 and L_2. This proves that 𝕋_0 is reducible and normally hyperbolic and concludes the proof of the lemma. If B defined by Φ(T) = e^BT is not a real matrix, then we may instead define P(t) by the equation Φ(t) = P(t) e^(B+B̅)/2t. Then Φ(T)^2 = Φ(2T) = P(2T)e^(B+B̅)T = P(2T)( e^BT e^B̅ T) = P(2T)(e^BT)^2. It follows that P(2T)= = P(0) because Φ(T)=e^BT. The Ansatz z_j = R_j e^iϕ_j leads to the equations Ṙ_j + i R_j ϕ̇_j = ( μ_jR_j + α_jR_j^3 ) + i (ω_j R_j+β_j R_j^3) + ε∑_k R_k (A_jk e^i(ϕ_k-ϕ_j) + B_jk e^-i(ϕ_k+ ϕ_j)) or equivalently Ṙ_j = μ_jR_j + α_j R_j^3 + ε∑_k R_k Re (A_jk e^i(ϕ_k-ϕ_j) + B_jk e^-i(ϕ_k+ ϕ_j)) ϕ̇_j = ω_j +β_j R_j^2 + ε R_j^-1∑_k R_k Im (A_jk e^i(ϕ_k-ϕ_j) + B_jk e^-i(ϕ_k+ ϕ_j)) These real and imaginary parts in the perturbation part are clearly linear expressions in sine and cosine of ϕ_k±ϕ_j. § APPLICATION TO REMOTE SYNCHRONISATION In this final section we apply and illustrate our phase reduction method in a small network of three weakly linearly coupled Stuart-Landau oscillators [ ż_1 = (α + iβ)z_1 + (γ + iδ)\|z_1\|^2z_1 + ε z_2 ,; ż_2 = (a + ib)z_2 + (c + id)\|z_2\|^2z_2 + ε z_1 ,; ż_3 = (α + iβ)z_3 + (γ + iδ)\|z_3\|^2z_3 +ε z_2 , ] with z_1, z_2, z_3 ∈ℂ. Figure <ref> depicts the coupling architecture of this network. Note that the first and third oscillator in equations (<ref>) are identical. We choose parameters so that each uncoupled oscillator has a nonzero hyperbolic periodic orbit, with frequencies ω_1=ω_3 ≠ω_2. These periodic orbits form a 3-dimensional invariant torus 𝕋_0 for the uncoupled system, which persists as a perturbed torus 𝕋_ε for small nonzero coupling. Despite that fact that the first and third oscillators in (<ref>) are not coupled directly, a numerical study of equations (<ref>) reveals that these oscillators synchronise when appropriate parameter values are chosen, see Figure <ref>. This “remote synchronisation” appears to be mediated by the second oscillator, which allows the two other oscillators to communicate. Figure <ref> demonstrates, again numerically, that the timescale of remote synchronisation is of the order t∼ε^-2. This suggests that proving the synchronisation rigorously would require second-order phase reduction. In <cit.>, remote synchronisation of Stuart-Landau oscillators was observed numerically for the first time. A first rigorous proof of the phenomenon, for a chain of three Stuart-Landau oscillators, occurs in <cit.>. The proof in that paper employs the high-order phase reduction method developed in <cit.>. However, the method in <cit.> does not yield the reduced phase equations in normal form. As a result, the timescale t∼ε^-2 is not observed in <cit.>. Here we apply the parametrisation method developed in this paper, to prove that the first and third oscillator in (<ref>) synchronise over a timescale t∼ε^-2. We are also able to determine how the parameters in (<ref>) influence this synchronisation. To this end, we will compute an asymptotic expansion of an embedding e:(ℝ/2πℤ)^3 →ℂ^3 and a reduced phase vector field f: (ℝ/2πℤ)^3 →ℝ^3 to second order in the small parameter. As we are primarily interested in the synchronisation of the first and third oscillator, we do not calculate the full reduced phase vector field. Instead, we only explicitly compute an evolution equation for the resonant combination angle Φ:=ϕ_1 - ϕ_3. We will show that Φ̇= ε^2 ( -A sinΦ +B (1 - cosΦ ) ) + 𝒪(ε^3) , in which the constants A and B are given by the formulas [ A = 1/4a^2+(ω_1-ω_2)^2( δ/γ(ω_2-ω_1) + a ( 1 + d δ/c γ) + 2a^2 (d/c + δ/γ) 1/ω_2-ω_1) ,; B = 1/4a^2+(ω_1-ω_2)^2( (ω_2-ω_1) + a (d/c - δ/γ) + 2a^2 (1 - d δ/cγ) 1/ω_2-ω_1) . ] Before we prove formulas (<ref>) and (<ref>), let us investigate their dynamical implications. After rescaling time t↦τ := ε^2 t, equation (<ref>) becomes dΦ/dτ = ( -A sinΦ + B(1- cosΦ ) ) + 𝒪(ε) . For ε=0 the time-rescaled reduced flow on (ℝ/2πℤ)^3 therefore admits a 2-dimensional invariant torus S = {ϕ_1=ϕ_3}⊂ (ℝ/2πℤ)^3 on which the phases of the first and third oscillator are synchronised. This torus is stable when A>0 and unstable when A<0. For A≠ 0, there also exists exactly one 2-dimensional invariant torus of the form P = {ϕ_1 = ϕ_3 + c}⊂ (ℝ/2πℤ)^3 c≠ 0 with the opposite stability type. The phases of the first and third oscillator are phase-locked but not synchronised on P. Fénichel's theorem guarantees that both S and P persist as invariant submanifolds of (ℝ/2πℤ)^3 for small ε≠ 0. Hence, so do their images e(S), e(P) ⊂𝕋_ε⊂ℂ^3 as invariant manifolds for (<ref>). For small ε≠ 0, a typical solution of (<ref>) will therefore first converge to the 3-dimensional invariant torus 𝕋_ε on a timescale of the order t ∼ 1. It will subsequently converge to either e(S) or e(P) on the much longer timescale t∼ε^-2, and it is this slow dynamics that governs the synchronisation of the first and third oscillator. This multiple timescale dynamical process is illustrated in Figure <ref>. Figure <ref> confirms numerically that the timescale of synchronisation of z_1 and z_3 is indeed of the order ε^-2. We point out that the parameters in (<ref>) can be tuned so that either of the two low-dimensional tori S or P is the stable one. Assume for instance that α, a >0 and γ, c<0, so that 𝕋_0 (and hence 𝕋_ε) is stable. If in addition we choose the parameters so that c δ + d γ = 0, then the expression for A simplifies to a + (b-β)(δ/γ) + α (δ/γ)^2 /4a^2 + (ω_1-ω_2)^2. If δ≠ 0, then it is clear that we can make this both positive and negative, for instance by varying the parameter b. Interestingly, this shows that properties of the second oscillator may determine whether the first and third oscillator converge to the synchronised state S or the phase-locked state P. §.§.§ Numerics Before proving (<ref>) and (<ref>), we present some numerical results on system (<ref>). Figure <ref> shows numerically obtained plots of Φ̂= (z_1z_3) against time, for two different realisations of system (<ref>). We use Φ̂ as a proxy for Φ = ϕ_1 - ϕ_3. As this approximation does not take into account the distortion of the perturbed invariant torus, we observe small amplitude, rapid oscillations in Φ̂, causing the lines in Figure <ref> to be thick. In Figure <ref>, we have chosen the parameter values [ α = 1 β= 1 γ = -1 δ = 1 ;; a = 1 b= 2 c = -1 d = -1 , ] together with ε = 0.1. It follows that c δ + d γ = 0, and so A = 1/5 >0, see Remark <ref>. The above analysis therefore predicts that Φ̂ should converge to zero, which the figure indeed shows. The convergence is very slow, as only around t= 2000 do we find that Φ̂ is indistinguishably close to zero. We will comment more on the rate of convergence below. Figure <ref> was generated using Euler's method with time steps of 0.05, starting from the point in phase space (z_1, z_2, z_3) = (-1,1+0.4i, -1+0.3i) ∈^3. For Figure <ref> we have likewise set ε = 0.1, but have instead chosen [ α = 1 β= 0.1 γ = -1 δ = 1 ;; a = 1 b= 6 c = -1 d = -1 , ] which yields A = -3.9 /4 + (3.9)^2 = -0.203… < 0. Hence, our theory predicts Φ̂ to converge to a non-zero constant value, which is indeed seen to be the case. Again the thickness of the line is due to rapid oscillations. Figure <ref> is generated in the same way as Figure <ref>, except that the starting point for Euler's method is now (z_1, z_2, z_3) = (1+0.3i,1+0.4i, -0.2+0.9i). Finally, Figure <ref> displays the rate of convergence to synchrony as a function of ε. The figure was made using Euler's method with time-steps of 0.05, all starting from the same point (z_1, z_2, z_3) = (-1+0.3i,1+0.4i, -1+0.5i). We have again chosen the parameters as in (<ref>), so that we may expect Φ̂ to converge to zero. However, the rate at which this occurs depends on ε. We measure this rate by recording T_0.1, which is the smallest time t for which \|Φ̂(t)\| ≤ 0.1 \|Φ̂(0)\|. Figure <ref> shows a log-log plot of T_0.1 against ε. The crosses in the figure represent numerical results for 20 different values of ε. Shown in green is the line with slope -2 through the leftmost cross. We see that ln(T_0.1) = -2ln(ε) + C for some C ∈ to very good approximation. Hence we find T_0.1∼ε^-2, which is fully in agreement with our predictions. §.§.§ Setup: the unperturbed problem We now start our proof of formulas (<ref>) and (<ref>). We first recall some observations from Example <ref>, and make assumptions on the parameters that appear in (<ref>). Specifically, we assume that these parameters are chosen so that αγ < 0, a c <0, βγ - αδ≠ 0, bc - a d ≠ 0 ω_1 = ω_3 ≠ω_2 . Recall from Example <ref> that this ensures that all three uncoupled oscillators possess a unique hyperbolic periodic orbit, with nonzero frequencies ω_1 = ω_3 = β - αδ / γ and ω_2 = b - a d / c ≠ω_1. The product of these periodic orbits forms a 3-dimensional reducible normally hyperbolic (quasi-)periodic invariant torus 𝕋_0 ⊂ℂ^3. An embedding of 𝕋_0 is given by e_0: (ℝ/2πℤ)^3 →ℂ^3 e_0(ϕ_1, ϕ_2, ϕ_3) = (R_1 e^i ϕ_1, R_2 e^i ϕ_2, R_3 e^i ϕ_3) where R_1 = R_3 = √(-α /γ)>0 R_2 = √(-a /c )>0 . This embedding sends integral curves of the constant vector field ω=(ω_1, ω_2, ω_3) on (ℝ/2πℤ)^3 to solutions of (<ref>) (with ε=0) on ℂ^3. It follows from Example <ref> and Lemma <ref> that a Floquet matrix for 𝕋_0 is L = diag(-2 α, -2 a , -2α) , with corresponding fast fibre map given by the family of injective linear maps N: (ℝ/2πℤ)^3 →ℒ(ℝ^3, ℂ^3) defined by N(ϕ_1, ϕ_2, ϕ_3) = diag(e^iϕ_1 (γ + i δ), e^iϕ_2 (c + i d), e^iϕ_3 (γ + i δ)) . The projection onto the tangent bundle along the fast fibre bundle is given by π(ϕ_1, ϕ_2, ϕ_3) = diag(e^iϕ_1π_1(0)e^-iϕ_1, e^iϕ_2π_2(0)e^-iϕ_2, e^iϕ_3π_3(0)e^-iϕ_3) . Here, π_1(0) (x_1+ i y_1 ) = i (y_1 - (δ/γ)x_1) , π_2(0) (x_2+ i y_2 ) = i (y_2 - (d/c)x_2) , and π_3(0)=π_1(0). §.§.§ Discrete symmetry Equations (<ref>) admit a discrete symmetry. This symmetry is the (noninvertible) linear map S: ℂ^3→ℂ^3 defined by S(z_1, z_2, z_3) = (z_1, z_2, z_1) . Indeed, one may check directly that this S sends solutions of (<ref>) to solutions of (<ref>)—irrespective of the value of the small parameter. The following proposition is a direct consequence of this observation: In addition to being in normal form to arbitrarily high-order in their Fourier expansion, the phase reduced vector field f = ( f^(1), f^(2), f^(3)) on (ℝ/2πℤ)^3 can be chosen so that f^(1)(ϕ_1, ϕ_2, ϕ_3) = f^(3)(ϕ_1, ϕ_2, ϕ_1) f^(2)(ϕ_1, ϕ_2, ϕ_3) = f^(2)(ϕ_1, ϕ_2, ϕ_1) to arbitrarily high-order in their Taylor and Fourier expansions. This follows from Theorem <ref>. To be precise, we can define maps s: (ℝ/2πℤ)^3→(ℝ/2πℤ)^3 and t: ℝ^3→ℝ^3 by s(ϕ_1, ϕ_2, ϕ_3) = (ϕ_1, ϕ_2, ϕ_1) and t(u_1, u_2, u_3) = (u_1, u_2, u_1). It can readily be checked that, with these choices, the three conditions of Theorem <ref> are satisfied. Therefore, the phase reduced vector field f can be chosen to simultaneously be in normal form and satisfy s∘ f = f∘ s. It remains to remark that (s ∘ f)(ϕ) = ( f^(1)(ϕ_1, ϕ_2, ϕ_3) , f^(2)(ϕ_1, ϕ_2, ϕ_3), f^(1)(ϕ_1, ϕ_2, ϕ_3)) ( f∘ s)(ϕ) = ( f^(1)(ϕ_1, ϕ_2, ϕ_1) , f^(2)(ϕ_1, ϕ_2, ϕ_1), f^(3)(ϕ_1, ϕ_2, ϕ_1)) . It follows that s∘ f = f∘ s if and only if equations (<ref>) hold. Proposition <ref> implies that it suffices to compute only the third components f_j^(3)(ϕ_1, ϕ_2, ϕ_3) (for j=1,2) of the reduced vector field to obtain the desired equation (<ref>) for d/dt(ϕ_1-ϕ_3). We will exploit this fact below. §.§.§ The first tangential homological equation We now compute f_1 and g_1 from the first tangential homological equation, see (<ref>), with U_1 as given in (<ref>). A short calculation shows that the projection of the inhomogeneous term G_1(ϕ) = F_1(e_0(ϕ)) = (R_2e^iϕ_2, R_1e^iϕ_1, R_2e^iϕ_2) is (π· G_1)(ϕ) = ( [ i R_2e^iϕ_1( sin (ϕ_2-ϕ_1) - (δ/γ) cos (ϕ_2-ϕ_1) ); i R_1e^iϕ_2( sin (ϕ_1-ϕ_2) - (d/c) cos (ϕ_1-ϕ_2) ); i R_2e^iϕ_3( sin (ϕ_2-ϕ_3) - (δ/γ) cos (ϕ_2-ϕ_3) ) ]) . This is clearly in the range of e_0'(ϕ) = diag(iR_1e^iϕ_1, iR_2e^iϕ_2, iR_3e^iϕ_3). Thus the first tangential homological equation becomes ∂_ω g_1(ϕ) + f_1(ϕ) = U_1(ϕ) = ( [ (R_2/R_1) ( sin (ϕ_2-ϕ_1) - (δ/γ) cos (ϕ_2-ϕ_1) ); (R_1/R_2) ( sin (ϕ_1-ϕ_2) - (d/c) cos (ϕ_1-ϕ_2) ); (R_2/R_3) ( sin (ϕ_2-ϕ_3) - (δ/γ) cos (ϕ_2-ϕ_3) ) ]) . Because ω_1≠ω_2 we are able to choose the solutions f_1(ϕ) = (0, 0, 0) and g_1(ϕ) = 1/ω_1-ω_2( [ (R_2 / R_1) ( cos (ϕ_2-ϕ_1) + (δ/γ) sin (ϕ_2-ϕ_1) ); -(R_1 / R_2) ( cos (ϕ_1-ϕ_2) + (d/c) sin (ϕ_1-ϕ_2) ); (R_2 / R_3) ( cos (ϕ_2-ϕ_3) + (δ/γ) sin (ϕ_2-ϕ_3) ) ]) . §.§.§ The first normal homological equation Another short computation allows us to express the projection (1-π)· G_1 as ((1-π)· G_1)(ϕ) = ( [ e^iϕ_1 ( γ+ i δ) (R_2/γ) cos (ϕ_2-ϕ_1); e^iϕ_2 (c+ i d) (R_1/c) cos (ϕ_1-ϕ_2); e^iϕ_3 ( γ+ i δ) (R_2/γ) cos (ϕ_2-ϕ_3) ]) . This is clearly in the range of N(ϕ)= diag(e^iϕ_1(γ+iδ), e^iϕ_2(c+id), e^iϕ_3(γ+iδ)). Thus the first normal homological equation, see (<ref>) and (<ref>), reads ∂_ω h_1(ϕ) + diag(2α, 2a, 2α) h_1(ϕ) = V_1(ϕ) = ( [ (R_2/γ) cos (ϕ_2-ϕ_1); (R_1/c) cos (ϕ_1-ϕ_2); (R_2/γ) cos (ϕ_2-ϕ_3) ]) . The solution reads h_1(ϕ) = ( [ R_2/γ(4α^2 + (ω_1-ω_2)^2)(2αcos(ϕ_2-ϕ_1) + (ω_2-ω_1)sin(ϕ_2-ϕ_1) ); R_1/c(4a^2 + (ω_1-ω_2)^2)(2a cos(ϕ_1-ϕ_2) + (ω_1-ω_2)sin(ϕ_1-ϕ_2) ); R_2/γ(4α^2 + (ω_1-ω_2)^2)(2αcos(ϕ_2-ϕ_3) + (ω_2-ω_1)sin(ϕ_2-ϕ_3) ) ]) . §.§.§ Second order terms Let us clarify that we will not solve the second order homological equations completely. Instead, the only second order terms that we compute explicitly are the first and third components f_2^(1) and f_2^(3) of the second order part f_2 of the reduced phase vector field. As was explained above, this suffices to obtain the desired asymptotic expression for d/dt(ϕ_1 - ϕ_3) = ε^2 ( f_2^(1)(ϕ) - f_2^(3)(ϕ) ) + ε^3 …. We first compute the inhomogeneous term G_2 as given in (<ref>). Because F_2=0 and f_1=0, we see that G_2=1/2( F_0”∘ e_0)(e_1, e_1) + ( F_1' ∘ e_0)· e_1 consists only of two terms. It also turns out that the first of these terms contributes in a rather trivial manner to the phase dynamics at order ε^2. This term can be computed by making use of the expansion \|R_je^iϕ_j+ε e_1^(j)(ϕ)\|^2(R_je^iϕ_j+ε e_1^(j)(ϕ)) = R^3_je^iϕ_j + ε R_j^2 (2 e_1^(j)(ϕ) + e^2iϕ_je_1^(j)(ϕ)) + ε^2 R_j (2 e^iϕ_j \|e_1^(j)(ϕ)\|^2 + e^-iϕ_j(e_1^(j)(ϕ))^2 ) + 𝒪(ε^3) . This leads to the formula 1/2 ( F_0”(e_0(ϕ)) (e_1(ϕ), e_1(ϕ)) = ([ R_1 (γ+iδ) (2 e^iϕ_1 \|e_1^(1)(ϕ)\|^2; R_2 (c+id) (2 e^iϕ_2 \|e_1^(2)(ϕ)\|^2; R_3 (γ+iδ) (2 e^iϕ_3 \|e_1^(3)(ϕ)\|^2 ]) _=: T_1(ϕ) ∈ im N(ϕ) + ( [ R_1 (γ+iδ) e^-iϕ_1 (e_1^(1)(ϕ))^2; R_2 (c+id) e^-iϕ_2 (e_1^(2)(ϕ))^2; R_3 (γ+iδ) e^-iϕ_3 (e_1^(3)(ϕ))^2 ])_=: T_2(ϕ) . It is clear that the first term on the right hand side of (<ref>)—which we called T_1(ϕ)—lies in the range of N(ϕ) because 2 R_j \|e_1^(j)(ϕ)\|^2 ∈ℝ for j=1,2,3. So this first term vanishes when we apply the projection π(ϕ). The projection of the second term on the right hand side of (<ref>)—which we called T_2(ϕ)—can be computed as follows. Recall from (<ref>) that e_1(ϕ) = e_0'(ϕ)· g_1(ϕ) + N(ϕ)· h_1(ϕ), where e_0, g_1, N and h_1 are given in the formulas above. This can be used to expand, first the (e_1^(j)(ϕ))^2, and then T_2(ϕ) in trigonometric polynomials. It is not very hard to see that this must yield a formula of the form π(ϕ)T_2(ϕ) = ( [ R_1 i e^iϕ_1( C+ D sin(2ϕ_2-2ϕ_1) + E cos(2ϕ_2-2ϕ_1) ); R_2 i e^iϕ_2( C̃+ D̃sin(2ϕ_2-2ϕ_1) + Ẽcos(2ϕ_2-2ϕ_1) ); R_3 i e^iϕ_3( C + D sin(2ϕ_2-2ϕ_3) + E cos(2ϕ_2-2ϕ_3) ) ]) for certain real numbers C, D, E, C̃, D̃, Ẽ that we shall not explicitly compute here. Note that this clearly lies in the range of e_0'(ϕ). It follows that U_2^1 st(ϕ) = ( [ C + D sin(2ϕ_2-2ϕ_1) + E cos(2ϕ_2-2ϕ_1); C̃+ D̃sin(2ϕ_2-2ϕ_1) + Ẽcos(2ϕ_2-2ϕ_1); C + D sin(2ϕ_2-2ϕ_3) + E cos(2ϕ_2-2ϕ_3) ]) is the first part of the inhomogeneous right hand side of the second tangential homogeneous equation ∂_ω g_2+ f_2 = U_2. Because 2ω_1≠ 2ω_2, only the constant part (C, C̃, C) of this U_2^1 st(ϕ) is resonant; all other terms can be absorbed in g_2. Thus the resonant normal form of this part of f_2 is (C, C̃, C)^T. As this constant vector field does not contribute to d/dt( ϕ_1 - ϕ_3 ), we compute neither C nor C̃ explicitly. We proceed by considering the other term in G_2, namely ( F'_1 ∘ e_0)· e_1. Recalling that F_1(z)=(z_2, z_1, z_2), we see that this term equals F_1'(e_0(ϕ))· e_1(ϕ) = ( [ e_1^(2)(ϕ); e_1^(1)(ϕ); e_1^(2)(ϕ) ]) = ( [ e^iϕ_2 (iR_2 g_1^(2)(ϕ) + (c + i d) h_1^(2)(ϕ) ); e^iϕ_1 (iR_1 g_1^(1)(ϕ) + (γ + i δ) h_1^(1)(ϕ) ); e^iϕ_2 (iR_2 g_1^(2)(ϕ) + (c + i d) h_1^(2)(ϕ) ) ]) . Using the expressions for π(ϕ), g_1(ϕ) and h_1(ϕ) provided above, one can compute that the projection of this term has the form π(ϕ)· F_1'(e_0(ϕ))· e_1(ϕ) = ( [ i R_1 e^iϕ_1 0 0; 0 i R_2 e^iϕ_2 0; 0 0 i R_3 e^iϕ_3 ]) · U_2^2 nd(ϕ) , in which now U_2^2 nd(ϕ) = ( [ B + Fsin( 2 ϕ_1 -2ϕ_2) + G cos ( 2 ϕ_1 -2ϕ_2); B̃ + F̃sin( 2 ϕ_1 -2ϕ_2) + G̃cos ( 2 ϕ_1 -2ϕ_2); {[ A sin(ϕ_1-ϕ_3) + Bcos(ϕ_1-ϕ_3); + Fsin( ϕ_1+ϕ_3-2ϕ_2) + G cos ( ϕ_1+ϕ_3-2ϕ_2) ]} ]) . With some effort the constants A and B can be computed by hand, yielding [ A = 1/4a^2+(ω_1-ω_2)^2( δ/γ(ω_2-ω_1) + a ( 1 + d δ/c γ) + 2a^2 (d/c + δ/γ) 1/ω_2-ω_1) ,; B = 1/4a^2+(ω_1-ω_2)^2( (ω_2-ω_1) + a (d/c - δ/γ) + 2a^2 (1 - d δ/cγ) 1/ω_2-ω_1) . ] We did not compute any of the other constants. As ω_1=ω_3 ≠ω_2, the resonant part of U_2^2 nd(ϕ) is given by f_2(ϕ) = (B, B̃, Asin(ϕ_1-ϕ_3) + Bcos(ϕ_1-ϕ_3))^T. The other terms in U_2^2 nd(ϕ) can be absorbed into g_2 when solving the tangential homological equation ∂_ω g_2+ f_2 = U_2. §.§.§ Conclusion To summarise, we computed that f_1(ϕ) = (0, 0,0)^T and f_2(ϕ) = ( [ B+C; B̃ +C̃; A sin (ϕ_1-ϕ_3) + B cos (ϕ_1-ϕ_3) + C ]) . The constants A and B are given in (<ref>), but we did not compute B̃, C or C̃. Because ω_1=ω_3 and ϕ̇= ω + ε f_1(ϕ) + ε^2 f_2(ϕ) + 𝒪(ε^3), we conclude that d/dt (ϕ_1 - ϕ_3) = ε^2 ( -A sin (ϕ_1-ϕ_3) - B cos (ϕ_1-ϕ_3) + B ) + 𝒪(ε^3) . This is exactly equation (<ref>). § ACKNOWLEDGEMENTS We would like to thank Edmilson Roque and Deniz Eroglu for useful tips regarding numerics. S.v.d.G. was partially funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation)––453112019. E.N. was partially supported by the Serrapilheira Institute (Grant No. Serra-1709-16124). B.R. acknowledges funding and hospitality of the Sydney Mathematical Research Institute. amsplain § DISCRETE SYMMETRY In this section we describe how symmetry in the original system ẋ = F(x) is inherited by its phase reduction ϕ̇= f(ϕ). The main result is Theorem <ref>, the proof of which is surprisingly intricate. In this section, a symmetry will be any linear map that sends solutions of one dynamical system to solutions of another one. Thus, what we consider symmetries may form a more general structure than a group. The reason is that in <cit.> we show that many structural properties of network dynamical systems (including coupled oscillator systems) can be defined in terms of such generalised symmetries. These properties include not only classical (permutation) symmetry, but also the presence of sub-networks, quotient-networks, indirect node-dependency, feed-forward structure, hidden symmetry and interior symmetry. More specifically, in this section we consider two ODEs [ ẋ = F^L(x) = F_0^L(x) + ε F_1^L(x) + … ℝ^M_L; ẏ = F^R(y) = F_0^R(y) + ε F_1^R(y) + … ℝ^M_R , ] defined by vector fields F^L: ℝ^M_L→ℝ^M_L and F^R:ℝ^M_R→ℝ^M_R. We assume that there is a linear map S: ℝ^M_L→ℝ^M_R sending solutions curves of F^L to solution curves of F^R, that is, F^R(S· x) = S · F^L(x) . The superscripts “L” and “R” stand for “left” and “right”. Note that we did not assume that F^L and F^R are equal, nor that the linear map S is invertible. We thus use a rather broad definition of symmetry. Moreover, in what follows we consider only one linear map S. The following theorem is the main result of this section. Its formulation is somewhat technical, but the conclusion of the theorem is natural. Consider a pair of vector fields F^L: ℝ^M_L→ℝ^M_L and F^R: ℝ^M_R→ℝ^M_R, with asymptotic expansions as in (<ref>), and satisfying the conjugacy relation (<ref>) for some linear map S: ℝ^M_L→ℝ^M_R. We make the following assumptions on the unperturbed vector fields F_0^L and F_0^R: i)F_0^L and F_0^R both possess an embedded reducible normally hyperbolic (quasi-periodic) invariant torus. In other words, there are embeddings e_0^L: (ℝ/2πℤ)^m_L→ℝ^M_L and e_0^R: (ℝ/2πℤ)^m_R→ℝ^M_R and frequency vectors ω^L∈ℝ^m_L and ω^R∈ℝ^m_R satisfying ∂_ω^Le_0^L = F_0^L∘ e_0^L ∂_ω^Re_0^R = F_0^R∘ e_0^R ; The tori moreover admit fast fibre maps Ne_0^L and Ne_0^R defined by families of injective matrices N^L = N^L(ϕ^L) and N^R = N^R(ϕ^R) and hyperbolic Floquet matrices L^L and L^R satisfying (<ref>). ii) There is a linear map s: (ℝ/2πℤ)^m_L→ (ℝ/2πℤ)^m_R such that S ∘ e_0^L = e_0^R ∘ s . iii) There is a linear map t: ℝ^M_L - m_L→ℝ^M_R - m_R such that S · N^L(ϕ^L) = (N^R∘ s)(ϕ^L)· t ϕ^L∈ (ℝ/2πℤ)^m_L . Then, for every j∈ℕ and every K∈ℕ, the solution (e^L_j, f_j^L) to the iterative equation 𝔠^L(e^L_j, f_j^L) = G_j^L, and the solution (e^R_j, f_j^R) to the iterative equation 𝔠^R(e^R_j, f_j^R) = G_j^R, can be chosen in such a way that i) They satisfy the equivariance relations S ∘ e^L_j = e^R_j ∘ s f^R_j ∘ s = s ∘ f^L_j . ii) Both f_j^L and f_j^R are in normal form to order K in their Fourier expansion. We also assume that for ε=0 both systems admit an invariant torus, embedded as Γ^L: 𝕋^M→ℝ^m Γ^R: 𝕋^N→ℝ^n . Finally, we assume that the symmetry of the unperturbed systems descends to a symmetry of phase reductions, i.e., there is a linear map s: 𝕋^M →𝕋^N such that s(ω^L) = ω^R . Under these assumptions, the compositions Γ^R∘ s and S∘Γ^L: 𝕋^M →ℝ^n both conjugate the constant vector field ω^L on 𝕋^M to Ω^R. D(Γ^R ∘ s)(ϕ^L)·ω^L = DΓ^R(s(ϕ^L)) s·ω^L = DΓ^R(s(ϕ^L))·ω^R = Ω^R(Γ^R(s(ϕ^L)) D(S∘Γ^L)(ϕ^L) ·ω^L = Note that also S∘Γ^L does this. We assume that Γ^R ∘ s = S ∘Γ^L . (this does not follow, because the embeddings are not unique). Differentiation of Ω^R∘ S = S ·Ω^L gives DΩ^R ∘ S = S · DΩ^L Now consider the maps Ts = (s,s) TS=(S,S) TS∘Γ^L: (ϕ^L, w^L)↦ (S (Γ^L(ϕ^L)), S N_0^L(ϕ^L) w^L) Γ^R ∘ Ts : (ϕ^L, w^L)↦ ( Γ^R (s ϕ^L), N_0^R s w^L) The map s can be thought of as the reduction to phase coordinates of the symmetry S of the original systems F^L and F^R. We assume that s is given by a linear map from ℝ^m_L to ℝ^m_R with integer coefficients, so that it descends to a quotient map from (ℝ/2πℤ)^m_L to (ℝ/2πℤ)^m_R. We denote this quotient map by s as well. Similarly, the map t is the reduction of S to the local coordinates for fast fibre bundle. The main part of the proof of Theorem <ref> consists of showing that the solutions to the homological equations (<ref>) can be chosen in an equivariant manner—see Lemmas <ref> and <ref>. For the proof of these lemmas and the theorem we need the following technical observations. From the assumptions of Theorem <ref> it follows that i)s(ω^L) = ω^R; ii)t · L^L = L^R · t; iii)(π^R ∘ s) · S = S·π^L. i) We differentiate (e_0^R ∘ s)(ϕ^L) = (S ∘ e_0^L)(ϕ^L) in the direction ω^L. Writing ϕ^R = s(ϕ^L), this yields (e_0^R)'(ϕ^R ) · s(ω^L) = S· (e_0^L)'(ϕ^L) ·ω^L = S· F^L_0(e_0^L(ϕ^L)) = F_0^R (S( e_0^L (ϕ^L))) = F_0^R ( e_0^R (ϕ^R)) . So e_0^R conjugates s(ω^L) to F_0^R. But e_0^R also conjugates ω^R to F_0^R, and as (e_0^R)' is injective, this implies that s(ω^L)=ω^R. ii) Differentiation of S· N^L(ϕ^L) = (N^R ∘ s)(ϕ^L)· t in the direction of ω^L gives S·∂_ω^LN^L(ϕ^L) = (N^R)'(ϕ^R) · s(ω^L) · t = ∂_ω^RN^R(ϕ^R) · t . As a result, using Equation (<ref>), for both N=N^L and N=N^R, we find N^R(ϕ^R) · t · L^L = S· N^L(ϕ^L) · L^L = S · ( F_0^L)'(e_0^L(ϕ^L)) · N^L(ϕ^L) - S·∂_ω^L N^L(ϕ^L) = ( F_0^R)'(e_0^R(ϕ^R))· S · N^L(ϕ^L) - ∂_ω^RN^R(ϕ^R) · t = ( F_0^R)'(e_0^R(ϕ^R))· N^R(ϕ^R) · t - ∂_ω^RN^R(ϕ^R) · t = N^R(ϕ^R)· L^R· t . The injectivity of N^R(ϕ^R) thus implies that t· L^L = L^R · t . iii) The definitions of π^L,R(ϕ^L,R) and the identity S· N^L(ϕ^L) = N^R(ϕ^R)· t imply (π^R(ϕ^R)· S) · N^L(ϕ^L) = π^R(ϕ^R)· N^R(ϕ^R) · t = 0 = (S·π^L(ϕ^L))· N^L(ϕ^L) , while the identity S· (e_0^L)'(ϕ^L) = (e_0^R)'(ϕ^R)· s implies that (π^R(ϕ^R) · S) · (e_0^L)'(ϕ^L) = π^R(ϕ^R) · (e_0^R)'(ϕ^R)· s = (e_0^R)'(ϕ^R) · s = S· (e_0^L)'(ϕ^L) = (S ·π^L(ϕ^L) ) · (e_0^L)'(ϕ_L) . N^L(ϕ^L) and (e_0^L)'(ϕ^L) together span ℝ^M_L, so it follows that π^R(ϕ^R)· S = S ·π^L(ϕ^L). Points i) and ii) of Lemma <ref> together imply that the map (ϕ^L, u^L) ↦ (ϕ^R, u^R):= (s(ϕ^L), t(u^L)) sends solution curves of ϕ̇^L = ω^L , u̇^L = L^L· u^L to solution curves of ϕ̇^R = ω^R , u̇^R = L^R · u^R. The first observation is simply the following Assume that e conjugates f^(1) to F^(1) so that De · f^(1) = F^(1)∘ e . Then S ∘ e conjugates f^(1) to F^(2), that is D (S ∘ e) · f^(1) = F^(2)∘ (S ∘ e) . The proof is obvious. Note though that the composition (S× S) ∘ K_1 may not be an embedding, and also the dimension of its domain of definition 𝕋^n be equal to that of the invariant torus 𝕋^m. More precisely, let us phrase the problem of finding an embedded invariant torus as the functional equation ℱ(K, F): 𝕋^n →ℝ^n×ℝ^n . We here have two such conjugacy equations namely ℱ_1(K_1, F_1) = 0 ℱ_2(K_2, F_2) = 0 . The following proposition relates these: Assume that S ∘ F_1 = F_2 ∘ S , e_2 ∘ s = S ∘ e_1 f_2 ∘ s = s ∘ f_1 . Then ℱ_2(e_2, f_2) ∘ s = S ∘ℱ_1(e_1, f_1) . The chain rule gives that DK_2(SΦ)· S = (S× S)∘ DK_1(Φ). Therefore, ℱ_2(K_2, F_2) (SΦ) = DK_2 (SΦ)· F_2(SΦ) - G_2(K_2(SΦ)) = DK_2 (SΦ)· S· F_1(Φ) - G_2((S× S)(K_1(Φ))) = (S× S)· DK_1(Φ)· F_1(Φ) - (S× S)∘ G_1(K_1(Φ)) = (S× S)( ℱ_1(K_1, F_1)(Φ)) . So for S-equivariant pairs of embeddings K_1, K_2 and equivariant pairs of vector fields F_1, F_2 and G_1, G_2 it holds that if ℱ_1(K_1, F_1)=0 then also ℱ_2(K_2, F_2)=0 on the range of S. It turns out that the solutions of the homological equations can be chosen in an equivariant way. We first prove this for the solutions of the normal homological equations. Under the conditions of Theorem <ref>, assume that the inhomogeneous right hand sides V^L,R: (ℝ/2πℤ)^m_L,R→ℝ^M_L,R-m_L,R satisfy t ∘ V^L = V^R ∘ s . Then the (unique) solutions to the normal homological equations (∂_ω^L - L^L)( h^L) = V^L (∂_ω^R - L^R)( h^R) = V^R also satisfy t ∘ h^L = h^R ∘ s . The normal homological equations for h^L and h^R, together with the assumption that t ∘ V^L = V^R ∘ s, imply that t ∘ (∂_ω^L h^L) - t ∘ (L^L· h^L) = (∂_ω^R h^R)∘ s - (L^R· h^R) ∘ s . Using Proposition <ref>, we rewrite the terms in this identity as follows: t∘ (∂_ω^L h^L) = ∂_ω^L (t∘ h^L) , t ∘ ( L^L· h^L) = L^R(t∘ h^L) , ∂_ω^R h^R ∘ s = (( h^R)' ∘ s)·ω^R = ( h^R)' ∘ s)· s·ω^L = ( h^R∘ s)'·ω^L =∂_ω^L( h^R∘ s) , (L^R· h^R) ∘ s = L^R( h^R ∘ s) . Together this shows that (∂_ω^L - L^R)(t∘ h^L- h^R∘ s)=0 . In turn this implies that t∘ h^L- h^R∘ s = 0 because the operator ∂_ω^L - L^R is injective. Indeed, it maps a vector-valued function A_ke^i⟨ k, ϕ⟩ (with A_k ∈ℂ^M_R-m_R and k∈ℤ^m_L) to (i⟨ω^L, k⟩ - L^R)A_ke^i⟨ k, ϕ⟩. The matrix i⟨ω^L, k⟩ - L^R is invertible because L^R is hyperbolic. The result on the tangential homological equation is a bit more subtle: Under the conditions of Theorem <ref>, assume that the inhomogeneous right hand sides U^L,R :(ℝ/2πℤ)^m_L,R→ℝ^m_L,R satisfy s ∘ U^L = U^R ∘ s . Then, for any K∈ℕ, the solutions to the tangential homological equations ∂_ω^L g^L + f^L = U^L ∂_ω^R g^R + f^R = U^R can be chosen in such a way that f^L and f^R are both in normal form to order K in their Fourier expansions, while at the same time s ∘ f^L - f^R ∘ s s ∘ g^L - g^R ∘ s are arbitrarily small. Note that if we choose f^L=U^L, f^R=U^R, g^L=0 and g^R=0, then the equivariance relations s ∘ f^L = f^R ∘ s and s ∘ g^L = g^R ∘ s are satisfied. However, the choices g^L=0 and g^R=0 are not the ones that yield f^L and f^R in normal form. We recall from the proof of Corollary <ref> that these choices were given by [ g_k^L,R = U_j,k^L,R/i ⟨ω_L,R, k⟩ ⟨ω_L,R, k⟩≠ 0 \|k\|≤ K,; g_k^L,R = 0 ⟨ω_L,R, k⟩ = 0 \|k\|> K. ] and [ f_k^L,R=0 ⟨ω_L,R, k⟩≠ 0 \|k\|≤ K,; f_k^L,R=U_j,k^L,R ⟨ω_L,R, k⟩ = 0 \|k\|> K. ] Recall that these choices yield exact solutions to the “left” and “right” tangential homological equations. Also, remark that g^L = ∂_ω_L Z^L g^R = ∂_ω_R Z^R for certain functions Z^L,R defined by Z^L,R_k = U^L,R_k/(i⟨ω_L,R, k⟩)^2 for all k with ⟨ω_L,R, k⟩≠ 0. That is, g^L,R is in the image of the operator ∂_ω^L,R. From this it follows that s ∘ g^L - g^R ∘ s = s ∘∂_ω_LZ^L - ∂_ω_RZ^R ∘ s = ∂_ω_L(s ∘ Z^L - Z^R ∘ s ) . This shows that s ∘ g^L - g^R ∘ s ∈ im ∂_ω_L . In fact, s ∘ g^L - g^R ∘ s is a function with a finite Fourier expansion, because g^L and g^R have a finite Fourier expansion too, so let us write s ∘ g^L - g^R ∘ s = ∑_k ≤ L i⟨ω, k ⟩ A_k e^i⟨ω_L, k⟩ . We estimate the size of the coefficients in this expansion by acting on this equality with the operator ∂_ω_L. This gives, using that U^R∘ s = s ∘ U^L, ∂_ω_L ( s ∘ g^L - g^R ∘ s ) = s ∘∂_ω_L g^L - ∂_ω_R g^R ∘ s = - s∘ f^L + f^R∘ s so that applying ∂_ω_L once more we get ∂_ω_L^2 ( s ∘ g^L - g^R ∘ s ) = - s∘∂_ω_L f^L + (∂_ω_R f^R)∘ s But ∂_ω_L f^L and ∂_ω_R f^R only have Fourier terms for \|k\| > K. Hence, so does the function s∘∂_ω_L f^L. The same does not apply though to the other term, (∂_ω_R f^R)∘ s, it being given by ∑_\|k\|>K i⟨ω_R,k⟩ U_k^R e^i⟨ k, s(ϕ)⟩ = ∑_\|k\|>K i⟨ω_R,k⟩ U_k^R e^i⟨ s^T k, ϕ⟩ and \|s^Tk\| can be small even if \|k\| is large. However, if K is large and U^L and U^R are sufficiently smooth, then the Fourier expansion has a (very) small norm and therefore we obtain Using these homological equations and the assumption that the inhomogeneous right hand sides satisfy s∘ U^L = U^R ∘ s, we find that s∘ f^L - f^R∘ s = - s∘∂_ω_L g^L + ∂_ω_R g^R ∘ s Now note that ∂_ω_L ( g^R∘ s) = (∂_ω_R g^R ) ∘ s because s(ω_L)=ω_R. So we can rewrite this as s∘ f^L - f^R∘ s = ∂_ω_L ( g^R∘ s - s∘ g^L ) . This proves that f^L and f^R form an equivariant pair up to an error of the size of g^R∘ s - s∘ g^L. The latter quantity is not necessarily zero, but we claim that it can be made arbitrarily small. ∂_ω_L g^L(ϕ) = (U^L)^K_ im(ϕ) and similarly for g^R (the superscript K meaning the truncation at order K). Or equivalently, ∂_ω_L^2 g^L = ∂_ω_L(U^L)^K or equivalently, ∂_ω_L( ∂_ω_L g^L - (U^L)^K ) = ∂_ω_L( ∂_ω_L g^L - U^L + U^L - (U^L)^K ) = 0 so ∂_ω_L( U^L - (U^L)^K - ∂_ω_L f^L ) = 0 It holds (U^R)^K ∘ s = ∑_\|k\|≤ K U^R_k e^i⟨ k, s(ϕ)⟩ = ∑_\|k\|≤ K U^R_k e^i⟨ s^T k, ϕ⟩ s ∘ (U^L)^K = ∑_\|k\|≤ K s(U^L_k) e^i⟨ k, ϕ⟩ To show that the choices, we start by remarking that U^L and U^R can be written as U^L = U^L_ ker + U^L_ im U^R = U^R_ ker + U^R_ im where U^L,R_ ker∈ ker ∂_ω^L,R U^L,R_ im∈ im ∂_ω^L,R . Indeed, U^L,R_ ker is a sum of Fourier terms of the form U^L,R_k e^i⟨ k, ϕ⟩ with ⟨ω^L,R, k⟩ =0 and U^L,R_ im is a sum of Fourier terms of the form U^L,R_k e^i⟨ k, ϕ⟩ with ⟨ω^L,R, k⟩≠ 0. We now define f^L and f^R by f^L := U^L_ ker f^R := U^R_ ker . This obviously ensures that ∂_ω^L f^L = 0 ∂_ω^R f^R = 0 . At the same time we choose g^L = ∂_ω^L Z^L g^R= ∂_ω^R Z^R to be the unique elements of im ∂_ω^L respectively im ∂_ω^R for which ∂_ω^L g^L = U^L_ im ∂_ω^R g^R = U^R_ im . We claim that with these choices we have s ∘ f^L = f^R∘ s and s ∘ g^L = g^R∘ s. To prove this claim, note that for a general pair of functions H^L,R:𝕋^m_L, m_R→ℝ^m_L, m_R (not necessarily satisfying s ∘ H^L = H^R∘ s) we have the formula ∂_ω^L( s ∘ H^L - H^R ∘ s ) = s·∂_ω^L H^L - ∂_ω^RH^R ∘ s . This follows from the chain rule and the fact that s(ω^L)=ω^R. We apply formula (<ref>) several times below. To start, from formula (<ref>) we see immediately that s ∘ U^L_ im - U^R_ im∘ s = s ∘∂_ω^L g^L - ∂_ω^R g^R ∘ s = ∂_ω^L( s∘ g^L - g^R ∘ s) . This proves that s ∘ U^L_ im - U^R_ im∘ s ∈ im ∂_ω^L . Next, we apply formula (<ref>) twice, first to (H^L, H^R) = (U^L_ im, U^R_ im) and then to (H^L, H^R) = (U^L, U^R). Using that ∂_ω^LU^L_ im = ∂_ω^LU^L and ∂_ω^RU^R_ im = ∂_ω^RU^R, this yields that ∂_ω^L(s ∘ U^L_ im - U^R_ im∘ s ) = ∂_ω^L(s ∘ U^L- U^R ∘ s ) = 0 , and hence that s ∘ U^L_ im - U^R_ im∘ s ∈ ∂_ω^L . Because ker ∂_ω^L and im ∂_ω^L intersect trivially, we have now proved that s ∘ U^L_ im - U^R_ im∘ s = 0 s ∘ U^L_ ker - U^R_ ker∘ s = 0 . In particular, as we defined f^L = U^L_ ker and f^R = U^R_ ker, we have that s ∘ f^L = f^R∘ s . It remains to show that s ∘ g^L = g^R∘ s. The argument is similar. Specifically, formula (<ref>) applied to (H^L, H^R)=( g^L, g^R) shows that ∂_ω^L ( s∘ g^L - g^R∘ s) = s∘ U^L_ im - U^R_ im∘ s = 0 so that s∘ g^L - g^R∘ s ∈ ∂_ω^L . On the other hand, applied to (H^L, H^R)=(Z^L,Z^R), the formula gives s∘ g^L - g^R∘ s = ∂_ω^L (s∘ Z^L - Z^R ∘ s ) ∈ im ∂_ω^L . We conclude that s∘ g^L - g^R∘ s=0, which completes the proof. We are now ready for the proof of Theorem <ref>. [of Theorem <ref>] The proof is by induction on the order of the expansion in the small parameter. Note that we have S∘ e_0^L = e_0^R∘ s and s∘ω^L = ω^R ∘ s (=ω^R) by assumption—and by point i) of Lemma <ref>. This proves the theorem for the unperturbed embeddings e_0^L,R and reduced vector fields f_0^L,R:=ω^L,R. Assume now that e_1^R∘ s = S ∘ e_1^L, …, e_j-1^R∘ s = S ∘ e_j-1^L and f_1^R ∘ s = s ∘ f_1^L, …, f_j-1^R ∘ s = s ∘ f_j-1^L and that f_1^L,R, …, f^L,R_j-1 are all in normal form to order K in their Fourier expansion. From formula (<ref>) (with “R” and “L” inserted at appropriate places) it then follows that G_j^R ∘ s = S ∘ G_j^L , and by point iii) of Lemma <ref> it is then also clear that (π^R · G_j^R) ∘ s = S ∘ (π^L · G_j^L) . Now recall from formula (<ref>) that U_j^L and U_j^R are implicitly defined by (e_0^L,R)'· U^L,R_j = π^L,R· G_j^L,R . Writing ϕ^R=s(ϕ^L) for clarity, it follows that (e_0^R)'(ϕ^R) · ( s ∘ U^L_j)(ϕ^L) = S· (e_0^L)'(ϕ^L)· U^L_j(ϕ^L) = S· (π^L· G_j^L)(ϕ^L) = (π^R · G_j^R)(ϕ^R) = (e_0^R)'(ϕ^R)· U_j^R(ϕ^R) . By injectivity of (e_0^R)'(ϕ^R) we conclude that s ∘ U_j^L = U_j^R ∘ s . The argument for V^L_j and V^R_j is analogous: using their implicit definition in (<ref>) we obtain N^R(ϕ^R) · (t ∘ V^L_j)(ϕ^L) = S· N^L(ϕ^L)· V^L_j(ϕ^L) = S· ( (1-π^L) · G_j^L)(ϕ^L) = ((1- π^R) · G_j^R)(ϕ^R) = N^R(ϕ^R)· V_j^R (ϕ^R) . By injectivity of N^R(ϕ^R) we thus have t ∘ V_j^L = V_j^R ∘ s . Proposition <ref> thus guarantees that h_j^R∘ s = t∘ h_j^L, while Proposition <ref> shows that it can be arranged that s ∘ g_j^L = g_j^R∘ s, that s ∘ f_j^L = f_j^R∘ s, and ∂_ω^L f^L,R_j = 0 to order K in their Fourier expansion. Recalling that e_j^L/R = (e_0^L/R)'· g_j^L/R + N^L/R· h_j^L/R , it follows immediately that with these choices, e^R_j∘ s = S ∘ e_j^L . This finishes the induction step and proves the theorem. § REDUCIBILITY FOR RELATIVE EQUILIBRIA In this section we discuss another setting in which it turns out that normally hyperbolic invariant tori are always reducible. This happens when the torus is a relative equilibrium of a 𝕋^N-equivariant ODE. To the best of our knowledge, this result is new, although not very difficult. To explain the result in detail, we assume that 𝕋^N acts freely on ℝ^n by means of a matrix representation 𝕋^N ∋ϕ↦ g(ϕ) ∈ GL(ℝ^n) . This means that g(0)= Id_ℝ^n and g(ϕ+ψ) = g(ϕ)g(ψ) = g(ψ)g(ϕ). We now consider a 𝕋^N-equivariant differential equation ẋ = Ω(x) on ℝ^n. Specifically, we assume that Ω satisfies Ω(g(ϕ) x) = g(ϕ)·Ω(x) ϕ∈𝕋^N x∈ℝ^n . We shall also assume that Ω possesses a relative equilibrium: a group orbit that is invariant under the flow of Ω. This means that there is an x_0∈ℝ^n with the property that Ω(x_0)∈ T_x_0 (𝕋^N· x_0). In turn this implies that Ω(x_0)= . d/dt\|_t=0 g(tω) · x_0 = ∂_ω g(0) · x_0 ω∈ℝ^N. Such a relative equilibrium is an Ω-invariant (quasi-)periodic torus. We start by remarking that differentiation to t at t=0 of the matrix identity g(ϕ + ω t) = g(ϕ)g(ω t) = g(ω t) g(ϕ) gives that ∂_ωg(ϕ) = g(ϕ) ∂_ωg(0) = ∂_ωg(0)g(ϕ) . Next, define the curve x(t) := g(ϕ_0+ ω t)· x_0 passing through an arbitrary point g(ϕ_0) · x_0 on the group orbit of x_0. We find that ẋ(t) = ∂_ω g(ϕ_0+ ω t) x_0 = g(ϕ_0+ ω t)∂_ω g(0) x_0 = g(ϕ_0+ω t) Ω(x_0) = Ω( g( ϕ_0+ω t) x_0) = Ω(x(t)) . This shows that the map Γ: ϕ↦ g(ϕ)x_0 from 𝕋^N to ℝ^n, which is surjective onto the group orbit of x_0, sends solutions of ϕ̇= ω on the torus 𝕋^N to integral curves of Ω. So the group orbit is invariant under the flow of Ω and every integral curve on the group orbit is (quasi-)periodic. The ϕ- and t-independent quantity ∂_ωg(0) x_0 = g(ϕ)^-1∂_ωg(ϕ) x_0 = ∂_ωg(ϕ) g(ϕ)^-1x_0 ∈ℝ^n = T_x_0 (𝕋^N· x_0) can be interpreted as the velocity of any curve x(t) = g(ϕ+ω t)x_0 on the relative equilibrium in co-moving coordinates. The following can be thought of as a Floquet theorem for relative equilibria: The map (ϕ, u) ↦ (x, v):= (g(ϕ) x_0, g(ϕ) u) sends solutions of the constant coefficient skew product differential equation ϕ̇= ω , u̇ = (DΩ(x_0) - ∂_ωg(0))· u on 𝕋^N×ℝ^n to solutions of the variational equations of Ω on ℝ^n×ℝ^n given by ẋ = Ω(x) , v̇= DΩ(x) · v . Assume that ϕ̇(t) = ω and u̇(t) = (DΩ(x_0) - ∂_ωg(0) )u(t). We already checked in Lemma <ref> that x(t):=g(ϕ(t)) x_0 satisfies ẋ(t) = Ω(x(t)). Next, note that differentiation of Ω(g(ϕ)x) = g(ϕ)Ω(x) to x at x=x_0 gives DΩ(g(ϕ) x_0) g(ϕ) = g (ϕ) DΩ(x_0). This implies that v(t):=g(ϕ(t)) u(t) satisfies v̇(t) = ∂_ωg(ϕ(t)) u(t) + g(ϕ(t)) u̇(t) = ∂_ωg(ϕ(t)) u(t) + g(ϕ(t)) ( DΩ(x_0) - ∂_ωg(0) ) u(t) = DΩ(x(t)) g(ϕ(t)) u(t) = DΩ(x(t)) v(t) . This proves the lemma. As a result of Lemma <ref> we find that every relative equilibrium is reducible: Any normally hyperbolic such relative equilibrium is reducible. Let u = . d/dε\|_ε=0 g(ε h)x_0 = (Dg(0)· h)x_0 be an arbitrary tangent vector to the group orbit of x_0. Differentiation to ε at ε= 0 of the identity ∂_ωg(0) g(ε h) x_0 = . d/dt\|_t=0 g(tω) g(ε h) x_0 = . d/dt\|_t=0 g(ε h+ tω) x_0 = Ω(g(ε h) x_0) shows that ∂_ωg(0) u = DΩ(x_0) u . This proves that the tangent space to the group orbit at x_0 lies in the kernel of DΩ(x_0)-∂_ωg(0). Our assumption that the group orbit is normally hyperbolic means that this tangent space can be complemented by another subspace that is invariant under DΩ(x_0) - ∂_ωg(0) and restricted to which this map has no eigenvalues on the imaginary axis. Just like in the proof for periodic orbits, this implies reducibility: one may choose a map A:ℝ^n-N→ℝ^n whose image is the sum of the hyperbolic eigenspaces of DΩ(x_0)-∂_ωg(0). Then NΓ: 𝕋^N×ℝ^n-N→ℝ^n×ℝ^n NΓ(ϕ, u):=(g(ϕ)· x_0, g(ϕ)· A · u) satisfies the requirements. The assumption that 𝕋^N acts freely on ℝ^n implies that Γ and NΓ are embeddings. In particular, the hyperbolic eigenspace of DΩ(x_0)-∂_ωg(0) then extends to a unique embedding of the fast fibre bundle. Corollary <ref> nevertheless can also be very useful if 𝕋^N does not act freely. The observations in this section provide an alternative way to compute the parametrised normal dynamics of the Stuart-Landau oscillator that we studied before in Example <ref>. Now we will not use the Floquet decomposition of the variational flow but the presence of a continuous symmetry. We recall that the equations of motion are ż = Ω(z) = (α + i β) z + (γ + i δ) \|z\|^2 z z ∈ℂ . The right hand side of this differential equation satisfies Ω(e^iϕ z) = e^iϕΩ(z) and the system therefore possesses a 𝕋^1-symmetry given by g(ϕ) z = e^iϕz. The system has a unique nontrivial relative equilibrium, which is the group orbit of the point x_0=√(-α/γ)∈ℝ on the positive real axis. We have Ω(x_0) = i ω x_0 = .d/dt\|_t=0 e^iω t x_0 . (Recall that ω:= β - αδ/γ.) Therefore, t↦ e^iω tx_0 is a periodic solution. One computes that the linearised vector field at x_0 is given by DΩ(x_0) (v_1+iv_2) = i ω v -2(α/γ) (γ + i δ)v_1 and that the additional velocity term is given by ∂_ωg(0) = . d/dt\|_t=0 g(ω t) = . d/dt\|_t=0 e^i ω t = iω . Hence, we find that the parametrised variational equations are given by u̇ = ( DΩ(x_0)-∂_ωg(0) ) u = -2(α/γ) (γ + i δ) u_1 . As we saw before, this is a linear differential equation with constant coefficients. It has eigenvalues 0 (with eigenvector i tangent to the group orbit) and -2α (with eigenvector γ+iδ transversal to the group orbit). The results that we proved in this section still hold if we replace 𝕋^N by an arbitrary Lie group G acting on ℝ^n. The generalisation of Lemma <ref> is the following result, which for simplicity we only formulate for a matrix Lie group G⊂ GL(ℝ^n). We denote by 1∈ G the unit element of G and by T_1G the Lie algebra of G. Assume that Ω:ℝ^n→ℝ^n is equivariant under the left-action of the matrix Lie group G, and that G· x_0 is a relative equilibrium of Ω. Then there is an ω∈ T_1G so that the map (g, u) ↦ (x, v):= (g· x_0, g· u) G×ℝ^n→ℝ^n×ℝ^n sends solutions of the constant coefficient skew product differential equation ġ = g ·ω , u̇ = (DΩ(x_0) - ω)· u to solutions of the variational equations of Ω given by ẋ = Ω(x) , v̇= DΩ(x) · v . Because G· x_0 is a relative equilibrium, we have that Ω(x_0)=. d/dt\|_t=0e^t ω· x_0 = ω· x_0 ω∈ T_1G . As a result, Ω(g· x_0) = g·Ω(x_0) = g·ω· x_0. Thus, if a curve g(t)∈ G satisfies ġ(t) = g(t)·ω then x(t):=g(t)· x_0 satisfies ẋ(t) = g(t)·ω· x_0 = Ω(g(t)· x_0)= Ω(x(t)). This proves the first component of the conjugacy equation in this lemma. For the second component, note that if in addition u(t) satisfies u̇(t) = (DΩ(x_0) - ω) · u(t), then v(t):=g(t)· u(t) satisfies v̇(t) = g(t)·ω· u(t) + g(t)· (DΩ(x_0) - ω) · u(t) = g(t)· DΩ(x_0) · u(t) = DΩ(g(t)· x_0) · g(t)· u(t)= DΩ(x(t))· v(t) . Here we used that equivariance of Ω implies that DΩ(g· x)· g = g· DΩ(x). Similar to when G=𝕋^N, one may expect that also for a general non-commutative Lie group G the matrix DΩ(x_0)-ω is always singular. This turns out not to be the case: the correct statement is slightly more subtle. Note that differentiation to t at t=0 of Ω(e^t h x_0) = e^t hΩ(x_0) (for h∈ T_1G) gives DΩ(x_0) h x_0 = hΩ(x_0) = h ω x_0. This can equivalently be written as [DΩ(x_0) - ω ] h x_0 = hω x_0 - ω h x_0 = [h,ω]x_0 = - ad_ω(h) x_0 h ∈ T_1G . Under the assumption that G is compact, the eigenvalues of ω∈ T_1G are all purely imaginary (otherwise {e^tω\| t∈ℝ} would form a noncompact subgroup of G). We conclude that the operator ad_ω: T_1G→ T_1G mapping h ↦ [ω, h] only has purely imaginary eigenvalues as well (because its eigenvalues are λ-μ for λ, μ eigenvalues of ω.) This proves that in the direction tangent to the relative equilibrium T_x_0G· x_0 = {h · x_0 \| h∈ T_1G}, the linearisation DΩ(x_0)-ω only has elliptic eigenvalues (i.e. they lie on the imaginary axis). As in our discussion of the case G=𝕋^N, we can still obtain a parametrisation of an invariant normal bundle if we assume for example that DΩ(x_0)-ω is hyperbolic in the transverse direction. § THE PARAMETRISATION METHOD We now try to find an invariant embedded torus in ℂ^n by conjugating a vector field on the standard torus 𝕋^n of the form Φ̇= F(Φ) = Ω + ε F^(1)(Φ) + ε^2 F^(2) (Φ) + … to the above equations of motion by means of a semi-conjugagy / torus embedding of the form Φ↦ (R(Φ); ϕ(Φ)) = (R^; Φ) + ε( R^(1)(Φ), ϕ^(1)(Φ) ) + … . Here, Ω_j = ω_j + β_j (R_j^)^2 and R^_j = √(-μ_j/α_j) are the stationary values of the R_j. We are most of all interested in the reduced vector field F(Φ) as this constitutes the phase reduction of the model. The conjugacy equations (DR(Φ), Dϕ(Φ)) · F(Φ) = (Ṙ, ϕ̇) (R(Φ), ϕ(Φ)) reduce to a list of recursive equations. The order 𝒪(ε) part of these equations is ∂_Ω R^(1)_j(Φ) + 2 μ_j R_j^(1)(Φ) = ∑_k R^_k Re (A_jk e^i(Φ_k-Φ_j) + B_jk e^-i(Φ_k+ Φ_j)) ∂_Ωϕ^(1)_j(Φ) + F_j^(1)(Φ) - 2(β_jR_j^) R_j^(1)= (R^_j)^-1∑_k R^_k Im (A_jk e^i(Φ_k-Φ_j) + B_jk e^-i(Φ_k+ Φ_j)) Here, ∂_Ω f(Φ) := ∑_k ∂ f(Φ)/∂Φ_kΩ_k is a directional derivative in the direction of the frequency vector. The 𝒪(ε^k) parts of the conjugacy equation have a totally similar structure, i.e. they are of the form ∂_Ω R^(k)(Φ) + 2 μ R^(k)(Φ) = ∂_Ωϕ^(k)(Φ) + F^(k)(Φ) - 2(β R^) R^(k) = Here, μ denotes the diagonal matrix with entries μ_1, …,μ_n and similar for the matrix β R^. The inhomogeneous terms are functions of Φ that depend on the solutions to the recursive equations that were solved before. § SOLVING THE INFINITESIMAL CONJUGACY EQUATIONS These homological equations can always be solved for R^(k). This follows because ∂_Ω e^i⟨ k, Φ⟩ = i⟨ k, Ω⟩ e^i⟨ k, Φ⟩ and hence in particular, (∂_Ω + 2 μ_j ) e^i⟨ k, Φ⟩ = ( 2μ_j + i⟨ k, Ω⟩) e^i⟨ k, Φ⟩ which defines an invertible operator on L_2(𝕋^n, ℝ^n) because the μ_j are real and nonzero, and the i⟨ k, Ω⟩ purely imaginary. This is just a direct consequence of the normal hyperbolicity. On the other hand, the second homological equation can not be solved in such a straightforward fashion. But luckily, we have the freedom of choosing F^(k). So a sensible strategy will be to choose F^(k) to consist precisely of the resonant terms in the inhomogeneous right hand side and the term 2(β R^*)R^(k) (which also acts as inhomogeneous term here). A resonant term is defined as an element of the kernel of ∂_Ω. These are exactly the complex exponentials e^i⟨ k, ϕ⟩ for which ⟨ k, Ω⟩ = 0. This allows us to solve the second equation for ϕ^(k)(Φ). At the same time we conclude that it can be arranged that F(Φ) is a sum of only resonant terms. In this sense, our strategy also leads to the “simplest possible” reduced vector field F(Φ). Obvious question: which classical, quiver and other types of symmetries are preserved in this reduction process? The answer depends on how we deal with the non-uniqueness of the solution. I should also remark that this is not all too deep and new but it might be a nice story. On the other hand, note the recent preprint High-order phase reduction for coupled oscillators by Gengel, Teichman, Rosenblum and Pikovsky, where they present a similar but less efficient method, use it to second order on a three cell network, and don't see that they can actually remove the resonant terms.... § A MORE GENERAL GEOMETRIC SETUP Now we assume that the unperturbed system of oscillators is given as an invariant periodic or quasiperiodic torus in ℝ^N. Assume that there is an embedding of this torus of the form Φ↦ K_0(Φ) 𝕋^n →ℝ^N with the property that ∂_Ω K_0 = G_0 ∘ K_0 Here, Ω∈ℝ^n is a frequency vector. Differentiation to s of (∂_ΩK_0)(Φ+sX(Φ) ) = DK_0(ϕ+sX(Φ) )·Ω = G_0(K_0(Φ+s X(Φ) )) gives ∂_Ω (DK_0(Φ) · X(Φ)) = (DG_0 (K_0(Φ)) )· DK_0(Φ) · X(Φ) . In other words, the multiplication operator DK_0 intertwines ∂_ω and the multiplication operator (DG_0∘ K_0). We will use this below. Given the perturbed vector field G = G_0 + ε G_1 + ε^2 … we now try to iteratively solve for a conjugacy K = K_0 + ε K_1 + ε^2 … and reduced vector field F= Ω + ε F_1 + ε^2 … of the equation D K · F = G ∘ K which becomes [ ( ∂_Ω - DG_0∘ K_0 ) · K_1 + DK_0 · F_1 = G_1 ∘ K_0 =: H_1; ⋮ ; ( ∂_Ω - DG_0∘ K_0 ) · K_j + DK_0 · F_j = H_j; ⋮ ] Here the right hand side H_j: 𝕋^n→ℝ^N should be considered an inhomogeneous term. At the left hand side the unknowns are K_j and F_j. We now make an ansatz K_j(Φ) = DK_0(Φ)· X_j(Φ) + N_0(Φ)· Y_j(Φ) . Here, X_j: 𝕋^n→ℝ^n , N_0: 𝕋^n→ L(ℝ^N-n, ℝ^N) Y_j(Φ): 𝕋^n→ℝ^N-n . The idea is to choose N_0 in such a way that ℝ^N = im DK_0(Φ) ⊕ im N_0(Φ) so that the homological equations can be solved. Because ( ∂_Ω - DG_0∘ K_0 ) (DK_0 · X) = 0 this ansatz gives ( ∂_Ω - DG_0∘ K_0 ) · ( N_0 · Y_j) + DK_0 · F_j = H_j . We would preferably choose N_0 in such a way that ( ∂_Ω - DG_0∘ K_0 ) · (N_0 · Y_j) = N_0 ·( ∂_Ω - n_0 ) Y_j where n_0 is a family of (N-n)× (N-n) matrices, probably with only hyperbolic eigenvalues. From looking at the equations we see that the left hand side equals ( N_0 ∂_Ω + ∂_Ω N_0 - (DG_0∘ K_0 ) N_0 ) · Y_j In other words, we want to find N_0 and n_0 satisfying the equation ∂_Ω N_0 = (DG_0∘ K_0) · N_0 - N_0 · n_0 . The homological equation then becomes N_0 ·(∂_Ω - n_0 )· Y_j + DK_0 · F_j = H_j . Now there should be unique solutions F_j and Y_j, assuming that one can prove that ∂_Ω - n_0 is invertible. It remains find N_0 and n_0. Let n_0 be a family of matrices with non-imaginary spectrum. Then the operator ∂_Ω - n_0 is invertible. The proof only works if there are smooth families of eigenvectors, that is, (∂_Ω - n_0(Φ)) v(Φ) = λ(Φ) v(Φ) . Then any right hand side X(Φ) can be written as X(Φ) = ∑ v_i(Φ) and the operator acts as (∂_Ω - n_0) v_i(Φ) = Differentiation to s of (∂_Ω K_0)(Φ +s v) = G_0(K_0(Φ+sv)) yields that D(∂_ΩK_0)· v = DG_0 · DK_0 · v At the same time we can calculate variational equations by expanding d/dt K_0(Ω t + sv(t)) = G_0(K_0(Ω t + sv(t) )) or equivalently DK_0(Ω t + s v) (Ω + s dv/dt ) = G_0(K_0(Ω t + sv)) so that DK_0 ·dv/dt + D(∂_ΩK_0)· v = DG_0 · DK_0 · v This proves that dv/dt=0 because DK_0 is injective. Next we calculate the full variational equations: differentiation to s of d/dt( K_0(Ω t ) + sDK_0(Ω t)· v + s N_0(Ω t) w(t) ) = G_0(K_0(Ω t) + s DK_0(Ω t) v + s N_0(Ω t) w ) yields DK_0 ·dv/dt + D(∂_ΩK_0)· v + ∂_ΩN_0 · w + N_0 ·dw/dt = DG_0 ·( DK_0 · v + N_0 · w ) This reduces (by the above) to DK_0 ·dv/dt + ∂_ΩN_0 · w + N_0 ·dw/dt = DG_0 · N_0 · w Now we project this onto im DK_0 and N_0 to obtain ( [ DK_0 ·dv/dt; N_0 ·dw/dt ]) = ( [ 0 A(Ω t); 0 B(Ω t) ]) ( [ v; w ]) where A(Φ) + B(Φ) = (DG_0· N_0 - ∂_ΩN_0) w If this is in the image of N_0, i.e. if (DG_0· N_0 - ∂_ΩN_0) w= N_0 n_0 w then A(Φ)=0 and the equations for v and w decouple. Consider the equation - ∂_Ω N_0(Φ) + A(Φ) · N_0(Φ) = N_0(Φ) · n_0(Φ) for the unknown matrix functions N_0, n_0. In the absence of the term ∂_Ω N_0 one could solve it by choosing N_0(ϕ) to span the image of A(Φ). Now we need it span the image of ∂_Ω - A(Φ), which is more complicated as it does not depend on local information. Recall that terms of the form DK_0 · X are in the kernel of this operator. We have to assume that the they are the only ones. One tries to solve this equation by realising that DK_0 · F_j ∈ im DK_0 = T K_0(𝕋^n) lies in the direction along the unperturbed embedded torus. In other words, in the direction of the unperturbed embedded torus, we solve the equation by choosing F_j appropriately. We have to choose a natural transverse direction N along this embedded torus, preferably so that N⊂ im ( ∂_Ω + DG_0 ) . We moreover assume that the family of matices DG_0(x_0): ℝ^N→ℝ^N x_0∈Φ_0(𝕋^n) has rank N-n. This is the maximal possible rank because 0 = . d/dε\|_ε=0 DK_0(Φ+ε v) ·Ω - G_0 ∘ K_0(Φ + ε v) = D^2K_0(Φ)(v, Ω) - DG_0(x_0) DK_0(Φ) · v § ANOTHER TRY FOR A GEOMETRIC SETUP Let the embedding K_0 and the families of matrices N_0, n_0 satisfy ∂_ΩK_0 = G_0∘ K_0 ∂_ΩN_0 + N_0 · n_0 = (DG_0∘ K_0 )· N_0 . Then the embedding (Φ, w)↦ (x,v) = (K_0(Φ), N_0(Φ)· w) conjugates the skew-product vector field (Φ, w) ↦ (Ω, n_0(Φ)· w) to the variational vector field TG_0(x, v) = (G_0(x), DG_0(x)· v) The proof is just a direct computation.
http://arxiv.org/abs/2306.08510v1	20230614135331	Permutation Invariant Recurrent Neural Networks for Sound Source Tracking Applications	[ "David Diaz-Guerra", "Archontis Politis", "Antonio Miguel", "Jose R. Beltran", "Tuomas Virtanen" ]	eess.AS	[ "eess.AS", "cs.LG", "cs.SD", "eess.SP" ]	Information Bottleneck in Peptide Conformation Determination by X-ray Absorption Spectroscopy J. Niskanen July 31, 2023 =============================================================================================== Many multi-source localization and tracking models based on neural networks use one or several recurrent layers at their final stages to track the movement of the sources. Conventional recurrent neural networks (RNNs), such as the long short-term memories (LSTMs) or the gated recurrent units (GRUs), take a vector as their input and use another vector to store their state. However, this approach results in the information from all the sources being contained in a single ordered vector, which is not optimal for permutation-invariant problems such as multi-source tracking. In this paper, we present a new recurrent architecture that uses unordered sets to represent both its input and its state and that is invariant to the permutations of the input set and equivariant to the permutations of the state set. Hence, the information of every sound source is represented in an individual embedding and the new estimates are assigned to the tracked trajectories regardless of their order. § INTRODUCTION In recent years, the state-of-the-art of sound source localization established by classic signal processing techniques has been surpassed by new systems using deep-learning models <cit.>. These models use different input features and network architectures, but most of them track the temporal evolution of the signals using convolutional layers followed by recurrent layers <cit.>. Using these architectures, the latent representations at every hidden layer are difficult to interpret and we cannot exploit the permutation invariance of the tracking problem where, if we cannot apply any criteria to order or classify the sources, any permutation of the sources should be considered equally correct. In <cit.>, we proposed an icosahedral convolutional neural network (icoCNN) for single source localization where the output of the last convolutional layer can be interpreted as the probability distribution of the direction of arrival (DOA) and we can obtain the estimated DOA as its expected value. Extending this model to multi-source scenarios is straightforward and we just need to increase the number of channels of the last convolutional layers to the maximum number of concurrent sources M that the model should be able to localize. Following this approach, after computing the expected value of every one of the M probability distributions generated by the icoCNN, we obtain a set of M DOAs that should be considered invariant to the permutations of its elements. In order to incorporate a recurrent neural network (RNN) after the localization model to increase its temporal perceptive field and improve its tracking capabilities, we could concatenate every element of the DOA set into a single vector and use it as the input of a gated recurrent unit (GRU) <cit.> or a long short-term memory (LSTM) layer <cit.>. However, we should expect the output of a tracking system to not be affected by the order of the new estimates at every time frame (i.e., to be invariant to the permutations of the input set), and a conventional RNN operating over the concatenation of the estimates would need to learn this property during the training instead of being part of its architecture. In addition, in a tracking system, we can also expect the association of a new estimate to the tracked trajectories be done regardless of their order (i.e., be equivariant to the permutations of the state set) but the state vector generated by a conventional RNN would contain the information of every tracked trajectory in an unstructured way so we would not be able to exploit this property either. In this paper we present a permutation-invariant recurrent neural network (PI-RNN) that takes an unordered set of embeddings as input (each one with the information of one of the sources detected by the localization network) and generates a recursive output, or state, that is also an unordered set of embeddings with the information of every tracked trajectory. As we could expect from a tracking system, the proposed architecture associates the embeddings in the input set to the embeddings of the state set in a way that is invariant to the permutations of the input set and equivariant to the permutations of the state set. To the best of our knowledge, this is the first recurrent layer that works with sets instead of with vectors. The closest proposal in the literature is probably the TrackFormer <cit.>, a model for multiple object tracking on video signals that is based on the DETR transformer <cit.>, a model for object detection on images. The recursivity of the TrackFormer model is built around the decoder of the DETR transformer by using the output obtained for a video frame as the input for the following frame. Compared with the TrackFormer, the PI-RNN is not a model but a layer that can be integrated easily into many different models. In addition, it is based on an architecture, the conventional GRU, that, unlike the transformer, was designed to be used in recurrent loops. Thanks to be taking into account the symmetries of the problem, the proposed PI-RNN, compared with the conventional RNN, scales better with the number of tracked sources and the amount of information stored in each one. Furthermore, we present experiments proving that they can obtain better tracking results than the conventional GRUs. § NETWORK ARCHITECTURE Conventional RNNs use a h(t) ∈ℝ^d_h vector to store the tracking state, which is updated at every time frame based on an input vector x(t) ∈ℝ^d_x using fully connected perceptrons whose computational complexity and number of trainable parameters grow linearly with d_x and quadratically with d_h. When applied to track up to M sources, the information of all the sources and tracked trajectories are stored in these vectors without any structure, so there is a trade-off between the number of sources M that we can track, the amount of information that we store about each one, and the model size and complexity. In contrast to conventional RNNs, we propose to replace the input and state vectors x(t) and h(t) with the sets of embedding X(t) = {x_1(t), x_2(t), ..., x_M_X(t) } and H(t) = {h_1(t), h_2(t), ..., h_M_H(t) } where every element x_i(t) ∈ℝ^d_x and h_i(t) ∈ℝ^d_h contains information about a single input detection or tracked trajectory respectively. For the sake of simplicity, we will keep M_X=M_H=M and d_x=d_h=d during the rest of the paper, however the proposed architecture can work with M_X ≠ M_H or even with dynamic values that change during time, and it can be easily extended to configurations with d_x ≠ d_h. In order to match every new embedding of the input set with the embeddings of the state set, we can use a multi-head attention module <cit.>, which is well known for its use in transformer models and is invariant to the permutation of the elements of its input sets: 𝐂(t) = ( 𝐇(t-1), 𝐗(t)∪𝐇(t-1), 𝐗(t)∪𝐇(t-1)) (𝐐,𝐊,𝐕) = (𝐡𝐞𝐚𝐝_1, ..., 𝐡𝐞𝐚𝐝_N_heads) 𝐡𝐞𝐚𝐝_i = (𝐐𝐖^Q_i, 𝐊𝐖^K_i, 𝐕𝐖^V_i) (𝐐_i, 𝐊_i, 𝐕_i) = (𝐐_i𝐊_i^T/√(d_k))𝐕_i, with the (·) operating across rows. With this configuration, the generated set 𝐂(t) is invariant to the permutations of 𝐗(t) and equivariant to the permutations of 𝐇(t-1) as we would expect from a tracking system. Finally, as shown in Fig. <ref>, once we have assigned the input embeddings to their corresponding state embedding, we can just update every element of the state set according to this assignation: 𝐡_i(t) = [1-𝐳_i(t)] ⊙𝐡_i(t-1) + 𝐡̃_i(t) 𝐳_i(t) = σ(𝐜_i(t)𝐖^z) 𝐡̃_i(t) = tanh(𝐜_i(t)𝐖^h), where ⊙ denotes element-wise vector multiplication and σ(·), tanh(·) denote sigmoid and hyperbolic tangent functions respectively, applied to each element of their vector arguments. This gated architecture is based on a simplified version of the minimal gated recurrent unit <cit.>, but we could design different architectures based on different conventional recurrent architectures. As in conventional RNNs, the number of trainable parameters grows quadratically with d, but in the case of the PI-GRUs we have M embeddings of size d containing the information of every tracked trajectory. Hence, we can expect our model to scale better when we increase the number of sources we want to track or the amount of information that we want to be able to represent for each one of them. § EVALUATION §.§ Experiment design As a preliminary study of the performance of this new architecture, we decided to add a PI-RNN after the icoCNN presented in <cit.> for single source localization. As shown in Fig. <ref>, in order to extend the icoCNN to multi-source localization, we just increased the number of output channels from 1 to M. Fig. <ref> represents the PI-RNN we used after the icoCNN: we first used a multi-layer perceptron to project every ACCDOA <cit.> generated by the icoCNN into an embedding of size d and then we used those embeddings as the input set of our PI-RNN. After the PI-RNN had associated every new estimate from the icoCNN to one of the tracked trajectories, we added a conventional GRU (operating independently over the embedding of every tracked trajectory so it did not break the permutation invariance of the model) and, finally, we used a linear layer to project the d-size embedding into a 3D ACCDOA. The initial state of every embedding of the state set of the PI-RNN was learned during the training of the model while, at every time frame, the embeddings of all the inactive trajectories were reset (i.e., those who had lead to ACCDOAs with a norm lower than 0.5). The method was compared to two baselines, a) the icoCNN without any kind of recurrent layers, and b) the icoCNN with two conventional GRUs designed to have a similar number of trainable parameters as the evaluated model (see Fig. <ref>). In order to avoid identity switches (IDSs) in the tracked trajectories, we trained all the models using sliding permutation invariant training (sPIT) <cit.>. To facilitate the training of the icoCNN, we added an auxiliary frame-level permutation invariant training (fPIT) at its output in the models that included recurrent layers after it. We used the same synthetic dataset as in <cit.>, where acoustic sources randomly appeared and disappeared along 20-second-length scenes. As source signals, we used speech utterances from the LibriSpeech corpus and we simulated them following random trajectories in rooms with reverberation times from T_60= 0.2 to 1.3 with the image source method. The maximum number of concurrent active sources in a time frame was 3. We used M=10 as the number of ACCDOA outputs of all our models since we observed that it was beneficial to use a higher number than the maximum possible number of active sources in the dataset (i.e., 3) and we used d=128 as embedding size for the input and state sets of the PI-RNN. This is a preliminary study of this new architecture and further experiments should be conducted for a better optimization of these hyperparameters. §.§ Results As we can see in Fig. <ref>, the proposed PI-RNN clearly outperforms the baselines in terms of localization error and the frequency of the identity switches while, as we can see in the detection error tradeoff (DET) curve, the trade-off between false positives and misses remains is for all the evaluated models. It is worth saying that both the conventional and the permutation-invariant RNNs are receiving only spatial information about the estimated sources. By modifying the model to include spectral information in their input we could expect both models to improve their performance, with the PI-RNNs scaling better to the amount of spectral information of each source and therefore being able to better exploit it. As an example, in Fig. <ref> we can see one of the test acoustic scenes. We can see how the output of the icoCNN had a high number of identity switches even when only one source was active but the PI-RNN was able to fix these switches and also reduce the localization error. §.§ Attention matrices We can interpret the attention matrix of the multi-head attention module of the PI-RNN as an assignment matrix where each row indicates which elements of the input and state set were employed to compute each element of the output set. The attention matrix shown in Fig. <ref> corresponds to the first frame where a source appeared and we can see how it was detected at the 8 output of the icoCNN (i.e., the 8 input of the PI-RNN) and the PI-RNN assigned it to its 9 output. In the attention matrix of the next time frame (Fig. <ref>) we can see that the 9 output of the PI-RNN was computed combining the information of the new estimate at that frame with the corresponding recurrent state. A new source was detected by the icoCNN at its 4 output in the time frame corresponding to Fig. <ref> and it was assigned to the 10 output of the PI-RNN. Finally, in Fig. <ref> we can see how, after an identity switch at the output of the icoCNN, the PI-RNN was able to assign every new estimate to the correct tracked trajectory fixing the identity switch. § CONCLUSIONS We have presented a new RNN architecture whose input and state are presented with sets instead of vectors and that is invariant to the permutation of the elements of the input and equivariant to the permutations of the elements of the state set. This new architecture is able to exploit the permutation symmetries of the tracking problem and to outperform the conventional RNN in the preliminary experiments presented in this paper. We expect the difference between the performance of the PI-RNNs and the conventional RNNs to become even greater when including more information of every source at their input.
http://arxiv.org/abs/2306.01905v1	20230602202927	Dispersion Study of a Broadband Terahertz Focusing Reflecting Metasurface for 6G Wireless Communication	[ "Fahim Ferdous Hossain", "John F. OHara" ]	physics.optics	[ "physics.optics" ]	Intense squeezed light from lasers with sharply nonlinear gain at optical frequencies Linh Nguyen^1, Jamison Sloan^2, Nicholas Rivera^1,3, Marin Soljačić^1 July 31, 2023 ===================================================================================== In 6G wireless communications, functional terahertz reflecting metasurfaces are expected to play increasingly important roles such as beamforming and beamsteering. This paper demonstrates the design of a functional and efficient beamforming metasurface in the burgeoning D-band (0.11-0.17 THz). In addition to achieving broadband operation (0.135-0.165 THz), this design is polarization-maintaining, diffraction limited, simple in design, exhibits 64.1% broadband efficiency (1.9 dB insertion loss) and 20% fractional bandwidth. Despite being formed by an array of highly dispersive resonators, the metasurface exhibits very low temporal dispersion, which avoids pulse reshaping and its consequent limitations on achievable data rate. The design and performance of the focusing reflector are presented followed by a group delay and group delay dispersion analysis revealing that a 2.83% temporal broadening of the pulse is observed at the focus. § INTRODUCTION Next-generation (6G) wireless communication technology will require significantly higher data rates and more tailored waveform design than 5G technology <cit.>. The higher data rate requirement demands the utilization of the terahertz frequency band <cit.>, pushing carrier frequencies above 0.1 THz <cit.> where large contiguous blocks of bandwidth are readily available. Atmospheric attenuation is a key challenge in terahertz wireless communication <cit.>. However, at a given water vapor density, D-band frequencies suffer relatively manageable atmospheric attenuation, particularly compared to higher frequencies in the terahertz regime <cit.>, and communication is now becoming possible into the multi-kilometer ranges <cit.>. Currently, if the the D-band is allocated for wireless communications, it can provide contiguous bands up to 32.5 GHz, bounded on either side by RR5.340 forbidden bands <cit.>. As such, D-band links could feasibly be exploited to implement high data rate wireless backhaul<cit.>. With narrow and more easily scattered terahertz beams utilized in 6G communications, future wireless links will require improved control over the beam (e.g. steering, focusing, wavefront correction). Metasurfaces have the potential to become a major player, finding applications in smart radio environments, massive multiple input multiple output (MIMO) technology <cit.>, and reconfigurable intelligent surfaces (RIS) <cit.>. Metamaterials have marshaled a lot of interest over the past two decades by their ability to manipulate electromagnetic waves in an unprecedented manner <cit.>. Metamaterial demonstrations include stealth <cit.>, negative refraction<cit.> and super lensing <cit.>. Planar metamaterials with subwavelength thickness are called metasurfaces and are regarded as the 2D counterpart of 3D metamaterials<cit.>. Metasurfaces are typically easier to fabricate, lighter, less bulky, achieve highly practical functionality <cit.>, and can exhibit less loss than bulk metamaterials <cit.>. This would be particularly important in space-based applications. Metasurfaces have been demonstrated from the microwave to visible regimes including terahertz frequencies <cit.>. Demonstrated terahertz metasurface devices already include: planar convex/concave metalenses, holograms, wave plates, beam splitters, special beam generators, arbitrary polarization controllers, and various active devices <cit.>. Several specific examples illustrate the state of the art in terahertz metasurfaces. The design of a metasurface mirror with adaptive focusing operating in the vicinity of 2 THz was presented by Hosseininejad et al. <cit.>. In <cit.>, a small, efficient terahertz focusing lens with 4.7 mm focal length was presented. Lee et al. experimentally demonstrated a quarter wave mirror based on dielectric resonators operating between 0.97~1.6 THz having a fractional bandwidth of 49% and reflection amplitudes exceeding 92% for both orthogonal polarizations<cit.>. In reference <cit.>, a half wave mirror also based on dielectric resonators operating in the 0.89~1.54 THz frequency range has been experimentally demonstrated, having a peak/average cross-polarization reflection amplitude greater than 72%/ 79%, respectively, and a peak/average co-polarization reflection amplitude smaller than 31%/15%. State-of-the-art focusing metasurfaces can be better illustrated by considering wavelengths in addition to terahertz. A metasurface based lens with focal distances of 3 cm and 6 cm was demonstrated using a flat axicon and operated at the telecom wavelength (1.55 μm) <cit.>. General strategies to design meta-mirrors employing a Lorentzian multi-resonance model operating in microwave (8-12 GHz), terahertz (0.5-0.8 THz), and optical (1,150-1,875 nm wavelength) ranges have been proposed in <cit.> with experimental demonstration of an achromatic and abnormal chromatic meta-mirror in the 8-12 GHz range. A terahertz focusing mirror with super-resolution capability consisting of unit cells having reflection magnitude more than 88% operating in the 200-300 GHz frequency range has been proposed in <cit.>. One optical metalens operating between 470-670 nm was designed by utilizing nanofins on a surface <cit.>. Because of their usual resonant and frequency-dispersive nature, metasurfaces commonly present challenges to achieving broad bandwidth, particularly in the terahertz regime, where fewer constituent materials are available for complex structural design, compelling additional research. In <cit.>, a terahertz reflectarray operating with a center frequency of 1 THz was shown to have a fractional bandwidth of about 24%. An impressive experimental demonstration of a broadband achromatic terahertz metalens having 91% fractional bandwidth in the 0.3-0.8 THz regime was also presented <cit.>, though this approach relied on a complex all-dielectric deep-etching fabrication. It is finally noted that some communication and sensing applications may benefit from longer focal length designs, particularly those that do not alter or rely on wave polarization effects. The design of a polarization-preserving, long focal length, focusing metasurface reflector, having simple design, high broadband efficiency, and wide bandwidth has not been yet demonstrated in the D-band frequency range. Because of the ubiquitous need to utilize wireless spectrum efficiently, the dispersive behavior for meta-reflectors warrants particular attention, especially as operating bandwidths become large, as in 6G. For example, terahertz waves undergo group delay dispersion (GDD) while propagating through the atmosphere due to the frequency-dependent refractivity of air<cit.>. This can occur to the extent that it causes intersymbol interference (ISI), which leads to reduced available data rates <cit.>. While GDD has traditionally been addressed in wireless systems by digital equalizers, their practical implementation may not be optimal in light of the more challenging requirements of 6G waveforming, synchronization, noise, and baseband signal processing. Moreover, the effectiveness of digital equalization to mitigate the effects of GDD in 6G systems remains unvalidated <cit.>, particularly as 6G waveforms continue to be developed. Metasurfaces can similarly produce GDD and it is therefore important to quantify the dispersion introduced to broadband communication waveforms by metasurface-based reflectors. Such dispersion would add to any existing dispersive elements of the channel (e.g. atmosphere) and therefore must be evaluated for its impact on 6G wireless systems and any possible imposed design constraints. In this paper, we propose a design of a flat, metasurface focusing reflector based on metal-insulator-metal (MIM) structured unit cells, having a relatively long design focal length of 500 mm, and operating in the 135-165 GHz range. The behavior of the reflector has been quantified in terms of GDD, pulse broadening, broadband focal length, optical focusing performance, and power efficiency. The reflector achieves nearly diffraction-limited focusing with a broadband focal length of 500 mm, a broadband power efficiency of 64.1% and temporal pulse broadening of 2.83% at the focus. This particular case-study was designed as a stepping stone toward improving the performance of long-path terahertz spectroscopy cells <cit.>, however the study of its dispersive behavior is equally informative for applications like 6G. § DESIGN OF FOCUSING REFLECTOR To minimize losses, the metasurface reflector design should aim for a unity reflection coefficient magnitude over its entire surface area. Assuming an incident plane wave, the phase distribution of the wave reflected from the flat 2D metasurface should satisfy the following equation if the reflector is assumed to be in the xy-plane and its center is coincident with the origin of the three-dimensional Cartesian coordinate system: Δϕ=(2π/λ√((x^2+y^2+f^2))-f)mod 2π, Here, Δϕ is the phase difference required at the transverse point (x,y) on the metasurface relative to the phase at the origin, λ is the wavelength and f is the focal length of the reflector. The optical axis is assumed to be coincident with the z-axis. The modulo 2π in Eq. <ref> ensures that phase differences greater than 2π are adjusted to remain between 0 and 2π. The task of the metasurface is to produce this phase profile on the wave, along with nearly complete reflectivity, upon reflection. The frequency and spatial dependency of this phase specification reveal that multiple parameters must be simultaneously tuned in the final metasurface design. And since this profile is continuous in space, the discretized nature of metasurface elements will necessarily limit the achievable fidelity to a step-wise approximation. To approximate the phase relationship in Eq. <ref>, the metasurface reflector proposed in this work consists of nine annular regions, each having a width of 5 mm, plus a single 10 mm diameter circular region in the middle, corresponding to a total lens diameter of 100 mm. A schematic of the focusing reflector is depicted in Fig <ref> (a). Each of these regions has been populated by many instances of a corresponding unit cell. The unit cells are MIM structures designed by inspiration from <cit.>, and the sample structure can be viewed in Fig <ref> (b): two rectangular aluminum patches on a 50 μm thick silicon substrate with an aluminum backplane. The side length of the square unit cell was 350 μm. The geometric parameters of the rectangular aluminum resonators such as length, width, and gap between resonators were varied to achieve a 0 to 2π phase range required in the reflected wave. COMSOL Multiphysics simulation software was used to obtain the complex reflection coefficients of the unit cells utilizing the finite element method (FEM). Numerous unique unit cells were simulated and ten were judiciously chosen based on the phase, amplitude, and frequency-dependence of their reflection coefficients. The reflection coefficient magnitudes of the unit cells are presented in Fig.<ref> (a). All the unit cells except those in region 4 show reflection coefficient magnitudes exceeding 0.9 over the entire design bandwidth. The reflection coefficient magnitude curve of unit cell 4 shows a strong resonance between 161-165 GHz, dramatically reducing its efficiency in this range. It may seem that the majority high values of reflection coefficient magnitudes will translate into high broadband device efficiency too. However, in practice imperfect interference at the focus also plays a role, so that a holistic investigation of the reflector response is required. This is best investigated after the metasurface is known to function as an effective focusing reflector. The focusing behavior of the designed metasurface can be approximated with a Huygens-Fresnel treatment. Each metasurface unit cell is considered a point radiator that is initially stimulated by illumination from the incident broadband wave whose phase fronts are parallel to the xy-plane. The waves are modified by the complex reflection response of the various unit cells as a function of position and thereby produce an approximation to the phase profile given in Eq. <ref> and the requisite constructive interference near the focal region of the reflector. Since the incident wave is a transform-limited broadband pulse, the reflected wave is also localized in space and time and can be visualized at different time instances, as shown in Fig. <ref>. Here, three different time instances of a 30 GHz broadband reflected pulse are depicted. The plots reveal several important attributes about the performance of this metasurface reflector. First, it achieves nearly diffraction-limited focusing, as seen in Fig. <ref>(b), where the transverse, (1/e^2) beamwidth of the focus is approximately 14.6 mm. This matches well with the Rayleigh-Sommerfeld diffraction theory <cit.> estimate of 13.8 mm from an ideal reflector. Second, the integrated power contained in the focused pulse reveals that the overall efficiency of the metasurface reflector is 64.1%, when normalized to an ideal, concave, focusing mirror. Third, the narrow and single-peaked shape of the pulse in the z-direction reveals that very little overall temporal broadening occurred, despite the dispersive nature of the metasurface unit cells. This was by design, of course, but raises the issue of exactly how well, quantitatively, the design actually worked. To answer that, the concept of dispersion must be elaborated. § RESULTS AND DISCUSSION Dispersion effects may be quantified by starting with group delay, which is defined as<cit.>: GD=-dϕ/dω where ω is the angular frequency and ϕ is the phase of the wave reflected by the metasurface. Extending this principle, group delay dispersion (GDD) is defined with another derivative <cit.> or GDD=-d^2ϕ/dω^2 . According to Eq. <ref>, a linear phase-frequency relationship entails a constant GD and zero GDD. This represents the ideal case when designing a focusing broadband reflector, thus two main design parameters in the phase must be considered. First, to ensure focusing at the correct focal length, each unit cell or annular region of the reflector must satisfy Eq. <ref> for all the involved frequencies. Second, to ensure zero GDD, the phase response at any spatial location on the reflector must be linear as a function of frequency. The phase-frequency relationship of the chosen unit cells for our design is shown in Fig. <ref>(b) over a frequency range of 135-165 GHz. From our available pool of simulated unit cells, the chosen unit cell set complied most favorably with both aforementioned phase requirements and with the requirement to maximize reflection magnitude. However, from Fig. <ref>(b), it is evident that the phase–frequency relationships of the unit cells are not linear over the given frequency range, especially for the unit cells in region 4. Any such nonlinearity causes the reflector response to have a frequency dependent group delay, which is shown for each unit cell design in Fig. <ref>(a). Each of the reflector regions shows variable group delay over the frequency range of interest. The unit cell chosen for annular region 4 shows a large peak in group delay in the 162.5-163.5 GHz range. This can be attributed to the unit cell's resonance in this frequency range, which is accompanied by a sharp change in phase. With few exceptions, group delays for all other unit cells and for unit cell 4 in most of its frequency range are less than 46 ps. GDD indirectly quantifies how much temporal dispersion a broadband pulse experiences. To maintain the temporal duration of a broadband pulse, as would typically be desired in wireless communications, low values of GDD are desired. Anywhere group delays of unit cells are frequency dependent, non-zero GDD is expected. As such, the GDD imposed by reflections from region 4 should be most impactful. In Fig. <ref>(b), the GDD behavior with respect to frequency can be observed. Mostly, the values of GDD are within or close to -680-545 ps^2. However, in region 4, GDD spikes to values exceeding ± 5×10^6 ps^2, over a narrow bandwidth. Such large values hint at the possibility of observing pulse broadening in the time domain. However, the fields at the focus integrate the effects of all the regions of the reflector, meaning the GDD effects from region 4 will be dampened in the overall performance. The GDD of the pulse at the focus is presented in Fig. <ref>. Here, GDD values stay mostly between -190 to 190 ps^2 with expected peaks at the band edges and one large feature around 162-164 GHz. This GDD behavior is a combined effect of imperfect focusing of individual regions of the reflector (due to imperfect GD values) and their non-zero GDD values, particularly those in region 4. In the time domain, this GDD behavior also corresponds to a broadening of the pulse at the focus. The input pulse incident on the reflector had a FWHM duration of 40.28 ps, and this was unchanged at the focus when an ideal mirror was substituted for the metasurface reflector. However, the pulse at the focus of the metasurface reflector had a FWHM duration of 41.42 ps, a 2.83% increase in the pulse width, as shown in Fig. <ref>. In a communication system, this increased pulse width proportionally translates to a lower spectral efficiency and consequently a lower achievable bit rate, if left uncorrected. An incident pulse having reduced bandwidth of 135-160 GHz was also studied to observe the effect of removing the GDD spike of region 4. The corresponding GDD curve is shown in Fig. <ref> and that depicts an almost complete match with the original GDD curve. In this reduced bandwidth case, the incident pulse's FWHM duration was 48.26 ps and the FWHM duration at the focus was 48.83 ps which results in a pulse width broadening of only 1.18%. The reduced impact of pulse broadening in this case illustrates the significant impact of the GDD spike of region 4, which resulted in a 140% pulse broadening penalty. The power efficiency of the metasurface reflector compared to an ideal mirror is 64.1%, despite all but one of the metasurface unit cell designs exhibiting reflection coefficient magnitudes >0.9 for the entire operating bandwidth. The reason for can be attributed to the imperfect group delays. The power efficiency was computed as Σ I_foc/Σ I_ideal. Here, Σ I_foc is the sum of the intensity values at all the points within the metasurface reflector's focal plane within the beamwidth and Σ I_ideal is the sum of all the intensity values at the ideal mirror's focal plane within the beamwidth. This integration approach permits a quantification of actual power instead of intensity at the focus. § CONCLUSION A broadband metasurface based focusing reflector along with its broadband behavior study has been presented and compared with an ideal mirror. The metasurface based reflector has a broadband power efficiency of 64.1%, a focal length of 500 mm, and a focal (1/e^2) beam width of 14.6 mm, very nearly at the diffraction limit. A pulse width spread of 2.83% has been observed and is attributed mostly to the strongly dispersive behavior of one unit cell design of the entire reflector's cohort. While 2.83% pulse broadening does not initially seem significant, this particular design was selected to minimize dispersion, meaning other design options resulted in worse broadening. Additionally, the GDD analysis reveals that the GDD observed at the focus is dependent both on the dispersive nature of the individual unit cells and superposition of the pulse reflected from all different points on the reflector. It is feasible that design tradeoffs that reduce the focal length, improve efficiency, or increase operating bandwidth could dramatically increase GDD. In such cases, GDD, if left uncorrected, could prove to be a limiting factor in the achievable data rate of the metasurface, when it is used in high-bit-rate communications. In the future, improved methods to design metasurface reflectors with managed dispersion can be investigated. Additionally, there is clearly value in additional trade-off studies among the various parameters of focusing metasurface reflectors with an eye toward multi-dimensional optimization. § FUNDING We gratefully acknowledge support from National Aeronautics and Space Administration (NASA Award Number 80NSSC22K0878) for this work. § ACKNOWLEDGEMENTS The authors acknowledge Mr. Karl Strecker and Mr. Russ Messenger for their useful feedback on this manuscript. § DISCLOSURES The authors declare no conflict of interests. unsrt
http://arxiv.org/abs/2306.11647v1	20230620161638	Safe and Scalable Real-Time Trajectory Planning Framework for Urban Air Mobility	[ "Abenezer Taye", "Roberto Valenti", "Akshay Rajhans", "Anastasia Mavrommati", "Pieter J. Mosterman", "Peng Wei" ]	cs.RO	[ "cs.RO", "cs.SY", "eess.SY" ]	Thermoelectric properties of Topological Weyl Semimetal Cu_2ZnGeTe_4 Bhawna Sahni,^1 Riddhimoy Pathak,^2 P C Sreeparvathy,^1 Tanusri Saha-Dasgupta,^3 Kanishka Biswas,^2 and Aftab Alam^1 July 31, 2023 ======================================================================================================================== This paper presents a real-time trajectory planning framework for Urban Air Mobility (UAM) that is both safe and scalable. The proposed framework employs a decentralized, free-flight concept of operation in which each aircraft independently performs separation assurance and conflict resolution, generating safe trajectories by accounting for the future states of nearby aircraft. The framework consists of two main components: a data-driven reachability analysis tool and an efficient Markov Decision Process (MDP) based decision maker. The reachability analysis over-approximates the reachable set of each aircraft through a discrepancy function learned online from simulated trajectories. The decision maker, on the other hand, uses a 6-degrees-of-freedom guidance model of fixed-wing aircraft to ensure collision-free trajectory planning. Additionally, the proposed framework incorporates reward shaping and action shielding techniques to enhance safety performance. The proposed framework is evaluated through simulation experiments involving up to 32 aircraft in a UAM setting, with performance measured by the number of Near Mid Air Collisions (NMAC) and computational time. The results demonstrate the safety and scalability of the proposed framework. § INTRODUCTION §.§ Motivation Urban Air Mobility (UAM) is a novel concept in which partially or fully autonomous air vehicles transport passengers and cargo in dense urban environments. This technology aims to provide a safe, efficient, and accessible on-demand air transportation system <cit.>, offering an alternative to traditional ground-based transportation methods. Furthermore, as the technology advances, it will connect urban centers to outlying areas, expanding the reach of metropolitan regions. UAM operation is a multi-agent safety-critical application that requires the simultaneous consideration of safety and scalability as primary design considerations. Thus, a UAM trajectory planning framework needs to generate trajectories efficiently while ensuring compliance with system safety requirements. These two problems — developing a scalable trajectory planner and safety verification of autonomous systems — are fundamentally challenging in and of themselves and are often addressed independently in the literature. However, in the context of UAM, both must be considered simultaneously. The task of guaranteeing the safe operation of autonomous systems is often called verification and validation. Several approaches to verification and validation have been proposed in the literature. These approaches can be broadly classified as formal methods and sampling-based approaches. Sampling-based approaches involve generating a finite number of scenarios to assess the performance of a system. Hence, they have the advantage of being easier to implement and evaluate the performance of an autonomous system. However, they can not account for all possible behaviors of the system, which is an essential element in verification and validation. As a result, formal methods, which can capture all possible behaviors of the system, have gained significant research attention in recent years. §.§ Related Work Organizations such as NASA™, Uber™, and Airbus™ have been exploring the use of vertical takeoff and landing (VTOL) aircraft for UAM <cit.>. The UAM concept envisions the use of VTOL aircraft departing and arriving at small-scale airports known as vertiports. An unstructured airspace approach known as “free flight” has been proposed as a solution to the ongoing congestion of the current Air Traffic Control (ATC) system. Studies have demonstrated that free flight with airborne separation can handle a higher traffic density <cit.>, and bring fuel and time efficiency <cit.>. Under this approach, each aircraft performs separation assurance and conflict resolution. Tomlin et al. <cit.> stated that free flight is potentially feasible due to enabling technologies such as Global Positioning Systems (GPS), data link communications like Automatic Dependence Surveillance-Broadcast (ADS-B) <cit.>, Traffic Alert and Collision Avoidance Systems (TCAS) <cit.>, but would require robust onboard computation. The literature on multi-agent trajectory planning algorithms is extensive and can broadly be classified as centralized and decentralized methods. In centralized methods, the state of each aircraft, obstacles, trajectory constraints, and the terminal area’s state are observable to the controller via sensors, radar, etc., and a central supervising controller resolves conflicts between aircraft. The central controller precomputes trajectories for all aircraft before flight, typically by formulating the problem in an optimal control framework and solving the problem with various methods; examples are: semidefinite programming <cit.>, nonlinear programming <cit.>, mixed-integer linear programming <cit.>, mixed-integer quadratic programming <cit.>, sequential convex programming <cit.>, second-order cone programming <cit.>, evolutionary techniques <cit.>, reinforcement learning <cit.>, and particle swarm optimization <cit.>. One common thread among centralized approaches is that to pursue a global optimum, they must consider each aircraft and obstacle in space, leading to scalability issues with a large number of aircraft and obstacles. In addition, as new aircraft enter the scene, centralized algorithms typically need to recompute part or all of the problem to arrive at a new global optimum. On the other hand, decentralized methods scale better with the number of aircraft and objects in the system but typically cannot obtain globally optimal solutions. Furthermore, decentralized methods may be more robust than centralized approaches <cit.> because they are not generally prone to a single point of failure. In decentralized systems, each aircraft resolves conflicts locally, and the underlying method can be considered either cooperative or non-cooperative. Computational scalability and solution quality or optimality are significant design trade-offs between centralized and decentralized trajectory planning strategies. In <cit.>, we proposed a Markov Decision Process (MDP) based decentralized UAM trajectory planning algorithm that is highly scalable. The algorithm operates in a free-flight manner. This study is extended by incorporating an online safety verification module that enables the trajectory planner to generate safe trajectories. From a safety verification standpoint, trajectory planning of autonomous systems has recently been studied in two main directions: design-then-verify and verify-while-design. Design-then-verify is a commonly used approach where the task of trajectory planning is performed first; then, the system is evaluated using different verification tools to determine whether it satisfies the safety requirements <cit.>. However, this approach is computationally inefficient and often fails to give the necessary guarantees <cit.>. On the other hand, the verify-while-design approach, also known as correct-by-construction, integrates the verification process into the control design in a closed-loop manner <cit.>. Thus the approach becomes computationally efficient and enables the system to satisfy the safety requirements by its very nature. In this study, we adopted the verify-while-design approach to synthesize each aircraft's trajectory online formally. An efficient reachability analysis module that explores all possible behaviors of an aircraft has been used to satisfy the reach-avoid property of the system. Several reachability analysis formulations of a dynamical system have been proposed in the literature. These methods include Hamilton-Jacobi-based reachability analysis formulations <cit.>, CORA <cit.>, SpaceEx <cit.>, and Flow^* <cit.>. Although these approaches provide formal soundness guarantees, they are computationally expensive. Hence, they can not be used online in the presence of many aircraft. In this study, to over-approximate the reachable set of an aircraft, we implemented a sensitivity analysis-based approach from DryVR <cit.>. DryVR has been demonstrated to be highly scalable and recently implemented in <cit.> to generate a safe operation volume for unmanned aircraft systems (UAS) traffic management. The reachability analysis module, then, is integrated with our previously developed MDP-based trajectory planner <cit.> to guide the motion of multiple UAM vehicles between vertiports. §.§ Overview of the Paper We presented a preliminary version of this paper at the AIAA Aviation 2022 conference <cit.>. The contribution of this paper is threefold. First, we formulate the safe multi-agent trajectory planning problem using a reachability analysis module and an MDP-based decision-maker. To achieve overall system scalability, highly scalable approaches have been employed for both components. Second, we propose a reward-shaping mechanism that enhances the safety properties of the trajectory planner by modifying the properties of its reward function. Third, we propose an action shielding strategy that further enhances the safety properties of the system by filtering out actions that lead to unsafe states. This paper is organized as follows: In Section <ref>, we reviewed previous works related to the problem at hand. Section <ref> outlines the problem, and section <ref> presents the mathematical formulation of the two main components, the MDP and reachability analysis. We also provide an overview of the proposed trajectory planning framework, including the role of each component in the trajectory planning procedure. In Section <ref>, we discuss the implemented UAM scenario and present the results for the nominal trajectory planner (without any safety reinforcement) and the two other approaches proposed to improve the safety of the trajectory planner, namely, action shielding and reward shaping. Finally, in Section <ref>, we provide the conclusion of this work. § PROBLEM FORMULATION §.§ Problem Description This study aims to address the problem of developing a UAM trajectory planning framework that is computationally efficient and guarantees the safe navigation of UAM aircraft. As shown in Figure <ref>, the two main components of the proposed framework are the MDP-based trajectory planner and a reachability analysis module, which the trajectory planner utilizes to gather information about the future states of the aircraft. The approaches we used to formulate the trajectory planning problem and compute the reachable sets of the aircraft are proven to be highly scalable <cit.><cit.>. Adopting such formulations makes the developed UAM trajectory planning framework computationally efficient. Furthermore, the algorithm allows each aircraft to make its own decisions in a distributed manner using inputs from sensors such as radar, LIDAR, or systems such as ADS-B. §.§ Aircraft Dynamics The aircraft model used in this paper is based on a 6-DOF kinematic guidance model formulation proposed in <cit.>. The original guidance model contains certain wind-related parameters. However, since we are not considering the presence of wind in this study, we used a simplified model given in Equation <ref>, where x, y, z are north, east, and down velocities of the aircraft with respect to the inertial reference frame. γ is the flight-path angle, and V is the speed of the aircraft. ϕ, χ, and ψ represent the roll, course, and heading angles, respectively. b_γ, b_V, and b_ϕ are positive constants that depend on the implementation of the autopilot and the state estimation schemes. The superscript ^c as in γ^c, V^c, and ϕ^c denotes the commanded values given to the autopilot. x = V cosψcosγ y = V sinψcosγ z = V sinγ χ = g/Vtanϕcos(χ - ψ) γ = b_γ (γ^c - γ) V = b_V (V^c - V) ϕ = b_ϕ (ϕ^c - ϕ) § METHODOLOGY §.§ Markov Decision Process Formulation In this paper, we formulate the aircraft trajectory planning problem as a Markov decision process (MDP), where the state transitions will be governed by the vehicle dynamics described in Section <ref>. MDPs are formulated as the tuple (s_t,a_t,r_t,t) where s_t ∈ S is the state at a given time t within the state space S. a_t ∈𝒜 denotes the action taken by the agent at time t from the action set 𝒜. r_t is the reward received by the agent as a result of taking action a_t from s_t and arriving at s_t+1, and T(s_t, a, s_t+1) is a transition function that describes the dynamics of the environment and capture the probability p(s_t+1\|s_t, a_t) of transitioning to a state s_t+1 given the action a_t taken from state s_t. A policy π can map each state s ∈ S to action a ∈𝒜. From a given policy π∈Π, a value function V^π(S) can be computed that represents the expected return that will be obtained within the environment by following the policy π. The solution of an MDP is the optimal policy π^, which defines the optimal action a^* ∈𝒜 that can be taken from each state s ∈ S to maximize the expected return. From this optimal policy π^, the optimal value function V^(s) can be computed, which describes the maximum expected value obtained from each state s ∈ S. Furthermore, from the optimal value function V^(s), the optimal policy π^ can also easily be recovered. §.§.§ State Space The environment is a continuous state space placed on a spherical volume of 15km radius. Given the dynamics of an aircraft: ζ̇(t) = f(ζ(t),u(t)), where, f: ℝ^n ×ℝ→ℝ^n is a continuous function. ζ denotes the aircraft states, which includes the x,y,z positions, heading angle ψ, the flight path angle γ, the course χ, the roll angle ϕ, and the speed V. The trajectory of an aircraft ξ: ℝ^n ×ℝ_≥ 0→ℝ^n is the solution to the differential equation (<ref>). It represents how the state variables of the aircraft evolve through time. For a given initial set x_0 ∈ℝ^n, the state of the system at time t is ξ(ζ_0,t) = ζ(t). The control input u(t) is comprised of the thrust n_x, the rate of change of angle of attack α, and the rate of change of the roll angle ϕ. In addition, a single state in the state space (s_o) contains all the states of an aircraft (ζ) and the states of every other aircraft denoted as f_j, ∀ j ∈ J, where J represents a set containing all aircraft in the system except the ownship. Thus, we can define s_o as s_o = [ζ, f_1, ..., f_j]. §.§.§ Action Space The action space of the MDP is composed of the individual action spaces of the three inputs: the commanded flight-path angle (γ^c), the commanded roll angle ϕ^c, and the commanded airspeed (V^c). The action space of V^c is composed of 10 linearly spaced discrete values between 25m/s and 70m/s. The minimum speed of 25m/s is chosen based on the stall speed performance of the aircraft <cit.>. On the other hand, the action spaces of γ^c and ϕ^c are discrete sets of actions sampled from a logarithm function through the range of each input. Such an action space enables one to take more control actions when the inputs are near zero, and coarse control actions as the aircraft gets further away from its trajectory. As a result, fine control actions can be taken when a small correcting action to adjust small deviations from the trajectory is desired, and large control actions can be taken when a significant change in the course of the aircraft trajectory is desired. Consequently, the inputs of γ^c and ϕ^c are logarithmically spaced within a range of 15 input values. The logarithmically spaced input set in degree is computed as follows: γ^c = [-19.99, -16.24, -12.66, -9.26, -6.02, -2.94, -0.01, 0, 0.01, 2.94, 6.02, 9.26, 12.66, 16.24, 19.99] ϕ^c = [-19.99, -16.24, -12.66, -9.26, -6.02, -2.94, -0.01, 0, 0.01, 2.94, 6.02, 9.26, 12.66, 16.24, 19.99] Finally, the joint action space becomes: 𝒜 = {γ^c, ϕ^c, V_a^c }. §.§.§ Reward Function The reward function is the primary mechanism we use to control the behavior of an MDP agent's behavior. A reward function R(s_t,a_t,s_t+1) represents the reward that an agent, currently at s_t, collects after taking a control action a_t and arriving at s_t+1. In this work, we have utilized both positive and negative rewards, as depicted in Table <ref>, to guide the aircraft to their destination while avoiding possible collision with other nearby aircraft. A negative reward function that scales linearly inside the reach set of the intruder aircraft is employed instead of a constant negative reward value to prevent closer proximity between aircraft. §.§.§ Value Function Once the MDP is formulated as a tuple of (s_t,a_t,r_t), we need to solve the formulated MDP to arrive at the optimal solution. The state-value function (V(s)) is used to determine the expected reward at each future state, allowing for selecting the optimal state. The specific value function structure adopted from <cit.> is defined for deterministic terminating MDPs. The methods and proofs for computing the state-value function are detailed in the full paper; only a summary of the computation process is presented here. V(s) = V^+(s) + V^-(s), where V^+(s) and V^-(s) are the state-wise positive and negative value functions, respectively. V^+(s) and V^-(s) are defined as follows: V^+(s) = imaxP_i^+(s), ∀ i = {1, … , N^+ }, V^-(s) = jminP_j^-(s), ∀ j = {1, … , N^- }, where P_i^+ and P_j^- are the positive and negative peaks created by a reward source R_i and are computed as: P^+_i(s) = κ^δ(s,s_i)· r_i and P^-_j(s) = κ^δ(s,s_i)· r_i, where, κ is the discounting factor and δ(s,s_i) is the distance between the current state s and the reward source s_i. §.§ Reachability Analysis One of the critical components of the present trajectory planning scheme is computing a reachable set for each nearby intruder aircraft. In this study, the concept of discrepancy function is adopted from <cit.> to formulate the reachability analysis problem. This section summarizes discrepancy functions and how they can be used to compute the reachable set of a dynamical system. A discrepancy function is a continuous function primarily used to measure the convergence or divergence nature of trajectories formally <cit.>. Hence, it generates the over-approximation of the reachable set by providing the upper and lower bounds of the trajectories. In <cit.>, it has been demonstrated that discrepancy functions are generalizations of other well-known proof certificates, such as Contraction metrics and Incremental Lyapunov functions. A discrepancy function β: ℝ^n ×ℝ^n ×ℝ_≥0→ℝ_≥0 has two requirements: * β upper bounds the distance between the trajectories, ‖ξ(ζ_0,t) - ξ(ζ'_0,t) ‖≤β(ζ_0,ζ'_0,t), where, ξ(ζ_0,t) and ξ(ζ'_0,t) represent any pair of trajectories with initial conditions ζ_0 and ζ'_0, respectively. * β converges to zero as the initial states of the trajectories converge. for any t, as ζ_0 →ζ'_0, β(·,·,t) → 0. The first requirement expresses β as a function of the initial conditions of any two trajectories and the elapsed time. It upper bounds the distance between the trajectories at any time so that every possible state of the system is represented in the reachable set. On the other hand, the second requirement is used to keep the over-approximation error low. There are methods developed in the literature to compute β from differential equations <cit.>. However, in this study, we use a tool known as DryVR <cit.> that formulates the problem of finding the discrepancy function as a problem of learning linear separator to achieve high computational efficiency. The learning linear separator approach does not depend on the system's dynamics and uses a few simulations to arrive at a discrepancy function with probabilistic correctness guarantees. The discrepancy function adopted in DryVR is an exponential function that grows and shrinks with time and has a general form: β( u,v,t) = ‖ u - v ‖ Ke^γ̂ t, where K and γ̂ (we write γ̂ to distinguish from γ, which is the flight path angle) are constants that govern the behavior of the exponential function, and we learn them using the learning linear separator approach. Considering Equation (<ref>) and the first requirement of a discrepancy function in Equation (<ref>): ‖ξ(ζ_0,t) - ξ(ζ'_0,t)‖≤‖ζ_0 - ζ'_0 ‖ Ke^γ̂ t, ∀ t ∈ [0,T]. Equation (<ref>) can be rearranged by taking logs on both sides as: ln‖ξ(ζ_0,t) - ξ(ζ'_0,t)‖/‖ζ_0 - ζ'_0 ‖≤ln K + γ̂ t, ∀ t ∈ [0,T]. The above inequality has a general structure of: μ≤ aν + b, ∀ (μ,ν) ∈Γ. where for Γ⊆ℝ×ℝ, a pair (a,b) is a linear separator and (μ,ν) represents ( ln‖ξ(ζ_0,t) - ξ(ζ'_0,t)‖/‖ζ_0 - ζ'_0 ‖,t ) in (<ref>). Therefore, the learning task is identifying the (a,b) values from sampling points that make the inequality in (<ref>) a linear separator for the large portion of points in Γ. The sampling points are assumed to be drawn based on unknown distribution 𝒟. The probabilistic algorithm provided in Algorithm <ref> has been proposed in <cit.> to identify the appropriate values of (a,b). The separator discovered by the above algorithm has a correctness guarantee with high probability. The proof can be obtained in <cit.>. To minimize the conservative nature of the discrepancy function, we adopt a piece-wise exponential discrepancy function of the form β(ζ_0,ζ_0',t) = ‖ζ_0 - ζ'_0 ‖ Ke^∑_j=1^i-1γ_j(t_j - t_j-1) + γ_i(t - t_i-1) from <cit.>. This enables us to divide the time window for the reachable set into several smaller segments and find discrepancy parameters for each segment, resulting in less conservative reachable bounds. The procedure to over-approximate the reachable set of an aircraft is outlined in Algorithm <ref>. The inputs to the algorithm include the aircraft dynamics, the action set 𝒜, the initial states of the aircraft ζ_0, and the time horizon T. The algorithm then generates trajectories by randomly choosing from the set of control actions. It then computes the maximum pair-wise distance between the initial states and each trajectory using Chebyshev distance and gets the sensitivity parameters for each time step (μ(t) and ν(t)). The convex hull of these parameters is then determined, and the values a and b are obtained, which represent the discrepancy function K and γ̂. Figures <ref> to <ref> show how a reachable set of aircraft can be over-approximated by simulating several trajectories from the current state. Figures <ref>, <ref>, and <ref> depict the reachable sets of x, y, and z states of the aircraft, respectively. Figure <ref>, <ref>, and <ref> show the projections of the reach-tube of an aircraft on different planes. Figure <ref> illustrates the overall operational procedure of the proposed trajectory planner. As shown in the figure, the framework first assigns initial and goal states for each aircraft in the system. Subsequently, for each aircraft, it identifies the positive and negative reward sources as discussed in <ref>. After the reward sources are identified, it forward projects the future states of the aircraft using the action sets and computes the values of each future state using the value function as given in Equation <ref>. The best action yielding the maximum total reward is then selected, and the states of the aircraft are updated using the chosen control action. This process is repeated iteratively for each aircraft until each aircraft reaches its designated destination vertiport. §.§ The Proposed Trajectory Planning Framework The detailed working procedure of the trajectory planning is provided in Algorithm <ref> and the schematic diagram in Figure <ref>. Here, we highlight the two main modules: Reachability Analysis and Trajectory Planner. Trajectory Planner: The proposed framework works in a decentralized manner, where each aircraft will be responsible for choosing a control action that satisfies the reach-avoid property defined below. To achieve this, it first forward projects the future states of an aircraft using the dynamics of the aircraft and the control actions provided in the action space. Then, it computes the positive and negative rewards for the projected states and picks the control action that maximizes the total reward. Reachability Analysis: While building the negative rewards, the framework considers the reachable sets of nearby intruder aircraft and the terrain around the aircraft. The algorithms discussed in section <ref> will be utilized to compute the reachable sets. Reach-avoid property: For an aircraft starting from an initial state ζ(0), we say the reach-avoid property is satisfied if and only if its trajectory ζ(t), (1) never enters into an unsafe set 𝒮_u, and (2) reaches a goal set 𝒮_g within a finite time horizon T. These two conditions can be expressed mathematically as follows: ( ∀ t ∈ 0≤ t ≤ T, ξ(ζ(0),t) ∩𝒮_u = ∅) ⋀ (∃ t 0≤ t≤ T, ξ(ζ(0),t) ∩𝒮_g ≠∅) In the above equation, the unsafe set 𝒮_u is composed of the reachable sets of nearby intruders and the terrain. Theorem 1: Consider aircraft i has access to other nearby intruder aircraft's dynamics and current states. In addition, consider aircraft i has information about the environment's terrain. Then, aircraft i can choose a control action from the action space 𝒜 for its next state that is guaranteed to satisfy the reach-avoid property given in Equation <ref>. Proof: Consider the reach-avoid property is not satisfied for aircraft i. Such an assumption entails that either the aircraft has entered an unsafe state 𝒮_u, or it is not progressing to its goal state 𝒮_g. However, because the reachable sets of nearby aircraft and the terrain information are accessible, it can choose a control action that enables the aircraft to avoid entering the reachable sets of nearby aircraft. In addition, since the MDP-based trajectory planner generates a reward that motivates the aircraft to move to its destination, aircraft i will always progress towards its destination. Hence, Theorem 1 is true by contradiction. § RESULTS AND DISCUSSION In this section, the performance of the proposed method is discussed. Since the objective of this paper is to develop a safe and scalable UAM trajectory planning framework, the two criteria we used to evaluate the performance of the proposed algorithm are mean computational time and the number of Near Mid Air Collisions (NMAC). Mean computation time, which is the time taken in each step by the algorithm to compute the safe trajectory for a single aircraft, demonstrates the computational efficiency of the method. On the other hand, NMAC, defined as a loss of 152 meters of horizontal and 30 meters of vertical separation <cit.>, is used to evaluate the ability of the algorithm to guide the aircraft and avoid collisions. §.§ Scenario Description A snapshot of the simulation environment we used to evaluate the performance of the trajectory planning framework is shown in Fig <ref>. The simulation defined a geographical bounding box that encompasses a volume of 15km radius. The aircraft are assigned to take off from their origin vertiports and fly to destination vertiports located on the opposite side of their origin. The environment is configurable to accommodate a variable number of vertiports and aircraft, which utilize the proposed trajectory planning framework in a distributed manner. In reference to the designed scenario, it is important to note that, as depicted in Figure <ref>, all aircraft are scheduled to travel through a central location in the environment. This scenario, although unlikely to occur in a typical UAM setting, serves as a means to evaluate the detect-and-avoid (DAA) capabilities of the system under adverse conditions where strategic deconfliction fails. We present experimental results on a different number of aircraft assigned to fly to their designated goal states. The algorithm utilized in these experiments has been implemented using MATLAB. Additionally, a video demonstration showcasing the results of the algorithm for 8[https://youtu.be/9ycsue5bhb4], 16[https://youtu.be/inyiLlfCNns], and 32[https://youtu.be/iqxr-0Zkh3Q] aircraft can be viewed on YouTube. All experiments were conducted on a 3.20 GHZ Intel Xeon (R) CPU with 125.4 GB RAM. Each experiment was repeated 25 times for each aircraft number, with randomly generated initial locations for the aircraft. The computational time and NMACs for each aircraft number are reported. The experimental results demonstrate the effectiveness of the proposed trajectory planner in guiding the motion of each aircraft from its initial position to its assigned vertiport. Tables <ref> and <ref> present the trajectory planner's NMAC and computational time performances of the trajectory planner. As shown in Table <ref>, the mean computational time of the framework increases as the number of aircraft in the system increases, but it grows in a polynomial order with the increased number of aircraft, indicating the scalability of the approach. Table <ref> also presents the throughput performance of the algorithm, defined as the amount of time taken to guide each aircraft in the system to its assigned vertiport successfully. On the other hand, despite utilizing a formal verification scheme based on reachability analysis, as indicated in Table <ref>, there were instances of NMACs observed in the environment as the number of aircraft increased. This is primarily due to the fact that the MDP formulation converts hard constraints, such as collisions, into benign conditions represented by negative rewards. As a result, in congested environments, there may be instances of momentary violations of safety constraints. In the subsequent sections, we will discuss the methods employed to address this issue. §.§ Action Shielding One potential solution to the challenge of enforcing hard constraints on an MDP agent is through the implementation of action shielding <cit.>, in which the agent's actions are filtered through a mechanism that blocks actions that result in unsafe states, as shown in Figure <ref>. The value of states is utilized to filter out actions that lead to unsafe states. Specifically, if the value of a state resulting from a certain action is negative, the shield will eliminate the action from the set of valid actions. However, in instances where all control actions lead to unsafe states, this technique results in a deadlock as all actions are blocked. To circumvent this scenario, we propose an alternative control action for a short time horizon. It is worth noting that this approach may result in violations of state constraints imposed for passenger comfort, as safety is given priority over comfort. As such, the new control action set (in degree) to be implemented during a deadlock will be: γ^c = [-180, -139.5, -99, -58.5, -18, 18, 58.5, 99, 139.5, 180] ϕ^c = [-180, -139.5, -99, -58.5, -18, 18, 58.5, 99, 139.5, 180] Tables <ref> and <ref> present the performance of the trajectory planner with the added enhancement of action shielding with regard to the number of NMACs and computational time, respectively. As shown in Table <ref>, it is evident that the addition of action shielding has resulted in a significant improvement in the safety performance of the trajectory planner. However, as demonstrated in Table <ref>, the change in the computational time is minimal. §.§ Reward Shaping Many existing techniques in the literature address the issue of undesirable behavior exhibited by MDP agents through the use of reward engineering or reward shaping. Reward shaping refers to the process of modifying the reward received by the agent to elicit desired behavior, as outlined in <cit.>. In other words, instead of using the traditional MDP M = (S,A,T,κ, R), we use a transformed MDP M' = (S, A, T,κ, R'), where R' = R+F is the reward function in the transformed MDP, and F: S × A × S → R is a bounded real-valued function known as the reward-shaping function. The specific reward shaping function employed in this study is a difference of potentials F(s,a,s') = Φ(s') - Φ(s), where Φ is the value function over states <cit.>. F(s,a,s') = κ(V^(s')) - V^(s), where, κ is the discount factor and V^(s') and V^(s) are the values of the current and future states. Tables <ref> and <ref> present the performance of the trajectory planner with the enhancement of reward shaping in terms of the number of NMAC and computational time, respectively. From Table <ref>, we can see that the reward shaping technique has led to a superior improvement in safety performance when compared to the action shielding technique. However, the impact on computational time is negligible. A performance comparison of the three proposed methods is shown in Figure <ref>. The results, as depicted in Figure <ref>, indicate that the baseline trajectory planner, which does not utilize any reinforcement techniques, exhibits poor safety performance. In contrast, the trajectory planner utilizing reward shaping demonstrates the best performance. While the implementation of action shielding improves the performance of the baseline trajectory planner, it still falls short in comparison to the trajectory planner utilizing reward shaping. Figure <ref> illustrates the computational time performance comparison of the proposed methods, where it is evident that the differences in performance are minimal. §.§ State Constraints This study also incorporates constraints on certain aircraft states, as presented in Table <ref>, to approximate the operation of air taxis and ensure passenger comfort. These constraints restrict the aircraft from performing maneuvers that may cause discomfort to passengers. Additionally, a constraint on velocity has been imposed to avoid operation below the stall speed of the aircraft. The state trajectories of an aircraft are presented in Fig <ref>. It can be observed from the figure that the state trajectories of the aircraft consistently adhered to the imposed constraints throughout the operation of the aircraft. § CONCLUSION This study proposes a safe and scalable trajectory planning framework for urban air mobility (UAM) systems. The proposed framework operates in a decentralized manner, allowing each aircraft to independently plan its trajectory based on information about its surrounding environment. The framework employs a Markov Decision Process (MDP)-based trajectory planner and a data-driven reachability analysis module to synthesize each aircraft's trajectory in real-time. To enhance safety performance, techniques such as reward shaping and action shielding have been explored to be included in the overall framework. The effectiveness of the framework has been evaluated through simulations involving up to 32 aircraft in UAM scenarios, and the results demonstrate the computational efficiency and safe operation of the trajectory planner. Future research will aim to optimize the quality of the generated trajectories, such as reducing flight time and energy consumption. § ACKNOWLEDGMENTS This project is partially supported by NASA Grant 80NSSC21M0087 under the NASA System-Wide Safety (SWS) program.
http://arxiv.org/abs/2306.04048v1	20230606223400	Finite Element Modeling of Pneumatic Bending Actuators for Inflated-Beam Robots	[ "Cosima du Pasquier", "Sehui Jeong", "Allison M. Okamura" ]	cs.RO	[ "cs.RO" ]	Inflated-beam soft robots, such as tip-everting vine robots, can control their curvature by contracting one side of the beam using pneumatic actuation. In this work, a general finite element modeling approach is developed and applied to characterize bending of inflated-beam soft robots. The model is tested on four types of pneumatic actuators used in these robots (series, compression, embedded, and fabric pneumatic artificial muscles) and can be extended to other designs. Actuators rely on two types of bending mechanisms: geometry-based contraction and material-based contraction. Geometry-based contraction implies shape-change of the muscles from a flat to an inflated shortened configuration that causes buckling of the inflated beam. Material-based contraction relies on material anisotropy to produce a contraction effect. The model depicts both mechanisms and accommodates for the complex and highly nonlinear effects of buckling and anisotropy. Simulation results are verified experimentally for each actuator type at three working pressures (10, 20, and 30 kPa). Geometry-based contraction achieves the largest deformation at accuracy values of 92.1% and higher once the buckling pattern is established, and 80.7% and higher for lower pressures due to the stress singularities occurring with buckling formation. Material-based contraction achieves smaller bending angles but is at least 96.7% accurate. The models are freely available http://www.vinerobots.orgonline, and can thus be used by others to design inflated-beam robots, such as tip-everting vine robots. Labor and material waste can be reduced with this tool by optimizing designs that use knowledge of material properties and stress to distributions to enable bending and manage stress peaks. Inflated-Beam Robots, Pneumatic Actuation, Explicit FEA, Anisotropic Material Model Finite Element Modeling of Pneumatic Bending Actuators for Inflated-Beam Robots Cosima du Pasquier, Sehui Jeong, and Allison M. Okamura, Fellow, IEEE July 31, 2023 ========================================================================================= § INTRODUCTION § INTRODUCTION Soft robotic systems are developed and adopted for safe physical interaction with complex or delicate environments. In contrast to to their rigid counterparts, control of soft robots is achieved through embedded design features, such as actuators or pleats, that inherently link form to function <cit.>. Typically, lengthy iterative experimentation has been used to refine the design features of soft robotics. However, finite element (FE) modeling and analysis have been shown to support automated design optimization and performance prediction, significantly reducing the material and time cost of building a new soft robot while ensuring that it operates within safe and reliable limits <cit.>. Inflated beam robots (IBRs) are a class of soft robots that use pressurized textile or plastic sleeves to achieve a range of shapes and access constrained or cluttered environments <cit.>. They possess a large number of degrees of freedom (DoFs) that can be controlled through pleats <cit.>, internal devices <cit.>, tendons <cit.>, and pneumatic actuators <cit.>. Tip-everting inflated beam robots, also called vine robots, are a subclass of IBRs in which the beam wall material is initially inverted inside the robot.Pressure-driven eversion causes the vine robot to “grow”, extending its tip while the beam wall is stationary relative to its environment. This is advantageous for applications with delicate environments to be navigated via tortuous paths, like surgery, search and rescue, and archaeology <cit.>. However, mechanisms to control beam bending are constrained by the limited space within the sleeve and by the eversion process. This has motivated the design of a range of pneumatic actuators placed on the beam surface. These actuators can be stowed flat during eversion and then inflated to control the deployed beam’s shape <cit.>. Past work on modeling of pneumatic actuators for bending IBRs has focused on kinematics and relied on geometrical approximations of volume change, virtual work, and conservation of energy <cit.>. These models only offer a rough approximation of the deformed center axis of the IBR. Pneumatic actuators rely either on geometry-based contraction or material-based contraction to generate bending. Geometric contraction causes distributed buckling throughout the beam, a complex process sensitive to small fluctuations in pressure that is dependent on the material and stress distribution in the beam, two qualities missing from kinematic modeling. Material-based contraction relies on material anisotropy that entirely depends on shear stress distribution, which is also not captured by kinematic modeling. Thus, existing models can only approximate deformation through iterative parametric tuning based on experimental data, which requires time-intensive prototyping and testing procedures. Each change in design or material requires a new tuning process. In contrast, finite element modeling (FEM) captures internal forces, strains, and stresses, and can predict both buckling and anisotropy. Although FEM requires initial material characterization and mesh refinement as part of the model setup, it can then accommodate changes in geometry and material. Exterior loads, such as those encountered when interacting with an object in the environment, can be seamlessly integrated into the same model. In this work, we propose the first general FE framework for predicting the deformation of pneumatically actuated IBRs, encompassing both buckling and anisotropy bending mechanisms. The constitutive models for quasi-isotropic and inextensible materials used for buckling and anisotropic extensible materials used for anisotropy are integrated into the FE software Abaqus CAE <cit.>. By utilizing Dynamic, Explicit[Abaqus CAE-specific functionalities are capitalized and italicized throughout the text.] FE analysis, our data-driven model predicts deformation in IBRs for four main types of pneumatic actuators: series, compression, fabric, and embedded pneumatic artificial muscles (sPAMs <cit.>, cPAMs <cit.>, fPAMs <cit.>, ePAMs <cit.>). sPAMs are also refered to in literature as series Pouch Motors, so we refer to them here as sPAMs/PMs <cit.>. We provide the FEA models freely http://www.vinerobots.orgonline (http://www.vinerobots.org). The models can be modified to simulate and verify the bending modes of other pneumatic actuators for IBRs, to streamline their design and fabrication. This paper is organized as follows: first, we describe the material mechanical characterization protocol and the benchmark experimental bending protocol for the four types of actuators. Then, we explain the assumptions for the FE model to efficiently mimic the experimental setup. We define the comparison metrics and error calculations used to establish the validity of the FE models. Next, we present the experimental and simulation bending results and discuss the validity and robustness of our approach. Finally, we discuss the results in the wider context of pneumatic actuation of IBRs. §.§ Background §.§.§ Modeling of Deformation in Pneumatically Actuated IBRs Controlling an IBR with pneumatic actuators is more complex than with other mechanisms such as internal devices <cit.> or tendons <cit.> because the relationship between actuation and shape cannot be directly extrapolated from finite orientation or length changes. Differences between the bending mechanisms of pneumatic actuator types also influence how they are modeled. Pneumatic actuators shorten a side of an IBR to generate bending, which can be achieved in two ways: through geometry-based contraction, where the transition from flat to 3D inflated configurations shortens the actuator, and through material anisotropy, where the inherent material properties cause the actuators to shorten. The sPAM/PM, cPAM, and ePAM bending actuators all bend through geometry-based contraction. In the literature, they are typically modeled using conservation of energy and principle of virtual work <cit.>. The analytical models describe the geometric changes of the actuators as they inflate, and equate the work done by the pressure to that of the virtual translation or contraction. They assume material inextensibility, constant curvature, and idealized linear spring behavior. Niiyama et al. <cit.> and Greer et al. <cit.> model sPAMs/PMs separately from the IBR body and for low pressures. Kübler et al. <cit.> model sPAMs/PMs and cPAMs including curvature and show promising results, but the accuracy varies with actuator dimensions. Abrar et al. <cit.> model bending of ePAMs, but the model and the experimental data differ significantly. fPAMs achieve bending through material anisotropy. Naclerio and Hawkes <cit.> model the actuator contraction by relating increase in pressure to increase in volume, based on existing models for McKibben muscles. Ultimate tensile strength is used to determine maximum pressure and maximum actuator contraction. The model performs very well for pure linear displacement of isolated actuators. Kübler et al. <cit.> extend the model to bending by including the reaction forces between the IBR and the actuators in the equilibrium equations. For both geometry-based contraction and material-based actuator contraction, the analytical models are actuator-specific and are tuned using experimental data. They do not provide stress and strain fields in the IBR, and thus are purely geared towards shape prediction and do not consider the full range information required for actuator design and fabrication. §.§.§ Static vs. dynamic FEA of thin-walled structures The body of an IBR is a thin-walled cylindrical shell. The actuators on or in the body surface generate asymmetric lateral loading, which in turn causes the cylinder to bend through buckling. This specific scenario has not been documented in literature for FE analysis, but there is a body of literature concerning loading of thin-walled cylindrical shells under uniform lateral pressure <cit.>. There are two methods to solve dynamic buckling FE problems with ABAQUS: Standard and Explicit. They use two different approaches to solving the general equilibrium equations in a structure: 𝐌ü + 𝐃𝐮̇ + 𝐊𝐮 = 𝐅, where M is the mass matrix, D is the damping matrix, K is the stiffness matrix, F is the external load vector, and u is the nodal displacement vector. ABAQUS/Standard solves the equations implicitly using the Newton-Raphson method to iteratively converge towards a stable solution. The solution at time step t + Δ T depends on the solution at time step t, and the process requires for K to be recalculated at each step for the newly deformed structure. ABAQUS/Explicit integrates the general equilibrium equations using the central difference formula at time step t directly from the previous time step without iterating towards an equilibrium. This approach is inherently less stable than ABAQUS/Standard, so the time step size needs to be adjusted to ensure correct results. A solution is considered valid if the kinetic energy of the system stays beneath 10% of the total internal energy <cit.>. Comparative studies have used both methods to model the buckling of thin-walled cylinders and have found that ABAQUS/Explicit achieves the same level of accuracy but at a fraction of the computational effort <cit.>. We will thus use the Explicit approach to model the effect of bending actuators on IBRs. § METHODS In this section, we introduce the modeling approach and parameters for the FE model of IBRs that is derived from previous work modeling thin-walled structures. We explain the materials used for each actuator, and include the data acquisition methods used to estimate the constitutive material models. Then, we outline the actuator designs, assembly methods, and experimental protocol to evaluate their performance. §.§ FE Model for IBRs An FE model was built using Abaqus CAE Explicit to predict the deformation and reaction forces within the IBRs and respective actuators. The Dynamic, Explicit step was used since the IBR bending mechanism relies primarily on buckling, which is not captured by Quasi-Static, Standard steps. For computational efficiency, the IBR and actuator models were defined as shells of thickness 200 m and 50 m for the TPU-coated and silicone-coated fabrics, respectively. In all four cases, the IBR and actuator mesh sizes were 4 mm and 1 mm respectively, which represents roughly 1% of the IBR length and 1.7% of a single actuator length. These sizes were chosen for their relative convergence accuracy and computational efficiency. The model for the cPAM and ePAM actuators was built using Tie constraints at all the surfaces that were welded, and the sPAM/PM was built using the same Tie constraints for both welded and glued surfaces. For the fPAM, since the material and the glue have different elastic properties, the glued surface was modeled as a Composite surface combining the silicone-coated Nylon material properties and those of the glue. General Contact was defined to avoid collisions, and a 0.01 mm gap was introduced in between the IBR and actuator layers to allow the model to start without collision ambiguity. A maximum pressure of 2kPa was applied to the IBR, and a maximum pressure of 10, 20, and 30 kPa was applied to all actuator interiors. The IBR pressure was applied in the first 0.1 seconds and then held, then the actuator pressures were applied for the remaining 1 second using two distinct Smooth Amplitudes. The total time of 1.1 seconds was chosen to minimize computational effort while keeping the kinetic energy of the model under 1% of the total energy. To avoid inertial effect and to ensure that steady-state deformation has been reached, each maximum pressure is simulated separately. Both Pinned and Encastered boundary conditions (BCs) were tested. The change did not affect the results, so pinned BCs were applied to the final simulations. §.§ Material Characterization The sPAM/PM, cPAM, and ePAM all rely on geometric shape change for contraction, and thus require a sturdy inextensible material. We chose a 70D TPU-coated Ripstop Nylon because it easily bonds to itself when the coating is heated, which we achieve through ultrasonic welding, and it does not rip at the current working pressures. The fPAM relies on material anisotropy for contraction. We chose a silicone-coated Ripstop Nylon because of its proven anisotropic behavior in previous work <cit.>. The material properties needed for FEA were measured using uniaxial testing to break on an Instron 5565 under ASTM D882 measurement standard and rectangular test specimens. Five specimens were tested per material and per relevant orientation. The measured elastic moduli for the Nylon and the silicone fabrics are shown in Table <ref> for each orientation. In the experiments, the sPAM/PM, cPAM, and ePAM and their respective IBRs are all cut along the main axes of the textile (0^∘ and 90^∘). The Material Evaluation module on Abaqus CAE was used to fit the 0^∘ and 90^∘ uniaxial test data of the TPU-coated Nylon to the Reduced Polynomial hyperelastic constitutive model with N = 1, where U = C_10 (I̅ - 3), resulting in the following material parameters: C10 = 50.3, D10 = 0. The main axis of the fPAM is cut at 45^∘, because the actuation mechanism relies on anisotropy for the fPAM to contract and cause the IBR to bend. The anisotropic material properties of the silicone-coated Nylon were modeled using the built-in Fabric material model in ABAQUS/Explicit. Fabric is a data-based model that uses uniaxial test data along the fill and warp directions of a fabric, and its shear response. The experimental data acquired as described above was thus implemented directly into Abaqus for the fill and warp directions (0^∘ and 90^∘). The shear stress-strain curve was calculated by using the 45^∘ uniaxial test data as a bias-extension test data (a common alternative to the picture-frame test) <cit.>. At the center of the test specimens, the material is in pure shear and the shear angle is directly related to d, the displacement during the uniaxial test: γ = π/2-2 arccos(L_0+d/√(2L_0)), where L_0 is the initial specimen length. The shear force can be fit to uniaxial test data by relating it to the shear angle and d using the following equation: F_sh(γ) = 1/(2H-3W)cosγ( (H/W-1) · F ·. (cosγ/2-sinγ/2) -W · F_sh·(γ/2) ·cosγ/2. ), where H and W are dimensions of the sample along and across loading-direction respectively, and F is the external load applied during the uniaxial test. The fitting results are shown in Fig. <ref>. The model matches the 45^∘ test data well up to roughly 24% strain; values beyond that differ due to the assumption of thread inextensibility. Since the material is not strained beyond 24% in the fPAM tests, the model is valid. §.§ Actuator Designs and Mechanisms The IBR and actuator dimensions were chosen to be as similar as possible so the main differentiation between the four experiments is the actuation mechanism. The dimensions are given in Table <ref>, and the design, bonding method, actuation method, and physical prototypes are shown in Fig. <ref>. The fabrication steps followed previous work (sPAM/Pouch Motors <cit.>, cPAM <cit.>, ePAM <cit.>, fPAM <cit.>). For the sPAM/PM and the fPAM, the actuators are fabricated separately from the IBR body and then attached using adhesive transfer tape (3M, Saint Paul, Minnesota, United States) and Silpoxy adhesive (Reynolds Advanced Materials, Broadview, Illinois, United States) respectively. For the cPAM and the ePAM, the actuators are integrated on the surface of the IBR. The cPAMs are three layers of fabric selectively welded to create a form of origami pouch that unfolds under pressure. The ePAMs are created by selectively welding two parallel cylindrical IBR bodies into an actuation pattern. All four mechanisms are shown in the Front view of Fig. <ref>. §.§ Experimental Evaluation The experimental setup used to capture bending of the IBR and actuators is shown in Fig. <ref>. The control system, in Fig. <ref>A, is attached to a wall pressurized air inlet regulated manually to 100 kPa. The air is then split into two QB3 solenoid valves that regulate pressure through digital sensors placed close to the IBR and the actuators. A microcontroller (Arduino Uno) records the pressure measurements to the valves and controlled the valves based on a predetermined test sequence. An Intel Realsense D145 camera captures RGB and depth images, using a checkerboard for calibration. Six markers placed along the IBR and at the height of the middle of each actuator pouch are used to measure displacement. The data acquired by the camera is post-processed using Python and plotted using Matlab. Previous work showed that gravity has only a negligible effect on the measurements due to the light weight of the materials used in these experiments. The experimental and simulation setup are otherwise built to be as physically similar as possible. Each actuator type was tested using the protocol below: * IBR pressurized at 2 kPa * Actuator sequentially pressurized to 10, 20, and 30 kPa consecutively for 5 seconds each * Actuator depressurized for 5 seconds The 5-second duration for the inflation and deflation allow for the pressure in the actuators to achieve steady-state, which provides a more accurate reading of the pressure/displacement relationship. It is also close to what the FE procedure simulates, where each pressure is simulated and held to a threshold to avoid inertial effects. §.§ Metrics The finite element model and experimental displacement data are compared based on the XY-displacement of the markers. First, using a Path along the center line of the body of the IBR, the XY displacement coordinates vs. pressure are extracted from the output database (ODB) of the simulations. They are then plotted against the measured marker displacements at P = 10, 20, 30 kPa, using the pressures measured at the inlet for the actuators and the final simulation pressure. The accuracy is calculated as one minus the least square error between the marker positions (y_EXP) and the simulation displacement curve (y_FEA): a = 1 - 1/N_markers∑_n=1^N_markers( y_FEA - y_EXP/y_FEA)^2 § RESULTS AND DISCUSSION In this section, we first compare experimental and FEA results for individual actuators, then compare the actuators to each other. We discuss differences bending mechanisms, bending range, and their effect on the accuracy of the simulation. We discuss the FEA strategy and its implications for the results. Finally, we analyze how the FEA presented in this work contributes to the fields of IBRs and Soft Robotics in terms of design and control. The results for each actuator are shown in Fig. <ref>, and FEA accuracy values are given in Table <ref>. Starting with the sPAM (Fig. <ref>.A), the experimental and simulation data correspond very well, with a minimum accuracy of 94.3%. The actuators are external to the IBR body so their axis of contraction is further away from the IBR central axis, which in turn limits the bending radius. The actuator location also implies that the IBR cross-section is affected very little by bending. The stress peaks, very similar in location and magnitude to those of the ePAM, are at the weld seams. The buckling pattern is irregular compared to the cPAM and ePAM, which indicates that the effect of external actuators is less evenly distributed and limits the bending range. The cPAM (Fig. <ref>.B) exhibits the most displacement and strongest curvature. Embedded at the surface, the cPAMs are closer to the center axis of the IBR than the sPAMs and fPAM. The extra fold of fabric increases their expansion compared to the ePAMs, as signified by the actuator cross-section that has the largest actuator to IBR ratio. The effect of the folds is visible in the dual buckling pattern: one type of buckle appears in between the actuators, similar to the pattern of the ePAM, and the other at the actuator itself. The stress peaks are also at the weld lines, especially where four fabric layers connect. The FEA accuracy of the cPAM exceeds 97% for pressures over 20 kPa but sinks by 10% for lower pressures. The appearance of buckles causes stress singularities in the model. It is an inherently unstable mechanism that causes sudden large changes in bending. At 10kPa, when the buckling pattern is only partially formed, the deformation is unstable and very sensitive to small variations in pressure. To support this hypothesis, we show the cPAM deformation at 11, 12, and 13 kPa in Fig. <ref>. A pressure difference of 3 kPa increases the maximum vertical displacement by nearly 30%. Given that the experimental setup includes a margin of error for pressure control, this explains the lower accuracy at 10 kPa. The ePAM (Fig. <ref>.C) combines bending elements from the sPAM and cPAM. The deformed actuator shape is the same as the sPAM/PM, and, as for the cPAM, the actuators are embedded directly on the IBR and rely on a regular buckling pattern to deform. The displacement range of the ePAM thus lies between the two other actuator types. Since the bending mechanism is the same as the cPAM, the same stress singularities are found at low pressures (<20 kPa) and partially buckled states. Although the ePAMs are slightly less accurate than the cPAMs in our experiments, we should note that the fabrication of ePAMs is much more straightforward since it only involves welding two surfaces (no extra folds), and they can easily be combined on the IBR surface for 3D control. Finally, the fPAM (Fig. <ref>.D) has the smallest bending range of the four, given that the bending mechanism relies solely on material contraction and that the actuator axis is furthest away from the IBR center axis. However, the bending mechanism is the most stable, and the FEA corresponds to the experiments with over 96.7% accuracy for all pressures. The fabric model in Abaqus causes oscillations in the results that can be mitigated by controlling the simulation time step. The deformation amplitude is not affected, but the computational cost of the FEA increases with increasing time step. A judicious choice of time step and mass scaling will affect the run time and the oscillation frequency. We find that the oscillations always have the same amplitude, which corresponds to the experimental deformed state. One particularly important value for the FEA accuracy is the mesh size. It affects the deformation range of an actuator significantly, especially for the cPAM and ePAM that principally rely on buckling for bending. In preliminary work, we simulated all actuators with mesh sizes ranging from 0.7 to 4 mm. While the ePAM and fPAM were not particularly sensitive to the change, the accuracy of the cPAM and ePAM increased by nearly 20%. The finer mesh size translates to deeper and more complex buckling patterns, which in turn increases the bending radius. However, run times also increase exponentially with mesh refinement, so our final mesh size is a compromise of accuracy and efficiency. Depending on whether a user is aiming to qualitatively understand the deformation mechanism or needs quantitative information to, say, design an IBR for a specific trajectory, the emphasis can be shifted by manipulating the mesh size. Overall, the FEA results reported here are accurate, demonstrating that FEA is a promising tool for the design and deployment of IBRs. There are two differentiating factors between the actuators: the bending mechanism (geometry-based contraction or material-based contraction) and external or embedded actuator system. Combining geometric and embedded actuation yields the highest deformation range, but also the most buckling and inaccuracies for lower pressures. Material-based external actuation is the most accurate, but has the smallest range. These results can help roboticists decide on the most appropriate design for their case study. For example, if an IBR needs to follow a very tortuous path without interacting with its environment, the cPAM is the best choice. If an IBR needs to overcome only small obstacles and uses the actuator mechanism mostly to steer its tip, an fPAM would be easier to implement. The FEA approach is also an excellent tool to support IBR fabrication in general. The von Mises stress distribution can inform, for example, where a design is most likely to rupture. If the weld strength has been characterized, ruptures can be predicted and avoided through design or material changes, or by iterating on the weld parameters. Doing these iterations computationally rather than experimentally will save both time and materials, and reduce the length of the process significantly. No other IBR model published to date can provide this type of support, which is why we choose to make our model freely available online for others to use and to build on by, for example, including new types of actuators. An additional advantage of using FEA modeling in IBR design is that very long IBR models can be easily built and tested virtually. Where other models have focused on mimicking the deformation of an IBR in empty space, with FEA interactions with the environment can be modeled by including additional steps and timed external loads. By building an environment virtually, the choice of actuator and general design can be optimized for specific applications or experimental obstacles that the IBR might encounter. § CONCLUSION This work validates a new approach of modeling pneumatically-actuated inflated beam soft robots, or IBRs, using FEA. Thanks to its Dynamic, Explicit formulation, the FEA accurately represents complex buckling patterns and anisotropic material models and is applicable to both geometry-based bending and material-based bending mechanisms. The model converges accurately for the four main types of pneumatic actuators currently used with IBRs. A combination of buckling-based actuation and embedded actuator design result in the highest bending curve and deformation range. However, the stress singularities during buckling formation at lower pressures affect the model accuracy. Material-based deformation retains over 96.7% accuracy at all pressures, but has the smallest deformation potential. The FEA approach proposed in this work can be adapted to achieve qualitative and quantitative results that streamline different stages of the IBR design process. This tool will be instrumental in producing more efficient IBRs both by avoiding ruptures or failures that create material and labor waste, and by tailoring actuator use and placement to specific applications. IEEEtran § ACKNOWLEDGMENTS § ACKNOWLEDGMENT The authors thank Alexander Kübler for the development of the experimental procedure and the measurements performed with the sPAM/PM, cPAM, and fPAM.
http://arxiv.org/abs/2306.17831v1	20230630175302	Quasi-bound states in the continuum in photonic-crystal-based optomechanical microcavities	[ "Cindy Peralle", "Sushanth Kini Manjeshwar", "Anastasiia Ciers", "Witlef Wieczorek", "Philippe Tassin" ]	physics.optics	[ "physics.optics", "physics.app-ph" ]	Department of Physics, Chalmers University of Technology, SE-412 96 Göteborg, Sweden Department of Microtechnology and Nanoscience, Chalmers University of Technology, SE-412 96 Göteborg, Sweden Department of Microtechnology and Nanoscience, Chalmers University of Technology, SE-412 96 Göteborg, Sweden Department of Microtechnology and Nanoscience, Chalmers University of Technology, SE-412 96 Göteborg, Sweden Department of Physics, Chalmers University of Technology, SE-412 96 Göteborg, Sweden We present a detailed study of mechanically compliant, photonic-crystal-based microcavities featuring a quasi-bound state in the continuum. Such systems have recently been predicted to reduce the optical loss in Fabry-Pérot-type optomechanical cavities. However, they require two identical photonic-crystal slabs facing each other, which poses a considerable challenge for experimental implementation. We investigate how such an ideal system can be simplified and still exhibit a quasi-bound state in the continuum. We find that a suspended photonic-crystal slab facing a distributed Bragg reflector realizes an optomechanical system with a quasi-bound state in the continuum. In this system, the radiative cavity loss can be eliminated to the extent that the cavity loss is dominated by dissipative loss originating from material absorption only. These proposed optomechanical cavity designs are predicted to feature optical quality factors in excess of 10^5. Quasi-bound states in the continuum in photonic-crystal-based optomechanical microcavities Philippe Tassin July 31, 2023 =========================================================================================== § INTRODUCTION Reducing optical loss is paramount for a variety of engineered devices. Loss of confined modes can be reduced by designing structured materials that create bandgaps around the modes of interest <cit.>. An alternative strategy is to use a bound state in the continuum (BIC)—a nonradiating localized mode decoupled from the continuum of modes <cit.>. In theory, their infinite quality factor make BICs particularly interesting for efficient light confinement with applications in filtering <cit.>, lasing <cit.>, and sensing <cit.>. In practice, losses due to material absorption, finite sample size, and structural disorder limit the achievable quality factor. Not fully decoupled from the external radiation anymore, the BIC then becomes a quasi-BIC with a high, yet finite quality factor that can be experimentally observed. Recently, the concept of BICs has been applied to reducing loss in cavity optomechanical devices <cit.>, independently for the mechanical mode <cit.> and the optical mode <cit.>. Losses in optomechanical systems limit the achievable displacement sensitivity, the coherent interaction strength between the mechanical resonator and the resonant electromagnetic field, and the lifetime of optomechanical quantum states. Mechanical loss can be drastically reduced using a wide variety of methods including phononic bandgap engineering, strain engineering, soft clamping techniques, or inverse design <cit.>. However, optical loss is still a major roadblock for achieving, for example, the regime of single-photon strong optomechanical coupling <cit.>. In this article, we focus on analyzing practical optomechanical setups that realize optical quasi-BICs with photonic crystal (PhC)-based optomechanical microcavities. Suspended PhCs combine excellent mechanical and optical properties due to their small weight, low mechanical dissipation, and engineerable optical reflectivity <cit.>. As a consequence, PhC slabs have been considered in theoretical proposals for optomechanical systems <cit.> and have been used in various optomechanical experiments already <cit.>. Recently, it was shown that a cavity optomechanical system formed between two suspended PhC slabs realizes a Fabry-Perot-type optical BIC <cit.>, exhibiting a quality factor only limited by intrinsic loss in the material <cit.>. Here, we extend the analysis of Ref. <cit.> to setups that are more amenable to experimental realization and feature a quasi-BIC, which can be accessed by external radiation, as required for interfacing with optomechanical devices. § TWO PHOTONIC-CRYSTAL MEMBRANES §.§ Model description Many device structures based on BICs presented in the literature exploit a few known geometries: photonic crystals that exhibit symmetry-protected BICs at the Γ point <cit.> or Friedrich-Wintgen BICs in one-dimensional cavities <cit.>. These high-symmetry geometries are often incompatible with planar fabrication techniques. Here, we start from the double photonic-crystal-membrane cavity (DPhoC) as proposed in Ref. <cit.>, and adapt it to allow for its fabrication on a substrate. This cavity is formed by two identical suspended PhC slabs (thickness e), separated by a distance q and patterned with cylindrical holes in a square lattice (radius r, lattice constant a). We first study a PhC with this square lattice, but also look into a hexagonal pattern at a later stage (Section <ref>). In practice, the two photonic-crystal membranes are suspended over a substrate with a distance d_cs between the substrate and the first PhC membrane <cit.>. The resulting system (DPhoCS), depicted in Fig. <ref>(a), is excited with a normally incident light beam with wavelength λ_0 (frequency f_0). Focusing on a frequency interval typical for tunable lasers in the telecom range, from about 184 THz to 197 THz, we search for bound states in the continuum in this frequency interval and for the case that the suspended PhC membranes and the substrate are made from GaAs. We note that the same approach can be used for finding bound states in the continuum at other frequencies and with other materials, for example with SiN <cit.> or InGaP <cit.>. In the spectral range around 190 THz, GaAs can be modeled as a medium with complex refractive index n= n_0 + i n_I, where n_0 = 3.374 and n_I=4.4 ×10^-6 <cit.>. All results in this article are obtained by calculating the eigenmodes of the optical structures using a finite-element package (COMSOL), where we model a unit cell of the periodic structure with periodic boundary conditions. This model does not take into account the finite dimensions of the actual system, possibly leading to a lower PhC reflectivity <cit.>. Moreover, another simplification is made on the incident beam, which is considered to be a plane wave in our model. Both of these simplifications may lead to slightly overestimated values of the optical Q factor. §.§ Impact of the substrate We first study the DPhoC structure without substrate. This structure has a mirror symmetry plane in the middle between the two photonic-crystal membranes. As previously established in Ref. <cit.>, it exhibits a bound state in the continuum, as can be seen from the characteristic shape of the quality factor as a function of hole radius shown in Fig. <ref>(a) without material absorption, Im(n)=0 (blue markers). While the quality factor is about 1×10^4 at r = 400 nm, it exponentially increases up to 2×10^9 at r = 418.1 nm. This value keeps increasing without limit close to the BIC condition. Introducing dissipative loss from material absorption [orange markers in Fig. <ref>(a)], the BIC resonance is turned into a dissipative-loss-limited quasi-BIC with a maximum quality factor of about 7×10^5. In an experiment, such a double membrane would be fabricated on top of a substrate. We therefore introduce a GaAs substrate (DPhoCS system) and calculate the quality factor Q under the exact same conditions as for the DPhoC [see Fig. <ref>(b)]. Comparing the quality factors presented in Fig. <ref>(a) and Fig. <ref>(b), we observe that adding the substrate causes Q to drop from over 10^5 to about 2.6×10^3. Even without absorption, the quality factor remains finite in the presence of a substrate, demonstrating that adding the substrate destroys the bound state in the continuum. Light can leak out from the cavity through the substrate, as shown by the propagating field from z = 4.5 μm [cyan line in Fig. <ref>(c)], while in the case of the DPhoC the field is evanescent around the cavity (dark blue line). This effect can be explained by the generation of higher orders of diffraction in the substrate, illustrated in Fig. <ref>. Without the substrate present, the structure is bounded by air and only the zeroth diffraction order can propagate out of the structure for subwavelength photonic-crystal slabs with a<λ_0; all higher orders are evanescent. However, this is no longer the case in materials with a high refractive index such as GaAs. In the presence of the substrate, the 1^st diffraction order is evanescent in air, but propagates in the substrate since a>λ_0/n. The closer the substrate is to the PhC, the more energy is leaked away through the diffraction channel. This is shown in Fig. <ref>(a), where the distance between the cavity and the substrate d_cs is increased up to three times its original value q. An increase of distance from q to 1.5q leads to a significant enhancement of Q from 2.6×10^3 to 4.5×10^4. As the substrate gets further away from the cavity, less energy can leak from the cavity by evanescent coupling to the higher diffraction orders. Considering constant dissipative losses and reducing radiative losses with increasing d_cs, with large enough distance d_cs, the radiative losses through the substrate become smaller than the dissipative losses and a quasi-BIC is recovered, allowing to restore Q to its value observed with no substrate present (DPhoC). The field distribution confirms this assumption, as the energy leaking out of the cavity decreases as the distance to the substrate increases [from dark blue to cyan lines in Fig. <ref>(b)]. §.§ Single photonic-crystal membrane above a perfect mirror The fabrication of the DPhoC system with its identical PhC slabs requires high precision during the etching process and growth, especially since the BIC is very sensitive to small variations between the patterning of both PhC slabs <cit.>. We can, however, make use of the mirror plane symmetry in the DPhoC system. Instead of having a second PhC, we imagine a single membrane at a distance q/2 over a perfect mirror, modelled with a perfectly magnetic conductor (PMC) boundary condition. As demonstrated by Refs. <cit.>, a Fabry-Perot-type BIC can be realized in such systems. Using the same parameters (q = 680 nm, a = 1085 nm) above a perfect mirror at a distance q/2, the quality factor as a function of the hole radius is calculated. Fig. <ref> compares the resulting quality factor with the one previously obtained for the DPhoC system with no material absorption. We observe that both systems demonstrate the same values of Q. As shown in Fig. <ref> (cross and triangle markers), varying q rather than r also results in the formation of BIC at the exact same parameters. As an implementation of the perfect mirror, one could use a distributed Bragg reflector (DBR) stack. We choose a DBR because of its low absorption properties in the telecom range, simple design, and compatibility with the growth and fabrication process of optomechanical microcavities. Such optomechanical cavities consisting of a mechanically compliant periodic grating facing a DBR mirror have been proposed in Refs. <cit.> in the context of optomechanical linewidth narrowing, and experimentally realized in Refs. <cit.>. The turquoise dots in Fig. <ref> represent the quality factor obtained with this system consisting of one PhC membrane and a DBR (denoted SL-DBR), which we will further study in the next section. Unlike an infinitely thin perfect mirror, all the light is not immediately reflected at the surface of a DBR. This leads to a BIC appearing at a larger q, as seen by the small misalignment of the maximum Q values between the SL-DBR system and the two other systems. §.§ Shifting the BIC frequency The above results demonstrate that a quasi-BIC can be found in a microcavity on a substrate for a specific set of parameters (q = 680 nm, a = 1085 nm) at r_BIC = 418.1 nm and f_BIC = 190.5 THz. In experiments, it is useful to have a control over the resonance frequency of the BIC. This can be achieved by controlling the structural parameters of the microcavity, e.g., the cavity length q. In Fig. <ref>, we show that by varying the cavity length q from 650 nm to 720 nm, the BIC resonance frequency f_BIC is tuned from 180 to 200 THz (blue markers), with longer cavities having smaller f_BIC. With decreasing frequencies, the 2D PhC resonance is tracked by reducing r_BIC (orange markers). § PHOTONIC-CRYSTAL MEMBRANE ABOVE A BRAGG MIRROR We now proceed by implementing the perfect mirror in the model using a DBR. Here we have to remember from the previous analysis that the photonic-crystal membrane creates higher orders of diffraction inside the cavity. To avoid the 1^st order to leak out into the high-index substrate—creating a radiative loss channel and destroying the BIC—we need a highly reflective mirror not only for the 0^th but also for the 1^st order of diffraction. Therefore, the DBR should be specifically designed to reflect these two orders of diffraction, represented in Fig. <ref>. Here we focus on only the first two orders of diffraction. Even higher orders of diffraction may also propagate, but their influence is negligible as they carry less energy. This brings us to the system depicted in Fig. <ref>(b), a cavity consisting of a single photonic-crystal membrane above a DBR grown on a GaAs substrate. We design the cavity to have a resonance wavelength at λ_0 = 1525 nm. A highly reflective Fano resonance of the PhC is obtained at λ_0 for a = 1081 nm, r = 457.5 nm, and e = 109 nm. The membrane can be seen as a periodic grating that diffracts the incoming light mostly in the 0^th and 1^st orders of diffraction. These two modes should then be reflected by the DBR. The DBR is made of N periods of alternating layers of GaAs and Al_xGa_1-xAs of thickness e_GaAs and e_AlGaAs, respectively. For the current model we use aluminum content x = 0.97. A DBR with two layers in the unit cell allows to achieve a bandgap for two different parallel momenta. Based on the equations of the DBR angle-dependant reflectivity from Ref. <cit.>, a homemade optimization algorithm was used to calculate the values e_GaAs and e_AlGaAs. With the refractive index of AlGaAs set to n_AlGaAs = 2.927, a high reflectivity of the DBR for both the 0^th and 1^st orders of diffraction is achieved when e_GaAs = 100.2 nm and e_AlGaAs = 147.1 nm. We find that 40 periods are sufficient to suppress the radiative loss channel through the substrate to recover the quasi-BIC. §.§ Near-field effects It is crucial to understand the influence of the DBR proximity to the PhC membrane and the near-field effects associated with it when choosing the BIC-based microcavity parameters. The quality factor of the microcavity is shown in Fig. <ref> for two ranges of the cavity length: from 680 nm to 710 nm and from 1450 nm to 1460 nm. For the shorter cavity (left part of the plot), the maximum of the quality factor is limited to 2.6×10^3. In cases without and with absorption the Q values are almost identical. Our calculations indicate that the impact on Q from material absorption is minor compared to the evanescent coupling, as the considered DBR is not designed to reflect the near-field evanescent wave. Light then propagates through the DBR and reaches the substrate [dark blue line in Fig. <ref>], as shown by the oscillations in the DBR (from z = 4 μm to z = 14 μm) and then its propagation in the substrate. A longer cavity alleviates that issue. When the cavity length is increased by an integral number of half wavelengths, the BIC reappears <cit.>. We can thus observe another peak of the quality factor at q_l = 1455 nm. In this case, the near-field coupling to the substrate is significantly reduced and Q_max reaches 7.1×10^5 and 4.4×10^5 without and with material absorption, respectively. For a q_l-cavity, the electric field strength in the DBR decreases exponentially [light blue line in Fig. <ref>]. For an even longer cavity (q = q_l+λ_0/2 = 2214 nm), Q reaches 1.2×10^6 when no absorption is modelled. This second improvement on Q seems relatively low, proving that most evanescent coupling has been suppressed by increasing the cavity length by just one half wavelength. It is worth noting that even at larger q and without material absorption, the quality factor remains finite, a sign that some radiative loss channel still exists in the system, namely radiation into the substrate because of the finite reflectivity of the DBR. This is not problematic, however, since we can make the radiative losses smaller than the dissipative losses. In order to avoid these near-field effects, we will further only consider longer cavities (q ≈ 1455 nm). §.§ Photonic-crystal membrane with hexagonal lattice As the 2D pattern of the PhC can be freely modified, we can examine different symmetries. In this section, we study a hexagonal lattice. The reciprocal lattice is then also hexagonal and the magnitude of its primitive lattice vectors is G=4π/(a√(3)). The first diffraction order from a membrane with a hexagonal lattice propagates with an in-plane wave vector k_\|\|=G <cit.>. For the same lattice constant a, this value is about 15% larger than that for a square lattice for which k_\|\| = 2π/a and the diffraction angle from a hexagonal lattice is therefore larger than that from a square lattice. It also means that the cut-off for the first diffraction order is higher for a hexagonal lattice. We thus expect the impact from the higher orders of diffraction on the quality factor to be lower for a hexagonal lattice. This is indeed what we observe if the PhC pattern in the SL-DBR system is changed from a square to a hexagonal lattice. This modification is accompanied by an adjustment of the 2D PhC parameters in order to track the BIC resonance: while keeping the DBR parameters, and a and e constant, r_hex is adjusted to 225 nm. A quality factor comparison between square and hexagonal lattices is shown in Fig. <ref>. Only the hole radius is adjusted to obtain the resonance of the 2D PhC slab. The hole radius for the square and hexagonal lattices are denoted by r_sq and r_hex, respectively. Looking first at the case without material absorption (blue markers), Q reaches a maximum value of about 7.1×10^5 for a square lattice, whereas a maximum Q of 2.4×10^6 is reached for the hexagonal lattice, in agreement with our earlier prediction that the quality factor should increase for a hexagonal lattice due to the lesser impact of the higher orders of diffraction. On the other hand, when comparing the case with material absorption (orange markers), the difference between square and hexagonal lattices becomes much smaller. Their maximum values are very close: about 4.4×10^5 for the square lattice and 4.8×10^5 for the hexagonal lattice. Since the resonances are dissipative-loss-limited, further reducing the radiative losses with a hexagonal lattice has limited impact. We note that the DBR layer thicknesses were originally optimized to make the DBR reflect both the 0^th and 1^st orders of diffraction coming from the 2D PhC patterned with a square lattice. While the 0^th order of diffraction remains normally incident on the DBR, the angle for the 1^st order of diffraction depends on k_\|\|. However, changing from a square lattice to a hexagonal lattice modified k_\|\| and the DBR may no longer reflect this 1^st order of diffraction optimally. Therefore, a new optimization of the DBR layers thicknesses is necessary. For each value of e_GaAs, we evaluated Q as a function of e_AlGaAs and extracted the maximum, Q_max. Then we repeated this process for other values of e_GaAs and plotted Q_max as a function of e_AlGaAs, shown in Fig. <ref>. The highest Q_max obtained in this way is about 5.1×10^5, for e_GaAs = 112 nm and e_AlGaAs = 131.4 nm. This study includes a realistic material absorption for GaAs. § CONCLUSION We have proposed an optomechanical microcavity supporting a photonic quasi-BIC, which consists of a PhC membrane suspended above a DBR mirror <cit.>. We found that for the realization of a quasi-BIC, it is essential to design the DBR mirror such that it reflects both the normally incident wave and the 1^st diffraction order. When implementing such a cavity with a GaAs PhC membrane <cit.>, it is predicted to yield optical quality factors of 5×10^5. This value is limited by both material absorption and radiative loss channels through the DBR. Our analysis can be further extended by considering the finite size of the PhC membrane, which is not currently captured by our periodic boundary condition. Finite size effects lead to small variations in the resonance frequency <cit.> and reduction of the total reflectivity <cit.>. Furthermore, we currently model the incident beam as a plane wave. A realistic Gaussian beam could be modeled by a superposition of plane waves of different amplitudes and incident angles <cit.>. The predicted optical quality factors would result in a cavity decay rate of κ∼2π· 100MHz for a microcavity of L∼1.55 μm length. Typical mechanical frequencies of suspended PhC membranes lie in the kHz to MHz range with an effective mass of a few nanograms <cit.>. When using such PhC membranes as an end-mirror <cit.> in our proposed microcavity, an optomechanical frequency pulling factor of about 2π·100GHz/nm would be realized leading to a single-photon coupling strength on the order of 2π·500kHz and a ratio of coupling strength to optical loss of g_0/κ∼5·10^-3, which is comparable to realizations based on optomechanical crystals <cit.>, microwave optomechanics <cit.>, or magnetomechanics <cit.>. Our proposed quasi-BIC optomechanical microcavity would be placed in the non-sideband resolved regime, which is amenable for optomechanical feedback cooling <cit.> and sensing <cit.>. A further increase of the optical quality factor of the quasi-BIC microcavity could be realized by designing DBRs that reflect even higher orders of diffraction, considering materials with lower absorption, or employing machine-learning based optimization to find PhC patterns with reduced dissipative loss <cit.>. This work was supported in part by the project C’MON-QSENS!, the Knut and Alice Wallenberg Foundation through a Wallenberg Academy Fellowship (W.W.), by the Wallenberg Center for Quantum Technology (WACQT, A.C.), by Chalmers Excellence Initiative Nano, and by the Swedish Research Council (Grant no. 2019-04946 and 2020-05284). § MODEL PARAMETERS Unless otherwise stated, Table <ref> summarizes all parameters used in the simulations. They lead to the highest Q obtained in our simulations for each system. Starting parameters were set so that a high reflectivity of both cavity membranes could be observed. For example, a and r chosen for DPhoC(S) are represented by the white cross on Fig. <ref>. A large region of high reflectivity is observed around it, allowing for possible inaccuracies in the fabrication. As to SL-DBR systems, the DBR was designed in Section <ref> with a high reflectivity in 0^th and 1^st orders. § BAND DIAGRAMS It is worth noting that a hexagonal lattice is a lot less sensitive to variations of the incidence angle than a square lattice. This is shown by the band diagrams of the single photonic-crystal slab patterned with a square and hexagonal lattice in Figs. <ref> and <ref>, respectively. Bands for the hexagonal lattice appear flat compared to those for the square lattice. A reflectance spectrum at the Γ point is aligned at the right, proving agreement between these results on the Γ point, as a high reflectance is observed in photonic bandgaps. 65 fxundefined [1] ifx#1 fnum [1] #1firstoftwo secondoftwo fx [1] #1firstoftwo secondoftwo noop [0]secondoftwo ref[1]@startlink#1@href href[1]#1@endlink anitize@url [0]` 12`$12`&12`#12`1̂2`_12`%12 startlink[1] endlink[0] rl [1]href #1 @bib@innerbibempty [Akahane et al.(2003)Akahane, Asano, Song, and Noda]akahane2003high author author Y. Akahane, author T. Asano, author B.-S. Song, and author S. Noda, title title High-q photonic nanocavity in a two-dimensional photonic crystal, https://doi.org/10.1038/nature02063 journal journal Nature volume 425, pages 944 (year 2003)NoStop [Englund et al.(2005)Englund, Fushman, and Vuckovic]englund2005general author author D. Englund, author I. Fushman, and author J. Vuckovic, title title General recipe for designing photonic crystal cavities, https://doi.org/10.1364/OPEX.13.005961 journal journal Optics Express volume 13, pages 5961 (year 2005)NoStop [Deotare et al.(2009)Deotare, McCutcheon, Frank, Khan, and Lončar]deotare2009high author author P. B. Deotare, author M. W. McCutcheon, author I. W. Frank, author M. Khan, and author M. Lončar, title title High quality factor photonic crystal nanobeam cavities, https://doi.org/10.1063/1.3107263 journal journal Applied Physics Letters volume 94, pages 121106 (year 2009)NoStop [Tassin et al.(2012)Tassin, Zhang, Zhao, Jain, Koschny, and Soukoulis]tassin2012 author author P. Tassin, author L. Zhang, author R. Zhao, author A. Jain, author T. Koschny, and author C. M. Soukoulis, title title Electromagnetically induced transparency and absorption in metamaterials: the radiating two-oscillator model and its experimental confirmation, @noop journal journal Physical Review Letters volume 109, pages 187401 (year 2012)NoStop [Hsu et al.(2016)Hsu, Zhen, Stone, Joannopoulos, and Soljačić]hsu2016 author author C. W. Hsu, author B. Zhen, author A. D. Stone, author J. D. Joannopoulos, and author M. Soljačić, title title Bound states in the continuum, https://doi.org/10.1038/natrevmats.2016.48 journal journal Nature Reviews Materials volume 1, pages 1 (year 2016)NoStop [Koshelev et al.(2019)Koshelev, Favraud, Bogdanov, Kivshar, and Fratalocchi]koshelev2019nonradiating author author K. Koshelev, author G. Favraud, author A. Bogdanov, author Y. Kivshar, and author A. Fratalocchi, title title Nonradiating photonics with resonant dielectric nanostructures, https://doi.org/10.1515/nanoph-2019-0024 journal journal Nanophotonics volume 8, pages 725 (year 2019)NoStop [Azzam and Kildishev(2021)]azzam2021photonic author author S. I. Azzam and author A. V. Kildishev, title title Photonic bound states in the continuum: from basics to applications, https://doi.org/10.1002/adom.202001469 journal journal Advanced Optical Materials volume 9, pages 2001469 (year 2021)NoStop [Huang et al.(2023)Huang, Xu, Powell, Padilla, and Miroshnichenko]huang2023 author author L. Huang, author L. Xu, author D. A. Powell, author W. J. Padilla, and author A. E. Miroshnichenko, title title Resonant leaky modes in all-dielectric metasystems: Fundamentals and applications, https://doi.org/https://doi.org/10.1016/j.physrep.2023.01.001 journal journal Physics Reports volume 1008, pages 1 (year 2023)NoStop [Foley et al.(2014)Foley, Young, and Phillips]foley2014symmetry author author J. M. Foley, author S. M. Young, and author J. D. Phillips, title title Symmetry-protected mode coupling near normal incidence for narrow-band transmission filtering in a dielectric grating, https://doi.org/10.1103/PhysRevB.89.165111 journal journal Physical Review B volume 89, pages 165111 (year 2014)NoStop [Kodigala et al.(2017)Kodigala, Lepetit, Gu, Bahari, Fainman, and Kanté]kodigala2017lasing author author A. Kodigala, author T. Lepetit, author Q. Gu, author B. Bahari, author Y. Fainman, and author B. Kanté, title title Lasing action from photonic bound states in continuum, https://doi.org/10.1038/nature20799 journal journal Nature volume 541, pages 196 (year 2017)NoStop [Wu et al.(2020)Wu, Ha, Shendre, Durmusoglu, Koh, Abujetas, Sánchez-Gil, Paniagua-Domínguez, Demir, and Kuznetsov]wu2020room author author M. Wu, author S. T. Ha, author S. Shendre, author E. G. Durmusoglu, author W.-K. Koh, author D. R. Abujetas, author J. A. Sánchez-Gil, author R. Paniagua-Domínguez, author H. V. Demir, and author A. I. Kuznetsov, title title Room-temperature lasing in colloidal nanoplatelets via mie-resonant bound states in the continuum, https://doi.org/10.1021/acs.nanolett.0c01975 journal journal Nano Letters volume 20, pages 6005 (year 2020)NoStop [Liu et al.(2017)Liu, Zhou, and Sun]liu2017optical author author Y. Liu, author W. Zhou, and author Y. Sun, title title Optical refractive index sensing based on high-q bound states in the continuum in free-space coupled photonic crystal slabs, https://doi.org/10.3390/s17081861 journal journal Sensors volume 17, pages 1861 (year 2017)NoStop [Romano et al.(2018)Romano, Lamberti, Masullo, Penzo, Cabrini, Rendina, and Mocella]romano2018optical author author S. Romano, author A. Lamberti, author M. Masullo, author E. Penzo, author S. Cabrini, author I. Rendina, and author V. Mocella, title title Optical biosensors based on photonic crystals supporting bound states in the continuum, https://doi.org/10.3390/ma11040526 journal journal Materials volume 11, pages 526 (year 2018)NoStop [Aspelmeyer et al.(2014)Aspelmeyer, Kippenberg, and Marquardt]Aspelmeyer2014 author author M. Aspelmeyer, author T. J. Kippenberg, and author F. Marquardt, title title Cavity optomechanics, https://doi.org/10.1103/RevModPhys.86.1391 journal journal Reviews of Modern Physics volume 86, pages 1391 (year 2014)NoStop [Liu et al.(2022)Liu, Tong, and Fang]liu2022optomechanical author author S. Liu, author H. Tong, and author K. Fang, title title Optomechanical crystal with bound states in the continuum, https://doi.org/10.1038/s41467-022-30965-6 journal journal Nature Communications volume 13, pages 3187 (year 2022)NoStop [Zhao and Fang(2019)]zhao2019mechanical author author M. Zhao and author K. Fang, title title Mechanical bound states in the continuum for macroscopic optomechanics, https://doi.org/10.1364/OE.27.010138 journal journal Optics Express volume 27, pages 10138 (year 2019)NoStop [Fitzgerald et al.(2021)Fitzgerald, Manjeshwar, Wieczorek, and Tassin]Fitzgerald2021 author author J. M. Fitzgerald, author S. K. Manjeshwar, author W. Wieczorek, and author P. Tassin, title title Cavity optomechanics with photonic bound states in the continuum, https://doi.org/10.1103/PhysRevResearch.3.013131 journal journal Physical Review Research volume 3, pages 013131 (year 2021)NoStop [Yu et al.(2014)Yu, Cicak, Kampel, Tsaturyan, Purdy, Simmonds, and Regal]yu2014phononic author author P.-L. Yu, author K. Cicak, author N. S. Kampel, author Y. Tsaturyan, author T. P. Purdy, author R. W. Simmonds, and author C. A. Regal, title title A phononic bandgap shield for high-q membrane microresonators, https://doi.org/10.1063/1.4862031 journal journal Applied Physics Letters volume 104, pages 023510 (year 2014)NoStop [Tsaturyan et al.(2017)Tsaturyan, Barg, Polzik, and Schliesser]tsaturyan2017ultracoherent author author Y. Tsaturyan, author A. Barg, author E. S. Polzik, and author A. Schliesser, title title Ultracoherent nanomechanical resonators via soft clamping and dissipation dilution, https://doi.org/10.1038/nnano.2017.101 journal journal Nature Nanotechnology volume 12, pages 776 (year 2017)NoStop [Ghadimi et al.(2018)Ghadimi, Fedorov, Engelsen, Bereyhi, Schilling, Wilson, and Kippenberg]ghadimi2018elastic author author A. H. Ghadimi, author S. A. Fedorov, author N. J. Engelsen, author M. J. Bereyhi, author R. Schilling, author D. J. Wilson, and author T. J. Kippenberg, title title Elastic strain engineering for ultralow mechanical dissipation, https://doi.org/10.1126/science.aar6939 journal journal Science volume 360, pages 764 (year 2018)NoStop [Høj et al.(2021)Høj, Wang, Gao, Hoff, Sigmund, and Andersen]hoj2021ultra author author D. Høj, author F. Wang, author W. Gao, author U. B. Hoff, author O. Sigmund, and author U. L. Andersen, title title Ultra-coherent nanomechanical resonators based on inverse design, https://doi.org/10.1038/s41467-021-26102-4 journal journal Nature Communications volume 12, pages 5766 (year 2021)NoStop [Rabl(2011)]rabl2011photon author author P. Rabl, title title Photon blockade effect in optomechanical systems, https://doi.org/10.1103/PhysRevLett.107.063601 journal journal Physical Review Letters volume 107, pages 063601 (year 2011)NoStop [Nunnenkamp et al.(2011)Nunnenkamp, Børkje, and Girvin]nunnenkamp2011single author author A. Nunnenkamp, author K. Børkje, and author S. M. Girvin, title title Single-photon optomechanics, https://doi.org/10.1103/PhysRevLett.107.063602 journal journal Physical Review Letters volume 107, pages 063602 (year 2011)NoStop [Bui et al.(2012)Bui, Zheng, Hoch, Lee, Harris, and Wei Wong]bui2012high author author C. H. Bui, author J. Zheng, author S. W. Hoch, author L. Y. T. Lee, author J. G. E. Harris, and author C. Wei Wong, title title High-reflectivity, high-q micromechanical membranes via guided resonances for enhanced optomechanical coupling, https://doi.org/10.1063/1.3658731 journal journal Applied Physics Letters volume 100, pages 021110 (year 2012)NoStop [Makles et al.(2015)Makles, Antoni, Kuhn, Deléglise, Briant, Cohadon, Braive, Beaudoin, Pinard, Michel, Dolique, Flaminio, Cagnoli, Robert-Philip, and Heidmann]makles20152d author author K. Makles, author T. Antoni, author A. G. Kuhn, author S. Deléglise, author T. Briant, author P.-F. Cohadon, author R. Braive, author G. Beaudoin, author L. Pinard, author C. Michel, author V. Dolique, author R. Flaminio, author G. Cagnoli, author I. Robert-Philip, and author A. Heidmann, title title 2d photonic-crystal optomechanical nanoresonator, https://doi.org/10.1364/OL.40.000174 journal journal Optics Letters volume 40, pages 174 (year 2015)NoStop [Norte et al.(2016)Norte, Moura, and Gröblacher]norte2016mechanical author author R. A. Norte, author J. P. Moura, and author S. Gröblacher, title title Mechanical resonators for quantum optomechanics experiments at room temperature, https://doi.org/10.1103/PhysRevLett.116.147202 journal journal Physical Review Letters volume 116, pages 147202 (year 2016)NoStop [Kini Manjeshwar et al.(2020)Kini Manjeshwar, Elkhouly, Fitzgerald, Ekman, Zhang, Zhang, Wang, Tassin, and Wieczorek]kinimanjeshwarSuspendedPhotonicCrystal2020 author author S. Kini Manjeshwar, author K. Elkhouly, author J. M. Fitzgerald, author M. Ekman, author Y. Zhang, author F. Zhang, author S. M. Wang, author P. Tassin, and author W. Wieczorek, title title Suspended photonic crystal membranes in AlGaAs heterostructures for integrated multi-element optomechanics, https://doi.org/10.1063/5.0012667 journal journal Applied Physics Letters volume 116, pages 264001 (year 2020)NoStop [Zhou et al.(2022)Zhou, Bao, Gorman, and Lawall]zhouCavityOptomechanicalBistability2022 author author F. Zhou, author Y. Bao, author J. J. Gorman, and author J. Lawall, https://doi.org/10.48550/arXiv.2211.10485 title Cavity optomechanical bistability with an ultrahigh reflectivity photonic crystal membrane (year 2022), https://arxiv.org/abs/arXiv:2211.10485 arXiv:2211.10485 NoStop [Manjeshwar et al.(2022)Manjeshwar, Ciers, Hellman, Bläsing, Strittmater, and Wieczorek]manjeshwarMicromechanicalHighQTrampoline2022 author author S. K. Manjeshwar, author A. Ciers, author F. Hellman, author J. Bläsing, author A. Strittmater, and author W. Wieczorek, https://doi.org/10.48550/arXiv.2211.12469 title Micromechanical high-Q trampoline resonators from strained crystalline InGaP for integrated free-space optomechanics (year 2022), https://arxiv.org/abs/arXiv:2211.12469 arXiv:2211.12469 NoStop [Naesby and Dantan(2018)]naesbyMicrocavitiesSuspendedSubwavelength2018 author author A. Naesby and author A. Dantan, title title Microcavities with suspended subwavelength structured mirrors, https://doi.org/10.1364/OE.26.029886 journal journal Optics Express volume 26, pages 29886 (year 2018)NoStop [Černotík et al.(2019)Černotík, Dantan, and Genes]cernotikCavityQuantumElectrodynamics2019 author author O. Černotík, author A. Dantan, and author C. Genes, title title Cavity Quantum Electrodynamics with Frequency-Dependent Reflectors, https://doi.org/10.1103/PhysRevLett.122.243601 journal journal Physical Review Letters volume 122, pages 243601 (year 2019)NoStop [Gärtner et al.(2018)Gärtner, Moura, Haaxman, Norte, and Gröblacher]gartner2018integrated author author C. Gärtner, author J. P. Moura, author W. Haaxman, author R. A. Norte, and author S. Gröblacher, title title Integrated optomechanical arrays of two high reflectivity sin membranes, https://doi.org/10.1021/acs.nanolett.8b03240 journal journal Nano letters volume 18, pages 7171 (year 2018)NoStop [de Jong et al.(2022)de Jong, Li, Gärtner, Norte, and Gröblacher]jongCoherentMechanicalNoise2022 author author M. H. J. de Jong, author J. Li, author C. Gärtner, author R. A. Norte, and author S. Gröblacher, title title Coherent mechanical noise cancellation and cooperativity competition in optomechanical arrays, https://doi.org/10.1364/OPTICA.446434 journal journal Optica volume 9, pages 170 (year 2022)NoStop [Enzian et al.(2022)Enzian, Wang, Simonsen, Mathiassen, Vibel, Tsaturyan, Tagantsev, Schliesser, and Polzik]enzian2022phononically author author G. Enzian, author Z. Wang, author A. Simonsen, author J. Mathiassen, author T. Vibel, author Y. Tsaturyan, author A. Tagantsev, author A. Schliesser, and author E. S. Polzik, title title Phononically shielded photonic-crystal mirror membranes for cavity quantum optomechanics, journal journal arXiv preprint arXiv:2212.12148 https://doi.org/10.48550/arXiv.2212.12148 10.48550/arXiv.2212.12148 (year 2022)NoStop [Suh et al.(2003)Suh, Yanik, Solgaard, and Fan]suh2003displacement author author W. Suh, author M. Yanik, author O. Solgaard, and author S. Fan, title title Displacement-sensitive photonic crystal structures based on guided resonance in photonic crystal slabs, https://doi.org/10.1063/1.1563739 journal journal Applied Physics Letters volume 82, pages 1999 (year 2003)NoStop [Suh et al.(2005)Suh, Solgaard, and Fan]suh2005displacement author author W. Suh, author O. Solgaard, and author S. Fan, title title Displacement sensing using evanescent tunneling between guided resonances in photonic crystal slabs, https://doi.org/10.1063/1.1999031 journal journal Journal of Applied Physics volume 98, pages 033102 (year 2005)NoStop [Marinica et al.(2008)Marinica, Borisov, and Shabanov]marinica2008bound author author D. C. Marinica, author A. G. Borisov, and author S. V. Shabanov, title title Bound states in the continuum in photonics, https://doi.org/Bound states in the continuum in photonics journal journal Physical Review Letters volume 100, pages 183902 (year 2008)NoStop [Cong and Singh(2019)]cong2019symmetry author author L. Cong and author R. Singh, title title Symmetry-protected dual bound states in the continuum in metamaterials, https://doi.org/10.1002/adom.201900383 journal journal Advanced Optical Materials volume 7, pages 1900383 (year 2019)NoStop [Li et al.(2019)Li, Zhou, Liu, and Xiao]li2019symmetry author author S. Li, author C. Zhou, author T. Liu, and author S. Xiao, title title Symmetry-protected bound states in the continuum supported by all-dielectric metasurfaces, https://doi.org/10.1103/PhysRevA.100.063803 journal journal Physical Review A volume 100, pages 063803 (year 2019)NoStop [Amrani et al.(2022)Amrani, Khattou, El Boudouti, Talbi, Akjouj, Dobrzynski, and Djafari-Rouhani]amrani2022friedrich author author M. Amrani, author S. Khattou, author E. H. El Boudouti, author A. Talbi, author A. Akjouj, author L. Dobrzynski, and author B. Djafari-Rouhani, title title Friedrich-wintgen bound states in the continuum and induced resonances in a loop laterally coupled to a waveguide, https://doi.org/10.1103/PhysRevB.106.125414 journal journal Physical Review B volume 106, pages 125414 (year 2022)NoStop [Lee et al.(2020)Lee, Kim, and Kee]lee2020bound author author S.-G. Lee, author S.-H. Kim, and author C.-S. Kee, title title Bound states in the continuum (bic) accompanied by avoided crossings in leaky-mode photonic lattices, https://doi.org/10.1515/nanoph-2020-0346 journal journal Nanophotonics volume 9, pages 4373 (year 2020)NoStop [Azzam et al.(2018)Azzam, Shalaev, Boltasseva, and Kildishev]azzam2018formation author author S. I. Azzam, author V. M. Shalaev, author A. Boltasseva, and author A. V. Kildishev, title title Formation of bound states in the continuum in hybrid plasmonic-photonic systems, https://doi.org/10.1103/PhysRevLett.121.253901 journal journal Physical Review Letters volume 121, pages 253901 (year 2018)NoStop [Gärtner et al.(2018)Gärtner, Moura, Haaxman, Norte, and Gröblacher]gartnerIntegratedOptomechanicalArrays2018 author author C. Gärtner, author J. P. Moura, author W. Haaxman, author R. A. Norte, and author S. Gröblacher, title title Integrated Optomechanical Arrays of Two High Reflectivity SiN Membranes, journal journal Nano Letters https://doi.org/10.1021/acs.nanolett.8b03240 10.1021/acs.nanolett.8b03240 (year 2018)NoStop [Michael et al.(2007)Michael, Srinivasan, Johnson, Painter, Lee, Hennessy, Kim, and Hu]michael2007wavelength author author C. P. Michael, author K. Srinivasan, author T. J. Johnson, author O. Painter, author K. H. Lee, author K. Hennessy, author H. Kim, and author E. Hu, title title Wavelength-and material-dependent absorption in gaas and algaas microcavities, https://doi.org/10.1063/1.2435608 journal journal Applied Physics Letters volume 90, pages 051108 (year 2007)NoStop [Xu et al.(2009)Xu, Wheeler, Ruda, Mojahedi, and Aitchison]xu2009influence author author T. Xu, author M. S. Wheeler, author H. E. Ruda, author M. Mojahedi, and author J. S. Aitchison, title title The influence of material absorption on the quality factor of photonic crystal cavities, https://doi.org/10.1364/OE.17.008343 journal journal Optics Express volume 17, pages 8343 (year 2009)NoStop [Toft-Vandborg et al.(2021)Toft-Vandborg, Parthenopoulos, Darki, and Dantan]toft-vandborgCollimationFinitesizeEffects2021 author author C. Toft-Vandborg, author A. Parthenopoulos, author A. A. Darki, and author A. Dantan, title title Collimation and finite-size effects in suspended resonant guided-mode gratings, https://doi.org/10.1364/JOSAA.440215 journal journal J. Opt. Soc. Am. A volume 38, pages 1714 (year 2021)NoStop [Hsu et al.(2013)Hsu, Zhen, Chua, Johnson, Joannopoulos, and Soljačić]hsu2013bloch author author C. W. Hsu, author B. Zhen, author S.-L. Chua, author S. G. Johnson, author J. D. Joannopoulos, and author M. Soljačić, title title Bloch surface eigenstates within the radiation continuum, https://doi.org/10.1038/lsa.2013.40 journal journal Light: Science & Applications volume 2, pages e84 (year 2013)NoStop [Yu et al.(2021)Yu, Sakanas, Zali, Semenova, Yvind, and Mørk]yu2021ultra author author Y. Yu, author A. Sakanas, author A. R. Zali, author E. Semenova, author K. Yvind, and author J. Mørk, title title Ultra-coherent fano laser based on a bound state in the continuum, https://doi.org/10.1038/s41566-021-00860-5 journal journal Nature Photonics volume 15, pages 758 (year 2021)NoStop [Xu et al.(2022)Xu, Liu, Sang, Tan, Guo, and Zhu]xu2022millimeter author author J. Xu, author K. Liu, author Y. Sang, author Z. Tan, author C. Guo, and author Z. Zhu, title title Millimeter-scale ultrathin suspended metasurface integrated high-finesse optomechanical cavity, https://doi.org/10.1364/OL.465567 journal journal Optics Letters volume 47, pages 5481 (year 2022)NoStop [Yariv and Yeh(1984)]Yariv1984 author author A. Yariv and author P. Yeh, @noop title Optical waves in crystals, Vol. volume 5 (publisher Wiley New York, year 1984)NoStop [Ochiai and Sakoda(2001)]ochiai2001dispersion author author T. Ochiai and author K. Sakoda, title title Dispersion relation and optical transmittance of a hexagonal photonic crystal slab, https://doi.org/https://doi.org/10.1103/PhysRevB.63.125107 journal journal Physical Review B volume 63, pages 125107 (year 2001)NoStop [Barnes et al.(2004)Barnes, Murray, Dintinger, Devaux, and Ebbesen]barnes2004surface author author W. L. Barnes, author W. A. Murray, author J. Dintinger, author E. Devaux, and author T. W. Ebbesen, title title Surface plasmon polaritons and their role in the enhanced transmission of light through periodic arrays of subwavelength holes in a metal film, https://doi.org/https://doi.org/10.1103/PhysRevLett.92.107401 journal journal Physical Review Letters volume 92, pages 107401 (year 2004)NoStop [Zundel and Manjavacas(2018)]zundel2018finite author author L. Zundel and author A. Manjavacas, title title Finite-size effects on periodic arrays of nanostructures, https://doi.org/10.1088/2515-7647/aae8a2 journal journal Journal of Physics: Photonics volume 1, pages 015004 (year 2018)NoStop [Yang et al.(2005)Yang, Li, Yasumoto, and Liang]yang2005two author author J. Yang, author L.-W. Li, author K. Yasumoto, and author C.-H. Liang, title title Two-dimensional scattering of a gaussian beam by a periodic array of circular cylinders, https://doi.org/10.1109/TGRS.2004.841416 journal journal IEEE Transactions on Geoscience and Remote Sensing volume 43, pages 280 (year 2005)NoStop [Chan et al.(2011)Chan, Alegre, Safavi-Naeini, Hill, Krause, Gröblacher, Aspelmeyer, and Painter]chanLaserCoolingNanomechanical2011 author author J. Chan, author T. P. M. Alegre, author A. H. Safavi-Naeini, author J. T. Hill, author A. Krause, author S. Gröblacher, author M. Aspelmeyer, and author O. Painter, title title Laser cooling of a nanomechanical oscillator into its quantum ground state, https://doi.org/10.1038/nature10461 journal journal Nature volume 478, pages 89 (year 2011)NoStop [Teufel et al.(2011)Teufel, Li, Allman, Cicak, Sirois, Whittaker, and Simmonds]teufelCircuitCavityElectromechanics2011 author author J. D. Teufel, author D. Li, author M. S. Allman, author K. Cicak, author A. J. Sirois, author J. D. Whittaker, and author R. W. Simmonds, title title Circuit cavity electromechanics in the strong-coupling regime, https://doi.org/10.1038/nature09898 journal journal Nature volume 471, pages 204 (year 2011)NoStop [Rodrigues et al.(2019)Rodrigues, Bothner, and Steele]rodriguesCouplingMicrowavePhotons2019 author author I. C. Rodrigues, author D. Bothner, and author G. A. Steele, title title Coupling microwave photons to a mechanical resonator using quantum interference, https://doi.org/10.1038/s41467-019-12964-2 journal journal Nature Communications volume 10, pages 5359 (year 2019)NoStop [Schmidt et al.(2020)Schmidt, T. Amawi, Pogorzalek, Deppe, Marx, Gross, and Huebl]schmidtSidebandresolvedResonatorElectromechanics2020 author author P. Schmidt, author M. T. Amawi, author S. Pogorzalek, author F. Deppe, author A. Marx, author R. Gross, and author H. Huebl, title title Sideband-resolved resonator electromechanics based on a nonlinear Josephson inductance probed on the single-photon level, https://doi.org/10.1038/s42005-020-00501-3 journal journal Communications Physics volume 3, pages 1 (year 2020)NoStop [Zoepfl et al.(2023)Zoepfl, Juan, Diaz-Naufal, Schneider, Deeg, Sharafiev, Metelmann, and Kirchmair]zoepflKerrEnhancedBackaction2023 author author D. Zoepfl, author M. L. Juan, author N. Diaz-Naufal, author C. M. F. Schneider, author L. F. Deeg, author A. Sharafiev, author A. Metelmann, and author G. Kirchmair, title title Kerr Enhanced Backaction Cooling in Magnetomechanics, https://doi.org/10.1103/PhysRevLett.130.033601 journal journal Phys. Rev. Lett. volume 130, pages 033601 (year 2023)NoStop [Genes et al.(2008)Genes, Vitali, Tombesi, Gigan, and Aspelmeyer]genesGroundstateCoolingMicromechanical2008 author author C. Genes, author D. Vitali, author P. Tombesi, author S. Gigan, and author M. Aspelmeyer, title title Ground-state cooling of a micromechanical oscillator: Comparing cold damping and cavity-assisted cooling schemes, https://doi.org/10.1103/PhysRevA.77.033804 journal journal Physical Review A volume 77, pages 033804 (year 2008)NoStop [Rossi et al.(2018)Rossi, Mason, Chen, Tsaturyan, and Schliesser]rossiMeasurementbasedQuantumControl2018 author author M. Rossi, author D. Mason, author J. Chen, author Y. Tsaturyan, and author A. Schliesser, title title Measurement-based quantum control of mechanical motion, https://doi.org/10.1038/s41586-018-0643-8 journal journal Nature volume 563, pages 53 (year 2018)NoStop [Li et al.(2021)Li, Ou, Lei, and Liu]liCavityOptomechanicalSensing2021 author author B.-B. Li, author L. Ou, author Y. Lei, and author Y.-C. Liu, title title Cavity optomechanical sensing, https://doi.org/10.1515/nanoph-2021-0256 journal journal Nanophotonics volume 10, pages 2799 (year 2021)NoStop [Jiang et al.(2021)Jiang, Chen, and Fan]jiangDeepNeuralNetworks2021 author author J. Jiang, author M. Chen, and author J. A. Fan, title title Deep neural networks for the evaluation and design of photonic devices, https://doi.org/10.1038/s41578-020-00260-1 journal journal Nature Reviews Materials volume 6, pages 679 (year 2021)NoStop [Kudyshev et al.(2021)Kudyshev, Shalaev, and Boltasseva]kudyshevMachineLearningIntegrated2021 author author Z. A. Kudyshev, author V. M. Shalaev, and author A. Boltasseva, title title Machine Learning for Integrated Quantum Photonics, https://doi.org/10.1021/acsphotonics.0c00960 journal journal ACS Photonics volume 8, pages 34 (year 2021)NoStop [Gahlmann and Tassin(2022)]gahlmannDeepNeuralNetworks2022 author author T. Gahlmann and author P. Tassin, title title Deep neural networks for the prediction of the optical properties and the free-form inverse design of metamaterials, https://doi.org/10.1103/PhysRevB.106.085408 journal journal Physical Review B volume 106, pages 085408 (year 2022)NoStop
http://arxiv.org/abs/2306.03157v1	20230605181007	Extreme Value Statistics and Arcsine Laws of Brownian Motion in the Presence of a Permeable Barrier Barrier	[ "Toby Kay", "Luca Giuggioli" ]	cond-mat.stat-mech	[ "cond-mat.stat-mech" ]	EVS and Arcsine Laws of Brownian Motion with a Permeable Barrier]Extreme Value Statistics and Arcsine Laws of Brownian Motion in the Presence of a Permeable Barrier ^1 Department of Engineering Mathematics, University of Bristol, Bristol, BS8 1UB, United Kingdom ^2 Bristol Centre for Complexity Sciences, University of Bristol, Bristol, BS8 1UB, United Kingdom [email protected] July 31, 2023 The Arcsine laws of Brownian motion are a collection of results describing three different statistical quantities of one-dimensional Brownian motion: the time at which the process reaches its maximum position, the total time the process spends in the positive half-space and the time at which the process crosses the origin for the last time. Remarkably the cumulative probabilities of these three observables all follows the same distribution, the Arcsine distribution. But in real systems, space is often heterogeneous, and these laws are likely to hold no longer. In this paper we explore such a scenario and study how the presence of a spatial heterogeneity alters these Arcsine laws. Specifically we consider the case of a thin permeable barrier, which is often employed to represent diffusion impeding heterogeneities in physical and biological systems such as multilayer electrodes, electrical gap junctions, cell membranes and fragmentation in the landscape for dispersing animals. Using the Feynman-Kac formalism and path decomposition techniques we are able to find the exact time-dependence of the probability distribution of the three statistical quantities of interest. We show that a permeable barrier has a large impact on these distributions at short times, but this impact is less influential as time becomes long. In particular, the presence of a barrier means that the three distributions are no longer identical with symmetry about their means being broken. We also study a closely related statistical quantity, namely, the distribution of the maximum displacement of a Brownian particle and show that it deviates significantly from the usual half-Gaussian form. § INTRODUCTION Diffusion is ubiquitous, appearing as a transport mechanism in many physical, chemical and biological systems. Often these systems are littered with spatial heterogeneities which impede or hamper the diffusive motion. One of the most common forms of these heterogeneities are permeable barriers, such that diffusive particles either pass through or are reflected upon interaction with the barrier. These barriers appear at various scales inhibiting diffusive movement in many physical and biological contexts, from multilayer electrodes <cit.> and water transport in rock pores <cit.> to drug delivery systems <cit.>. Permeable material can be found in many examples in cell biology whose function is to regulate the flux of biochemicals between spatial regions <cit.>, such as the bilayer plasma membrane of eukaryotes <cit.> and the electrical gap junctions in neurons <cit.>. As well as being prominent in magnetic imaging techniques of water molecules diffusing through cellular compartments <cit.>. Permeable substances also present themselves at larger scales such as heterogeneous landscapes, e.g. habitat type <cit.> or the presence of roads and fences <cit.>, affecting the dispersal of animal movement at ecological scales. All these examples make it apparent that it is necessary to build a mathematical understanding of how the diffusive movement statistics is affected by the presence of a permeable barrier. Here we do so by investigating how the extreme value statistics (EVS) and the closely related Arcsine laws of Brownian motion (BM) change with permeable barriers. The celebrated Arcsine laws of BM are a landmark result from Lévy <cit.> describing the probability distribution of three observables of a BM trajectory, x(τ), starting at the origin, over a time interval τ∈[0,t]: (1.) t_m(t), the time at which the trajectory reaches its maximum value, x(t_m)=M, (2.) t_r(t), the total time the trajectory spends in the positive region, x(τ)>0, (3.) t_ℓ(t), the time at which the trajectory crosses the origin for the last time. These quantities are displayed for a sample BM trajectory in figure <ref>. The remarkable feature of these quantities, t_m(t), t_r(t) and t_ℓ(t) is that they all have the same cumulative distribution function <cit.>, ℙ[t_i(t)≤τ\|x(0)=0]=2/πarcsin(√(τ/t)), for i∈{m,r,ℓ}. Then the probability densities of these quantities is given by, 𝒫(t_i,t\|0)=1/π√(t_i(t-t_i)), which displays the counterintuitive property that the density diverges at t_i=0 and t_i=t, which means the value of t_i is more likely to be either extreme, with the mean, t/2, being the minimum. The first Arcsine law in particular has gained a lot of interest due to its prominent role in the field of extreme value statistics <cit.>, where one is often interested in the maximum position, M(t), as well as the time of this event, t_m(t). In this case the joint density is sought, which in the BM case is given by <cit.>, 𝒫(M,t_m,t\|0)=M/2 π D t_m^3/2√(t-t_m)e^-M^2/4 D t_m, where D is the diffusion constant. Marginalization over M of equation (<ref>) recovers equation (<ref>) whereas over t_m, the following half-Gaussian distribution is found <cit.> 𝒫(M,t\|0)=e^-M^2/4D t/√(π D t). In recent literature there has been a large effort to extend these EVS and Arcsine laws to when the underlying stochastic process is not the simple BM. EVS studies include, various generalizations of BM <cit.>, as well as other stochastic processes such as Bessel <cit.>, Lévy flights <cit.>, random acceleration <cit.> and run-and-tumble <cit.>. More recently, the time between the maximum and minimum of a stochastic process has been studied as well <cit.>. In addition, the other two Arcsine laws have been studied, together or separately, in numerous contexts, such as constrained and resetting BM <cit.>, BM in random mediums <cit.>, bounded regions <cit.>, and with spatial and temporal heterogeneity <cit.>, as well as other stochastic processes such as continuous time random walks <cit.>, random acceleration <cit.>, run-and-tumble <cit.>, fractional BM <cit.> and subdiffusion <cit.>. Despite this vast literature no such study on EVS and Arcsine laws of Brownian motion in the presence of permeable barriers has appeared. Here we provide the first such study. The paper is structured as follows. In section <ref> we introduce the key equations in modelling diffusion in the presence of permeable barriers. In section <ref> we derive the joint density of M(t) and t_m(t) and study the marginal densities. Section <ref> and <ref> are devoted to the density of t_r(t) and t_ℓ(t), respectively, while we summarize our work in section <ref>. § DIFFUSION THROUGH PERMEABLE BARRIERS We consider a Brownian particle, x(t), undergoing diffusion in one dimension in the presence of a permeable barrier at the origin. Classically, this has been modelled by the diffusion equation (DE) along with the following permeable barrier condition (PBC) <cit.>, J(0^±,t)=κ[P(0^-,t)-P(0^+,t)], where P(x,t) represents the probability density of the position of the Brownian particle at time t, with J(x,t)=-D ∂_x P(x,t) being the probability current and the parameter κ representing the permeability of the barrier, respectively, with κ→ 0 representing an impenetrable barrier (reflecting boundary) and no barrier when κ→∞. The notation 0^± indicates the right or left-hand side of the permeable barrier, respectively. As the DE with condition (<ref>) does not lend itself to study quantities other than P(x,t) the present authors have introduced a new fundamental equation <cit.> with which one reformulates the problem in terms of a modified DE that accounts for the PBC in an inhomogeneous term (taken here at the origin for simplicity), ∂ P(x,t)/∂ t=D ∂^2 P(x,t)/∂ x^2 + D/κδ'(x)J(0,t), where δ'(x) represents the derivative of the Dirac-δ function. The convenience of equation (<ref>) is that for any initial condition localized at x_0, P(x,0)=δ(x-x_0) can be solved exactly in the Laplace domain as <cit.> P(x,ϵ\|x_0)=G_0(x,ϵ\|x_0) -∂_x_0G_0(x,ϵ\|0)J_0(0,ϵ\|x_0)/κ/D+ ∂_x_0J_0(0,ϵ\|0), in terms of the Green's function of Brownian motion in the absence of a permeable barrier, G_0(x,t\|x_0)=exp{-(x-x_0)^2/4Dt }/√(4 π Dt). Generalizations to the case when an external potential is present are also possible with G_0(x,t\|x_0) becoming the Green's function of the associated Smoluchowski equation. In equation (<ref>) we have used the Laplace variable ϵ to indicate that for an arbitrary time-dependent function, f(t), has its Laplace transformed expression given by f(ϵ)=∫_0^∞ e^-ϵ tf(t)dt. The notation P(x,t\|x_0) indicates the localized initial condition at x_0 and J_0(x,t\|x_0)=-D∂_x G_0(x,t\|x_0) is defined as the free probability current where ∂_x_0G_0(x,ϵ\|0) implies ∂/∂ x_0G_0(x,ϵ\|x_0)\|_x_0=0. Further convenience in employing the formalism associated with equation (<ref>) is due to the ability to write an equivalent Fokker-Planck (FP) representation, namely the homogeneous (Itô) FP equation <cit.>, ∂_t P(x,t)=L_x P(x,t) where L_x=-∂_x A(x) +∂_x^2 B(x) is the Fokker-Planck operator, with the spatially dependent drift and diffusion coefficients given by A(x)=-(D^2/κ)δ'(x) and B(x)=D-(D^2/κ)δ(x). As will become apparent later, we are mainly interested in the backward FP (Kolmogorov) equation in terms of the initial variables, t_0 and x_0, -∂_t_0 P(x_0,t_0)=L_x_0^† P(x_0,t_0), where L^†_x is the formal adjoint of the Fokker-Planck operator i.e. L^†_x=A(x)∂_x+B(x) ∂_x^2. For P(x_0,t_0=0)=δ(x-x_0) and exploiting the time homogeneity of the process, we have <cit.> ∂/∂ tP(x,t\|x_0)=A(x_0)∂/∂ x_0P(x,t\|x_0)+B(x_0)∂^2/∂ x_0^2 P(x,t\|x_0). As was shown in Ref. <cit.>, L is infact self-adjoint, such that the backward FP equation, is given by ∂ P(x,t\|x_0)/∂ t=D ∂^2 P(x,t\|x_0)/∂ x_0^2-D^2/κδ'(x_0)∂_x_0P(x,t\|0), which implies that we can solve equation (<ref>) through the same procedure for which we obtain equation (<ref>). § EXTREME VALUE M AND TIME TO REACH MAXIMUM T_M §.§ Joint Probability Density 𝒫(M,t_m,t\|0^±) We study the time-dependent joint distribution, 𝒫(M,t_m,t\|x_0), of the maximum position M=x(t_m) and the time t_m at which this occurs for a Brownian particle in the presence of a permeable barrier at the origin. Since we consider the particle starting from x_0=0 the presence of the permeable barrier leads to two different joint densities 𝒫(M,t_m,t\|0^+) and 𝒫(M,t_m,t\|0^-). To find these joint densities we proceed by using a path decomposition approach <cit.>, where we exploit the Markovian nature of the process to split the trajectories of the Brownian particle into two parts. The first part is {x(τ): τ∈ [0,t_m]} and the second part is {x(τ): τ∈ [t_m,t] }, see figure <ref>. Clearly the first part of the trajectory can be expressed as the probability of reaching M for the first time at t_m, which is the first-passage time distribution ℱ(M,t_m\|0^±). The second part is the probability that the particle starting at M does not reach this position again in the remaining time, this is the survival probability S(M,t-t_m\|M). As S(M,t-t_m\|M)=0, we remedy this by using the quantity S(M+ε,t-t_m\|M) and taking ε→ 0^+ <cit.>. We now proceed to find the two quantities, ℱ(x,t\|x_0) and S(x,t\|x_0). This calculation was performed in detail in Ref. <cit.>, where using equation (<ref>) a backward equation was found for S(x,t\|x_0), which was used to find ℱ(x,t\|x_0) in the Laplace domain through ℱ(x,ϵ\|x_0)=1-ϵS(x,ϵ\|x_0): ℱ(x,ϵ\|x_0)={[ 2κ e^-\|x-x_0\|√(ϵ/D)/√(Dϵ)[1+e^-2\|x\|√(ϵ/D)]+2κ, x_0<0<x or x<0<x_0,; [√(D ϵ)+2κ] e^-\|x-x_0\|√(ϵ/D)+√(D ϵ)e^-\|x+x_0\|√(ϵ/D)/√(Dϵ)[1+e^-2\|x\|√(ϵ/D)]+2κ, 0<x_0<x or x<x_0<0. ] . We now proceed to calculate the joint distributions for x_0=0^±. §.§.§ Case x_0=0^+. The joint distribution is given by 𝒫(M,t_m,t\|0^+)= lim_ε→ 0^+ℱ(M,t_m\|0^+)S(M+ε,t-t_m\|M)/N(ε), where N(ε) ensures the quantity is normalized, alternatively after Laplace transforming with respect to t_m and t (t_m→ p and t→ϵ) we have, Q_m(M,p,ϵ\|0^+)=lim_ε→ 0^+1/N(ε)∫_0^∞ d t_m e^-p t_mℱ(M,t_m\|0^+) ×∫_0^∞ d t e^-ϵ t S(M+ε,t-t_m\|M) = lim_ε→ 0^+ℱ(M,p+ϵ\|0^+)S(M+ε,ϵ\|M)/N(ε), where we have used the notation Q_m(M,p,t\|0^±)=∫_0^∞ dt_m e^-pt_m𝒫(M,t_m,t\|0^±). Expanding S(M+ε,ϵ\|M) to first order in ε, we have S(M+ε,ϵ\|M)≃ -εlim_x→ M∂_xℱ(x,ϵ\|M)/ϵ and requiring 𝒫(M,t_m,t\|0^±) to be normalized, namely, ∫_0^∞Q_m(M,0,ϵ\|0^±)dM=ϵ^-1, we find N(ε)=ε, and then obtain Q_m(M,p,ϵ\|0^+) =2 e^M √(p+ϵ/D)(e^2 M √(ϵ/D)(√(D ϵ)+2 κ)-√(D ϵ)) (√(D (p+ϵ ))+κ)/√(D ϵ)(e^2 M √(ϵ/D)(√(D ϵ)+2 κ)+√(D ϵ)) (e^2 M √(p+ϵ/D)(√(D (p+ϵ ))+2 κ)+√(D (p+ϵ ))). One can see from equation (<ref>) that in the no barrier limit, κ→∞, equation (<ref>) correctly reduces to Q_m(M,p,ϵ\|0)=e^-M √((p+ϵ)/D)/√(D ϵ), giving equation (<ref>) after the double Laplace inversion. Similarly, in the limit of the barrier becoming impermeable, κ→ 0, we find, Q_m(M,p,ϵ\|0^+)=tanh(M √(ϵ/D)) sech(M √(p+ϵ/D ))/√(D ϵ) after using the following inverse Laplace transform relations: ℒ^-1_ϵ→ t{ϵ^-1/2tanh(a√(ϵ)) }= ϑ_4(0,e^-a^2/t)/√(π t) and ℒ^-1_ϵ→ t{sech(a√(ϵ)) }=aϑ_1'(0,e^-a^2/t)/√(4 π t^3) <cit.>, equation (<ref>) becomes, 𝒫(M,t_m,t\|0^+)=M ϑ_1'(0,e^-M^2/D t_m)ϑ_4(0,e^-M^2/D (t-t_m))/2 π D t_m^3/2√(t-t_m), where ϑ_1(z,q)=∑_n=-∞^∞(-1)^n-1/2q^(n+1/2)^2e^(2n+1)iz and ϑ_4(z,q)=∑_n=-∞^∞(-1)^n q^n^2e^2ni z are the Jacobi Theta functions and ϑ_n'(z,q) represent the derivative with respect to z <cit.>. Interestingly, if we take the small t limit of 𝒫(M,t_m,t\|0^+), which corresponds to ϵ,p →∞ in the Laplace domain for equation (<ref>), we obtain to leading order equation (<ref>). This implies that for t→ 0 the permeable barrier acts as if it is fully reflecting. This can be understood by considering for very small times the particle does not have enough time to interact with the barrier and pass through, meaning that essentially no trajectories reach the other side of the barrier. Although the double inverse Laplace transform of equation (<ref>) for arbitrary κ looks highly non-trivial, significant ground can be made (see <ref>). We find 𝒫(M,t_m,t\|0^+) in terms of two different scaling functions such that, 𝒫(M,t_m,t\|0^+)=κ^3/D^2G^+(κ/DM,κ^2/D t_m) H(κ/DM,κ^2/D (t-t_m)), where, G^+(y,τ_1)=1/π∫_0^∞ e^-τ_1 zsin(y √(z)) h(y,z) dz, and H(y,τ_2)=4/π∫_0^∞e^-τ_2 z/√(z)h(y,z) dz, with h(y,z)=[2+z+zcos(2y√(z))+2√(z)sin(2y√(z))]^-1. From equation (<ref>) one can see we no longer have the transformation symmetry of t_m→ t-t_m, meaning the symmetry about t/2 that one observes in the barrier free case, equation (<ref>), is broken. §.§.§ Case x_0=0^-. For x_0=0^- we have the added complexity that there is a chance the particle will not cross the barrier throughout the whole time period. The probability of this occurring is given by (from equation (<ref>)) S(0^±,t\|0^∓)=e^κ^2t/Derfc(κ√(t/D)), where erfc(z)=1-erf(z) where erf(z)=(2/√(π))∫_0^z du e^-u^2. This means that the maximum position is the origin and it occurs at time t_m=0. Then from equation (<ref>) we have, 𝒫(M,t_m,t\|0^-)= lim_ε→ 0^+1/N(ε)[ℱ(M,t_m\|0^-)S(M+ε,t-t_m\|M) +S(0^+,t\|0^-)δ(M)δ(t_m)]. Similar to equation (<ref>) we perform a double Laplace transform and obtain Q_m(M,p,ϵ\|0^-)= lim_ε→ 0^+1/N(ε)[ℱ(M,p+ϵ\|0^-)S(M+ε,ϵ\|M) +S(0^+,ϵ\|0^-)δ(M)]. Expanding to first order in ε and ensuring normalization we once again find N(ε)=ε, leading to Q_m(M,p,ϵ\|0^-)=κ/√(D(p+ϵ))+κQ_m(M,p,ϵ\|0^+) +Dδ(M)/κ√(D ϵ)+D ϵ. As in equation (<ref>) one can see in the limit κ→∞ equation (<ref>) reduces to the barrier free case, equation (<ref>). In the fully reflecting limit κ→ 0 one recovers 𝒫(M,t_m,t\|0^-)=δ(M)δ(t_m), since no particles pass through, meaning the maximum position will be at the origin being reached instantly. As in the x_0=0^+ case, we see from equation (<ref>) that in short time limit one recovers the fully reflecting limit up to leading order in t_m. However, using Q_m(M,p,ϵ\|0^+) for p,ϵ→∞, equation (<ref>), we find a better approximation Q_m(M,p,ϵ\|0^-)≃κtanh(M √(ϵ/D)) sech(M √(p+ϵ/D ))/D√((p+ϵ)ϵ)+(1/ϵ-κ/√(D ϵ^3))δ(M), which after using ℒ^-1_ϵ→ t{ϵ^-1/2sech(a√(ϵ)) }=θ(e^-a^2/t)/√(π t) <cit.>, equation (<ref>) becomes 𝒫(M,t_m,t\|0^-)≃κθ(e^-M^2/D t_m) ϑ_4(0,e^-M^2/D (t-t_m))/π D √(t_m(t-t_m))+(1-2κ√(t)/√(π D))δ(M)δ(t_m), where θ(q)=∑_n=0^∞(-1)^nq^(n+1/2)^2. Now we perform the double inverse Laplace transform of Eq. (<ref>) to obtain (see <ref>) 𝒫(M,t_m,t\|0^-) =κ^3/D^2G^-(κ/DM,κ^2/D t_m) H(κ/DM,κ^2/D (t-t_m)) +κ^3/D^2I(κ/DM,κ^2/D t_m,κ^2/D (t-t_m)) where I(y,τ_1,τ_2)=e^τ_2erfc(√(τ_2))δ(y)δ(τ_1), H(y,τ_2) is defined in equation (<ref>) and G^-(y,τ_1)= ∫_0^∞e^-τ_1 z/π(sin(y √(z))+√(z)cos(y √(z))) h(y,z) dz, where h(y,z) is defined in equation (<ref>). Again we see the t_m→ t-t_m symmetry breaking as in the x_0=0^+ case. §.§ Marginal Density 𝒫(M,t\|0^±) To find the marginal density 𝒫(M,t\|0^±) one integrates over t_m, i.e. p→0 in equations (<ref>) and (<ref>) and after taking the double Laplace inverse (see <ref>) we get 𝒫(M,t\|0^±)=κ/Dℐ^±(κ/DM,κ^2/Dt) where ℐ^+(y,τ)=1/π∫_0^∞e^-τ z/√(z)j^+(y,z)h^2(y,z)dz, and ℐ^-(y,τ)=1/π∫_0^∞e^-τ z/√(z)j^-(y,z)h^2(y,z)dz + e^τerfc(√(τ))δ(y), with j^±(y,z) defined in equations (<ref>) and (<ref>) and h(y,z) defined in equation (<ref>). We have verified that in the barrier free case (κ→∞) one recovers equation (<ref>). From equations (<ref>), (<ref>) and (<ref>), we find that for t>>D/κ^2 with M∼ D/κ, the integrands in (<ref>) and (<ref>) are dominated by small z, so we expand j^±(y,z)h^2(y,z) to first order in z and then compute the integral to obtain, 𝒫(M,t\|0^+)≃4 κ D (κ t-2M)-κ^2 M^2-2D^2/4 √(π)κ^2 (Dt)^3/2 and 𝒫(M,t\|0^-)≃4 κ D (κ t-5/2M)-κ^2 M^2-6D^2/4 √(π)κ^2 (Dt)^3/2+δ(M)/κ√(π D t). Equations (<ref>) and (<ref>) should be compared with the barrier free case, 𝒫(M,t\|0)≃ (Dt-M^2/4)/√(π D^3 t^3). We plot equation (<ref>) in figure <ref> for the two initial conditions, x_0=0^± whilst varying the dimensionless parameter, κ^2 t/D, and compare to stochastic simulations. One can see for certain parameter values, namely for small permeabilities, the distributions become non-monotonic, and we have a bi-modal shape. In the x_0=0^+ case this feature can be explained by considering for small κ, the particle is unlikely to pass through the barrier and thus being more likely to move away from the barrier leading to a maximum occurring for M>0. Whereas the peak at the origin is caused by the particle managing to pass through the barrier but never returning. The presence of a local minimum near M=0 is thus caused by the less likely scenario in which the particle stays near the barrier, constantly interacting with it, but without venturing too far from the origin. The case x_0=0^- can be explained similarly except there is a non-zero probability that the particle never crosses the barrier leading to the global maximum always occurring at the origin (the Dirac-δ function). §.§ Marginal Density 𝒫(t_m,t\|0^±) Here we consider the marginal density 𝒫(t_m,t\|0^±)=∫_0^∞𝒫(M,t_m,t\|0^±)dM, where from equations (<ref>) and (<ref>), we obtain the scaling relation, 𝒫(t_m,t\|0^±)=κ^2/DF^±_m(κ^2/Dt_m,κ^2/D(t-t_m)), where F^±_m(τ_1,τ_2)=∫_0^∞G^±(y,τ_1)H(y,τ_2)dy. The integral in equation (<ref>) is hard to compute, but we can study the asymptotic forms of F^±_m(τ_1,τ_2). Firstly, we study the short time asymptotics, t<<D/κ^2, which can be approximated by the marginal over M of equations (<ref>) and (<ref>). By using the series form of the Jacobi theta functions and integrating over we have F_m^+(τ_1,τ_2) ≃∑_n=-∞^∞∑_m=-∞^∞(-1)^m+n (2 n+1) √(τ_2)/π√(τ_1)(4 m^2 τ_1+(2 n+1)^2 τ_2) = ∑ _n=-∞^∞(-1)^n cosech((n+1/2)π√(τ_2/τ_1))/2 τ_1, where we used ∑_m=-∞^∞ (-1)^m (m^2+z)^-1=πcosech(π√(z))z^-1/2. And, F_m^-(τ_1,τ_2)≃∑_n=-∞^∞∑_m=-∞^∞ (-1)^m+n(4 π m^2 τ_1+(2 n+1)^2πτ_2)^-1/2. Now we study the long time asymptotics of 𝒫(t_m,t\|0^±), which corresponds to t>>D/κ^2. We find it more convenient to do this in the Laplace domain, where we use equations (<ref>) and (<ref>). There are two regimes which give the full picture of the asymptotics for t→∞: keeping t_m finite in the first regime and keeping t-t_m finite in the second. This corresponds to ϵ→ 0 with p >> ϵ and p ∼ϵ in the Laplace domain, respectively. Expanding around ϵ,p→0 to leading order in equations (<ref>) and (<ref>) and integrating over M one can see that we obtain, Q_m(p,ϵ\|0^±)=1/√(ϵ(p+ϵ)), which after double inverse Laplace transforming recovers the Arcsine distribution, (<ref>). For the case p>>ϵ, let us expand Q_m(p,ϵ\|0^+) around ϵ→ 0 keeping p finite, then we find Q_m(p,ϵ\|0^+)≃2 (√(D p)+κ)/√(D ϵ)∫_0^∞e^-M √(p/D)/√(D p)(1+e^-M √(p/D))+2 κdM, which gives after performing the integral and inverse Laplace transforming with respect to ϵ, Q_m(p,t\|0^+)≃2 (√(D p)+κ) arctan((D p)^1/4/(√(D p)+2 κ )^1/2)/√(π t)(D p)^1/4[p (√(D p)+2 κ)]^1/2. Since equation (<ref>) is very difficult invert, we can investigate the asymptotic dependence for t_m→ 0. This corresponds to p→∞, thus by expanding Eq. (<ref>) to leading order for p→∞ and using arctan(1)=π/4, we find Q_m(p,t\|0^+)∼√(π)/2 √(p t ), and performing the Laplace inversion with respect to p we get, 𝒫(t_m,t\|0^+)∼1/2 √(t_m t) for t_m→ 0 , t→∞. For the case x_0=0^-, using equation (<ref>), we find, 𝒫(t_m,t\|0^-)∼√(π)κ/2 √(D t) + √(D)/κ√(π t)δ(t_m) for t_m→ 0 , t→∞. It is clear that equations (<ref>) and (<ref>) deviate from the Arcsine law, ∼ 1/π(t_m t)^-1/2, showing the permeable barrier has an influence for t→∞ when t_m is finite. And for the x_0=0^- case the singularity at t_m→0 is provided by the Dirac-δ function. We plot equation (<ref>) in figure <ref> to show the excellent match to simulations. One can see that for the different initial conditions x_0=0^±, 𝒫(t_m,t\|0^±) has two different shapes. When x_0=0^+ and for small permeabilities one can see the minimum of the distribution is just after t_m=0, which is due to the small likelihood of the particle reaching its maximum and then passing through the barrier and never returning. The peak at t_m=0 indicates the particle instantly crosses the barrier and never returns. For x_0=0^- and for small permeabilities the distribution is strongly weighted by the Dirac-δ function indicating the particle never crosses the barrier. However, if the barrier is crossed, it is very unlikely for the particle to cross again meaning it is more likely to reach the maximum at t_m=t. § RESIDENCE TIME IN POSITIVE HALF-SPACE T_R Here we study the second Arcsine law, namely the residence time the particle, starting at the origin, spends in the region x>0 when a permeable barrier is placed at the origin. Once again, due to the presence of this permeable barrier, we have two distinct initial positions, x_0=0^+ and x_0=0^-. To proceed we utilize the fact that the residence time can be written as the functional, t_r(t)=∫_0^t Θ(x(t'))dt', where Θ(z) is the Heaviside step function. From Feynman-Kac theory <cit.>, we know that Q_r(p,t\|x_0)=∫_0^∞ e^-p t_r𝒫(t_r,t\|x_0)dt_r=⟨ e^-p t_r(t)\| x_0=x(0)⟩ satisfies the following backward Feynman-Kac equation, ∂ Q_r(p,t\|x_0)/∂ t=A(x_0)∂ Q_r(p,t\|x_0)/∂ x_0+B(x_0)∂^2 Q_r(p,t\|x_0)/∂ x_0^2 -p Θ(x_0)Q_r(p,t\|x_0), where we use the backward Fokker-Planck operator in equation (<ref>). Using the self-adjoint nature of this backward Fokker-Planck operator, we may write equation (<ref>) as ∂ Q_r(p,t\|x_0)/∂ t=D∂^2 Q_r(p,t\|x_0)/∂ x_0^2-pΘ(x_0)Q_r(p,t\|x_0)-D^2/κδ'(x_0)∂_x_0Q_r(p,t\|0), with the initial condition Q_r(p,0\|x_0)=1. In the Laplace domain, t→ϵ, the solution to (<ref>) is given by (see <ref>), Q_r(p,ϵ\|x_0)=𝒬(p,ϵ\|x_0) +∂_x_0𝒬(p,ϵ\|0) ∂_x 𝒢(0,p,ϵ\|x_0) /κ/D^2-∂^2_x,x_0𝒢(0,p,ϵ\|0), where 𝒢(x,p,t\|x_0) is the Green's function of the barrier free Feynman-Kac equation, i.e. ∂𝒢(x,p,t\|x_0)/∂ t=D∂^2 𝒢(x,p,t\|x_0)/∂ x_0^2-pΘ(x_0)𝒢(x,p,t\|x_0), with 𝒢(x,p,0\|x_0)=δ(x_0-x) and 𝒬(p,t\|x_0)=∫_-∞^∞𝒢(x,p,t\|x_0)dx. The solution of equation (<ref>) can be found by solving in the Laplace domain, ϵ𝒢(x,p,ϵ\|x_0)-δ(x_0-x)={[ D ∂^2/∂ x_0^2𝒢(x,p,ϵ\|x_0)- p 𝒢(x,p,ϵ\|x_0) x_0>0,; D ∂^2/∂ x_0^2𝒢(x,p,ϵ\|x_0) x_0<0. ] . Two boundary conditions are required with equation (<ref>) for x_0→±∞. As 𝒫(t_r,t\|x_0→∞)=δ(t_r-t) and 𝒫(t_r,t\|x_0→-∞)=δ(t_r), this corresponds to 𝒢(x,p,ϵ\|x_0→∞)=(ϵ+p)^-1 and 𝒢(x,p,ϵ\|x_0→ -∞)=ϵ^-1. In addition, we require continuity at the origin for 𝒢(x,p,ϵ\|x_0) and its derivative <cit.>, i.e. 𝒢(x,p,ϵ\|0^-)=𝒢(x,p,ϵ\|0^+) and lim_x_0→0^-∂_x_0𝒢(x,p,ϵ\|x_0)=lim_x_0→0^+∂_x_0𝒢(x,p,ϵ\|x_0). The presence of the Dirac-δ function on the left-hand side (LHS) means we have two more conditions, such that we have continuity at x_0=x therefore 𝒢(x,p,ϵ\|x^-)=𝒢(x,p,ϵ\|x^+) and from integrating over the Dirac-δ, we have lim_x_0→ x^-∂_x_0𝒢(x,p,ϵ\|x_0)-lim_x_0→ x^+∂_x_0𝒢(x,p,ϵ\|x_0)=1/D. Solving equation (<ref>) with the aforementioned conditions to obtain 𝒢(x,p,ϵ\|x_0) and inserting into equation (<ref>) gives Q_r(p,ϵ\|x_0). Setting x_0=0^+ and x_0=0^- leads to, Q_r(p,ϵ\|0^+)=√(D)ϵ +κ(√(p+ϵ)+√(ϵ))/√(D)ϵ (p+ϵ )+κ√(ϵ)(√(ϵ (p+ϵ ))+p+ϵ), and Q_r(p,ϵ\|0^-)=√(D) (p+ϵ )+κ(√(p+ϵ)+√(ϵ))/√(D)ϵ (p+ϵ )+κ√(ϵ)(√(ϵ (p+ϵ ))+p+ϵ). Instantly one can see that in the no barrier limit, κ→∞, we recover the Arcsine law, Q_r(p,ϵ\|0)=1/√(ϵ(p+ϵ)). For finite κ the double inverse Laplace transform (p→ t_r and ϵ→ t) of equations (<ref>) and (<ref>) can be written in terms of the scaling relation (see <ref>), 𝒫(t_r,t\|0^±)=κ^2/DF_r^±(κ^2/Dt_r,κ^2/D(t-t_r)) where, F_r^+(τ_1,τ_2)=f^+(τ_1,τ_2)+g^+(τ_1,τ_2)+e^τ_1erfc(√(τ_1))δ(τ_2), and F_r^-(τ_1,τ_2)=f^-(τ_1,τ_2)+g^-(τ_1,τ_2)+e^τ_2erfc(√(τ_2))δ(τ_1). The Dirac-δ functions appear due to the particle spending the whole time in the positive region or none of the time in that region, and so are multiplied the probability of never crossing the barrier for the whole time t, i.e. equation (<ref>). The scaling functions in equations (<ref>) and (<ref>) are given by (see <ref>), f^+(τ_1,τ_2)=1/√(πτ_1)e^τ_2erfc(√(τ_2)), f^-(τ_1,τ_2)=2/π√(τ_2/τ_1)-2τ_2f^+(τ_1,τ_2), and g^±(τ_1,τ_2)=∑_n=0^∞(-1)^n τ_1^n/2/Γ(n/2+1)𝒞_n^±(τ_2), where 𝒞_n^+(τ_2) and 𝒞_n^-(τ_2) are detailed in equations (<ref>) and (<ref>) and Γ(z)=∫_0^∞ t^z-1e^-tdt is the Gamma function. By having the analytical expressions for 𝒫(t_r,t\|0^±), we can study the asymptotics of this distribution. For the short time asymptotics, t<<D/κ^2, we take τ_1,τ_2 → 0 in F_r^±(τ_1,τ_2) and use f^+(τ_1,τ_2)≃ 1/√(πτ_1) and g^+(τ_1,τ_2)≃ 2√(τ_1/τ_2)/π (see <ref>) to give 𝒫(t_r,t\|0^+)≃κ/√(π D t_r)+2κ^2 √(t_r)/π D √(t-t_r)+(1-2κ√(t_r/π D))δ(t-t_r). Then from equation (<ref>) we have f^-(τ_1,τ_2)≃ 2 √(τ_2/τ_1)/π and g^-(τ_1,τ_2)≃ 1/√(πτ_2) (see <ref>) for τ_1,τ_2→0, which leads to the following symmetrical dependence for t<<D/κ^2, 𝒫(t_r,t\|0^+)=𝒫(t-t_r,t\|0^-). The long time asymptotics, t>>D/κ^2, corresponds to the limit ϵ→ 0 in the Laplace domain, by expanding Q_r(p,ϵ\|0^±) in equations (<ref>) and (<ref>) around small ϵ to leading order whilst keeping p+ϵ finite, one obtains Q_r(p,ϵ\|0^±)≃ 1/√(ϵ(p+ϵ)), leading to the Arcsine distribution, 𝒫(t_r,t\|0^±)≃1/π√(t_r(t-t_r)), showing how the influence of the permeable barrier on 𝒫(t_r,t\|0^±) wanes over time. We plot 𝒫(t_r,t\|0^±) in figure <ref> to show the excellent match with stochastic simulations. By varying the strength of the permeability of the barrier the resulting curves move further from the Arcsine distribution, where for smaller κ, the peaks at t_r=0 and t_r=t become sharper. This illustrates the notion that once the particle crosses the barrier it is unlikely to do so again for small permeabilities. § TIME OF THE LAST CROSSING OF THE ORIGIN T_ℓ Finally, we consider the third Arcsine law, the probability density, 𝒫(t_ℓ,t\|0^±), of the last time the Brownian particle crosses the origin, which in our case is equivalent to passing through the permeable barrier. Unlike the previous two Arcsine laws, the probability distribution is the same for either x_0=0^+ or x_0=0^-, as the crossing process is symmetric about the origin. Thus, for simplicity we take x_0=0^+. To find 𝒫(t_ℓ,t\|0^+) we exploit the Markovian nature of the process and use a path decomposition approach similar to the method used in section <ref>. Again we split the trajectory into two parts, {x(τ): τ∈ [0,t_ℓ]} and {x(τ): τ∈ [t_ℓ,t] }, where the first part is the trajectory that crosses the origin at t_ℓ, and the second part is that the trajectory does not reach the origin for the remaining time t-t_ℓ. However, the presence of a permeable barrier at the origin adds further complexity, due to the probability of reaching 0^+ and 0^- being different. Therefore, we write 𝒫(t_ℓ,t\|0^+) as, 𝒫(t_ℓ,t\|0^+)=lim_ε→ 0^+1/N(ε)[P(0^-,t_ℓ\|0^+)S(-ε,t-t_ℓ\|0^-) +P(0^+,t_ℓ\|0^+)S(ε,t-t_ℓ\|0^+)], where the sum in equation (<ref>) comes from the last passage being an up crossing or a down crossing. We take the limit ε→ 0^+ to find the double Laplace transform of 𝒫(t_ℓ,t\|0^+), i.e. Q_ℓ(p,ϵ\|0^+)=∫_0^∞ dt e^-ϵ t∫_0^∞ dt_ℓ e^-pt_ℓ𝒫(t_ℓ,t\|0^+), such that Q_ℓ(p,ϵ\|0^+)=lim_ε→ 0^+1/N(ε)[P(0^-,p+ϵ\|0^+)S(-ε,ϵ\|0^-) +P(0^+,p+ϵ\|0^+)S(ε,ϵ\|0^+)], where P(x,ϵ\|x_0) is given by equation (<ref>) and S(±ε,ϵ\|0^±) is found to first order in ε as previously. To find the normalization factor N(ϵ), we use the normalization condition, ∫_0^t 𝒫(t_ℓ,t\|0^+)dt_ℓ=1-S(0^-,t\|0^+), which indicates that due to the presence of the permeable barrier, there is a probability that the particle will not cross the origin in a time t. After substituting these expressions into (<ref>) and using (<ref>) we find N(ε)=ε/D, giving Q_ℓ(p,ϵ\|0^+)=κ/√(ϵ(p+ϵ))(√(D ϵ)+κ), using standard inverse Laplace transform relations <cit.>, we obtain 𝒫(t_ℓ,t\|0^+)=κ^2/DF_ℓ(κ^2/Dt_ℓ,κ^2/D(t-t_ℓ)), where F_ℓ(τ_1,τ_2)=f^+(τ_1,τ_2) for f^+(τ_1,τ_2) defined in equation (<ref>). The striking feature here is that the scaling function that fully describes 𝒫(t_ℓ,t\|0^+) is also part of the scaling function describing the residence time density, 𝒫(t_r,t\|0^+). Comparing the short time limit, t<<D/κ^2, 𝒫(t_ℓ,t\|0^+)≃κ/√(π D t_ℓ), and the long time limit, t>>D/κ^2 for t_ℓ<<t , 𝒫(t_ℓ,t\|0^+)≃1/π√(t_ℓ(t-t_ℓ)), to that of 𝒫(t_r,t\|0^+), i.e. equations (<ref>) and (<ref>), we see that the peaks at the origin of both distributions have the same time dependence. This feature can be understood by considering that for instantaneous last crossing times, t_ℓ << t, this crossing event is almost certainly going to be the first and last crossing, which corresponds to the residence time being equivalent to the last crossing time t_r=t_ℓ. This breaks down as t_ℓ gets larger, causing the different dependencies of the distributions. In this case equation (<ref>) is not valid for t-t_ℓ→ 0 as f^+(τ_1,0)=1/√(πτ_1). We plot equation (<ref>) in figure <ref> to compare with stochastic simulations, where we see an excellent match. In comparing different κ values the main feature is the presence of a sharper peak at t_ℓ=0 the smaller the permeability, indicating that once the particle crosses the barrier it is unlikely to do so again. Differently from the Arcsine distribution (<ref>), there is no divergence at t_ℓ=t, which is due to there being a non-zero probability of not crossing the barrier for every interaction. We note that instead if one is interested in the distribution of the particle returning to the same side of the barrier for the last time, one would recover the Arcsine distribution. § CONCLUSION In summary, we have investigated the extreme-value statistics and Arcsine laws of Brownian motion in the presence of a permeable barrier at the origin, using an inhomogeneous diffusion equation which accounts for the presence of a permeable barrier. The presence of this barrier requires considering two initial positions, the right and left-hand side of the barrier, i.e. x_0=0^+ and x_0=0^-, respectively. Firstly, using a path-decomposition technique we have obtained the joint density of the maximum displacement, M(t), and the time to reach it, t_m(t), for the two initial conditions, 𝒫(M,t_m,t\|0^±). We have found that this quantity can be represented by the multiplication of two different scaling functions, indicating the distribution is no longer symmetric under a t_m→ t-t_m transformation. For the x_0=0^- case a Dirac-δ centered at t_m=0 is also present due to the probability of not passing through the barrier in finite time. At short times, t<<D/κ^2, 𝒫(M,t_m,t\|0^+) can be asymptotically approximated by the distribution for when the barrier is fully reflecting, κ=0, which is given in terms of Jacobi Theta functions. This approximation is valid due to a very small number of particles manange to go through the barrier for short times. For 𝒫(M,t_m,t\|0^-) we find a stronger approximation than just the reflecting barrier distribution, which is δ(M)δ(t_m), which accounts for the very few particles that do cross the barrier. We have also investigated the respective marginal distributions, 𝒫(M,t\|0^±) and 𝒫(t_m,t\|0^±). The presence of the barrier has a large impact on the monotonicity of the distribution, 𝒫(M,t\|0^±), where for certain permeabilities a maximum not at the origin appears. At long times, t>>D/κ^2, the distribution is still dependent on κ. For 𝒫(t_m,t\|0^±) the distribution remains asymmetric for long times, such that for large t_m the usual Arcsine distribution is recovered, whereas we get a different dependence for t_m→ 0. For the rest of the paper we have investigated the other two Arcsine laws, namely the distributions of the residence time, t_r(t), and the last crossing of the origin, t_ℓ(t). Using Feynman-Kac theory we have calculated 𝒫(t_r,t\|0^±) analytically and have found the dependence in terms of a scaling function. For x_0=0^+ and x_0=0^- we have a Dirac-δ located at t_r=t and t_r=0, respectively, due to the particle never crossing the barrier. In the short time limit we have found that the scaling functions for x_0=0^± are equivalent under the transformation t_r→ t-t_r, and in the long time limit we recover the Arcsine distribution. Finally, we have studied 𝒫(t_ℓ,t\|0^±), which is equivalent for either initial condition x_0=0^+ or x_0=0^-, since t_ℓ(t) is a crossing event. Taking into account up and down crossings we have found 𝒫(t_ℓ,t\|0^±) in terms of known functions. Interestingly the scaling function that describes this distribution happens to be part of the scaling function which describes 𝒫(t_r,t\|0^+), where the peak at the origin of both distributions have the same dependence, because for t_ℓ<<t the first crossing very likely corresponds to the last crossing, which implies t_ℓ=t_r. As t_ℓ becomes larger this is no longer the case, and we do not observe a divergence as t_ℓ→ t, due to the non-zero probability of not crossing the barrier for any interaction. Possible extensions of this study would include the analysis of how a permeable barrier affects the time, T, between the maximum and minimum of the process <cit.>. It would be interesting to see if the presence of a barrier breaks the symmetry around T=0 and whether the initial position i.e. x_0=0^± leads to differences in the respective distributions. Another interesting avenue to explore is changing the underlying Brownian motion to a different stochastic process, such as anomalous subdiffusion (where an equation akin to (<ref>) has been found for this case <cit.>), and what is the impact of a permeable barrier to the unperturbed statistics. TK and LG acknowledge funding from, respectively, an Engineering and Physical Sciences Research Council (EPSRC) DTP student grant and the Biotechnology and Biological Sciences Research Council (BBSRC) Grant No. BB/T012196/1 and NERC Grant No. NE/W00545X/1. This work was carried out using the computational facilities of the Advanced Computing Research Centre, University of Bristol - http://www.bristol.ac.uk/acrc/. § SOLUTION OF THE FEYNMAN-KAC EQUATION Here we show how the solution of equation (<ref>), Q_r(p,t\|x_0), can be represented in terms the Green's function, 𝒢(x,p,t\|x_0), of the barrier free Feynman-Kac equation, (<ref>). If we take the last term on the right-hand side (RHS) of equation (<ref>) as an inhomogeneous term, we may construct the solution as follows, Q_r(p,t\|x_0) =∫_-∞^∞ dy 𝒢(y,p,t\|x_0) Q_r(p,0\|y) - D^2/κ∫_0^t dt' ∫_-∞^∞ dy 𝒢(y,p,t-t'\|x_0) δ'(x_0) ∂_x_0Q_r(p,t'\|0). Using Q_r(p,0\|y)=1 with 𝒬(p,t\|x_0)=∫_-∞^∞𝒢(y,p,t\|x_0) and Laplace transforming, t→ϵ, we have Q_r(p,ϵ\|x_0)=𝒬(p,ϵ\|x_0)+D^2/κ∂_x 𝒢(0,p,ϵ\|x_0) ∂_x_0Q_r(0,ϵ\|0). Then by taking the derivative of both sides of equation (<ref>) with respect to x_0 and setting x_0=0, we find ∂_x_0Q_r(0,ϵ\|0)=∂_x_0𝒬(p,ϵ\|0)/1-D^2/κ∂^2_x,x_0𝒢(0,p,ϵ\|0), then after inserting equation (<ref>) into (<ref>) we obtain (<ref>). § DOUBLE INVERSE LAPLACE TRANSFORM OF Q_M(M,P,Ε\|0^±) To perform the Laplace inversion of Q_m(M,p,ϵ\|0^+), we write equation (<ref>) as Q_m(M,p,ϵ\|0^+)=1/κG^+(κ/DM,D/κ^2(p+ϵ))H(κ/DM,D/κ^2ϵ), then 𝒫(M,t_m,t\|0^+) is given by the two Bromwich integrals, 𝒫(M,t_m,t\|0^+) =κ^3/D^21/(2π i)^2∫_γ_1 -i ∞^γ_1+i∞ ds_1 e^κ^2/Dt_m s_1 G^+(κ/DM,s_1) ×∫_γ_2 -i ∞^γ_2+i∞ ds_2 e^κ^2/D(t-t_m) s_2H(κ/DM,s_2), where γ_1 and γ_2 are greater than the real part of all singularities of G^+(κ/DM,s_1) and H(κ/DM,s_2), respectively and G^+(y,s_1) and H(y,s_2) are given by, G^+(y,s_1)=e^y√(s_1)(√(s_1)+1)/√(s_1)+e^2y√(s_1)(√(s_1)+2) and H(y,s_2)=2(-√(s_2)+e^2y√(s_2)(√(s_2)+2))/√(s_2)(√(s_2)+e^2 y√(s_2)(√(s_2)+2)). To find 𝒫(M,t_m,t\|0^+) we require the following Laplace inversions ℒ^-1_s_1→τ_1{G^+(y,s_1) } and ℒ^-1_s_2→τ_2{H(y,s_2) }, then 𝒫(M,t_m,t\|0^-) only requires the Laplace inversion, ℒ^-1_s_1→τ_1{G^-(y,s_1) }, where G^-(y,s_1)=(√(s_1)+1)^-1G^+(y,s_1). §.§ Laplace Inversion of G^±(y,s_1) From the definition of G^+(y,s_1) in equation (<ref>) we see that G^+(y,s_1) has no poles but has a branch point at s_1=0. Thus, by taking the branch cut to be the negative real axis, then G^+(y,s_1) is analytic inside the contour, C, in figure <ref>, meaning that ∮_C e^s_1 τ_1G^+(y,s_1) ds_1=0. Then by taking R→∞ and α→ 0 for the contour C the Laplace inversion is given by, ℒ^-1_s_1→τ_1{G^+(y,s_1)}=1/2π i∫_C_1 e^s_1 τ_1G^+(y,s_1) ds =-1/2π i(∫_C_3+∫_C_5) e^s_1 τ_1G^+(y,s_1) ds_1 because in the limit R→∞ the contributions from C_2 and C_6 vanish, and for α→ 0 the contribution from C_4 is zero. Therefore, all we require is finding the integrals ∫_C_3 and ∫_C_5. For ∫_C_3 we let s_1=ze^i π, giving ∫_C_3 e^s_1 τ_1G^+(y,s_1) ds_1= -∫_R^α e^- τ_1 z e^i y√(z)(i√(z)+1)/i√(z)+e^2iy√(z)(i√(z)+2)dz, and for ∫_C_5 we let s_1=ze^-i π, leading to ∫_C_5 e^s_1 τ_1G^+(y,s_1) ds_1= -∫_α^R e^- τ_1 z e^-i y√(z)(-i√(z)+1)/-i√(z)+e^-2iy√(z)(-i√(z)+2)dz. Taking R→∞ and α→ 0, substituting back into equation (<ref>) and converting the complex exponentials to trigonometric functions, we obtain G^+(y,τ_1) as defined in equation (<ref>). Similarly, since G^-(y,s_1)=(√(s_1)+1)^-1G^+(y,s_1), one can see that by altering the above calculations it leads to the definition of G^-(y,τ_1) in equation (<ref>). §.§ Laplace Inversion of H(y,s_2) From equation (<ref>) one can see that H(y,s_2) has a branch point at s_2=0. Proceeding similarly to the above case, we use the contour in figure <ref> and obtain ℒ^-1_s_2→τ_2{H(y,s_2)}=1/2π i∫_C_1 e^s τ_2H(y,s_2) ds =-1/2π i(∫_C_3+∫_C_5) e^s_2 τ_2H(y,s_2) ds_2, because in the limit R→∞ and α→0 the contributions from C_2, C_6 and C_4 vanish, and we have ∫_C_3 e^s_2 τ_2H(y,s_2) ds_2= -∫_R^α e^- τ_2 z 2(-i√(z)+e^2i√(z)(i√(z)+2))/i√(z)(i√(z)+e^2 i√(z)(i√(z)+2))dz, and ∫_C_5 e^s_2 τ_2H(y,s_2) ds_2= -∫_α^R e^- τ_2 z 2(i√(z)+e^-2i√(z)(-i√(z)+2))/-i√(z)(-i√(z)+e^-2 i√(z)(-i√(z)+2))dz. After taking R→∞, α→0 and substituting these expressions into equation (<ref>) one can see that we recover H(y,τ_2) in equation (<ref>). § INVERSE LAPLACE TRANSFORM OF Q_M(M,T\|0^±) The marginal over t_m of 𝒫(M,t_m,t\|0^+) corresponds to Q_m(M,0,ϵ\|0^+) and from equations (<ref>), (<ref>) and (<ref>), we are looking for the Laplace inversion, ℒ^-1_s →τ{ℐ^+(y,s)}, where ℐ^+(y,s)=2e^y√(s)(√(s)+1)(-√(s)+e^2y√(s)(√(s)+2))/√(s)(√(s)+e^2y√(s)(√(s)+2))^2. Once again we have a branch point at the origin and thus use the contour C in figure <ref> to perform the Laplace inversion. The contributions from C_2, C_6 and C_4 vanish, leaving us to calculate ∫_C_3 and ∫_C_5. By using the substitutions, s=ze^iπ and s=ze^-iπ for C_3 and C_5 respectively, whilst taking R→∞ and α→ 0, we have ℒ^-1_s→τ{ℐ^+(y,s) }=-1/2π i(∫_C_3+∫_C_5) e^s τℐ^+(y,s) ds =1/π∫_0^∞e^-τ z/√(z)j^+(y,z)h^2(y,z)dz, where j^+(y,z)=(5z+4)cos(y√(z))-zcos(3y√(z))+8√(z)sin^3(y√(z)). Similarly, since ℐ^-(y,s)=(√(s)+1)^-1ℐ^+(y,s)+(√(s)+s)^-1δ(y), we find ℒ^-1_s→τ{ℐ^-(y,s) } =-1/2π i(∫_C_3+∫_C_5) e^s τℐ^-(y,s) ds =1/π∫_0^∞e^-τ z/√(z)j^-(y,z)h^2(y,z)dz + e^τerfc(τ)δ(y), where, j^-(y,z)=(4-z)cos(y√(z))-3zcos(3y√(z))+2√(z)[z+(z-2)cos(2y√(z))]sin(y√(z)). § DOUBLE INVERSE LAPLACE TRANSFORM OF Q_R(P,Ε\|0^±) Starting from equations (<ref>) and (<ref>), we may write Q_r(p,ϵ\|0^±)=D/κ^2F_r^±(D/κ^2(p+ϵ),D/κ^2ϵ), therefore 𝒫(t_r,t\|0^±)=κ^2/Dℒ^-1_s_2→τ_2{ℒ^-1_s_1→τ_1{F_r^±(s_1,s_2) }}, for τ_1=κ^2 t_r/D and τ_2=κ^2 (t-t_r)/D, where F_r^+(s_1,s_2)=s_2+√(s_1)+√(s_2)/s_1 s_2+√(s_2)(√(s_1 s_2)+s_1) and F_r^-(s_1,s_2)=s_1+√(s_1)+√(s_2)/s_1 s_2+√(s_2)(√(s_1 s_2)+s_1). We now proceed to compute the Laplace inversions, s_1→τ_1 and s_2→τ_2, of equations (<ref>) and (<ref>). §.§ Double Laplace Inversion of F_r^+(s_1,s_2) Let us first write equation (<ref>) as F_r^+(s_1,s_2)=1/√(s_1)(s_2+√(s_2))+s_2+s_2+√(s_2)/s_1 (s_2+√(s_2))+√(s_1) s_2, and using the following inverse Laplace transform relations <cit.>: ℒ^-1_s_1→τ_1{1/√(s_1)+a}=1/√(πτ_1 )-a e^a^2 τ_1 erfc(a √(τ_1 ),) and ℒ^-1_s_1→τ_1{1/√(s_1)(√(s_1)+a)}=e^a^2 τ_1 erfc(a √(τ_1 )), we obtain ℒ^-1_s_1→τ_1{F_r^+(s_1,s_2)} =1/√(πτ_1)(s_2+√(s_2)) + (1-1/(√(s_2)+1)^2) × e^s_2 τ_1/(√(s_2)+1)^2erfc(√(s_2 τ_1)/√(s_2)+1). Taking the inverse Laplace transform of the first term on the left-hand side (LHS) of equation (<ref>) gives equation (<ref>). To take the inverse Laplace transform of the second term we use the following series representation, e^z^2erfc(z)=∑_n=0^∞(-1)^n z^n/Γ(n/2+1), where we then have (1-1/(√(s_2)+1)^2)e^s_2 τ_1/(√(s_2)+1)^2erfc(√(s_2 τ_1)/√(s_2)+1) =(1+ζ_1(√(s_2))/√(s_2)) ×∑_n=0^∞(-1)^nτ_1^n/2/Γ(n/2+1)ζ_n+1(√(s_2)), where ζ_n(√(s_2))=(√(s_2)/1+√(s_2))^n. We now proceed to calculate the inversion, ℒ^-1_s_2→τ_2{ζ_n(√(s_2))}, where we first find the inversion of ℒ^-1_s_2→τ_2{ζ_n(s_2)}. We do this by utilizing the following property, ℒ_τ→ s{d^n/d τ^n f(τ)}= s^n f(s)-∑_m=1^n s^n-mlim_τ→0d^m-1/d τ^m-1f(τ), for some arbitrary function f(τ). Using ℒ^-1_s→τ{(1+s)^-n}=τ^n-1e^-τ/Γ(n), and from the generalized product rule we have d^n/d τ^nτ^n-1e^-τ/Γ(n)=e^-τ∑_k=0^n (-1)^k n kτ^k-1/Γ(k)=-n _1F_1(n+1,2,-τ), where _1F_1(a,b,z) is the Kummer confluent hypergeometric function <cit.>. From, d^m-1/d τ^m-1τ^n-1e^-τ/Γ(n)=τ^n-m_1F_1(n,n+m-1,-τ), and since for τ→0 this is only non-zero for m=n, we have, ℒ^-1_s_2→τ_2{ζ_n(s_2)}=-n_1F_1(n+1,2,-τ_2)+δ(τ_2). To find ℒ^-1_s_2→τ_2{ζ_n(√(s_2))} we use the property <cit.>: ℒ^-1_s→τ{f(√(s))}=1/√(4πτ^3)∫_0^∞ u e^-u^2/4τ f(u)du, and calculate the following integral as 1/√(4 πτ ^3)∫_0^∞ u e^-u^2/4 τ _1F_1(n+1;2;-u) du =1/√(πτ) _2F_2(n/2+1/2,n/2+1;1/2,3/2;τ) -1/2 (n+1) _2F_2(n/2+1,n/2+3/2;3/2,2;τ), then ℒ^-1_s_2→τ_2{ζ_n(√(s_2))} =n/2 (n+1) _2F_2(n/2+1,n/2+3/2;3/2,2;τ_2 ) -n/√(πτ_2 ) _2F_2(n/2+1/2,n/2+1;1/2,3/2;τ_2 )+δ(τ_2), where _2F_2(a,b;c,d,z)=∑ _k=0^∞z^k (a_1)_k (a_2)_k/k! (b_1)_k (b_2)_k, with (x)_n=Γ(x+n)/Γ(x) <cit.>. From equation (<ref>) we also require, ℒ^-1_s_2→τ_2{ζ_n(√(s_2))s_2^-1/2}, where we use the following inversion <cit.>: ℒ^-1_s→τ{s^n-1/(s+1)^n}= _1F_1(n,1,-τ) with equation (<ref>) to find, ℒ^-1_s_2→τ_2{ζ_n(√(s_2))s_2^-1/2} = 1/√(4 πτ_2 ^3)∫_0^∞ u e^ -u^2/4 τ_2 _1F_1(n;1;-u) du =1/√(πτ_2) _2F_2(n/2,n/2+1/2;1/2,1/2;τ_2 )-n _2F_2(n/2+1/2,n/2+1;1,3/2;τ_2 ). Putting all of this together we have F_r^+(τ_1,τ_2)=1/√(πτ_1)e^τ_2erfc(√(τ_2))+∑_n=0^∞(-1)^n τ_1^n/2/Γ(n/2+1)𝒞_n^+(τ_2)+e^τ_1erfc(√(τ_1))δ(τ_2) where 𝒞_n^+(τ_2)=(n+2)[(n+1)/2 _2F_2(n/2+3/2,n/2+2;3/2,2;τ_2 ) - _2F_2(n/2+3/2,n/2+2;1,3/2;τ_2 )]+1/√(πτ_2)[ _2F_2(n/2+1,n/2+3/2;1/2,1/2;τ_2 ) -(n+1) _2F_2(n/2+1,n/2+3/2;1/2,3/2;τ_2 )]. §.§ Double Laplace Inversion of F_r^-(s_1,s_2) We write F_r^-(s_1,s_2) as F_r^-(s_1,s_2)=√(s_1)+1/√(s_1) s_2+√(s_2)(√(s_1)+√(s_2))+√(s_2)/√(s_1) s_2+s_1 (s_2+√(s_2)), then using equations (<ref>) and (<ref>) with (<ref>), i.e. ℒ^-1_s_1→τ_1{√(s_1)/√(s_1)+a}=-a/√(πτ_1)+a^2e^a^2τ_1erfc(a√(τ_1)) + δ(τ_1), we obtain, ℒ^-1_s_1→τ_1{F_r^-(s_1,s_2)} =1/√(π)(√(s_2)+1)^2 √(s_2 τ_1)+(1-1/(√(s_2)+1)^2) ×e^s_2 τ_1/(√(s_2)+1)^2erfc(√(s_2 τ_1)/√(s_2)+1)/(√(s_2)+1) +1/√(s_2)+s_2δ(τ_1). The Laplace inversion of the first term on the RHS of equation (<ref>) corresponds to equation (<ref>). One can see the second term in equation (<ref>) is only different by a factor of (1+√(s_2))^-1 to the second term on the RHS in equation (<ref>), then by using equation (<ref>), we have (1-1/(√(s_2)+1)^2)e^s_2 τ_1/(√(s_2)+1)^2erfc(√(s_2 τ_1)/√(s_2)+1)/(√(s_2)+1) =(1/√(s_2)+ζ_1(s_2)/s_2) ×∑_n=0^∞(-1)^nτ_1^n/2/Γ(n/2+1)ζ_n+2(√(s_2)). While the inversion ℒ^-1_s_2→τ_2{ζ_n(√(s_2))s_2^-1/2} is given by equation (<ref>), we find ℒ^-1_s_2→τ_2{ζ_n(√(s_2))/s_2} by integrating equation (<ref>) over τ_2 to find, ℒ^-1_s_2→τ_2{ζ_n(√(s_2))/s_2} = _2F_2(n/2,n/2+1/2;1/2,1;τ _2) -2 n √(τ _2)/√(π) _2F_2(n/2+1/2,n/2+1;3/2,3/2;τ _2). By combining all the above we find F_r^-(τ_1,τ_2) to be, F_r^-(τ_1,τ_2)=2/π√(τ_2/τ_1)-2τ_2/√(πτ_1)e^τ_2erfc(√(τ_2))+∑_n=0^∞(-1)^n τ_1^n/2/Γ(n/2+1)𝒞_n^-(τ_2)+e^τ_2erfc(√(τ_2))δ(τ_1), where 𝒞_n^-(τ_2)= _2F_2(n/2+3/2,n/2+2;1/2,1;τ_2)+1/√(πτ_2) _2F_2(n/2+1,n/2+3/2;1/2,1/2;τ_2) -2(n+3)√(τ_2)/√(π) _2F_2(n/2+2,n/2+5/2;3/2,3/2;τ_2)-(n+2) _2F_2(n/2+3/2,n/2+2;1,3/2;τ_2). § ASYMPTOTICS OF G^±(Τ_1,Τ_2) FOR Τ_1,Τ_2→0 Using lim_z→0_2F_2(a,b;c,d;z)=1 and the definition of 𝒞^+(τ_1,τ_2) and 𝒞^-(τ_1,τ_2) in equations (<ref>) and (<ref>) for τ_1,τ_2→ 0 we find that, g^±(τ_1,τ_2) becomes, g^+(τ_1,τ_2)≃∑_n=1^∞(-1)^n+1n τ_1^n/2/Γ(1+n/2)√(πτ_2) and g^-(τ_1,τ_2)≃∑_n=0^∞(-1)^nτ_1^n/2/Γ(1+n/2)√(πτ_2), and for τ_1→ 0 the sums in equations (<ref>) and (<ref>) being dominated by the first term, reduce to g^+(τ_1,τ_2)≃2/π√(τ_1/τ_2), and g^-(τ_1,τ_2)≃1/√(πτ_2). unsrt
http://arxiv.org/abs/2306.02144v2	20230603160057	A two-way translation system of Chinese sign language based on computer vision	[ "Shengzhuo Wei", "Yan Lan" ]	cs.CV	[ "cs.CV" ]	A two-way translation system of Chinese sign language based on computer vision 1st Shengzhuo Wei Harbin Institute of Technology Harbin 150001, China [email protected] 2nd Yan Lan Communication University of China BeiJing 100024, China [email protected] July 31, 2023 ============================================================================================================================================================================================================ As the main means of communication for deaf people, sign language has a special grammatical order, so it is meaningful and valuable to develop a real-time translation system for sign language. In the research process, we added a TSM module to the lightweight neural network model for the large Chinese continuous sign language dataset . It effectively improves the network performance with high accuracy and fast recognition speed. At the same time, we improve the Bert-Base-Chinese model to divide Chinese sentences into words and mapping the natural word order to the statute sign language order, and finally use the corresponding word videos in the isolated sign language dataset to generate the sentence video, so as to achieve the function of text-to-sign language translation. In the last of our research we built a system with sign language recognition and translation functions, and conducted performance tests on the complete dataset. The sign language video recognition accuracy reached about 99.3% with a time of about 0.05 seconds, and the sign language generation video time was about 1.3 seconds. The sign language system has good performance performance and is feasible. Chinese sign language,sign language recognition, sign language generation, language model, Transformer § INTRODUCTION §.§ Background While able-bodied people can use verbal language to communicate easily, people with hearing impairment (deaf or aphasic people, etc.) need to communicate their thoughts through sign language. There are about 20.57 million deaf people in China, accounting for 1.67% of the total Chinese population, including about 800,000 children under the age of 7. They cannot communicate through language as normal people do, but communicate through sign language. Since most of the able-bodied people have not learned sign language, there are obstacles to promote sign language to make it applicable for communication in normal society. Sign language recognition and interpretation technology facilitates communication between hearing-impaired and able-bodied people. Sign language research should not only enable hearing people to read sign language, but also enable hearing people to understand what able-bodied people are saying. Sign language recognition and interpretation are the former, and sign language generation research is the latter. This interaction process is particularly important for people with hearing impairment. Therefore, the study of sign language recognition and interpretation and sign language generation has important theoretical and applied values as well as social significance. Sign language recognition technology and sign language generation technology can help daily communication, sign language interpretation and sign language education activities between deaf and able-bodied people, as well as improve the social skills and quality of life of deaf people, promote mutual understanding and communication between deaf and able-bodied people, and have practicality and applicability in the deaf community. §.§ Related work §.§.§ Current status of research on sign language recognition The sign language recognition method based on wearable devices, i.e., using data gloves to directly obtain the hand shape, angle and relative position of fingers and other precise data of the granting person, so as to obtain the main characteristics of sign language and use recognition algorithms for recognition. This method does not require pre-processing of various information, and the acquired data is accurate and free from environmental interference, with the disadvantage of high cost and complexity of use. Computer vision-based sign language recognition method, i.e., the sign language gesture image or dynamic change information is obtained by camera or radar and input to the algorithm for sign language recognition. Compared with sign language recognition based on wearable devices, sign language personnel do not need wearable devices and the promotion is more advantageous. The disadvantage is that the exclusion of fuzzy frames, the pre-processing of data to exclude interfering information and the accuracy of information is not high. Table I shows the current status of research on sign language recognition in China and abroad. §.§.§ Current status of research on sign language generation With the continuous update of deep neural network theory, the update of intelligent devices and the development of computer technology, inspired by various generative models, researchers around the world have provided several methods or systems for solving the problem of sign language generation. Table II shows the current status of research on sign language generation in China and abroad. In summary, domestic and foreign research scholars have proposed many methods for sign language generation, however most of the generation methods are useful for generating sequences containing temporal information, on the other hand Chinese sign language is a sign language expression different from other languages, and the generation methods proposed by research scholars for Japanese, English or Greek cannot be directly used for the generation of Chinese sign language, and the models are not universal. To address the above problems this paper proposes a deep learning-based sign language recognition and sign language generation method and provides a system that can be used for two-way communication between deaf and normal people, which can be extended for other scenarios. §.§ Research Content This paper describes the importance of sign language in the communication between deaf and able-bodied people, and presents the research of Chinese sign language recognition algorithm and sign language generation algorithm based on deep learning and the implementation of the system. Deep learning is an artificial neural network technique that can learn and classify a large amount of data. In sign language recognition technology, deep learning technology can learn and classify a large amount of sign language images and video data to achieve recognition and translation of sign language. The research of Chinese sign language recognition technology and sign language generation technology and system based on deep learning can provide more accurate and efficient sign language recognition and translation services for communication between deaf and able-bodied people. In this paper, we combine different behavior recognition depth models, study the advantages and shortcomings of currently existing sign language recognition algorithms, delve into the latest research results of deep learning at home and abroad, consider the structural characteristics and structural advantages of existing convolutional neural network models, and explore the applicability, stability, and reliability of different structural convolutional neural networks in the field of sign language recognition. In the part of sign language recognition algorithm research, this paper firstly conducts video preprocessing, video feature extraction on the Chinese sign language continuous utterance SLR dataset constructed by the University of Science and Technology of China, and then adds the TSM module with better processing capability of temporally strongly correlated video to ResNet-50 and MobileNet models for training sign language video and analyzing experimental data; meanwhile, conducts Action-net, another type of behavior recognition model, is experimented to recognize sign language videos and analyze the experimental data; through experimental comparison, the performance and effect of the models are verified, and a sign language recognition algorithm suitable for CSL continuous utterance dataset is selected to realize the recognition and translation of sign language continuous utterances. In the part of sign language generation, the research aims to transform the spoken Chinese text into the sequence of sign language language through jieba splitting and then processed by Bert model, corresponding to the corresponding sign language vocabulary video, to complete the translation from text to video, and to verify the performance and effect of the model. § METHOD §.§ System Structure Design This project is dedicated to designing a two-way sign language translation system, which is mainly divided into sign language recognition part and sign language generation part, and the main flow chart of the two parts is as the following Figure1. In this system, since sign language recognition translation is a temporal strong correlation process, TSM in behavior recognition model with Action-net is used for correlation model training. In this system, the sign language generation part relies heavily on the natural corpus segmentation and processing, so the Bert pre-training model, which is more efficient and accurate, is chosen as the basis for development. §.§ Sign language dataset The correspondence rules between sign language grammar and natural language grammar are important indicators for the selection of sign language datasets. According to the study of sign language linguistics, usually the sign languages of some countries can be divided into natural sign language and statute sign language (or gestural sign language). Taking Chinese sign language as an example, Chinese sign language can be divided into natural sign language and gestural Chinese. Natural sign language is mainly used by the hearing impaired and has a set of systematic grammatical rules, while gestural Chinese is an artificial language that operates directly on the basis of spoken grammar with gestures and has a one-to-one correspondence with Chinese characters, and is therefore also called written sign language. How to map natural sign language and statute sign language is one of the challenges of sign language translation research. Most of the existing research on sign language translation is based on continuous sign language recognition, combined with language models to obtain natural language translations that conform to spoken descriptions. In the future, we can consider constructing large text pair datasets, i.e., the natural sign language annotation set and the corresponding statute sign language annotation set, and pre-training the language model on the text pair dataset first, and then migrating it to the language model of sign language translation. In the continuous sign language utterance dataset, a portion of the dataset has annotations against the text in normal spoken language order, which can be used for sign language generation translation functions, mainly including Boston-104, RWTH-PHOENIX-WEATHER-2014-T, KETI, GSL, MEDIAPI-SKEL corpus, and CSL-Daily datasets. The CSL-Daily dataset can be used for continuous sign language recognition and translation tasks, and it provides spoken language translation and lexical level annotation. Compared with USTC-CCSL, CSL-Daily focuses more on daily life scenarios, including multiple topics such as family life, healthcare and school life. the training, validation and test sets of CSL-Daily contain 18,401, 1,077 and 1,176 video samples, respectively. Figure2 shows the main struct of the dataset and the Table III shows the difference between these datasets. §.§ TSM Model Time Shift Module (TSM), which provides a new approach for effective temporal modeling in video understanding, is an enhanced derivative model for temporal information learning based on the TSN model. In the TSN model, temporal information is fused by taking N images from the video relatively equally and randomly, and then averaging their classification results to achieve a certain degree of temporal information modeling. The TSM model absorbs the advantages of the TSN model, and at the same time, after the selection of each image, uses the shift of the time dimension to enable a single image to contain the information features of multiple neighboring images, thus greatly improving the efficiency of temporal information recognition, and at the same time, because only part of the image information is shifted for information aggregation, feature fusion between different frames can theoretically be achieved on the basis of zero additional computational overhead Joint modeling, which can be computed freely on the basis of two-dimensional convolution, but has a strong time-domain modeling capability. Figure 3 explains the main principles of the TSM model for frame shifting. TSM performs efficient temporal modeling by shifting feature mapping along the temporal dimension.TSM efficiently supports offline and online video recognition. Two-way TSM mixes past and future frames with current frames for high-throughput offline video recognition. One-way TSM blends only past frames with current frames and is suitable for low-latency online video recognition. As shown in the figure, one-way TSM online video recognition requires features from future frames to replace the features in the current frame. One-way TSM online recognition can be achieved by simply transferring features from the previous frame to the current frame. The one-way TSM inference diagram for online video recognition is shown in Figure 4. During the inference process, for each frame, we save the first 1/8 feature mapping of each residual block and cache it in memory. For the next frame, we replace the first 1/8 of the current feature mapping with the cached feature mapping. We use a combination of 7/8 of the current feature mapping and 1/8 of the old feature mapping to generate the next layer, and repeat. Using one-way TSM for online video recognition has several unique advantages: low latency inference. TSM is an enhanced derivative model for temporal information learning based on the TSN model. In the TSN model, the temporal information is fused by taking N images from the video relatively equally and randomly, and then averaging their classification results to achieve a certain degree of temporal information modeling. The TSM model absorbs the advantages of the TSN model, and at the same time, after the selection for each image, uses the shift of the temporal dimension to enable a single image to contain the information features of multiple neighboring images, thus greatly improving the efficiency of temporal information recognition, and at the same time, because only part of the image information is shifted for information aggregation, feature fusion between different frames can be achieved in theory on the basis of zero additional computational overhead Joint modeling. The TSM model part of this project was trained on a cloud computing platform using 5 vCPU Intel(R) Xeon(R) Silver 4210R CPU @ 2.40GHz with RTX 3090 (24GB) * 1. The training was conducted in about 30 hours for SLR-100 sentence dataset and 46 hours for SLR-500 word dataset. §.§ Action-net model Traditional 2D CNNs are computationally inexpensive but cannot capture temporal relationships. In contrast, 3D CNN can capture the temporal relationships but is computationally expensive. In the design of Action-Net, it consists of three attention mechanism modules, including the Spatial-Temporal Excitation module, the Channel Excitation module and the Motion Excitation module, so that it can be more effective for the temporally strongly correlated The video framing is better than the video framing. The format of the image is [N,T,C,H,W], where N denotes batch size, T denotes number of segments, C denotes number of channels, H denotes height height, W denotes width, and r is the channel loss rate channel reduce radio. Figure 5 illustrates the main structure of the Acrion-net module. ACTION module: The ACTION module is made up of the three attention modules mentioned above in parallel. This module is plug-and-play like the previous work TSM. The base model uses the same ResNet-50 as in the previous work. The sign language recognition and translation process designed in this project belongs to the temporal strong related project, meanwhile, since TSM and Action-net perform well in behavior recognition and there are more related materials, this project uses TSM and Action-net models for sign language translation related training Traditional 2D CNNs are computationally inexpensive but cannot capture temporal relationships. While 3D CNN can capture the temporal relationship, but it is computationally more expensive. In the design of Actionnet, the Spatial-Temporal Excitation module, the Channel Excitation module, and the Motion Excitation module are proposed. Finally, they are added together to implement the Action module. Thus, it has a good effect on the video frame splitting with strong timing correlation. The Action model natively supports jester, sth-sth v1, v2 and many other mainstream datasets. Considering the file structure and other issues, we finally chose to process the existing SLR dataset into jester standard format. The processing starts with frame-slicing the video from the existing dataset using tools such as ffmpeg. After the video is frame-separated, a python-based script is used to count the number of frames, RGB and optical flow information of the frame-separated file. Since the Action native code uses pkl files to save the tag information, the Pickle library is called to save the corresponding path information and tag information to the corresponding tag pkl files after distinguishing the training set and the test set. In this project, the TSM model was partially trained on a cloud computing platform using 15 vCPU AMD EPYC 7543 32-Core Processor with RTX A5000 (24GB) * 1, where the SLR-100 sentence dataset was trained for about 20 hours. §.§ Bert model (bert-base-Chinese) Bert is an unsupervised pre-trained language model for natural language processing tasks. The goal of the Bert model is to use a large-scale unlabeled corpus to train and obtain a textual semantic information-rich The goal of the Bert model is to train a large-scale unlabeled corpus, obtain a semantic representation of the text containing rich semantic information, and then fine-tune the semantic representation of the text for a specific NLP task and finally apply it to that NLP task. Work on sign language generation relies heavily on the analysis and segmentation of natural language, and Bert has a good efficiency and performance in processing natural corpus. Therefore, in this project, a pre-trained bert-base-Chinese model is used as the basis, and further training and tuning is performed on top of it to realize the process of segmenting and adapting natural language into sign language sequences. In the sign language video-to-annotation-to-text based sign language translation paradigm, the sign language translation process is divided into two phases: the first phase treats sign language recognition as an intermediate tokenization component that extracts sign language annotations from the video; the second phase is a language translation task that maps the sign language annotations to spoken text. In the processing of the CSL-Daily dataset, its video-map is first extracted to select the corresponding information of the useful natural and sign language sequences. Then it is converted into a format suitable for training the bert model. In training, the model first reads the original sentences of each data item, and then compares them with the validated sentences after the word separation process. The experiments in this chapter are built on the datasets corresponding to large sign language texts, i.e., the natural sign language annotation set and the corresponding statute sign language annotation set, and the language model is first pre-trained on the text pair dataset and then migrated to the language model for sign language translation. The input spoken text is taken through the Bert-Base-Chinese model, and the corresponding sign language video is automatically output by the system, as shown in Figure 6: This experimental model is partially trained on a cloud computing platform using a 5 vCPU Intel(R) Xeon(R) Silver 4210R CPU @ 2.40GHz with RTX 3090 (24GB) * 1 for training. The Bert model can already be used for natural language word separation, and is trained on top of the existing Bert-base-Chinese pre-training model by importing CSL-Daily related data sets. The purpose of this training is to output the words generated by the model in sign language sequence for subsequent generation of sign language videos, and to complete the spoken text-syntax-sign language annotation. Figure 7 illustrates the main steps of sign language segmentation using the Bert model. § RESULTS §.§ TSM experimental results In the training for 100 consecutive sentences, the following results were obtained after 117 iterations based on resnet50. Figure 8 shows the training results of TSM based on resnet50 for 100 sentences. Testing Results: Prec@1 99.300 Prec@5 99.960 Loss 0.02676 In the training of 500 isolated sign language words, the following results were obtained after 30 iterations based on resnet50. Figure 9 shows the training results of TSM based on resnet50 for 500 isolated words Testing Results: Prec@1 96.840 Prec@5 96.840 Loss 0.11426 In the training for 100 consecutive sentences, the following results were obtained after 117 iterations based on mobilenet. Figure 9 shows the training results of mobilenet-based TSM for 500 isolated words. Testing Results: Prec@1 95.240 Prec@5 95.240 Loss 0.17194 §.§ Action-net experiment results In the training for 100 sentences, the following results were obtained after 48 iterations. Testing Results: Prec@1 34.580 Prec@5 62.050 Loss 2.6734 §.§ Comparison of TSM and Action-net experiments After 48 iterations of training in TSM and Actionnet respectively, the results are as the follow Table IV. Considering the model accuracy and model convergence speed, TSM is used as the implementation model in this project. Also in the TSM training based on different underlying models, after 100 iterations each, the results are as the follow Table V: Considering the model accuracy and model convergence speed, and due to the poor performance of mobilenet in the post-test, the TSM model with resnet50 as the underlying layer was finally adopted for the target implementation in this project. §.§ Sign Language Interpretation Test Results The test for the sign language translation module of this project is mainly divided into two parts: continuous sentence recognition and isolated word recognition, and the main test contents are as follows. The video of continuous sign language sentences was obtained from the friendly assistance of students from the sign language club of HIT, and the video of isolated word sign language was obtained from the public sign language information website and related data sets. Tested on the trained model, both recognition results are better, and the isolated word sign language recognition model will be mainly used in the follow-up. §.§ Bert experimental results After iterating a total of about 23k steps over a total of 20654 statements in the CSL-Daily dataset, the following results are obtained. Figure 11 shows the Bert model training results graph. § DISSCUSSION Finally, we realize a two-way interactive system for sign language recognition and sign language generation. In sign language recognition, based on the CSL Chinese sign language dataset, the relatively stable and high recognition rate TSM-Resnet50 model is selected, and the continuous sign language sentences are cut and recognized in the sign language video in the test, and the natural order Chinese is generated by adjusting the order. In the sign language generation, based on the Chinese corpus, word cutting and division of natural utterances are realized by Bert model and adjusted to sign language order, and corresponding videos in the Chinese sign language dataset and generating sign language videos, which realize the two-way recognition and generation of sign language and natural language. After the test of dividing and recognizing 20 videos of consecutive sign language utterances with less than 10 words, and the test of generating 20 videos of Chinese utterances with less than 20 words in sign language, the accuracy and stability of the two-way process of the system reach a high level. After future development and improvement, thanks to the convenience and light weight of computer vision, the system will be used in hardware terminals or mobile devices to realize two-way communication between normal groups and hearing-impaired people, and for sign language education to improve the quality of life and happiness of hearing-impaired people, help them better integrate into the general society, and also promote the better development of special education and welfare. We hope to further improve the accuracy and fault tolerance of recognition by improving the frame cut recognition model and expanding the Chinese sign language corpus in the future, so that it can recognize continuous complex utterances in complex light environments and be put into the welfare business of integrating hearing-impaired people into society as soon as possible. 00 b1 A. Vaswani et al., "Attention Is All You Need," arXiv, 2017. b2 J. Lin et al., "TSM: Temporal Shift Module for Efficient Video Understanding," 2018. b3 Z. Wang et al., "ACTION-Net: Multipath Excitation for Action Recognition," 2021. b4 C. Wei et al., "Semantic Boundary Detection With Reinforcement Learning for Continuous Sign Language Recognition," IEEE Transactions on Circuits and Systems for Video Technology, vol. PP, no. 99, pp. 1-1, 2020. b5 H. Zhou et al., "Improving Sign Language Translation with Monolingual Data by Sign Back-Translation," 2021. b6 S. Egea et al., "Syntax-aware Transformers for Neural Machine Translation: the Case of Text to Sign Gloss Translation," 2021. b7 D. Guo et al., "A review of sign language recognition, translation and generation," Computer Science, vol. 048, no. 003, pp. 60-70, 2021. b8 D. Guo et al., "Connectionist Temporal Modeling of Video and Language: a Joint Model for Translation and Sign Labeling," in Twenty-Eighth International Joint Conference on Artificial Intelligence IJCAI-19, 2019.
http://arxiv.org/abs/2306.02854v1	20230605131048	Asymmetric Patch Sampling for Contrastive Learning	[ "Chengchao Shen", "Jianzhong Chen", "Shu Wang", "Hulin Kuang", "Jin Liu", "Jianxin Wang" ]	cs.CV	[ "cs.CV" ]	Asymmetric Patch Sampling for Contrastive Learning Chengchao Shen1, Jianzhong Chen1, Shu Wang1, Hulin Kuang1, Jin Liu1, Jianxin Wang1 1Central South University {scc.cs,cjz_csu,wangshu.dr,hulinkuang,liujin06}@csu.edu.cn, [email protected] July 31, 2023 ======================================================================================================================================================================================================= empty Asymmetric appearance between positive pair effectively reduces the risk of representation degradation in contrastive learning. However, there are still a mass of appearance similarities between positive pair constructed by the existing methods, which inhibits the further representation improvement. In this paper, we propose a novel asymmetric patch sampling strategy for contrastive learning, to further boost the appearance asymmetry for better representations. Specifically, dual patch sampling strategies are applied to the given image, to obtain asymmetric positive pairs. First, sparse patch sampling is conducted to obtain the first view, which reduces spatial redundancy of image and allows a more asymmetric view. Second, a selective patch sampling is proposed to construct another view with large appearance discrepancy relative to the first one. Due to the inappreciable appearance similarity between positive pair, the trained model is encouraged to capture the similarity on semantics, instead of low-level ones. Experimental results demonstrate that our proposed method significantly outperforms the existing self-supervised methods on both ImageNet-1K and CIFAR dataset, e.g., 2.5% finetune accuracy improvement on CIFAR100. Furthermore, our method achieves state-of-the-art performance on downstream tasks, object detection and instance segmentation on COCO. Additionally, compared to other self-supervised methods, our method is more efficient on both memory and computation during training. The source code is available at <https://github.com/visresearch/aps>. § INTRODUCTION In recent years, massive breakthroughs are achieved in self-supervised/unsupervised learning field. Based on the difference of pretext tasks, the popular branches contain contrastive learning (CL) <cit.> and masked image modeling (MIM) <cit.>. For contrastive learning task, the trained model is required to discriminate different views of the same images from other images, named instance discrimination <cit.>. To learn semantic representations of images, contrastive learning methods introduce a series of asymmetric designs, such as data augmentation<cit.>, to increase the appearance discrepancy between positive pairs, but without changing image semantics. In this way, the trained model is encouraged to understand the semantics in images, instead of some trivial features. Therefore, plausible asymmetric designs are significantly important for the performance of contrastive learning. However, due to image overlap between positive pair, there is still a mass of appearance similarity in the existing contrastive learning methods, which degrades the representations. Different from contrastive learning, MIM task follows the idea of masked language modeling task (MLM) <cit.> in natural language processing (NLP), where partially masked data are fed into the model to predict the invisible part of data in an auto-encoding manner. Due to the heavy spatial redundancy of image, the highly random masked images in MIM task can still effectively retain the semantics of the original images <cit.>, which achieves very promising performance in self-supervised learning. However, with the similar semantics, the raw pixels or their tokens have a large fluctuation on appearance, leading to non-unique solutions to invisible patch reconstruction from the random masked images, especially when the masked ratio is large. The existing MIM methods attempt to map the highly masked image into a fixed target, which inevitably introduces large fitting error, even if the prediction is a plausible solution for the given input. We call it as non-unique target issue, which substantially limits the flexibility of the MIM models. Inspired by the above observations, we propose a novel asymmetric patch sampling strategy, to introduce more asymmetry for contrastive learning and alleviate the non-unique target issue suffered by the existing MIM methods at the same time. Specifically, the improvement is two fold. First, to improve the semantics of contrastive pretext task, the proposed sampling strategy constructs positive pairs, where the two views are essentially semantic consistent but with inappreciable similarity on appearance. Second, compared to MIM methods, we replace the reconstruction objective with contrastive one, which provides more flexible targets for training. As shown in Figure <ref>, our proposed method respectively adopts two different patch sampling strategies for two views of positive pair, named asymmetric patch sampling strategy (APS). For the first view, we conduct sparse patch sampling <cit.> to obtain highly sparse patch sequences, which only contain small portion of patches from the original image, e.g., 25%. This operation aims to reduce spatial redundancy of image and encourage the Visual Transformer (ViT) network to model long distance dependency among patches. For the second view, we conduct a selective patch sampling, where the patches not appearing in the first view are preferred to be sampled. In this way, the appearance of the sampled views are essentially different from each other. To minimizing the contrastive objective, the ViT model is required to understand the semantics of images. Furthermore, we formally analyze the asymmetry of the proposed method. To improve training stability of contrastive learning, we further propose an adaptive gradient clip operation. In summary, our main contribution is an asymmetric patch sampling strategy to construct efficient positive pairs for contrastive learning, which allows two views to represent the same object with essentially different appearances. The trained model is hard to fit the contrastive objective by only simply comparing low-level features. Thus, it is encouraged to extract semantic representations from the asymmetric positive pairs. Experimental results demonstrate that the proposed APS achieves excellent performance on unsupervised representation learning. Specifically, for both ViT-Small/16 and ViT-Base/16, our method significantly outperforms the previous best results on ImageNet-1K. When pretrained on small datasets, CIFAR10 and CIFAR100, our method respectively surpasses the previous state-of-the-art method by 1.2% and 2.5% using ViT-Tiny/2 backbone. Furthermore, our method also achieve state-of-the-art performance on downstream tasks, object detection and instance detection on COCO. § RELATED WORK §.§ Masked Image Modeling Following MLM task <cit.> in NLP, masked image modeling is proposed as a novel pretext task for self-supervised learning in computer vision. In this task, the masked raw pixels <cit.> or their tokens <cit.> are used as the targets for model training. However, with the similar semantics, the raw pixels or their tokens have a large fluctuation on appearance, which may provide not so stable supervision signal. Moreover, the solutions of the given masked image are generally not the unique one, especially when the masked ratio is high, which may cause large prediction error on a plausible prediction and effect the flexibility of model learning. To this end, feature prediction based methods are proposed to alleviate the above issue. iBOT <cit.> performs self-distillation to recover invisible patch tokens from visible ones. CAE <cit.> adopts the representation alignment between visible patches and invisible patches before decoder in MIM task. SIM <cit.> introduces siamese network structure to align semantics between the tokens from different augmented views by mask operation. In spite of the encouraging results achieved, these methods still heavily rely on the unstable targets for pixel/token reconstruction. In contrast, the proposed method models masked images by learning instance similarity between significantly different views sampled by asymmetric sampling strategy, which provides more flexible and stable targets for self-supervised learning. §.§ Contrastive Learning Contrastive learning conducts instance classification by maximizing representation similarity under different distortions of a sample (positive pair) and minimizing the one of different samples (negative pair), to learn invariant representation of data under different distortions <cit.>. To avoid trivial solutions and learn valid representation, asymmetric designs play a vital role in contrastive learning, which introduce a series of variances on low-level features but without changing the semantics of images <cit.>. The most important asymmetric design is a series of data augmentation techniques applied on positive pair, which is the most widely adopted by popular contrastive learning methods <cit.>. For example, color jitter, gray scale and solarize operation significantly change the color of images in positive pairs, so the model in the contrastive setting is required to capture the color-invariant representations. Then random crop operation introduces variance on object parts and scale, which further removes the dependency on object parts and scale for model. Therefore, the model is trained to recognize objects using semantic features, instead of trivial ones. The asymmetric designs are also introduced into network architectures, such as prediction head <cit.> and momentum encoder <cit.>, which disturb the representation of positive pairs. In this work, we introduce a novel effective asymmetric operation, asymmetric patch sampling strategy. It constructs a series of significant different positive pairs, each of which contains quite little appearance similarity with their distorted version. To minimizing the contrastive objective, the model is encouraged to learn more semantic and useful representation. §.§ Hard Sample Mining Hard sampling mining is widely adopted in object detection <cit.>, to alleviate the extreme foreground-background class imbalance of dataset. OHEM <cit.> selects the ROI with large loss to update the model during training. Focal loss <cit.> dynamically scales cross entropy loss for training samples, which encourages the model to focus on hard samples. These methods tap hard samples according to the loss value during training for object detection. However, they also boost the potential negative effect caused by mislabeled samples. In contrast, our method directly constructs hard positive pairs by sampling different patch combinations from the same objects, which obtains informative samples with fewer potential mislabeled ones. § METHOD §.§ Overview In the setting of contrastive learning, it's believed that positive pairs with large appearance discrepancy can effectively regularize the representation learning. To further improve appearance discrepancy, we adopt sparse patch sampling strategy as masked image modeling methods, in which only small portion of patches are sampled to construct positive pairs. In this way, two views of positive pair have fewer overlapping patches and effectively improve the asymmetry on low-level features. As shown in Figure <ref>, the input image x is randomly cropped into two sub-images x_1^' and x_2^', and then processed by data augmentation 𝒯_1(·) and 𝒯_2(·) to obtain the positive pair for contrastive learning, which can be represented as [x_1^', B_1] = 𝒯_1(x), [x_2^', B_2] = 𝒯_2(x), where B_i (i = 1,2) denotes the bounding box produced by random image crop. To further reduce the appearance similarity on patches, we conduct asymmetric sampling strategy 𝒜(·), including sparse sampling and selective sampling, to lower the overlapping probability between the two target views as follows, [x_1, x_2] = 𝒜(x_1^', x_2^', B_1, B_2; s_1, s_2), where s_i (i = 1, 2) denotes the patch sampling ratio of x_i^', e.g., s_1 = s_2 = 0.25. Then, combined with projection head 𝒢(·), the positive pair [x_1, x_2] is respectively fed into visual transformer ℱ(·) to obtain the representation z_i = 𝒢(ℱ(x_i)). Additionally, prediction head module ℋ(·) is adopted, to increase the asymmetry between the representations of positive pair. The output can be written as q_i = ℋ(z_i). Finally, we conduct contrastive learning between projection representation z_i and prediction representation q_i, to learn appearance-invariant representations from positive pair with extremely asymmetric appearance. §.§ Asymmetric Patch Sampling As shown in Figure <ref>, the overlap ratio between patches from x_1^' and x_2^' can be computed as follows, r_ overlap = 𝒮(P_1 ∩ P_2)/𝒮(P_2), where P_i (i = 1,2) denotes the sampled patch in view i and 𝒮(·) denotes the area of the given patch. To reduce the sampling probability of overlapping patches, we propose a selective patch sampling method, whose sampling probability density p_ sel is computed by p_ sel = (γ + 1) · s_1 · (1 - r_ overlap)^γ, where γ is a hyper-parameter to tune the sensitivity of sampling. As shown in Figure <ref>, the larger γ is, the smaller possibility of the sampled overlapping patches is. This selective sampling method and sparse sampling form the asymmetric sampling strategy. Since sparse sampling strategy uniformly samples patch from the first view x_1, the probability of patches sampling in the overlapping area x_1 ∩ x_2 is also s_1 as the one in x_1. Hence, the sampling probability density is required to meet the following equation, ∫_0^1 p_ sel dr_ overlap = s_1, which guarantees that the total probability meets the ratio of our proposed sampling strategy in x_1 ∩ x_2[More details can be found in the supplementary material.]. In other words, all areas under the curves in Figure <ref> equal to s_1. §.§ Asymmetry Analysis In this section, we formally analyze the asymmetry of patch sampling strategy, to quantify the appearance discrepancy between positive pairs. For convenience, we focus on the spatial asymmetry, which is simply defined as the non-overlap ratio between the images of positive pair. With consideration of sampling randomness, we measure the spatial asymmetry by the expectation of non-overlap ratio between positive pairs, where non-overlap ratio is defined as r_ non = 1 - r_ overlap and r_ overlap denotes the overlap between images from positive pair. The expectation of non-overlap ratio 𝔼_ non can be obtained from the expectation of overlap ratio 𝔼_ overlap by 𝔼_ non = 1 - 𝔼_ overlap. For brevity, we focus on the analysis of 𝔼_ overlap as follows. As shown in Figure <ref> (a), a naive patch sampling strategy uniformly samples patches from the same image crop to construct positive pairs for contrastive learning. The sampling probability of each patch in crop x_1^' and x_2^' can be regarded as their sampling ratios, s_1 and s_2, respectively. This patch sampling strategy subjects to bernoulli distribution, where each patch in the crop takes overlap probability of s_1 · s_2 and non-overlap probability of (1 - s_1 · s_2). Therefore, the expectation of overlap ratio between positive pair by the naive path sampling strategy can be computed as 𝔼_ overlap^ naive = 1 · s_1 · s_2 + 0 · (1 - s_1 · s_2) = s_1 · s_2. This sparse patch sampling strategy can effectively reduce the overlap between positive pair. For example, when s_1 = s_2 = 0.25, the expectation of ratio 𝔼_ overlap^ naive = 0.0625, which means only 6.25% region is overlapped in the two views of positive pairs on average and significantly improves asymmetry. To further improve the asymmetry between positive pair, we combine the random image crop operation and the asymmetric patch sampling strategy as Figure <ref> (b). So the overlap ratio between the patches from x_1 and x_2 varies from 0 to 1 (r_ overlap∈ [0, 1]), instead of discrete values, 0 and 1, as naive patch sampling strategy, which allows introducing more asymmetry. Specifically, we conduct asymmetric patch sampling using Eq. <ref>. As naive patch sampling, the overlap probability density of asymmetric sampling can be computed by p_ overlap = p_ sel· s_2. So the expectation of overlap ratio between positive pair can be obtained by 𝔼_ overlap^ sel = ∫_0^1p_ overlap· r_ overlap d r_ overlap = s_1 · s_2/γ + 2. In other words, the overlap ratio of asymmetric patch sampling strategy is 1/γ + 2 of the one by naive patch sampling strategy, which effectively improves the asymmetry between positive pair. For example, when γ = 3, the expectation of overlap ratio is only 20 % of the naive one according to Eq. <ref> and Eq. <ref>. §.§ Optimization In this section, we use for reference loss function in <cit.> to form our contrastive objective as: ℒ_ contrast = τ·[𝒟(q_1, (z_2)) + 𝒟(q_2, (z_1)) ], 𝒟(q, z) = - ∑_i=1^Nlogexp((q^(i), z^(i)) / τ)/∑_j=1^Nexp((q^(i), z^(j)) / τ ), (q, z) = q^ T· z/‖ q ‖·‖ z ‖, where τ and N respectively denote temperature parameter and batch size, q^(i) and z^(i) respectively denote the representation q and z of i-th sample in mini-batch, (·) denotes stop gradient operation[Temperature τ in ℒ_ contrast is used to simplify the learning rate tuning under different temperature values. More details can be found in the supplementary material]. Compared to <cit.>, the main difference of our objective function is the combination of the normalized temperature-scaled cross entropy loss and stop gradient operation. As clarified in MoCo-v3 <cit.>, contrastive learning methods for vision transformer tend to suffer an unstable optimization issue, which significantly hurts the performance. To stabilize the training, gradient clip strategy is a popular technique, which scales ℓ_2-norm of the excessive gradients to the given maximal norm. However, this clip strategy fails to adapt to the case, where the gradients progressively decay but sometimes abnormal fluctuation during contrastive training. To solve this issue, we set an adaptive threshold for step t according to the exponential moving average of gradient 𝒢_t as follows: 𝒢_t = m ·𝒢_t - 1 + (1 - m) · g_t, where m ∈ [0, 1) is a momentum coefficient and g_t denotes the gradients with respect to model parameters at step t. When ‖ g_t‖ > α·‖𝒢_t-1‖, the gradient g_t is scaled by the norm of threshold 𝒢_t-1: ĝ_t = g_t ·‖𝒢_t-1‖/‖ g_t ‖ + ϵ, where ϵ is set to 10^-8 for better numerical stability, to adjust the amplitude of gradients into a reasonable range and stabilize the training of contrastive learning. § EXPERIMENTS In this section, we conduct experiments to evaluate the effectiveness of our proposed method. First, we give the experiment settings, including model backbone, optimization hyperparameters and other details. Then, we compare our method with state-of-the-art methods on ImageNet-1K and CIFAR. Finally, we further analyze the effectiveness of each component in our method by ablation study. §.§ Experimental Settings §.§.§ Data Processing For both ImageNet-1K <cit.> and CIFAR <cit.>, we sample 25% patches from the given images, namely sampling ratio s_1 = s_2 = 0.25. The sizes of input image are 224 × 224 and 32 × 32 for ImageNet-1K and CIFAR, respectively. Additionally, more data augmentations applied on ImageNet-1K and CIFAR are clarified in the supplementary material. §.§.§ Network Architecture For ImageNet-1K, we adopt ViT-Small/16 and ViT-Base/16 <cit.> (respectively denoted as ViT-S/16 and ViT-B/16) as the backbone, respectively. Following MoCo-v3 <cit.>, projection head and prediction head module are added and the detail can be found in the supplementary material. During pretraining, we adopt fixed sine-cosine position embedding and random initialized patch embedding, which are combined with adaptive gradient operation to improve training stability. The momentum encoder is also applied, whose ema coefficient varies from 0.99 to 1.0 as cosine scheduler. For CIFAR10 and CIFAR100, we conduct experiments on ViT-Tiny/2 and ViT-Small/2 (respectively denoted as ViT-T/2 and ViT-S/2), whose structures are depicted in the supplementary material. Different from experiments on ImageNet-1K, both position and patch embedding are learnable, without training instability issue. Additionally, momentum encoder is not adopted on CIFAR. §.§.§ Optimization For loss function, the temperature τ is set to 0.1 on both ImageNet-1K and CIFAR. For ImageNet-1K, we use AdamW optimizer <cit.> with batch size 4096, learning rate 1.28 × 10^-3, momentum 0.9 and weight decay 0.1. During pretraining, we conduct learning rate warmup for 20 epochs and then follow a cosine learning rate decay schedule for the rest 780 epochs. To further stabilize the training, adaptive gradient clip operation is implemented on each transformer block, where m = 0.4 and α = 1.05. For patch sampling, we set γ = 3 to increase the appearance discrepancy between positive pair. For CIFAR10 and CIFAR100, we use AdamW optimizer with batch size 512, learning rate 1 × 10^-3, momentum 0.9 and weight decay 0.05. The model is trained by 1,600 epochs, where the first 20 epochs for warmup. Additionally, gradient clip operation is not conducted on the model for CIFAR. §.§.§ Evaluation Linear probing has been a popular evaluation protocol for contrastive learning. However, it fails to evaluate the quality of non-linear features <cit.>. For our proposed method, the input image fed into network is highly sparse instead of complete one during training, which is significantly different from the input samples during evaluation. Hence, we adopt finetune protocol to evaluate the representation of our model, instead of linear probing one. By default, all pretrained models are finetuned for 100 epochs. §.§ Image Classification §.§.§ Results on ImageNet-1K As show in Table <ref>, our proposed method achieves 82.6% finetune accuracy on ViT-B/16, which significantly outperforms the previous SOTA method iBOT by 0.8% finetune accuracy. Moreover, our proposed method achieves 84.7% finetune accuracy on ViT-B/16, which outperforms the previous SOTA method iBOT by 0.9% finetune accuracy. We believe that our method tends to extract more semantic representation by modeling representation similarity between asymmetric positive pairs. Moreover, our method does not require additional tokenizer, such as DALL-E <cit.> to provide visual tokens as supervision signal, which is more efficient and concise. Compared to previous state-of-the-arts, MaskFeat and iBOT, our method requires shorter training schedule but achieves better performance. §.§.§ Results on CIFAR As shown in Table <ref>, our method with ViT-T/2 achieves 97.4% and 83.9% finetune accuracy on CIFAR10 and CIFAR100, respectively, surpassing the previous state-of-the-art method, iBOT by 1.1% and 3.8% on CIFAR10 and CIFAR100, respectively. For ViT-S/2 backbone, our method consistently outperforms the previous best finetune accuracy by 1.0% on CIFAR10 and 2.0% on CIFAR100. For ViT-B/2 backbone, our proposed method achieves 98.2% and 86.1% accuracy on CIFAR10 and CIFAR100, respectively, which significantly reduces the performance gap with the model pretrained on large-scale dataset: ImageNet-1K in a fully supervised manner. Especially on CIFAR10, our method (input image size: 32 × 32) evens outperform the ImageNet-1K pretrained one using ViT-B/16 (input image size: 224 × 224). Overall, our method achieves the best performance on CIFAR dataset without extra data, even outperforms the model pretrained by large-scale dataset: ImageNet-1K. Moreover, our method consumes the least memory during training, only about 1/6 memory of iBOT and 1/5 memory of MoCo-v3 on both ViT-T/2 and ViT-S/2. Therefore, our method is more friendly to hardware than other self-supervised methods, which sheds some light on more training-efficient self-supervised learning method. Meanwhile, our method is the most computation-efficient self-supervised method, only about 1/15 computation of iBOT and 1/5 computation of MoCo-v3, thus requires less training time. §.§ Transfer Learning on Downstream Tasks To further evaluate the transferability of our method, we conduct transfer learning experiments on downstream tasks: object detection and instance segmentation on COCO <cit.> by Mask RCNN <cit.> framework. As shown in Table <ref>, our proposed APS achieves 51.8 box AP and 46.2 mask AP on objection detection and instance segmentation, respectively. Compared to previous SOTA method iBOT, our APS achieves 0.6 box AP and 2.0 mask AP improvement, which illustrates the effectiveness of our method. §.§ Ablation Study In this section, we implement ablation study to validate the efficiency of modules in our method. For convenience, the experiments are mainly conducted on CIFAR dataset using ViT-T and partially on ImageNet dataset using ViT-S. §.§.§ The Effect of Patch Sampling Ratio To evaluate the effectiveness of patch sampling ratio, we compare the performance using different ratios on CIAFAR10 and CIFAR100. As shown in Table <ref>, our method respectively reports 97.4% and 83.9% accuracy on CIFAR10 and CIFAR100, when sampling ratio s = 0.25. This experimental result on CIFAR100 outperforms the one with s = 1.0 by 1.6%, which demonstrates that patch sampling strategy can effectively improve the representation quality of contrastive learning. In contrast, the experiment using extremely sparse sampling ratio s = 0.15, leads to a 1.9% degradation on CIFAR100, which significantly damages the performance. We believe that reasonable sparse sampling strategy applied on images can effectively regularize the contrastive representation learning. §.§.§ The Effect of Sampling Power To analyze the effect of sapling power γ in Eq. <ref>, we conduct experiments on CIFAR10 and CIFAR100 using different values. As shown in Table <ref>, the model achieves the best performance on both CIFAR10 and CIFAR100 when γ = 3.0. Especially on CIFAR100, the model with γ = 3.0 outperforms the one of γ=0.0 by 2.6%. It demonstrates that the model can benefit from a reasonable sampling power γ, thus is inclined to extract semantic representations from asymmetric positive pairs. However, when γ=4.0, it does not achieve better performance than the one of γ = 1.0 or 3.0. The possible reason is that excessive punishment on highly overlapping patches may reduce the chance of learning some important representations from the neglected patches. For CIFAR10, the performance fluctuation of our method is pretty small under different γ values. This can be in part explained by that, due to less category diversity of CIFAR10, the trained model can not apparently benefit from asymmetric patch sampling strategy. §.§.§ The Effect of Sampling View Number Since only small portion of patches are used during the training, we reuse the rest patches of loaded data to improve the data throughout and training efficiency. Furthermore, we compare the performance when different numbers of sampling views are used to training. As shown in Table <ref>, the experimental results demonstrate that using all sampling views can significantly improve the performance of model. Especially on CIFAR100, 1.5% accuracy improvement is achieved. Additionally, we find that more sampling views can efficiently improve training stability during experiments. §.§.§ The Effect of Adaptive Gradient Clip To investigate the effectiveness of adaptive gradient clip operation, we conduct experiments on small datasets, CIFAR using ViT-T/2 and large-scale dataset, ImageNet-1K using ViT-S/16 for 300 epochs. The experimental results are shown in Table <ref>, demonstrating that the adaptive gradient clip achieves 1.2% accuracy improvement on ImageNet-1K. On the contrary, applying adaptive gradient clip operation on CIFAR degrades the performance. Due to larger sample diversity of ImageNet-1K, the dramatic sample variation among consecutive sample batches is easy to cause instability of model training. The adaptive gradient clip can effectively improve the training stability of model on large-scale dataset. Additionally, we find that clip momentum m = 0.4 can significantly improve the model performance on ImageNet-1K. § CONCLUSION In this paper, we propose a novel asymmetric patch sampling strategy for contrastive learning. This strategy significantly improves the appearance discrepancy between positive pairs and the hardness of pretext task for self-supervised learning. Due to fewer clues to similarity on low-level feature between positive pairs, the model is encouraged to learn semantic representations. Then, we formally analyze the asymmetry metric of our method and compare it with the baseline. Afterwards, we give the optimization objective of our model. Finally, we propose a novel adaptive gradient clip operation to stabilize the training of our model. Experimental results demonstrate that the proposed method is superior to the previous state-of-the-art on both ImageNet-1K, CIFAR and COCO, while consuming less memory and computation. For future work, we plan to explore more effective and efficient asymmetric designs to boost the performance of contrastive learning. ieee_fullname § NETWORK STRUCTURES As shown in Table <ref>, we give the details of backbones used in our experiments. For ImageNet-1K with input size 224 × 224, we adopt standard vision transformer architectures, ViT-Small and ViT-Base, where the patch size for tokenization is 16 × 16. For CIFAR10 and CIFAR100 with input size 32 × 32, we modify the patch size of standard vision transformer architectures from 16 × 16 to 2 × 2, to adapt the small input images. We also introduce a more lightweight vision transformer architecture, ViT-Tiny, which only has half head number and half token dimension of ViT-Small. As shown in Table <ref>, we further present the structure of projection and prediction head adopted during self-supervised pretraining. For ImageNet-1K, there are 3 linear layers in projection head and 2 linear layers in prediction heads. The first two linear layers are followed by batch normalization and rectify linear unit in turn, and the output sizes of them are both 4096. The last linear of both heads are followed by only batch normalization, and output sizes of them are 256. For CIFAR10 and CIFAR100, the configurations of projection and prediction head are similar to the ones of ImageNet-1K. The main differences can be summarized as follows. First, the output sizes of projection and prediction are both modified to 128. Second, the sizes of hidden units are both modified to 512. § DATA AUGMENTATIONS As shown in Table <ref>, we describe the parameters of data augmentations used during self-supervised pretraining. For ImageNet-1K, 6 data augmentation techniques are applied to the input images, including random crop and resize, horizontal flip, color jittering, gray scale, Gaussian blurring, as well as solarization. There are two differences between the augmentations for the construction of positive pair. First, the probability of Gaussian blurring is 1.0 in augmentation 𝒯_1(·), but 0.1 in augmentation 𝒯_2(·). Second, solarization is only used in augmentation 𝒯_2(·). For CIFAR10 and CIFAR100, due to small image size, Gaussian blurring is not used. Additionally, solarization is also not adopted. § ASYMMETRIC PATCH SAMPLING To reduce the probability of sampling in the overlapping patch, we adopt an asymmetric sampling strategy, where the sampling can be represented as p_ sel = ρ· (1 - r_ overlap)^γ, where ρ is the coefficient required to determined. So, as shown in Figure <ref> of the main paper, the larger γ is, the smaller possibility of the sampled overlapping patches is. Due to uniform sampling conducted in the first view x_1^', the probability of patch sampling in the union region x_1^'∩ x_2^' can also be regarded as s_1. In other words, this condition can be presented as ∫_0^1 p_ sel dr_ overlap = s_1. Combining with Eq. <ref>, we obtain ∫_0^1 p_ sel dr_ overlap = s_1 ⇒∫_0^1ρ· (1 - r_ overlap)^γ dr_ overlap = s_1 ⇒ρ/γ + 1 = s_1 ⇒ρ = (γ + 1) · s_1 Combining with Eq. <ref>, we can obtain p_ sel = (γ + 1) · s_1 · (1 - r_ overlap)^γ, namely Eq. <ref> of the main paper. § ALGORITHM To clearly clarify our proposed method, we give the overall algorithm as shown in Algorithm <ref>. [h] Asymmetric Patch Sampling for Contrastive Learning § THE EFFECT OF TRAINING EPOCHS To validate the effect of training epochs during self-supervised pretraining, we conduct experiments on ViT-T/2 with different numbers of pretraining epochs. As shown in Figure <ref>, we can find the proposed method achieves better performance with longer training schedule. Meanwhile, the performance improvement progressively reaches to saturation with the increment of pretraining epochs. Hence, we adopt 1600 pretraining epochs in the paper, where the performance is close to saturation.
http://arxiv.org/abs/2306.10163v1	20230616200702	Mass Measurement of $^{27}$P for Improved Type-I X-ray Burst Modeling	[ "I. T. Yandow", "A. Abdullah-Smoot", "G. Bollen", "A. Hamaker", "C. R. Nicoloff", "D. Puentes", "M. Redshaw", "K. Gulyuz", "Z. Meisel", "W. -J. Ong", "R. Ringle", "R. Sandler", "S. Schwarz", "C. S. Sumithrarachchi", "A. A. Valverde" ]	nucl-ex	[ "nucl-ex", "astro-ph.HE" ]	[email protected] Facility for Rare Isotope Beams, East Lansing, Michigan, 48824, USA Department of Physics and Astronomy, Michigan State University, East Lansing, Michigan 48824, USA Department of Physics, Texas Southern University, Houston, Texas, 77004, USA Facility for Rare Isotope Beams, East Lansing, Michigan, 48824, USA Facility for Rare Isotope Beams, East Lansing, Michigan, 48824, USA Department of Physics and Astronomy, Michigan State University, East Lansing, Michigan 48824, USA Facility for Rare Isotope Beams, East Lansing, Michigan, 48824, USA Department of Physics and Astronomy, Michigan State University, East Lansing, Michigan 48824, USA Facility for Rare Isotope Beams, East Lansing, Michigan, 48824, USA Department of Physics and Astronomy, Michigan State University, East Lansing, Michigan 48824, USA Department of Physics, Central Michigan University, Mount Pleasant, Michigan 48824, USA Facility for Rare Isotope Beams, East Lansing, Michigan, 48824, USA Department of Physics and Astronomy, Michigan State University, East Lansing, Michigan 48824, USA Facility for Rare Isotope Beams, East Lansing, Michigan, 48824, USA Department of Physics and Astronomy, Ohio University, Athens, Ohio, 45701, USA Edwards Accelerator Laboratory, Ohio University, Athens, Ohio, 45701, USA Lawrence Livermore National Laboratory, Livermore, California, 94550, USA Department of Physics and Astronomy, Michigan State University, East Lansing, Michigan 48824, USA Facility for Rare Isotope Beams, East Lansing, Michigan, 48824, USA Department of Physics, Central Michigan University, Mount Pleasant, Michigan 48824, USA Facility for Rare Isotope Beams, East Lansing, Michigan, 48824, USA Facility for Rare Isotope Beams, East Lansing, Michigan, 48824, USA Facility for Rare Isotope Beams, East Lansing, Michigan, 48824, USA Physics Division, Argonne National Laboratory, Lemont, Illinois, 60439, USA Department of Physics and Astronomy, University of Manitoba, Winnipeg, Manitoba MB R3T 2N2, Canada Background Light curves are the primary observable of type-I x-ray bursts. Computational x-ray burst models must match simulations to observed light curves. Most of the error in simulated curves comes from uncertainties in rp process reaction rates, which can be reduced via precision mass measurements of neutron-deficient isotopes in the rp process path. Purpose Perform a precise atomic mass measurement of ^27P. Use this new measurement to update existing type-I x-ray burst models to produce an improved light curve. Method High-precision Penning trap mass spectrometry was used to determine the atomic mass of ^27P. Modules for Experiments in Stellar Astrophysics (MESA) <cit.> was then used to simulate x-ray bursts using a 1D multi-zone model to produce updated light curves. Results The mass excess of ^27P was measured to be -670.7± 0.6 keV, a fourteen-fold precision increase over the mass reported in AME-2020. The ^26Si(p, γ)^27P and reverse photodisintegration reaction rates have been determined to a higher precision based on the new, high precision mass measurement of ^27P, and MESA light curves generated using these rates. Changes in the mass of ^27P seem to have minimal effect on XRB light curves, even in burster systems tailored to maximize impact. Conclusion The mass of ^27P does not play a significant role in x-ray burst light curves. It is important to understand that more advanced models don't just provide more precise results, but often qualitatively different ones. This result brings us a step closer to being able to extract stellar parameters from individual x-ray burst observations. In addition, the Isobaric Multiplet Mass Equation (IMME) has been validated for the A=27, T=3/2 quartet, but only after including a small, theoretically predicted cubic term and utilizing an updated excitation energy for the T=3/2 isobaric analogue state of ^27Si. Mass Measurement of 27P for Improved Type-I X-ray Burst Modeling A. A. Valverde July 31, 2023 ================================================================ § BACKGROUND Type-I x-ray bursts (XRB) are astronomical events which occur in binary star systems with one neutron star and one companion star whose radius is greater than its Roche lobe <cit.>, causing hydrogen and helium rich material to flow from the companion star to the neutron star. This accreted material builds up on the surface of the very dense neutron star and is compacted by the extreme gravitational force. The temperature and density of the proton rich neutron star atmosphere increase continuously as more material is added until it achieves sufficient conditions to trigger fusion and a thermonuclear runaway which rapidly and drastically increases the temperature in the atmosphere, resulting in a sharp increase in x-ray luminosity—a type-I x-ray burst <cit.>. The primary observable from x-ray bursts is the light curve, a measure of the x-ray luminosity coming from a burst over time. Because of the extreme mass and gravitational pull of the neutron star, the vast majority of the accreted material and the nuclei it fuses into remain on the surface and continue to fuse throughout the burst. These fusions provide γ-rays, heating the neutron star atmosphere. Upscattering of photons in this very hot atmosphere generates a temperature-dependent source of x-rays throughout the burst. This process, as well as gradual cooling, results in the sharp spike followed by long tail in observed x-ray luminosity, yielding a unique light curve shape <cit.>. The specific conditions of an x-ray burst—high temperature, density, and proton concentration—are the required conditions for the rapid proton capture (rp) process to occur. The rp process produces neutron deficient nuclei lighter than A∼106 via a series of proton captures (p,γ), photodisintegrations (γ,p), α induced reactions (α,p), and β ^+-decays <cit.>. The exact rp process path is dependent on the speeds of these reaction rates. Of particular importance is the determination of the intensities of (p,γ)-(γ,p) reactions at “waiting point nuclei"—nuclei with relatively long half-lives of at least a few seconds—which determine the direction of the flow at these nuclei. §.§ Sensitivity Study In order to accurately simulate x-ray bursts, nuclear data for the isotopes along the rp process reaction pathway are critical. For some isotopes, slight changes in mass result in a change in direction of the (p,γ)-(γ,p) flow due to the exponential dependence of photodisintegration on Q-value. This flow change can lead to a significant shift in the energy production and therefore shape of the light curve. A sensitivity study by Schatz and Ong <cit.> looked at the dependence of x-ray burst models on the uncertainty of nuclear masses on and around the rp process path. The study used a one-zone x-ray burst model to identify the isotopes whose uncertainties had the greatest effect on the light curve by increasing and decreasing the mass of each isotope by 3σ and visually inspecting the resultant light curves. Schatz and Ong identified three nuclei which had a measurable effect on the light curve of a typical hydrogen/helium burst; one was ^27P. The mass used in the study was the AME2016-reported mass excess of -722.5±26.3 keV. The mass of ^27P is necessary to determine the equilibrium of the ^26Si(p ,γ)^27P – ^27P(γ,p)^26Si reaction, which is important to determine the branching between proton capture (p ,γ) and α capture (α,p) on ^26Si. ^26Si is an rp process waiting point nucleus with a β ^+-decay halflife of 2.25 seconds. The predicted magnitude of this effect can be seen in Figure <ref>. While the changes in the simulation may seem small, any remaining x-ray burst uncertainties that are detectable simply by visual inspection are significant. The reduction of the burst simulation uncertainties from the mass of ^27P to an negligible level required a mass measurement with an uncertainty of ∼1 keV. §.§ Isobaric Multiplet Mass Equation Schatz and Ong also used the Isobaric Multiplet Mass Equation (IMME) <cit.> to attempt to reduce the uncertainty in the mass of ^27P, and predicted the mass excess to be -716±7 keV. The IMME formalism treats protons and neutrons as degenerate states of the same hadron which are simply different projections of the “isospin" quantum number: T. The free neutron has isospin projection T_z = +1/2, and the free proton T_z = -1/2. In a nucleus with A=N+Z nucleons, isospin coupling yields T = (N-Z)/2, and allows isospin projections T_z=\|T\|, \|T\|+1,...,A/2. Isotopes with the same number of nucleons, A, (i.e. isobars) can have states with the same isospin, T, and similar properties. These are called isobaric analog states. Knowledge of some isobaric analog states, some of which are excited states, can be used to predict properties of other isotopes in the same isospin-degenerate multiplets. Perturbation theory can be used to calculate corrections to the mass of the isobaric analog states. When taken to first order this yields the isobaric multiplet mass equation (IMME) <cit.>: BE(A,T,T_z) = a(A,T)+b(A,T)T_z-c(A,T)T_z^2 where BE is the nuclear binding energy, A is the number of nucleons, T and T_z are the isospin and its projection, and a,b, and c are coefficients determined theoretically, or by fitting to mass measurements. Certain nuclear properties—such as second-order Coulomb effects, three-body interactions, and isospin-mixing—require the addition of the terms dT_z^3 and eT_z^4. The d and e coefficients are expected to have comparatively small magnitudes unless there is a substantial breakdown of isospin symmetry <cit.>. Attempts have been made to theoretically predict the cubic d coefficient of the IMME. These predictions have some agreement with experimentally measured d-coefficients, but there are several outlier masses which require large, difficult-to-predict d-coefficients to properly describe the masses of an isospin multiplet <cit.>. Our precision mass measurement of ^27P can be used to evaluate the predictive capabilities of the IMME and determine whether the A=27, T=3/2 isospin quartet requires a d-coefficient in order to accurately describe the masses of the isobaric analogue states. § PURPOSE In this article, we report the first Penning trap mass measurement of ^27P, produced at the National Superconducting Cyclotron Laboratory (NSCL) <cit.> and measured by the Low Energy Beam Ion Trap (LEBIT) 9.4 T Penning trap mass spectrometer <cit.>. A mass measurement with an uncertainty of 0.6 keV, a 14-fold improvement over AME2020, was achieved. The measurement showed a just over one σ increase in mass (and decrease in binding energy) compared to the AME2020 reported result. The updated mass of ^27P was used to validate the predictive capabilities of the IMME and determine the necessity of an IMME coefficient beyond those predicted by first order perturbation theory. The mass measurement was then used in a 1D multizone Modeuls for Experiments in Nuclear Astrophysics (MESA) simulation to produce an XRB light curve. The MESA simulation determined the impact that varying the mass of ^27P has on the light curve. This result was compared to that predicted by the single-zone model employed in <cit.>. § METHOD The LEBIT is the only Penning trap mass spectrometry facility able to perform high-precision measurements on rare isotopes produced by projectile fragmentation. In this experiment, short-lived ^27P was generated by impinging 150MeV/u ^36Ar on a 1034mg/cm^2 Be target at the Coupled Cyclotron Facility at the NSCL. The beam produced was then sent through the A1900 fragment separator with a 150mg/cm^2 99.99% pure aluminum wedge <cit.> to separate the secondary beam. The beam proceeded to the beam-stopping area <cit.> via a momentum compression beam line, where it was degraded with aluminum degraders of total thickness 2759 μm before passing through an aluminum degrader of total thickness 2759 μm, and a 4.1 mrad aluminum wedge with center thickness 1016 μm. The beam entered the gas cell at an energy of less than 1 MeV/u. In the gas cell, ions were stopped in high-purity helium gas at about 52 torr and a temperature of -7^∘C. During collisions with the helium gas the highly charged ions recombined down to the charge state +1. The ions were transported through the gas cell by a combination of rf and dc fields and gas flow. They were then extracted into a radio frequency quadrupole (RFQ) ion guide and separated by a magnetic dipole mass separator with a resolving power of approximately 1500. The activity of the beam after the dipole mass separator was measured with an insertable Si detector. The highest activity was found at a charge-to-mass ratio of A/Q=43. This indicated that the majority of the ^27P was being extracted in the form of singly ionized phosphorus-oxide, ^27PO^+, though there were trace amounts (∼1%) of ^27PO_2^+ detected as well. By keeping all ion transport electrodes in both the gas stopping facility and the LEBIT laboratory at 30 kV, but the transport electrodes in between at ground, the ions accelerated rapidly to LEBIT, but were again slowed when they entered LEBIT. Once in LEBIT, the ions entered a helium gas-filled RFQ ion cooler buncher <cit.>. The ions were accumulated, stopped in the room temperature helium, and released to the LEBIT 9.4 T Penning trap. A fast kicker in the beam line leading from the cooler buncher to the trap was used as a time-of-flight mass separator. It only allowed ^27PO^+ and molecular contaminants with a similar mass-to-charge ratio, A/Q = 43±1, to enter the Penning trap. LEBIT's 9.4 T Penning trap is made of a high-precision hyperbolic electrode system in an actively shielded magnet system <cit.>. Electrodes leading up to the trap decelerate the ion pulses before they enter. The final section of these electrodes is quadrisected radially, with each segment's voltage independently controllable, to create a Lorentz Steerer <cit.>. The Lorentz Steerer controls how off-center the ions are as they enter the trap. Once captured, contaminant ions were driven out using dipole cleaning <cit.>, which excited the motion of the contaminants using azimuthal rf dipole fields at their reduced cyclotron frequency (f_+). Next, the time-of-flight ion cyclotron resonance technique <cit.> was used to determine the cyclotron frequency—and therefore mass—of the ^27PO^+. A 50-, 100-, 150-, and 200-ms continuous quadrupolar excitation was used to make initial measurements of ^27PO^+. The time-of-flight distributions were fit with the theoretical lineshape described in <cit.>. The measured cyclotron frequency was checked against all chemically-possible molecules composed of stable or long-lived atoms. It was determined that no potential contaminants were within 3 σ of the measured resonance, and therefore the observed resonances must be ^27PO^+. Once identified, the excitation was switched to the pulsed Ramsey resonance technique <cit.>, which improved precision by a factor of approximately 4. A sample 250 ms Ramsey resonance of ^27PO^+ can be found in Figure <ref>. In between each ^27PO^+ cyclotron frequency measurement, a reference ion measurement was performed in order to determine the magnetic field. In this experiment, the reference used was HCNO^+, as an abundance of it was produced in the gas cell with A/Q=43. Penning trap mass measurements do not directly yield mass as a result. Instead, results are given in terms of the frequency ratio (R=f_ref^int/f_c), where f_ref^int is the interpolated cyclotron frequency from the calibration measurements (HCNO^+). The calibration mass was measured before and after each ^27PO^+ measurement. The final reported atomic mass M is found by taking the average of all of the frequency ratios, R̅, and using M=R̅[M_ref-m_e]+m_e where M_ref is the atomic mass of the neutral HCNO molecule, and m_e is the electron mass. Electron binding energy is neglected, as it is on the order of a few eV's, and the dominant statistical uncertainties are two orders of magnitude greater than this. § RESULTS Eleven measurements of ^27PO^+ were performed over the course of approximately 15 hours. These resulted in a weighted average of R̅=1.000270250(16), as can be seen in Figure <ref>. The distribution of individual values of R were statistically above average, resulting in a Birge ratio <cit.> of 1.23(14). Because it was greater than one, the uncertainty was scaled by this Birge ratio. This correlates to a ^27P mass excess of -670.7± 0.6 keV Systematic shifts in R̅ have been found to scale linearly with mass difference between the calibrant and target ions. Systematic shifts can result from trap misalignment with the magnetic field, magnetic field inhomogeneities, and nonharmonic trapping potential imperfections <cit.>. These mass-dependent shifts have been thoroughly investigated at LEBIT and found to be Δ R ∼ 2× 10^-10/u <cit.>, which is negligible in comparison to statistical uncertainties when the mass of the reference ion is within a few u of the ion of interest. Because an isobaric reference was used in this measurement, these shifts are certainly negligible. Further systematic effects include nonlinear temporal shifts in the magnetic field, relativistic effects on f_c, and ion-ion interactions in the Penning trap. Nonlinear magnetic field fluctuations have been shown to have an effect less than 1×10^-9 over one hour <cit.>—which was the approximate duration of each ^27PO^+ measurement—making this effect less than statistical uncertainty. Relativistic effects were negligible because of the large ion masses <cit.>. Isobaric contaminants in the trap can lead to systematic frequency shifts. This effect was minimized by performing dipole scans over a broad frequency range in order to detect contaminants. Contaminants were detected by searching for drops in count rate as ions were driven out of the trap. When a contaminant was identified using this method, its reduced cyclotron frequency was added to a list of “cleaning" frequencies. A dipole excitation for each cleaning frequency was applied, driving out contaminants before the quadrupolar excitation of the ion of interest. For both ^27PO^+ and HCNO^+, events with six or more detected ions were discarded to avoid potential systematic frequency shifts from Coulomb interactions in the trap. Due largely to its astrophysical importance, the mass of ^27P has been measured several times. The LEBIT measurement is shown in comparison to past measurements and predictions in Figure <ref>. §.§ IMME Prediction Schatz and Ong used the IMME to predict a ^27P mass excess of -716±7 keV <cit.>. They utilized a 27Si T=3/2 isobaric analogue state excitation energy of 6626 ± 3 keV <cit.> for this calculation. The LEBIT mass measurement found an excess of -670.7 ± 0.6 keV, a difference exceeding 6σ. A recent measurement of the T=3/2 isobaric analogue state of ^27Si performed at Texas A&M by McCleskey et al. <cit.> yielded an excitation energy of 6638 ± 1 keV, 12 keV higher than previously measured. Using this new value, a mass excess of -677 ± 4 keV is predicted for ^27P, less than 2σ from the LEBIT result. Without the McCleskey measurement, a large cubic term of d=8±1 keV would be necessary in order for the IMME to accurately predict the LEBIT value, and would indicate a substantial breakdown in isospin symmetry. With the McCleskey excitation energy, the d-coefficient is reduced to d=1.1±0.6 keV, in excellent agreement with the theoretical prediction of this cubic term made by Dong et al. <cit.>. While the IMME prediction used in <cit.> yielded a poor result for the mass of ^27P, it was missing the critical updated T=3/2 isobaric analogue state excitation energy of ^27Si. On the one hand, this recommends caution to those using the IMME predictively in astrophysics simulations, as it has been used with the best information available at the time to make inaccurate predictions. On the other hand, not only has the IMME been shown to make a reasonable prediction for this multiplet, but the McCleskey measurement <cit.> and Dong theoretical d-coefficient prediction <cit.> have been validated. This demonstrates that with the latest information, the IMME can be a powerful predictive tool. This result also motivates the revisiting of old excitation energy measurements of isobaric analogue states. The most recent measurement of the T=3/2 isobaric analogue state excitation energy of ^27Si before McCleskey et al. was performed more than half a century ago in 1971 by Barker et al. <cit.>. The IMME coefficients using the LEBIT ^27P mass measurement and the most updated isobaric analogue state information can be found in Table <ref>. §.§ Astrophysical Implications The LEBIT ^27P mass was used to calculate the proton capture rate at the ^26Si waiting point using the techniques and resonance properties described in Sun et al. Section F <cit.>. As the resonance energies of the states that dominate the ^26Si(p,γ)^27P reaction had only small relative changes, the LEBIT measurement did not cause the proton capture reaction forward rate to differ from that found by Sun et al., and will not be further discussed here. The photodisintegration rate, ^27P(γ,p)^26Si—which depends exponentially on the Q-value—was calculated using the methodologies laid out in Section 3.2 of <cit.>. As can be seen in Figure <ref>, the LEBIT-based result drastically reduced uncertainty in the photodisintegration rate as compared to that based on AME2016. Even though this critical rate was much better determined, MESA simulations using the techniques laid out by Z. Meisel in <cit.> yielded light curves not substantively different than using the AME2016 ^27P mass value. In order to determine if the mass of ^27P could have an impact on the light curve of any XRB, the accretion rate of the simulated XRB system was decreased compared to the GS 1826-24 clock burster typically used in simulations (decreased from 2.98 × 10^-9 to 1.23 × 10^-9 msol/yr). This increases the burst temperature and helium fraction upon ignition, causing more pronounced competition between the (p,γ) and (α,p) pathways. The increased path competitiveness maximizes the change in simulated light curve due to the LEBIT ^27P mass measurement or any variation in the ^27P mass. Even in this situation, variations in the mass of ^27P had an inconsequential effect on the light curve, which can be seen in Figure <ref>. It shows that the light curve and the band over which it varies are nearly identical regardless of which mass value for ^27P is used and whether it is varied over the small uncertainty attained by LEBIT, or the uncertainty from AME2016, which is over forty times as large. This result is not what was predicted by the sensitivity study <cit.>. The cause of this disparity likely lies in the difference between the simple single-zone XRB model and the complex multi-zone MESA XRB simulation. A single-zone model was used in the sensitivity study in order to be able to approximate the impact of a wide variety of nuclear masses with an achievable amount of computing power. A multi-zone MESA simulation is only feasible to run when varying a small number of parameters such as just the mass of ^27P. One can see in Figure <ref> that the predicted light curve difference lies primarily in the sharp luminosity drop-off at the very end of the light curve. However, Figure <ref> shows that this drop-off does not exist. As Cyburt et al. point out in <cit.>, this region “is mainly the result of the absence of radiation transport modeling" in single-zone XRB models and that single-zone models run much hotter than multi-zone models. Escape from the ^26Si waiting point via ^26Si(α,p)^29P probably requires a temperature higher than is reached in physical systems and multi-zone XRB models in order to compete with proton capture. To test this hypothesis, the flow from the ^26Si waiting point via ^26Si(p,γ)^27P and ^26Si(α,p)^29P was calculated for an array of temperature and density environments potentially achievable in an XRB. This flow was calculated using a ^27P mass value from AME2016 ± 3σ; AME2016 was chosen to demonstrate why the sensitivity study <cit.> predicted the mass of ^27P would impact the rp process path. The rate of ^26Si(α,p)^29P is unmeasured, so 3× the NON-SMOKER calculated rate—the rate used by the nuclear astrophysics database JINA Reaclib—was chosen. The multiplication factor of 3× was chosen based on an uncertainty study of reaction rates in proton-rich nuclei which found that the true reaction rate is occasionally as much as 3× the NON-SMOKER rate, and is usually less <cit.>. As it was our goal to find the scenario where the (α,p) path was the most competitive, the highest plausible rate was chosen. The path of temperatures and densities in an XRB in the case of a single-zone model of the clock-burster, as was used in <cit.>, was simulated. Finally the peak temperature achieved in a MESA simulated train of 39 XRBs using LEBIT's ^27P mass value was determined. The results of these simulations are available in Figure <ref>. It shows that the (α,p) path only becomes competitive in the single-zone model when the mass of ^27P is increased by 3σ based on the AME2016 value (<ref> left). It is an irrelevant path both in a single zone model with the ^27P mass decreased by 3σ (<ref> right) and in all situations for the multi-zone MESA model (<ref> horizontal black line). This shows that the mass of ^27P is critically important for determining whether alpha capture is an escape pathway out of the ^26Si waiting point in single zone XRB models, matching the prediction of <cit.>. Multizone models, however, never reach a sufficient temperature for the alpha capture pathway to become relevant regardless of the mass of ^27P. § CONCLUSIONS ^27P has been measured to over an order of magnitude more precisely than prior measurements, with the result ME = -670.7± 0.6 keV. This eliminates the need for further ^27P mass measurements for astrophysical purposes. Its astrophysical impact appears to be less than predicted due to enhanced temperatures reached in single-zone XRB models creating false competition between the proton and α capture pathways out of the ^26Si rp process waiting point. A measurement of the ^26Si(α,p)^29P reaction rate would be necessary in order to fully rule out an α capture bypass for high temperature bursts. This result highlights the importance of following single-zone XRB simulations with multi-zone simulations to validate the impacts predicted by the simpler models. In addition, after some critical updates<cit.>, the IMME has been validated for the A=27, T=3/2 quartet, and the IMME cubic term d-coefficient is small enough so as not to cause concern about isospin symmetry breakdown. § ACKNOWLEDGEMENTS This work was conducted with the support of Michigan State University, the US National Science Foundation under contracts nos. PHY-1565546 and PHY-2111185, the DOE, Office of Nuclear Physics under contract no. DE-AC02-06CH11357 and DE-SC0015927, and the Natural Sciences and Engineering Research Council of Canada (NSERC) under Contract No. SAPPJ2018-0028. Thank you to L.J. Sun for making the author aware of <cit.>.
http://arxiv.org/abs/2306.07002v1	20230612101557	MultiCarroll dynamics	[ "P. -M. Zhang", "H-X. Zeng", "P. A. Horvathy" ]	gr-qc	[ "gr-qc", "cond-mat.other", "hep-th" ]	thmTheorem[section] corollary Corollary[section] proposition Proposition[section] lemmaLemma definitionDefinition[section]
http://arxiv.org/abs/2306.05605v1	20230609003330	A Unified Generative Approach to Product Attribute-Value Identification	[ "Keiji Shinzato", "Naoki Yoshinaga", "Yandi Xia", "Wei-Te Chen" ]	cs.CL	[ "cs.CL", "cs.AI" ]	Testing the circularity of PSR 's carousel [ July 31, 2023 ========================================== Product attribute-value identification (pavi) has been studied to link products on e-commerce sites with their attribute values (e.g., ⟨Material, Cotton⟩) using product text as clues. Technical demands from real-world e-commerce platforms require pavi methods to handle unseen values, multi-attribute values, and canonicalized values, which are only partly addressed in existing extraction- and classification-based approaches. Motivated by this, we explore a generative approach to the pavi task. We finetune a pre-trained generative model, t5, to decode a set of attribute-value pairs as a target sequence from the given product text. Since the attribute-value pairs are unordered set elements, how to linearize them will matter; we, thus, explore methods of composing an attribute-value pair and ordering the pairs for the task. Experimental results confirm that our generation-based approach outperforms the existing extraction- and classification-based methods on large-scale real-world datasets meant for those methods. Because the existing extraction-based approach to product attribute-value identification (pavi) requires extra postprocessing for value canonicalization, researchers start to formulate the pavi task as multi-label classification. To resolve unseen attribute values in the classification-based approach to PAVI, this paper explores a generative approach to the pavi task. We finetune the sequence-to-sequence pre-trained model T5 so that it can autoregressively generate a set of attribute-value pairs as a target sequence from given product text. Since the attribute-value pairs are un-ordered set elements, the ordering of the attribute-value pairs matters; we, thus, design three types of orderings of the attribute-value pairs for the task. Experimental results on large-scale real-world datasets demonstrate that the unified generative approach outperforms not only the classification-based approach to product attribute identification but also the extraction-based approach to product attribute extraction. Product attribute-value identification (pavi) is a task that identifies attribute values (e.g., ⟨Material, Cotton⟩) from text related to products on e-commerce sites. Technical demands from real-world e-commerce platforms require pavi methods to handle unseen values, multi-attribute values, canonicalized values, and inter-value dependencies. However, existing extraction- and classification-based approaches address only a part of these challenges. Motivated by this, we propose a generative framework for the pavi task because sequence-to-sequence models can deal with all the challenges by using canonicalized attribute-value pairs for training. We adopt the sequence-to-sequence pre-trained model t5 as our backbone, and train it so that it can autoregressively generate a set of attribute-value pairs as a target sequence from given product text. Since the attribute-value pairs are un-ordered set elements, the ordering of the attribute-value pairs is not trivial. We, thus, design three types of orderings of the attribute-value pairs for the task. Experimental results on real-world datasets demonstrate that the unified generative approach solves all the challenges as it outperforms methods based on extraction and classification techniques. § INTRODUCTION Since organized product data play a crucial role in serving better product search and recommendation to customers, product attribute value identification (pavi) has been a core task in the e-commerce industry. For attributes pre-defined by e-commerce sites, the task aims to link values of those attributes to products using product titles and descriptions as clues (Figure <ref>). For example, from the title “D&G Cotton piqué polo shirt Designed and manufactured in Italy,” models are required to return a set of possible attribute-value pairs, namely {⟨Brand, Dolce & Gabbana⟩, ⟨Material, Cotton⟩, ⟨Country of origin, Italy⟩, ⟨Country of design, Italy⟩}. In the literature, pavi has been addressed basically by extraction from the product text by using named entity recognition <cit.> or question answering <cit.>. However, since pavi requires canonicalized values rather than raw value strings in the product text, some researchers have started to solve pavi as classification <cit.>. Previous attempts for the pavi task can be categorized into either extraction- or classification-based approaches. Although there are few studies that formalize the task as a question-answering (qa) problem <cit.>, as the extraction-based approach, many studies treat the task as a sequence labeling problem <cit.>. On the other hand, the classification-based approach formalizes the task as multi-label classification (mlc) where labels corresponds to attribute-value pairs <cit.>. To adopt pavi models in real-world e-commerce platforms, there are the following challenges. Unseen values. Since values can be entities such as brands, models need to identify values unseen in the training data <cit.>. ;namely, values follow the open-world assumption <cit.>. Since the classification-based approach assumes a pre-defined set of target classes (attribute-value pairs), it cannot handle such unseen attribute-value pairs. Multi-attribute values. When values can be associated with multiple attributes (e.g., Italy in Figure <ref>), models need to identify multiple attributes for a single value string in the text. To address this, the extraction-based approach must solve nested named entity recognition <cit.>. handle nested values, multi-attribute values incur multi-label classification. Meanwhile, it is impractical to train models for individual attributes since the number of attributes can exceed one thousand <cit.>. Canonicalized values. E-commerce vendors need attribute values in the canonical form (e.g., Dolce & Gabbana for D&G) in actual services such as faceted product search <cit.>. Thus, it is preferable to directly identify canonicalized values rather than raw value strings in the text. The extraction-based approach needs a further step to canonicalize extracted raw value strings <cit.>. Inter-value dependencies. Some attribute values depend on other values. For example, if models predict Italy as country of design, the brand is likely to be one in Italy. Capturing such dependencies helps the models achieve high performance. The extraction-based approach partly captures such dependencies via contextualized representations, while the classification-based approach requires additional mechanisms such as classifier chains <cit.>. Motivated by the shortcomings of the existing approaches to pavi (Table <ref>), we propose to cast pavi as sequence-to-set generation, which can handle all the challenges by using canonicalized attribute-value pairs for training (Figure <ref>). We expect that 1) generation can decode unseen values by considering corresponding values in the input, 2) generation can decode the same string in the input multiple times as values for different attributes, and 3) generation can learn how to canonicalize raw strings in input. We finetune the pre-trained generative model t5 <cit.> to autoregressively decode a set of attribute-value pairs from the given text. As discussed in <cit.>, the output order will matter to decode sets as a sequence. We therefore explore methods of composing an attribute-value pair and ordering the pairs for the task. We evaluate our generative framework on two real-world datasets, mave <cit.> and our in-house product data. The experimental results demonstrate that our generation-based approach outperforms extraction- and classification-based methods on their target datasets. Our contribution is as follows. * We have solved the product attribute-value identification task as a sequence-to-set generation for the first time. * We revealed the effective order of attribute-value pairs for the t5 model among various ordering schemes (Table <ref>). * We provided the first comprehensive comparison among extraction-, classification-, and generation-based models on two real-world pavi datasets, and empirically confirmed that the generation-based models outperformed the others (Table <ref>) while addressing all challenges in pavi (Tables <ref>, <ref> and <ref>). § RELATED WORK Product Attribute-Value Extraction Traditionally, a myriad of previous studies formulated pavi as named entity recognition (ner) <cit.>. However, since the number of attributes in real-world e-commerce sites can exceed ten thousand <cit.>, the ner-based models suffer from the data sparseness problem, which makes the models perform poorly. While the extraction-based approach can identify unseen values in the training data, it cannot canonicalize values by itself and is difficult to handle overlapping values, although nested ner (surveyed in <cit.>) can remedy the latter issue. To mitigate the data sparseness problem, some studies leveraged qa models for the pavi task <cit.>, by assuming the target attribute for extraction as additional input. These qa-based approaches take an attribute as query and product text as context, and extract attribute values from the context as answer for the query. Similar to the traditional ner-based models, these extractive qa-based models do not work for canonicalized values. To improve the ability to find unseen values, <cit.> generated a value for the given product text and attribute. However, we need to apply these qa-based models to the same context with each of thousands of attributes, unless comprehensive attribute taxonomy is designed to narrow down possible attributes; such taxonomy is not always available and is often imperfect, as investigated by <cit.> for Amazon.com. Product Attribute-Value Identification as Classification <cit.> solved pavi as multi-label classification (mlc), assuming attribute-value pairs as target labels. One of the problems in this approach is that the distribution between positive and negative labels is heavily skewed because the number of possible attribute values per product is much smaller than the total number of attribute values. To alleviate the imbalanced label problem, they introduced a method called label masking to reduce the number of negative labels using an attribute taxonomy designed by the e-commerce platform. To mitigate the extreme multi-class classification, <cit.> decomposed the target label, namely attribute-value pair, into two atomic labels, attribute and value, to perform a hierarchical classification. Although these classification-based approaches support canonicalized values and multi-attribute values, they cannot handle unseen values. In this study, we adopt a generative approach to return a set of attribute-value pairs from given product data, and empirically compare it with the above two approaches. Our approach can be applied to the task settings adopted by the qa-based models, by simply feeding one (or more) target attributes as additional input (e.g., title [sep] description [sep] attributes) to decode their values in order. § PROPOSED METHOD As mentioned above, previous studies formalize pavi as either sequence tagging or multi-label classification problems. These approaches do not address all the challenges derived from real-world e-commerce sites at the same time (Table <ref>). We thus propose a unified generative framework that formalizes pavi as a sequence-to-set problem. Let us denote x = {x_1,x_2,…,x_n} as product data (title and description) where n is the number of tokens in x. Given product data x, the model is trained to return a set of attribute-value pairs y = {⟨a_1,v_1⟩, ⟨a_2,v_2⟩, …, ⟨a_k,v_k⟩} for x, where k is the number of attribute-value pairs associated with the product; a_i = {a_1,a_2,…,a_m_i} and v_i = {v_1,v_2,…,v_l_i} are corresponding attribute and value.[When there are more than one value for the same attribute (e.g., size), we decompose a pair of attribute and n (> 1) multiple values into n attribute-value pairs (Table <ref>).] m_i and l_i are the numbers of tokens in a_i and v_i, respectively. As the backbone of our approach, we employ t5 <cit.>, a pre-trained generative model based on Transformer <cit.> that maps an input sequence to an output sequence. The key issue in formulating the pavi task as sequence-to-sequence generation is how to linearize a set of attribute-value pairs into a sequence. Firstly, we should consider how to associate attributes and their corresponding values in the output sequence. Secondly, the autoregressive generation decodes output tokens (here, attributes and values) one by one conditioned on the previous labels. Thus, if specific (or informative) tokens are first decoded, it will make it easy to decode the remaining tokens. However, due to the exposure bias, decoding specific (namely, infrequent) tokens are more likely to fail. To address the challenge, we decompose the issue on linearization into two subproblems on how to compose an attribute-value pair and how to order attribute-value pairs. In what follows, we will describe these subproblems. In our sequence-to-sequence generation setting, we first generate a structured string of text Ŷ=(y_0,y_1,y_2,...,y_m), and then get NV by simple parsing and post-processing. We design the structure 𝕐 as “n_0 [sep_0] v_00 [sep_1] v_01 [sep_2] n_1 [sep_0] v_10 [sep_1]...”. [sep_2] divides attribute name/value pairs; [sep_0] divides attribute name and values in each pair; [sep_1] divides attribute values in each pair. During training, we organize gold labels NV following structure 𝕐 into Y. Therefore, the problem we are trying to solve is maximizing: P(𝕐(NV)\|X)≈ P(NV\|X) §.§ T5 There are many state of the art sequence-to-sequence models based on transformer, such as t5 <cit.> and BART <cit.>. They all share a similar structure where an encoder encodes input context into feature vector, and a decoder generates output given the encoded feature vector. In this work, we choose t5 to demonstrate our idea. t5 adopts a unified text-to-text framework where input and output are both text, and therefore, it is required that various task targets convert to text format. Official t5 English models are pretrained on Colossal Clean Crawled Corpus (C4). For our Japanese dataset, we use a Japanese version of t5 published on HuggingFace[https://huggingface.co/sonoisa/t5-base-japanese]. §.§ Composition of Attribute-Value Pair We consider the following ways to compose an attribute-value pair.[We have also attempted to generate all attributes prior to values (namely, a_1[sep_𝑝𝑟]…a_k[sep_𝑎𝑣]v_1[sep_𝑝𝑟]…v_k) or vice versa; this unpaired generation slightly underperformed the paired generation used here.] In both ways, attributes and values are separated by a special token [sep_𝑎𝑣]. Attribute-then-value, ⟨A, V⟩ Attribute is placed, and then its value (e.g., Color [sep_𝑎𝑣] White). In general, the vocabulary size of attributes is much smaller than that of values. Thus, models will be easier to decode attributes than values. Value-then-attribute, ⟨V, A⟩ Value is placed, and then its attribute (e.g., White [sep_𝑎𝑣] Color). This will be effective when the target values appear as raw strings in the given text and are easier to decode than attributes. §.§ Ordering of Attribute-Value Pairs In this work, we design three different types of the attribute-value pair ordering (Table <ref>). We use a special token [sep_𝑝𝑟] as a separator between pairs. Rare-first Specific attribute values (e.g., brands) can help models decode other attribute values. For example, since Levi's has many products made of denim, it is easy to decode the material if Levi's is decoded in advance. Meanwhile, since there are many brands that have products made of denim, decoding denim as a material in advance is useless to decode the brands. To capture this inter-value dependency, we assume a correlation between the frequency and specificity of attribute-value pairs, and place attribute-value pairs to the target sequence in rare-first ordering of attribute-value pair frequency calculated from the training data. The attribute-value pairs with the same ranking will be placed randomly for this and following ordering. Common-first When the model autoregressively decodes outputs, intermediate errors affect future decoding. Thus, it is important to decode from confident attribute-value pairs. Since models will be easier to decode attribute-value pairs that have more training examples, we place attribute-value pairs to the target sequence in the common-first ordering of attribute-value pair frequency. This approach is adopted by <cit.> in solving multi-label document classification as generation. Random To see whether the orders matter, we randomly sort attribute-value pairs in the target sequence; more precisely, we collect, uniquify, and shuffle attribute-value pairs taken from all training examples, and sort the pairs in each example according to the obtained order of the pairs. If this random ordering shows inferior performance against the above orderings, we can conclude output orders matter in this task. Easy-first Alternatively to the common-first ordering, we place attribute-value pairs that the models are likely to generate correctly at the beginning of the target. To estimate how likely the models generate correct pairs, we compute, for each attribute, F_1 score of the common-first model on the development set. We then stably sort the pairs in the training data for common-first ordering using the attribute F_1. The pairs with the same frequency or F_1 are placed randomly. If models other than random ordering show better performance than ones with random ordering, it can be seen that the models take dependencies between values into account. § EXPERIMENTS We evaluate our generative approach to pavi using two real-world datasets. In the literature, different types of approaches are rarely compared due to the proprietary nature of codes and datasets in this task. We thus compare our generation-based model with extraction- and classification-based models, all of which are based on public pre-trained models, using not only in-house but also public datasets. §.§ Datasets We used mave <cit.>[<https://github.com/google-research-datasets/MAVE>] and our in-house product data for experiments. The mave dataset is designed to evaluate the extraction-based pavi models, while the in-house dataset is designed to evaluate classification-based models (Table <ref>). MAVE dataset compiles the product data taken from Amazon Review Data <cit.>. The dataset contains various kinds of products such as shoes, clothing, watches, books, and home decor decals. Each example consists of product titles and descriptions, attribute, value, and span of the attribute value. To construct such tuples, <cit.> trained five aveqa models <cit.> using a large amount of silver data where attribute values were annotated using manually tailored extraction rules. Then, they applied the trained models to the Amazon Review Data in order to detect spans of values corresponding to attributes given to the models. To produce attribute value spans with high precision, they chose only attribute values that all five models extracted (positive). In addition, if no span is extracted from either model, and there is no extracted span from the extraction rules, they consider that there are no values for the attributes (negative); refer to Table <ref> for example product data. As a result, mave consists of 2,092,898 product data for training and 290,773 product data for testing. Similar to <cit.>, to make the training faster, we randomly selected 640,000 and 100,000 product data as the training and development sets from the original training data, respectively. We used the test data in mave for our evaluation as it is. In-House Product Data is taken from our e-commerce platform, Rakuten,[<https://www.rakuten.co.jp/>] which sells a wide range of products such as smartphones, car supplies, furniture, clothing, and kitchenware. Each example consists of a tuple of title, description, and a set of attribute-value pairs. The sellers assign products attribute-value pairs defined in the attribute taxonomy provided by the e-commerce platform. Since both attributes and values in the taxonomy are canonicalized, there exist spelling gaps between values in the taxonomy and those in the product text (e.g., Dolce & Gabbana in the taxonomy and D&G in the title). For experiments, among our in-house product data with one or more attribute-value pairs, we randomly sampled 640,000, 100,000, and 100,000 product data for training, development, and testing, respectively. §.§ Models We compare the following models: BERT-NER: extraction-based model. On the top of bert, we place a classification layer that uses the outputs from the last layer of bert as feature representations of each subword. Each subword is classified into one of the labels. We employ bilou chunking scheme <cit.>; the total number of labels is N × 4 + 1, where N is the number of distinct attributes in the training data. We have used bert as the backbone here because the common extraction-based baseline <cit.> uses classic BiLSTM-CRF as the backbone <cit.> and bert-based models outperform in qa-based models <cit.>; bert-ner can be a stronger and easily replicable baseline. To annotate entities in text, we referred the beginning and ending positions in tuples for mave, and performed a dictionary matching for our in-house dataset. If annotations are overlapped, we keep the longest token length value, and drop all other overlapping values. For multi-attribute values, we adopt the most frequent attribute-value pair. BERT-MLC: classification-based model. We put a classification layer on the top of bert, and feed the embeddings of the cls token to the classification layer as a representation of given text <cit.>. The model predicts all possible attribute values from the representation through the classification layer. The total number of labels is the number of attribute values in the training data. BERT-MLC w/ Tax: the current state-of-the-art classification-based model that can be comparable with the other methods. We added to bert-mlc the label masking <cit.>, which leverages the skewed distributions of attributes in training and testing, using an attribute taxonomy defined for our in-house data. Although this is the state-of-the-art classification-based method, it requires the attribute taxonomy as extra supervision. Since the mave dataset does not provide the attribute taxonomy, we train and evaluate this model only on our in-house dataset. T5: generation-based model of ours. We finetune t5 on the training data obtained by each element in {Attribute-then-value, Value-then-attribute}×{Random, Rare-first, Common-first}. For random ordering, we create three training data with different random seeds, next train a model on each training data, and then chose the model that achieves the best micro F_1 on the development set. §.§ Implementations We implemented all models in PyTorch.[<https://pytorch.org/>] We used [<https://huggingface.co/t5-base>] and [<https://huggingface.co/sonoisa/t5-base-japanese>] in Transformers <cit.>, both of which have 220M parameters, as the pre-trained t5 models for mave and our in-house data, respectively. For training and testing, we used the default hyperparameters provided with each model. We ran teacher forcing in training, and performed beam search of size four in testing. For bert-based models, we used [<https://huggingface.co/bert-base-cased>] for mave, and [<https://huggingface.co/cl-tohoku/bert-base-japanese>] for our in-house dataset, both of which have 110M parameters.[ Training with BERT_large (330M parameters) did not work for bert-mlc on either dataset; see Table <ref> in Appendix.] We set 0.1 of a dropout rate to a classification layer. We use Adam <cit.> optimizer with learning rates shown in Table <ref> in Appendix. We trained the models up to 10 epochs with a batch size of 32 and chose the models that perform the best micro F_1 on the development set. Computing Infrastructure We used NVIDIA DGX A100 GPU on a Linux (Ubuntu) server with a AMD EPYC 7742 CPU at 2.25 GHz with 2 TB main memory for performing the experiments. Table <ref> shows GPU hours taken for the experiments. §.§ Evaluation Measure Following the literature <cit.>, we used micro and macro precision (P), recall (R), and F_1 as metrics. We compute macro performance in attribute-basis. Since the goal of pavi is not to detect spans of values in text but to assign attribute-value pairs to products, we pick one attribute-value pair from multiple identical attribute-value pairs in mave (e.g., ⟨Type, jersey⟩ in Table <ref>). Note that we do not need this unification process for our in-house dataset because it provides unique attribute-value pairs. Since attribute values in the mave dataset are based on outputs from qa-based models <cit.> and those in our in-house data are assigned voluntarily by sellers on our marketplace, both datasets may contain some missing values. To reduce the impact of those missing attribute-value pairs, we discard predicted attribute-value pairs if there are no ground truth labels for the attributes. In the mave dataset, there are attributes whose values do not appear in the text (negative). For the ground truth with such no attribute values, models can predict no values (NN), or incorrect values (FP_n) while for the ground truth with concrete attribute values, the model can predict no values (FN), correct values (TP), or incorrect values (FP_p). Based on those types of predicted values, P and R are computed as follows: P = \|TP\|/\|TP\| + \|FP_p\| + \|FP_n\| , R = \|TP\|/\|TP\| + \|FN\|. F_1 is computed as 2 ×P×R / (P + R). Note that since there are no attributes with no values in our in-house dataset, the value of \|FP_n\| is always 0. We compute P, R and F_1 as follows: P = \|CV\|/\|CV\| + \|WPV\| + \|WNV\| , R = \|CV\|/\|CV\| + \|WV\| F_1 = 2 ×P×R/P+R where CV refers to correct values, and WV refers to not predicted values. WPV means wrong values predicted for attributes that belong to the gold positive attributes, while WNV means wrong values predicted for attributes that belong to the gold negative attributes. mave dataset contain samples that have attributes whose value is “None,” we follow the previous study <cit.> to compute precision and recall. More precisely, for each attribute, when the ground truth value is “None,” the model can predict “None” value (NN) or incorrect values (NV); when the ground truth is some concrete values, the model can predict “None” value (VN), correct values (VC) or incorrect values (VW). NN, NV, VN, VC, and VW are the number of examples for each case. We compute P and R as follows: P = \|CV\|/\|CV\| + \|WPV\| + \|WNV\| , R = \|CV\|/\|CV\| + \|WV\| F_1 = 2 ×P×R/P+R where CV refers to correct values, and WV refers to not predicted values. WPV means the predicted values that belongs to the gold positive attributes, while WNV means the predicted values that belongs to the gold negative attributes. §.§ Results Table <ref> shows the performance of each model on mave and our in-house datasets. Our generation-based models with -first ordering mostly outperformed the extraction- and classification-based baselines in terms of F_1.[ The gap in performance may be partly attributed to the difference in the number of parameters in the base models. However, as shown in Table <ref>, the generation model still has the advantage that it can address the challenges in the pavi task that the other approaches intrinsically cannot solve. ] The differences between the best models and the baselines were significant (p<0.0005) under approximate randomized test <cit.>. The higher recall of our generation-based models suggests the impact of capturing inter-value dependencies ( <ref>). The impact of the composition of attribute-value pairs depends on whether the output values are canonicalized. On the mave dataset, the models with the value-then-attribute composition outperformed those with attribute-then-value composition in terms of macro F_1. This is because all output values appear in the mave dataset. Thus, to the models, it is easier to generate values than attributes. Meanwhile, the advantage of value-then-attribute composition is smaller on our in-house dataset since there is no guarantee that the target values appear in the text as raw strings. The impact of the ordering of attribute-value pairs depends on the number of attribute-value pairs per example. On the in-house dataset, the models with rare-first ordering consistently outperformed those with common-first ordering in terms of F_1. This result implies that decoding specific attribute-value pairs in advance is more helpful to generate general attribute-value pairs on the in-house dataset. Meanwhile, there is no clear difference between the models with -first orderings on the mave dataset, since the number of attribute-value pairs per example is small. These results confirm that the generative approach learns to flexibly perform canonicalization if it is required in the training data.[ To make a more lenient comparison for bert-ner on the in-house dataset, we have also evaluated all models on attribute-value pairs in the test data whose attributes are observed in the training data of bert-ner. On this test data, our generation-based model still outperformed the bert-ner and bert-mlc models; t5 (⟨V, A⟩, Rare-first) and bert-ner show the best micro (macro) F_1 of 85.75 (55.48) and 58.92 (30.17), respectively.] Meanwhile, the performance of extraction- and classification-based approaches depends on whether the attribute-value pairs are canonicalized or not. Quantitative comparison of each approach To see the detailed behaviors of individual approaches, we categorized the attributes in the mave and our in-house datasets according to the number of training examples and the number of distinct values per attribute. We divide the attributes into four according to median frequency and number of values. Tables <ref> and <ref> list micro and macro F_1 values of each approach for each category of attributes on the mave and our in-house datasets, respectively. From the table, we can see that t5 shows the best performance in all categories. This suggests that t5 is more robust than bert-ner and bert-mlc in the pavi task. We can also observe that the performance of bert-mlc drops significantly for attributes with a small number of training examples compared to those with a large number of training examples; the classification-based approach makes an effort to better classify more frequent attributes. Meanwhile, the performance drops of bert-ner and t5 are more moderate than bert-mlc, especially on the mave dataset. Moreover, we can see that t5 shows better micro F_1 for attributes that have a smaller number of distinct values on our in-house dataset, whereas it shows better micro F_1 for attributes that have a larger number of distinct values on the mave dataset. This implies that, although it is easy for the generation-based approaches to extract diverse values from text, it is still difficult to canonicalize those diverse values. §.§ Analysis From the better macro F_1 of t5 with *-first ordering than with random ordering, we confirmed that our generation-based models successfully capture inter-value dependencies to decode attribute-value pairs. In what follows, we perform further analysis to see if the generative approach addresses the three challenges; namely, unseen, multi-attribute (or nested), and canonicalized values (Table <ref>). Can generative models identify unseen values? To see how effective our generative models are for unseen attribute values, we compare its performance with bert-ner on attribute-value pairs in the test data that do not appear in the training data (13,578 and 491 unseen values exist in the mave and in-house datasets, respectively). Table <ref> shows the results. We can see that the t5 models outperform bert-ner, especially in terms of macro F_1. Although the extraction-based approach can extract unseen values, the unified generative approach works better for extracting unseen values than the extraction-based approach. Can generative models identify multi-attribute values? Next, to see how effective our generative models are for identifying multi-attribute values, we compare its performance to the baselines on attribute-value pairs in the test data that appear only as multi-attribute (or nested) values in input text. The number of such values in the mave and our in-house datasets is 60,832 and 15,843, respectively. Table <ref> shows the results. We can see that the t5 models outperform all baselines in terms of macro F_1. Although the classification-based models can identify multi-attribute values, the generative models outperformed those models. Can generative models identify canonicalized values? Lastly, to verify how effective our generative models are for identifying canonicalized values, we compare its performance with bert-mlc (w/ tax) on 207,997 attribute-value pairs whose values do not appear as raw strings in the corresponding product text in our in-house dataset. Table <ref> shows the results. The t5 models show comparable performance to and outperform the baselines in terms of micro and macro F_1, respectively. To see what types of canonicalization the t5 models need to perform when the canonicalized values do not appear in the text, we manually inspect attribute-value pairs whose values do not appear in text on the development set. Table <ref> exemplifies canonicalization that t5 models need to perform. From the table, we can see that the canonicalization included understanding structure in values (labels) (e.g., iPhone is a product of Apple), referring the world knowledge (the coat has long sleeves), recognizing paraphrases (PU is an abbreviation of polyurethane), and understanding product descriptions (“the card slot is on the left” entails that the product has a card holder). As a result, we found that the canonicalization included normalization (e.g., Honda and HONDA), synonym detection (clothing size M and 2), hyponymy identification (e.g., walnut to wood), entity linking (mapping AQUOS to AQUOS (Sharp)), and reasoning (Wild Turkey to its production country). We conclude that our generative model addressed all the challenges in the pavi task better than the other two approaches. § CONCLUSIONS We have proposed a generative framework for product attribute-value identification (pavi), which is a task to return a set of attribute-value pairs from product text on e-commerce sites. Our model can address the challenges of the pavi task; unseen values, multi-attribute values, and canonicalized values. We finetune a pre-trained model t5 to autoregressively decode a set of attribute-value pairs from the given product text. To linearize the set of attribute-value pairs, we explored two types of attribute-value composition and three types of the orderings of the attribute-value pairs. Experimental results on two real-world datasets demonstrated that our generative approach outperformed the extraction- and classification-based baselines. We plan to augment the ability to decode unseen values by using a pluggable copy mechanism <cit.>. We will evaluate our model on another pavi setting where the target attribute(s) are given. § LIMITATIONS Since our generative approach to product attribute-value identification autoregressively decodes a set of attribute-value pairs as a sequence, the inference is slow (Table <ref>) and how to linearize the set of attribute-value pairs in the training data will affect the performance (Table <ref>). The best way of composing an attribute-value pair and ordering the pairs will depend on the characteristics of the datasets such as the existence of canonicalized values and the number of attribute-value pairs per example. Those who attempt to apply our method to their own datasets should keep this in mind. § ACKNOWLEDGEMENTS This work (second author) was partially supported by JSPS KAKENHI Grant Number 21H03494. We thank the anonymous reviewers for their hard work. acl_natbib §.§ Quantitative Comparison of Each Approach on MAVE Data To see the detailed behaviors of individual approaches on the mave dataset, we categorized the attributes according to the number of training examples and the number of distinct values per attribute. We divide the attributes into four according to median frequency and number of values. Table <ref> lists micro and macro F_1 values of each approach for each category of attributes. Similarly with the results on the in-house dataset, we can see that t5 shows the best performance in all categories and that the performance of bert-mlc is poor for attributes with a small number of training examples. On the other hand, in contrast to the results on the in-house dataset, bert-ner and t5 show better micro F_1 for attributes that have a large number of distinct values than those with a small number of distinct values. § FINAL HYPERPARAMETERS USED FOR EACH MODEL Table <ref> shows the hyperparameters we used for training models. Other than those, we follow the default hyperparameters of t5t5_en t5_jp and bertbert_en bert_jp available from the HuggingFace models. § PERFORMANCE OF MODELS USING BERT_LARGE Table <ref> shows the performance of models when we use bert_large as the base model for extraction- and classification-based approaches. We adopt [<https://huggingface.co/bert-large-cased>] for mave and [<https://huggingface.co/cl-tohoku/bert-large-japanese>] for our in-house data. From the table, we can see that training bert-mlc did not work well on both datasets. Especially, we cannot compute the performance on our in-house data because the model did not predict any attribute-value pairs for all inputs. Although bert_large has a larger number of parameters (330M) than the t5 models (220M), bert-ner based on bert_large still shows lower performance than our generative models on both datasets. This result means that our generative approach is more effective in the pavi task than the extraction-based approaches based on bert-ner. Meanwhile, bert-mlc w/ tax shows a slightly better micro F_1 score than ours. Given that it requires an attribute taxonomy as the extra supervision and exhibits low macro F_1, the generative approach is sufficiently comparable to the classification-based approach. §.§ Statistics and Examples of Dataset Tables <ref> and <ref> show detailed statistics and example product data in mave and our in-house datasets, respectively. §.§ Computing Infrastructure Used for Running Experiments We implemented all the models in PyTorch <cit.> (ver. 1.10.0 for t5, and ver. 1.7.0 for bert-ner and mlc). We used “t5-base[<https://huggingface.co/t5-base>]” and “sonoisa/t5-base-japanese[<https://huggingface.co/sonoisa/t5-base-japanese>]” in Transformers <cit.> as the pre-trained t5 models for experiments on mave and for those on our in-house data, respectively. For training and testing, we use the default parameters listed in a configuration file that accompanies each t5 model. For bert-based models, we used “bert-base-cased[<https://huggingface.co/bert-base-cased>]” for mave, and “cl-tohoku/bert-base-japanese[<https://huggingface.co/cl-tohoku/bert-base-japanese>]” for our in-house dataset. We also use the default parameters in a configuration file of each model. We used NVIDIA DGX A100 GPU on a Linux (Ubuntu) server with a AMD EPYC 7742 CPU at 2.25 GHz with 2048GB main memory for performing the experiments. Table <ref> shows GPU hours taken for the experiments.
http://arxiv.org/abs/2306.12491v1	20230621180333	Entropy-current for dynamical black holes in Chern-Simons theories of gravity	[ "Ishan Deo", "Prateksh Dhivakar", "Nilay Kundu" ]	hep-th	[ "hep-th", "gr-qc" ]	a]Ishan Deo [a]Department of Physics, Indian Institute of Technology Kanpur, Kalyanpur, Kanpur 208016, India a], Prateksh Dhivakar a], and Nilay Kundu (ishandeo, prateksh, nilayhep)@iitk.ac.in We construct an entropy current and establish a local version of the classical second law of thermodynamics for dynamical black holes in Chern-Simons (CS) theories of gravity. We work in a chosen set of Gaussian null coordinates and assume the dynamics to be small perturbations around the Killing horizon. In explicit examples of both purely gravitational and mixed gauge gravity CS theories in (2+1) and (4+1)-dimensions, the entropy current is obtained by studying the off-shell structure of the equations of motion evaluated on the horizon. For the CS theory in (2+1) dimensions, we argue that the second law holds to quadratic order in perturbations by considering it as a low energy effective field theory with the leading piece given by Einstein gravity. In all such examples, we show that the construction of entropy current is invariant under the reparameterization of the null horizon coordinates. Finally, extending an existing formalism for diffeomorphism invariant theories, we construct an abstract proof for the linearised second law in arbitrary Chern-Simons theories in any given odd dimensions by studying the off-shell equations of motion. As a check of consistency, we verify that the outcome of this algorithmic proof matches precisely with the results obtained in explicit examples. Entropy-current for dynamical black holes in Chern-Simons theories of gravity [ 7 June 2023 ============================================================================= § INTRODUCTION Classical black hole solutions in Einstein's theory of general relativity (GR) obey a set of geometric relations that are analogous to the laws of thermodynamics <cit.>. Hawking's independent calculation of a black hole's temperature and radiation <cit.> asserts that these laws are not just analogies. In such a theory, the area of the black hole horizon defines its entropy. However, GR is not the complete framework to explain all the gravitational phenomena in our universe. Also, any UV complete theory of quantum gravity, upon taking the consistent low energy effective theory limit, will generate corrections to the leading Einstein-Hilbert term in the Lagrangian <cit.>[GR is a two-derivative theory of gravity since the Einstein-Hilbert Lagrangian contains two derivatives of the space-time metric variable. These correction terms involve more than two derivatives of the metric theories of gravity.]. These theories beyond Einstein's GR are generally called higher derivative theories of gravity. Interestingly, to prove the laws of black hole mechanics, we need to know the theory of gravitation from which the black holes are obtained as classical solutions[It is expected that the black hole solutions in higher derivative gravity theories should continue behaving like thermodynamic objects. However, the geometric definitions of various thermodynamic quantities, like entropy, should be modified from their definitions in GR.]. The works of Iyer and Wald <cit.> derived a definition of entropy for stationary black holes, called Wald entropy, consistent with the first law of thermodynamics for any theory of gravity with a diffeomorphism invariant Lagrangian density. However, the Wald entropy suffers from ambiguities for dynamical black holes <cit.>, and we still lack one complete proof of the second law for such dynamical black holes in a general diffeomorphism invariant theory of gravity. Recently, significant progress was made in <cit.> on the question of whether we can define a black hole entropy in arbitrary diffeomorphism invariant theories of gravity that obey the classical second law. In this work, the dynamics of the black hole were approximated to be small fluctuations around a stationary black hole, and the analysis was performed perturbatively to the linear order in the amplitude of the fluctuations. Previously, this question of the second law was pursued for model-specific theories <cit.>. Building on <cit.>, in <cit.>, an entropy current was constructed on the null horizon of the dynamical black holes up to linear order in fluctuations. The null component of this entropy current gives us the local entropy density, and its spatial component signifies a flux of in and out flow of entropy on the spatial sections of the horizon. Working to the linear order in the amplitude expansion, it was shown that this entropy current is divergenceless and thereby establishing an ultra-local (i.e., local both in the temporal and spatial extent of the horizon) version of the linearized second law [To derive these results, it was assumed that the matter sector was minimally coupled and satisfied the null energy condition (NEC). In a follow-up paper <cit.>, this construction of entropy current at linear order was extended to theories involving non-minimally coupled matter as well.]. The main idea behind the construction of an entropy current in <cit.> was to study the off-shell structure of the equations of motion (EoM) on the null horizon to the linear order in the fluctuations. After choosing a gauge for the metric and using a boost symmetry of the near horizon region, a specific off-shell form of the null projected EoM was established, from which the components of the entropy current can be read off [We would like to highlight that obtaining this specific off-shell form of the EoM components is an independent result with possible applications beyond the linearized second law.]. Furthermore, in <cit.>, the second law was established to the quadratic order in the fluctuations by treating the higher derivative terms in the Lagrangian in an effective field theory (EFT) perspective. In such an EFT approach, the Lagrangian of the gravitational theory appears as a summation of various terms (each of which is a scalar under diffeomorphism), all arranged according to the increasing number of derivatives present in each of these terms, starting with the leading two-derivative Einstein-Hilbert term for GR. It is important to note that the derivation of black hole entropy by Iyer and Wald <cit.>, consistent with the first law of thermodynamics, and all the subsequent developments mentioned above in <cit.>, are based on Noether formalism which heavily relies on diffeomorphism invariance. However, as low energy effective theories of gravity beyond GR, we have another class of very interesting theories which are not invariant under diffeomorphisms. These theories are known as the Chern-Simons (CS) theories <cit.>. For example, they appear naturally as low-energy effective theories resulting from compactifications of string theories <cit.>. CS theories can be of the purely gravitational type or purely gauge type, or of mixed gauge gravity type. The Lagrangians of CS theories are written in odd space-time dimensions, and they explicitly involve the Christoffel symbols Γ^μ_νρ or the gauge field A_μ, thus justifying why they are not diffeomorphism invariant [As we will see later, strictly speaking, CS theories are diffeomorphism invariant up to total derivative terms involving non-covariant Γ^μ_ρν and A_μ. Additionally, although the Lagrangian is not a diffeomorphism covariant object, the EoMs turn out to be covariant.]. Previously, in the literature, people have already studied the particular case of three-dimensional gravitational CS terms from various different perspectives, most importantly in the context of topologically massive gravity theories <cit.> and from holographic perspectives <cit.>. We will, however, focus on CS theories in the context of black hole entropy. In <cit.>, the authors mainly used Noether principles to compute black hole entropy based on covariant phase space formalism applicable for manifestly diffeomorphism covariant theories <cit.>. In an important work, Tachikawa <cit.> suggested an extension of the Lee-Iyer-Wald prescription to CS theories by pointing out necessary modifications in defining a stationary black hole entropy consistent with the first law. Later in <cit.>, and subsequently in <cit.>, Tachikawa's proposal was studied in detail, particularly focusing on refinements of the covariant phase space formalism, making it suitable for CS theories. They worked out a general formula for black hole entropy in theories with arbitrary CS terms in the Lagrangian (for both purely gravitational CS and mixed gauge gravity CS terms). In this paper, our aim is to go beyond the first law and argue for the second law for dynamical black holes in CS theories, both in purely gravitational and mixed gauge gravity cases. It will be assumed that there are dynamical black hole solutions in CS theories [Such dynamical black hole solutions were constructed in <cit.>. An important class of solutions was also constructed in <cit.>.], such that the dynamics can be considered as small fluctuations around the stationary black holes, and they can be treated perturbatively with the amplitude of the fluctuations being the small parameter. This way, we can see that the formalism developed in <cit.> can be directly employed. Following that set up, we will analyze the null-projected components of the EoM and will show that it has the desired off-shell structure when evaluated on the horizon (refer to eq.(<ref>)). Consequently, we will obtain an entropy current on the horizon of dynamical black holes in CS theories. One consistency of our entropy current would be to verify that the entropy density reproduces Tachikawa's result for stationary black holes. Additionally, we will get the spatial component of the entropy current, suggesting possible in/out flux of entropy density on a spatial slice of the horizon. Let us now outline the organization of the rest of this paper. In <ref>, we will briefly overview the background setup and the working principle. Following that in <ref>, we will consider specific examples of CS theories in (2+1) and (4+1) dimensions, for which we know the EoMs explicitly, and we will work out the required components of EoM in a brute-force manner up to linearized order in the fluctuations. In working out the off-shell structure of the EoM, the boost symmetry of the near horizon stationary black hole and its perturbative breaking due to the dynamics will be used. This will readily give us the components of the entropy current on the horizon. Using the same logic as in <cit.>, this entropy current will have zero entropy production by construction for on-shell configurations upto linearized order in the fluctuations. Consequently, the linearized second law will follow automatically, at least in those examples of CS theories we have studied. It is also important to note that working within the linearized approximation for the dynamics is very restricted in its scope to prove a second law since there is no actual entropy production to this order. One can, at the most, show that entropy is not destroyed. The effects of non-linear perturbations around stationarity must be incorporated to observe entropy production. For Gauss-Bonnet theory and other members of the Lovelock family, the second law was attempted in <cit.> to all non-linear orders of the fluctuation. Recently in <cit.>, the authors looked at diffeomorphism invariant higher derivative theories in an EFT setup discussed above and proved a second law to the quadratic order in perturbations. In <ref>, we will consider CS theory in (2+1) dimensions in the same EFT setup. There will be two terms in the Lagrangian, the leading one being the standard two derivative Einstein Hilbert term plus the sub-leading three derivative CS term. As we discussed before, terms with a higher number of derivatives will become less and less important. Thereafter, following the arguments presented in <cit.>, we will see that the second law can be proved in this theory within a double perturbation series, i.e., to the quadratic order in the fluctuations but ignoring terms that involve more than three derivatives on the metric. The construction of entropy current relies heavily on a specific choice of coordinates and signifies entropy production at the horizon. It is quite natural then to expect that such a physical process should not depend on the choice of coordinate system. In other words, the covariance of entropy production under reparametrization of the horizon slicing should be a consistency check for the expressions of the entropy current. This has been verified in <cit.> for a specific theory of higher derivative gravity, namely the Gauss-Bonnet gravity. Later, it has also been studied in <cit.> for generic diffeomorphism-invariant theories. Following these methods, in <ref>, we will also check that for CS theories, both in (2+1) and (4+1) dimensions, the entropy current that we obtained previously indeed transforms covariantly under reparametrization of the horizon slicing. As we will argue later, this consistency check also justifies the need to consider the spatial components of the entropy current on the horizon. Going beyond working with specific examples, in <ref>, we will abstractly prove that for generic CS theories in odd space-time dimensions, the null-projected components of the EoMs will always have the desired off-shell structure. In other words, going beyond the brute force calculation of EoMs, which is to be performed case by case in a theory with a given Lagrangian, an algorithm can be developed to construct an entropy current for CS theories with non-negative divergence up to linearized order in the dynamical fluctuations around a stationary black hole. For diffeomorphism invariant theories, such a proof has been worked out in <cit.>. The analysis in <cit.> essentially used elements from covariant phase space formalism adapted to a specific coordinate system and the chosen metric gauge but only applicable to diffeomorphism invariant theories. Thus, we will follow a similar set of principles outlined in <cit.> but use results from a modified covariant phase space formalism for CS theories, which was developed in <cit.>. This exercise will also lead us to an alternative definition of the components of the entropy current written in terms of objects from the covariant phase space formalism (e.g., pre-symplectic potential, current, Noether charge, etc.). In <ref>, we will explicitly check that the entropy current obtained from this abstract algorithm matches the results obtained from a brute force calculation of EoM for specific model examples of CS theories we have already studied. Finally, we will conclude with a summary of our results and some comments in <ref>. There are additional appendices containing technical details of our calculations that will be omitted in the main text. § BASIC SET UP, AND THE WORKING PRINCIPLE TO CONSTRUCT AN ENTROPY CURRENT This section will review various essential elements of constructing an entropy current for dynamical black holes. In <ref>, we will present the basic setup drawing from the formalism developed for diffeomorphism invariant theories, mainly focusing on <cit.>. Next, in <ref>, we review the elements of covariant phase space, highlighting the modifications one must consider for working with CS theories. §.§ Review of the setup for diffeomorphism invariant theories §.§ A generic choice of horizon adapted coordinates: Without any loss of generality, we make a choice of coordinates and also work in a chosen gauge for the metric, known as Gaussian normal coordinates, in d dimensions as mentioned below ds^2 = 2 dv dr -r^2 X(r, v, x^i) dv^2 + 2 r ω_i(r, v, x^i) dv dx^i + h_ij(r, v, x^i) dx^i dx^j . This metric describes the space-time in the neighborhood of a co-dimension one null hypersurface, denoted by ℋ and placed at r=0. The co-dimension two constant v-slices of the horizon, indicated by as ℋ_v, is spanned by the (d-2) spatial coordinates x^i, and has the induced metric given by h_ij. Within our choice, v and r are affine parameters, and thus ∂_v denotes the generators for affinely parametrized null geodesics on ℋ [See 2.1 of <cit.> for details.]. With the understanding that the event horizon of a black hole is a null hypersurface, we can consider the metric gauge in eq.(<ref>) describing the near horizon region of that black hole close to a final equilibrium configuration. §.§ Stationary black holes and linearized perturbations around it at 𝒪(ϵ): An equilibrium configuration of a black hole is denoted by a stationary metric. With the choice of metric gauge mentioned above, a stationary black hole (at least the near horizon region of it) can always be written in the form eq.(<ref>), with further restrictions on the functional dependence of the metric coefficients (X, ω_i, and h_ij) on the coordinates as follows X^eq = X^eq (rv, x^i), ω^eq_i = ω^eq_i (rv, x^i), h^eq_ij = h^eq_ij (rv, x^i). For stationary black holes, with eq.(<ref>), we get a Killing vector ξ = v ∂_v -r ∂_r , such that the Lie derivative with respect to ξ vanishes for the equilibrium metric, ℒ_ξ g^eq_μν\|_r=0=0. Also, the norm of ξ vanishes on r=0, and, hence, it becomes a Killing horizon; see 2.2 of <cit.> for details. Notably, in generic higher derivative gravity theory, there is no general proof that the event horizon of a stationary black hole is a Killing horizon. The technical setup that will be followed applies to a Killing horizon, and we are assuming that the metric in eq.(<ref>) with eq.(<ref>) describes a stationary black hole with its event horizon being a Killing horizon [See the discussion in 1.5 of <cit.>.]. Actually, we have a bifurcate Killing horizon at r=0 [Recently, in <cit.> the Zeroth law was proved for a diffeomorphism invariant theory considered in an EFT expansion. This implies that once the Zeroth law is imposed, that is established, the space-time can always be brought to eq.(<ref>) with eq.(<ref>).]. To define a stationary configuration involving a U(1) gauge field A_μ, we need to specify if our definition of stationarity is consistent with the U(1) gauge transformations, A_μ→ A_μ + D_μΛ, where D_μ is the covariant derivative with respect to the full dynamical metric eq.(<ref>). Following the convention mentioned in <cit.>, we define the following definition of stationarity that is also U(1) gauge invariant, ℒ_ξ A^eq_μ+ D_μΛ = 0 , where Λ is the parameter of U(1) gauge transformations. In our horizon adapted coordinates eq.(<ref>) and eq.(<ref>), this becomes the following (A^eq_μξ^μ + Λ) \|_r=0= (v A^eq_v + Λ) \|_r=0=0 , on the horizon (see 3 in <cit.> for details). Having discussed the equilibrium configuration for both the metric and the gauge field, we can now define the black hole's out-of-equilibrium (i.e., non-stationary) dynamics. In our work, we consider only linearized dynamical fluctuations around the stationary background configuration as follows X = X^eq (rv, x^i) +ϵ δ X (r, v, x^i), ω_i = ω_i^eq (rv, x^i) +ϵ δω_i (r, v, x^i), h_ij = h_ij^eq (rv, x^i) +ϵ δ h_ij (r, v, x^i), A_μ = A_μ^eq (rv, x^i) +ϵ δ A_μ(r, v, x^i) , where ϵ is the amplitude of the fluctuations. Working to the linearized order in a perturbative expansion in the amplitude essentially means that we keep terms of 𝒪(ϵ) but neglect all terms of 𝒪(ϵ^n) with n≥ 2. It should be noted that the difference between the equilibrium quantities and the non-stationary fluctuations is in their functional dependence on the v coordinate, e.g., X^eq can depend only on the product vr as opposed to δ X depending arbitrarily on v and r. §.§ Boost symmetry of near horizon stationary metric and classifying terms with boost weight: The near horizon metric of a stationary black hole, as in eq.(<ref>), has the following symmetry, more specifically, an isometry preserving the gauge eq.(<ref>), r →r̃ = λ r , v →ṽ = v/λ , (with λ being a free constant parameter) , which we call the boost symmetry [Actually, there is a larger class of isometry preserving our choice of metric gauge where λ can be x^i dependent function, see 2.1 of <cit.> for details. For our purpose of constructing the entropy current on the horizon with a fixed choice of coordinates, it is sufficient to work with constant λ. However, as we will see later, the x^i dependence of λ will be important to understand the reparametrization covariance of the entropy production with the change of coordinates on the horizon.]. An infinitesimal boost transformation is generated by the Killing vector ξ defined in eq.(<ref>). The product rv is invariant under the boost transformation eq.(<ref>), and, therefore, it is justified why the v dependence of all equilibrium quantities (e.g., X^eq), if any, must always be through rv. As explained in detail in <cit.> (see 2.2 and 2.3 therein), this boost symmetry is crucial for us to classify various terms depending on how they transform under eq.(<ref>). To felicitate this classification, we assign boost-weight to a generic term, say 𝒫, in the following way Boost weight of 𝒫 is w if, 𝒫→𝒫 = λ^w 𝒫 , under eq.(<ref>) . Now, it is straightforward to see that X^eq, ω_i^eq, h_ij^eq are all boost-invariant objects. Additionally, the derivative operator ∇_i (the covariant derivative compatible with the induced metric h_ij) is also boost-invariant, but ∂_v and ∂_r have boost weights +1 and -1, respectively. The basic working principle to analyze the off-shell equations of motion is to consider any covariant tensor to be built out of the following basic elements: the metric coefficient functions (X, ω_i, h_ij) and various derivatives (∂_v, ∂_r, ∇_i) acting on them. Consequently, one can immediately know the boost-weight of 𝒫, a generic covariant tensor, once we know its explicit construction in terms of the basic elements mentioned above. Equivalently, one can look at the Lie derivative of 𝒫 along ξ. For 𝒫 evaluated on equilibrium configurations, its Lie derivative should vanish. Once we demand this, we can interpret eq.(<ref>) in terms of the following alternative definition of boost weight of 𝒫: it is the difference between the number of lower v indices and the number of lower r indices in 𝒫, with all its indices lowered. Apart from knowing the boost-weight of arbitrary covariant terms, we also need to decide, when evaluated at the horizon, which terms are in linear order at amplitude expansion (i.e., at 𝒪(ϵ)) and which are at higher orders. We should determine the explicit appearance of ∂_v and ∂_r in any generic term. For example, let us assume that we schematically know[We are suppressing the possible tensor components of 𝒫.] 𝒫∼ (∂_r)^n_1 (∂_v)^n_2𝒬, with n_2 > n_1, and 𝒬 depending on X, ω_i, h_ij and only ∇_i acting on them. Since, generally, we also know 𝒫 (r, v, x^i) = 𝒫^eq (rv, x^i)+ ϵ δ𝒫 (r, v, x^i), it is obvious that 𝒫^eq\|_r=0 vanishes when evaluated at the horizon, and 𝒫\|_r=0 is non-zero only for non-stationary configurations. Additionally, we must note that, in 𝒫∼ (∂_r)^n_1 (∂_v)^n_2𝒬, all the extra[In 𝒫∼ (∂_r)^n_1 (∂_v)^n_2𝒬, n_1 number of ∂_v are paired with an equal number of ∂_r, but (n_2-n_1) number of ∂_v's are uncompensated, and hence, they are the extra ones that we are referring to.] ∂_v's act on a single quantity 𝒬. Hence, we can argue that 𝒫\|_r=0∼𝒪(ϵ). On the contrary, consider that we are dealing with a generic term, say ℛ, with a schematic structure given by the product of two such terms (each of which is like 𝒫), i.e., ℛ∼ (∂_r)^n_1 (∂_v)^n_2𝒬_1 × (∂_r)^n_3 (∂_v)^n_4𝒬_2, with n_2 > n_1 and n_4 > n_3. Then, following the same logic mentioned above, we must conclude that ℛ\|_r=0∼𝒪(ϵ^2). Also, with the input of boost weight specifications for a gauge field, eq.(<ref>), which is a statement about equilibrium A^eq_μ, can now be refined for a generic A_μ as (A_μξ^μ + Λ) \|_r=0= (v A_v + Λ) \|_r=0 = 𝒪(ϵ) ; see Appendix-B of <cit.> for a derivation. This can alternatively be interpreted as a generalized Zeroth law involving the gauge fields. Thus, we have a consistent algorithm to decide whether a covariant tensor, built out of the metric coefficients, will contribute to 𝒪(ϵ) or to 𝒪(ϵ^2). As mentioned above, we need to keep track of explicit ∂_v and ∂_r present in any given term. It is also important to remember that the statements are being made on the horizon at r=0[We are being brief here, but the reader is requested to see 2 of <cit.> for all the details.]. §.§ Off-shell structure of the equations of motion and the linearized second law: With the rules written down so far, it is straightforward now to write down the components of the entropy current by looking at the off-shell structure of the gravity equations of motion. Consider the Lagrangian of a theory given to us; then, we readily have the equations of motion. It was shown in <cit.> that the vv-component of the equations of motion for U(1) gauge invariant and diffeomorphism invariant theories of gravity, when evaluated on the horizon, has the following structure E_vv \|_r=0 = ∂_v [ 1/√(h)∂_v ( √(h) 𝒥^v) + ∇_i 𝒥^i] + 𝒪(ϵ^2) . One can consider eq.(<ref>) as the definitions of the quantities 𝒥^v and 𝒥^i. As of now, eq.(<ref>) is a statement about the off-shell structure of the EoM. Let us now briefly mention the chain of logic that connects establishing eq.(<ref>) to the linearized second law. This also justifies the significance of 𝒥^v and 𝒥^i constituting the components of the entropy current. The reader is referred to 2.4 of <cit.> for the details. The entropy of a dynamical non-stationary black hole can be written as S_tot = ∫_ℋ_vd^d-2x √(h)(s_wald + s_cor) , where s_wald is the entropy density given by the Wald formula. Therefore, by construction, s_wald corresponds to the entropy density of a stationary black hole consistent with the first law. We should remember that s_wald = 1 + s^HD_wald, where the factor of 1 is the contribution due to two-derivative Einstein-Hilbert Lagrangian in GR and s^HD_wald signifies the contribution solely coming from the higher derivative part of the Lagrangian. Finally, s_cor in eq.(<ref>) corresponds to a possible non-equilibrium contribution to black hole entropy density, which the Wald entropy piece does not capture. Therefore, it should vanish upon taking the equilibrium limit, s_cor \|_eq→ 0. The Raychaudhuri equation for the affinely parameterized null generator of the horizon takes the following form ∂_v ϑ = E^HD_vv + ∂_v [ 1/√(h)∂_v ( √(h) (s^HD_wald+ s_cor)) ] -T_vv + 𝒪(ϵ^2) , where ϑ is the local expansion parameter for the null congruence, defined by ∂ S_tot/∂ v = ∫_ℋ_vd^d-2x √(h) ϑ . Also, E^HD_vv is the EoM for the higher derivative part of the gravity Lagrangian (the Einstein-Hilbert part is being treated separately), and T_vv is the stress-energy tensor for the matter part in the Lagrangian in eq.(<ref>). In deriving eq.(<ref>) we have used the EoM R_vv+E^HD_vv=T_vv. At this stage, we assume that the matter fields, present if any, satisfy the null energy condition (NEC), T_vv≥ 0 [Within the classical setup that we are concerned with, for minimally coupled matter fields NEC is satisfied, due to T_vv∼𝒪(ϵ^2). But for non-minimally coupled matter fields, NEC can be violated as T_vv∼𝒪(ϵ). However, as shown in <cit.>, an entropy current structure can be formulated even for such non-minimal coupling.]. Now, if the first two terms on the RHS of eq.(<ref>) cancel each other upto 𝒪(ϵ^2), we get ∂_v ϑ≤ 0, meaning ϑ is a monotonically decreasing function of v. Additionally, we are considering situations where at late times, the perturbations die off and the black hole settles down to a stationary one, i.e., ϑ→ 0 as v →∞. This proves that ϑ≥ 0, implying S_tot is an increasing function of v upto corrections at 𝒪(ϵ^2). Thus, the linearized second law is proved [Truly speaking, there is no entropy production at 𝒪(ϵ). So at the linearized order, we are showing ϑ = 0, most importantly, confirming that ϑ cannot be negative.]. From the arguments presented above, we can clearly see that once eq.(<ref>) establishes the off-shell structure of E^HD_vv, the first two terms on the RHS of eq.(<ref>) indeed cancel each other upto 𝒪(ϵ^2), provided we identify the equilibrium limit of 𝒥^v as the Wald entropy density, 𝒥^v \|_eq = s_wald . On the other hand, for out-of-equilibrium configurations, we learn that 𝒥^i signifies the spatial flow of entropy density along a constant v-slice ℋ_v. For a compact slice, it does not contribute to S_tot. Also, s_cor captures the terms known as the JKM ambiguities, which do not survive the equilibrium limit. In this paper, our primary goal is to establish the off-shell structure of E_vv given by eq.(<ref>) for Chern-Simons theories, both in the case of purely gravitational or mixed gauge gravity Chern-Simons theories, working only with U(1) gauge fields. We will be constructing the entropy current (𝒥^v and 𝒥^i) for such theories. Following the arguments presented here, the linearized second law will also then be proved. §.§ Reparametrization covariance of entropy production at the horizon: It is clear from the discussion so far that the construction of entropy current from the off-shell structure of E_vv given in eq.(<ref>) relies heavily on the specific choice of the coordinates in eq.(<ref>), in other words, it depends on how the constant v-slices are being chosen. This is obvious because the boost symmetry in eq.(<ref>) played a crucial role in obtaining eq.(<ref>), and we could make use of the boost symmetry since the near horizon space-time has been written in the form eq.(<ref>), where both v and r have been taken to be affinely parameterized. However, as we have seen, the main content of eq.(<ref>) is to validate the linearized second law. It is quite natural then to expect that such a physical process should not depend on the choice of coordinate system. This question has been verified in <cit.> for a specific theory of higher derivative gravity, namely the Gauss-Bonnet gravity. Following that, skipping the details, here we will briefly list out the steps that should be followed to verify the covariance of entropy production under reparametrization of the horizon slicing. The main idea is to verify the covariance of eq.(<ref>) under possible coordinate transformation that preserves the gauge choice of eq.(<ref>). Such residual transformations that take (v, r, x^a) to (τ, ρ, y^a) are the following v = e^ζ(y⃗)τ + 𝒪 (ρ) , r = e^-ζ(y⃗)ρ + 𝒪 (ρ^2) , x^a = y^a + 𝒪 (ρ) . The coordinate transformations written in eq.(<ref>) (including the sub-leading pieces at 𝒪 (ρ) and higher, which we have not written explicitly) get constrained by the facts that τ and ρ remain to be affinely parameterized. Also, the horizon is positioned at ρ =0. Under eq.(<ref>), the near-horizon metric would transform as given below ds^2 = 2 dτ dρ -ρ^2 X(ρ, τ, y^i) dτ^2 + 2 ρ ω_i(ρ, τ, y^i) dτ dy^i + h_ij(ρ, τ, y^i) dy^i dy^j , such that X, ω_i, h_ij can be obtained in terms of the old quantities [See <cit.> for derivations of these.] X(ρ, τ, y^i) = X +ω _i ξ _j h^ij+ξ _i ξ _j h^ij -v (ξ _i h^ij∂_v ω _j+2 ω _i ξ _j K^ij+2 ξ _i ξ _j K^ij) +v^2(ξ _i ξ _l h^kl h^ij∂_v K_jk) + 𝒪(ρ) , ω_i(ρ, τ, y^i) = ω_i-2 ξ _i + 2 v ξ _k h^jk K_ij+𝒪(ρ ) , h_ij(ρ, τ, y^i) = h_ij(v, r, x^i) + 𝒪 (ρ) . Here ξ_i = ∂_i ζ(x^a). This shouldn't be confused with the Killing vector ξ given by eq.(<ref>). Let us now focus on a particular theory with a given Lagrangian, e.g., Gauss-Bonnet in <cit.>. Once we have performed the exercise of establishing eq.(<ref>), we know explicit expressions of E_vv, 𝒥^v and 𝒥^i for that given theory. Now, under eq.(<ref>), E_vv should transform homogeneously in a straightforward way as the components of a rank two covariant tensor. However, 𝒥^v and 𝒥^i are expected to transform in a non-trivial way, which we can track by knowing how the metric coefficients (X, ω_i, h_ij) and their derivatives would transform. When we input that on the RHS of eq.(<ref>), they should cancel among themselves such that eventually, both sides of that equation transform covariantly. We should note that this is a highly non-trivial check of the consistency of eq.(<ref>) and also immediately proves the covariance of the entropy production on the horizon. In <ref>, we will follow this principle to check this explicitly for the Chern-Simons theories of gravity. §.§ Non-linear second law within the EFT setup: In <ref>, we have already mentioned that we will work within the EFT approximation for CS theories in (2+1) dimensions to prove the second law beyond linear orders in the perturbations. Following the description mentioned in <cit.>, we know that in an EFT setup, the Lagrangian of the gravitational theory is organized as a sum of scalar terms with an increasing number of derivatives acting on the metric. Each of them is built out of the Riemann tensor and its derivatives (for pure gravitational CS theories, it can also involve Christoffel symbol Γ^μ_να, and, additionally, the gauge fields A_μ for mixed gauge gravity CS theory) appropriately contracted. The more the number of derivatives in such a term, the more suppressed it becomes. The dimensionful coefficients of the higher derivative terms in the Lagrangian can be called coupling constants, signifying the length scale (say l) where these terms become comparable to the leading two derivative GR term. Another inherent length scale (say L) present in the discussion is associated with the variation of the dynamical configuration. The validity of the EFT approximation lies in assuming that l ≪ L, implying the dynamics are slow enough such that the higher derivative terms in the Lagrangian have smaller contributions compared to the Einstein-Hilbert term. The small parameter of the EFT expansion thus becomes (l/L), which is the second perturbative expansion along with the amplitude of the dynamical expansion ϵ [Thus, one works with a double perturbation theory - one in the amplitude of the fluctuations and the other one being the EFT expansion.]. From dimensional analysis, we know that a term in the Lagrangian with (k+2) derivatives will have a coefficient l^k. To set our working precision in the (l/L) expansion, we will truncate the Lagrangian with a chosen, say, N derivatives. It can then be argued that the EoM will have E_μν∼𝒪 (l^N/L^N+2) [Without any loss of generality we will choose units where L =1, such that we get E_μν∼𝒪 (l^N).]. With all the ingredients for an EFT setup explained in detail, let us now mention the important result that we will apply for studying CS theories in (2+1) dimensions. For diffeomorphism invariant pure gravity theories without any matter fields, it has been shown in <cit.> that one can generalize eq.(<ref>) with inputs from EFT approximation as follows E_vv \|_r=0 = ∂_v [ 1/√(h)∂_v ( √(h) 𝒥^v) + ∇_i 𝒥^i] + (K_ij + X_ij)(K^ij + X^ij)+ ∇_i 𝒴^i + 𝒪( l^N) , which for on-shell configurations (i.e., E_vv = 0) leads to ∂_v [ 1/√(h)∂_v ( √(h) 𝒥^v) + ∇_i 𝒥^i] = - (K_ij + X_ij)(K^ij + X^ij) - ∇_i 𝒴^i + 𝒪( l^N) . Here K_ij= (1/2)∂_v h_ij is the extrinsic curvature of the horizon slice. It should be noted that eq.(<ref>) is not generally exact up to 𝒪(ϵ^2) (there maybe terms that are 𝒪(ϵ^2 l^N) that we neglect), and also both X_ij and 𝒴^i have boost weights 1 and 2 respectively. Also, 𝒴^i contains terms that are the product of at least two terms, each being with boost weight 1, implying 𝒴^i∼𝒪(ϵ^2) (see 1.7 of <cit.>). One can now manipulate eq.(<ref>) such that we arrive at the following ∂ S_tot/∂ v = ∫_ℋ_vd^d-2x √(h) ϑ = - ∫_ℋ_vd^d-2x √(h)∫_v^∞ dv' ∂_v'ϑ = ∫_ℋ_vd^d-2x √(h)∫_v^∞ dv' [∂_v'( ∇_i 𝒥^i ) + (K_ij + X_ij)(K^ij + X^ij) + ∇_i 𝒴^i ] , where in the last step, we have used eq.(<ref>) and also[See 5 of <cit.>, leading to the derivation of eq.(5.6) there, for justification.] ϑ = (1/√(h)) ∂_v ( √(h) 𝒥^v ). From eq.(<ref>) we can get ∂ S_tot/∂ v = ∫_ℋ_vd^d-2x √(h)∫_v^∞ dv' (K_ij + X_ij)(K^ij + X^ij) + 𝒪(ϵ^3) ≥ 0 , ignoring 𝒪(ϵ^2 l^N) corrections. Therefore, we get the second law up to quadratic order in the amplitude of the fluctuations but in an EFT sense where 𝒪(l^N) terms are ignored. In deriving eq.(<ref>), we have used the following facts: firstly, ∇_i 𝒥^i has boost weight 1, and hence it vanishes when evaluated on equilibrium configurations (at the two end points of the v integration in eq.(<ref>)). Hence ∇_i 𝒥^i drops out on the RHS of eq.(<ref>). Secondly, for the spatial total derivative term ∇_i 𝒴^i, we note that 𝒴^i∼𝒪(ϵ^2). Since we are also working to the same 𝒪(ϵ^2), we can interchange the order of integration [We take √(h) to be in the background metric eq.(<ref>) which becomes independent of v on ℋ_v. Thus, we can interchange the x^i integral and the v integral up to terms that are 𝒪(ϵ^3) which arise from the fluctuating part of h_ij in eq.(<ref>).] and get rid of the total derivative piece upon doing the spatial integration. We assume that ℋ_v is compact at this step. The main point that we want to highlight here is that in deriving eq.(<ref>), the foremost step was to argue for the off-shell structure of E_vv as in eq.(<ref>). Our aim, in <ref>, would be to establish that for CS theory in (2+1) dimensions, one can manipulate its EoM in a brute-force manner such that it can be expressed as the RHS of eq.(<ref>). The following steps to arrive at eq.(<ref>) do not depend on the theory under study. So the second law to quadratic order under EFT assumptions will follow straightforwardly. §.§ Off-shell equations of motion in terms of Noether charge in Chern-Simons theories In <ref> eq.(<ref>), we have shown how the component of the EoM E_vv is crucial for the second law. Following <cit.>, we first relate the off-shell structure of equations of motion (EoM) to the Noether charge under diffeomorphism. As stressed above, the main difference between the Lagrangian densities considered here and the Lagrangian densities considered in <cit.> is that they are diffeomorphism invariant up to total derivatives only. Thus, one cannot directly borrow the covariant phase space approach of <cit.>. The modification of the covariant phase formalism for Chern-Simons theories has been worked out in <cit.>. We will review their modification here. We consider a generic Chern-Simons (CS) Lagrangian of the form <cit.> L = L(g_μν, Γ^α_βμ,R^α_ βμν, A_μ,F_μν) . The variation of the CS Lagrangian is given by δ (√(-g) L) = √(-g) E^μνδ g_μν + √(-g) G^μδ A_μ + √(-g) D_μΘ^μ[g_μν, Γ^α_βμ,A_μ,δ g_μν,δΓ^α_βμ,δ A_μ] . E^μν is the gravitational EoM and G^μ is the gauge EoM. Θ^μ is the total derivative term generated in the variation of the Lagrangian. Here we have been explicit in pointing out the dependence of Θ^μ on non-covariant quantities like Γ^α_βμ and A_μ. However, we will not split the covariant and non-covariant contributions separately as in <cit.>. We now consider the variation δ g_μν due to a diffeomorphism x^μ→ x^μ + ζ^μ and a U(1) gauge transformation A_μ→ A_μ + D_μΛ, <cit.>, δ g_μν = ℒ_ζg_μν =D_μζ_ν + D_νζ_μ , δ A_μ = ℒ_ζ A_μ + D_μΛ = ζ^α F_αμ + D_μ( A_αξ^α + Λ) . Now comes the crucial difference between the Lagrangian eq.(<ref>) and the Lagrangians considered in <cit.>. The variation of the CS Lagrangian of the form eq.(<ref>) under a diffeomorphism and U(1) gauge transformation eq.(<ref>) is given by δ [√(-g) L] = √(-g) D_μ ( ζ^μ L ) + √(-g) D_μΞ^μ . This additional variation due to Ξ^μ means that though the action remains diffeomophism/U(1) invariant if we consider compact space-times, the Lagrangian is not diffeomorphism/U(1) invariant. For quantities built out of the metric, the variation in eq.(<ref>) acts as a Lie derivative, and one should consider the Lie derivative acting on non-tensorial quantities like Γ^α_βμ as if their indices were tensorial indices. Substituting eq.(<ref>) and eq.(<ref>) in eq.(<ref>), we have the following expression after some integration by parts manipulation: D_μ[ ζ^μ L + Ξ^μ - 2 ζ_ν E^μν - G^μ(A_νζ^ν + Λ) - Θ^μ ] = - 2 ζ_ν D_μ E^μν - (A_νζ^ν + Λ) D_μ G^μ + G^μζ^ν F_νμ . Following <cit.>, we can derive the following Bianchi identities - 2 D_μ E^μν + G_μ F^νμ = 0 , and D_μ G^μ = 0 . This is derived by integrating both sides of eq.(<ref>) over the entire space-time and by choosing ζ^μ such that it is non-zero only in a small region ℛ. The U(1) gauge transformation parameter, Λ, should also be restricted similarly. The LHS of eq.(<ref>) would vanish since it would integrate to a pure boundary term at infinity where ζ vanishes. Thus, we obtain ∫_full space-time[ζ_ν( - 2 D_μ E^μν + G_μ F^νμ) - (A_νζ^ν + Λ) D_μ G^μ] . This is true as long as ζ is non-zero for a finite region in space-time. Thus eq.(<ref>) holds identically because ζ and A_ν are independent. Substituting eq.(<ref>) in eq.(<ref>), we see that we get an identically conserved vector from the LHS of eq.(<ref>). This can be written as a divergence of an anti-symmetric object Q^μν called the Noether charge: Θ^μ - Ξ^μ - ζ^μ L = - 2 E^μνζ_ν - G^μ (A^νζ_ν + Λ) + D_ν Q^μν . We now choose ζ as the Killing vector ξ = v ∂_v - r ∂_r given by eq.(<ref>). Contracting the above equation with ξ, we get Θ^μξ_μ - Ξ^μξ_μ - ξ^μξ_μ L = - 2 E^μνξ_μξ_ν - G^μξ_μ (A^νξ_ν + Λ) + ξ_μ D_ρ Q^μρ . Evaluating this resulting expression at r=0, we get 2 v E_vv + G_v (v A_v + Λ) = (-Θ^r + Ξ^r + D_ρ Q^rρ)\|_r=0 . One should note that this Q^μν inherently has non-covariant pieces since it is derived from a non-covariant CS Lagrangian eq.(<ref>). To make further progress using boost weight analysis, we must work out Θ^r, Ξ^r and Q^rρ for the most general CS Lagrangian of the form eq.(<ref>). We will see that G_v (v A_v + Λ) ∼𝒪(ϵ^2) using eq.(<ref>). We don't want to set this at the level of eq.(<ref>) since, as we will see later, Ξ^r depends on Λ. Let us highlight that eq.(<ref>) represents the main equation that we work with to establish that the E_vv has the structure of eq.(<ref>) and thus proving a linearized second law for CS Lagrangians of the form eq.(<ref>). The crucial difference when compared to the analysis of <cit.> is the explicit appearance of the non-covariant Ξ^r in eq.(<ref>). We will see below in <ref> that this crucial piece is essential to arrive at an entropy current structure of eq.(<ref>). §.§ Tachikawa's proposal for black hole entropy and first law: Let us now recap the main statements in <cit.> concerning the first law for CS theories. Eq.(<ref>) describes the main change to the covariant phase space methods of <cit.>. Tachikawa <cit.> proposed a definition of the black hole entropy for CS theories based on this modification. His definition was to incorporate this Ξ^μ and define the Noether charge through eq.(<ref>). This results in a (d-2)-form 𝐐_ξ. The pullback of the (d-2)-form 𝐐_ξ to the bifurcation surface Σ of the black hole results in a generalization of the black hole entropy to CS theories. This is given by S_IWT = -2 π∫_Σ𝐐_ξ \|_ξ→ 0, D_αξ_β→κϵ_αβ . Here κ is the surface gravity of the horizon, and the ξ is the Killing vector that generates the horizon. By definition, this formula eq.(<ref>) is not covariant under diffeomorphism. This issue of non-covariance was studied in <cit.> and later significantly refined in <cit.>. In a special Kruskal-type coordinate system of the black hole, eq.(<ref>) can be expressed in terms of the Lagrangian <cit.>. For our gauge eq.(<ref>), we can get the following formula as [Here ϵ̃^α_ β is the binormal to the Bifurcation surface Σ and in our gauge Σ is given by ξ of eq.(<ref>) set to zero. Thus, the only non-trivial components are ϵ̃^r_ r = -1 and ϵ̃^v_ v = 1.] S_IWT = -4 π∫_Σ d^d-2x √(h) ϵ̃^α_ βLR^α_ β r v . In <cit.>, this formula was derived in a gauge which set Ξ^μ on the bifurcation surface Σ to zero. However, as pointed out in <cit.> [The derivation in <cit.> uses the anomaly polynomial. One must do appropriate manipulations to express it in terms of the CS Lagrangian .], one can derive eq.(<ref>) covariantly without resorting to set Ξ^μ to zero in special gauges. In fact, we will show that Ξ^r contributes to the Iyer-Wald-Tachikawa entropy and the full answer, including the contributions of Q^μν give eq.(<ref>). One can expand the binormal to obtain the final result as [It should be noted that the convention for the Lagrangian defined this way has an overall factor of 1/2π.] S_IWT = -2 ∫_Σ d^d-2x √(h) ( LR^v_ v r v - LR^r_ r r v) = ∫_Σ d^d-2x √(h) s_IWT . In explicit examples, we will show that 𝒥^v of eq.(<ref>) reduces to the integrand of eq.(<ref>) in the equilibrium limit. This is analogous to the diffeomorphism invariant case eq.(<ref>). § BRUTE-FORCE CALCULATION OF ENTROPY CURRENT FOR SPECIFIC CHERN-SIMONS THEORIES In this section, we will consider specific examples of CS theories, both purely gravitational and mixed gauge gravity ones, in various dimensions. We aim to obtain the expressions of the EoMs in all such theories and work them out in a brute-force way in the chosen coordinate system and gauge eq.(<ref>). In this process, we will distinguish possible terms according to their boost weights and figure out if they contribute to 𝒪(ϵ) or higher, leading to establishing eq.(<ref>) for linearized analysis and eq.(<ref>) for analysis to quadratic order. We will also obtain the components of entropy current (𝒥^v and 𝒥^i) for all such example theories. Before we proceed, let us list our conventions for the calculations that follow. * The signature for the metric is mostly plus (-++…+). * The lower case Greek indices: {α,β,…,μ,ν,…, α_1 , α_2 , …} are used for the full space-time coordinates denoted by x^μ. * The covariant derivative associated with the full space-time metric g_μν is denoted by D_μ. * The horizon is a co-dimension one surface ℋ located at r=0. The constant v slices are co-dimension two surfaces denoted by ℋ_v. * Lower case latin indices: {i,j,k,l,…, i_1,i_2,…} are used for the spatial coordinates x^i on ℋ_v. * The intrinsic metric on ℋ is h_ij and the covariant derivative associated with it is ∇_i. * The Levi-Civita tensor is denoted by ϵ^α_1 …α_k and it is related to the totally anti-symmetric Levi-Civita symbol ε^α_1 …α_k as ϵ^α_1 …α_k = - 1√(h)ε^α_1 …α_k . Since we focus on 2+1 and 4+1 examples, in our horizon adapted coordinates eq.(<ref>), the independent components of the Levi-Civita tensors are given by ϵ^vrx= -1√(h) , ϵ^vrxyz = - 1√(h) . * The required Christoffel symbols and curvature components in our gauge eq.(<ref>) are given in Appendix <ref>. §.§ Gravitational Chern-Simons theory in (2+1)-dimensions In (2+1)-dimensions, the action and Lagrangian for purely gravitational CS theory are given by I = ∫ d^3x √(-g) ℒ , with ℒ = ϵ^λ^μ^ν Γ^ρ_λ_σ(∂_μΓ^σ_ρ_ν + 2/3 Γ^σ_μ_τ Γ^τ_ρ_ν) . One can obtain the EoM from here as E^μ^ν = - (ϵ^ν^ρ^σ D_ρR_σ^μ + ϵ^μ^ρ^σ D_ρR_σ^ν) . Our chosen metric gauge and coordinate system in (2+1)-dimensions become ds^2 = 2 dv dr -r^2 X(r, v, x) dv^2 + 2 r ω(r, v, x) dv dx + h(r, v, x) dx^2 , The vv-component of E^μ^ν can be worked out as 2 E_v_v = 2 E^r^r = - 4ϵ^r^ρ^σ D_ρR_σ^r = 4 ϵ^r^σ^ρ(∂_ρR_σ_v - Γ^α_ρ_σR_α_v - Γ^α_ρ_vR_σ_α) = 4ϵ^r^v^x(∂_xR_v_v - ∂_vR_x_v) + ϵ^r^v^x(- ω/h∂^2_v h + ω/h^2(∂_v h )^2 + 1/h(∂_v h ) (∂_vω) ) . Thus, E_vv = ϵ^r^v^x(∂^2_vω + 1/h(∂_vω) (∂_v h ) - 1/h∂^3_v_v_x h + 1/h∂_v(1/h(∂_v h ) (∂_x h ) ) ) . Each term on the RHS above is in the form A ∂^2_v B, which we can write as A ∂^2_v B = ∂_v(A ∂_v B ) + 𝒪(ϵ^2 ). Thus, neglecting 𝒪(ϵ^2 ) terms we get E_v_v = ∂_v(ϵ^r^v^x∂_vω - 1/hϵ^r^v^x∂^2_v_x h + 1/h^2ϵ^r^v^x(∂_v h ) (∂_x h ) ) + 𝒪(ϵ^2 ) = ∂_v(ϵ^r^v^x∂_vω - ϵ^r^v^x∂_x(1/h∂_v h ) ) + 𝒪(ϵ^2 ) = ∂_v(1/√(h)∂_v(√(h)ϵ^r^v^xω) - 1/√(h)∂_x(√(h)ϵ^r^v^x1/h∂_v h ) ) + 𝒪(ϵ^2 ) , which indeed is of the form given in eq.(<ref>). Hence, the entropy current is 𝒥^v = ϵ^r^v^xω , 𝒥^i = - ϵ^r^v^x(1/h∂_v h ) , and from here, we also conclude that the linearized second law holds in this case. §.§ Non-linear analysis of Chern-Simons theory in (2+1)-dimensions as an EFT In this subsection, we aim to explore the second law beyond linear order in the ϵ-expansion for CS theory in (2+1)-dimensions with the Lagrangian given in eq.(<ref>). In this case, the Lagrangian, and hence, the EoMs, will have at most three derivatives. Therefore, the E_vv can have at most 𝒪(ϵ^2 ) terms. This is because E_vv has boost-weight 2, so any term in E_vv must have two ∂_v derivatives, while the third one has to be ∂_x. In that case, this term becomes 𝒪(ϵ^2 ) [One must note that a term in E_vv cannot have all three ∂_v derivatives, because that would make it a term with boost weight 3. So, there is no possibility of a 𝒪(ϵ^3 ) contribution in E_vv.]. Keeping track of possible 𝒪(ϵ^2 ) terms in E_vv, eq.(<ref>) can be written more exactly as follows E_v_v = ∂_v(ϵ^r^v^x∂_vω - ϵ^r^v^x∂_x(1/h∂_v h ) ) - 3/4ϵ^r^v^x∂_x(1/h^2(∂_v h )^2 ) + 3/2ϵ^r^v^x(∂_vω) (1/h∂_v h ) = ∂_v(1/√(h)∂_v(√(h)ϵ^r^v^xω) - 1/√(h)∂_x(√(h)ϵ^r^v^x1/h∂_v h ) ) - 3/41/√(h)∂_x(√(h)ϵ^r^v^x1/h^2(∂_v h )^2 ) + 3/2ϵ^r^v^x(∂_vω) (1/h∂_v h ) . Note that the nonlinear terms in E_vv are not of the form of a square plus a total derivative as explained in eq.(<ref>), which implies that the second law may be violated in the second order. Following our discussion in <ref>, we would now consider pure (2+1)-dimensional gravitational CS theory as an EFT. The leading curvature contribution to the gravitational sector of the action must be the Einstein-Hilbert action, and pure (2+1)-dimensional gravitational CS theory is a sub-leading correction term. If we include the Einstein-Hilbert action, we get the Lagrangian of the theory as [Note that the CS part of the Lagrangian is written differently compared to eq.(<ref>). However, one can use the properties of ϵ^λμν to show that they are identical.] ℒ = R + l ϵ^λ^μ^ν Γ^ρ_λ_σ(1/2R^σ_ρ_μ_ν - 1/3 Γ^σ_μ_τ Γ^τ_ρ_ν) . It should be noted that the CS part of the Lagrangian has three derivatives acting on g_μν. Therefore, on dimensional grounds, this sub-leading term must be multiplied by a dimensionful coupling constant l [This is also consistent with the following statement made in <ref> that in an EFT expansion a term with (k+2) number of derivatives in the Lagrangian should be accompanied by a coefficient l^k, see also <cit.>.]. The validity of EFT field theory relies on the approximation that l can be treated small compared to any other scale present in the system, i.e., L, associated with the dynamical configuration described by the metric in eq.(<ref>). Thus, we will use l ≪ L and choose units as L=1. To be more precise, we will be neglecting terms of 𝒪(l^2 ). This is justified since we have truncated the Lagrangian of the low energy effective theory only to 𝒪(l ) in eq.(<ref>). Consequently, we should be concerned with proving the second law to the same order in EFT expansion, i.e., to 𝒪(l ), up to 𝒪(l^2 ) corrections. Obviously, we need to keep 𝒪(ϵ^2 ) terms as in eq.(<ref>) but we can ignore 𝒪(ϵ^2 l^2) terms. Our next job would be to look into the equations of motion that follow from eq.(<ref>), E^μ^ν = 1/2 R g^μ^ν - R^μ^ν - l (ϵ^ν^ρ^σ D_ρR^μ_σ + ϵ^μ^ρ^σ D_ρR^ν_σ) . From this, we can compute E_v_v at the horizon E_v_v = - R_v_v + l ϵ^r^v^x(∂^2_vω + 1/h(∂_vω) (∂_v h ) - 1/h∂^3_v_v_x h + 1/h∂_v(1/h(∂_v h ) (∂_x h ) ) ) . Keeping in mind that 𝒪(l^2 ) pieces can be ignored but 𝒪(ϵ^2 ) pieces should be retained, we can manipulate it further to obtain E_v_v = - R_v_v + l ϵ^r^v^x(∂^2_vω + 1/h(∂_vω) (∂_v h ) - 1/h∂^3_v_v_x h + 1/h∂_v(1/h(∂_v h ) (∂_x h ) ) ) = ∂_v(1/2h^i^j∂_vh_i_j + l ϵ^r^v^x∂_vω - l ϵ^r^v^x∂_x(1/h∂_v h ) ) + 1/4(1/h∂_v h )^2 - 3/4 l ϵ^r^v^x∂_x(1/h^2(∂_v h )^2 ) + 3/2 l ϵ^r^v^x(∂_vω) (1/h∂_v h ) = ∂_v(1/2h^i^j∂_vh_i_j + l ϵ^r^v^x∂_vω - l ϵ^r^v^x∂_x(1/h∂_v h ) ) - 3/4 l ϵ^r^v^x∂_x(1/h^2(∂_v h )^2 ) + (1/2h∂_v h + 3/2 l ϵ^r^v^x∂_vω)^2 - l^2 (9/4ϵ^r^v^x∂_vω)^2 = ∂_v(1/2h^i^j∂_vh_i_j + l ϵ^r^v^x∂_vω - l ϵ^r^v^x∂_x(1/h∂_v h ) ) - 3/4 l ϵ^r^v^x∂_x(1/h^2(∂_v h )^2 ) + (1/2h∂_v h + 3/2 l ϵ^r^v^x∂_vω)^2 + 𝒪(l^2 ) . It should be clear from the final expression above in eq.(<ref>) that we have indeed succeeded in casting the E_vv as eq.(<ref>). We obtain the entropy current 𝒥^v = 1+ l ϵ^r^v^x ω , 𝒥^i = - l ϵ^r^v^x (1/h∂_v h ) , and also identify the following (K_ij + X_ij) ∼(1/2h∂_v h + 3/2 l ϵ^r^v^x∂_vω) , ∇_i 𝒴^i ∼ - 3/4 l 1√(h)∂_x( √(h) ϵ^r^v^x1/h^2(∂_v h )^2 ) . Another thing worth highlighting is that the whole square term on the RHS of eq.(<ref>) has appeared with a positive sign, which is crucial for demonstrating the second law. The entropy current piece is of 𝒪(ϵ), which is also expected from the linearized analysis. The sign of the ∇_i 𝒴^i term is unimportant as this will not contribute to the entropy production - this term will drop out when integrated over a compact ℋ_v. From here, we can follow the same steps that were worked out in <ref> to derive eq.(<ref>) starting from eq.(<ref>) to obtain ∂_v S_tot≥ 0, where S_tot is the total integrated entropy for the compact horizon slice. Thus, finally, we see that the second law holds up to quadratic orders in the dynamical fluctuations for CS theories in (2+1)-dimensions in the low energy effective field theory sense ignoring 𝒪(l^2 ) contributions. §.§ Mixed gauge gravity Chern-Simons theories in (4+1)-dimensions In (4+1)-dimensions, the mixed gauge gravity CS theory has the following Lagrangian I = ∫ d^5x √(-g) ℒ , with ℒ = 2 ϵ^μ^ν^λ^ρ^σF_μ_νΓ^α_λ_β(1/2R^β_α_ρ_σ - 1/3Γ^β_ρ_τΓ^τ_α_σ) , where we can see that ℒ explicitly depends on non-tensorial Christoffel symbols Γ^β_ρ_τ, but depends on gauge invariant field strength tensor F_μ_ν. Alternatively, an equivalent Lagrangian, say ℒ̃, can be written down that differs from ℒ up to the addition of a total derivative piece. One can get ℒ̃ = ϵ^μ^ν^ρ^σ^δA_μR^α_β_ν_ρR^β_α_σ_δ , such that ℒ = ℒ̃ + D_μB^μ , where B^μ = 4 ϵ^μ^ν^λ^ρ^σA_νΓ^α_λ_β(1/2R^β_α_ρ_σ - 1/3Γ^β_ρ_τΓ^τ_α_σ) . Both ℒ and ℒ̃ will lead to the same EoM E^μ^ν = ϵ^μ^β^ρ^σ^δ D_α(R^ν^α_β_ρF_σ_δ) + ϵ^ν^β^ρ^σ^δ D_α(R^μ^α_β_ρF_σ_δ) . The near-horizon metric for the dynamical black hole is given by eq.(<ref>) where the co-dimension 2 horizon slice is now spanned by 3 coordinates x^i for i=1,2,3. For this example, we aim to study the second law at the linearized level. At the horizon, E_vv becomes E_v_v = E^r^r = 2 ϵ^r^β^ρ^σ^δ D_α(R^r^α_β_ρF_σ_δ) = 2 ϵ^r^β^ρ^σ^δ(F_σ_δ(D_ρR_v_β - D_βR_v_ρ) + R_v^α_β_ρ D_αF_σ_δ) = 2 ϵ^r^β^ρ^σ^δ(2 F_σ_δ(∂_ρR_v_β - Γ^λ_ρ_vR_β_λ) + R_v^α_β_ρ(∂_αF_σ_δ - 2 Γ^λ_α_σF_λ_δ) ) . Let us evaluate each term one by one. We have ϵ^r^β^ρ^σ^δR_v^α_β_ρΓ^λ_α_σF_λ_δ = 2 ϵ^r^v^i^j^kR_v_n_v_ih^m^nΓ^l_m_jF_l_k + 𝒪(ϵ^2 ) = ϵ^r^v^i^j^kh^m^nΓ̂^l_m_jF_k_l∂^2_vh_n_i + 𝒪(ϵ^2 ) ϵ^r^β^ρ^σ^δR_v^α_β_ρ∂_αF_σ_δ = 2 ϵ^r^v^i^j^k(R_v_n_v_ih^m^n∂_mF_j_k + R_v_r_j_k∂_vF_v_i) + 𝒪(ϵ^2 ) = ϵ^r^v^i^j^k[- h^m^n(∂_mF_j_k) (∂^2_vh_n_i) + 2 (∂_jω_k) (∂_vF_v_i) ] + 𝒪(ϵ^2 ) ϵ^r^β^ρ^σ^δF_σ_δΓ^λ_ρ_vR_β_λ = ϵ^r^v^i^j^kF_j_kΓ^v_i_vR_v_v + 𝒪(ϵ^2 ) = 1/4ϵ^r^v^i^j^kF_j_kω_ih^m^n∂^2_vh_m_n + 𝒪(ϵ^2 ) ϵ^r^β^ρ^σ^δF_σ_δ∂_ρR_v_β = ϵ^r^v^i^j^kF_j_k(∂_iR_v_v - ∂_vR_v_i) + 𝒪(ϵ^2 ) = 1/4ϵ^r^v^i^j^kF_j_k(2 ∂^2_vω_i + ω_ih^m^n∂^2_vh_m_n) - 1/2ϵ^r^v^i^j^kF_j_kh^n^m(∂^3_m_v_vh_n_i - Γ̂^l_m_n∂^2_vh_i_l - Γ̂^l_m_i∂^2_vh_n_l) + 𝒪(ϵ^2 ) . Thus, substituting eq.(<ref>) in eq.(<ref>) we have the following expression for E_vv, up to 𝒪(ϵ^2) corrections, E_v_v = 2 ϵ^r^v^i^j^k[2 (∂_jω_k) (∂_vF_v_i) - h^m^n∂_m(F_j_k∂^2_vh_n_i) - 2 h^m^nΓ̂^l_m_jF_k_l∂^2_vh_n_i] + 2 ϵ^r^v^i^j^kF_j_k[∂^2_vω_i + h^n^m(Γ̂^l_m_n∂^2_vh_i_l + Γ̂^l_m_i∂^2_vh_n_l) ] + 𝒪(ϵ^2 ) = 2 ∂_v[2 ϵ^r^v^i^j^k(∂_jω_k) F_v_i - ϵ^r^v^i^j^kh^m^n∂_m(F_j_k∂_vh_n_i) - 2 ϵ^r^v^i^j^kh^m^nΓ̂^l_m_jF_k_l∂_vh_n_i] + 2 ∂_v[ϵ^r^v^i^j^kF_j_k∂_vω_i + ϵ^r^v^i^j^kF_j_kh^n^m(Γ̂^l_m_n∂_vh_i_l + Γ̂^l_m_i∂_vh_n_l) ] + 𝒪(ϵ^2 ) . To bring the ω-dependent terms into the entropy current structure, we do some further manipulations involving Bianchi identities, as follows ϵ^r^v^i^j^kF_j_k∂_vω_i = ϵ^r^v^i^j^k∂_v(F_j_kω_i) - ϵ^r^v^i^j^kω_i∂_vF_j_k = ϵ^r^v^i^j^k∂_v(F_j_kω_i) + ϵ^r^v^i^j^kω_i(∂_jF_k_v + ∂_kF_v_j) = ϵ^r^v^i^j^k[∂_v(F_j_kω_i) + 2 ∂_i(ω_jF_v_k) - 2 F_v_i∂_jω_k] . Additionally, we can rewrite the F_k_l term as ϵ^r^v^i^j^kΓ̂^l_m_jF_k_l∂_vh_n_i = (ϵ^r^v^a^j^kδ^i_l + ϵ^r^v^i^a^kδ^j_l + ϵ^r^v^i^j^aδ^k_l) Γ̂^l_m_jF_k_a∂_vh_n_i = ϵ^r^v^i^j^k(Γ̂^l_m_jF_k_i∂_vh_n_l + Γ̂^l_m_lF_k_j∂_vh_n_i + Γ̂^l_m_jF_l_k∂_vh_n_i) , hence, 2 ϵ^r^v^i^j^kΓ̂^l_m_jF_k_l∂_vh_n_i = ϵ^r^v^i^j^kF_j_k(Γ̂^l_m_i∂_vh_n_l - Γ̂^l_m_l∂_vh_n_i) . Thus, substituting eq.(<ref>) and eq.(<ref>) in eq.(<ref>) we get E_v_v = 2 ∂_v[ϵ^r^v^i^j^k∂_v(F_j_kω_i) + 2 ϵ^r^v^i^j^k∂_i(ω_jF_v_k) - ϵ^r^v^i^j^kh^m^n∂_m(F_j_k∂_vh_n_i) ] + 2 ∂_v[ϵ^r^v^i^j^kF_j_k(h^l^mΓ̂^n_m_l + h^n^mΓ̂^l_m_l) (∂_vh_i_n) ] + 𝒪(ϵ^2 ) . Let us evaluate the term in the second line further h^l^mΓ̂^n_m_l + h^n^mΓ̂^l_m_l = 1/2h^l^mh^n^o(∂_mh_o_l + ∂_lh_o_m - ∂_oh_m_l) + 1/2h^n^mh^l^o∂_mh_o_l = h^l^mh^n^o∂_mh_o_l = - ∂_mh^n^m . Finally, we get for E_v_v E_v_v = 2 ∂_v[ϵ^r^v^i^j^k∂_v(F_j_kω_i) + 2 ϵ^r^v^i^j^k∂_i(ω_jF_v_k) - ϵ^r^v^i^j^k∂_m(h^n^mF_j_k∂_vh_n_i) ] + 𝒪(ϵ^2 ) = 2 ∂_v[1/√(h)∂_v(√(h)ϵ^r^v^i^j^kF_j_kω_i) + ∇_i(2 ϵ^r^v^i^j^kω_jF_v_k - ϵ^r^v^m^j^kh^n^iF_j_k∂_vh_n_m) ] + 𝒪(ϵ^2 ) . Thus, it is obvious that the RHS of eq.(<ref>) has been cast in the form of eq.(<ref>). Also, we can obtain the following components of the entropy current [The expression of 𝒥^v in eq.(<ref>) for (4+1)-dimensional CS theory is schematically of the form 𝒥^v ∼ω∧ dA. A similar prediction was made in <cit.> (see the remark after Proposition 1) regarding a possible term in 𝒥^v in (4+1)-dimensions.] 𝒥^v = 2 ϵ^r^v^i^j^kF_j_kω_i , 𝒥^i = 4 ϵ^r^v^i^j^kω_jF_v_k - 2 ϵ^r^v^m^j^kh^n^iF_j_k∂_vh_n_m . Thus the linearized second law for (4+1)-dimensional CS theory is also established. § REPARAMETRIZATION COVARIANCE OF ENTROPY PRODUCTION In this section, we will examine the covariance of entropy production under reparametrization of the horizon slicing for the specific examples of CS theories studied in the previous section. In <ref>, we look at gravitational CS theory in (2+1)-dimensions as a low energy EFT with the Lagrangian given in eq.(<ref>). For this case, in <ref>, we have proved the second law to quadratic order in dynamical perturbations within the EFT approximations. Next, in <ref>, we will turn our attention to mixed gauge gravity CS theory in (4+1)-dimensions, for which in <ref> we have proved the second law, but only to the linear order of dynamical fluctuations. At linearized order, instead of entropy production, we can, at the most, check that no entropy is destroyed. However, since for (2+1)-dimensions, we are working to the non-linear order in perturbations, we will be checking the reparametrization covariance of actual entropy production. As described in <ref>, the reparametrization of horizon slicing is implemented by coordinate transformations, eq.(<ref>), which keep our choice of gauge for the near horizon metric eq.(<ref>) the same. We rewrite the coordinate change for going from v, r, x^i to τ, ρ, y^i here again for convenience v = e^ζ(y⃗)τ + 𝒪 (ρ) , r = e^-ζ(y⃗)ρ + 𝒪 (ρ^2) , x^a = y^a + 𝒪 (ρ) . We have also explained that the information of entropy production is seeded in the off-shell structure of E_vv written in terms of the divergence of the entropy current, i.e., in eq.(<ref>). We will check that both sides of eq.(<ref>) transform identically under eq.(<ref>). §.§ Gravitational Chern-Simons theory in (2+1)-dimensions as EFT to 𝒪(ϵ^2) In <ref>, we have obtained the following expressions from our brute-force analysis; see eq.(<ref>) and eq.(<ref>), E_vv \|_r=0 = ∂_v [ 1/√(h)∂_v ( √(h) 𝒥^v) + ∇_i 𝒥^i] - 3/4 l ϵ^r^v^x∂_x(1/h^2(∂_v h )^2 )+ (1/2h∂_v h + 3/2 l ϵ^r^v^x∂_vω)^2 + 𝒪(l^2 ) , with 𝒥^v = 1+ l ϵ^r^v^x ω , 𝒥^i = - l ϵ^r^v^x(1/h∂_v h ) . The transformation of E_vv in the LHS of eq.(<ref>) can be obtained straightforwardly as follows E_vv = (∂τ/∂ v)^2 E_ττ , implying E_vv = e^-2 ζ E_ττ . Next, for the RHS of eq.(<ref>), individually, each of the terms will transform non-trivially, but they must combine together to make the transformation of the full RHS of eq.(<ref>) consistent with eq.(<ref>). Before further investigating that, we need to set up the rules with which various ingredients transform under eq.(<ref>). Let us note the transformation rule for various metric coefficients under eq.(<ref>), ds^2 = 2 dτ dρ -ρ^2 X(ρ, τ, y) dτ^2 + 2 ρ ω(ρ, τ, y) dτ dy + h(ρ, τ, y) dy^2 , where the required transformation rules are that of ω and h given in eq.(<ref>) ω = ω + 2 (∂_y ζ) - τ (∂_y ζ) 1/h∂_τh + 𝒪(ρ) , h = h + 𝒪(ρ) . Here we follow a convention that the quantities with a tilde are evaluated in the transformed coordinates. From here, we also note down how the derivatives transform, ∂_v = e^-ζ∂_τ + 𝒪(ρ) , ∂_x = ∂_y - τ (∂_y ζ) ∂_τ + 𝒪(ρ) . With the knowledge of eq.(<ref>) and eq.(<ref>), we first derive the following result: Let us assume B is a quantity in terms of (v, r, x) coordinates, and B be the same quantity transformed to (τ, ρ, y) coordinates such that B transform as B = e^- ϕ(y)B̃ . Then, we may show how ∂_x B would transform ∂_x B = ∂_y(e^- ϕB̃) - τζy∂_τ(e^- ϕB̃) = e^- ϕ(∂_yB̃ - ∂_τ(τζyB̃) - (ϕ - ζ)yB̃) . Using eq.(<ref>), we can derive the following relations ∂_x(1/h∂_v h ) = e^- ζ[∂_y(1/h̃∂_τh̃) - ∂_τ(τζy1/h̃∂_τh̃) ] , ∂_x(1/h^2(∂_v h )^2 ) = e^- 2 ζ[∂_y(1/h̃^2(∂_τh̃)^2 ) - ∂_τ(τζy1/h̃^2(∂_τh̃)^2 ) - ζy^i1/h̃^2(∂_τh̃)^2 ] . Let us now return to the RHS of eq.(<ref>), and first, we focus on the 𝒪 (ϵ) pieces involving 𝒥^v and 𝒥^i. Using eq.(<ref>), eq.(<ref>), eq.(<ref>) we get for 𝒥^v in eq.(<ref>) 𝒥^v = 1+ l ϵ^r^v^x ω = 1+ l ϵ^ρ^τ^y (ω + 2 (∂_y ζ) - τ (∂_y ζ) 1/h∂_τh) , and similarly, for 𝒥^i in eq.(<ref>) we get 𝒥^i = - l ϵ^r^v^x(1/h∂_v h ) = - e^-ζ l ϵ^ρ^τ^y (1/h∂_τh) . Using eq.(<ref>) and eq.(<ref>) we can immediately check that ∂_v [ 1/√(h)∂_v ( √(h) 𝒥^v) + ∇_i 𝒥^i] = ∂_v(1/2∂_v h/h +l ϵ^r^v^x∂_vω - l ϵ^r^v^x∂_x(∂_v h/h) ) = e^- 2 ζ∂_τ[1/2∂_τh/h +l ϵ^ρ^τ^y{∂_τ(ω̃ + 2 ζy - τζy∂_τh/h) - ∂_y(∂_τh/h) + ∂_τ(τζy∂_τh/h) }] = e^- 2 ζ∂_τ(1/2∂_τh/h +l ϵ^ρ^τ^y∂_τω̃ -l ϵ^ρ^τ^y∂_y(1/h̃∂_τh̃) ) . From eq.(<ref>), what we essentially get is the following ∂_v [ 1/√(h)∂_v ( √(h) 𝒥^v) + ∇_i 𝒥^i] = e^- 2 ζ ∂_τ[ 1/√(h)∂_τ( √(h) 𝒥^τ) + ∇_i 𝒥^i] , such that 𝒥^τ = 1+ l ϵ^ρ^τ^y ( ω + 2 ζy) , 𝒥^i = - l ϵ^ρ^τ^y(∂_vh/h) , are the components of the entropy current in the transformed coordinates. We can clearly see that eq.(<ref>) is consistent with eq.(<ref>). Therefore, we also learn that the 𝒪(ϵ) terms on the RHS of eq.(<ref>) reparameterize among themselves to give the reparameterized currents. While 𝒥^i has the same functional form in any parametrization, the form of the 𝒥^v differs by 𝒥^τ_ex = 2 l ϵ^ρτ yζy . We will also see a similar issue for the (4+1)-dimensional mixed CS theory. This presents a serious issue because 𝒥^v represents the Iyer-Wald-Tachikawa entropy of eq.(<ref>). However, one can show that the additional term in the transformation of 𝒥^v in eq.(<ref>) will not contribute to the full entropy as ∫ dy √(h) 𝒥^τ_ex = ∫ dy 2l ε^ρτ yζy = 0 . In the final step, we have used the property of compact horizons (in this case, S^1). An analysis analogous to the above for the (4+1)-dimensional case is given below eq.(<ref>). Next, we focus on the quadratic terms, i.e., terms in the second line on the RHS of eq.(<ref>), and ignore the 𝒪(l^2 ) terms - 3/4 l ϵ^r^v^x∂_x(1/h^2(∂_v h )^2 )+ (1/2h∂_v h + 3/2 l ϵ^r^v^x∂_vω)^2 + 𝒪(l^2 ) = 1/4(1/h∂_v h )^2 - 3/4 l ϵ^r^v^x∂_x(1/h^2(∂_v h )^2 ) + 3/2 l ϵ^r^v^x(∂_vω) (1/h∂_v h )+ 𝒪(l^2 ) . Following a similar approach to the 𝒪(ϵ) terms, we study the RHS of eq.(<ref>). The first term is easy to handle, as it transforms as 1/4(1/h∂_v h )^2 =e^- 2 ζ1/4(1/h̃^2(∂̃_τh̃)^2 ) . For the last two terms on the RHS of eq.(<ref>), we get ϵ^r^v^x(∂_vω) (1/h∂_v h ) - 1/2ϵ^r^v^x∂_x(1/h^2(∂_v h )^2 ) = e^- 2 ζϵ^ρ^τ^y[∂̃_τ(ω̃ + 2 ζy - τζy1/h̃∂̃_τh̃) (1/h̃∂̃_τh̃) ] - 1/2 e^- 2 ζϵ^ρ^τ^y[∂̃_y(1/h̃^2(∂̃_τh̃)^2 ) - ∂̃_τ(τζy1/h̃^2(∂̃_τh̃)^2 ) - ζy^i1/h̃^2(∂̃_τh̃)^2 ] = e^- 2 ζϵ^ρ^τ^y[(∂̃_τω̃) (1/h̃∂̃_τh̃) - 1/2∂̃_y(1/h̃^2(∂̃_τh̃)^2 ) ] . Therefore, combining eq.(<ref>) and eq.(<ref>) together, we see that even the 𝒪(ϵ^2 ) terms get reparameterized in the desired covariant way, but up to 𝒪(l^2 ) corrections, consistent with the EFT expansion - 3/4 l ϵ^r^v^x∂_x(1/h^2(∂_v h )^2 )+ (1/2h∂_v h + 3/2 l ϵ^r^v^x∂_vω)^2 = e^- 2 ζ[-3/4 l ϵ^ρ^τ^y∂_y(1/h^2(∂_τh)^2 )+ (1/2h∂_τh + 3/2 l ϵ^ρ^τ^y∂_τω)^2 ] + 𝒪(l^2 ) . Therefore, we see that the RHS of eq.(<ref>) indeed transforms covariantly to be consistent with eq.(<ref>). Hence, we prove that for CS theory in (2+1)-dimensions as low energy EFT, the second law holds under reparameterizations of horizon slicing up to quadratic orders in the dynamical fluctuations. §.§ Mixed gauge gravity Chern-Simons theory in (4+1)-dimensions to 𝒪(ϵ) In this sub-section, we study the reparametrization covariance of the (4+1)-dimensional mixed Chern-Simons theory given by eq.(<ref>). The analysis is similar to <ref>. We want to study how the 𝒥^v and 𝒥^i of eq.(<ref>) transform under eq.(<ref>). Since, for this example, our brute-force analysis in <ref> to derive eq.(<ref>) involved only 𝒪(ϵ) terms, we should focus on how the RHS of eq.(<ref>) transforms. For this, the transformation rule for 𝒥^v and 𝒥^i is sufficient. Firstly, we would like to have a result similar to eq.(<ref>), but a higher dimensional generalization of that. If we have a term C which transforms under reparameterization as C = e^- ϕC̃, then we have ∂_i C = ∂̃_i(e^- ϕC̃) - τζy^i∂̃_τ(e^- ϕC̃) = e^- ϕ[∂̃_iC̃ - ∂̃_τ(τζy^iC̃) - (ϕ - ζ)y^iC̃] . We can now see how the RHS of E_vv in eq.(<ref>) transforms. This should be given by eq.(<ref>). Using eq.(<ref>), we get the following relations ∂_i (ω_jF_v_k) = e^- ζ∂̃_i(ω_jF̃_τ_k) - e^- ζ∂̃_τ(ζy^iτω_jF̃_τ_k) = e^- ζ∂̃_i((ω̃_j + 2 ζy^j) F̃_τ_k) - e^- ζ∂̃_τ(τζy^i(ω̃_j + 2 ζy^j) F̃_τ_k) + 𝒪(ϵ^2 ) ∂_m (h^n^mF_j_k∂_vh_n_i) = e^- ζ∂̃_m(h̃^n^mF_j_k∂_τh̃_n_i) - e^- ζ∂̃_τ(τζy^mh̃^n^mF_j_k∂_τh̃_n_i) = e^- ζ∂̃_m(h̃^n^mF̃_j_k∂_τh̃_n_i) - e^- ζ∂̃_τ(τζy^mh̃^n^mF̃_j_k∂_τh̃_n_i) + 𝒪(ϵ^2 ) . We also have, ∂_v(F_j_kω_i)= e^- ζ∂̃_τ[(τζy^kF̃_τ_j - τζy^jF̃_τ_k + F̃_j_k) (ω̃_i + 2 ζy^i - τh̃^m^nζy^n∂_τh̃_i_m) ] = e^- ζ∂̃_τ[(τζy^kF̃_τ_j - τζy^jF̃_τ_k + F̃_j_k) (ω̃_i + 2 ζy^i) - τh̃^m^nF̃_j_kζy^n∂_τh̃_i_m] + 𝒪(ϵ^2 ) . Combining eq.(<ref>) and eq.(<ref>), we get ϵ^r^v^i^j^k∂_v(F_j_kω_i) + 2 ϵ^r^v^i^j^k∂_i(ω_jF_v_k) - ϵ^r^v^i^j^k∂_m(h^n^mF_j_k∂_vh_n_i) = e^- ζϵ̃^ρ^τ^i^j^k∂̃_τ[(τζy^iF̃_τ_k - τζy^kF̃_τ_i + F̃_k_i) (ω̃_j + 2 ζy^j) ] - e^- ζϵ̃^ρ^τ^i^j^k∂̃_τ[τζy^mh̃^m^nF̃_j_k∂_τh̃_i_n] + 2 e^- ζϵ̃^ρ^τ^i^j^k∂̃_i((ω̃_j + 2 ζy^j) F̃_τ_k) - 2 e^- ζϵ̃^ρ^τ^i^j^k∂̃_τ(τζy^i(ω̃_j + 2 ζy^j) F̃_τ_k) - e^- ζϵ̃^ρ^τ^i^j^k∂̃_m(h̃^n^mF̃_j_k∂_τh̃_n_i) + e^- ζϵ̃^ρ^τ^i^j^k∂̃_τ(τζy^mh̃^n^mF̃_j_k∂_τh̃_n_i) + 𝒪(ϵ^2 ) = e^- ζϵ̃^ρ^τ^i^j^k(∂̃_τ[F̃_k_i(ω̃_j + 2 ζy^j) ] + 2 ∂̃_i[(ω̃_j + 2 ζy^j) F̃_τ_k] - ∂̃_m[h̃^n^mF̃_j_k∂_τh̃_n_i] ) + 𝒪(ϵ^2 ) . Thus, the E_vv of eq.(<ref>) transforms as E_v_v = 2 ∂_v[ϵ^r^v^i^j^k∂_v(F_j_kω_i) + 2 ϵ^r^v^i^j^k∂_i(ω_jF_v_k) - ϵ^r^v^i^j^k∂_m(h^n^mF_j_k∂_vh_n_i) ] + 𝒪(ϵ^2 ) = 2 e^- 2 ζ∂̃_τ(ϵ̃^ρ^τ^i^j^k∂̃_τ[F̃_j_k(ω̃_i + 2 ζy^i) ] + 2 ϵ̃^ρ^τ^i^j^k∂̃_i[(ω̃_j + 2 ζy^j) F̃_τ_k] ) - 2 e^- 2 ζ∂̃_τ(ϵ̃^ρ^τ^i^j^k∂̃_m[h̃^n^mF̃_j_k∂_τh̃_n_i] ) + 𝒪(ϵ^2 ) . From eq.(<ref>), consistency of eq.(<ref>) is confirmed, E_v_v = e^- 2 ζE_τ_τ. Consequently, in the transformed coordinates, we still get the off-shell structure of E_ττ as in eq.(<ref>), but now in terms of the transformed 𝒥^τ and 𝒥^i E_ττ \|_ρ=0 = ∂_τ[ 1/√(h)∂_τ( √(h) 𝒥^τ) + ∇_i 𝒥^i] + 𝒪(ϵ^2) , and we can readily obtain the transformed entropy current components in the new coordinate system as 𝒥^τ = 2 ϵ̃^ρ^τ^i^j^kF̃_j_k(ω̃_i + 2 ζy^i) , 𝒥^i = 4 ϵ̃^ρ^τ^i^j^k(ω̃_j + 2 ζy^j) F̃_τ_k - 2 ϵ̃^ρ^τ^m^j^kh̃^n^iF̃_j_k∂_τh̃_n_m . The expressions of 𝒥^τ and 𝒥^i written in eq.(<ref>) exemplifies an important aspect of the entropy current construction in general which we would like to highlight. If we compare eq.(<ref>) with eq.(<ref>), we see that there are additional terms in eq.(<ref>) which we denote by 𝒥^τ_ex = 4ϵ̃^ρ^τ^i^j^kF̃_j_kζy^i , 𝒥^i_ex = 8 ϵ̃^ρ^τ^i^j^kζy^jF̃_τ_k . This additional term in 𝒥^τ is similar to the additional term in the (2+1)-case eq.(<ref>). One can similarly show that [Here ε̃^ρ^τ^i^j^k denotes the (4+1)-dimensional Levi Civita symbol.] ∂_τ(√(h)𝒥^τ_ex) = 4 ε̃^ρ^τ^i^j^k∂_τ F_jkζy^i = 4 ε̃^ρ^τ^i^j^k∂_[τ F_jk]ζy^i =0 , ∂_i (√(h)𝒥^i_ex) = 8 ε̃^ρ^τ^i^j^k∂_[iF_τ k]ζy^j + 8 ε̃^ρ^τ^i^j^kF̃_τ_kζy^[iy^j] = 0 , and hence 1/√(h)∂_τ( √(h) 𝒥^τ_ex) + ∇_i 𝒥^i_ex = 0 . This means that the extra terms of eq.(<ref>) (and that of eq.(<ref>)) drop out from the E_vv combination in eq.(<ref>) (in eq.(<ref>)). In other words, although in entropy current components there are these additional contributions, they do not contribute to the off-shell structure of E_ττ, in the RHS of eq.(<ref>). Thus, these additional terms of eq.(<ref>) should be thought of as ambiguities that contribute to the components of the entropy current but do not contribute to E_vv. These ambiguities have appeared before, e.g., in <cit.> in the context of (3+1)-dimensional Gauss-Bonnet gravity [In (3+1)-dimensions the Gauss-Bonnet term does not contribute to the EoMs, but the local entropy current receives contributions from them. See the recent work <cit.> where this has been looked at carefully.]. In that context, they existed irrespective of what horizon slicing we used. However, here for our example in (4+1)-dimensional CS theory, we find an instance where we started with a coordinate system without these ambiguities. Still, they are generated due to a change of horizon slicing [Note that for a particular type of coordinate reparametrization with constant ζ, both 𝒥^τ_ex and 𝒥^i_ex vanishes.]. It is also important to note that the 𝒥^τ_ex obtained in eq.(<ref>) is boost-invariant and it survives in the equilibrium limit, implying that it should get captured in the equilibrium definition of entropy eq.(<ref>). As the entropy of the black holes defined through the Iyer-Wald-Tachikawa Noether charge eq.(<ref>) is non-covariant, we expect such non-covariant pieces under a coordinate transformation. However, one can see that this extra term doesn't contribute to the total entropy eq.(<ref>). This is because ∫ d^3 y √(h̃) J^τ_ex = ∫ d^3y 4 ε^ρτ i j kF_jk∂_i ζ = ∫ d^3 y [ 4 ∂_i ( ε^ρτ i j kF_jkζ) + 4 ε^ρτ i j k∂_i F_jkζ] = ∫ d^3y √(h)∇_i [ 4 ϵ^ρτ i j kF_jkζ] = 0 , where to get to the final step, we used ∂_[iF_jk] = 0 and we integrated the remaining total derivative term on the assumption of compact horizons [It should be noted that recently, in <cit.>, the transformation of the entropy current components was studied under coordinate reparameterization. They focus only on diffeomorphism invariant theories of gravity. The final conclusion of our result for the (2+1)-dimensional pure gravity CS theory and the 4+1-dimensional mixed CS theory is nevertheless consistent with their transformation of 𝒥^v on v=τ=0: 𝒥^τ = 𝒥^v + ∇_i B^i. Thus, eq.(<ref>) and eq.(<ref>) are clear cases that demonstrate Proposition 4.1 of <cit.> for particular CS theories. It would be interesting to see if we can generalize Proposition 4.1 for generic CS theories.]. This is what one should expect physically as well. The total entropy of the stationary black hole should be independent of the choice of coordinates. § PROOF OF CONSTRUCTING ENTROPY CURRENT IN GENERIC CHERN-SIMONS THEORIES We will now use all the ingredients of <ref> and <ref> to construct an entropy current for dynamical black holes in arbitrary CS theories of gravity of the form given by Lagrangian eq.(<ref>). We will follow the strategy outlined in <cit.>. Our starting point would be the main equation eq.(<ref>): 2 v E_vv + G_v (v A_v + Λ) = (-Θ^r + Ξ^r + D_ρ Q^rρ)\|_r=0 . We will now use the boost weight analysis to establish that Θ^r, Ξ^r and Q^rρ take a particular form that will allow for an entropy current structure of eq.(<ref>) for E_vv. We will first briefly review the proof of the existence of entropy current for diffeomorphism and U(1) invariant theories of gravity. We will then impose constraints that restrict the form of the Lagrangian for Chern-Simons theories of gravity. Once we have the Lagrangian, we work out all the associated structures. Finally, we evaluate the structures in our gauge to establish the existence of entropy current for arbitrary Chern-Simons theories of gravity. We first quickly recap the idea behind the proof of the existence of an entropy current for diffeomorphism invariant theories of gravity <cit.>. Since we have chosen a particular horizon adapted coordinates in eq.(<ref>), the stationary configuration has a particular Killing vector given by eq.(<ref>). This ultimately results in a factor of v multiplying E_vv in eq.(<ref>). If we consider the presence of gauge fields as in <cit.> and the Lagrangian is gauge invariant, then the boost weight analysis together with eq.(<ref>) would imply that G_v (v A_v + Λ) ∼𝒪(ϵ^2). Thus, the main task of proving the entropy current structure of eq.(<ref>) from eq.(<ref>) (with Ξ^r set to zero since we are reviewing diffeomorphism invariant theories) would require us to track down the explicit factors of v from the RHS of eq.(<ref>). These factors of v arise from Θ^r and Q^rρ. From the general analysis of the construction of Noether charge for arbitrary diffeomorphism invariant theories of gravity <cit.>, it is known that Θ^μ and Q^μν are linear in ξ. The off-shell structure of E_vv is built out of the metric functions of eq.(<ref>) (X,ω_i,h_ij), and various derivatives (∂_v,∂_r,∇_i) acting on them. We must also include gauge invariant U(1) field strength tensor components F_vr, F_vi, F_ri and F_ij if we consider gauge invariant Lagrangians. These functions only have implicit dependence on v; thus, any explicit dependence on v should come solely from ξ. This implies, on the horizon r=0, Θ^r and Q^rρ have the following structure [In Q^ri, we have chosen to represent the boost weight +2 quantity as ∂_v J̃^i_(1). We can always do this up to 𝒪(ϵ^2) terms.] Θ^r \|_r=0 = Θ_(1) + v Θ_(2) , Q^rv\|_r=0 = Q_(0) + v Q_(1) , Q^ri\|_r=0 = J^i_(1) + v ∂_v J̃^i_(1) . The subscripts in the RHS denote the boost-weight defined by eq.(<ref>) of the various quantities. One can show that these quantities evaluated on the horizon are given by (see Appendix <ref> for the details of this review) Θ^r \|_r=0 = (1+ v ∂_v) 𝒜_(1) + v ∂^2_v ℬ_(0) . Here ℬ_(0) denotes the JKM ambiguity, and it is 𝒪(ϵ) even though it has zero boost-weight. This is because the ℬ_(0) takes the form of a product of two terms that are individually not boost-invariant: ℬ_(0)∼ X_(-k+m)∂^k-m_v Y_(0)∼𝒪(ϵ) . Similarly, we can get Q^rμ = Q^rμ + v W^rμ_v . We can combine eq.(<ref>) and eq.(<ref>) in eq.(<ref>) (with Ξ^r=0) by carefully tracking the factors of v to get 2 E_vv\|_r=0 = - ∂_v ( 1√(h)∂_v [ √(h)( Q^rv + ℬ_(0)) ] + ∇_i [ Q^ri - J^i_(1)] ) + 𝒪(ϵ^2) . Here J^i_(1) is defined through W^ri_v = ∂_v J^i_(1) + 𝒪(ϵ^2). This allows us to write the components of the entropy current to be [Notably, one can show that when U(1) gauge invariant Lagrangians are considered, 𝒥^v and 𝒥^i are gauge invariant. This is because the structures Θ^r and Q^rρ are U(1) gauge invariant.] 𝒥^v = - 12( Q^rv + ℬ_(0)) , and 𝒥^i = - 12( Q^ri - J^i_(1)) . We now proceed to focus on how to extend this analysis for CS theories of gravity. §.§ Structure of the Lagrangian for Chern-Simons theories In this section, we elucidate the structure of the CS Lagrangian eq.(<ref>). The Lagrangian of eq.(<ref>) has an explicit dependence of A_μ. This makes it difficult to study the structures Θ^r, Ξ^r, and Q^rρ because they too will carry the explicit dependence of A_μ. A_v will enter the boost weight analysis since it has a non-trivial boost weight and will mess up the structure of Result:1 given in eq.(<ref>). If the structure of a generic covariant tensor with positive boost weight changes, then eq.(<ref>) and eq.(<ref>) will change due to additional factors proportional to A_v. This will significantly affect the final structure of eq.(<ref>) due to A_v factors polluting the terms. Let us point this out by first computing the various structures: Θ^μ, Ξ^μ and Q^μρ for eq.(<ref>). §.§.§ Noether charge for Chern-Simons theories The form of the Lagrangian in eq.(<ref>) can in principle depend arbitrarily on Γ^α_βμ and A_μ. The crucial input of the Chern-Simons class of theories comes from eq.(<ref>), i.e., under a combined action of the diffeomorphism and a U(1) gauge transformation eq.(<ref>), the Lagrangian is constrained to vary as eq.(<ref>). This imposes severe restrictions on the form of the Lagrangian eq.(<ref>). Before studying these restrictions, it is useful to compute the Noether charge Q^μν for generic Chern-Simons theories. This has been studied before in <cit.>, but we work with the component notation, unlike those works which work in the differential form language. The standard variation of the Lagrangian eq.(<ref>) gives δ L = LA_μδA_μ + LF_μ_νδF_μ_ν + LΓ^λ_μ_νδΓ^λ_μ_ν + LR^α_β_μ_νδR^α_β_μ_ν + Lg^μ^νδg^μ^ν . Now, eq.(<ref>) gives eq.(<ref>) with E^μν, G^μ and Θ^μ given by E^μ^ν = 1/2 L g^μ^ν - g^μ^αg^ν^βLg^α^β - D_αS^α^μ^ν , G^μ = LA_μ + 2 D_νLF_μ_ν , Θ^μ = 2 LF_μ_νδA_ν + 2 LR^α_β_μ_νδΓ^α_β_ν + S^μ^α^βδg_α_β , where S^μ^α^β = 1/2 D_ν[g^α^λ(LR^λ_β_μ_ν + LR^λ_μ_β_ν) + g^β^λ(LR^λ_α_μ_ν + LR^λ_μ_α_ν) . . - g^μ^λ(LR^λ_β_α_ν + LR^λ_α_β_ν) ] + 1/2(g^α^λLΓ^λ_β_μ + g^β^λLΓ^λ_α_μ - g^μ^λLΓ^λ_β_α) . Next, we consider the variation under eq.(<ref>). Under eq.(<ref>) A_μ,Γ^α_βμ transform as δA_μ = ℒ_ξA_μ + D_μΛ , δΓ^λ_μ_ν = ℒ_ξΓ^λ_μ_ν + ∂_μ∂_νξ^λ . If we implement eq.(<ref>) in eq.(<ref>), we have δ L = LA_μℒ_ξA_μ + LF_μ_νℒ_ξF_μ_ν + LΓ^λ_μ_νℒ_ξΓ^λ_μ_ν + LR^α_β_μ_νℒ_ξR^α_β_μ_ν + Lg^μ^νℒ_ξg^μ^ν + LA_μ D_μΛ + LΓ^λ_μ_ν∂_μ∂_νξ^λ = ℒ_ξ L + LA_μ D_μΛ + LΓ^λ_μ_ν∂_μ∂_νξ^λ . This clarifies that the Lagrangian in eq.(<ref>) is not diffeomorphism/U(1) covariant. After some integration by parts manipulations (see eq.(<ref>) in Appendix <ref> for details), we get δ_ξ(√(-g) L ) = √(-g) D_μ(ξ^μ L ) + √(-g) D_μΞ^μ - √(-g)Λ D_μLA_μ + ξ^λ∂_μ∂_ν(√(-g)LΓ^λ_μ_ν) , where Ξ^μ is [This structure of Ξ^μ is slightly different from the differential form Ξ derived in <cit.>. It should be mentioned that we are treating the Christoffel symbol as being symmetric in its two lower indices. This differs from the differential form notation, where the Christoffel symbol is treated as a matrix-valued one form. This singles out the first index (the index of the one form) as special. Due to this ambiguity in treating the Christoffel symbol, the expression of Ξ^μ for specific examples derived from eq.(<ref>) differs from the brute force computations by a total derivative ambiguity. See eq.(<ref>) and eq.(<ref>) in <ref> for details.] Ξ^μ = LA_μΛ + LΓ^λ_μ_ν∂_νξ^λ - 1/√(-g)ξ^λ∂_ν(√(-g)LΓ^λ_μ_ν) . Thus, we see that in order for eq.(<ref>) to match with the definition of a CS Lagrangian eq.(<ref>), we have two separate identities that need to be satisfied [The symmetric treatment of the two lower indices of the Christoffel symbol is evident from the second Bianchi identity for the gravity sector. In the differential form notation <cit.>, the first index would be special, and we would have ended with just one derivative contracting the first index similar to the gauge sector Bianchi identity.]: D_μLA_μ = 0 , ∂_μ∂_ν(√(-g)LΓ^λ_μ_ν) = 0 , which are obtained by using the fact that ξ^λ and Λ are arbitrary in eq.(<ref>) above. These are additional Chern-Simons Bianchi identities apart from the general Bianchi identities eq.(<ref>). We can now use eq.(<ref>) to derive Q^μν from eq.(<ref>). After a tedious calculation which is given in Appendix <ref> (steps following eq.(<ref>)), we finally have Q^μ^ν = 2 LF_μ_ν(A_λξ^λ + Λ) + 2 LR^α_β_μ_ν D_βξ^α + ξ_α(S^μ^ν^α - S^ν^μ^α) + ξ^λ D_β[LR^λ_μ_ν_β - LR^λ_ν_μ_β] , where S^μνα is given by eq.(<ref>). §.§.§ Gauge field dependence of the Chern-Simons Lagrangian In order to establish the entropy current structure from eq.(<ref>), we need to process further the CS Lagrangian eq.(<ref>). From eq.(<ref>), eq.(<ref>) and eq.(<ref>), we see that the structures generically depend on A_μ because of the explicit dependence of the Lagrangian eq.(<ref>) on A_μ. Consider an example of the (4+1)-dimensional mixed CS theory L = ϵ^μ^ν^ρ^σ^δA_μR^α_β_ν_ρR^β_α_σ_δ . Differentiating the above Lagrangian with respect to R^α_β_ν_ρ gives an expression that depends on A_μ. This presents a problem because the gauge invariance of the entropy current would be murky. We should expect the entropy current to be U(1) gauge invariant because the bulk EoM of CS theories is U(1) gauge and diffeomorphism covariant. Another technical issue arises from eq.(<ref>); we would have terms proportional to Λ. The boost weight analysis does not constrain Λ. The only constraint on expressions involving Λ is given in eq.(<ref>). Thus, the analysis of mixed CS theories becomes tricky because it is difficult to argue that the Λ term of eq.(<ref>) combines with v A_v in such a way that it drops out (being of 𝒪(ϵ^2)) from eq.(<ref>). To get around this, we will follow the approach of <cit.>. Due to the Bianchi identities eq.(<ref>), mixed CS Lagrangians typically have the anomaly either in the U(1) sector or the gravitational sector. One can push the anomaly from the U(1) sector to the gravitational sector at the cost of a total derivative term [Let us try to elaborate on what we mean by putting the anomaly in the gauge or gravity sector. This terminology is actually borrowed from the holographic context, wherein an anomaly in the boundary field theory is equivalent to having a CS term in the dual bulk theory Lagrangian. In the boundary theory, the anomaly can be in the gauge sector or in the gravitational sector. In dual bulk language, which is what we are mainly concerned with in our work, it corresponds to having a CS term with the explicit appearance of the gauge field A_μ or the non-tensorial Γ^μ_αβ. So, for us pushing the anomaly from one sector to the other actually means that we are either having a CS Lagrangian with an explicit A_μ or transferring to a Lagrangian that depends on Γ^μ_αβ. This transformation is achieved by adding a total derivative piece to the Lagrangian; hence, the local dynamics remain unaltered.], see for example in <cit.>. If the Lagrangian eq.(<ref>) has the anomaly in the gravitational sector, then it essentially becomes independent of A_μ. This makes analyzing the entropy current structure easier if we can argue that the total derivative term arising from pushing the anomaly doesn't contribute to the entropy current. We will precisely do this by carefully using the Bianchi identities eq.(<ref>) below. We will give the main steps and leave the details to Appendix <ref>. As L = L (g^μ^ν, Γ^α_β_μ, R^α_β_μ_ν, A_μ, F_μ_ν) from eq.(<ref>), L consists of sums of terms of the form L_n = ℒ̃^ν_1^⋯^ν_n∏_i=1^n A_ν_i , where ℒ̃^ν_1^⋯^ν_n is U(1) gauge invariant and totally symmetric in all its indices (as ∏_i=1^n A_ν_i is totally symmetric). The Bianchi identity eq.(<ref>) implies that D_μL_nA_μ = 0 n D_μℒ̃^μ^ν_1^⋯^ν_n-1 = 0 and n(n-1) ℒ̃^μ^ν^ν_1^⋯^ν_n-2 = 0 . The second condition of eq.(<ref>) immediately implies that for n ≥ 2, L_n = 0 in eq.(<ref>). This necessarily means that a generic CS Lagrangian eq.(<ref>) either has no factors of A_μ or it has a single factor of A_μ [ This is consistent with the fact that if we are working with a U(1) gauge field and treat it as a one form, one cannot construct a higher dimensional form by taking the wedge product of two U(1) gauge field forms. This is why the analysis of this section is restricted to U(1) gauge fields. Thus, we won't consider non-abelian gauge fields for which the Bianchi identity eq.(<ref>) would be different.], i.e., L = ℒ̃ + ℒ̃^μ A_μ . The first condition of eq.(<ref>) implies that there are two different choices for ℒ̃^μ: ℒ̃^μ = D_νℬ^ν^μ^ρ_1^σ_1^⋯^ρ_n^σ_n∏_i=1^n F_ρ_i σ_i if 2n+1 < D a_g ϵ^μ^ρ_1^σ_1^⋯^ρ_n^σ_n∏_i=1^n F_ρ_i σ_i if 2n+1 = D Here D is the dimension of the spacetime and ℬ^μ^ν^ρ_1^σ_1^⋯^ρ_n^σ_n is independent of the U(1) gauge field and totally antisymmetric and a_g is a constant. We can combine eq.(<ref>) and eq.(<ref>) to explicitly state that a generic Chern-Simons Lagrangian eq.(<ref>) must be of the form [We have done an integration by parts manipulation on the ℬ^μ^ν^ρ_1^σ_1^⋯^ρ_n^σ_n term to express the final result by dumping terms into ℒ. See eq.(<ref>).] L = ℒ + D_μ[A_ν∑_n=0^N-1ℬ^μ^ν^ρ_1^σ_1^⋯^ρ_n^σ_n(∏_i=1^n F_ρ_i_σ_i) ] + a_g ϵ^μ^ρ_1^σ_1^⋯^ρ_N^σ_NA_μ∏_i=1^N F_ρ_i_σ_i , where ℒ is U(1) gauge invariant, and a_g is a constant [This form of the Lagrangian is consistent with eq.(1.5) and eq.(1.6) of <cit.> which gave a general form of the Lagrangian for mixed CS theories.]. As a demonstration of this construction, we consider the (4+1)-dimensional mixed CS theory of eq.(<ref>). We can push the anomaly from the U(1) sector to the gravitational sector as follows: L = ℒ + D_μ (U^μνA_ν) , where ℒ = 2 ϵ^μ^ν^λ^ρ^σF_μ_νΓ^α_λ_β(1/2R^β_α_ρ_σ - 1/3Γ^β_ρ_τΓ^τ_α_σ) , is the U(1) gauge invariant Lagrangian and U^μν is given by U^μν = -4 ϵ^μ^ν^λ^ρ^σΓ^α_λ_β(1/2R^β_α_ρ_σ - 1/3Γ^β_ρ_τΓ^τ_α_σ) . One can see that eq.(<ref>) along with eq.(<ref>) and eq.(<ref>) is of the form eq.(<ref>). It should be noted that in (4+1)-dimensions, we have a pure gauge CS Lagrangian L = ϵ^μνλρσ A_μ F_νλ F_ρσ , which is of the form of the last term in eq.(<ref>). This final result for the Lagrangian is a direct consequence of the CS theory Bianchi identities eq.(<ref>) [We note that we only needed to use the Bianchi identity of the gauge sector in eq.(<ref>). It turns out this is enough for us to argue for the entropy current structure of eq.(<ref>). Imposing the gravitational sector Bianchi identity of eq.(<ref>) would impose further restrictions on ℒ and ℬ^μνρ_1 σ_1 …ρ_n σ_n. This also points to the fact that there are generally “hidden" indices in ℬ corresponding to the gravitational terms. For example in eq.(<ref>), the λ,ρ,σ correspond to these hidden indices.]. This form of the Lagrangian is considerably easier to work with because the A_μ dependence has been absorbed into a total derivative term and a pure gauge term. Once we carefully deal with these terms, the analysis of ℒ mostly follows that of <cit.> since it is U(1) gauge invariant. The equivalent structures of eq.(<ref>) and eq.(<ref>) for the total derivative term in eq.(<ref>) have been worked out in Appendix <ref>. We will evaluate those structures using our gauge eq.(<ref>) on the horizon r=0 in <ref>. We now proceed to construct a proof of the entropy current from eq.(<ref>) using eq.(<ref>). §.§ Proof of the existence of the entropy current for Chern-Simons theories Now that we have carefully analyzed the structure of the Lagrangian in eq.(<ref>), we can construct the proof of the entropy current structure for CS theories. The final form of the Lagrangian is given by eq.(<ref>), which we rewrite here for the convenience of the reader: L = ℒ_Gauge invariant + D_μ(U^μ^νA_ν)_total derivative + a_g ϵ^μ^ρ_1^σ_1^⋯^ρ_N^σ_NA_μ∏_i=1^N F_ρ_i_σ_i_pure gauge , where U^μ^ν is U(1) gauge invariant and antisymmetric in (μ, ν), ℒ is U(1) gauge invariant, and a_g is a constant. The proof that eq.(<ref>) given by 2 v E_vv + G_v (v A_v + Λ) = (-Θ^r + Ξ^r + D_ρ Q^rρ)\|_r=0 , has the structure of eq.(<ref>) follows after we analyze the three terms in eq.(<ref>) separately. We will show below that the total derivative and pure U(1) gauge terms do not contribute to the entropy current of eq.(<ref>). Thus, the entropy current solely receives contributions from ℒ, the CS Lagrangian, where the anomaly is in the gravitational sector. The non-trivial part of the proof is the structure of Ξ^μ that is non-zero for CS theories through eq.(<ref>). This is the new element compared to the proofs constructed in <cit.>. We will show that this additional term will not spoil the entropy current structure of eq.(<ref>). §.§.§ Analysis of the total derivative term in eq.(<ref>) The total derivative term in eq.(<ref>) has the form ℒ^μ = U^μν A_ν where U^μν is U(1) gauge invariant and antisymmetric. This is a special case of the general analysis in <ref>. We evaluate the various structures in eq.(<ref>) in our gauge eq.(<ref>) on the horizon r=0. The Noether charge is given by eq.(<ref>): Q^rρ_t\|_r=0 = U^r^λA_λξ^ρ = v U^r^λA_λδ^ρ_v 1/√(h)∂_ρ(√(h) Q^rρ_t )\|_r=0 = 1/√(h)(1 + v ∂_v) (√(h)U^r^ρA_ρ) = (1 + v ∂_v) (U^r^ρA_ρ) + 1/2 v A_vU^r^vh^m^n∂_vh_m_n + 𝒪(ϵ^2) . The Θ^μ and Ξ^μ are given by eq.(<ref>) and eq.(<ref>) respectively. Thus, we have Ξ^r_t\|_r=0 = U^r^ρ D_ρΛ , Θ^r_t \|_r=0 = A_v ℒ_ξ U^rv + A_i ℒ_ξ U^ri + U^rvℒ_ξ A_v + U^riℒ_ξ A_i + 12U^rv v A_v h^mn∂_v h_mn + 𝒪(ϵ^2) = (1+ v ∂_v)(U^rvA_v + U^riA_i) + U^rρ∂_ρΛ + 12U^rv v A_v h^mn∂_v h_mn . One can use eq.(<ref>) and eq.(<ref>) to show that [This equation is exact to all orders in ϵ since we use the LHS of eq.(<ref>). If we use the equivalent RHS of eq.(<ref>), we would get a result up to 𝒪(ϵ^2) only.] -Θ^r_t \|_r=0 + Ξ^r_t \|_r=0 + 1/√(h)∂_ρ(√(h) Q^rρ_t ) \|_r=0 = 0 . Thus we see that the total derivative term in eq.(<ref>) doesn't contribute to the entropy current structure and drops out entirely from E_vv of eq.(<ref>). Notice how in eq.(<ref>) and eq.(<ref>), there are terms explicitly proportional to A_v and A_i. This is due to the δ A_ν term in eq.(<ref>) [The 𝒢^μν of eq.(<ref>) is not anti-symmetric and thus if we use eq.(<ref>), the δ A_ν term in Θ^μ doesn't cancel out the corresponding contribution in Q^μν. This leads to a split of vA_v and Λ terms in eq.(<ref>). ]. Even if the v A_v terms and Λ terms appear independent, they cancel out in the combination of eq.(<ref>). This points to the advantage of the structure of the Lagrangian in eq.(<ref>). If we had worked with the original Lagrangian eq.(<ref>), then we would have had to track these appearances of A_v and A_i carefully. Arguing the entropy current structure of eq.(<ref>) would have been a formidable task. §.§.§ Analysis of the pure gauge term in eq.(<ref>) We now consider the pure gauge term of eq.(<ref>) given by L_g = a_g ϵ^μ^ρ_1^σ_1^⋯^ρ_N^σ_NA_μ∏_i=1^N F_ρ_i_σ_i . For this L_g, we can use the general structures derived in eq.(<ref>), eq.(<ref>) and eq.(<ref>) to evaluate the contribution to eq.(<ref>). We thus have (see eq.(<ref>)) [D_ρ Q^rρ_g - Θ^r_g + Ξ^r_g ]_r=0 - G^r_g (A_ρξ^ρ + Λ) = - v (L_gA_rA_v + 2 L_gF_r_iF_v_i) . Here the subscript g denotes the contribution of L_g in eq.(<ref>) to eq.(<ref>), eq.(<ref>) and eq.(<ref>). Thus, we have (see eq.(<ref>)) [D_ρ Q^rρ_g - Θ^r_g + Ξ^r_g ]_r=0 - G^r_g (A_ρξ^ρ + Λ) = 0 . Thus L_g of eq.(<ref>) in eq.(<ref>) doesn't contribute to the entropy current at linear order. This is in line with the gauge invariant analysis of <cit.>, where the pure gauge terms in the Lagrangian didn't contribute to the final entropy current. §.§.§ Analysis of the structure of Ξ^μ coming from ℒ in eq.(<ref>) Since we have analyzed the total derivative term and the pure gauge term of eq.(<ref>) and showed that they are inconsequential, we can finally analyze the gauge invariant term ℒ that truly contributes to the entropy current. Before making the final analysis of the entropy current contribution of the U(1) gauge invariant ℒ, we analyze the non-trivial structure of Ξ^μ of eq.(<ref>). To handle these terms, we must return to the derivation of eq.(<ref>). During the derivation in eq.(<ref>), we obtained the relation (here ∂ℒ/∂ A_μ = 0 because it is U(1) gauge invariant) δℒ = ℒ_ξℒ + ℒΓ^λ_μ_ν∂_μ∂_νξ^λ which was rearranged to get the value of Ξ^μ_ℒ (see eq.(<ref>)) ℒΓ^λ_μ_ν∂_μ∂_νξ^λ = D_μΞ^μ_ℒ + ξ^λ/√(-g)∂_μ∂_ν(√(-g)ℒΓ^λ_μ_ν) . Here the subscript ℒ denotes that the Ξ^μ only receives contributions from ℒ of eq.(<ref>). We now use the Bianchi identity of eq.(<ref>) to set the last term in RHS of eq.(<ref>) to 0. So, we are left with D_μΞ^μ_ℒ = ℒΓ^λ_μ_ν∂_μ∂_νξ^λ . Now comes the crucial point. When we go to the horizon r=0 in our gauge eq.(<ref>), the RHS of eq.(<ref>) is zero because the Killing vector ξ of eq.(<ref>) is linear in the coordinates v and r. Thus eq.(<ref>) in our gauge becomes D_μΞ^μ_ℒ\|_r=0 = 0 . Hence, in our gauge eq.(<ref>), we must have for some antisymmetric 2-symbol q^μν such that Ξ^μ_ℒ = D_νq^μ^ν . This looks similar to the Noether charge eq.(<ref>). But, to repeat the conclusions of <ref>, in particular eq.(<ref>) and eq.(<ref>), we need to establish two more things for q^μ^ν - linearity in v and gauge invariance. We can show that q^μν is U(1) gauge invariant up to a total derivative. The details of the proof are given in Appendix <ref>. This allows us to express the q^rρ on the horizon as q^r^ρ\| = q̃^r^ρ + v w_v^r^ρ , where q̃, w have no explicit factors of v. We also treat them to be U(1) gauge invariant because the inconsequential total derivative term of eq.(<ref>) drops out in eq.(<ref>). §.§.§ Final result on the horizon: We can now combine eq.(<ref>) and eq.(<ref>) to express the result of Ξ^r_ℒ on the horizon r=0. The final result is thus given by Ξ^r_ℒ = 1/√(h)∂_ρ(√(h)q̃^r^ρ) + (1 + v ∂_v) w_v^r^v + v ∂_v(1/√(h)∂_i(√(h)j^i_(1)) ) + 𝒪(ϵ^2 ) . Here q^rρ, j^i_(1) and w_v^r^v are U(1) gauge invariant. This is entirely analogous to eq.(<ref>) (also eq.(3.66) of <cit.>). §.§.§ Entropy current from the gauge invariant term ℒ in eq.(<ref>) As we have handled two of the terms in eq.(<ref>) (the total derivative term in <ref> and the pure gauge term in <ref>), we can finally focus on the contribution of ℒ. This term is U(1) gauge invariant by construction (eq.(<ref>)) and has a structure of Ξ^r on r=0 given by eq.(<ref>). We now consider the contribution of Θ^r, Q^rρ and G_v in eq.(<ref>). We first recall, the general structures for G^μ, Θ^μ and Q^μν from eq.(<ref>), eq.(<ref>) and eq.(<ref>) respectively evaluated for ℒ: G^μ_ℒ = ℒA_μ + 2 D_νℒF_μ_ν , Θ^μ_ℒ = 2 ℒF_μ_νδA_ν + 2 ℒR^α_β_μ_νδΓ^α_β_ν + S^μαβ_ℒδg_α_β , Q^μν_ℒ = 2 ℒF_μ_ν(A_λξ^λ + Λ) + 2 ℒR^α_β_μ_ν D_βξ^α + ξ_α(S^μνα_ℒ - S^νμα_ℒ) + ξ^λ D_β[ℒR^λ_μ_ν_β - ℒR^λ_ν_μ_β] , where S^μαβ_ℒ = 1/2 D_ν[g^α^λ(ℒR^λ_β_μ_ν + ℒR^λ_μ_β_ν) + g^β^λ(ℒR^λ_α_μ_ν + ℒR^λ_μ_α_ν) . . - g^μ^λ(ℒR^λ_β_α_ν + ℒR^λ_α_β_ν) ] + 1/2(g^α^λℒΓ^λ_β_μ + g^β^λℒΓ^λ_α_μ - g^μ^λℒΓ^λ_β_α) . For convenience, we break apart the Θ^μ_ℒ and Q^μν_ℒ of eq.(<ref>) and eq.(<ref>) respectively into their “gauge" parts and “gravity" parts. Θ^μ_ℒ = Θ^μ_ℒ\|_gauge + Θ^μ_ℒ\|_gravity , where Θ^μ_ℒ\|_gauge = 2 ℒF_μ_νδA_ν , Θ^μ_ℒ\|_gravity = 2 ℒR^α_β_μ_νδΓ^α_β_ν + S^μαβ_ℒδg_α_β . Q^μν_ℒ = Q^μν_ℒ\|_gauge + Q^μν_ℒ\|_gravity , where Q^μν_ℒ\|_gauge = 2 ℒF_μ_ν(A_λξ^λ + Λ) , Q^μν_ℒ\|_gravity = 2 ℒR^α_β_μ_ν D_βξ^α + ξ_α(S^μνα_ℒ - S^νμα_ℒ) + ξ^λ D_β[ℒR^λ_μ_ν_β - ℒR^λ_ν_μ_β] . It should be noted that the break up of terms in eq.(<ref>) and eq.(<ref>) is done to treat the terms separately, i.e., the terms proportional to δ A_ν and δ g_μν. It does not mean that the gauge field and metric contributions factor out. ℒ in eq.(<ref>) depends on both F_μν and g_μν in a mixed way, so the “gauge" and "gravity" parts of eq.(<ref>) and eq.(<ref>) in general have mixing between the two fields. §.§.§ Contribution of the “gauge" terms on the horizon: The “gauge" terms of eq.(<ref>) and eq.(<ref>) along with eq.(<ref>) make the following contribution to eq.(<ref>) on the horizon r=0 (see eq.(<ref>)) [D_ρ Q^rρ_ℒ - Θ^r_ℒ]_gauge - G^r_ℒ(A_ρξ^ρ + Λ) = 𝒪(ϵ^2) . Thus, the “gauge" terms of eq.(<ref>) and eq.(<ref>) do not contribute to the entropy current in eq.(<ref>). §.§.§ Noether charge of “gravity" terms on the horizon: From eq.(<ref>), the expression of Q^rρ on the horizon r=0 evaluates to Q^rρ_ℒ\|_gravity = 2 ℒR^α_β_r_ρ D_βξ^α + v ( S^rρ r_ℒ - S^ρ rr_ℒ) + v D_β[ℒR^v_r_ρ_β - ℒR^v_ρ_r_β] = 2 ℒR^v_v_r_ρ - 2 ℒR^r_r_r_ρ + v ℒR^m_r_r_ρω^m - v ℒR^v_m_r_ρω_m + v ℒR^n_m_r_ρh^n^l∂_vh_m_l + v (g^ρ^λℒΓ^λ_r_r - ℒΓ^v_r_ρ) + 2 v D_β[g^ρ^λℒR^λ_r_r_β - ℒR^v_ρ_r_β] . Thus, we have on the horizon r=0 Q^rρ_ℒ\|_gravity = Q^r^ρ + v W_v^r^ρ , where Q, W have no explicit factors of v. This structure of Q^rρ is identical to the structure of Q^μν for diffeomorphism invariant theories of gravity <cit.> derived in eq.(<ref>) (see eq.(3.60) of <cit.>). As W_v^r^i is gauge invariant and boost weight 2, we have W_v^r^i = ∂_vJ^i_(1) + 𝒪(ϵ^2) . This implies that 1/√(h)∂_v(√(h) v W_v^r^v) = (1 + v ∂_v) W_v^r^v , 1/√(h)∂_i(√(h) v W_v^r^i) = v ∂_v(1/√(h)∂_i(√(h)J^i_(1)) ) + 𝒪(ϵ^2 ) . Using these expressions, we can straightforwardly evaluate the divergence of the Noether charge on the horizon r=0 <cit.> as D_ρ Q^rρ_ℒ\|_gravity = 1/√(h)∂_ρ(√(h) Q^rρ_ℒ)_gravity = 1/√(h)∂_ρ(√(h)Q^r^ρ) + (1 + v ∂_v) W_v^r^v + v ∂_v(1/√(h)∂_i(√(h)J^i_(1)) ) + 𝒪(ϵ^2 ) , where Q^rρ, W_v^r^v and J^i_(1) are all U(1) gauge invariant. This is identical to the diffeomorphism invariant case in eq.(<ref>) (see eq.(3.66) of <cit.>). §.§.§ Θ^r of “gravity" terms on the horizon: We now analyze the structure of Θ^r in eq.(<ref>) from the contributions of the “gravity" terms. We first define E^rαβν_ℒ = 1/2(g^α^λℒR^λ_β_r_ν + g^α^λℒR^λ_ν_r_β + g^β^λℒR^λ_α_r_ν + g^β^λℒR^λ_ν_r_α - g^ν^λℒR^λ_β_r_α - g^ν^λℒR^λ_α_r_β) This is the CS theory equivalent of eq.(<ref>). Using the definition of eq.(<ref>) and the steps following eq.(<ref>) to eq.(<ref>), Θ^r from the “gravity" contributions of eq.(<ref>) take the following form on the horizon: Θ^r_ℒ_gravity = - (1 + v ∂_v) (E^rmnr_ℒ∂_rh_m_n) + v ∂^2_v(J_(1)^m^n∂_rh_m_n) + 𝒪(ϵ^2 ) = (1 + v ∂_v) 𝒜_(1) + v ∂^2_vℬ_(0) + 𝒪(ϵ^2 ) . Here 𝒜_(1) and ℬ_(0) are U(1) gauge invariant and ℬ_(0) is 𝒪(ϵ) because it is of the form eq.(<ref>). This structure of Θ^r is identical to the structure of Θ^r of <cit.> derived in eq.(<ref>) (see eq.(3.56) of <cit.>). Thus, the ℬ_(0) denotes the JKM ambiguity, which is analogous to the JKM ambiguities appearing in <cit.>, i.e., eq.(<ref>). It is clear from eq.(<ref>) that the ℬ_(0) term is zero only if E^rmnr_ℒ = 𝒪(ϵ^2 ) where E^rmnr_ℒ = 1/2(h^m^lℒR^l_r_r_n + h^n^lℒR^l_r_r_m - ℒR^v_n_r_m - ℒR^v_m_r_n) . For the specific examples we study in <ref>, the JKM ambiguity ℬ_(0) is zero. §.§.§ Final structure of the entropy current: We have shown that the structures of Θ^r_ℒ in eq.(<ref>) and Q^rρ_ℒ in eq.(<ref>) retain the same form as that of <cit.>, i.e., eq.(<ref>) and eq.(<ref>) respectively. The new non-trivial element was the structure of Ξ^r, which is non-zero for CS theories, and it has been analyzed in eq.(<ref>). This Ξ^r is of the form of eq.(<ref>). The analysis now basically follows that of <cit.> (<ref>). Substituting eq.(<ref>), eq.(<ref>), eq.(<ref>) and eq.(<ref>) in eq.(<ref>), we have 2v E_v_v = 1/√(h)∂_ρ(√(h) Q^rρ_ℒ) - Θ^r_ℒ + Ξ^r_ℒ - G^r_ℒ(A_ρξ^ρ + Λ) = v ∂_v(W_v^r^v + w_v^r^v - 𝒜_(1) + 1/√(h)∂_i(√(h)(J^i_(1) + j^i_(1)) ) - 1/√(h)∂_v(√(h)ℬ_(0)) ) + 1/√(h)∂_ρ(√(h)(Q^r^ρ + q̃^r^ρ) ) + W_v^r^v + w_v^r^v - 𝒜_(1) + 𝒪(ϵ^2 ) . As the LHS is proportional to v, the powers of v on both sides should match <cit.> analogous to eq.(<ref>) and thus, 𝒜_(1) = W_v^r^v + w_v^r^v + 1/√(h)∂_v(√(h)(Q^r^v + q̃^r^v) ) + 1/√(h)∂_i(√(h)(Q^r^i + q̃^r^i) ) + 𝒪(ϵ^2 ) , 2 E_v_v = ∂_v(W_v^r^v + w_v^r^v - 𝒜_(1) + 1/√(h)∂_i(√(h)(J^i_(1) + j^i_(1)) ) - 1/√(h)∂_v(√(h)ℬ_(0)) ) + 𝒪(ϵ^2 ) . Substituting 𝒜_(1) in the expression for E_v_v, we finally get 2 E_v_v = - ∂_v(1/√(h)∂_v(√(h)(Q^r^v + q̃^r^v + ℬ_(0)) ) + 1/√(h)∂_i(√(h)(Q^r^i + q̃^r^i - J^i_(1) - j^i_(1)) ) ) + 𝒪(ϵ^2 ) Thus, we have recast E_vv of eq.(<ref>) in the form eq.(<ref>) which is the same as eq.(<ref>) with the components of the entropy current given by 𝒥^v = -12( Q^rv + q̃^rv + ℬ_(0)) , 𝒥^i = -12( Q^ri + q̃^ri - J^i_(1) - j^i_(1)) . This is what we originally set out to prove. Most importantly, since we derived these currents from ℒ which is U(1) gauge invariant, and we know that q^rρ of eq.(<ref>) is U(1) gauge invariant, the final currents of eq.(<ref>) are U(1) gauge invariant. Let us summarize the major steps of our proof. We started off with a generic form of the CS theory Lagrangian given by eq.(<ref>). This form, as such, was difficult to work with because of the explicit dependence of the Lagrangian on A_μ. We employed the Bianchi identities of the CS theory given by eq.(<ref>) to recast the Lagrangian in a form given by eq.(<ref>). The explicit dependence of A_μ was relegated to a total derivative term and a pure gauge term, both of which do not contribute to the E_vv of eq.(<ref>). The leftover part of the CS Lagrangian denoted by ℒ is U(1) gauge invariant but crucially not diffeomorphism invariant. Thus, the Ξ^μ term of eq.(<ref>) was non-zero. This new structure wasn't analyzed in <cit.> because the authors were looking at diffeomorphism invariant theories of gravity. The final structure of Ξ^r_ℒ was worked out in eq.(<ref>). The structures of Θ^r_ℒ and Q^rρ_ℒ were worked out in eq.(<ref>) and eq.(<ref>) and they have the same structure as their diffeomorphism counterparts worked out in <cit.> (eq.(<ref>) and eq.(<ref>) respectively). Putting all the structures together, we got eq.(<ref>), which is what we wanted to prove. §.§.§ Entropy current for pure gravitational Chern-Simons term: We remark that if we had considered a pure gravitational Chern-Simons term, we have a significant simplification in the proof. The Lagrangian will already be of the form ℒ with no total derivative term and pure gauge terms of eq.(<ref>). Thus, we don't need the analysis of <ref> and <ref>. In the study of the structure of Ξ^μ in <ref>, we only need to prove the linearity in v in eq.(<ref>). This is done in the first subsection of Appendix <ref>. Thus eq.(<ref>) follows. Since the Lagrangian is independent of the gauge field, we only need to consider the “gravity" terms of eq.(<ref>) and eq.(<ref>). The analysis of <ref> simplifies considerably, and we straightaway get to eq.(<ref>) resulting in the entropy current structure eq.(<ref>). § VERIFICATION OF THE ABSTRACT PROOF WITH BRUTE FORCE RESULTS In this section, we will verify the components of the entropy current in eq.(<ref>) by computing Θ^r, Q^rρ and Ξ^r. We will also show that the final expressions match the brute force results of <ref>. To do that, we first collect the relevant expressions we need to verify the abstract proof. From eq.(<ref>), eq.(<ref>) and eq.(<ref>), we have Θ^r = (1+v∂_v) 𝒜_(1) + v ∂^2_v ℬ_(0) + 𝒪(ϵ^2) . Q^rv = Q^rv + v W^rv_v , Q^ri = Q^ri + v W^ri_v , W^ri_v = ∂_v J^i_(1) + 𝒪(ϵ^2) . Ξ^r = 1/√(h)∂_v(√(h)q̃^r^v) +1/√(h)∂_i(√(h)q̃^r^i) + (1 + v ∂_v) w_v^r^v + v ∂_v(1/√(h)∂_i(√(h)j^i_(1)) ) + 𝒪(ϵ^2 ) . The components of the entropy current are given by eq.(<ref>): 𝒥^v = -12( Q^rv + q̃^rv + ℬ_(0)) , 𝒥^i = -12( Q^ri + q̃^ri - J^i_(1) - j^i_(1)) . We will now verify that these general expressions match the brute force computations of E_vv for particular theories. §.§ (2+1)D pure gauge Chern-Simons term: The Chern-Simons Lagrangian is L = ϵ^μ^ν^λF_μ_νA_λ . The various structures are [One can use the generic formulae in eq.(<ref>), eq.(<ref>), eq.(<ref>) and eq.(<ref>) to cross-check these answers.] G^μ = 2 ϵ^μ^ν^λF_ν_λ , Θ^μ = 2 ϵ^μ^ν^λA_λδA_ν , Ξ^μ = ϵ^μ^ν^λF_ν_λΛ , Q^μ^ν = 2 ϵ^μ^ν^λA_λ[A_αξ^α + Λ] . If we evaluate these expressions on the horizon r=0, we get D_ρQ^r^ρ - Θ^r + Ξ^r = 𝒪(ϵ^2 ) . This is a particular case of the generic result established in <ref> that pure U(1) gauge Chern-Simons terms do not contribute to the entropy current. §.§ (2+1)D pure gravitational Chern-Simons term: The Chern-Simons Lagrangian is eq.(<ref>) ℒ = ϵ^λ^μ^νΓ^ρ_λ_σ(∂_μΓ^σ_ρ_ν + 2/3Γ^σ_μ_τΓ^τ_ρ_ν) . The various structures are given by Θ^μ = ϵ^α^ρ^σR^μ^β_ρ_σδg_α_β + ϵ^λ^μ^νΓ^β_λ_αδΓ^α_β_ν , Ξ^μ = ϵ^μ^ν^λ(∂_νΓ^σ_ρ_λ) (∂_σξ^ρ) , Q^μ^ν = ϵ^ν^ρ^σR^μ^λ_ρ_σξ_λ - ϵ^μ^ρ^σR^ν_λ_ρ_σξ^λ + ϵ^λ^ρ^σR^μ^ν_ρ_σξ_λ + ϵ^μ^ν^λΓ^ρ_λ_σ D_ρξ^σ . It should be noted that if one uses the general formulae eq.(<ref>), eq.(<ref>) and eq.(<ref>), we get the above expression for Ξ^μ in eq.(<ref>) up to an ambiguous total derivative D_ν L^μν which cancels out with -D_νL^μν because of the additional term -L^μν in Q^μν of eq.(<ref>): Ξ^μ = ϵ^μ^ν^λ(∂_νΓ^σ_ρ_λ) (∂_σξ^ρ) + D_ν L^μν→Ξ^μ + D_ν L^μν , Q^μν = ϵ^ν^ρ^σR^μ^λ_ρ_σξ_λ - ϵ^μ^ρ^σR^ν_λ_ρ_σξ^λ + ϵ^λ^ρ^σR^μ^ν_ρ_σξ_λ + ϵ^μ^ν^λΓ^ρ_λ_σ D_ρξ^σ - L^μν→ Q^μν - L^μν , where L^μν = 1/2ξ^λ(ϵ^ν^ρ^σ∂_ρΓ^μ_σ_λ - ϵ^μ^ρ^σ∂_ρΓ^ν_σ_λ) . The total derivative in Ξ^μ cancels the additional term in Q^μν in the combination eq.(<ref>)[ These total derivative terms manifest as ambiguities because of our final result for Ξ^μ in eq.(<ref>) in component notation. Here the derivative with respect to the Christoffel symbol should be symmetrized in the lower indices of the symbol as explained in footnote <ref>.]. Thus, for our purposes, we can work with the structures of eq.(<ref>). The various structures in eq.(<ref>) evaluated in our gauge on the horizon r=0 become Θ^r\|_r=0 = (1 + v ∂_v) [ϵ^r^v^x∂_v h/2h(ω + ∂_x h/2h) ] + 𝒪(ϵ^2 ) , ℬ_(0) = 0 . Ξ^r\|_r=0 = - 1√(h)∂_v ( √(h)ϵ^rvxω) , q̃^rv = - ϵ^rvxω , q̃^rx = 0 , j^x_(1) = 0 . Q^rv = - ϵ^rvxω , Q^rx = 0 , W^rx_v = ∂_v [ - 2 ϵ^rvx∂_v hh] + 𝒪(ϵ^2) J^x_(1) = -2hϵ^rvx∂_v h , W^rv_v = ϵ^rvx( 2 ∂_v ω + ω2h∂_v h + 14h^2(∂_v h)(∂_x h) ) . Thus, the components of the current are given by 𝒥^v = -12( Q^rv + q̃^rv + ℬ_(0)) = ϵ^rvxω , 𝒥^x = -12( Q^rx + q̃^rx - J^x_(1) - j^x_(1)) = -ϵ^rvx∂_v hh , which matches with the brute force computation of E_vv in eq.(<ref>) and eq.(<ref>). If we evaluate s_IWT of eq.(<ref>), we get s_IWT = -2 ( LR^v_ v r v - LR^r_ r r v) = ϵ^rvxω = 𝒥^v . Thus, 𝒥^v is exactly the Iyer-Wald-Tachikawa entropy eq.(<ref>) that satisfies the first law. From eq.(<ref>), we see that both Q^μν (through Q^rv) and Ξ^μ (through q^rv) contribute to 𝒥^v and thus to s_IWT. Note that since we work with the equation of motion with covariant indices (two upper indices), the match between brute force computations and the expressions of the abstract proof is exact. In the <cit.>, the authors worked with equations of motion with two lower indices, so the match was up to an overall sign. This is just a convention. §.§ (4+1)D Mixed Chern-Simons term: We first consider the mixed Chern-Simons term with an anomaly in the U(1) sector eq.(<ref>): L = ϵ^μνρσδ A_μ R^α_ βνρ R^β_ ασδ . Our proof in <ref> relies on transforming this Lagrangian to eq.(<ref>) such that the anomaly is in the gravitational sector eq.(<ref>): L = ℒ + D_μ (U^μνA_ν) , where, from eq.(<ref>), ℒ = 2 ϵ^μ^ν^λ^ρ^σF_μ_νΓ^α_λ_β(1/2R^β_α_ρ_σ - 1/3Γ^β_ρ_τΓ^τ_α_σ) , is the U(1) gauge invariant Lagrangian and U^μν is given by eq.(<ref>) as U^μν = -4 ϵ^μ^ν^λ^ρ^σΓ^α_λ_β(1/2R^β_α_ρ_σ - 1/3Γ^β_ρ_τΓ^τ_α_σ) . By brute force computation of Θ^μ, Q^μν and Ξ^μ, one can show that D_μ(U^μνA_ν) term doesn't contribute to the entropy current. This aligns with the analysis done in <ref>. The various structures derived from ℒ are Θ^μ = -U^μ^νδA_ν + 2 ϵ^μ^ν^τ^ρ^σF_ρ_σΓ^β_τ_αδΓ^α_β_ν + 2 ϵ^ρ^α^β^ν^λR^μ^σ_α_βF_ν_λδg_ρ_σ , Ξ^μ = 2 ϵ^μ^ν^λ^ρ^σF_ρ_σ(∂_νΓ^α_β_λ) (∂_αξ^β) , Q^μ^ν = -U^μ^ν(A_ηξ^η + Λ) + 2 ϵ^μ^ν^λ^ρ^σF_ρ_σΓ^α_λ_β D_αξ^β + 2 ξ_λF_ρ_σ(ϵ^ν^α^β^ρ^σR^μ^λ_α_β - ϵ^μ^α^β^ρ^σR_α_β^ν^λ + ϵ^λ^α^β^ρ^σR^μ^ν_α_β) . Similar to the case of the (2+1)-dimensional pure gravity CS theory, if we use the general formulae of eq.(<ref>), eq.(<ref>) and eq.(<ref>), we have ambiguous terms that cancel out in the combination of eq.(<ref>): Θ^μ →Θ^μ + D_ν M^μν_1[δ g_αβ] , Ξ^μ →Ξ^μ + D_ν M^μν_2[ξ] , Q^μν → Q^μν +M^μν_1[ℒ_ξg_αβ] - M^μν_2[ξ] , where M^μν_1[δ g_αβ] = 4 ϵ^μ^ν^τ^ρ^σA_ρΓ^β_τ_αδΓ^α_β_σ , M^μν_2[ξ] = ξ^λF_ρ_σ[ϵ^ν^α^β^ρ^σ∂_αΓ^μ_β_λ - ϵ^μ^α^β^ρ^σ∂_αΓ^ν_β_λ] . All the additional ambiguities cancel out in the combination eq.(<ref>). Thus, we can use the structures of eq.(<ref>) in our gauge on the horizon r=0 to get Θ^r\|_r=0 = -U^r^v∂_v(v A_v + Λ) + (1 + v ∂_v) [ϵ^r^v^i^j^kF_j_k(ω^l∂_vh_i_l + 2 Γ^m_i_nΓ^n_m_v) ] + 𝒪(ϵ^2 ) , ℬ_(0) = 0 . Ξ^r\|_r=0 = 1√(h)∂_v ( √(h) [ -2 ϵ^rvijk F_jkω_i ] ) + 1√(h)∂_i ( √(h) [ -4 ϵ^rvijk F_vjω_k ] ) , q̃^rv = -2 ϵ^rvijk F_jkω_i , q̃^ri = -4 ϵ^rvijk F_vjω_k , j^i_(1) = 0 . Q^r^ν = Q^r^ν + v W_v^r^ν - U^r^ν(v A_v + Λ) . Q^rv = - 2 ϵ^rvijk F_jkω_i , Q^ri = -4 ϵ^rvijk F_vkω_j , W^ri_v = - 4 ∂_v ( h^imϵ^rvljk F_jk∂_v h_ml) + 𝒪(ϵ^2) J^i_(1) = -4 h^imϵ^rvljk F_jk∂_v h_ml , W^rv_v = 8 ϵ^rvijk( F_jk R_vrvi + F_vi R_vrjk ) + 2 ϵ^rvijk F_jkΓ^α_iβΓ^β_α v . Thus, the components of the entropy current are given by 𝒥^v = -12( Q^rv + q̃^rv + ℬ_(0)) = 2 ϵ^rvijk F_jkω_i , 𝒥^i = -12( Q^ri + q̃^ri - J^i_(1) - j^i_(1)) = 4 ϵ^rvijk F_vkω_j - 2 h^imϵ^rvljk F_jk∂_v h_ml . This matches with the brute force computation of E_vv given in eq.(<ref>) and eq.(<ref>) [Once again, we see that this exactly matches because we work with equations of motion with upper indices.] If we evaluate s_IWT of eq.(<ref>), we get s_IWT = -2 ( LR^v_ v r v - LR^r_ r r v) = 2ϵ^r^v^i^j^kF_j_kω_i = 𝒥^v . Thus, 𝒥^v is exactly the Iyer-Wald-Tachikawa entropy eq.(<ref>) that satisfies the first law. Again, from eq.(<ref>), we see that both Q^μν (through Q^rv) and Ξ^μ (through q^rv) contribute to 𝒥^v and thus to s_IWT. § CONCLUSIONS In this section, we conclude by summarizing our results and highlighting the crucial lessons from our analysis. Our primary aim in this paper has been to show that the classical second law of thermodynamics is satisfied for dynamical black hole solutions in CS theories of gravity (and mixed gauge gravity CS theories). We have used the setup developed in <cit.> where the dynamics are assumed to be small perturbations around stationary black holes. To argue the second law, we have looked at the off-shell structure of the EoM (E_vv) in an adapted coordinate system around the Killing horizon, eq.(<ref>). This enables us to obtain the entropy current defined on the horizon, whose components give us the entropy density and a local in/out flow of it on a horizon slice. We constructed a local version of the second law with an extra assumption of the matter sector satisfying the null energy condition. Firstly, we considered specific examples of Chern-Simons theories and obtained the components of entropy current through a brute-force computation of the off-shell structure of E_vv. For (2+1)-dimensional pure gravity CS theory, the result is given in eq.(<ref>), and eq.(<ref>), which is limited to linearized perturbations. Furthermore, considering the (2+1)-dimensional pure gravity CS theory as a low energy EFT, the quadratic perturbations have been incorporated in the off-shell structure of E_vv in eq.(<ref>), and the entropy current is written in eq.(<ref>). In this particular case, we find an example where the second law is established beyond linear order and thus signifies actual entropy production. Next, in (4+1)-dimensions for mixed gauge gravity CS theories, working to linearized order in the perturbations, the off-shell E_vv and the entropy current has been obtained as written in eq.(<ref>) and eq.(<ref>) respectively. Once we have obtained these explicit expressions of entropy current for each of the examples mentioned above, we have also explicitly verified that they transform covariantly under a reparametrization of the coordinates maintaining the gauge, eq.(<ref>). We have explicitly obtained how the entropy currents change under this reparametrization (see eq.(<ref>) for (2+1)-dimensional CS theory as EFT, and eq.(<ref>) for (4+1)-dimensional CS theory). Most importantly, in both cases, we have seen how a non-trivial cancellation was required to assure the covariance as mentioned in eq.(<ref>). This also justifies the need to have the spatial components of the entropy current (𝒥^i) on the horizon. Interestingly, we have seen for both the (2+1)-dimensional and (4+1)-dimensional CS theories that the reparametrization may lead to ambiguities in the entropy current components, see eq.(<ref>). These ambiguities may be present in the local description of 𝒥^v and 𝒥^i; however, they do not contribute to off-shell E_vv or to the total entropy when integrated over a compact horizon slice. Next, we have developed an algorithm to construct an entropy current consistent with the linearized second law for a generic CS theory. It is like developing a formalism rather than working brute force with a particular example. In <ref>, we have shown that the Lagrangian density of any generic CS theory can be written as eq.(<ref>). Then, we have extended the formalism developed in <cit.> to make it applicable to CS theories. We have also used the covariant phase space formalism studied earlier in <cit.> to relate off-shell E_vv with pre-symplectic potential, Noether charge eq.(<ref>). We tracked the essential difference between CS theories and diffeomorphism invariant theories: the contribution of the non-covariant Ξ^μ (which is defined in eq.(<ref>)) to eq.(<ref>). By analyzing their expressions in our metric gauge, we finally obtained the entropy current in terms of the elements of covariant phase space formalism; see the final result in eq.(<ref>) and eq.(<ref>). In order to justify that the technical arguments indeed produce a consistent algorithm to construct the entropy current, in <ref>, we have computed the 𝒥^v and 𝒥^i for several examples of CS theories and checked that they exactly match the expressions obtained via brute force analysis. Some comments regarding further implications of our results and possible future directions are as follows. First, we must note that the setup to establish linearized second law can be used to argue for the physical process version of the first law. Previously, for model-specific theories, this has been worked out in <cit.>. For arbitrary diffeomorphism invariant theories, this has been established in <cit.>, see 5 therein, and in <cit.> to include the cases of non-minimally coupled matter fields. Mainly, the off-shell E_vv as mentioned in eq.(<ref>) is sufficient to extend the proof of the physical process version of the first law in CS theories. It is also straightforward to include a cosmological constant in our analysis. More precisely, the result involving the off-shell structure of E_vv, e.g., eq.(<ref>), remains unaffected due to the inclusion of a cosmological constant. This is easy to understand since the EoM should change as follows E_vv∼Λ g_vv, and in our horizon adapted coordinates, g_vv vanishes on the horizon. Thus, all our results can be directly applied to black holes in AdS space-time. Furthermore, our analysis can be directly applied to any Killing horizons, including cosmological horizons in de-Sitter space-times. For the examples of CS theories we considered, we see that the JKM ambiguity vanishes, which can be verified from the expressions of 𝒥^v. For the (2+1)-dimensional CS theory, it is zero till the quadratic order, see in eq.(<ref>), whereas for the (4+1)-dimensional CS theory, it is zero at the linear order, see in eq.(<ref>). However, in our abstract proof for the generic case, we have not seen any such obstruction, as there is a possible JKM piece ℬ_(0) which contributes to 𝒥^v of eq.(<ref>) through eq.(<ref>). It would be interesting to see if the vanishing of the JKM term in our explicit examples is a coincidence or if some universal statement regarding its existence of it can be made more abstractly. As mentioned in footnote <ref>, our algorithm to construct an entropy current is valid only for U(1) gauge fields. Since the analysis in <ref> crucially depends on having an abelian gauge field, it would be interesting to see if our proof can be generalized to include non-abelian gauge fields. For (2+1)-dimensional CS theory, when considered as an EFT, we have seen that the second law can be extended to quadratic order in the perturbations around the stationary black holes. However, recently, in <cit.>, a formalism has been developed to study the second law to quadratic orders for generic diffeomorphism invariant theories. The result of the (2+1)-dimensional CS theory is consistent with Lemma 3.1 and Lemma 4.1 of <cit.>. Furthermore, the reparameterization of 𝒥^v for both the theories (see eq.(<ref>) and eq.(<ref>)) is consistent with Proposition 1 of <cit.> which previously did not cover the case of CS Lagrangians. It would be interesting to see if Proposition 1 and Lemma 4.1 can be extended to include CS theories. Our analysis in <ref> suggests that at least the linear order analysis (a generalization of Lemma 3.1 of <cit.>) can be organized similarly to what has previously been done for diffeomorphism invariant theories. § ACKNOWLEDGEMENTS We thank Parthajit Biswas for the initial collaboration. We are especially grateful to Sayantani Bhattacharyya for various enlightening discussions and collaboration on related projects. We would like to thank Jyotirmoy Bhattacharya and Harvey Reall for their useful comments on our draft. We would also like to thank Diptarka Das, Anirban Dinda, S. Shankaranarayanan, and Yogesh Kumar Srivastava for useful discussions. PD would like to thank NISER Bhubaneshwar for their warm hospitality during a visit where partial progress of this work was presented in a talk. PD also thanks the organizers of FTAG 2023 for giving the opportunity to present the results of this work in a poster. PD duly acknowledges the Council of Scientific and Industrial Research (CSIR), New Delhi, for financial assistance through the Senior Research Fellowship (SRF) scheme. The work of NK is supported by a MATRICS grant (MTR/2022/000794) from the Science and Engineering Research Board (SERB), India. We acknowledge our debt to the people of India for their steady support of research in basic sciences. § INTRICATE DETAILS OF THE CALCULATIONS §.§ Review of constructing entropy current for diffeomorphism invariant theories of gravity In this Appendix, we will quickly summarize the major steps in the construction of entropy current for diffeomorphism invariant theories of gravity <cit.> of the form L = L(g_μν,R_μνρσ,D_α_1 R_μνρσ,D_(α_1D_α_2) R_μνρσ,…,ϕ,D_α_1ϕ,D_(α_1D_α_2)ϕ,…,F_μν,D_α_1 F_μν,…) . We argued on general boost weight arguments that structures of Θ^r, Q^rv and Q^ri take the form of eq.(<ref>). To further constrain the quantities in the RHS of eq.(<ref>), we must understand the structure of a generic covariant tensor with a positive boost weight. A typical covariant object with a boost weight w= a+1 >0 on the horizon r=0 takes the form (see eq.(3.13) of <cit.>) t^(k)_(a+1)\|_r=0 = T_(-k)∂^k+a+1_v T_(0)\|_r=0 + 𝒪(ϵ^2) . One can show that (see Appendix E of <cit.>) we can rearrange the ∂_v derivatives to recast it in the form given by Result:1 (see eq.(3.14) of <cit.>) t^(k)_(a+1) = ∂^a+1_v [ ∑_m=0^k-1 (-1)^m [^m+aC_m ] T_(-k+m)∂^(k-m)_v T_(0)] + (-1)^k [^k+aC_a] T_(0)∂^a+1_v T_(0) + 𝒪(ϵ^2) . If one includes U(1) gauge fields in the analysis, then F_vi and F_ri are additional quantities with non trivial boost weights. Thus, one has to include these in the above analysis of eq.(<ref>) carefully <cit.> (see eq.(6.17) and eq.(C.8) of <cit.>). Though we mention that eq.(<ref>) is valid for covariant tensors <cit.>, one can check that it is valid for Christoffel symbols as well. For the boost weight argument of eq.(<ref>), we can treat the Christoffel symbol as a tensor with one upper index and two lower indices. One can verify this statement from the expressions of Appendix <ref>. This will prove to be very useful for the CS theories that we are interested in. The proof follows by using the general structures of Θ^μ and Q^μρ derived for eq.(<ref>) in <cit.> and then implementing Result:1 of eq.(<ref>) in the terms of those expressions. Since Θ^μ is obtained from the variation of the Lagrangian in eq.(<ref>), it generically contains δ𝒮_α_1 α_2 …α_k where 𝒮 is a covariant tensor. In order to obtain eq.(<ref>), we had to use the fact that the variation is given by a diffeomorphism and thus δ = ℒ_ξ. Hence, in order to further process the terms in Θ^r, we have to use the input of diffeomorphism invariance to write (eq.(3.23) of <cit.>) δ𝒮_α_1 α_2 …α_k[δ g_αβ→ℒ_ξ g_αβ ] = ℒ_ξ𝒮_α_1 α_2 …α_k . This implies that the general structure of Θ^μ to be evaluated on horizon adapted coordinates is given by Θ^μ = 2 E^μναβ_R D_β( ℒ_ξ g_να) + ∑_k 𝒯^μα_1 α_2 …α_kℒ_ξ𝒮_α_1 …α_k . Here 𝒯 is a covariant tensor and E^μναβ_R is given by E^μναβ_R = LR_μναβ - D_ρ_1LD_ρ_1 R_μναβ + … + (-1)^m D_(ρ_1… D_ρ_m)LD_(ρ_1… D_ρ_m) R_μναβ , where L is the Lagrangian of the theory eq.(<ref>). The appearance of ℒ_ξ in eq.(<ref>) makes it clear that Θ^r is linear in v as in eq.(<ref>). One can now implement eq.(<ref>) in eq.(<ref>) to show that on the horizon r=0, Θ^r \|_r=0 = (1+ v ∂_v) 𝒜_(1) + v ∂^2_v ℬ_(0) . Here ℬ_(0) denotes the JKM ambiguity and it is 𝒪(ϵ) even though it has boost weight zero. This is because the ℬ_(0) takes the form of a product of two terms that are individually not boost-invariant: ℬ_(0)∼ X_(-k+m)∂^k-m_v Y_(0)∼𝒪(ϵ) . The general structure of Q^μν for diffeomorphism invariant theories is of the form <cit.>: Q^μν = W^μνρξ_ρ - 2 E^μναβ_R D_[αξ_β] . Following this, Q^rρ takes the form of eq.(<ref>) given by Q^rρ = Q^rρ + v W^rρ_v . Thus, the divergence of Q^rρ on the horizon r=0 is given by D_μ Q^rμ = 1√(h)∂_v ( √(h)Q^rv) + ∇_i Q^ri + v ∂_v ( ∇_i J^i_(1)) + (1 + v ∂_v) W^rv_v + 𝒪(ϵ^2) , where J^i_(1) is defined through W^ri_v = ∂_v J^i_(1) + 𝒪(ϵ^2) . We can now substitute eq.(<ref>) and eq.(<ref>) in eq.(<ref>) with Ξ^r = 0 to get 2 v E_vv = ( - Θ^r + D_μ Q^rμ) \|_r=0 = - 𝒜_(1) + 1√(h)∂_v ( √(h) Q^rv) + ∇_i Q^ri + W^rv_v + v ∂_v [ - 𝒜_(1) + W^rv_v + ∇_i J^i_(1) - ∂_v ℬ_(0)] + 𝒪(ϵ^2) . Since we have explicitly accounted for all the factors of v, we can compare the coefficients of v^0 and v of eq.(<ref>) to write 𝒜_(1) = 1√(h)∂_v ( √(h) Q^rv) + ∇_i Q^ri + W^rv_v , 2 E_vv = ∂_v [ - 𝒜_(1) + W^rv_v + ∇_i J^i_(1) - ∂_v ℬ_(0)] . We emphasize that eq.(<ref>) should be thought of as an identity rather than as an algebraic equation equating different powers of v. Once the factors of v are made explicit, eq.(<ref>) holds identically. Combining both the equations in eq.(<ref>) we finally get 2 E_vv\|_r=0 = - ∂_v ( 1√(h)∂_v [ √(h)( Q^rv + ℬ_(0)) ] + ∇_i [ Q^ri - J^i_(1)] ) + 𝒪(ϵ^2) . Here we have used the fact that crucially ℬ_(0)∼𝒪(ϵ) which is ∂^2_v ℬ_(0) = ∂_v (1√(h)∂_v [ √(h) ℬ_(0)] ) + 𝒪(ϵ^2) . From eq.(<ref>), we get the components of the entropy current to be 𝒥^v = - 12( Q^rv + ℬ_(0)) , and 𝒥^i = - 12( Q^ri - J^i_(1)) . The components of the current are U(1) gauge invariant if we consider U(1) gauge invariant Lagrangians <cit.>. This is because the structures of eq.(<ref>) are U(1) gauge invariant. This completes our review of the proof of the existence of entropy current for diffeomorphism invariant theories of gravity. §.§ Details of the calculation of Noether charge for Chern-Simons theories In this Appendix, we give the details of the calculation of Ξ^μ from eq(<ref>) and the details of the calculation of Q^μν from eq.(<ref>). §.§.§ Evaluating Ξ^μ: We start off with eq.(<ref>): δ_ξ L = ℒ_ξ L + LA_μ D_μΛ + LΓ^λ_μ_ν∂_μ∂_νξ^λ . The subscript ξ is used to indicate the variation under the combined diffeomorphism and U(1) gauge transformations eq.(<ref>). We can rearrange the non-diffeomorphism/U(1) gauge structures of eq.(<ref>): LA_μ D_μΛ = D_μ(LA_μΛ) - Λ D_μLA_μ . A similar integration by parts manipulation for the other term of eq.(<ref>) gives LΓ^λ_μ_ν∂_μ∂_νξ^λ = ∂_μ(LΓ^λ_μ_ν∂_νξ^λ) - (∂_νξ^λ) (∂_μLΓ^λ_μ_ν) = D_μ(LΓ^λ_μ_ν∂_νξ^λ) - Γ^τ_μ_τLΓ^λ_μ_ν∂_νξ^λ - (∂_νξ^λ) (∂_μLΓ^λ_μ_ν) = D_μ(LΓ^λ_μ_ν∂_νξ^λ) - 1/√(-g)(∂_νξ^λ) ∂_μ(√(-g)LΓ^λ_μ_ν) = D_μ(LΓ^λ_μ_ν∂_νξ^λ) - ∂_μ[ξ^λ/√(-g)∂_ν(√(-g)LΓ^λ_μ_ν) ] + ξ^λ∂_μ[1/√(-g)∂_ν(√(-g)LΓ^λ_μ_ν) ] = D_μ(LΓ^λ_μ_ν∂_νξ^λ - 1/√(-g)ξ^λ∂_ν(√(-g)LΓ^λ_μ_ν) ) + ξ^λ/√(-g)∂_μ∂_ν(√(-g)LΓ^λ_μ_ν) . Substituting eq.(<ref>) and eq.(<ref>) in eq.(<ref>), we get eq.(<ref>): δ_ξ(√(-g) L ) = √(-g) D_μ(ξ^μ L ) + √(-g) D_μΞ^μ - √(-g)Λ D_μLA_μ + ξ^λ∂_μ∂_ν(√(-g)LΓ^λ_μ_ν) . §.§.§ Evaluating Q^μν: We start off with the definition of Q^μν in eq.(<ref>): J^μ = 2 E^μ^νξ_ν + G^μ(A_νξ^ν + Λ) + Θ^μ - ξ^μ L - Ξ^μ . The current J^μ is conserved by definition and it gives Q^μν: J^μ = D_νQ^μ^ν . We now substitute eq.(<ref>) for δ g_αβ and δ A_ν in Θ^μ of eq.(<ref>) to get Θ^μ = (g^α^λLR^λ_β_μ_ν + g^α^λLR^λ_ν_μ_β - g^ν^λLR^λ_β_μ_α) D_ν(D_αξ_β + D_βξ_α) + 2 LF_μ_ν[ξ^λF_λ_ν + D_ν(A_λξ^λ + Λ) ] + 2 S^μ^α^β D_αξ_β . Making further simplifications, we get Θ^μ = D_ν(2 LR^α_β_μ_ν D_βξ^α) - 2 (D_βξ^α) D_νLR^α_β_μ_ν + 2 LR^α_β_ν_μR^α_β_ν_ηξ^η + 2 LF_μ_ν[ξ^λF_λ_ν + D_ν(A_λξ^λ + Λ) ] + 2 S^μ^α^β D_αξ_β . Collecting the terms in the expression of J^μ of eq.(<ref>) dependent on Λ, we have G^μΛ - LA_μΛ + 2 LF_μ_ν D_νΛ = 2 D_ν(LF_μ_νΛ) . This gives rise to the “gauge" contributions (the terms with the partial derivatives with respect to the gauge fields) of eq.(<ref>): J^μ_gauge = D_ν(2 LF_μ_ν(A_λξ^λ + Λ) ) + ξ^λ(LA_μA_λ + 2 LF_μ_νF_λ_ν) . The “metric" contribution (the terms with the partial derivatives with respect to the gravitational fields) of J^μ in eq.(<ref>) is: J^μ_metric = 2 E^μ^αξ_α - ξ^μ L + 2 S^μ^ν^α D_νξ_α - LΓ^λ_μ_ν∂_νξ^λ + 1/√(-g)ξ^λ∂_ν(√(-g)LΓ^λ_μ_ν) + (g^α^λLR^λ_β_μ_ν + g^α^λLR^λ_ν_μ_β - g^ν^λLR^λ_β_μ_α) D_ν(D_αξ_β + D_βξ_α) = 2 S^μ^ν^α D_νξ_α - 2 ξ_α D_νS^ν^μ^α + D_ν(2 LR^α_β_μ_ν D_βξ^α) - 2 (D_βξ^α) D_νLR^α_β_μ_ν + 2 LR^α_β_ν_μR^α_β_ν_ηξ^η - LΓ^λ_μ_ν∂_νξ^λ + 1/√(-g)ξ^λ∂_ν(√(-g)LΓ^λ_μ_ν) - 2 g^μ^νLg^ν^λξ^λ = D_ν(2 LR^α_β_μ_ν D_βξ^α + ξ_α(S^μ^ν^α - S^ν^μ^α) ) + (S^μ^ν^α + S^ν^μ^α) D_νξ_α - ξ_α D_ν(S^μ^ν^α + S^ν^μ^α) - 2 (D_βξ^α) D_νLR^α_β_μ_ν + 2 LR^α_β_ν_μR^α_β_ν_ηξ^η - LΓ^λ_μ_ν∂_νξ^λ + 1/√(-g)ξ^λ∂_ν(√(-g)LΓ^λ_μ_ν) - 2 g^μ^νLg^ν^λξ^λ . We use S^μ^ν^α + S^ν^μ^α = g^α^λ(LΓ^λ_ν_μ + D_β[LR^λ_ν_μ_β + LR^λ_μ_ν_β] ) , to simplify J^μ_metric as J^μ_metric = D_ν(2 LR^α_β_μ_ν D_βξ^α + ξ_α(S^μ^ν^α - S^ν^μ^α) + ξ^λ D_β[LR^λ_μ_ν_β - LR^λ_ν_μ_β] ) + ξ^λ(2 LR^α_β_ν_μR^α_β_ν_λ - R^μ_η_α_βLR^λ_η_α_β - R_α_β_λ^ηLR^η_μ_α_β) + ξ^λ(2 LΓ^η_μ_νΓ^η_ν_λ - Γ^μ_ν_ηLΓ^λ_η_ν - 2 g^μ^νLg^ν^λ) . Substituting eq.(<ref>) and eq.(<ref>) in eq.(<ref>), we get J^μ = D_νQ^μ^ν + ξ^λB^μ_λ , where Q^μ^ν = 2 LF_μ_ν(A_λξ^λ + Λ) + 2 LR^α_β_μ_ν D_βξ^α + ξ_α(S^μ^ν^α - S^ν^μ^α) + ξ^λ D_β[LR^λ_μ_ν_β - LR^λ_ν_μ_β] . This agrees with the result of eq.(<ref>). We also have B^μ_λ = 2 LR^α_β_ν_μR^α_β_ν_λ - R^μ_η_α_βLR^λ_η_α_β - R_α_β_λ^ηLR^η_μ_α_β + 2 LΓ^η_μ_νΓ^η_ν_λ - Γ^μ_ν_ηLΓ^λ_η_ν + LA_μA_λ + 2 LF_μ_νF_λ_ν - 2 g^μ^νLg^ν^λ . Taking the divergence of eq.(<ref>) and using the fact that J^μ is divergenceless by construction, we have B^μ_λ = 0 , since ξ is arbitrary. If we had worked with differential forms from the start like <cit.>, we would have obtained eq.(<ref>) automatically. We see that for explicit theories considered in <ref>, eq.(<ref>) is satisfied trivially by using certain identities. Since we work with the component form of the Lagrangian in eq.(<ref>), it is difficult to see those identities which typically involve the ϵ^α_1 …α_k tensor in the definition of a CS Lagrangian. §.§ Details of the gauge field dependence of the Chern-Simons Lagrangian In this Appendix, we give the details in the steps involved in starting from eq.(<ref>) to reach eq.(<ref>). Computing the derivative of eq.(<ref>) gives L_nA_μ = ∑_i=1^n ℒ^ν_1^⋯^ν_i-1^μ^ν_i+1^⋯^ν_n∏_j=1, j≠ i^n A_ν_j = n ℒ^μ^ν_1^⋯^ν_n-1∏_i=1^n-1A_ν_i , where the last equality follows because ℒ^ν_1^⋯^ν_n is totally symmetric in all its indices. This implies that D_μL_nA_μ = n (∏_i=1^n-1A_ν_i) (D_μℒ^μ^ν_1^⋯^ν_n-1) + n ℒ^μ^ν_1^⋯^ν_n-1∑_j=1^n-1((D_μA_ν_j) (∏_i=1, i≠ j^n-1A_ν_i) ) = n (∏_i=1^n-1A_ν_i) (D_μℒ^μ^ν_1^⋯^ν_n-1) + n (D_μA_ν) (∑_j=1^n-1ℒ^μ^ν_1^⋯^ν_j-1^ν^ν_j^⋯^ν_n-2(∏_i=1^n-2A_ν_i) ) = n (∏_i=1^n-1A_ν_i) (D_μℒ^μ^ν_1^⋯^ν_n-1) + n(n-1) ℒ^μ^ν^ν_1^⋯^ν_n-2(D_μA_ν) (∏_i=1^n-2A_ν_i) , where the last equality follows because ℒ^ν_1^⋯^ν_n is totally symmetric in all its indices. The Bianchi identity eq.(<ref>) implies that D_μL_nA_μ = 0 n D_μℒ^μ^ν_1^⋯^ν_n-1 = 0 and n(n-1) ℒ^μ^ν^ν_1^⋯^ν_n-2 = 0 , as A_λ and D_(μ A_ν) are independent functions, and ℒ^μ^ν^ν_1^⋯^ν_n-2 is totally symmetric. But, the second condition of eq.(<ref>) immediately implies that for n ≥ 2, L_n = 0 in eq.(<ref>). Thus, we need only concern ourselves with L_0, L_1 of eq.(<ref>). The first condition of eq.(<ref>) will allow us to greatly restrict the form of L_1. Firstly, ℒ^μ is gauge invariant, and thus it must be of the form ℒ^μ = ∑_n 𝒞^μ^ρ_1^σ_1^⋯^ρ_n^σ_n∏_i=1^n F_ρ_i_σ_i , where 𝒞^μ^ρ_1^σ_1^⋯^ρ_n^σ_n is independent of the U(1) gauge field, antisymmetric in (ρ_i, σ_i) for all i, and symmetric in pairs of (ρ_i, σ_i) and (ρ_j, σ_j) for any pair (i, j). This implies that D_μℒ^μ = ∑_n (D_μ𝒞^μ^ρ_1^σ_1^⋯^ρ_n^σ_n) (∏_i=1^n F_ρ_i_σ_i) + ∑_n ∑_j=1^n 𝒞^μ^ρ_1^σ_1^⋯^ρ_n^σ_n(D_μF_ρ_j_σ_j) (∏_i=1, i≠ j^n F_ρ_i_σ_i) = ∑_n (D_μ𝒞^μ^ρ_1^σ_1^⋯^ρ_n^σ_n) (∏_i=1^n F_ρ_i_σ_i) + ∑_n n 𝒞^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n-1^σ_n-1(D_μF_ν_λ) (∏_i=1^n-1F_ρ_i_σ_i) . Now, the first condition of eq.(<ref>) on L_1 gives D_μℒ^μ = 0. As F_ρ_σ, D_νF_ρ_σ are independent functions, this implies that D_μ𝒞^μ^ρ_1^σ_1^⋯^ρ_n^σ_n = 0 and 𝒞^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n-1^σ_n-1 is antisymmetric in (μ, ν, λ) . But, by the properties of 𝒞^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n-1^σ_n-1 in eq.(<ref>), the second condition of eq.(<ref>) immediately implies that we must have 𝒞^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n-1^σ_n-1 totally antisymmetric in all of its indices. Due to this, the first condition of eq.(<ref>) implies that 𝒞^μ^ρ_1^σ_1^⋯^ρ_n^σ_n of eq.(<ref>) has two possible choices 𝒞^μ^ρ_1^σ_1^⋯^ρ_n^σ_n = D_νℬ^ν^μ^ρ_1^σ_1^⋯^ρ_n^σ_n (i) 2n+1 < D a_g ϵ^μ^ρ_1^σ_1^⋯^ρ_n^σ_n (ii) 2n+1 = D where D is the dimension of spacetime and ℬ^ν^μ^ρ_1^σ_1^⋯^ρ_n^σ_n is independent of the U(1) gauge field, antisymmetric in (μ, ν), and thus antisymmetric in all indices, and a_g is a constant as D_μ a_g = 0. For Choice (i), eq.(<ref>) and eq.(<ref>) implies ℒ^μA_μ = A_ν∑_n=0^N(D_μℬ^μ^ν^ρ_1^σ_1^⋯^ρ_n^σ_n) (∏_i=1^n F_ρ_i_σ_i) = A_ν D_μ[∑_n=0^Nℬ^μ^ν^ρ_1^σ_1^⋯^ρ_n^σ_n(∏_i=1^n F_ρ_i_σ_i) ] = D_μ[A_ν∑_n=0^Nℬ^μ^ν^ρ_1^σ_1^⋯^ρ_n^σ_n(∏_i=1^n F_ρ_i_σ_i) ] - 1/2(F_μ_ν) ∑_n=0^Nℬ^μ^ν^ρ_1^σ_1^⋯^ρ_n^σ_n(∏_i=1^n F_ρ_i_σ_i) and eq.(<ref>) implies we have in general an extra term (when the number of indices are equal to the dimension of the spacetime) a_g ϵ^μ^ρ_1^σ_1^⋯^ρ_n^σ_nA_μ∏_i=1^n F_ρ_i_σ_i and it is clear that this term can only exist in odd dimensions. Choice (ii) of eq.(<ref>) is non-trivial only when n ≥ 1. We can now use eq.(<ref>) and eq.(<ref>) in eq.(<ref>) to arrive at eq.(<ref>). Though choice (i) of eq.(<ref>) seemingly suggests that this term exists only in even dimensions, it should be noted that there are hidden indices in the gravitational sector that haven't been accounted for. CS Lagrangians are defined in odd dimensions only. We didn't need to consider the gravitational Bianchi identity of eq.(<ref>) for arguing the entropy current structure. §.§ The total derivative term of the Chern-Simons Lagrangian In this Appendix, we will analyze the total derivative term of eq.(<ref>) which is of the form D_μℒ^μ. While this doesn't contribute to the equations of motion E_μν and G_μ, it does contribute to Θ^μ and Q^μν. Thus, it may potentially contribute to the entropy current through eq.(<ref>). So we carefully analyze this term here. The variation of the action gives δ(√(-g) D_μℒ^μ) = ∂_μδ(√(-g)ℒ^μ) = √(-g) D_μ(δℒ^μ + 1/2ℒ^μg^α^βδg_α_β) . Following the analysis of <ref>, this can be written in terms of the partial derivatives of ℒ^μ as δℒ^μ + 1/2ℒ^μg^α^βδg_α_β = 1/√(-g)(√(-g)δℒ^μ) = ℰ^μ^ρ^σδg_ρ_σ + 𝒢^μ^νδA_ν + D_νθ^μ^ν , where 𝒢^μ^ν = ℒ^μA_ν + 2 D_λℒ^μF_ν_λ , ℰ^μ^ρ^σ = 1/2ℒ^μg^ρ^σ - g^ρ^αg^σ^βℒ^μg^α^β - D_α𝒮^μ^α^ρ^σ , θ^μ^ν = 2 ℒ^μF_ν_λδA_λ + 2 ℒ^μR^α_β_ν_λδΓ^α_β_λ + 𝒮^μ^ν^ρ^σδg_ρ_σ , with, 𝒮^μ^ν^ρ^σ = 1/2 D_β[g^ρ^α(ℒ^μR^α_σ_ν_β + ℒ^μR^α_ν_σ_β) + g^σ^α(ℒ^μR^α_ρ_ν_β + ℒ^μR^α_ν_ρ_β) . . - g^ν^α(ℒ^μR^α_σ_ρ_β + ℒ^μR^α_ρ_σ_β) ] + 1/2(g^ρ^αℒ^μΓ^α_σ_ν + g^σ^αℒ^μΓ^α_ρ_ν - g^ν^αℒ^μΓ^α_σ_ρ) . Thus, the total derivative term has zero equation of motion, but a Θ^μ equalling Θ^μ_t = δℒ^μ + 1/2ℒ^μg^α^βδg_α_β = ℰ^μ^ρ^σδg_ρ_σ + 𝒢^μ^νδA_ν + D_νθ^μ^ν . Additionally, as we have ℒ_ξℒ^μ = ξ^ν D_νℒ^μ - ℒ^ν D_νξ^μ = D_ν(ℒ^μξ^ν - ℒ^νξ^μ) - ℒ^μ D_νξ^ν + ξ^μ D_νℒ^ν , we get δ(√(-g) D_μℒ^μ) = √(-g) D_μ(ξ^μ D_νℒ^ν) + √(-g) D_μ((δ - ℒ_ξ) ℒ^μ) . Thus from eq.(<ref>), the Ξ^μ term equals Ξ^μ_t = δℒ^μ - ℒ_ξℒ^μ = ℒ^μA_ν D_νΛ + ℒ^μΓ^τ_ρ_σ∂^2_ρ_σξ^τ . Finally, from eq.(<ref>) D_ν Q^μν_t = 2 E^μ^νξ_ν + G^μ(A_νξ^ν + Λ) + Θ^μ - ξ^μ L - Ξ^μ = δℒ^μ + ℒ^μ D_νξ^ν - (δ - ℒ_ξ) ℒ^μ - ξ^μ D_νℒ^ν = D_ν(ℒ^μξ^ν - ℒ^νξ^μ) , where the last equality follows by the relation on ℒ_ξℒ^μ derived above. This gives a Noether charge Q^μν_t = ℒ^μξ^ν - ℒ^νξ^μ . Hence, we see that a total derivative term has zero equations of motion, but non-zero Θ^μ eq.(<ref>), non zero Ξ^μ eq.(<ref>), and Noether charge eq.(<ref>). §.§ Details of the structure of Ξ^μ In this appendix, we will prove that q^μν defined through Ξ^μ_ℒ of eq.(<ref>) is linear v and is U(1) gauge invariant. To prove this, we will crucially use the general form of the Ξ term eq.(<ref>) Ξ^μ_ℒ = ℒΓ^λ_μ_ν∂_νξ^λ - 1/√(-g)ξ^λ∂_ν(√(-g)ℒΓ^λ_μ_ν) §.§.§ Linearity in v: We first note that Ξ in eq.(<ref>) is linear in ξ: Ξ(ξ_1 + ξ_2) = Ξ(ξ_1) + Ξ(ξ_2). As applying D_ν in eq.(<ref>) does not cause any explicit factors of ξ to appear, they must come, in our gauge, only from q^μ^ν. Additionally, as ∂^2_μ_νξ^λ = 0 in our gauge, the most general form that q^μ^ν can take is q^μ^ν = 𝒦^μ^ν_λξ^λ + ℒ^μ^ν^α_β∂_αξ^β Thus, we must have q^μ^ν = q̃^μ^ν + v w_v^μ^ν , where q̃, w have no explicit factors of v. §.§.§ Establishing gauge invariance: We know that Ξ^μ of eq.(<ref>) is U(1) gauge invariant because ℒ is U(1) gauge invariant. However, it is not entirely obvious that q^μν defined through eq.(<ref>) is U(1) gauge invariant. This is because we pull out an overall D_ν in eq.(<ref>). Thus, q^μν may not be gauge invariant if we pull out a D_ν from F_να. We thus have to investigate the gauge invariance of q^μν carefully. We will prove that q^μν of eq.(<ref>) is U(1) gauge invariant up to a total derivative. The analysis is similar in spirit to how we analyzed the gauge dependent terms in the CS Lagrangian in <ref> and Appendix <ref>. The most general form of q^μν at the horizon consists of sums of the form q_n^μ^ν = 𝒬^μ^ν^λ_1^⋯^λ_n∏_i=1^n A_λ_i , where 𝒬^μ^ν^λ_1^⋯^λ_n is totally symmetric in the λ_i indices, antisymmetric in the (μ, ν) indices, U(1) gauge invariant, and linear in ξ because of eq.(<ref>). Taking the divergence of eq.(<ref>), D_νq_n^μ^ν = (D_ν𝒬^μ^ν^λ_1^⋯^λ_n) (∏_i=1^n A_λ_i) + ∑_j=1^n 𝒬^μ^ν^λ_1^⋯^λ_n(D_νA_λ_j) (∏_i=1, i≠ j^n A_λ_i) = (D_ν𝒬^μ^ν^λ_1^⋯^λ_n) (∏_i=1^n A_λ_i) + n 𝒬^μ^ν^λλ_1^⋯^λ_n-1(D_νA_λ) (∏_i=1^n-1A_λ_i) . Now, the functions A_λ and D_(νA_λ) are gauge non invariant. Thus, for D_νq^μ^ν = Ξ^μ of eq.(<ref>) to be gauge invariant, we must have 𝒬^μ^(ν^λ)^λ_1^⋯^λ_n = 0 . That is, 𝒬^μ^ν^λ^λ_1^⋯^λ_n must be antisymmetric in (ν, λ). This implies that 𝒬^μ^ν^λ^λ_1^⋯^λ_n = - 𝒬^μ^λ^ν^λ_1^λ_2^⋯^λ_n = - 𝒬^μ^λ_1^ν^λ^λ_2^⋯^λ_n = 𝒬^μ^λ_1^λ^ν^λ_2^⋯^λ_n = 𝒬^μ^λ^λ_1^ν^λ_2^⋯^λ_n , 𝒬^μ^ν^λ^λ_1^⋯^λ_n = 𝒬^μ^ν^λ_1^λ^⋯^λ_n = - 𝒬^μ^λ^λ_1^ν^⋯^λ_n . Hence, we get 𝒬^μ^ν^λ_1^⋯^λ_n = 0 for n ≥ 2 . This is entirely analogous eq.(<ref>). Using this in the first term of the second step of eq.(<ref>), we get D_ν𝒬^μ^ν^λ = 0 . eq.(<ref>) can be used to greatly constrain the form of q^μν by an analysis similar to eq.(<ref>) and eq.(<ref>). To see this, first note that 𝒬^μ^ν^λ, being gauge invariant, has the general form 𝒬^μ^ν^λ = ∑_n ℳ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_n∏_i=1^n F_ρ_i_σ_i , where ℳ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_n is independent of the U(1) gauge field, antisymmetric in (ρ_i, σ_i) for all i, symmetric in pairs of (ρ_i, σ_i) and (ρ_j, σ_j) for any pair (i, j), and linear in ξ. Taking the derivative of eq.(<ref>), we get D_ν𝒬^μ^ν^λ = ∑_n (D_νℳ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_n) (∏_i=1^n F_ρ_i_σ_i) + ∑_n n ℳ^μ^ν^λ^ρ^σ^ρ_1^σ_1^⋯^ρ_n-1^σ_n-1(D_νF_ρ_σ) (∏_i=1^n-1F_ρ_i_σ_i) . As F_ρ_σ, D_νF_ρ_σ are independent functions, D_ν𝒬^μ^ν^λ = 0 implies ℳ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_n = D_τ𝒩^τ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_n (i) 2n + 3 < D 𝒮 ϵ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_n (ii) 2n+3 = D where 𝒩^τ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_n is totally antisymmetric and independent of the U(1) gauge field, and 𝒮 is a constant as D_μ𝒮 = 0. This equation is entirely analogous to eq.(<ref>). But, as ℳ is linear in ξ because of eq.(<ref>), we must have 𝒩, 𝒮 be linear in ξ. Thus, 𝒮 = 0 in case (ii) of eq.(<ref>), and we get a non-zero answer from case (i) of eq.(<ref>): A_λ𝒬^μ^ν^λ = ∑_n A_λ(D_τ𝒩^τ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_n) (∏_i=1^n F_ρ_i_σ_i) = D_τ[∑_n A_λ𝒩^τ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_n∏_i=1^n F_ρ_i_σ_i] - 1/2∑_n 𝒩^τ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_nF_τ_λ∏_i=1^n F_ρ_i_σ_i . Substituting the above equation in eq.(<ref>), we have q^μ^ν = 𝒬^μ^ν + D_τ(∑_n=0^N-2A_λ𝒩^τ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_n∏_i=1^n F_ρ_i_σ_i) , where 𝒬^μ^ν is gauge invariant, and 𝒩^τ^μ^ν^λ^ρ_1^σ_1^⋯^ρ_n^σ_n is independent of the U(1) gauge field and totally antisymmetric. We see that q^μν defined by eq.(<ref>) and eq.(<ref>) is U(1) gauge invariant up to an incosequential total derivative term that drops out from eq.(<ref>). This completes our proof that q^μν defined through eq.(<ref>) is linear in v and U(1) gauge invariant up to a total derivative. §.§ Details of the intermediary calculations §.§.§ Analysis of the pure gauge term in eq.(<ref>): The result of eq.(<ref>) is obtained by [D_ρ Q^rρ_g - Θ^r_g + Ξ^r_g ]_r=0 - G^r_g (A_ρξ^ρ + Λ) = D_ρ[2 L_gF_r_ρ[v A_v + Λ] ] - 2 L_gF_r_ρ[v F_v_ρ + D_ρ(v A_v + Λ) ] + L_gA_rΛ -[L_gA_r + 2 D_ρL_gF_r_ρ] [v A_v + Λ] = - v (L_gA_rA_v + 2 L_gF_r_iF_v_i) . The result of eq.(<ref>) is obtained by [D_ρ Q^rρ_g - Θ^r_g + Ξ^r_g ]_r=0 - G^r_g (A_ρξ^ρ + Λ) = - v (a_g ϵ^r^ρ_1^σ_1^⋯^ρ_N^σ_NA_v∏_i=1^N F_ρ_i_σ_i + 2 N a_g ϵ^μ^r^i^ρ_1^σ_1^⋯^ρ_N-1^σ_N-1A_μF_v_i∏_i=1^N-1F_ρ_i_σ_i) = - v (2N a_g ϵ^r^v^i^j_1^k_1^⋯^j_N-1^k_N-1A_vF_v_i∏_a=1^N-1F_j_a_k_a. . + 2 N a_g ϵ^v^r^i^j_1^k_1^⋯^j_N-1^k_N-1A_vF_v_i∏_a=1^N-1F_j_a_k_a) = 0 This result is exact even up to 𝒪(ϵ^2). §.§.§ Contributions of the “gauge" terms on the horizon: The result of eq.(<ref>) is obtained by [D_ρ Q^rρ_ℒ - Θ^r_ℒ]_gauge - G^r_ℒ(A_ρξ^ρ + Λ) = D_ρ[2 ℒF_r_ρ[v A_v + Λ] ] - 2 ℒF_r_ρ[v F_v_ρ + D_ρ(v A_λ + Λ) ] - [ℒA_r + 2 D_ρℒF_r_ρ] [v A_v + Λ] = - ( ∂ℒ∂ A_r ( v A_v + Λ) + 2 ℒF_r_i vF_v_i) = 𝒪(ϵ^2) . Since ℒ is U(1) gauge invariant, the first term of the final step is zero. The second term of the final step becomes 𝒪(ϵ^2) from boost weight analysis. §.§.§ Θ^r of “gravity" terms on the horizon: Here we give the details of the calculation of Θ^r for the “gravity" terms of eq.(<ref>). We show that it is of the form given by eq.(<ref>). We first use eq.(<ref>) in the “gravity" terms of Θ^r in eq.(<ref>) to get Θ^r_ℒ_gravity = 2 ℒR^α_β_r_νδΓ^α_β_ν +S^rαβ_ℒδg_α_β = E^rαβν_ℒ D_νδg_α_β + S^rαβ_ℒδg_α_β = D_ν(E^rαβν_ℒδg_α_β) + (S^rαβ_ℒ - D_ν E^rαβν_ℒ) δg_α_β . Now, we have for any U^r^α^β on the horizon r=0 U^r^α^βδg_α_β = v U^r^m^n∂_vh_m_n = 𝒪(ϵ^2 ) . Defining P^μ^ν = E^μαβν_ℒδg_α_β , and using eq.(<ref>) in eq.(<ref>), we get Θ^r_ℒ_gravity = D_ρP^r^ρ + 𝒪(ϵ^2 ) . From eq.(<ref>) and eq.(<ref>), it is clear that P^r^v and P^r^r are 𝒪(ϵ) whereas P^r^i is 𝒪(ϵ^2 ) at the horizon. Using this, we can compute D_ρP^r^ρ = ∂_ρP^r^ρ + Γ^r_λ_ρP^λ^ρ + Γ^ρ_λ_ρP^r^λ = ∂_rP^r^r + ∂_vP^r^v + 𝒪(ϵ^2) . This can finally be further simplified by using E^rmnr_ℒ = ∂_vJ_(1)^m^n + 𝒪(ϵ^2) (which follows from generic boost weight argument of eq.(<ref>)) as ∂_vP^r^v = (1 + v ∂_v) (E^rmnv_ℒ∂_vh_m_n) , ∂_rP^r^r = E^rmnr_ℒ(v ∂^2_v_r - ∂_r) h_m_n = - (1 + v ∂_v) (E^rmnr_ℒ∂_rh_m_n) + v ∂_v(E^rmnr_ℒ∂_rh_m_n) + v E^rmnr_ℒ∂^2_v_rh_m_n = - (1 + v ∂_v) (E^rmnr_ℒ∂_rh_m_n) + v ∂_v((∂_vJ_(1)^m^n) (∂_rh_m_n) + J_(1)^m^n∂^2_v_rh_m_n) + 𝒪(ϵ^2 ) = - (1 + v ∂_v) (E^rmnr_ℒ∂_rh_m_n) + v ∂^2_v(J_(1)^m^n∂_rh_m_n) + 𝒪(ϵ^2 ) . Substituting eq.(<ref>) in eq.(<ref>), we finally get eq.(<ref>) Θ^r_ℒ_gravity = (1 + v ∂_v) 𝒜_(1) + v ∂^2_vℬ_(0) + 𝒪(ϵ^2 ) , where ℬ_(0) is clearly 𝒪(ϵ) because it is of the form eq.(<ref>) and 𝒜_(1), ℬ_(0) are U(1) gauge invariant. §.§ Useful quantities in our gauge The gauge choice we work with is eq.(<ref>). The horizon is located at r=0. The inverse metric components are given by: g^rr = r^2 X(r,v,x^i) + r^2 ω^i (r,v,x^i) ω_i (r,v,x^i) = r^2 X + r^2 ω^2 g^ri = - r ω^i g^rv = 1 g^ij = h^ij g^vv = g^vi =0 We define the following (extrinsic curvature) quantities: K_ij = 12∂_v h_ijK_ij = 12∂_r h_ij K^ij = -12∂_v h^ijK^ij = - 12∂_r h^ij K = 12 h^ij∂_v h_ij = 1√(h)∂_v √(h)K = 12h^ij∂_r h_ij = 1√(h)∂_r √(h) The Christofell symbols for the metric are derived to be: Γ^v_vv = 12(2r X + r^2 ∂_r X) Γ^v_vr = 0 Γ^v_vi = -12(ω_i + r ∂_r ω_i) Γ^r_vv = 12(2r^3 X^2 + 2 r^3 X ω^2 + r^4 X ∂_r X + r^4 ω^2 ∂_r X - r^2 ∂_v X - 2 r^2 ω^i ∂_v ω_i - r^3 ω^i ∂_i X) Γ^r_vr = - 12(2rX + r^2 ∂_r X + r ω^2 + r^2 ω^i ∂_r ω_i) Γ^r_vi = -12(r^3 X ∂_r ω_i + r^3 ω^2 ∂_r ω_i + r^2 X ω_i + r^2 ω^2 ω_i + r^2 ∂_i X + r^2 ω^j ∂_i ω_j - r^2 ω^j ∂_j ω_i) - r ω^j K_ij Γ^i_vv = 12(-2r^2 ω^i X - r^3 ω^i ∂_r X + 2 h^ijr ∂_v ω_j + r^2 h^ij∂_j X) Γ^i_vj = 12rω^i(ω_j + r ∂_r ω_j) + 12h^ik(r ∂_j ω_k - r ∂_k ω_j) + h^ik K_jk Γ^i_vr = 12h^ij(r ∂_r ω_j + ω_j) Γ^v_rr =0 Γ^v_ri=0 Γ^v_ij = - K_ijΓ^r_rr = 0 Γ^i_rr = 0 Γ^r_ri = - r ω^j K_ij + 12(ω_i + r ∂_r ω_i) Γ^r_ij = 12(r ∂_i ω_j + r ∂_j ω_i) - r ω_k Γ̂^k_ij - (r^2 X + r^2 ω^2) K_ij - K_ij Γ^i_rj = h^ikK_jkΓ^i_jk = r ω^i K_jk + Γ̂^i_jk where Γ̂^i_jk is the Christoffel symbol with respect to the induced metric on the horizon h_ij. The relevant expressions for curvature components at the horizon is taken from <cit.>: R_rvrv = X + 14ω^2 R_vjvr = 12(∂_v ω_j + ω^k K_jk) R_vlvm = - ∂_v K_lm + K_ln K^n_m R_rv = -X - 12ω^2 - ∂_r K - K_ij K^ij + 12∇^i ω_i R_jv = - 12∂_v ω_j + ∇_n K^n_j - ∇_j K - 12ω_j K R_vv = - ∂_v K - K_mn K^mn R = R̂ - 2 X -32ω^2 - 4 ∂_r K + 2 (∇^i ω_i) -2 K_ij K^ij - 2 K K JHEP
http://arxiv.org/abs/2306.07376v3	20230612190504	A framework unifying some bijections for graphs and its connection to Lawrence polytopes	[ "Changxin Ding" ]	math.CO	[ "math.CO" ]	Bijections and Lawrence polytope]A framework unifying some bijections for graphs and its connection to Lawrence polytopes Changxin Ding]Changxin Ding Georgia Institute of Technology School of Mathematics Atlanta, GA 30332-0160 [email protected] Let G be a connected graph. The Jacobian group (also known as the Picard group or sandpile group) of G is a finite abelian group whose cardinality equals the number of spanning trees of G. The Jacobian group admits a canonical simply transitive action on the set 𝒢(G) of cycle-cocycle reversal classes of orientations of G. Hence one can construct combinatorial bijections between spanning trees of G and 𝒢(G) to build connections between spanning trees and the Jacobian group. The BBY bijections and the Bernardi bijections are two important examples. In this paper, we construct a new family of such bijections that include both. Our bijections depend on a pair of atlases (different from the ones in manifold theory) that abstract and generalize certain common features of the two known bijections. The definitions of these atlases are derived from triangulations and dissections of the Lawrence polytopes associated to G. The acyclic cycle signatures and cocycle signatures used to define the BBY bijections correspond to regular triangulations. Our bijections can extend to subgraph-orientation correspondences. Most of our results hold for regular matroids. We present our work in the language of fourientations, which are a generalization of orientations. [ [ July 31, 2023 ================= Key words: sandpile group; cycle-cocycle reversal class; Lawrence polytope; triangulation; dissection; fourientation Declarations of interest: none § INTRODUCTION In this introduction, we provide all of the relevant definitions and main results. §.§ Overview Given a connected graph G, we build a new family of bijections between the set 𝒯(G) of spanning trees of G and the set 𝒢(G) of equivalence classes of orientations of G up to cycle and cocycle reversals. The new family of bijections includes the BBY bijection (also known as the geometric bijection) constructed by Backman, Baker, and Yuen <cit.>, and the Bernardi bijection[The Bernardi bijection in <cit.> is a subgraph-orientation correspondence. In this paper, by the Bernardi bijection we always mean its restriction to spanning trees.] in <cit.>. These bijections are closely related to the Jacobian group (also known as the Picard group or sandpile group) Jac(G) of G. The group Jac(G) and the set 𝒯(G) of spanning trees are equinumerous. Recently, many efforts have been devoted to making 𝒯(G) a torsor for Jac(G), i.e., defining a simply transitive action of Jac(G) on 𝒯(G). In <cit.>, Baker and Wang interpreted the Bernardi bijection as a bijection between 𝒯(G) and break divisors. Since the set of break divisors is a canonical torsor for Jac(G), the Bernardi bijection induces the Bernardi torsor. In <cit.>, Yuen defined the geometric bijection between 𝒯(G) and break divisors of G. Later, this work was generalized in <cit.> where Backman, Baker, and Yuen defined the BBY bijection between 𝒯(G) and the cycle-cocycle reversal classes 𝒢(G). The set 𝒢(G) was introduced by Gioan <cit.> and is known to be a canonical torsor for Jac(G) <cit.>. Hence any bijection between 𝒯(G) and 𝒢(G) makes 𝒯(G) a torsor. From the point of view in <cit.>, replacing break divisors with 𝒢(G) provides a more general setting. In particular, we may also view the Bernardi bijection as a bijection between 𝒯(G) and 𝒢(G) and define the Bernardi torsor. Our work put all the above bijections in the same framework. It is surprising because the BBY bijection and the Bernardi bijection rely on totally different parameters. The main ingredients to define the BBY bijection are an acyclic cycle signature σ and an acyclic cocycle signature σ^* of G. The BBY bijection sends spanning trees to (σ,σ^)-compatible orientations, which are representatives of 𝒢(G). The Bernardi bijection relies on a ribbon structure on the graph G together with a vertex and an edge as initial data. Although for planar graphs, the Bernardi bijection becomes a special case of the BBY bijection, they are different in general <cit.>. The main ingredients to define our new bijections are a triangulating atlas and a dissecting atlas of G. These atlases (different from the ones in manifold theory) abstract and generalize certain common features of the two known bijections. They are derived from triangulations and dissections of the Lawrence polytopes associated to graphs. The acyclic cycle signatures and cocycle signatures used to define the BBY bijections correspond to regular triangulations. Our bijections extend to subgraph-orientation correspondences. The construction is similar to the one that extends the BBY bijection in <cit.>. The extended bijections have nice specializations to forests and connected subgraphs. Our results are also closely related to and motivated by Kalmán's work <cit.>, Kalmán and Tóthmérész's work <cit.>, and Postnikov's work <cit.> on root polytopes of hypergraphs, where the hypergraphs specialize to graphs, and the Lawrence polytopes generalize the root polytopes in the case of graphs. Most of our results hold for regular matroids as in <cit.>. Regular matroids are a well-behaved class of matroids which contains graphic matroids and co-graphic matroids. The paper will be written in the setting of regular matroids. We present our theory using the language of fourientations, which are a generalization of orientations introduced by Backman and Hopkins <cit.>. Our paper is organized as follows. <ref> We review some basics of regular matroids. <ref> We introduce fourientations. <ref> We use fourientations to build the framework: a pair of atlases and the induced map. We also recall the BBY bijection and the Bernardi bijection as examples. <ref> We define triangulating atlases and dissecting atlases and present our bijections. <ref> We use our theory to study signatures. In particular, we generalize acyclic signatures to triangulating signatures. <ref> We build the connection between the geometry of the Lawrence polytopes and the combinatorics of the regular matroid. <ref> We explain the motivation by showing how our work is related to <cit.>. <ref> We prove the results in Section <ref> except the two examples. <ref> We prove the results in Section <ref> and the two examples in Section <ref>. <ref> We prove the results in Section <ref>. §.§ Notation and terminology: regular matroids In this section, we introduce the definition of regular matroids, signed circuits, signed cocircuits, orientations, etc; see also <cit.> and <cit.>. We assume that the reader is familiar with the basic theory of matroids; some standard references include <cit.>. A matrix is called totally unimodular if every square submatrix has determinant 0, 1, or -1. A matroid is called regular if it can be represented by a totally unimodular matrix over ℝ. Let ℳ be a regular matroid with ground set E. We call the elements in E edges. Without loss of generality, we may assume ℳ is represented by an r× n totally unimodular matrix M, where r=rank(M) and n=\|E\|. Here we require r>0 to avoid an empty matrix. For the case r=0, most of our results are trivially true. For any circuit C of the regular matroid ℳ, there are exactly two {0, ± 1}-vectors in _ℝ(M) with support C. We call them signed circuits of ℳ, typically denoted by C. Dually, for any cocircuit C^, there are exactly two {0, ± 1}-vectors in _ℝ(M^T) with support C^. We call them signed cocircuits of ℳ, typically denoted by C^. The notions of signed circuit and signed cocircuit are intrinsic to ℳ, independent of the choice of M up to reorientations. By a reorientation, we mean multiplying some columns of M by -1. For the proofs, see <cit.>. These signed circuits make ℳ an oriented matroid <cit.>, so regular matroids are in particular oriented matroids. It is well known that the dual matroid ℳ^* of a regular matroid ℳ is also regular. There exists a totally unimodular matrix M^_(n-r)× n such that the signed circuits and signed cocircuits of ℳ^ are the signed cocircuits and signed circuits of ℳ, respectively. For the details, see <cit.>. The matrix M^* should be viewed as a dual representation of M in addition to a representation of ℳ^. In particular, if we multiply some columns of M by -1, then we should also multiply the corresponding columns of M^_(n-r)× n by -1. For any edge e∈ E, we define an arc e of ℳ to be an n-tuple in the domain ℝ^E of M, where the e-th entry is 1 or -1 and the other entries are zero. We make the notion of arcs intrinsic to ℳ in the following sense. If we multiply the e-th column of M by -1, then an arc e will have the opposite sign with respect to the new matrix, but it is still the same arc of ℳ. So, the matrix M provides us with a reference orientation for E so that we know for the two opposite arcs associated with one edge which one is labeled by “1”. The signed circuits C and signed cocircuits C^* can be viewed as sets of arcs in a natural way. An orientation of ℳ, typically denoted by O, is a set of arcs where each edge appears exactly once. It makes sense to write e∈C, C^⊆O, etc. In these cases we say the arc e is in the signed circuit C, the signed cocircuit C^ is in the orientation O, etc. Now we recall the notion of circuit-cocircuit reversal (equivalence) classes of orientations of ℳ introduced by Gioan <cit.>. If C is a signed circuit in an orientation O of ℳ, then a circuit reversal replaces C with with the opposite signed circuit -C in O. The equivalence relation generated by circuit reversals defines the circuit reversal classes of orientations of ℳ. Similarly, we may define the cocircuit reversal classes. The equivalence relation generated by circuit and cocircuit reversals defines the circuit-cocircuit reversal classes. We denote by [O] the circuit-cocircuit reversal class containing O. It is proved in <cit.> that the number of circuit-cocircuit reversal classes of ℳ equals the number of bases of ℳ. Let B be a basis of ℳ and e be an edge. If e∉ B, then we call the unique circuit in B∪{e} the fundamental circuit of e with respect to B, denoted by C(B,e); if e∈ B, then we call the unique cocircuit in (E\ B)∪{e} the fundamental cocircuit of e with respect to B, denoted by C^(B,e). Graphic matroids are important examples of regular matroids. Let G be a connected finite graph with nonempty edge set E, where loops and multiple edges are allowed. By fixing a reference orientation of G, we get an oriented incidence matrix of G. By deleting any row of the matrix, we get a totally unimodular matrix M of full rank representing the graphic matroid ℳ_G associated to G; see <cit.> for details. Then edges, bases, signed circuits, signed cocircuits, arcs, orientations, and circuit-cocircuit reversal classes of ℳ_G are edges, spanning trees, directed cycles, directed cocycles (bonds), arcs, orientations, and cycle-cocycle reversal classes of G, respectively. §.§ Notation and terminology: fourientations It is convenient to introduce our theory in terms of fourientations. Fourientations of graphs are systematically studied by Backman and Hopkins <cit.>. We will only make use of the basic notions but we define them for regular matroids. A fourientation F of the regular matroid ℳ is a subset of the set of all the arcs. Symbolically, F⊆{±e: e∈ E}. Intuitively, a fourientation is a choice for each edge of ℳ whether to make it one-way oriented, leave it unoriented, or biorient it. We denote by -F the fourientation obtained by reversing all the arcs in F. In particular, the bioriented edges remain bioriented. We denote by F^c the set complement of F, which is also a fourientation. Sometimes we use the notation -F^c, which switches the unoriented edges and the bioriented edges in F. See Figure <ref> for examples of fourientations. A potential circuit of a fourientation F is a signed circuit C such that C⊆F. A potential cocircuit of a fourientation F is a signed cocircuit C^ such that C^⊆ -F^c. §.§ New framework: a pair of atlases (𝒜, 𝒜^) and the induced map f_𝒜,𝒜^* The BBY bijection studied in <cit.> relies upon a pair consisting of an acyclic circuit signature and an acyclic cocircuit signature. We will generalize this work by building a new framework where the signatures are replaced by atlases and the BBY bijection is replaced by a map f_𝒜,𝒜^. This subsection will introduce these new terminologies. Let B be a basis of ℳ. We call the edges in B internal and the edges not in B external. * An externally oriented basis B is a fourientation where all the internal edges are bioriented and all the external edges are one-way oriented. * An internally oriented basis B^* is a fourientation where all the external edges are bioriented and all the internal edges are one-way oriented. * An external atlas 𝒜 of ℳ is a collection of externally oriented bases B such that each basis of ℳ appears exactly once. * An internal atlas 𝒜^* of ℳ is a collection of internally oriented bases B^* such that each basis of ℳ appears exactly once. Given an external atlas 𝒜 (resp. internal atlas 𝒜^) and a basis B, by B (resp. B^) we always mean the oriented basis in the atlas although the notation does not refer to the atlas. For a pair of atlases (𝒜,𝒜^), we define the following map f_𝒜,𝒜^:{bases of ℳ} →{orientations of ℳ} B ↦B∩B^* (where B∈𝒜,B^∈𝒜^). We remark that, in the other direction, for any map f from bases to orientations, there exists a unique pair of atlases (𝒜,𝒜^) such that f=f_𝒜,𝒜^. So, the pair of atlases merely lets us view the map f from a different perspective. However, from the main results of this paper, one will see why this new perspective interests us. Now we put the BBY bijection and the Bernardi bijection in our framework. [Atlases 𝒜_σ,𝒜^_σ^ and the BBY map (bijection)] Here we assume readers are familiar with the basic terminologies related to signatures in <cit.>; for those who are new to this area, see Definition <ref>. Let σ be a circuit signature of ℳ. We may construct an external atlas 𝒜_σ from σ such that for each externally oriented basis B∈𝒜_σ, each external arc e∈B is oriented according to the orientation of the fundamental circuit C(B,e) in σ. Similarly, we may construct an internal atlas 𝒜^_σ^ from σ^* such that for each internally oriented basis B^∈𝒜^_σ^, each internal arc e∈B^ is oriented according to the orientation of the fundamental cocircuit C^(B,e) in σ^. Then when the two signatures are acyclic, the map f_𝒜_σ,𝒜^_σ^ is exactly the BBY map defined in <cit.>. [Atlases 𝒜_ℬ, 𝒜_q^* and the Bernardi map (bijection)] The Bernardi bijection is defined for a connected graph G equipped with a ribbon structure and with initial data (q,e), where q is vertex and e is an edge incident to the vertex; see <cit.> for details or see <cit.> for a nice introduction. Here we use an example (Figure <ref>) to recall the construction of the bijection in the atlas language. The Bernardi bijection is a map from spanning trees to certain orientations. The construction makes use of the Bernardi tour which starts with (q,e) and goes around a given tree B according to the ribbon structure. We may construct an external atlas 𝒜_ℬ of ℳ_G as follows. Observe that the Bernardi tour cuts each external edge twice. We orient each external edge toward the first-cut endpoint, biorient all the internal edges of B, and hence get an externally oriented basis B. All such externally oriented bases form the atlas 𝒜_ℬ. The internal atlas 𝒜_q^* of ℳ_G is constructed as follows. For any tree B, we orient each internal edge away from q, biorient external edges, and hence get B^∈𝒜_q^. We remark that 𝒜_q^* is a special case of 𝒜^_σ^, where σ^* is an acyclic cocycle signature <cit.>. The map f_𝒜_B,𝒜_q^* is exactly the Bernardi map. §.§ Bijections and the two atlases We will see in this subsection that the map f_𝒜,𝒜^* induces a bijection bases of ℳ and circuit-cocircuit reversal classes of ℳ when the two atlases satisfy certain conditions which we call dissecting and triangulating. Furthermore, we will extend the bijection as in <cit.>. The following definitions play a central role in our paper. Although the definitions are combinatorial, they were derived from Lawrence polytopes; see Section <ref>. Let 𝒜 be an external atlas and 𝒜^* be an internal atlas of ℳ. * We call 𝒜 dissecting if for any two distinct bases B_1 and B_2, the fourientation B_1∩(-B_2) has a potential cocircuit. * We call 𝒜 triangulating if for any two distinct bases B_1 and B_2, the fourientation B_1∩(-B_2) has no potential circuit. * We call 𝒜^* dissecting if for any two distinct bases B_1 and B_2, the fourientation (B_1^∩(-B_2^))^c has a potential circuit. * We call 𝒜^* triangulating if for any two distinct bases B_1 and B_2, the fourientation (B_1^∩(-B_2^))^c has no potential cocircuit. Being triangulating is stronger than being dissecting due to Lemma <ref>. Now we are ready to present the first main result in this paper. Given a pair of dissecting atlases ( 𝒜,𝒜^) of a regular matroid ℳ, if at least one of the atlases is triangulating, then the map f_𝒜,𝒜^:{bases of ℳ} →{circuit-cocircuit reversal classes of ℳ} B ↦ [B∩B^] is bijective, where [B∩B^] denotes the circuit-cocircuit reversal class containing the orientation B∩B^. [Example <ref> continued] One of the main results in <cit.> is that the BBY map induces a bijection between bases and circuit-cocircuit reversal classes. We will see that both 𝒜_σ and 𝒜^_σ^* are triangulating (Lemma <ref>). Thus Theorem <ref> recovers this result. [Example <ref> continued] Theorem <ref> also recovers the bijectivity of the Bernardi map for trees in <cit.>. In <cit.>, it is proved that the Bernardi map is a bijection between spanning trees and the q-connected outdegree sequences. Baker and Wang <cit.> observed that the q-connected outdegree sequences are essentially the same as the break divisors. Later in <cit.>, the break divisors are equivalently replaced by cycle-cocycle reversal classes. We will see that the external atlas 𝒜_B is dissecting (Lemma <ref>). The internal atlas 𝒜_q^* is triangulating because it equals 𝒜^_σ^ for some acyclic signature σ^. Hence the theorem applies. In <cit.>, the BBY bijection is extended to a bijection φ between subsets of E and orientations of ℳ in a canonical way. We also generalize this work by extending f_𝒜,𝒜^ to φ_𝒜,𝒜^. We will define a map φ_𝒜,𝒜^ from orientations to subgraphs such that φ_𝒜,𝒜^∘ f_𝒜,𝒜^ is the identity map, and hence φ_𝒜,𝒜^* extends f^-1_𝒜,𝒜^. We start with an orientation O. By Theorem <ref>, we get a basis B=f_𝒜,𝒜^^-1([O]). Since O and f_𝒜,𝒜^(B) are in the same circuit-cocircuit reversal class, one can obtain one of them by reversing disjoint signed circuits {C_i}_i∈ I and cocircuits {C_j^}_j∈ J in the other (see Lemma <ref>). Define φ_𝒜,𝒜^(O)=(B∪_i∈ IC_i)\_j∈ JC_j^. The amazing fact here is that φ_𝒜,𝒜^* is a bijection, and it has two nice specializations besides f^-1_𝒜,𝒜^. Fix a pair of dissecting atlases ( 𝒜,𝒜^) of ℳ with ground set E. Suppose at least one of the atlases is triangulating. (1) The map φ_𝒜,𝒜^:{orientations of ℳ} →{subsets of E} O ↦ (B∪_i∈ IC_i)\_j∈ JC_j^ is a bijection, where B is the unique basis such that f_𝒜,𝒜^(B)∈ [O], and the orientations f_𝒜,𝒜^(B) and O differ by disjoint signed circuits {C_i}_i∈ I and cocircuits {C_j^}_j∈ J. (2) The image of the independent sets of ℳ under the bijection φ^-1_𝒜,𝒜^ is a representative set of the circuit reversal classes of ℳ. (3) The image of the spanning sets of ℳ under the bijection φ^-1_𝒜,𝒜^* is a representative set of the cocircuit reversal classes of ℳ. We can apply Theorem <ref> to extend and generalize the Bernardi bijection; see Corollary <ref> for a formal statement. In <cit.>, the Bernardi bijection is also extended to a subgraph-orientation correspondence. However, Bernardi's extension is different from the bijection φ_𝒜_B,𝒜_q^* in Theorem <ref> in general. §.§ Signatures and the two atlases In Section <ref>, we have seen that acyclic signatures σ and σ^* induce triangulating atlases 𝒜_σ and 𝒜^_σ^, respectively, and hence we may apply our main theorems to the BBY bijection. In this section, we will define a new class of signatures, called triangulating signatures, which are in one-to-one correspondence with triangulating atlases and generalize acyclic signatures. Note that in <cit.>, the BBY map is proved to be bijective onto (σ,σ^)-compatible orientations, which are representatives of the circuit-cocircuit reversal classes. We will also generalize this result. In particular, we will reformulate Theorem <ref> and Theorem <ref> in terms of the signatures and the compatible orientations (for triangulating atlases). First we recall the definitions of circuit (resp. cocircuit) signatures, acyclic circuit (resp. cocircuit) signatures, and compatible orientations in <cit.>. Let ℳ be a regular matroid. A circuit signature σ of ℳ is the choice of a direction for each circuit of ℳ. For each circuit C, we denote by σ(C) the signed circuit we choose for C. By abusing notation, we also view σ as the set of the signed circuits we choose: {σ(C):C is a circuit}. * The circuit signature σ is said to be acyclic if whenever a_C are nonnegative reals with ∑_C a_Cσ(C)=0 in ℝ^E we have a_C=0 for all C, where the sum is over all circuits of ℳ. * An orientation of ℳ is said to be σ-compatible if any signed circuit in the orientation is in σ. * Cocircuit signatures σ^, acyclic cocircuit signatures, and σ^-compatible orientations are defined similarly. * An orientation is said to be (σ,σ^)-compatible if it is both σ-compatible and σ^-compatible. Recall in Example <ref> that from signatures σ and σ^, we may construct atlases 𝒜_σ and 𝒜^_σ^. It is natural to ask: (1) Which signatures induce triangulating atlases? (2) Is any triangulating atlas induced by a signature? The following definition and proposition answer the question. A circuit signature σ is said to be triangulating if for any B∈𝒜_σ and any signed circuit C⊆B, C is in the signature σ. * A cocircuit signature σ^* is said to be triangulating if for any B^∈𝒜^_σ^* and any signed cocircuit C^⊆B^, C^* is in the signature σ^. In an atlas-free manner, the definition of triangulating circuit signatures is as follows: a circuit signature σ is said to be triangulating if for any basis B, any signed circuit that is the sum of signed fundamental circuits (for B) in σ is also in σ (see Lemma <ref>). A similar definition works for the cocircuit signatures. The maps α:{triangulating circuit sig. of ℳ} →{triangulating external atlases of ℳ} σ ↦𝒜_σ and α^:{triangulating cocircuit sig. of ℳ} →{triangulating internal atlases of ℳ} σ^* ↦𝒜^_σ^ are bijections. For a dissecting external atlas 𝒜, it is possible for there to be no circuit signature σ such that 𝒜_σ=𝒜. We can actually find a graph such that 𝒜_B (which is necessarily dissecting) gives the desired example; see Figure <ref>. Acyclic signatures are all triangulating; see Lemma <ref>. There exists a triangulating signature that is not acyclic; see Proposition <ref>. A nice thing about the acyclic signatures is that we can talk about compatible orientations and they form representatives of orientation classes. The following properties of triangulating signatures generalize the acyclic counterpart proved in <cit.>. Suppose σ and σ^* are triangulating signatures. * The set of (σ, σ^)-compatible orientations is a representative set of the circuit-cocircuit reversal classes of ℳ. The set of σ-compatible orientations is a representative set of the circuit reversal classes of ℳ. * The set of σ^-compatible orientations is a representative set of the cocircuit reversal classes of ℳ. To reformulate Theorem <ref> and Theorem <ref> in terms of signatures and compatible orientations, we write BBY_σ,σ^=f_𝒜_σ,𝒜^_σ^ and φ_σ,σ^=φ_𝒜_σ,𝒜^_σ^. They are exactly the BBY bijection in <cit.> and the extened BBY bijection in <cit.> when the two signatures are acyclic. By the two theorems and a bit extra work, we have the following theorems, which generalize the work in <cit.> and <cit.>, respectively. Suppose σ and σ^ are triangulating signatures of a regular matroid ℳ. The map BBY_σ,σ^* is a bijection between the bases of ℳ and the (σ,σ^)-compatible orientations of ℳ. Suppose σ and σ^ are triangulating signatures of a regular matroid ℳ with ground set E. (1) The map φ_σ,σ^:{orientations of ℳ} →{subsets of E} O ↦ (BBY_σ,σ^^-1(O^cp)∪_i∈ IC_i)\_j∈ JC_j^* is a bijection, where O^cp the (unique) (σ,σ^)-compatible orientation obtained by reversing disjoint signed circuits {C_i}_i∈ I and signed cocircuits {C_j^}_j∈ J in O. (2) The map φ_σ,σ^* specializes to the bijection φ_σ,σ^: {σ-compatible orientations} →{independent sets} O ↦BBY_σ,σ^^-1(O^cp)\_j∈ JC_j^. (3) The map φ_σ,σ^ specializes to the bijection φ_σ,σ^:{σ^-compatible orientations} →{spanning sets} O ↦BBY_σ,σ^^-1(O^cp)∪_i∈ IC_i. The definition of triangulating signatures is somewhat indirect. However, in the case of graphs, we have the following nice description for the triangulating cycle signatures, the proof of which is due to Gleb Nenashev. We do not know whether a similar statement holds for regular matroids. A cycle signature σ of a graph G is triangulating if and only if for any three directed cycles in σ, their sum (as vectors in ℤ^E) is not zero. §.§ Lawrence polytopes and the two atlases In this subsection, we will introduce a pair of Lawrence polytopes 𝒫 and 𝒫^ associated to a regular matroid ℳ. We will see that dissections and triangulations of the Lawrence polytopes correspond to the dissecting atlases and triangulating atlases, respectively, which is actually how we derived Definition <ref>. We will also see that regular triangulations correspond to acyclic signatures. Readers can find some information on Lawrence polytopes in the paper <cit.> and the books <cit.>. The Lawrence polytopes defined for regular matroids in this paper were rediscovered by the author in attempts to define a dual object to the root polytope studied in <cit.>; see Section <ref> for details. Recall that M_r× n is a totally unimodular matrix representing ℳ. * We call [ M_r× n 0; I_n× n I_n× n ] the Lawrence matrix, where I_n× n is the identity matrix. The columns of the Lawrence matrix are denoted by P_1, ⋯, P_n, P_-1, ⋯, P_-n∈ℝ^n+r in order. * The Lawrence polytope 𝒫⊆ℝ^n+r of ℳ is the convex hull of the points P_1, ⋯, P_n, P_-1, ⋯, P_-n. * If we replace the matrix M in (1) with M^_(n-r)× n (see Section <ref>), then we get the Lawrence polytope 𝒫^⊆ℝ^2n-r. We use the labels P_i^* for the points generating 𝒫^. We further assume that ℳ is loopless when defining 𝒫 and that ℳ is coloopless when defining 𝒫^, to avoid duplicate columns of the Lawrence matrix. We only need the assumption in (4) for the geometric results in this subsection. In particular, we do not need the assumption for atlases. One can use “point configurations” <cit.> to replace polytopes so that the assumption is unnecessary. Our definition of the Lawrence polytope certainly depends on the matrix we choose. We still say the Lawrence polytope 𝒫 (or 𝒫^) of ℳ for the following two reasons. First, if we fix a total order on the ground set E and fix a reference orientation, then the matrix M is unique up to a multiplication of a matrix in SL(r,ℤ) on the left; see <cit.>. Hence the resulting Lawrence polytope is also unique in a similar sense. Second, our results involving the Lawrence polytope do not depend on the choice of M. We introduce some basic notions in discrete geometry. A simplex S is the convex hull of some affinely independent points. A face of S is a simplex generated by a subset of these points, which could be S or ∅. Let 𝒫 be a polytope of dimension d. * If d+1 of the vertices of 𝒫 form a d-dimensional simplex, we call such a simplex a maximal simplex of 𝒫. * A dissection of 𝒫 is a collection of maximal simplices of 𝒫 such that (I) the union is 𝒫, and (II) the relative interiors of any two distinct maximal simplices in the collection are disjoint. * If we replace the condition (II) in (2) with the condition (III) that any two distinct maximal simplices in the collection intersect in a common face (which could be empty), then we get a triangulation. (See Figure <ref>.) The next two theorems build the connection between the geometry of the Lawrence polytopes and the combinatorics of the regular matroid. To state them, we need to label the 2\|E\| arcs of ℳ. Recall that given the matrix M, the arcs of ℳ are the standard unit vectors and their opposites. We denote them by e_1, ⋯, e_n and e_-1, ⋯, e_-n. In particular, e_i=-e_-i. We have the following threefold bijections, all of which are denoted by χ. (It should be clear from the context which one we are referring to when we use χ. ) * The Lawrence polytope 𝒫⊆ℝ^n+r is an (n+r-1)-dimensional polytope whose vertices are exactly the points P_1, ⋯, P_n, P_-1, ⋯, P_-n. Hence we may define a bijection χ:{vertices of 𝒫} →{arcs of ℳ} P_i ↦e_i * The map χ in (1) induces a bijection χ:{maximal simplices of 𝒫} →{externally oriented bases of ℳ} a maximal simplex with vertices {P_i:i∈ I} ↦the fourientation {χ(P_i):i∈ I}. * The map χ in (2) induces two bijections χ:{triangulations of 𝒫} →{triangulating external atlases of ℳ} a triangulation with maximal simplices {S_i:i∈ I} ↦the external atlas {χ(S_i):i∈ I}, and χ:{dissections of 𝒫} →{dissecting external atlases of ℳ} a dissection with maximal simplices {S_i:i∈ I} ↦the external atlas {χ(S_i):i∈ I}. * In (1), (2) and (3), if we replace the Lawrence polytope 𝒫 with 𝒫^, the points P_i with P_i^, χ with χ^, and every word “external” with “internal”, then the statement also holds. Recall that the map α:σ↦𝒜_σ is a bijection between triangulating circuit signatures and triangulating external atlases of ℳ. See Section <ref> for the definition of regular triangulations. The restriction of the bijection χ^-1∘α to the set of acyclic circuit signatures of ℳ is bijective onto the set of regular triangulations of 𝒫. In other words, a circuit signature σ is acyclic if and only if the triangulation χ^-1(A_σ) is regular. Dually, the restriction of the bijection (χ^)^-1∘α^* to the set of acyclic cocircuit signatures of ℳ is bijective onto the set of regular triangulations of 𝒫^. We conclude this subsection with Table <ref>. §.§ Motivation and root polytopes We explain how our work is motivated by and related to the work <cit.>, <cit.>, and <cit.> on root polytopes of hypergraphs and the work <cit.> on the BBY bijections. The story began with a question by O. Bernardi when he was my advisor. He asked whether the bijection in <cit.> is a BBY bijection. We now explain this question. Let G=(V,E) be a connected graph without loops, where V={v_i:i∈ I} is the vertex set and E={e_j:j∈ J} is the edge set. By adding a vertex to the midpoint of each edge of G, we obtain a bipartite graph Bip(G) with vertex classes V and E, where we use e_j to label the midpoint of e_j by abusing notation. We remark that this is a special case of constructing the bipartite graph Bip(H) associated with a hypergraph H; see <cit.>. Let {𝐯_i:i∈ I}∪{𝐞_j:j∈ J} be the coordinate vectors in ℝ^\|V\|+\|E\|. The root polytope associated to Bip(G) is 𝒬 =CovexHull(𝐯_i-𝐞_j:v_i is incident to e_j in G) ( =CovexHull(𝐯_i-𝐞_j:{v_i,e_j} is an edge of Bip(G))). The maximal simplices of 𝒬 are characterized by the following lemma. <cit.> Any maximal simplex of 𝒬 is of the form Δ_T=CovexHull(𝐯_i-𝐞_j:{v_i,e_j} is an edge of T), where T is a spanning tree of Bip(G). For a spanning tree T of Bip(G), we define the right degree vector to be RD(T)=(d_j-1:j∈ J), where d_j is the degree of e_j in T; we define the left degree vector to be LD(T)=(d_i-1:i∈ I), where d_i is the degree of v_i in T. <cit.> implies the following result. For any triangulation {Δ_T_1, ⋯, Δ_T_s} of 𝒬, the set R={RD(T_1), ⋯, RD(T_s)} does not depend on the triangulation, * the set L={LD(T_1), ⋯, LD(T_s)} does not depend on the triangulation, and * the map f:RD(T_i)↦ LD(T_i) is a bijection from R to L. From the point of view of <cit.>, R is the set of hypertrees of G (viewed as a hypergraph). Since G is a graph in our case, R is the set of spanning trees of G. To be precise, the spanning tree B of G induced by the vector RD(T) is B={e_j:d_j=2}. From the point view of <cit.>, L is in bijection with break divisors of G. From the point view of <cit.>, the break divisors are in bijection with the indegree sequences of q-connected orientations, where q is a root vertex of G, and hence the break divisors are in bijection with the circuit-cocircuit reversal classes. Here we remark that the break divisors are canonical representatives for the set Pic^g(G), and Pic^g(G) is a canonical torsor for the group Jac(G)(=Pic^0(G)) <cit.>. Therefore, the map f in Theorem <ref> induces a bijection between spanning trees of G and the circuit-cocircuit reversal classes of G. Thus we can ask whether it is a BBY bijection. Meanwhile, the work <cit.> shows that the Bernardi bijection induces a dissection of 𝒬. These results strongly suggest that the dissections and triangulations of 𝒬 are intimately related to these types of bijections. The mysterious part was that the root polytope is only related to the external edges of trees, so the theory for the bijection f and the one for the BBY bijection have an essential difference. This was why we were looking for a dual object to the root polytope, and the dual object turns out to be the Lawrence polytope 𝒫^. To see how our work on atlases and Lawrence polytopes implies all the results above, we build the connections between the terminologies related to the root polytope 𝒬 and the ones we use for the Lawrence polytope 𝒫. Firstly, the geometric objects 𝒬 and 𝒫 differ by an invertible linear transformation. Indeed, for any e_j∈ E and its two endpoints v_i_1,v_i_2∈ V, the pair (𝐯_i_1-𝐞_j, 𝐯_i_2-𝐞_j) can be transformed to (𝐞_j+𝐯_i_2-𝐯_i_1, 𝐞_j), via which 𝒬 is transformed to the Lawrence polytope 𝒫 associated to the oriented incidence matrix M of G (ignoring one redundant row of M). Secondly, the combinatorial object Bip(G) can be viewed as a fourientation G where each edge of G is bioriented if we view the edges {𝐯_i_1,𝐞_j} and {𝐯_i_2,𝐞_j} in Bip(G) as the arcs (v_i_1, v_i_2) and (v_i_2, v_i_1) in G, respectively. Via this correspondence, a spanning tree T⊆Bip(G) corresponds to an externally oriented base B⊆G, and RD(T) corresponds to the underlying tree of B. Recall that LD(T) corresponds to the indegree sequence of a q-connected orientation, which we did not specify. Now we point out that, in our language, this orientation is B∩B^, where B^∈𝒜^_q. Hence the map f in Theorem <ref> corresponds to the map f_𝒜,𝒜^_q, where 𝒜=χ({Δ_T_1, ⋯, Δ_T_s}) (by identifying 𝒫 and 𝒬). Now it is clear that the root polytope Q (or the Lawrence polytope 𝒫) only deals with the external atlas 𝒜, and it can induce the bijection f because we implicitly use the internal atlas 𝒜^_q. The dual object 𝒫^* deals with the internal atlas and makes the bijection f “symmetric”. We point out that <cit.> and <cit.> correspond to Theorem <ref>(2) and the triangulation part of Theorem <ref>(3), respectively. However, we still prove them because we need to deal with dissections and regular matroids. In <cit.>, the author asks whether a triangulation of 𝒬 can be reconstructed from the bijection f. This question has been fully answered by Galashin, Nenashev, and Postnikov in <cit.>. In particular, they construct a new combinatorial object called a trianguloid and prove that trianguloids are in bijection with triangulations of 𝒬 <cit.>. Moreover, they make use of trianguloids to prove that different triangulations induce different bijections f <cit.>. In this paper, we characterize the triangulations of the Lawrence polytope 𝒫 in terms of circuit signatures; see Table <ref> and Theorem <ref>. However, we can only apply our results to the root polytopes associated to Bip(G), where G is a graph rather than a hypergraph. Even for this case, it is unclear how our characterization is related to theirs. Going back to Bernardi's question, we can answer it now. If we view the BBY bijection and f as maps to orientations, then the map f is not BBY in general because there exists a triangulating cycle signature that is not acyclic (Proposition <ref>). If we view the two bijections as maps to the circuit-cocircuit reversal classes, then the answer is still no by <cit.>. A harder question is whether they induce the same torsor (see Section <ref> for the definition). We do not know the answer. Another important way to relate the Lawrence polytope (or the root polytope) to the BBY bijection is by the zonotopal subdivision. The zonotope Z(M) (resp. Z(M^)) is the Minkowski sum of the columns of M (resp. M^). Their subdivisions are used to construct the BBY bijection in <cit.>. In particular, every acyclic circuit signature (resp. cocircuit signature) induces a subdivision of Z(M) (resp. Z(M^)) indexed by the bases of ℳ. We may view the zonotope Z(M) (resp. Z(M^)) as a section of the Lawrence polytope 𝒫 (resp. 𝒫^), which is an example of a more general phenomenon known as the Cayley trick; see <cit.>. To be precise, denote the columns of M by M_1,⋯,M_n, and recall that the columns of the Lawrence matrix [ M_r× n 0; I_n× n I_n× n ] are denoted by P_1, ⋯, P_n, P_-1, ⋯, P_-n. Then we have Z(M)={∑_i=1^n k_iM_i:k_i∈ [0,1] for all i}, and 𝒫={∑_i=1^n (k_iP_i+k_-iP_-i):∑_i=1^n (k_i+k_-i)=1}. We take the section y_1=⋯=y_n=1/n of 𝒫⊆ℝ^n+r, where y_1,⋯,y_n denote the last n coordinates of ℝ^n+r. A direct computation shows that the zonotope Z(M) is exactly the n-th dilate of this section. If we restrict a triangulation χ^-1(𝒜_σ) of 𝒫 to the (dilated) section Z(M), we obtain a subdivision of Z(M). When the signature σ is acyclic, it is easy to check that the subdivision of Z(M) is exactly the one induced by σ in <cit.>. §.§ A tiling of a simplex induced by the bijection φ_𝒜,𝒜^ In <cit.>, the bijection φ_σ,σ^, which is generalized to φ_𝒜,𝒜^ in Theorem <ref>, induces a tiling of the hypercube [0,1]^E, where [0,1]^E is the set of continuous orientations of ℳ. The tiling is a decomposition of [0,1]^E into half-open cells such that each cell contains exactly one discrete orientation O and the vectors spanning the cell correspond to the edges in φ_σ,σ^(O). The hypercube has two projections, the zonotopes Z(M) and Z(M^) generated by the columns of M and M^, respectively; see Figure <ref>. Zonotopal subdivisions of are used to construct the BBY bijection in <cit.>. Every acyclic circuit signature (resp. cocircuit signature) induces a subdivision of Z(M) (resp. Z(M^)) indexed by the bases of ℳ. The tiling of the hypercube <cit.> contains the information of these zonotopal subdivisions. Roughly speaking, if we project part of the tiling to the zonotope Z(M) (resp. Z(M^)), then we get a refinement of the subdivision, which is indexed by the independent sets (resp. spanning sets). We may view the zonotope Z(M) (resp. Z(M^)) as a section of the Lawrence polytope 𝒫 (resp. 𝒫^), which is an example of a more general phenomenon known as the Cayley trick; see <cit.>. To be precise, denote the columns of M by M_1,⋯,M_n, and recall that the columns of the Lawrence matrix [ M_r× n 0; I_n× n I_n× n ] are denoted by P_1, ⋯, P_n, P_-1, ⋯, P_-n. Then we have Z(M)={∑_i=1^n k_iM_i:k_i∈ [0,1] for all i}, and 𝒫={∑_i=1^n (k_iP_i+k_-iP_-i):∑_i=1^n (k_i+k_-i)=1}. We take the section y_1=⋯=y_n=1/n of 𝒫, where y_1,⋯,y_n denote the last n coordinates. A direct computation shows that the zonotope Z(M) is exactly the n-th dilate of this section. If we restrict a triangulation χ^-1(A_σ) of 𝒫 to the (dilated) section Z(M), we will certainly obtain a subdivision of Z(M). When the signature σ is acyclic, it is easy to check that the subdivision of Z(M) is exactly the one induced by σ in <cit.>. We have introduced five objects in Figure <ref>. This suggests that there might be a “universal” geometric object that contains the hypercube as a section and can be projected to the Lawrence polytopes. Moreover, we expect this object to have a tiling property as the hypercube. The target of this section is to define this object 𝒮 and build the tiling. We fix a space ℝ_≥ 0^2n whose points are written as x=(x(1),⋯, x(n),x(-1),⋯,x(-n)), where every entry is nonnegative. Recall that the arcs of ℳ are denoted by e_1, ⋯, e_n, e_-1, ⋯, e_-n. The entry x(i) should be thought of as corresponded to e_i. Let 𝒮={x∈ℝ_≥ 0^2n: ∑_i=1^n(x(i)+x(-i))=1}. Clearly, the simplex 𝒮 are projected to 𝒫 and 𝒫^ via the two Lawrence matrices, respectively. The section {x∈𝒮: x(i)+x(-i)=1/n} of 𝒮 is a hypercube (equivalent to [0,1]^E). Now we construct the tiling. In <cit.>, the tiling induced by φ_σ,σ^* is a decomposition of the hypercube into half-open cells. Here we need half-open simplices as defined below. Let O be an orientation of ℳ. For each edge e_i, we define the number O_i to be O_i= i, if e_i∈O; -i, if e_-i∈O. Given an orientation O and a subset A⊆ E, we consider the half-open simplices hoc(𝒮,O,A)={x∈𝒮: x(O_i)≠ 0, for e_i∈ A; x(-O_i)= 0, for e_i∉ A. } Let ( 𝒜,𝒜^) be a pair of dissecting atlases of ℳ, and at least one of the atlases is triangulating. Then 𝒮=_Ohoc(𝒮,O,φ_𝒜,𝒜^(O)), where the disjoint union is over all the orientations of ℳ. The dimension of 𝒮 is 2n-1, so we can only draw pictures for n≤ 2. The tiling in Theorem <ref> contains the information of the triangulation or the dissection χ^-1(𝒜) in the following sense. not sure § THE PROOFS OF THEOREM <REF> AND THEOREM <REF> We will prove Theorem <ref> and Theorem <ref> in this section. §.§ Preliminaries In this subsection, we will introduce some lemmas and notations. Some of them will also be used in other sections. Let ℳ be a regular matroid. We start with three lemmas which hold for oriented matroids and hence for regular matroids. In the case of graphs, one can find the later two results in <cit.>. The following lemma is known as the orthogonality axiom <cit.>. Let C be a signed circuit and C^* be a signed cocircuit of ℳ. If C∩ C^≠∅, then there exists one edge on which C and C^ agree and another edge on which C and C^* disagree. Let F be a fourientation of ℳ. Then for any potential circuit C and any potential cocircuit C^* of F, their underlying edges satisfy C∩ C^=∅. Assume E_0=C∩ C^ is nonempty. Then the edges in E_0 must be one-way oriented by C and by C^. This contradicts Lemma <ref>. The following lemma is known as the 3-painting axiom; see <cit.>. Let F be a fourientation of ℳ and e be a one-way oriented edge in F. Then e belongs to some potential circuit of F or e belongs to some potential circuit of F but not both. We also need the following lemma and definition. Recall that M is a totally unimodular matrix representing the regular matroid ℳ. <cit.> (1) Let u∈_ℝ(M). Then u can be written as a sum of signed circuits with positive coefficients ∑ k_iC_i where for each edge e of each C_i, the sign of e in C_i agrees with the sign of e in u. (2) Let u^∈_ℝ(M^T). Then u^* can be written as a sum of signed cocircuits with positive coefficients ∑ k_iC_i^* where for each edge e of each C_i^, the sign of e in C_i^ agrees with the sign of e in u^. In Lemma <ref>, we call the signed circuit C_i a component of u and the signed cocircuit C_i^ a component of u^. In Lemma <ref>, the linear combination might not be unique. However, if we fix a linear combination, it is clear that the underlying edges of u (i.e., {e:e-th entry of u is not zero}) is the union of the underlying edges of its components in the linear combination. Also see <cit.> for an integral version of Lemma <ref>. The following lemma is crucial when we deal with circuit-cocircuit reversal classes. One can find a proof in the proof of <cit.> or see <cit.>. Let O_1 and O_2 be two orientations in the same circuit-cocircuit reversal class of ℳ. Then O_2 can be obtained by reversing disjoint signed circuits and signed cocircuits in O_1. Lastly, we introduce some useful notations here. Recall that E is the ground set of ℳ. Let E_0 be a subset of E and F be a fourientation. We denote by F\|_E_0 the fourientation obtained by restricting F to the ground set E_0, i.e., F\|_E_0=F∩{±e: e∈ E_0}. When E_0 consists of a single edge e, we simply write F\|_e. In particular, when e is unoriented in F, F\|_e=∅. When e is bioriented in F, we write F\|_e=↕. §.§ Proof of Theorem <ref> We first recall some basic settings. We fix a regular matroid ℳ with ground set E. Let 𝒜 be an external atlas and 𝒜^ be an internal atlas, which means for every basis B of ℳ, there exists a unique externally oriented basis B∈𝒜 and a unique internally oriented basis B^∈𝒜^. The pair (𝒜,𝒜^) of atlases induces the following map f_𝒜,𝒜^:{bases} →{orientations} B ↦B∩B^. Let B_1 and B_2 be two arbitrary bases (not necessarily distinct). Let O_1, O_2 and F, F^ be two orientations and two fourientations given by the following formulas: O_i=f_𝒜,𝒜^(T_i), i∈{1,2}, F=B_1∩(-B_2), F^=(B_1^∩(-B_2^))^c. Now we compute the two fourientations F and F^* in terms of O_1 and O_2, which is summarized in Table <ref>. For example, when e∈ B_2\ B_1, we have F\|_e=O_1\|_e. This is because F=B_1∩(-B_2), B_2\|_e=↕, and B_1\|_e=O_1\|_e (due to O_1=B_1∩B_1^). All the other results can be derived similarly. A direct consequence of this table is the following lemma. Let E_⇉ be the set of edges where O_1 and O_2 agree. Let E_⇄=E\ E_⇉. If E_0⊆ E_⇉, then F\|_E_0=F^\|_E_0. If E_0⊆ E_⇄, then O_1\|_E_0⊆F\|_E_0 and F^\|_E_0⊆O_2\|_E_0. Now we are ready to prove Theorem <ref>. By <cit.>, the number of circuit-cocircuit reversal classes equals the number of bases. Thus it is enough to prove that the map f_𝒜,𝒜^ in Theorem <ref> is injective, which is the following proposition. Let B_1 and B_2 be two distinct bases of ℳ. If either of the following two assumptions holds, then the orientations O_1=f_𝒜,𝒜^(B_1) and O_2=f_𝒜,𝒜^(B_2) are in distinct circuit-cocircuit reversal classes. * The external atlas 𝒜 is dissecting and the internal atlas 𝒜^* is triangulating. * The external atlas 𝒜 is triangulating and the internal atlas 𝒜^* is dissecting. Assume by contradiction that O_1 and O_2 are in the same circuit-cocircuit reversal class. By Lemma <ref>, there exist disjoint signed circuits {C_i}_i∈ I and signed cocircuits {C^_j}_j∈ J in O_1 by reversing which we may obtain O_2. (1) Because 𝒜 is dissecting, the fourientation F has a potential cocircuit D^. We will show that D^* is also a potential cocircuit of F^, which contradicts that 𝒜^ is triangulating. Consider applying Lemma <ref>. Note that E_⇄ is the disjoint union of {C_i}_i∈ I and {C^_j}_j∈ J. For any j∈ J, let E_0=C^_j and apply Lemma <ref>(2). Then we get F^\|_C^_j⊆O_2\|_C^_j=-C^_j. By definition, this implies that -C^_j is a potential cocircuit of F^, which contradicts that 𝒜^* is triangulating. So, J=∅. For any i∈ I, let E_0=C_i and apply Lemma <ref>(2). Then we get C_i=O_1\|_C_i⊆F\|_C_i. This means C_i is a potential circuit of F. Because D^* is a potential cocircuit of F, by Lemma <ref>, D^∩ C_i=∅. Hence D^⊆ E_⇉. By Lemma <ref>(1), D^* is a potential cocircuit of F^, which gives the desired contradiction. (2) This part of the proof is dual to the previous one. To be precise, because 𝒜^ is dissecting, the fourientation F^* has a potential circuit D. Then by applying Lemma 2.5, we may prove that I=∅, -C^_j is a potential cocircuit of F^, D⊆ E_⇉, and D is a potential circuit of F. The last claim contradicts that 𝒜 is triangulating. If we just want to show the map f_𝒜,𝒜^* is injective under the assumption of Proposition <ref>, the proof is short and works even for oriented matroids. Indeed, assume by contradiction that O_1=O_2, then by Lemma <ref>(1), F=F^, which contradicts the definitions of the triangulating atlas and dissecting atlas. §.§ Proof of Theorem <ref> We will prove Theorem <ref> in this section. For the construction of φ_𝒜,𝒜^, see Definition <ref>. We will prove that φ_𝒜,𝒜^* has the following property, which is stronger than bijectivity. Let φ be a map from the set of orientations of ℳ to the set of subsets of E. We say the map φ is tiling if for any two distinct orientations O_1 and O_2, there exists an edge e such that O_1\|_e≠O_2\|_e and e∈φ(O_1)△φ(O_2). In <cit.>, it is shown that φ is tiling if and only if it canonically induces a half-open decomposition of the hypercube [0,1]^E, where [0,1]^E is viewed as the set of continuous orientations of ℳ. If φ is tiling, then φ is bijective. The property e∈φ(O_1)△φ(O_2) in the definition implies φ(O_1)≠φ(O_2). Hence φ is injective. The domain and codomain of φ are equinumerous, so φ is bijective. Now we begin to show φ_𝒜,𝒜^* is tiling. If either of the following two assumptions holds, then the map φ_𝒜,𝒜^* is tiling. In particular, φ_𝒜,𝒜^* is bijective. * The external atlas 𝒜 is dissecting and the internal atlas 𝒜^* is triangulating. * The external atlas 𝒜 is triangulating and the internal atlas 𝒜^* is dissecting. Let O_A and O_B be two different orientations of ℳ. Assume by contradiction that the desired edge e does not exist. So, for edges e∈φ_𝒜,𝒜^(O_A)△φ_𝒜,𝒜^(O_B), we have O_A\|_e=O_B\|_e. (†) By the construction of φ_𝒜,𝒜^, we can find bases B_1 and B_2 such that O_A is obtained from reversing disjoint signed circuits {C_1,i}_i∈ I_1 and signed cocircuits {C^_1,j}_j∈ J_1 in O_1:=f_𝒜,𝒜^(B_1), O_B is obtained from reversing disjoint signed circuits {C_2,i}_i∈ I_2 and signed cocircuits {C^_2,j}_j∈ J_2 in O_2:=f_𝒜,𝒜^(B_2), φ_𝒜,𝒜^(O_A)=(B_1∪ C_1) \ C_1^, and φ_𝒜,𝒜^(O_B)=(B_2∪ C_2) \ C_2^, where C_k is all the underlying edges of {C_k,i}_i∈ I_k and C_k^ is all the underlying edges of {C_k,i^}_i∈ J_k for k=1,2. We also denote C_k=_i∈ I_kC_k,i and C_k^=_j∈ J_kC_k,j^. We still adopt the notations F=B_1∩(-B_2), F^=(B_1^∩(-B_2^))^c, introduced in the previous section. We compute F and F^* in terms of C_1,C_2,C^_1, and C^_2, and the results are summarized in Table <ref>. The next two paragraphs will explain the table. All the edges e are partitioned into 28 classes according to whether e is in B_1 and/or in B_2 (columns), and whether e is in C_1, C_2, C_1^, and/or C_2^ (rows). Regarding the rows, we start with 4 large classes (C_1∪ C^_1) ∩ (C_2 ∪ C^_2), (C_1∪ C^_1)^c ∩ (C_2 ∪ C^_2), (C_1∪ C^_1) ∩ (C_2 ∪ C^_2)^c, and (C_1∪ C^_1)^c ∩ (C_2 ∪ C^_2)^c. Using C_1∩ C^_1=C_2∩ C^_2=∅, we may partition these 4 large classes into small classes. However, two items C_1∩ C_2^* and C_1^∩ C_2 are missing in the table. This is because they are empty. Indeed, if one of them, say C_1∩ C_2^, is not empty, then by Lemma <ref>, there exists an edge e∈ C_1∩ C_2^* such that C_1\|_e≠C_2^\|_e. This implies O_A\|_e≠O_B\|_e. By the definition of φ_𝒜,𝒜^, e∈ C_1∩ C_2^* implies e∈φ_𝒜,𝒜^(O_A)△φ_𝒜,𝒜^(O_B). By the assumption (†), we have O_A\|_e=O_B\|_e, which gives the contradiction. So, the rows of the table cover all the cases. In the table, we view C_1,C_2,C^_1, and C^_2 as sets of arcs, so the union and intersection make sense. We omit “\|_e” as in Table <ref>. We only give the useful results, so some fourientations in some cells are not given. The computation is straightforward. If there is no † in the cell, then we can get the result by making use of Table <ref> where O_k can be replaced by C_k when e∈ C_k and by C_k^* when e∈ C_k^, for k=1,2. If there is a † in the cell, then the computation makes use of the assumption (†). For example, for cells 3α and 3γ, since e∈ C_1^ and e∈ B_2, we have e∉φ_𝒜,𝒜^(O_A) and e∈φ_𝒜,𝒜^(O_B). By (†), we have O_A\|_e=O_B\|_e, and hence C_1^\|_e=O_1\|_e=-O_2\|_e. Combining this formula and Table <ref>, we obtain the formulas in 3α and 3γ. Similarly, we obtain the formulas in cells with † in rows 4,5, and 6. For cells 7β and 7γ, we still have O_A\|_e=O_B\|_e due to (†), which implies O_1\|_e=-O_2\|_e. Then by Table <ref>, we get F=F^. Now we use the table to prove two claims. Claim 1: if C_1-C_2≠ 0, then each of its component (see Definition <ref>) is a potential circuit of F. By Lemma <ref>, it suffices to check that for any arc e∈C_1∪(-C_2) that is not cancelled in C_1-C_2, we have F\|_e=e or F is bioriented. This follows directly from the rows 1, 5, and 6 in Table <ref> (C_1=-C_2 in row 1). Similarly, we can prove the other claim. Claim 2: if C_2^-C_1^≠ 0, then each of its component is a potential cocircuit of F^. We are ready to complete the proof. When B_1=B_2, by definition F has no potential circuit, and F^ has no potential circuit. By Claim 1 and Claim 2, C_1=C_2 and C_2^=C_1^, which implies O_A=O_B. Contradiction. From now on we assume B_1≠ B_2. We will apply the dissecting and triangulating conditions (1) or (2) to get contradictions. (1) Because 𝒜 is dissecting and 𝒜^* is triangulating, there exists a potential cocircuit D^* of F, and there is no potential cocircuit of F^. The later one implies that C_2^=C_1^* by Claim 2. So, rows 3 and 4 in Table <ref> can be ignored in this case, and in cells 2α, 2β, and 2γ, F=F^. Now we claim that the potential cocircuit D^ of F is also a potential cocircuit of F^, which gives the contradiction. Indeed, on one hand, for edges e in rows 5 and 6, and for edges e in row 1 such that C_1\|_e=-C_2\|_e, they are exactly the underlying edges of C_1-C_2, and hence by Claim 1, Lemma <ref>, and Remark <ref>, as a potential cocircuit of F, D^ does not use these edges at all. On the other hand, for the remaining edges e, which are those in rows 2 and 7, and in row 1 such that C_1\|_e=C_2\|_e, we have either F\|_e=F^\|_e or F^\|_e=∅. So, D^* is also a potential cocircuit of F^. (2) This part can be proved by a similar argument. This concludes the proof of Theorem <ref>(1). It remains to show (2) and (3). Under either of the assumptions of Proposition <ref> on the atlases 𝒜 and 𝒜^, we have the following properties of φ_𝒜,𝒜^. (1) The image of the independent sets of ℳ under the bijection φ^-1_𝒜,𝒜^ is a representative set of the circuit reversal classes of ℳ. (2) The image of the spanning sets of ℳ under the bijection φ^-1_𝒜,𝒜^* is a representative set of the cocircuit reversal classes of ℳ. Recall that the map φ_𝒜,𝒜^:{orientations of ℳ} →{subsets of E} O ↦ (B∪_i∈ IC_i)\_j∈ JC_j^ is a bijection, where B is the unique basis such that f_𝒜,𝒜^(B)∈ [O], and the orientations f_𝒜,𝒜^(B) and O differ by disjoint signed circuits {C_i}_i∈ I and cocircuits {C_j^}_j∈ J. Let A=φ_𝒜,𝒜^(O). Then A is an independent set ⇔ I=∅ (due to Lemma <ref>) ⇔ The orientations O and f_𝒜,𝒜^(B) are in the same cocircuit reversal class. Because the set {f_𝒜,𝒜^(B):B is a basis} is a representative set of the circuit-cocircuit reversal classes (Theorem <ref>), the set {φ^-1_𝒜,𝒜^(A):A is independent} is a representative set of the circuit-reversal classes. This proves (1). Similarly, (2) also holds. This completes the proof of Theorem <ref>. § SIGNATURES, THE BBY BIJECTION, AND THE BERNARDI BIJECTION In this section we will use our theory to recover and generalize the work in <cit.>, <cit.>, and <cit.>. To do this, we will build the connection between circuit signatures (resp. cocircuit signatures) and external atlases (resp. internal atlases) of the regular matroid ℳ. We will also see how the BBY bijection (resp. the extended BBY bijection) and the Bernardi bijection become a special case of Theorem <ref> (resp. Theorem <ref>). In particular, the acyclic signatures used to define the BBY bijection will be generalized to triangulating signatures. §.§ Signatures and atlases For the definitions of circuit signatures σ, cocircuit signatures σ^, and triangulating signatures, see Section <ref>. Recall that given a circuit signature σ, we may construct the external atlas 𝒜_σ from σ such that for each externally oriented basis B∈𝒜_σ, each external arc e∈B is oriented according to the orientation of the fundamental circuit C(B,e) in σ. Similarly, we may construct the internal atlas 𝒜^_σ^. We now show that all the triangulating atlases can be obtained in this way. Moreover, they must come from triangulating signatures. The following lemma is trivial but useful. Every circuit of ℳ is a fundamental circuit C(B,e) for some basis B and some edge e. Dually, every cocircuit of ℳ is a fundamental cocircuit C^(B,e) for some basis B and some edge e. The map α:{triangulating circuit sig. of ℳ} →{triangulating external atlases of ℳ} σ ↦𝒜_σ is a bijection. * The map α^:{triangulating cocircuit sig. of ℳ} →{triangulating internal atlases of ℳ} σ^ ↦𝒜^_σ^ is a bijection. We only prove (1) because the same method can be used to prove (2). First we check the atlas 𝒜_σ is triangulating when σ is triangulating. Assume by contradiction that there exist distinct bases B_1 and B_2 such that B_1∩(-B_2) has a potential circuit C. Then C⊆B_1 and -C⊆B_2. By the definition of σ being triangulating, C∈σ and -C∈σ, which gives the contradiction. The map α is injective. Indeed, given two different signatures σ_1 and σ_2, there exists a signed circuit C such that C∈σ_1 and -C∈σ_2. By Lemma <ref>, C is a fundamental circuit C(B, e). Then the two externally oriented bases associated to B in 𝒜_σ_1 and in 𝒜_σ_2 have different signs on e. The map α is surjective. Given a triangulating external atlas 𝒜, we need to find a triangulating signature σ such that 𝒜=𝒜_σ. By Lemma <ref>, any circuit C is a fundamental circuit C(B, e). Then we define σ(C) to be the signed circuit C in B∈𝒜. This is well-defined. Indeed, if from two different bases B_1 and B_2 we get two opposite signed circuits C and -C, then C⊆B_1 and -C⊆B_2. Hence C⊆B_1∩(-B_2), which contradicts 𝒜 being triangulating. It is obvious that 𝒜=𝒜_σ. It remains to show that σ is triangulating. For any B_1∈𝒜_σ and any signed circuit C⊆B_1, we need to show C∈σ. If C is a fundamental circuit with respect to B_1, then it is done. Otherwise, by Lemma <ref>, C=C(B_2,e) for some other basis B_2. Then either C⊆B_2 or -C⊆B_2. The second option is impossible because B_1∩(-B_2) does not contain any signed circuit. Thus C⊆B_2 and hence C∈σ. §.§ Acyclic signatures In this subsection, we prove acyclic signatures are triangulating. This is essentially <cit.>. For readers' convenience, we give a proof here, which consists of two lemmas. Let e be an arc. We denote by C(B,e) the fundamental circuit oriented according to e when e∈ B, and denote by C^(B,e) the fundamental cocircuit oriented according to e when e∉ B. Fix a basis B of ℳ. (1) For any signed circuit C, C=∑_e∉ B,e∈CC(B,e). (2) For any signed cocircuit C^, C^=∑_e∈ T,e∈C^C^(T,e). We only prove (1) since the method works for (2). Note that the set of signed fundamental circuits with respect to B form a basis of _ℝ(M) (choose an arbitrary orientation for each circuit) <cit.>. Hence we can write C∈_ℝ(M) as a linear combination of these fundamental circuits with real coefficients: C=∑_e∉ Bk_eC(B,e). By comparing the coefficients of e∉ B in both sides, we get the desired formula. Let σ be an acyclic circuit signature and σ^ be an acyclic cocircuit signature. Then σ and σ^* are triangulating. (Equivalently, 𝒜_σ and 𝒜^_σ^ are triangulating atlases.) We only give the proof for σ. By definition, for any B∈𝒜_σ and any signed circuit C⊆B, we need to show C∈σ. By Lemma <ref>, C=∑_e∉ B,e∈CC(B,e). Since B∈𝒜_σ, every signed circuit in the right-hand side is in σ. By the definition of σ being acyclic, we have C∈σ. So, σ is triangulating. There exists a triangulating circuit signature that is not acyclic. See Section <ref> for an example together with a nice description of the triangulating cycle signatures of graphs. §.§ The BBY bijection and compatible orientations Given a pair (σ,σ^) of triangulating signatures, we write BBY_σ,σ^=f_𝒜_σ,𝒜^_σ^ and φ_σ,σ^=φ_𝒜_σ,𝒜^_σ^. They are exactly the BBY bijection in <cit.> and the extened BBY bijection in <cit.> when the two signatures are acyclic. By the results in the previous two subsections, we may apply Theorem <ref> and Theorem <ref> to these two maps and hence generalize the counterpart results in <cit.> and <cit.>. Compared with atlases, signatures allow us to talk about compatible orientations; see Section <ref> for the definition. The maps BBY_σ,σ^ and φ_σ,σ^* are proved to be bijective onto compatible orientations in addition to orientation classes in <cit.>. Here is an example. <cit.> Suppose σ and σ^* are acyclic signatures of ℳ. * The map BBY_σ,σ^* is a bijection between the bases of ℳ and the (σ,σ^)-compatible orientations of ℳ. The set of (σ, σ^)-compatible orientations is a representative set of the circuit-cocircuit reversal classes of ℳ. We will also generalize these results by reformulating Theorem <ref> and Theorem <ref> in terms of signatures and compatible orientations. We first prove a lemma. Suppose σ and σ^ are triangulating signatures of ℳ. Then for any basis B, the orientation BBY_σ,σ^(B) is (σ, σ^)-compatible. For any signed circuit C⊆BBY_σ,σ^(B)=B∩B^, where B∈𝒜_σ and B^∈𝒜^_σ^, we have C⊆B, and hence C is in the signature σ because σ is triangulating. Similarly, for any signed cocircuit in the orientation BBY_σ,σ^(B), it is in σ^. So, the orientation BBY_σ,σ^(B) is (σ, σ^)-compatible. Now we generalize Theorem <ref>. Suppose σ and σ^ are triangulating signatures of ℳ. * (Theorem <ref>) The map BBY_σ,σ^* is a bijection between the bases of ℳ and the (σ,σ^)-compatible orientations of ℳ. The set of (σ, σ^)-compatible orientations is a representative set of the circuit-cocircuit reversal classes of ℳ. It is a direct consequence of the following three facts. By Theorem <ref>, the image of BBY_σ,σ^* forms a representative set of the circuit-cocircuit reversal classes. * By Lemma <ref>, the image of BBY_σ,σ^* is contained in the set of (σ, σ^)-compatible orientations. By Lemma <ref>, each circuit-cocircuit reversal class contains at most one (σ, σ^)-compatible orientation. Theorem 5.2 in <cit.> says that the following result on the extended BBY bijection holds for acyclic signatures. Now we prove that it holds for triangulating signatures. Suppose σ and σ^ are triangulating signatures of a regular matroid ℳ with ground set E. (1) The map φ_σ,σ^:{orientations of ℳ} →{subsets of E} O ↦ (BBY_σ,σ^^-1(O^cp)∪_i∈ IC_i)\_j∈ JC_j^* is a bijection, where O^cp the (unique) (σ,σ^)-compatible orientation obtained by reversing disjoint signed circuits {C_i}_i∈ I and signed cocircuits {C_j^}_j∈ J in O. (2) The map φ_σ,σ^* specializes to the bijection φ_σ,σ^: {σ-compatible orientations} →{independent sets} O ↦BBY_σ,σ^^-1(O^cp)\_j∈ JC_j^. (3) The map φ_σ,σ^ specializes to the bijection φ_σ,σ^:{σ^-compatible orientations} →{spanning sets} O ↦BBY_σ,σ^^-1(O^cp)∪_i∈ IC_i. (1) This is a direct consequence of Theorem <ref>(1) and Theorem <ref>. (2) Let A=φ_σ,σ^(O). Then A is an independent set ⇔ I=∅ (by Lemma <ref>) ⇔ O is σ-compatible. (3) The proof is similar to the one of (2). The following result is a direct consequence of Theorem <ref> and Theorem <ref>. For a triangulating signature σ (resp. σ^), the σ-compatible (resp. σ^-compatible) orientations form representatives for circuit reversal classes (resp. cocircuit reversal classes). We can further generalize Theorem <ref>(2)(3) a bit. From the proof of Theorem <ref>(2) (including the preceding lemmas), it is clear that if σ is a triangulating signature and 𝒜^* is a dissecting atlas, then φ_𝒜_σ,𝒜^* specializes to a bijection between {σ-compatible orientations} and {independent sets}. The dual statement also holds. So far, we have proved every claim in Section <ref> except Theorem <ref>, which we will prove next. §.§ Triangulating cycle signatures of graphs As introduced in Section <ref>, for graphs, we have a nice description (Theorem <ref>) for the triangulating cycle signatures. We will prove the result and use it to check an example where a triangulating cycle signature is not acyclic. Let G be a graph where multiple edges are allowed (loops are of no interest here). By cycles of G, we mean simple cycles. When we add cycles, we view them as vectors in ℤ^E. We start with a basic lemma. We cannot find a reference, so we prove it briefly. If the sum of two directed cycles C_1 and C_2 of G is a directed cycle, then their common edges C_1∩ C_2 form a path (which is directed in opposite ways in the two directed cycles). Clearly C_1∩ C_2 contains a path. Take a maximal path and consider its two endpoints v_1 and v_2. We put a chip c at v_1 and move c along C_1. Without loss of generality, we may assume c leaves the path and certainly leaves C_2. We claim that the next place where c reaches C_2 is v_2, which finishes the proof of the lemma. Indeed, if c reaches a common vertex of C_1 and C_2 other than v_2, then we can move c back to v_1 along C_2, and hence the route of c forms a direct cycle which is strictly contained in C_1+C_2. This contradicts that C_1+C_2 is a cycle. Our target is to prove the following result. The proof needs a technical lemma which we will state and prove right after the result. The proof (including the technical lemma) is due to Gleb Nenashev. Let σ be a cycle signature of a graph G. Then the following are equivalent. * σ is triangulating. * For any three directed cycles in σ, the sum is not zero. * For any two directed cycles in σ, if their sum is a cycle, then the sum is in σ. The equivalence of (2) and (3) is trivial. Without loss of generality, we may assume G is connected. Then we prove (1) implies (3). Denote the two directed cycles by C_1 and C_2, and their sum by C. By Lemma <ref>, C_1∩ C_2 is a path P. Hence we can get a forest from C_1∪ C_2 by removing one edge in C_1\ P and one edge in C_2\ P. We extend the forest to a spanning tree B of G. Then C_1 and C_2 are both fundamental cycles of G with respect to B. Consider the external atlas B∈𝒜_σ. Because C_1, C_2∈σ, we have C_1, C_2⊆B, and hence C⊆B. Because σ is triangulating, C∈σ. The difficult part is (3) implies (1). For any B∈𝒜_σ and any signed circuit C⊆B, we want to show C∈σ. By Lemma <ref>, we can write C as the sum of directed fundamental cycles with a complete parenthesization such that each time we add two directed cycles up, the sum is always a directed cycle. Because C⊆B, all the directed fundamental cycles in the summation are in σ. Due to (3), C∈σ. Let B be a spanning tree of a connected graph G and C be a directed cycle. Denote by e_1,⋯,e_m the external arcs that appear in C in order (with an arbitrary start). By Lemma <ref>, C=∑_i=1^mC(B,e_i). Then the summation can be completely parenthesized such that during the summation the sum of two terms is always a directed cycle. (e.g., C=(C_1+C_2)+(C_3+(C_4+C_5)) is completely parenthesized, and we hope C_1+C_2, and C_3+(C_4+C_5) are all directed cycles.) Without loss of generality, we may assume that any two vertices in G are adjacent, because adding an edge to G does not affect the result. We use induction on m. When m≤ 2, the statement is trivial. Assume the statement holds for some integer m≥ 2, and we need to show it holds for m+1. Denote C by (e_1,P_1,e_2,P_2, ⋯,e_m+1, P_m+1), where P_i⊆C is the directed (internal) path connecting e_i and e_i+1. See Figure <ref>. We denote the vertices in an object by V(object). The set V(P_i) includes the two endpoints of the path. When P_i contains no arc, we define V(P_i) to be the head of e_i, which is also the tail of e_i+1. We take a vertex r of G viewed as the root of the tree B. Define the height of a vertex v to be the number of edges in the unique path in B connecting v and r. For a (internal) path P_i, there exists a unique vertex in P_i with the minimum height. We denote the vertex by r_i and define the height of P_i to be the height of r_i. Let P_k be a path having the maximal height among all P_i. We remove the vertex r_k(≠ r) together with the incident edges from the tree B and denote the connected component containing r by B'. Then B' is a tree not containing any vertex in P_k but containing the vertices in V(C)\ V(P_k). We will see the construction of P_k and B' is crucial to our proof. Without loss of generality, we may assume 1<k<m+1. Let e_k' be the arc directed from the tail of e_k to the head of e_k+1. Denote by C_0 the directed cycle (e_k,P_k,e_k+1,-e_k'). Let C'=C-C_0. Note that C' is the directed cycle obtained from C by replacing the path (e_k,P_k,e_k+1) with the arc e_k'. By Lemma <ref>, we have C'=∑_i=1^k-1C(B,e_i)+C(B,e_k')+∑_i=k+2^m+1C(B,e_i). Now we apply the induction hypothesis to C' and get a way to completely parenthesize the summation so that the parenthesization has the desired property for C'. We rewrite C as C=C'+C_0 = ∑_i=1^k-1C(B,e_i)+(C(B,e_k')+C_0)+∑_i=k+2^m+1C(B,e_i) = ∑_i=1^k-1C(B,e_i)+(C(B,e_k)+C(B,e_k+1))+∑_i=k+2^m+1C(B,e_i). We completely parenthesize the summation for C in the same way as we just did for C' by adding up (C(B,e_k)+C(B,e_k+1)) first and then treating it as the summand C(B,e_k') in C'. We claim this gives us the desired parenthesization. Indeed, for any new directed cycle D produced in the summation of C, there are two cases. * If D does not use e_k (and hence e_k+1), then D also appear in the summation of C'. Thus D is a directed cycle. * If D uses e_k, then the corresponding term in the summation of C' is D'=D-C_0, where D' could be C(B,e_k') or a newly produced directed cycle containing e_k'. Note that the endpoints of all the external edges in C' are in B'. So all the fundamental cycles in the summation of C' only use vertices in B', and hence D' does not use any vertex in P_k. Thus D=D'+C_0 is a directed cycle. Now we present an example to show that a circuit signature being acyclic is stronger than being triangular. (We used a computer program to find the example.) There exists a planar graph that admits a triangulating but not acyclic cycle signature. We remove one edge in the complete graph on 5 vertices and denote the new graph by G. The graph G is planar, which allows us to present its directed cycles using regions. We denote by C_i the cycle that bounds the region labeled by i in Figure <ref>, where i=1,2,3,4,5. By orienting them counterclockwise, we obtain five directed cycles C_1,⋯, C_5. Let the cycle signature σ be the set of the following directed cycles. The counterclockwise ones are 2,3,5,23,25,123,235,245,345,1235,2345, and the clockwise ones are -1,-4,-12,-13,-34,-45,-125,-134,-234,-1234,-12345, where “23” means C_2+C_3, “-234” means -C_2-C_3-C_4, etc. There are twenty-two cycles in all. The signature σ is not acyclic because the sum of the directed cycles 123, 245, -234, and -125 is zero. It is straightforward to check σ is triangulating by Theorem <ref>(2). (This should be done in minutes by hand. We remark that it is much harder to check σ or 𝒜_σ is triangulating by definition since there are 75 spanning trees. ) §.§ The Bernardi bijection We will apply our theory to recover and generalize some features of the Bernardi bijection in this subsection. For the definition of the Bernardi bijection f_𝒜_B,𝒜_q^, see Example <ref>. Note that the internal atlas 𝒜_q^ is a special case of 𝒜^_σ^, where σ^* is an acyclic cocycle signature <cit.>, so 𝒜_q^* is triangulating. The external atlas 𝒜_B is not triangulating in general (Remark <ref>). However, it is always dissecting. This fact was discovered and proved by Kalmán and Tóthmérész <cit.> in a different language; see Section <ref>. For readers' convenience, we give a proof here. <cit.> The external atlas 𝒜_B is dissecting. By definition, we need to check F=B_1∩(-B_2) has a potential cocircuit, where B_1 and B_2 are two different spanning trees. Consider the first edge e_0 where the Bernardi processes for B_1 and B_2 differ. Without loss of generality, we may assume e_0∈ B_1 and e_0∉ B_2. Consider the fundamental cocircuit C^* of e_0 with respect to B_1. We orient it away from q and get the signed cocircuit C^. We will prove that C^ is a potential cocircuit of F. See Figure <ref>. Note that the Bernardi tour for B_1 uses e_0 twice. When it visits e_0 the second time, any external edges f in C^* has been cut at least once. Recall that the notation B_1\|_f means (the set of) the arc f induced by the tour. There are two cases. (a) If the tour cuts f before its first visit to e_0, then -B_1\|_f⊆C^. (b) If the tour cuts f after its first visit to e_0, then B_1\|_f⊆C^. Hence F\|_f⊆C^. Now we look at the Bernardi process for B_2. We know the following two cases. (c) For any edge f in (a), we have B_2\|_f=B_1\|_f because the two tours coincide until they reach e_0. Hence F\|_f=∅⊆C^. (d) For the edge e_0, which is external with respect to B_2, we have -B_2\|_e_0⊆C^, and hence F\|_e_0⊆C^. By (b), (c), and (d), the signed circuit C^* is a potential cocircuit of F. Now we may apply Theorem <ref> and Theorem <ref> to f_𝒜_B,𝒜_q^* and get the following results, where Corollary <ref>(1) recovers the bijectivity of f_𝒜_B,𝒜_q^* proved in <cit.>, (2) extends it, and (3) generalizes it. Let G be a connected ribbon graph. * The Bernardi map f_𝒜_B,𝒜_q^* induces a bijection f_𝒜_B,𝒜_q^:B↦ [β_(q,e)] between the spanning trees of G and the cycle-cocycle reversal classes of G. The Bernardi map f_𝒜_B,𝒜_q^* can be extended to a bijection φ_𝒜_B,𝒜_q^* between subgraphs and orientations in the sense of Theorem <ref>. * Let σ^* be any triangulating cocycle signature. Then the modified Bernardi map f_𝒜_B,𝒜_σ^^ still has the properties (1) and (2). § LAWRENCE POLYTOPES In this section, we will prove Theorem <ref> and Theorem <ref> introduced in Section <ref> together with some basic properties of Lawrence polytopes. For the definitions, see Section <ref>. Here we recall that M_r× n is a totally unimodular matrix representing a loopless regular matroid ℳ. The Lawrence matrix is [ M_r× n 0; I_n× n I_n× n ], whose columns are denoted by P_1, ⋯, P_n, P_-1, ⋯, P_-n in order. The Lawrence polytope 𝒫∈ℝ^n+r is the convex hull of the points P_1, ⋯, P_n, P_-1, ⋯, P_-n. Due to duality, we will only prove Theorem <ref> and Theorem <ref> for 𝒫. The proof is long, so we divide the section into three parts. §.§ A single maximal simplex of the Lawrence polytope The target of this subsection is to characterize maximal simplices of the Lawrence polytope 𝒫. We start with three basic lemmas, and the proofs are omitted. We denote by (x_1, ⋯, x_r, y_1, ⋯, y_n) the coordinates of the Euclidean space ℝ^n+r containing 𝒫. The Lawrence polytope 𝒫 is in the affine subspace ∑_i=1^ny_i=1, and the affine subspace does not contain the origin and is of dimension n+r-1. The convex hull of k+1 points Q_1, ⋯, Q_k+1 in an affine subspace that does not pass through the origin is a k-dimensional simplex if and only if the corresponding vectors Q_1, ⋯, Q_k+1 are linearly independent. The linear combination ∑_i=1^n(a_iP_i+a_-iP_-i) is zero if and only if a_i=-a_-i for all i and ∑_i=1^n a_iM_i=0, where M_i is the i-th column of M. The vertices of 𝒫 are the points P_1, ⋯, P_n, P_-1, ⋯, P_-n. It suffices to show that any point P_i, where i could be positive or negative, cannot be express as a convex combination of the other points. Assume by contradiction that we can do so for some P_i. Then by Lemma <ref>, P_-i must have coefficient one in the convex combination, and hence P_i=P_-i. This contradicts our assumption that ℳ is loopless. Recall that we label the arcs of ℳ are denoted by e_1, ⋯, e_n and e_-1, ⋯, e_-n. We denote the underlying edge of the arc e_i by e_i, where i>0. We define the bijection χ:{vertices of 𝒫} →{arcs of ℳ} P_i ↦e_i We need the following lemma to characterize the maximal simplices of 𝒫. Let I⊆{1, ⋯, n, -1, ⋯, -n}. Then the vectors {P_i: i∈ I} is linear dependent if and only if there exists a bioriented circuit in {e_i: i∈ I}, where a bioriented circuit is the union of two opposite signed circuits (as sets of arcs). This is due to Lemma <ref> and the fact that a collection of columns M_i of M is linear dependent if and only if the corresponding edges e_i contain a circuit. (1) The Lawrence polytope 𝒫 has dimension n+r-1. (2) The map χ induces a bijection (still denoted by χ) χ:{maximal simplices of 𝒫} →{externally oriented bases of ℳ} a maximal simplex with vertices {P_i:i∈ I} ↦the fourientation {χ(P_i):i∈ I}. Clearly if a set F of arcs of ℳ does not contain a bioriented circuit, then its cardinality satisfies \|A\|≤ n+r, and the equality holds if and only if F is an externally oriented basis of ℳ. By Lemma <ref>, Lemma <ref>, and Lemma <ref>, the corollary holds. This finishes the proof of Theorem <ref>(1)(2). §.§ Two maximal simplices of the Lawrence polytope To show Theorem <ref>(3), which characterizes the triangulations and dissections of 𝒫, we first prove Proposition <ref>, which characterizes when two maximal simplices satisfy (II) and (III) in Definition <ref>, respectively. Note that when we say two simplices or two fourientations, they might be identical. We need some preparations. (1) If the vertices of a simplex S are some of the vertices of 𝒫, then S is called a simplex of 𝒫. (2) The relative interior of S is denoted by S^∘. The following lemma is basic, and the proof is omitted. Let S be a simplex and x∈ S. Then the point x can be uniquely written as a convex combination of the vertices of S. Moreover, x∈ S^∘ if and only if each vertex of S has a nonzero coefficient in the convex combination. The following lemma gives an equivalent description of (III) in Definition <ref>. The book <cit.> uses it as a definition. The proof is omitted. Let S_1 and S_2 be two maximal simplices of 𝒫. Then S_1 and S_2 intersect in a common face if and only if for any face A_1 of S_1 and any face A_2 of S_2 such that A_1^∘∩ A_2^∘≠∅, we have A_1=A_2. We aim at describing A_1^∘∩ A_2^∘=∅ in terms of fourientations (Lemma <ref>). Before this, we introduce a notation and a simple lemma without proof. Let F be a fourientation, then we let E(F)={e∈ E: F\|_e≠∅}. Let F_1 and F_2 be two fourientations of ℳ such that E(F_1)=E(F_2). Then F_1≠F_2 if and only if F=F_1∩(-F_2) contains a one-way oriented edge. Assume S_1 and S_2 are two simplices 𝒫 (not necessarily maximal). Let F_k be the fourientation χ(S_k) for k=1,2, and denote F=F_1∩(-F_2). Then S_1^∘∩ S_2^∘≠∅ if and only if E(F_1)=E(F_2) and any one-way oriented edge in F belongs to a potential circuit of F. By Lemma <ref>, when S_1=S_2, the statement holds. We only consider the case S_1≠ S_2. We first prove the “only if” part. Let x∈ S_1^∘∩ S_2^∘. Throughout the proof, k∈{1,2}. We denote by F_k the set of indices of the edges in E(F_k) (F_k⊆{1,⋯, n}). By Lemma <ref>, we may write x=∑_i∈ F_1(w_1i^+P_i+w_1i^-P_-i)=∑_i∈ F_2(w_2i^+P_i+w_2i^-P_-i), where the nonnegative coefficients w_ki^+, w_ki^- sum up to 1 for each k, and only when the edge e_i is one-way oriented in F_k, one of w_ki^+ and w_ki^- is zero. Now we compare the two convex combinations of x (recall Lemma <ref>). From the lower half of the Lawrence matrix, we get F_1=F_2 and w_1i^++ w_1i^-=w_2i^++w_2i^- for i∈ F_1. Denote w_i=w_1i^++ w_1i^-. It is clear that ∑_i∈ F_1w_i=1 and each summand w_i>0. Now we focus on the upper half of the Lawrence matrix. The computational results are summarized in Table <ref>, which compares the two convex combinations of x restricted to the top r entries. Denote by a_ki∈ℝ^r the top r entries of the vector w_ki^+P_i+w_ki^-P_-i for i∈ F_1. For every i∈ F_1, according to the status of the edge e_i in F, there are 4 possible types given in the first column of the table. We omit “\|_e_i” after F and F_k (e.g.F=↕ means F\|_e_i=↕). These 4 types are further divided into 9 types according to how F_1 and F_2 orient e_i. Note that neither F_1 nor F_2 could be empty over e_i. Then for each of the 9 types, we know whether P_i and P_-i are in S_k because F_k=χ(S_k). For example, when e_i is of the 4th type, P_i∈ S_1,P_-i∉ S_1, and hence w_1i^+P_i+w_1i^-P_-i=w_iP_i. So, the vector u_1i, which is the top r entries of w_1i^+P_i+w_1i^-P_-i, is w_iM_i for the 4th type. Similarly, one can get all the other results in the table. Because S_1≠ S_2 and F_1=F_2, by Lemma <ref>, there exists an edge in rows 4 to 9. By definition, ∑_i∈ F_1(a_1i-a_2i)=0. Denote the coefficients of M_i in the last column of the table by u_i∈ℝ and let u∈ℝ^r be the column vector (u_i)_1≤ i≤ r, where we set u_i=0 for i∈{1,⋯,n}\ F_1, so Mu=∑_i∈ F_1u_iM_i=∑_i∈ F_1(a_1i-a_2i)=0. By applying Lemma <ref> to u∈_ℝ(M), we may decompose u into a linear combination ∑ k_jC_j of signed circuits, where k_j>0 and for each edge e_i of each C_j, the sign of e_i in C_j agrees with the sign of u_i. However, by the table, for each edge e_i that is one-way oriented in F (rows 4 to 9), the sign of u_i agrees with F\|_e_i (comparing the first column with the last column). So, as sets of arcs, C_j⊆F. Hence any one-way oriented edge in F belongs to a potential circuit C_j of F. For the “if” part, our proof strategy is to reverse the proof of the “only if” part. Note that the second column of the table still lists all the possible types of edges e∈ F_1(=F_2), and there exists at least one edge in rows 4 to 9 by Lemma <ref>. Because any one-way oriented edge in F belongs to a potential circuit of F, by adding these signed circuit up, we get a vector u=(u_i)∈_ℝ(M), where for each edge e_i that is one-way oriented in F, the sign of u_i agrees with F\|_e_i. Intuitively, u agrees with the sign pattern (including zero) of the last column of the table from row 2 to row 9 but the weights “w” are not normalized. Then for each i∈ F_1, we write u_iM as a_1i-a_2i such that a_ki is a multiple of M_i and agrees with the sign pattern (including zero) of a_ki in the table, which is always feasible because the coefficients of M_i are allowed to be larger than 1. Then we find nonnegative numbers w_ki^+ and w_ki^- such that * a_ki is the top r entries of the vector w_ki^+P_i+w_ki^-P_-i; * w_1i^++ w_1i^-=w_2i^++w_2i^-; * the sign pattern agrees with the second column of the table (i.e., w_ki^+=0⇔F_k\|_e_i=e_-i and w_ki^-=0⇔F_k\|_e_i=e_i). It is straightforward to check this is also feasible. Lastly, we normalize the weights w_ki^+ and w_ki^- to obtain w_ki^+ and w_ki^- such that the total sum is 1 for each k. The point x=∑_i∈ F_1(w_1i^+P_i+w_1i^-P_-i)=∑_i∈ F_2(w_2i^+P_i+w_2i^-P_-i) is in S_1^∘∩ S_2^∘. We are ready to prove the main result of this subsection. Let S_1 and S_2 be two maximal simplices of 𝒫. Let B_k be the externally oriented basis χ(S_k) for k=1,2, and denote F=B_1∩(-B_2). * S_1^∘∩ S_2^∘=∅ if and only if F has a potential cocircuit. * S_1 and S_2 intersect at a common face if and only if F has no potential circuit. * If one of the equivalent conditions in (1) or (2) holds, then S_1≠ S_2 implies B_1≠ B_2. First we prove (3). Assume by contradiction that B_1=B_2. Then F is a fourientation where the internal edges are all bioriented and there exists one external edge that is one-way oriented due to B_1≠B_2. So, F has no potential cocircuit and has a potential circuit, which gives the contradiction. For (1), we apply Lemma <ref> to S_1 and S_2. Since E(B_1)=E(B_2) always holds, S_1^∘∩ S_2^∘=∅ if and only if there exist a one-way oriented edge in F such that it does not belong to any potential circuit of F. By Lemma <ref>, we find a potential cocircuit of F. For (2), we apply Lemma <ref>. The maximal simplices S_1 and S_2 do not intersect in a common face if and only if there exist two distinct faces A_1 of S_1 and A_2 of S_2 such that A_1^∘∩ A_2^∘≠∅, which by Lemma <ref> is equivalent to (⋆) there exist two distinct fourientations F_1⊆B_1 and F_2⊆B_2 such that E(F_1)=E(F_2) and any one-way oriented edge in F_0:=F_1∩(-F_2) belongs to a potential circuit of F_0. It remains to show (⋆) is equivalent to F having a potential circuit. If (⋆) holds, then F_0⊆F, and hence a potential circuit of F_0 is also a potential circuit of F. By Lemma <ref>, there is indeed a one-way oriented edge in F_0. Thus F has a potential circuit. Conversely, if F has a potential circuit C, then there must be a one-way oriented edge in F\|_C (because in general B_1∩(-B_2) does not contain bioriented circuits). Set F_1=B_1\|_C and F_2=B_2\|_C. Clearly, we have E(F_1)=E(F_2) and F_0=F\|_C. By Lemma <ref>, F_1≠F_2. So, (⋆) holds. §.§ Volume of the Lawrence polytope and Theorem <ref>(3) Proposition <ref> is close to Theorem <ref>(3). It remains to show the maximal simplices coming from a dissecting atlas or a triangulating atlas indeed cover the Lawrence polytope 𝒫. Unfortunately, we cannot find a direct proof showing that any point of 𝒫 is in some maximal simplex that comes from the given atlas. Instead, we make use of volume. Recall that 𝒫 is in the affine space ∑_i=1^ny_i=1, and the affine space is in ℝ^n+r with coordinate system (x_1, ⋯, x_r, y_1, ⋯, y_n). For a polytope S, we denote by vol(S) the volume of S. We first compute the volume of a maximal simplex of 𝒫. Let S be a maximal simplex of 𝒫. Then vol(S)=√(n)/(n+r-1)!, where n is the number of edges and n+r-1 is the dimension of 𝒫. In particular, all the maximal simplices of 𝒫 have the same volume. Consider the pyramid S with the base S and the apex O. The height of S is the distance from O to the affine hyperplane ∑_i=1^ny_i=1, so vol(S)=1/(S)·base·height=1/n+r·vol(S)·1/√(n). Another way to compute vol(S) is using a determinant. Note that S is a simplex and one of its vertices is O. The coordinates of the n+r vertices of S are the corresponding columns of the Lawrence matrix [ M_r× n 0; I_n× n I_n× n ]. Thus they form a (n+r)×(n+r) submatrix N. Hence vol(S)=1/(S)!·\|(N)\|. Because M is totally unimodular, appending a standard unit vector to it still results in a totally unimodular matrix. By doing this repeatedly, we see that the Lawrence matrix is totally unimodular. Hence (N)=± 1 and vol(S)=1/(n+r)!. By combining the two formulas of vol(S), we get the desired formula. Then we try to find one triangulating atlas and one triangulation of 𝒫. The existence of triangulation is proved by constructing regular triangulations; see <cit.>. We will compute regular triangulations of 𝒫 in Section <ref>. There exists a triangulation of 𝒫. To show the existence of triangulating atlas, we show the existence of acyclic signatures, which is implicitly proved in <cit.> by making use of the following equivalent definition of acyclic signatures. <cit.> Let σ be a circuit signature of ℳ. Then σ is acyclic if and only if there exists w∈ℝ^E such that w·C>0 for each signed circuit C∈σ, where the product is the usual inner product. Let ℳ be a regular matroid. * <cit.> There exists an acyclic circuit signature if ℳ has at least one circuit. * There exists a triangulating external atlas. (1) We can always find w∈ℝ^E such that w·C≠ 0 for any signed circuit C. Then put the signed circuits with positive inner products into σ. By Lemma <ref>, σ is acyclic. (2) If ℳ has at least one circuit, then by Lemma <ref>, 𝒜_σ is triangulating. If ℳ has no circuit, then ℳ has only one basis E. By definition, 𝒜 is triangulating. Now we play a trick to find the volume of 𝒫 and hence prove Theorem <ref>(3). (1) The volume of the Lawrence polytope 𝒫 is vol(𝒫)=(the number of bases of ℳ)·√(n)/(n+r-1)!. (2) The map χ induces two bijections χ:{triangulations of 𝒫} →{triangulating external atlases of ℳ} a triangulation with maximal simplices {S_i:i∈ I} ↦the external atlas {χ(S_i):i∈ I}, and χ:{dissections of 𝒫} →{dissecting external atlases of ℳ} a dissection with maximal simplices {S_i:i∈ I} ↦the external atlas {χ(S_i):i∈ I}. (1) We denote the number of bases of ℳ by b. By Lemma <ref>, the number of the maximal simplices used in a dissection (and hence a triangulation) of 𝒫 is a constant t, and we need to show t=b. Because there exists a triangulating external atlas 𝒜 (Lemma <ref>), by Lemma <ref>(2), the volume of 𝒫 is not less than the total volume of the corresponding maximal simplices (via χ). Thus t≥ b. Because there exists a triangulation of 𝒫 (Lemma <ref>), by Lemma <ref>(2)(3), the externally oriented bases corresponding to the maximal simplices in the triangulation have distinct underlying bases. Thus t≤ b. Therefore t=b. (2) This is direct consequences of Lemma <ref>(1)(2) and part (1). §.§ Regular triangulations and acyclic signatures For the basics of regular triangulations, we refer the readers to <cit.> and <cit.>. Here we recall the construction of regular triangulations of a polytope 𝒫⊆ℝ^n with the vertex set V. (i) Pick a height function h:V→ℝ. Lift each vertex v∈ V in ℝ^n to ℝ^n+1 by appending h(v) to the coordinate of v. Take the convex hull of the lifted vertices and get a lifted polytope 𝒫'. (ii) Project the lower facets of 𝒫' onto ℝ^n. Here, a lower facet is a facet that is visible from below (i.e., a facet whose outer normal vector has its last coordinate negative). (iii) When all the lower facets are simplices, the projected facets form a triangulation of 𝒫, called a regular triangulation. (See <cit.> for a proof.) Recall the map α:σ↦𝒜_σ is a bijection between triangulating circuit signatures and triangulating external atlases of ℳ, and the map χ is a bijection between triangulations of 𝒫 and triangulating external atlases. The restriction of the bijection χ^-1∘α to the set of acyclic circuit signatures of ℳ is bijective onto the set of regular triangulations of 𝒫. In this proof, we use bold letters to represent column vectors. In particular, the vertices P_i of 𝒫 will be denoted by 𝐏_i instead. Recall that a circuit signature σ is acyclic if and only if there exists 𝐰∈ℝ^E such that 𝐰^T ·𝐂>0 for each signed circuit 𝐂∈σ (Lemma <ref>). First, we prove that a regular triangulation can always be obtained from an acyclic signature. Recall that (x_1, ⋯, x_r, y_1, ⋯, y_n) denotes the coordinate of a point in ℝ^n+r and 𝒫 spans the affine subspace ∑_i=1^ny_i=1 (Lemma <ref> and Corollary <ref>). To lift the vertices 𝐏_i of 𝒫, we use the space ℝ^n+r and lift 𝐏_i along the normal vector 𝐧_P=(0, ⋯, 0, 1, ⋯, 1)^T of the affine subspace that 𝒫 lives in. To be precise, we lift 𝐏_i to 𝐏_i+h_i·𝐧_P, for i=1, ⋯, n, -1, ⋯, -n, and get the lifted polytope 𝒫'. For any maximal simplex S of 𝒫, let S' be the lifted S. It is easy to check S' must be a simplex. We use the following method to decide whether S' is a lower facet of 𝒫'. Let H be the unique hyperplane of ℝ^n+r that contains S'. Then S' is a lower facet of 𝒫' if and only if for any vertex 𝐏_j of 𝒫 not in S, we have h_j>h_j, where h_j is the unique number such that 𝐏_j+h_j·𝐧_P∈ H. Intuitively, we use the new number h_j to lift 𝐏_j so that it lies in H, so h_j>h_j means if we lift 𝐏_j by h_j, then it is higher than H. It is not hard to check that this method is valid. Set 𝐰=(h_1-h_-1, ⋯, h_n-h_-n)^T∈ℝ^n. Let B=χ(S). 𝐂𝐥𝐚𝐢𝐦: For any 𝐏_j that is not a vertex of S, h_j>h_j if and only if 𝐰^T·𝐂_j>0, where 𝐂_j is the signed fundamental circuit with respect to B and e_j=χ(𝐏_j). Now we prove the claim. The idea is that h_j should be determined by {h_i:𝐏_i∈ S}. Denote the equation of H by H:𝐧_H^T·𝐱=c, where 𝐧_H=(a_1, ⋯, a_r, b_1, ⋯, b_n)^T is the normal vector and 𝐱∈ℝ^n+r . Note that H cannot be perpendicular to the affine space 𝒫 spans. So ∑_i=1^nb_i=𝐧_H^T·𝐧_P≠ 0. Without loss of generality, we may assume ∑_i=1^nb_i=1. Because H contains S', we have equalities c=𝐧_H^T· (𝐏_i+h_i·𝐧_P)=𝐧_H^T·𝐏_i+h_i, for all the vertices 𝐏_i of S. We also have c=𝐧_H^T·𝐏_j+h_j. Because 𝐂_j is a signed circuit, we have M·𝐂_j = 0 ⇒ (𝐏_1-𝐏_-1,𝐏_2-𝐏_-2, ⋯, 𝐏_n-𝐏_-n)·𝐂_j = 0 ⇒ 𝐧_H^T·(𝐏_1-𝐏_-1,𝐏_2-𝐏_-2, ⋯, 𝐏_n-𝐏_-n)·𝐂_j = 0 ⇒ 𝐧_H^T·(𝐏_1-𝐏_-1,𝐏_2-𝐏_-2, ⋯, 𝐏_n-𝐏_-n)·𝐂_j = 0. In the last equality, we focus on the vertices 𝐏_i and 𝐏_-i such that the i-th entry of 𝐂_j is non-zero since the other terms contribute zero to the left-hand side. These vertices correspond to the arcs in 𝐂_j and -𝐂_j. By the definitions of 𝐂_j and B, these vertices are all in S except 𝐏_j. Thus by (<ref>), (<ref>), and (<ref>), we have (h_1-h_-1,⋯,h_j-h_-j, ⋯, h_n-h_-n)·𝐂_j = 0, for j>0; (h_1-h_-1,⋯,h_-j-h_j, ⋯, h_n-h_-n)·𝐂_j = 0, for j<0. Note that the \|j\|-th entry of 𝐂_j has the same sign as j. Therefore h_j>h_j if and only if 𝐰^T·𝐂_j>0. (End of the proof of the claim) By the claim, the lower facets of 𝒫' correspond to the externally oriented bases in 𝒜_σ, where σ is the acyclic signature induced by -𝐰=(h_-1-h_1, ⋯, h_-n-h_n)^T. Thus any regular triangulation comes from an acyclic signature. Conversely, if we have an acyclic circuit signature induced by some vector -𝐰, then we may construct the heights h_i such that 𝐰=(h_1-h_-1, ⋯, h_n-h_-n)^T, and get a lifted polytope 𝒫'. Still by the claim, the lower facets of 𝒫' come from the maximal simplices S=χ^-1(B) of 𝒫, where B∈𝒜_σ. So, the triangulation χ^-1(A_σ) is regular. This completes proving the results in Section <ref>. § A TILING INDUCED BY THE MAIN BIJECTION Φ_𝒜,𝒜^* In this section, we make use of some results in <cit.> to prove Theorem <ref>, which builds a tiling of the simplex 𝒮; for the introduction and definitions see Section <ref>. First we need to recall some notions and results in <cit.>. not the same cube Consider the hypercube 𝒞={x∈ℝ_≥ 0^2n: x(i)+x(-i)=1, for all i} and the half-open cell hoc(𝒞,O,A)={x∈𝒞: x(O_i)≠ 0, for e_i∈ A; x(-O_i)= 0, for e_i∉ A}, where O is an orientation and A⊆ E. intuitively... Let φ:{orientations of ℳ}→{susets of E} be a map. <cit.> The map φ is tiling if and only if 𝒞=_Ohoc(𝒞,O,φ(O)), where the disjoint union is over all the orientations of ℳ. The proposition has the following weighted version. Let w=(w_1,⋯, w_n)∈ℝ_≥ 0^n be a weight vector. Let 𝒞_w={x∈ℝ_≥ 0^2n: x(i)+x(-i)=w_i, for all i}, hoc(𝒞_w,O,A)={x∈𝒞_w: x(O_i)≠ 0, for e_i∈ A; x(-O_i)= 0, for e_i∉ A}. Then we have the following corollary of Proposition <ref>, which can be proved by a simple dilation argument. If w_i≠ 0 for all i, then φ is tiling if and only if 𝒞_w=_Ohoc(𝒞_w,O,φ(O)). Recall that 𝒮={x∈ℝ_≥ 0^2n: ∑_i=1^n(x(i)+x(-i))=1}, hoc(𝒮,O,A)={x∈𝒮: x(O_i)≠ 0, for e_i∈ A; x(-O_i)= 0, for e_i∉ A}. Suppose the map φ is tiling and let A be a nonempty subset of E. Define a map ψ_A: {subsets of A} →{orientations of A} H ↦ (φ^-1(H))\|_A. * ψ_A is a bijection. * The map φ_A=ψ_A^-1 is tiling. * The domain of φ_A equals {O\|_A:φ(O)⊆ A}. * For any orientation O of E such that φ(O)⊆ A, we have φ_A(O\|_A)=φ(O). Because φ is tiling, for any two distinct subsets H_1 and H_2 of A, there exists an edge e such that e∈ H_1△ H_2 and φ^-1(H_1)\|_e≠φ^-1(H_2)\|_e. Note that e∈ A, so φ^-1(H_1)\|_A≠φ^-1(H_2)\|_A. This implies (1) and (2). The surjectivity of ψ_A implies (3). To get (4), we let H=φ(O) and hence ψ_A(φ(O))=O\|_A. Then take the inverse. The map φ is tiling if and only if 𝒮=_Ohoc(𝒮,O,φ(O)), where the disjoint union is over all the orientations of ℳ. Let W={w∈ℝ_≥ 0^n:∑_i=1^nw_i=1}. Because 𝒮=_w∈ W𝒞_w, we have 𝒮=_Ohoc(𝒮,O,φ(O)) ⇔ ∀ w∈ W,𝒞_w=_Ohoc(𝒞_w,O,φ(O)). So, if we have (<ref>), then φ is tiling by Corollary <ref>. Conversely, if φ is tiling, we want to show (<ref>) holds for any w∈ W possibly with some w_i=0. Fix w∈ W and let E_w={e_i∈ E: w_i≠ 0}⊆ E. Note that if φ(O)⊈ E_w, then hoc(𝒞_w,O,φ(O))=∅, because x(O_i)≠ 0 cannot hold when e_i∈φ(O)\ E_w. Hence we only need to show 𝒞_w=_O:φ(O)⊆ E_whoc(𝒞_w,O,φ(O)). We write points x=(x(i):i=± 1,⋯, ± n)∈ℝ_≥ 0^2n as the Cartesian product (x(i):e_\|i\|∈ E_w)×(x(i):e_\|i\|∉ E_w). Hence 𝒞_w=𝒞_w×0, where w is the vector obtained from w by removing the zero entries, 𝒞_w is a hypercube in ℝ_≥ 0^2\|E_w\|, and 0 is the zero vector in ℝ_≥ 0^2n-2\|E_w\|. We also have _O:φ(O)⊆ E_whoc(𝒞_w,O,φ(O)) = _O:φ(O)⊆ E_whoc(𝒞_w,O\|_E_w,φ(O))×0 = _O:φ(O)⊆ E_whoc(𝒞_w,O\|_E_w,φ_A(O\|_E_w)) ×0 (by Lemma <ref>(4)) = _orientation O_A of Ahoc(𝒞_w,O_A,φ_A(O_A)) ×0 (by Lemma <ref>(3)) = 𝒞_w×0 (by Corollary <ref>). Thus (<ref>) holds. The above theorem and Theorem <ref> imply Theorem <ref>. § ACKNOWLEDGEMENT Many thanks to Olivier Bernardi for orienting the author toward the study of this project and for countless helpful discussions. Thanks to Spencer Backman, Matt Baker, and Chi Ho Yuen for helpful discussions. Thanks to Matt Baker for helpful comments on the first draft of the paper. Thanks to Gleb Nenashev for proving Theorem <ref>. 99 AKBS Y. An, M. Baker, G. Kuperberg, and F. Shokrieh. Canonical representatives for divisor classes on tropical curves and the matrix-tree theorem. Forum Math. Sigma, 2:e24, 25, 2014. B S. Backman. Riemann-Roch Theory for Graph Orientations. Advances in Mathematics 309, 655-691, 2017. BBY Spencer Backman, Matthew Baker, and Chi Ho Yuen. Geometric Bijections for Regular Matroids, Zonotopes, and Ehrhart Theory. Forum of Mathematics, Sigma, vol. 7, 2019. BH Spencer Backman and Sam Hopkins. Fourientations and the Tutte polynomial. Res Math Sci 4, 18, 2017. BW M. Baker and Y. Wang. The Bernardi process and torsor structures on spanning trees. Int. Math. Res. Not., 16(2018):5120-5147, 2018. BS M. Bayer and B. Sturmfels. Lawrence polytopes. Canad. J. Math., 42(1):62-79, 1990. Bernardi O. Bernardi. Tutte polynomial, subgraphs, orientations and sandpile model: new connections via embeddings. Electron. J. Combin., 15(1):Research Paper 109, 53, 2008. BVSWZ Anders Björner, Michel Las Vergnas, Bernd Sturmfels, Neil White, and Günter M. Ziegler. Oriented matroids. volume 46 of Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge, second edition, 1999. D A. Dall. Matroids: h-vectors, zonotopes, and Lawrence polytopes. Ph.D. Thesis, 2015. DRS Jesús A. De Loera, Jörg Rambau, and Francisco Santos. Triangulations, Structures for Algorithms and Applications. Algorithms and Computation in Mathematics, vol. 25, Springer-Verlag, Berlin, 2010. D2 Changxin Ding. Geometric bijections between spanning subgraphs and orientations of a graph. Preprint, arXiv:2109.01930 GNP Pavel Galashin, Gleb Nenashev, and Alexander Postnikov. “Trianguloids and triangulations of root polytopes”. arXiv:1803.06239, 2018. G1 Emeric Gioan. “Enumerating degree sequences in digraphs and a cycle-cocycle reversing system.” European J. Combin. 28 (2007):1351–1366. G2 Emeric Gioan. “Circuit-cocircuit reversing systems in regular matroids.” Ann. Comb. 12 (2008): 171–182. GY Emeric Gioan and Chi Ho Yuen. “On the number of circuit-cocircuit reversal classes of an oriented matroid.” Discrete Math. 342(2019): 1056-1059. HRS B. Huber, J. Rambau, and F. Santos. The Cayley trick, lifting subdivisions and the Bohne-Dress theorem on zonotopal tilings. Journal of the European Mathematical Society, 2, 179-198, 2000. K Tamás Kalmán. A version of Tutte's polynomial for hypergraphs. Advances in Mathematics, 244:823-873, 2013. KT1 Tamás Kalmán and Lilla Tóthmérész. Hypergraph polynomials and the Bernardi process. Algebraic Combinatorics, 3(5):1099-1139, 2020. KT2 Tamás Kalmán and Lilla Tóthmérész. Root polytopes and Jaeger-type dissections for directed graphs. Mathematika, 68: 1176-1220, 2022. LS Carl W. Lee and Francisco Santos. Subdivisions and triangulations of polytopes. In J. E. Goodman, J. O'Rourke, C. D. Tóth, editors, Handbook of Discrete and Computational Geometry (3rd edition), pages 415-448. CRC Press, Boca Raton, 2018. O James Oxley. Matroid theory. volume 21 of Oxford Graduate Texts in Mathematics. Oxford University Press, Oxford, second edition, 2011. P Alexander Postnikov. Permutohedra, associahedra, and beyond. Int. Math. Res. Not., IMRN 2009, no. 6, 1026-1106, 2009. SW Yi Su and David G. Wagner. “The lattice of integer flows of a regular matroid.” J. Combin. Theory Ser. B 100 (2010): 691–703. Yuen Chi Ho Yuen. Geometric Bijections Between Spanning Trees and Break Divisors. Journal of Combinatorial Theory, Series A, 152:159-189, 2017. Yuen2 Chi Ho Yuen. Geometric Bijections of Graphs and Regular Matroids. Ph.D. thesis, Georgia Institute of Technology, 2018. Z Günter M. Ziegler. Lectures on Polytope. volume 152 of Graduate Texts in Mathematics. Springer-Verlag, New York, 1995.
http://arxiv.org/abs/2307.04814v1	20230701155842	Controlling the electron-phonon heat exchange in a metallic film by its position in a dielectric slab	[ "D. V. Anghel", "M. Dolineanu", "J. Bergli", "I. J. Maasilta" ]	cond-mat.mes-hall	[ "cond-mat.mes-hall", "cond-mat.mtrl-sci" ]	Controlling the electron-phonon heat exchange in a metallic film by its position in a dielectric slab D. V. AnghelInstitutul National de Cercetare-Dezvoltare pentru Fizica si Inginerie Nucleara Horia Hulubei, 077125 Magurele, Ilfov, Romania, Research Institute of the University of Bucharest (ICUB), 050663 Bucharest, Romania, BLTP, JINR, Dubna, Moscow region, 141980, Russia, [email protected], M. DolineanuInstitutul National de Cercetare-Dezvoltare pentru Fizica si Inginerie Nucleara Horia Hulubei, 077125 Magurele, Ilfov, Romania, Doctoral School of Physics, University of Bucharest, Faculty of Physics, 077125 Magurele, Ilfov, Romania, [email protected], J. BergliDepartment of Physics, University of Oslo, PO Box 1048, Blindern, 0316 Oslo, Norway, [email protected], and I. J. MaasiltaNanoscience Center, Department of Physics, University of Jyvaskyla, FI-40014 Jyväskyä, Finland, [email protected] July 31, 2023 ========================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================== We theoretically study the heat flux between electrons and phonons in a thin metallic film embedded in a suspended dielectric slab (called a membrane, in accordance with the established nomenclature), forming a layered structure. The thickness of the membrane is much smaller than the other two dimensions and, in the considered temperature range, is comparable to the dominant phonon wavelength. The thickness of the metallic layer is an order of magnitude smaller than the thickness of the membrane. While the dependence of the heat exchange on the thicknesses of the film and of the membrane has been studied before, it is not yet known how this depends on the position of the film inside the membrane. Here we show that the position strongly influences the heat exchange. If we denote by T_e the effective temperature of the electrons in the metal and by T_ph the effective temperature of the phonons (assumed to be uniform in the entire system), then we may write in general the heat power as P ≡ P^(0)(T_e) - P^(0)(T_ph), where P^(0)(T) ≡ P_s^(0)(T) + P_a^(0)(T), with P_s^(0)(T) and P_a^(0)(T) being the contributions of the symmetric and antisymmetric Lamb modes, respectively. In the low temperature limit, we may write P_s^(0)(T) ≡ C_s T^4 and P_a^(0)(T) ≡ C_a T^3.5, where C_s is independent of the position of the film inside the membrane, whereas C_a increases with the distance between the mid-plane of the film and the mid-plane of the membrane, being zero when the film is at the center of the membrane. Our examples show that by changing the position of the film inside the membrane one may change the electron-phonon heat power by orders of magnitude, depending on the dimensions and the temperature range. § INTRODUCTION Nanosystems are of great importance for current technological applications. Therefore, understanding their physical properties is necessary for both basic science and technology development. One such property is the electron-phonon coupling and heat exchange in nanoscopic systems consisting of metallic films in contact with dielectric suspended membranes, since structures like this appear, for example, in ultrasensitive detectors <cit.> and microrefrigerators <cit.>. At low temperatures, the electron-phonon heat exchange becomes weak enough that one can consider the electrons and the acoustic phonons in separate thermal equilibrium, at effective temperatures T_e and T_ph, respectively. Then, the heat exchange may be written in general as P(T_e, T_ph) ≡ P^(0)(T_e) - P^(1)(T_ph), but the thermal equilibrium condition P(T, T) = 0 implies that P^(0)(T) = P^(1)(T) is the same function. If the “exponent” x ≡ dln[P^(0)(T)]/ dT = dln[P^(1)(T)]/ dT is constant on a wide temperature range (orders of magnitude), then one may use the approximation P ∝ T_e^x - T_ph^x. For example, in clean three-dimensional (3D) bulk systems, where the electron mean free path is longer than the thermally dominant phonon wavelength, x = 5 <cit.>, whereas for (clean, non-disordered) two-dimensional (2D) phonons in graphene, x=4 <cit.>, and for a quasi one-dimensional (1D) phonon system x=3 <cit.> (clean limit). Thus, it would at first seem thatx = s+2, where s is the dimensionality of the phonon gas. However, the above statement in not generally true, as was shown in previous theoretical studies of the electron-phonon heat exchange in thin quasi-2D suspended layered nano-structures <cit.>. In those studies, the structure consists of a metallic film, of a thickness of the order of 10 nm, on top of a dielectric membrane, of a thickness of the order of 100 nm. Then, in the low temperature limit (which, for the parameters mentioned above, is of the order of 100 mK or below), the heat power flow between electrons and phonons obeys the simple power law dependence on temperature P(T_e, T_ph) ∝ T_e^3.5 - T_ph^3.5 – so, x = 3.5 and s=1.5 <cit.>. But as the temperature increases, x starts to vary in a wide range, from 3.5 reaching approximately 4.7 at around 0.5 K <cit.>. This is close to the experimentally observed value of x ∼ 4.5, measured for both SiN/Cu <cit.> and SiO2/Au <cit.> suspended membrane devices. In contrast to previous work <cit.> where the metallic film was located on top of a dielectric membrane, here we study the effect of the position of the metallic film inside the dielectric membrane on the electron-phonon heat exchange. We observe that while in the high temperature range (roughly above 1 K for the parameters used here) the heat exchange is almost independent of the position of the metallic film, in the low temperature sub-Kelvin limit the heat power flow decreases as the metal film is placed closer and closer to the center of the membrane, by up to one order of magnitude at 10 mK. This provides an additional method to control the electron-phonon heat exchange, which is an important characteristic for the responsivity and noise of bolometric detectors and the effectiveness of microrefrigerators, without changing the materials or the thickness of the layers. The article is organized as follows: in Section <ref> we describe the system and the models used, in Section <ref> we present the numerical results, and in Section <ref> we draw the conclusions. § METHODS §.§ System description The system, of total dimensions L_x × L_y × L_z, is schematically represented in Fig. <ref> and consists of a metallic layer (red) embedded within a suspended dielectric slab. We consider that L_x, L_y ≫ L_z and L_z may be comparable to the dominant phonon wavelength in the temperature range of interest. The metallic layer has the dimensions L_x × L_y × d, where d = d_2-d_1 is the metal layer thickness, and -L_z/2 ≤ d_1 < d_2 ≤ L_z/2. Although the following equations are general, we consider in the numerical examples that L_z is 100 nm and d is 10 nm, which are dimension scales relevant for real devices. We assume that the electron mean free path is longer than d <cit.> and that the phonon mean free path is longer than L_z, and assume smooth interfaces and surfaces without diffusive scattering. In the x and y directions the electron wavefunction ψ is periodic (free motion), whereas at z=d_1, d_2 we assume Dirichlet boundary conditions (ψ = 0)–this is a good approximation for metals which have a tall potential barrier at the surface so that the electron wavefunction does not extend much outside of the metallic layer. Then, we can write the electron wavefunction as ψ __∥,n_z(,t) ≡ ψ __∥,k_z(,t) = ϕ _k_z(z)e^i(_∥_∥-ϵ__∥,nt/ħ )/√(A), where ϕ _k_z(z) = {[ √(2/d)sin[ ( z - d_1) k_z] , if z ∈ [d_1, d_2] ,; 0 , if z ∉ [d_1, d_2] , ]. where _∥ and k_z are the wave vector components parallel and perpendicular to the metal film, respectively. The boundary conditions quantize the components of the wavevector to k_x = 2π n_x/L_x, k_y = 2π n_y/L_y, and k_z = π n_z/L, where n_x,y∈ (integer), whereas n_z ∈ (positive integer). These quantization conditions induce a constant (but non-isotropic) density of states (DOS) in the space, namely, σ_≡σ_k_xσ_k_yσ_k_z, where σ_k_x≡ L_x/(2π), σ_k_y≡ L_y/(2π), and σ_k_z≡ d/π. Similarly, we denote σ__∥≡σ_k_xσ_k_y and since σ_k_x, σ_k_y≫σ_k_z, we shall say that the states of constant k_z form quasi-continuous 2D conduction bands, with a band index n_z. If we denote by m_e the electron's effective mass, then its energy is ϵ_𝐤= ħ ^2k^2/2m_e = ħ^2k_∥^2/2m_e + ħ ^2k_z^2/2m_e≡ϵ _k_∥,k_z≡ϵ _k_∥,n_z, where k_∥≡ \|_∥\|. The minimum energy in the band n_z is ϵ _k_∥ = 0,n_z = ħ ^2k_z^2/(2m_e) = (ħπ n_z)^2/(2m_e d^2) and the difference in energy between two consecutive bands, at the same k_∥, is Δϵ _k_∥,n_z≡ϵ _k_∥,n_z+1 - ϵ _k_∥,n_z = ħ^2 π^2 (2n_z + 1) /(2m_e d^2). We denote the Fermi energy by ϵ_F and define n_F ≡⌊√(2m_eϵ_F)/πħ d ⌋ , where ⌊ x⌋ is the biggest integer smaller or equal to x. Then, ϵ _k_∥ = 0,n_z≤ϵ_F if and only if n_z≤ n_F. Therefore, at T ≪Δϵ _k_∥,n_F/k_B (k_B is the Boltzmann constant), only the bands of n_z ≤ n_F will be populated, plus, eventually, the band n_z=n_F+1, if ϵ_F is close enough to ϵ _0,n_F+1. To describe the phonons in our system, we assume that the whole slab (from z = -L_z/2 to L_z/2) may be treated as a homogeneous isotropic elastic material <cit.>. Although a real slab would consist of different materials with differing elastic properties, our simplifying assumption is accurate enough to emphasize the qualitative features of the electron-phonon heat exchange we investigate. The phonon modes in slabs have been studied before <cit.> and they differ from the phonon modes in bulk materials. There are three types or polarizations: horizontal shear (h), symmetric (s), and antisymmetric (a) phonon modes (known as Lamb waves) <cit.>. All these modes propagate in the direction parallel to the (x,y) plane and are stationary waves along the z axis. The h modes are simple transverse horizontal shear modes, with a displacement field parallel to the (x,y) plane. Their wave vector ≡_∥ + q_th has the components parallel _∥≡ q_∥ x + q_∥ y and perpendicular to the membrane q_th, where q_∥ x = 2πν_x/L_x, q_∥ y = 2πν_y/L_y, and q_th = πν_z /L (notice that here th signifies t= transverse and h= horizontal shear). The quantization conditions ν_x, ν_y = …, -1, 0, 1, …, and ν_z = 0, 1, … are imposed by the periodic boundary conditions in the and directions and free boundary conditions in the direction <cit.>. As in the case of electrons, the phonon modes with the same ν_z and any _∥ form 2D bands <cit.>. The s and a Lamb modes, in contrast, are a superposition of transverse and longitudinal waves, with displacement fields oscillating in a plane perpendicular to the (x,y) plane. Both, the longitudinal and the transverse partial waves have the same component _∥ of the wave vector parallel to the (x,y) plane, whereas the components parallel to the z axis, q_l and q_t, respectively, satisfy the equation <cit.> - 4q_∥^2 q_l q_t/(q_∥^2- q_t ^2)^2 = [ tan( q_tL/2)/tan( q_lL/2)]^± 1, where the exponents 1 and -1 on the right hand side (r.h.s) of Eq. (<ref>) correspond to the symmetric (s) and antisymmetric (a) modes, respectively. Equation (<ref>) relate q_l and q_t for any q_∥ and for each polarization s and a. Another relation that has to be satisfied <cit.> for q_t and q_l is the Snell's law ω_q_∥ = c_l√(q_l^2+q_∥^2) = c_t√(q_t^2+q_∥^2) , where ω_q_∥ is the angular frequency-wave vector dispersion relation of the mode. Solving Eqs (<ref>) we obtain an infinite, countable set of solutions [q_t,ν_z,σ(q_∥), q_l,ν_z,σ(q_∥)], where σ stands for the polarization s or a, and ν_z = 0,1,…. The components q_t,ν_z,σ(q_∥) and q_l,ν_z,σ(q_∥) take either real or imaginary values, but never complex values, with both, real and imaginary components <cit.>; when they are imaginary, we use the notation q_t,ν_z,σ≡ i p_t,ν_z,σ and q_l,ν_z,σ≡ i p_l,ν_z,σ. To make the notations uniform, in the following we make use of the doublets ξ≡ (ν_z,σ), where ν_z = 0,1,… and σ = h,s,a. Then, the displacement fields of all the phonon modes are of the form __∥ξ(, t) ≡e^i (_∥_∥ - ω_q_∥ξ t)/2π__∥ξ(z) . The z dependence of the displacement field of the phonon modes __∥ξ(z) are normalized and explicitly given, for example, in Refs. <cit.>. §.§ Electron-phonon interaction Hamiltonian For the electron-phonon interaction we use the deformation potential model <cit.> Ĥ_ def = E_a ∫_V_eld^3𝐫 Ψ̂^†(𝐫)Ψ̂ (𝐫)∇·(𝐫) . where ∇·(𝐫) is the dilatation field operator, V_el=A× d is the volume of the metallic layer, E_a is a constant, usually taken as E_a = (2/3) ϵ_F <cit.>, whereas the electron field annihilation and creation operators are Ψ̂ (𝐫,t) = ∑__∥, k_zψ__∥, k_z(, t) ĉ__∥, k_z and Ψ̂^†(𝐫,t) = ∑_𝐤_∥,k_zψ__∥, k_z^* (,t) ĉ_𝐤_∥,k_z^†, respectively. The operators ĉ_𝐤_∥,k_z and ĉ__∥, k_z^† are the electron k-space annihilation and creation operators on the state ψ __∥,k_z. From Eq. (<ref>) we write the phonon field operator () = ∑_ξ,_∥√(ħ/2 ρω__∥ξ) e^i (_∥_∥ - iω__∥ξt )[ â__∥ξ__∥ξ(z) + â_-_∥ξ^†^__∥ξ(z) ] , where â__∥ξ^† and â__∥ξ are the phonon creation and annihilation operators, respectively. §.§ Electron-phonon heat flow We follow the prescription of Ref. <cit.> to calculate the electron-phonon heat power flow. We apply the Fermi golden rule to obtain from Eq. (<ref>) the transition rate Γ_i→ f = (2π/ħ) \|⟨ f\| Ĥ_ def\| i⟩ \|^2 δ(E_f - E_i) between the initial (i) and final (f) state, of energies E_i and E_f. Using the transition rates and assuming Fermi and Bose distributions of the electrons and phonons, respectively, we calculate the heat power flow, which may be written as (Eqs. 17 of Ref. <cit.>) P(T_e, T_ph) ≡ P^(0)(T_e) - P^(1)(T_e, T_ph) P^(0) ( T_e ) ≡ P^(0)_s ( T_e ) + P^(0)_a ( T_e ) , P^(1) ( T_e, T_ph ) ≡ P^(1)_s ( T_e, T_ph ) + P^(1)_a ( T_e, T_ph ) , P^(0)_α ( T_e ) ≡ 4π/ħ∑__∥_∥', n, n'^_∥, νħω __∥, α, ν \|g__∥, α, ν^n',n\|^2 [f(β_e ϵ_𝐤_∥ -𝐪_∥, n') - f(β_e ϵ_k_∥,n) ] n(β_e ϵ_q_∥, ν) , P^(1)_α ( T_e, T_ph) ≡ 4π/ħ∑__∥_∥', n, n'^_∥, νħω __∥, α, ν \|g__∥, α, ν^n',n\|^2 [f(β_e ϵ_𝐤_∥ -𝐪_∥, n') - f(β_e ϵ_k_∥,n) ] n(β_phϵ_q_∥, ν) , where β_e = 1/(k_BT_e), β_ph = 1/(k_BT_ph), T_e is the electron temperature, T_ph is the phonon temperature, k_B is Boltzmann constant, P^(0)_α and P^(1)_α are the contributions of the α modes, where α = s,a is the polarization. Purely transverse waves do not contribute to the electron-phonon heat exchange in our model, so the h modes do not contribute to P in Eq. (<ref>). Note also that the terms P^(0)(T_e) and P^(1)(T_e, T_ph) are not the heat powers from electrons to phonons and from phonons to electrons, respectively, since some terms, which cancel out are not explicitly written in Eq. (<ref>). Furthermore, ω __∥, α, ν are given by Eq. (<ref>), with q_l,ν_z,σ(q_∥) and q_t,ν_z,σ(q_∥) being the solutions of Eqs. (<ref>). In Eqs. (<ref>), we also used the notation for the coupling constant g__∥, ξ^n',n = E_a N_q_∥, ξ√(ħ/2ρω __∥, ξ)∫_d_1^d_2ϕ _n^'^ (z)ϕ _n(z) [ i_∥·__∥, ξ(z)+d w__∥, ξ, z(z)/d z] dz, where w__∥, ξ, z is the component of __∥, ξ along the z axis, and the normalization constants are 1/N_q_∥, s, ν^2 = A { 4\|q_t\|^2 q_∥^2 \|cos( q_t L/2)\|^2 [ ( \|q_l\|^2+q_∥^2 ) sinh(p_lL)/2 p_l - ( \|q_l\|^2-q_∥^2 ) sin(q̅_lL)/2q̅_l] . + \| q_t^2-q_∥^2 \|^2 \|cos(q_lL/2)\| [ (\|q_t\|^2+q_∥^2) sinh(p_tL)/2p_t + (\|q_t\|^2 - q_∥^2)sin(q̅_tL)/2q̅_t] . -4q_∥^2 \|cos(q_lL/2)\|^2 [ p_t (\|q_t\|^2 + k_∥^2) sinh(p_t L) - q̅_t(\|q_t\|^2 - q_∥^2)sin(q̅_tL) ] } , 1/N_q_∥, a, ν^2 = A{4 \|q_t\|^2 q_∥^2 \|sin( q_tL/2)\|^2 [(\|q_l\|^2+q_∥^2)sinh(p_lL)/2 p_l +(\|q_l\|^2-q_∥^2)sin(q̅_lL)/2 q̅_l] +\| q_t^2-q_∥^2\|^2 \|sin(q_lL/2)\|^2 [(\|q_t\|^2+q_∥^2)sinh(p_tL)/2p_t - (\|q_t\|^2 - q_∥^2)sin(q̅_tL)/2q̅_t] - 4 q_∥^2 \|sin(q_lL/2) \|^2 [ p_t(\|q_t\|^2+q_∥^2)sinh(p_tL) + q̅_t (\|q_t\|^2 - q_∥^2) sin(q̅_tL) ] } . In Eqs. (<ref>) q̅_t and q̅_l are the real and parts of q_t and q_l, respectively. Since q_l and q_t may be either real or imaginary, the expressions (<ref>) should be interpreted as a limit, when the redundant component goes to zero: lim_p_t/l→ 0sinh(p_t/lL)/(2p_t/l) = L/2 and lim_q̅_t/l→ 0sin(q̅_t/lL)/(2q̅_t/l) = L/2. Combining Eqs. (<ref>), (<ref>) and (<ref>) we obtain (see, for example, <cit.>) P_s^(0) = 4 A/π^2 LE_a^2/ρ c_l^42m/ħ^2∑_n∑_n'∑_ν∫_0^∞ dx_∥ x_∥I_s,ν^(0) (x_∥)/2x_∥ n(β_e ħω_s,ν,q_∥) I_P , P_a^(0) = 4 A/π^2 LE_a^2/ρ c_l^42m/ħ^2∑_n∑_n'∑_ν∫_0^∞ dx_∥ x_∥I_a,ν^(0) (x_∥)/2x_∥ n(β_e ħω_a,ν,q_∥) I_P , where we use the dimensionless notations y_∥≡ (L/2) k_∥, x_∥≡ (L/2) q_∥, x_l,ξ≡ x_l,ξ(q_∥) ≡ q_l,ξ(q_∥) (L/2), x_t,ξ≡ x_t,ξ(q_∥) ≡ q_t,ξ(q_∥) (L/2), x̅_l,ξ≡x̅_l,ξ(q_∥) ≡q̅_l,ξ(q_∥) (L/2), x̅_t,ξ≡x̅_t,ξ(q_∥) ≡q̅_t,ξ(q_∥) (L/2), χ_l,ξ≡χ_l,ξ(q_∥) ≡ p_l,ξ(q_∥) (L/2), χ_t,ξ≡χ_t,ξ(q_∥) ≡ p_t,ξ(q_∥) (L/2), z_∥≡β_e (ħ^2/2m)(2/L)^2 y_∥^2, z_1 ≡β_e (ħ^2/2m)(nπ/L)^2, z_ min≡β_e (ħ^2/2m)(2/L)^2 y_ min^2, z_ph≡β_e ħω_ξ,q_∥, and z_ϵ_F≡β_e ϵ_F, and y_ min ≡ L/4 q_∥\| 2m/ħ^2ħω_ξ,q_∥ + q_∥^2 + (n'^2 - n^2) ( π/L)^2 \| . In Eqs. (<ref>) we have the integral I_P = 1/2√(k_BT 2m/ħ^2)L/2∫_0^∞dz'_∥/√(z'_∥){1/e^z'_∥ - ( z_ϵ_F + z_ph - z_1 - z_ min) + 1 - 1/e^z'_∥ - (z_ϵ_F - z_1 - z_ min) + 1} and the notations I_s,ν^(0) (x_∥) = ∑_n∑_n' \|x_t\|^2 x_∥^2 \|cos(x_t)\|^2 \|G_s, ν, q_∥(n, n')\|^2 ħω_s, ν,q_∥^4 ×{ 4 \|x_t\|^2 x_∥^2 \|cos(x_t)\|^2 [ (\|x_l\|^2+x_∥^2) sinh(2 χ_l)/2 χ_l + (x_∥^2 - \|x_l\|^2) sin(2x̅_l)/2 x̅_l]. + \|x_∥^2 - x_t^2\|^2 \|cos(x_l)\|^2 [ (\|x_t\|^2+x_∥^2) sinh(2 χ_t)/2 χ_t - (x_∥^2 - \|x_t\|^2) sin(2x̅_t)/2 x̅_t] . - 4x_∥^2 \|cos(x_l)\|^2 [ χ_t(\|x_t\|^2+x_∥^2) sinh(2 χ_t) + x_t(x_∥^2 - \|x_t\|^2) sin(2x̅_t) ] }^-1 , I_a,ν^(0) (x_∥) = ∑_n∑_n' \|x_t\|^2 x_∥^3 \|sin(x_t)\|^2 \|G_a, ν, q_∥(n,n')\|^2 ħω^4_a, ν,q_∥ ×{ 4\|x_t\|^2 x_∥^2 \|sin(x_t)\|^2( (\|x_l\|^2+q_∥^2)sinh(2 χ_l)/2 χ_l +(\|x_l\|^2-x_∥^2)sin(2x̅_l)/2x̅_l). +\|x_t^2-x_∥^2\|^2 \|sin(x_l)\|^2( (\|x_t\|^2+x_∥^2)sinh(2 χ_t)/2 χ_t -(\|x_t\|^2-x_∥^2)sin(2x̅_t)/2x̅_t) -4x_∥^2 \|sin(x_l)\|^2( χ_t(\|x_t\|^2+x_∥^2) sinh(2 χ_t)+x̅_t(\|x_t\|^2-x_∥^2)sin(2x̅_t)) .}^-1 , with G_q_∥, s, ν(n,n') = 2/d∫^d_2_d_1 dz sin[(z-d_1)nπ/d] sin[(z-d_1)n'π/d] cos[q_l, s, ν(q_∥) z] , = - 8 π^2 n_1 n_2 x_l /[ π^2 ( n_1 - n_2 )^2 ( L/d_2 - d_1)^2 - 4 x_l^2 ] [ π^2 ( n_1 + n_2 )^2 ( L/d_2 - d_1)^2 - 4 x_l^2 ] ×[ ( -1 )^n_1 + n_2sin( 2 x_l d_2/L) -sin( 2 x_l d_1/L) ] ( L/d_2-d_1)^3 G_q_∥, a, ν(n,n') = 2/d∫^d_2_d_1 dz sin[(z-d_1)nπ/d] sin[(z-d_1)n'π/d] sin[q_l, a, ν(q_∥) z] . = 8 π^2 n_1 n_2 x_l /[ π^2 ( n_1 - n_2 )^2 ( L/d_2 - d_1)^2 - 4 x_l^2 ] [ π^2 ( n_1 + n_2 )^2 ( L/d_2 - d_1)^2 - 4 x_l^2 ] ×[ (-1)^n_1 + n_2cos( 2 x_l d_2/L) - cos( 2 x_l d_1/L) ] ( L/d_2 - d_1)^3 In general, z_ϵ_F - z_1 - z_ min≫ 1 <cit.>, so we can use the approximation (see the Appendix of Ref. <cit.>) I_P ≈ 1/2√(k_BT_e 2m/ħ^2)L/2z_ph/√(z_ϵ_F - z_1 - z_ min) = √(2m/ħ^2)L/4ħω_ξ,q_∥/√(ϵ_F - ħ^2/2m(2/L)^2 [ (nπ/2)^2 - y_ min^2 ]) and observe that I_P does not depend on temperature. In such a case, the only temperature dependence in the expressions (<ref>) is in the phonon populations n(β_e ħω_σ,ν,q_∥). The term P^(1) may be calculated similarly as P^(0), but replacing T_e by T_ph in the phonon populations n(β_phϵ_q_∥, ν) of Eq. (<ref>), as shown in detail in Refs. <cit.>. Therefore, in the limit z_ϵ_F - z_1 - z_ min≫ 1, P^(1)_α ( T_e, T_ph) remains only a function of T_ph, in such a way that we may write in general P^(1)_s(T) = P^(0)_s(T), P^(1)_a(T) = P^(0)_a(T), so P^(1)(T) = P^(0)(T) . Notice that these simplifications are valid only outside the very narrow crest regions, as they are defined in <cit.>. Therefore, in the region of applicability of Eq. (<ref>), Eq. (<ref>) simplifies to P(T_e, T_ph) = P^(0)(T_e) - P^(0)(T_ph) . In the low temperature limit, only the lowest phonon band is populated and the expressions (<ref>) are simplified to G_q_∥, s, ν(n,n') = {[ 1 , if n - n' = 0 ,; 4 χ_l^2 (d_2-d_1)^2/π^2 L^2{ 1 /(n-n')^2 - 1/(n+n')^2} , if n - n' = 2 k ,; - 4 χ_l^2 (d_1+d_2) (d_2-d_1)/π^2 L^2{ 1 /(n-n')^2 - 1 /(n+n')^2} , if n - n' = 2k+1 , ]. G_q_∥, a, ν(n,n') = {[ i χ_l d_2 + d_1/L , if n - n' = 0 ,; 4/π^2 i χ_l^3 (d_2 + d_1) (d_2-d_1)^2/L^3{ 1 /(n-n')^2 - 1 /(n+n')^2} , if n - n = 2k ,; -4/π^2 iχ_l d_2-d_1/L{ 1 /(n-n')^2 - 1 /(n+n')^2} , if n - n' = 2k + 1 . ]. The main contribution to the heat power flow (especially in the low temperature limit) comes from the cases n=n', since in the other cases the heat exchange involve phonons of very high energy (for a typical 10 nm thick Cu metallic film, the lowest energy difference between two bands is Δϵ_k_∥=0, n_z = 1≈ 131 K <cit.>). From Eq. (<ref>) we observe that in the low temperature limit G_q_∥, s, ν(n,n), and therefore P_s^(0), is independent of the position of the metallic layer in the dielectric membrane. On the other hand, from Eq. (<ref>) we notice that G_q_∥, a, ν(n,n) = 0 for d_1=-d_2 (when the metallic film is in the middle of the membrane). § RESULTS Let us consider a 10 nm thick Cu film at an arbitrary location inside a 100 nm thick suspended SiN_x dielectric slab. The density of SiN_x is 3290 kg/m^3, whereas the longitudinal and transversal sound velocities are 10300 m/s and 6200 m/s, respectively. The Fermi energy in Cu is 7 eV and the 10 nm thick Cu film is outside the crest region <cit.>, so we can use the expression (<ref>) for I_P. In the temperature range of interest (from 10 mK to 10 K) we can use only the terms n=n' in the summations (<ref>) and (<ref>). In Fig. <ref> we plot P_s^(0), P_a^(0), and P^(0) = P_s^(0) + P_a^(0) as functions of T, for different positions of the Cu film in the membrane, specified by (d_1+d_2)/2. We notice that in the low temperature range (say, around 100 mK and below) P_s^(0) is practically independent of the position of the film, confirming Eq. (<ref>), whereas P_a^(0) strongly depends on it in the whole temperature range investigated, giving no contribution when the film is exactly in the middle, P_a^(0) = 0 at d_1=-d_2. This can be seen more clearly in Fig. <ref>, where we plot P_s^(0), P_a^(0), and P^(0) as functions of the Cu film position (d_1+d_2)/2 at three different temperatures: T=0.01 K, T=0.1 K, and T=10 K. We notice that in the sub-K temperature range, there is a crossover from the symmetric-mode domination for close-to-central metal film locations, to the antisymmetric-mode domination in the opposite limit. As it was noticed also in Refs. <cit.>, in the low temperature limit, P_s^(0) decreases faster than P_a^(0) with decreasing temperature, so, for any d_1+d_2 0, there is a crossover temperature T_c(d_1+d_2), such that P_s^(0) < P_a^(0) for T<T_c(d_1+d_2). Therefore, at low enough temperatures, the heat power exchanged by the electrons with the antisymmetric phonons dominates the heat power exchanged with the symmetric phonons at any \|d_1+d_2\|/2 > 0. Due to this variation of P^(0)_a with the position of the metallic film, at T=10 mK the total heat exchange power P^(0) decreases by as much as an order of magnitude when moving the metallic film from the surface of the slab to the middle of it. In addition, in Fig. <ref> we plot the exponent of the temperature dependence for the different components of the heat power flow, defined as x_s ≡∂ln P_s^(0)(T)/∂ln T, x_a ≡∂ln P_a^(0)(T)/∂ln T, and x ≡∂ln P^(0)(T)/∂ln T . One can show that <cit.> lim_T→ 0 x_s = 4 and lim_T→ 0 x_a = 3.5 , so, at low enough temperatures x_s>x_a, as mentioned above. At higher temperatures, the exponents x_s, x_a and x have a non-monotonous temperature dependence and do not reach the 3D limit x=5 even at T=10 K, although the phonon 2D-3D crossover temperature for a 100 nm slab is T_C ≈ 240 mK <cit.>. This is due to the fact that although the phonon gas in the 100 nm thick slab is quasi-3D at 10 K, the energy of an average phonon is much smaller than the energy difference between the 2D electronic bands, so in this temperature range the electrons are still scattered only within the same band, n=n'. Therefore, the higher temperature range corresponds here to the heat power exchange between a collection of 2D electron gases, with n≤ n_F, and a 3D phonon gas. In this case, the exponent x approaches four, satisfying the ansatz x = s+2, but with s being the smaller dimensionality of the two subsystems–in our case, s=2 is the dimensionality of the electron subsystem. § CONCLUSIONS We studied the heat exchange between electrons and phonons in a suspended geometry, where a Cu film of thickness d=10 nm is placed inside a dielectric SiN_x membrane of thickness L=100 nm, forming a layered structure. We focused on investigating on how the location of the metal film influences the power flow, and found that at low temperatures it can change significantly – at 10 mK it changes by an order of magnitude. At sub-Kelvin temperatures, this metal film location dependence arises only from the coupling to the antisymmetric Lamb phonon modes of the membrane, whereas the symmetric Lamb-modes give a constant, location independent contribution. Moreover, the contribution of the antisymmetric modes goes to zero, if the metal film is placed at the center of the membrane. The physical reason for this is that–by definition–the displacement field in the antisymmetric Lamb-modes is zero in the middle plane of the membrane. In the low temperature limit, the temperature dependence of the symmetric mode contribution is P^(0)_s ∝ T^4, whereas for the antisymmetric mode, P^(0)_a ∝ T^3.5. Therefore, if the metal film is not close to the center of the membrane, at low enough temperatures P_a prevails over P_s and the total heat power flux has the simple temperature dependence P(T_e, T_ph) ∝ T_e^3.5 - T_ph^3.5. In the opposite case, the symmetric mode dominates and P(T_e, T_ph) ∝ T_e^4 - T_ph^4. A consequence of this is that electrons and phonons can be much more efficiently decoupled at low temperatures by placing the metallic film in the center of the membrane. This may also help considerably for electron cooling and noise reduction in ultrasensitive nanosensors. In a wider temperature range, the exponent x of the temperature dependence has a complicated, non-monotonous dependence on the temperature and on the metal film location. For the antisymmetric mode, it varies from ∼ 3.5 to ∼ 7, whereas for the symmetric mode, it varies from from ∼ 4 to ∼ 5.7. The bulk 3D limit, corresponding to x=5, was not achieved even at T=10 K, due to the high energy difference between the 2D electronic bands, but instead, the limit of x=4 is approached at T=10 K. § ACKNOWLEDGMENTS D.V.A. and M.D. acknowledge financial support by the Ministry of Education, UEFISCDI projects PN23210101 and PN23210204. I.J.M. acknowledges support by the Academy of Finland project number 341823. 10 Enss Cryogenic Particle Detection, edited by Ch. Enss (Springer,New York, 2005). RevModPhys.78.217.2006.Giazotto F. Giazotto, T. T. Heikkilä, A. Luukanen, A. M. Savin, and J. P. Pekola. Opportunities for mesoscopics in thermometry and refrigeration: Physics and applications. Rev. Mod. Phys., 78:217, 2006. PhysRevApplied.16.034051 P. J. de Visser, S. A..H. de Rooij, V. Murugesan, D. J. Thoen and J. J. A. Baselmans. Phonon-Trapping-Enhanced Energy Resolution in Superconducting Single-Photon Detectors. Phys. Rev. Appl., 16:034051, 2021. Quaranta_2013 O. Quaranta, T. W. Cecil, L. Gades, B. Mazin and A. Miceli X-ray photon detection using superconducting resonators in thermal quasi-equilibrium. Supercond. Sci. Technol., 26:105021, 2013. ApplPhysLett.78.556.2001.Anghel D. V. Anghel, A. Luukanen, and J. P. Pekola. Performance of cryogenic microbolometers and calorimeters with on-chip coolers. Appl. Phys. Lett., 78:556, 2001. RepProgrPhys.75.046501.2012.Muhonen J. T Muhonen, M. Meschke, and J. P Pekola. Micrometre-scale refrigerators. Rep. Progr. Phys., 75:046501, 2012. ApplSupercond.5.227.1998.Leivo M. M. Leivo, A. J. Manninen, and J. P. Pekola. Microrefrigeration by normal-metal/insulator/superconductor tunnel junctions. Appl. Supercond., 5:227, 1997. ApplPhysLett.70.1885.1997.Manninen A. J. Manninen, M. M. Leivo, and J. P. Pekola. Refrigeration of a dielectric membrane by superconductor/insulator/normal-metal/insulator/superconductor tunneling. Appl. Phys. Lett., 70:1885, 1997. ApplPhysLett.92.163501.2008.Miller N. A. Miller, G. C. O’Neil, J. A. Beall, G. C. Hilton, K. D. Irwin, D. R. Schmidt, L. R. Vale, and J. N. Ullom. High resolution X-ray transition-edge sensor cooled by tunnel junction refrigerators. Appl. Phys. Lett., 92:163501, 2008. Vercuyssen N. Vercruyssen, R. Barends, T. M. Klapwijk, J. T. Muhonen, M. Meschke, and J. P. Pekola. Substrate-dependent quasiparticle recombination time in superconducting resonators. Appl. Phys. Lett. 99:062509, 2011. Nguyen H. Q. Nguyen, M. Meschke, and J. P. Pekola. A robust platform cooled by superconducting electronic refrigerators. Appl. Phys. Lett. 106:012601, 2015. SovPhysJETP.4.173.1957.Kaganov M. I. Kaganov, I. M. Lifshitz, and L. V. Tanatarov. Relaxation between electrons and the crystalline lattice. Sov. Phys. JETP, 4:173, 1957. PhysRevLett.59.1460.1987.Allen P. B. Allen. Theory of thermal relaxation of electrons in metals. Phys. Rev. Lett., 59:1460, 1987. PhysRevB.49.5942.1994.Wellstood F. C. Wellstood, C. Urbina, and J. Clarke. Hot-electron effects in metals. Phys. Rev. B, 49:5942, 1994. PhysRevB.81.245404.2010.Viljas J. K. Viljas and T. T. Heikkilä. Electron-phonon heat transfer in monolayer and bilayer graphene. Phys. Rev. B, 81:245404, 2010. PhysRevB.77.033401.2008.Hekking F. W. J. Hekking, A. O. Niskanen, and J. P. Pekola. Electron-phonon coupling and longitudinal mechanical-mode cooling in a metallic nanowire. Phys. Rev. B, 77:033401, 2008. JApplPhys.119.085101.2016.Gall Daniel Gall. Electron mean free path in elemental metals. J. Appl. Phys., 119:085101, 2016. SolidStateCommun.227.56.2016.Anghel D.V. Anghel and S. Cojocaru. Electron-phonon heat exchange in layered nano-systems. Solid State Commun., 227:56, 2016. PhysRevB.93.115405.2016.Cojocaru S. Cojocaru and D. V. Anghel. Low-temperature electron-phonon heat transfer in metal films. Phys. Rev. B, 93:115405, 2016. EurPhysJB.90.260.2017.Anghel D. V. Anghel and S. Cojocaru. Electron–phonon heat exchange in quasi-two-dimensional nanolayers. Eur. Phys. J. B, 90:260, 2017. PhysScr.94.105704.2019.Anghel D. V. Anghel, C. Caraiani, and Y. M. Galperin. Crossover temperature in electron–phonon heat exchange in layered nanostructures. Phys. Scr., 94:105704, 2019. PhysRevLett.99.145503 J. T. Karvonen and I. J. Maasilta. Influence of Phonon Dimensionality on Electron Energy Relaxation. Phys. Rev. Lett. 99:145503, 2007. Saira2020 O.-P. Saira, M. H. Matheny, L. Wang, J. Pekola, and M. Roukes. Modification of electron-phonon coupling by micromachining and suspension. J. Appl. Phys. 127:024307, 2020. PhysRevB.70.125425.2004.Kuhn T. Kühn, D. V. Anghel, J. P. Pekola, M. Manninen, and Y. M. Galperin. Heat transport in ultrathin dielectric membranes and bridges. Phys. Rev. B, 70:125425, 2004. JPhysA.40.10429.2007.Anghel D. V. Anghel and T. Kühn. Quantization of the elastic modes in an isotropic plate. J. Phys. A: Math. Theor., 40:10429, 2007. cond-mat/0611528. Auld:book B. A. Auld. Acoustic Fields and Waves in Solids, 2nd Ed. Robert E. Krieger Publishing Company, 1990. Ziman:book J. M. Ziman. Electrons and Phonons. Oxford University Press, 1960.
http://arxiv.org/abs/2306.08974v1	20230615091148	Algorithmic Cluster Expansions for Quantum Problems	[ "Ryan L. Mann", "Romy M. Minko" ]	quant-ph	[ "quant-ph", "cs.CC", "cs.DS", "math.CO" ]	apsrev4-2 [email protected] http://www.ryanmann.org Centre for Quantum Computation and Communication Technology, Centre for Quantum Software and Information, School of Computer Science, Faculty of Engineering & Information Technology, University of Technology Sydney, NSW 2007, Australia School of Mathematics, University of Bristol, Bristol, BS8 1UG, United Kingdom School of Mathematics, University of Bristol, Bristol, BS8 1UG, United Kingdom We establish a general framework for developing approximation algorithms for a class of counting problems. Our framework is based on the cluster expansion of abstract polymer models formalism of Kotecký and Preiss. We apply our framework to obtain efficient algorithms for (1) approximating probability amplitudes of a class of quantum circuits close to the identity, (2) approximating expectation values of a class of quantum circuits with operators close to the identity, (3) approximating partition functions of a class of quantum spin systems at high temperature, and (4) approximating thermal expectation values of a class of quantum spin systems at high temperature with positive-semidefinite operators. Further, we obtain hardness of approximation results for approximating probability amplitudes of quantum circuits and partition functions of quantum spin systems. This establishes a computational complexity transition for these problems and shows that our algorithmic conditions are optimal under complexity-theoretic assumptions. Finally, we show that our algorithmic condition is almost optimal for expectation values and optimal for thermal expectation values in the sense of zero freeness. Algorithmic Cluster Expansions for Quantum Problems Romy M. Minko July 31, 2023 =================================================== § INTRODUCTION The classification of the computational complexity of quantum problems is important for understanding the capabilities and limitations of quantum computing. These problems include the computation of probability amplitudes, expectation values, partition functions, and thermal expectation values. In this paper we consider the classification of such problems in the sense of approximate counting. We establish a general framework for developing approximation algorithms and hardness of approximation results for a class of counting problems. By applying this framework, we are able to obtain efficient approximation algorithms and hardness of approximation results for several quantum problems under certain algorithmic conditions. Our algorithmic framework is based on the cluster expansion of abstract polymer models formalism of Kotecký and Preiss <cit.>. We consider polymers that are connected subgraphs of bounded-degree bounded-rank multihypergraphs with compatibility relations defined by vertex disjointness. The key insight underlying our framework is that when the polymer weights decay sufficiently fast, computing the truncated cluster expansion to sufficiently high order allows us to obtain a multiplicative approximation to the abstract polymer model partition function. Our framework can be viewed as a straightforward generalisation of the framework of Helmuth, Perkins, and Regts <cit.>, and Borgs et al. <cit.> from the case of bounded-degree graphs to bounded-degree bounded-rank multihypergraphs. This approach is closely related to that of Patel and Regts <cit.> using Barvinok's method <cit.>; see Ref. <cit.> for a survey of this method. Our results concerning the approximation of quantum problems may be summarised as follows. We obtain efficient algorithms for (1) approximating probability amplitudes of a class of quantum circuits close to the identity, (2) approximating expectation values of a class of quantum circuits with operators close to the identity, (3) approximating partition functions of a class of quantum spin systems at high temperature, and (4) approximating thermal expectation values of a class of quantum spin systems at high temperature with positive-semidefinite operators. Our approach offers a simpler and sharper analysis compared to existing algorithms. Our algorithmic results are summarised in Table <ref>. Our hardness of approximation framework is based on reductions from the Ising model partition function. We apply this framework to obtain hardness of approximation results for approximating probability amplitudes of quantum circuits and partition functions of quantum spin systems. This establishes a computational complexity transition for these problems and shows that our algorithmic conditions are optimal under complexity-theoretic assumptions. Further, we show that our algorithmic condition is almost optimal for expectation values and optimal for thermal expectation values in the sense of zero freeness. This paper is structured as follows. In Section <ref>, we introduce the necessary preliminaries. Then, in Section <ref>, we establish our algorithmic and hardness of approximation framework. In Section <ref>, we apply our framework to several quantum problems. Finally, we conclude in Section <ref> with some remarks and open problems. § PRELIMINARIES §.§ Graph Theory A multigraph is a graph in which multiple edges between vertices are permitted. A hypergraph is a graph in which edges between any number of vertices are permitted. A multihypergraph is a graph in which multiple edges between vertices and edges between any number of vertices are permitted. We shall assume that the edges in a multihypergraph are uniquely labelled, that is, all edges are considered distinct. Let G=(V, E) be a multihypergraph. We denote the order of G by G=V(G) and the size of G by G=E(G). The maximum degree Δ(G) of G is the maximum degree over all vertices of G and the rank r(G) of G is the maximum cardinality of an edge of G. The distance d(u, v) between two vertices u and v in G is defined as the size of the shortest path connecting them. A multihypergraph is called Δ-regular if all the vertices have degree Δ and called r-uniform if all the edges have cardinality r. §.§ Abstract Polymer Models An abstract polymer model is a triple (𝒞, w, ∼), where 𝒞 is a countable set of objects called polymers, is a function that assigns to each polymer γ∈𝒞 a complex number w_γ called the weight of the polymer, and ∼ is a symmetric compatibility relation such that each polymer is incompatible with itself. A set of polymers is called admissible if the polymers in the set are all pairwise compatible. Note that the empty set is admissible. Let 𝒢 denote the collection of all admissible sets of polymers from 𝒞. The abstract polymer partition function is defined by Z(𝒞,w) ∑_Γ∈𝒢∏_γ∈Γw_γ. The archetypal example of an abstract polymer model is the independence polynomial. Let G=(V, E) be a graph and let ℐ denote the collection of all independent sets of G. Recall that an independent set of G is a subset of vertices with no edges between them. The independence polynomial I(G;x) of G is a polynomial in x, defined by I(G;x) ∑_I∈ℐx^I. This corresponds to an abstract polymer model (𝒞, w, ∼) as follows. The polymers 𝒞 are the vertices V of G, the weight function w is given by w_γ=x for all γ∈𝒞, and two polymers are compatible if and only if there is no edge between them in G. An admissible set of polymers is then an independent set of G, and it follows that the partition function of this model Z(𝒞,w) is precisely the independence polynomial I(G;x) of G. The abstract polymer model can be viewed as a generalisation of the independence polynomial. In particular, it attempts to capture the independence properties of a problem. A useful tool for representing a problem as an abstract model is the principle of inclusion-exclusion. The principle is formalised by the following well-known lemma (see for example <cit.>); we provide a proof for completeness. Let f be a function defined on the subsets of finite set E, then f(E) = ∑_S ⊆ E(-1)^S∑_T ⊆ S(-1)^Tf(T). By interchanging the summations, we have ∑_S ⊆ E(-1)^S∑_T ⊆ S(-1)^Tf(T) = ∑_T ⊆ E(-1)^Tf(T)∑_T ⊆ S ⊆ E(-1)^S = ∑_T ⊆ Ef(T)∑_S ⊆ E∖T(-1)^S = ∑_T ⊆ Ef(T)∑_m=0^E∖TE∖Tm(-1)^m. Now, by applying the binomial theorem, we obtain ∑_S ⊆ E(-1)^S∑_T ⊆ S(-1)^Tf(T) = f(E), completing the proof. As we shall see in Section <ref>, several quantum problems admit an abstract polymer model representation. §.§ Abstract Cluster Expansion We now define the abstract cluster expansion <cit.>. Let Γ be a non-empty ordered tuple of polymers. The incompatibility graph H_Γ of Γ is the graph with vertex set Γ and edges between any two polymers if and only if they are incompatible. Γ is called a cluster if its incompatibility graph H_Γ is connected. A polymer and cluster are compatible if the polymer is compatible with every polymer in the cluster. Let 𝒢_C denote the set of all clusters of polymers from 𝒞. The abstract cluster expansion is a formal power series for logZ(𝒞,w) in the variables w_γ, defined by log(Z(𝒞,w)) ∑_Γ∈𝒢_Cφ(H_Γ)∏_γ∈Γw_γ, where φ(H) denotes the Ursell function of a graph H: φ(H) 1/H!∑_S ⊆ E(H) spanning connected(-1)^S. An important theorem due to Kotecký and Preiss <cit.> provides a sufficient criterion for the absolute convergence of the cluster expansion. An improved convergence criterion is given in Ref. <cit.>. Let (𝒞, w, ∼) be an abstract polymer model and let a:𝒞→ℝ^+ and d:𝒞→ℝ^+ be functions such that ∑_γ^γw_γ^e^a(γ^)+d(γ^)≤ a(γ), for all polymers γ∈𝒞. Then the cluster expansion for log(Z(𝒞,w)) converges absolutely, Z(𝒞,w)≠0, and ∑_Γ∈𝒢_C Γγφ(H_Γ)∏_γ^∈Γw_γ^e^∑_γ^∈Γd(γ^)≤ a(γ), for all polymers γ∈𝒞. In the case of the independence polynomial, the radius of convergence is given by Shearer's bound for the Lovász Local Lemma <cit.>; this was elucidated by Scott and Sokal <cit.>. For results on the hypergraph independence polynomial see Refs. <cit.>. Note that the Kotecký-Preiss convergence criterion can be viewed as a type of local lemma. Let · :𝒞→ℤ^+ be a function that assigns to each polymer γ∈𝒞 a positive integer γ called the size of the polymer. A useful quantity for algorithmic purposes is the truncated cluster expansion T_m(Z(𝒞,w)) for log(Z(𝒞,w)): T_m(Z(𝒞,w)) ∑_Γ∈𝒢_C Γ≥ mφ(H_Γ)∏_γ∈Γw_γ, where Γ=∑_γ∈Γγ. It is often convenient to consider clusters as multisets of polymers. Define a cluster to be a multiset (Γ, m_Γ) of polymers Γ with multiplicity function m_Γ:Γ→ℤ^+ whose incompatibility graph is connected. Here the definition of the incompatibility graph is extended to multisets in the natural way. Let 𝒢̂_C denote the collection of all multiset clusters of polymers from 𝒞. Note that, for a given multiset (Γ, m_Γ), there are precisely (∑_γ∈Γm_Γ(γ))!/∏_γ∈Γm_Γ(γ)! tuples that correspond to it. The abstract cluster expansion may then be written as log(Z(𝒞,w)) = ∑_(Γ, m_Γ)∈𝒢̂_Cφ̂(H_(Γ, m_Γ))∏_γ∈Γw_γ^m_Γ(γ)/m_Γ(γ)!, where φ̂(H) ∑_S ⊆ E(H) spanning connected(-1)^S. §.§ Approximation Schemes Let ϵ>0 be a real number. An additive ϵ-approximation to z is a complex number ẑ such that z-ẑ≤ϵ. A multiplicative ϵ-approximation to z is a complex number ẑ such that z-ẑ≤ϵz. Note that an additive-error approximation to the logarithm of a number is equivalent to a multiplicative approximation to that number. A fully polynomial-time approximation scheme for a sequence of complex numbers (z_n)_n∈ℕ is a deterministic algorithm that, for any n and ϵ>0, produces a multiplicative ϵ-approximation to z_n in time polynomial in n and 1/ϵ. §.§ Computational Complexity We shall refer to the following complexity classes: P (polynomial time), RP (randomised polynomial time), BQP (bounded-error quantum polynomial time), NP (non-deterministic polynomial time), and #P. For a formal definition of these complexity classes, we refer the reader to Ref. <cit.>. § GENERAL FRAMEWORK §.§ Approximation Algorithms In this section we establish a general framework for developing approximation algorithms for abstract polymer model partition functions. We consider abstract polymer models in which the polymers are connected subgraphs of bounded-degree bounded-rank multihypergraphs and compatibility is defined by vertex disjointness. When the polymer weights of these models decay sufficiently fast, then the logarithm of the partition function can be controlled by a convergent cluster expansion. Our algorithm approximates the logarithm of the partition function by computing the truncated cluster expansion to sufficiently high order. Our general framework is based on that of Helmuth, Perkins, and Regts <cit.> and Borgs et al. <cit.> where approximation algorithms were developed in the setting of bounded-degree graphs. Our algorithm can be viewed as a straightforward generalisation of theirs to the setting of bounded-degree bounded-rank multihypergraphs. Our main theorem is as follows. Fix Δ,r∈ℤ_≥2. Let G=(V, E) be a multihypergraph of maximum degree at most Δ and rank at most r. Further let (𝒞, w, ∼) be an abstract polymer model such that the polymers are connected subgraphs of G and that two polymers γ and γ' are compatible if and only if V(γ) ∩ V(γ')=∅. Suppose that, for all polymers γ∈𝒞, the weight w_γ can be computed in time exp(O(γ)) and satisfies w_γ≤(1/e^3Δr2)^γ. Then the cluster expansion for log(Z(𝒞,w)) converges absolutely, Z(𝒞,w)≠0, and there is a fully polynomial-time approximation scheme for Z(𝒞,w). In Section <ref> we shall apply Theorem <ref> to establish efficient approximation algorithms for several quantum problems. Our proof of Theorem <ref> requires several lemmas. We first prove the following lemma which bounds the number of polymers of a certain size containing a particular vertex. Let G=(V, E) be a multihypergraph of maximum degree at most Δ and rank at most r, and let v ∈ V be a vertex. The number of connected subgraphs with m edges that contain vertex v is at most (eΔ(r-1))^m/2. Let C_m,v(G) denote the set of connected subgraphs of G with m edges that contain the vertex v ∈ V. Further let T_Δ, r, v denote the infinite Δ-regular r-uniform linear hypertree with root v. Recall that a hypergraph is linear if the intersection of any pair of edges contains at most one vertex. Let T^⋆_Δ, r, v be the graph with vertex set {v}∪ E(T_Δ, r, v) and edges between vertices v and e ∈ E(T_Δ, r, v) if and only if v ∈ e and edges between vertices e, e' ∈ E(T_Δ, r, v) if and only if e ∩ e'≠∅ and d(v, e) ≠ d(v, e'). Note that T^⋆_Δ, r, v is a tree with maximum degree precisely (Δ-1)(r-1)+1 ≤Δ(r-1) and there is a natural bijection between C_m,v(T_Δ, r, v) and C_m,v(T^⋆_Δ, r, v). The cardinality of C_m,v(T^⋆_Δ, r, v) is at most 1/m+1(m+1)Δ(r-1)m <cit.>. Hence, we have C_m,v(G)≤C_m,v(T_Δ, r, v) = C_m,v(T^⋆_Δ, r, v)≤1/m+1(m+1)Δ(r-1)m≤(eΔ(r-1))^m/2, completing the proof. The proof of Lemma <ref> gives a slightly sharper bound of (e((Δ-1)(r-1)+1))^m/2. Improved bounds may be obtained for certain classes of multihypergraphs. We now show that provided the polymer weights decay sufficiently fast, then the cluster expansion converges absolutely and the truncated cluster expansion provides a good approximation to log(Z(𝒞,w)). This is formalised by the following lemma which utilises the Kotecký-Preiss convergence criterion. Let G=(V, E) be a multihypergraph of maximum degree at most Δ and rank at most r. Further let (𝒞, w, ∼) be an abstract polymer model such that the polymers are connected subgraphs of G and that two polymers γ and γ' are compatible if and only if V(γ) ∩ V(γ')=∅. Suppose that, for all polymers γ∈𝒞, the weight w_γ satisfies w_γ≤(1/e^3Δr2)^γ. Then the cluster expansion for log(Z(𝒞,w)) converges absolutely, Z(𝒞,w)≠0, and for m∈ℤ^+, T_m(Z(𝒞,w))-log(Z(𝒞,w))≤Ge^-m/2. We introduce a polymer γ_v to every vertex v in G consisting of only that vertex. We define γ_v to be incompatible with every polymer that contains v. Then, we have ∑_γγ_vw_γe^1/2(1/r-1γ+γ)≤ e^1/2(r-1)∑_γγ_vw_γe^γ≤ e^1/2(r-1)∑_γγ_v(1/e^2Δr2)^γ, where we have used the fact that γ≤(r-1)γ+1. By Lemma <ref>, the number of polymers γ with γ=m that are incompatible with γ_v is at most (eΔ(r-1))^m/2. Thus, we may write ∑_γγ_vw_γe^1/2(1/r-1γ+γ)≤e^1/2(r-1)/2∑_m=1^∞(2/er)^m ≤1/2(r-1). Fix a polymer γ. By summing over all vertices in γ, we obtain ∑_γ^γw_γ^e^1/2(1/r-1γ^+γ^)≤1/2(r-1)γ. Now by applying Theorem <ref> with a(γ)=1/2(r-1)γ and d(γ)=1/2γ, we have that the cluster expansion converges absolutely, Z(𝒞,w)≠0, and ∑_Γ∈𝒢_C Γ∋γ_v φ(H_Γ)∏_γ∈Γw_γe^1/2Γ≤ 1. By summing over all vertices in G, we obtain ∑_Γ∈𝒢_C Γ≥ m φ(H_Γ)∏_γ∈Γw_γ≤Ge^-m/2, completing the proof. Lemma <ref> implies that to obtain a multiplicative ϵ-approximation Z(𝒞,w), it is sufficient to compute the truncated cluster expansion T_m(Z(𝒞,w)) to order m=O(log(G/ϵ)). We shall now establish an algorithm for computing T_m(Z(𝒞,w)) in time exp(O(m))·G^O(1). This requires the following two lemmas. Fix Δ,r∈ℤ_≥2. Let G=(V, E) be a multihypergraph of maximum degree at most Δ and rank at most r. Further let (𝒞, w, ∼) be an abstract polymer model such that the polymers are connected subgraphs of G and that two polymers γ and γ' are compatible if and only if V(γ) ∩ V(γ')=∅. The clusters of size at most m can be listed in time exp(O(m))·G^O(1). Our proof follows a similar approach to that of Ref. <cit.>. We list all connected subgraphs of G with at most m edges in time exp(O(m))·G^O(1) by depth-first search. For each of these subgraphs, we consider all ways to label the edges with positive integers such that their sum is at most m in time exp(O(m)). For each of these labelled subgraphs, we consider all clusters that correspond to it, i.e., clusters whose multiset sum over polymers induces the subgraph with multiplicities given by the edge labels. We now prove by induction that the number of such clusters for a subgraph with label sum m is at most (eΔ(r-1))^2m. This is clearly true when m=0. Now suppose that the number of such clusters for a subgraph with label sum m is at most (eΔ(r-1))^2m. For a subgraph with label sum m+1, we choose an arbitrary vertex in the subgraph and consider all polymers that contain that vertex. By Lemma <ref>, there are at most (eΔ(r-1))^n such polymers of size n. By removing each polymer from the subgraph and applying the induction hypothesis, we have that the number of clusters in the subgraph is at most ∑_n=1^m+1(eΔ(r-1))^n(eΔ(r-1))^2(m+1-n)≤ (eΔ(r-1))^2(m+1)∑_n=1^m+1(eΔ(r-1))^-n≤ (eΔ(r-1))^2(m+1), completing the induction. These clusters can be enumerated in time exp(O(m)) by depth-first search, completing the proof. The Ursell function φ(H) can be computed in time exp(O(H)). Our proof follows that of Ref. <cit.>. For a connected graph H, we have φ(H) = 1/H!∑_S ⊆ E(H) spanning connected(-1)^S = -(-1)^H/H!T_H(0,1), where T_H(x,y) denotes the Tutte polynomial of H defined by T_H(x,y) ∑_S ⊆ E(x-1)^k(S)-k(E)(y-1)^k(S)+S-H. Here k(S) denotes the number of connected components of the subgraph with edge set S. The Ursell function can then be computed in time exp(O(H)) by evaluating the Tutte polynomial in time exp(O(H)) via an algorithm of Börklund et al. <cit.>. This completes the proof. Fix Δ,r∈ℤ_≥2. Let G=(V, E) be a multihypergraph of maximum degree at most Δ and rank at most r. Further let (𝒞, w, ∼) be an abstract polymer model such that the polymers are connected subgraphs of G and that two polymers γ and γ' are compatible if and only if V(γ) ∩ V(γ')=∅. Suppose that, for all polymers γ∈𝒞, the weight w_γ can be computed in time exp(O(γ)). Then the truncated cluster expansion T_m(Z(𝒞,w)) can be computed in time exp(O(m))·G^O(1). We can list all clusters of size at most m in time exp(O(m))·G^O(1) by Lemma <ref>. For each of these clusters, we can compute the Ursell function in time exp(O(m)) by Lemma <ref>, and the polymer weights in time exp(O(m)) by assumption. Hence, the truncated cluster expansion T_m(Z(𝒞,w)) can be computed in time exp(O(m))·G^O(1). Combining Lemma <ref> with Lemma <ref> proves Theorem <ref>. §.§ Hardness of Approximation In this section we establish the hardness of approximating abstract polymer model partition functions. In particular, we establish the hardness of approximating the Ising model partition function at imaginary temperature on bounded-degree graphs, which will be useful for our purposes via reductions. This setting was studied in Ref. <cit.>, which established hardness of approximation results for this problem. We utilise the results of Ref. <cit.> to obtain significantly sharper bounds when the maximum degree is sufficiently large. We model an Ising system by a multigraph G=(V, E). At each vertex v of G there is a 2-dimensional classical spin space {-1,+1}. The classical spin space on the multihypergraph is given by {-1,+1}^V. An interaction ϕ assigns a real number ϕ(e) to each edge e of G. We are interested in the partition function Z_Ising(G;β) at inverse temperature β, defined by Z_Ising(G;β) ∑_σ∈{-1,+1}^V∏_{u,v}∈ Ee^-βϕ({u,v})σ_uσ_v. We shall normalise the partition function by a multiplicative factor of 1/2^G. Further, we shall assume that ϕ(e)≤1 for all e ∈ E, which is always possible by a rescaling of β. We shall consider the case where the inverse temperature β is imaginary, i.e., β=iθ for θ∈ℝ. Our hardness result concerning the approximation of Z_Ising(G;iθ) is as follows. Fix ϵ>0, Δ∈ℤ_≥3, and θ∈ℝ such that θ≥3π/5(Δ-2). It is #P-hard to approximate the Ising model partition function Z_Ising(G;iθ) up to a multiplicative ϵ-approximation on multigraphs of maximum degree at most Δ. By Ref. <cit.>, it is #P-hard to approximate the Ising model partition function Z_Ising(G;iθ) up to a multiplicative ϵ-approximation on multigraphs of maximum degree 3 for θ≥π/5>arctan(1/√(2)). For a graph G of maximum degree 3 and a positive integer k∈ℤ^+, let G_k denote the k-thickening of G, that is, the multigraph formed by replacing each edge of G with k parallel edges. Note that the maximum degree of G_k is precisely 3k. Now observe that, for any k∈ℤ^+, we have Z_Ising(G;iθ)=Z_Ising(G_k;iθ/k). Hence, it is #P-hard to approximate Z_Ising(G;iθ) up to a multiplicative ϵ-approximation on multigraphs of maximum degree at most 3k for θ≥π/5k. It follows that it is #P-hard to approximate Z_Ising(G;iθ) up to a multiplicative ϵ-approximation on multigraphs of maximum degree at most Δ for θ≥3π/5(Δ-2), completing the proof. The proof of Theorem <ref> gives a slightly sharper bound. Further, the proof technique may be applied to the case of complex β. This offers a significant improvement over Ref. <cit.> when Δ≥7, which applies when θ>arctan(1/√(Δ-1)). In Section <ref> we shall apply Theorem <ref> to establish the hardness of approximation of several quantum problems. We shall now show that the Ising model partition function Z_Ising(G;β) admits an abstract polymer model representation. This is formalised by the following lemma. The Ising model partition function Z_Ising(G;β) admits the following abstract polymer model representation. Z_Ising(G;β) = ∑_Γ∈𝒢∏_γ∈Γw_γ, where w_γ1/2^γ∑_σ∈{-1,+1}^V(γ)∏_{u,v}∈ E(γ)(e^-βϕ({u,v})σ_uσ_v-1). By applying Lemma <ref> with f(E)=1/2^G∑_σ∈{-1,+1}^V∏_{u,v}∈ Ee^-βϕ({u,v})σ_uσ_v, we have Z_Ising(G;β) = 1/2^G∑_σ∈{-1,+1}^V∏_{u,v}∈ Ee^-βϕ({u,v})σ_uσ_v = 1/2^G∑_S ⊆ E(-1)^S∑_T ⊆ S(-1)^T∑_σ∈{-1,+1}^V∏_{u,v}∈ Te^-βϕ({u,v})σ_uσ_v. For a subset S ⊆ E, let Γ_S denote the maximally connected components of S. By factorising over these components, we have Z_Ising(G;β) = ∑_S ⊆ E∏_γ∈Γ_S(-1)^γ∑_T ⊆ E(γ)(-1)^T1/2^γ∑_σ∈{-1,+1}^V(γ)∏_{u,v}∈ Te^-βϕ({u,v})σ_uσ_v = ∑_S ⊆ E∏_γ∈Γ_S1/2^γ∑_σ∈{-1,+1}^V(γ)∏_{u,v}∈ E(γ)(e^-βϕ({u,v})σ_uσ_v-1) = ∑_Γ∈𝒢∏_γ∈Γw_γ. This completes the proof. We note that Lemma <ref> can be combined with Theorem <ref> to establish an efficient approximation algorithm for Z_Ising(G;β) on graphs of maximum degree at most Δ when β≤1/e^4Δ. Efficient approximation algorithms with significantly sharper bounds have previously been established <cit.>. In particular, Ref. <cit.> established an efficient approximation algorithm that applies when β<π/4(Δ-1). In the case when β is real, the exact point of a computational complexity transition is known under the complexity-theoretic assumption that RP is not equal to NP due to the approximation algorithm of Ref. <cit.> and the hardness of approximation results of Refs. <cit.>. § APPLICATIONS In this section we apply our algorithmic framework to establish efficient approximation algorithms for classes of quantum problems. This includes probability amplitudes, expectation values, partition functions, and thermal expectation values. We apply our hardness of approximation framework to show the optimality of our algorithmic conditions for probability amplitudes and partition functions under complexity-theoretic assumptions. Further, we show that our algorithmic condition is almost optimal for expectation values and optimal for thermal expectation values in the sense of zero freeness. §.§ Probability Amplitudes In this section we study the problem of approximating probability amplitudes of quantum circuits. This problem is known to be #P-hard in general <cit.>; however, we show that, for a class of quantum circuits close to the identity, this problem admits an efficient approximation algorithm. Further, we show that this algorithmic condition is optimal under complexity-theoretic assumptions. We model a quantum circuit by a multihypergraph G=(V, E). At each vertex v of G there is a d-dimensional Hilbert space ℋ_v with d<∞. The Hilbert space on the multihypergraph is given by ℋ_G⊗_v ∈ Vℋ_v. An interaction U assigns a unitary operator U_e on ℋ_e⊗_v ∈ eℋ_v to each edge e of G. We shall assume there is an implicit ordering of the unitary operators given by the edge labels which determines the order in which products of these operators are taken. The quantum circuit on G is defined by U_G∏_e ∈ EU_e. We are interested in the probability amplitude A_U_G, defined by A_U_G0^GU_G0^G. Note that any probability amplitude may be expressed in this form by a simple modification of the circuit. Our algorithmic result concerning the approximation of A_U_G is as follows. Fix Δ,r∈ℤ_≥2. Let G=(V, E) be a multihypergraph of maximum degree at most Δ and rank at most r. Suppose that, for all e ∈ E, U_e-𝕀≤1/e^3Δr2. Then the cluster expansion for log(A_U_G) converges absolutely, A_U_G≠0, and there is a fully polynomial-time approximation scheme for A_U_G. Theorem <ref> also applies to probability amplitudes of the form ψU_Gψ, where \|ψ⟩ is a product state over qudits, i.e., \|ψ⟩⊗_v ∈ V\|ψ_v⟩. Further, Theorem <ref> applies to unitary operators of the form U_e=e^-iθΦ(e), where θ is a real number such that θ≤1/e^4Δr2 and Φ(e) is a self-adjoint operator on ℋ_e with Φ(e)≤1. We prove Theorem <ref> by showing that the conditions required to apply Theorem <ref> are satisfied. That is, we show that (1) the probability amplitude A_U_G admits a suitable abstract polymer model representation, (2) the polymer weights satisfy the desired bound, and (3) the polymer weights can be computed in the desired time. This is achieved in the following three lemmas. The probability amplitude A_U_G admits the following abstract polymer model representation. A_U_G = ∑_Γ∈𝒢∏_γ∈Γw_γ, where w_γ0^γ[∏_e ∈ E(γ)(U_e-𝕀)]0^γ. By applying Lemma <ref> with f(E)=0^G(∏_e ∈ EU_e)0^G, we have A_U_G = 0^GU_G0^G = ∑_S ⊆ E(-1)^S∑_T ⊆ S(-1)^T0^G(∏_e ∈ TU_e)0^G. For a subset S ⊆ E, let Γ_S denote the maximally connected components of S. By factorising over these components, we have A_U_G = ∑_S ⊆ E∏_γ∈Γ_S(-1)^γ∑_T ⊆ E(γ)(-1)^T0^γ(∏_e ∈ TU_e)0^γ = ∑_S ⊆ E∏_γ∈Γ_S0^γ[∏_e ∈ E(γ)(U_e-𝕀)]0^γ = ∑_Γ∈𝒢∏_γ∈Γw_γ. This completes the proof. Fix Δ,r∈ℤ_≥2. Let G=(V, E) be a multihypergraph of maximum degree at most Δ and rank at most r. Suppose that, for all e ∈ E, U_e-𝕀≤1/e^3Δr2. Then, for all polymers γ∈𝒞, the weight w_γ satisfies w_γ≤(1/e^3Δr2)^γ. Fix a polymer γ. We have w_γ≤∏_e ∈ E(γ)U_e-𝕀≤(1/e^3Δr2)^γ, completing the proof. The weight w_γ of a polymer γ can be computed in time exp(O(γ)). The result follows by sparse matrix-vector multiplication. Combining Theorem <ref> with Lemma <ref>, Lemma <ref>, and Lemma <ref> proves Theorem <ref>. We now show that the algorithmic condition of Theorem <ref> is optimal in the case of multigraphs under complexity-theoretic assumptions. This is achieved by establishing a hardness of approximation result for the probability amplitude A_U_G. For convenience, we shall consider unitary operators of the form U_e=e^-iθΦ(e), where θ is a real number and Φ(e) is a self-adjoint operator on ℋ_e with Φ(e)≤1. Our hardness result concerning the approximation of A_U_G(θ) is as follows. Fix ϵ>0, Δ∈ℤ_≥3, and θ∈ℝ such that θ≥3π/5(Δ-2). It is #P-hard to approximate the probability amplitude A_U_G(θ) up to a multiplicative ϵ-approximation on multigraphs of maximum degree at most Δ. Our proof is based on a reduction from the Ising model partition function. We consider quantum circuits on multigraphs with a 2-dimensional Hilbert space at each vertex and unitary operators of the form U_e=e^-iθϕ(e)⊗_v ∈ eX_v, where ϕ(e) is a real number satisfying ϕ(e)≤1. We have A_U_G(θ) = 0^G(∏_e ∈ Ee^-iθϕ(e)⊗_v ∈ eX_v)0^G = 1/2^G∑_σ∈{-1,+1}^V∏_{u,v}∈ Ee^-iθϕ({u,v})σ_uσ_v = 1/2^GZ_Ising(G;iθ). The proof then follows from Theorem <ref>. Our results establish a computational complexity transition from P to #P-hard for the problem of approximating probability amplitudes. A similar transition may be established from P to BQP-hard for additive-error approximations. §.§ Expectation Values In this section we study the problem of approximating expectation values of quantum circuits. This problem is known to be #P-hard in general <cit.>; in particular, it is a special case of computing output probabilities of quantum circuits. We show that, for a class of quantum circuits with operators close to the identity, this problem admits an efficient approximation algorithm. This setting was studied in Ref. <cit.>, which established an efficient approximation algorithm for this problem. Our approach offers a simpler and sharper analysis in a more slightly general setting. Further, we show that this algorithmic condition is almost optimal in the sense of zero freeness. We model a quantum circuit by a multihypergraph G=(V, E) as in Section <ref> and assume that the size of G is at most a polynomial in the order of G. An operator O assigns a self-adjoint operator O_v on ℋ_v to each vertex v of G. The operator O_G on G is defined by O_G∏_v ∈ VO_v. We are interested in the expectation value O_U_G, defined by O_U_G0^GU_G^† O_G U_G0^G. We now introduce some further definitions that will be useful for our analysis. Let S_E(e)_e ∈ E denote the sequence of edges from G sorted in increasing order with respect to the edge labels. For a vertex v of G, let S_v denote the longest increasing subsequence of S_E such that every prefix induces a connected subgraph of G containing v. We define the causal subgraph C_v of v to be the subgraph of G induced by the sequence S_v. For a subset U of vertices of G, we define the causal subgraph C_U of U to be the subgraph of G induced by the set ⋃_v ∈ UE(C_v). We define the causal intersection hypergraph C(G) of G to be the hypergraph with vertex set V and edge set {V(C_v)}_v ∈ V. We identify the edges of C(G) with the vertices of G. Note that the connected components of a subgraph S of C(G) are in one-to-one correspondence with the connected components of C_E(S). We shall consider polymers that are connected subgraphs of C(G). Our algorithmic result concerning the approximation of O_U_G is as follows. Fix Δ,r∈ℤ_≥2. Let G=(V, E) be a multihypergraph such that the causal intersection hypergraph C(G) of G has maximum degree at most Δ and rank at most r. Suppose that, for all v ∈ V, O_v-𝕀≤1/e^3Δr2. Then the cluster expansion for log(O_U_G) converges absolutely, O_U_G≠0, and there is a fully polynomial-time approximation scheme for O_U_G. Theorem <ref> may be extended to a slightly more general class of product operators. In the case when G corresponds to a quantum circuit U_G of depth at most d with each gate acting on at most k qudits, the causal intersection hypergraph C(G) has maximum degree at most k^d and rank at most k^d. Further, when G is restricted to edges on the lattice graph ℤ^ν, the causal intersection hypergraph C(G) has maximum degree at most (2d)^ν and rank at most (2d)^ν. This implies that our algorithm may be applied to these classes of quantum circuits when O_v-𝕀≤2/e^3k^3d and O_v-𝕀≤2/e^3(2d)^3ν for all v ∈ V, respectively. A more refined analysis in the latter case shows that our algorithm may be applied when O_v-𝕀≤2/e^32^3νd^2ν for all v ∈ V. This offers a significant improvement over Ref. <cit.>, which applies to these classes when O_v-𝕀<1/60k^5d and O_v-𝕀<1/60(16d)^2ν for all v ∈ V, respectively. We prove Theorem <ref> by showing that the conditions required to apply Theorem <ref> are satisfied. That is, we show that (1) the expectation value O_U_G admits a suitable abstract polymer model representation, (2) the polymer weights satisfy the desired bound, and (3) the polymer weights can be computed in the desired time. This is achieved in the following three lemmas. The expectation value O_U_G admits the following abstract polymer model representation. O_U_G = ∑_Γ∈𝒢∏_γ∈Γw_γ, where w_γ0^γU_C_E(γ)^†[∏_e ∈ E(γ)(O_e-𝕀)]U_C_E(γ)0^γ. By applying Lemma <ref> with f(V)=0^GU_G^†(∏_v ∈ VO_v)U_G0^G, we have O_U_G = 0^GU_G^† O_G U_G0^G = ∑_S ⊆ V(-1)^S∑_T ⊆ S(-1)^T0^GU_G^†(∏_v ∈ TO_v)U_G0^G = ∑_S ⊆ E(C(G))(-1)^S∑_T ⊆ S(-1)^T0^GU_G^†(∏_e ∈ TO_e)U_G0^G. For a subset S ⊆ E(C(G))), let Γ_S denote the maximally connected components of S. By factorising over these components, we have O_U_G = ∑_S ⊆ E∏_γ∈Γ_S(-1)^γ∑_T ⊆ E(γ)(-1)^T0^γU_G^†(∏_e ∈ TO_e)U_G0^γ = ∑_S ⊆ E∏_γ∈Γ_S(-1)^γ∑_T ⊆ E(γ)(-1)^T0^γU_C_E(γ)^†(∏_e ∈ TO_e)U_C_E(γ)0^γ = ∑_S ⊆ E∏_γ∈Γ_S0^γU_C_E(γ)^†[∏_e ∈ E(γ)(O_e-𝕀)]U_C_E(γ)0^γ = ∑_Γ∈𝒢∏_γ∈Γw_γ. This completes the proof. Fix Δ,r∈ℤ_≥2. Let G=(V, E) be a multihypergraph such that the causal intersection hypergraph C(G) of G has maximum degree at most Δ and rank at most r. Suppose that, for all v ∈ V, O_v-𝕀≤1/e^3Δr2. Then, for all polymers γ∈𝒞, the weight w_γ satisfies w_γ≤(1/e^3Δr2)^γ. Fix a polymer γ. We have w_γ≤∏_e ∈ E(γ)O_e-𝕀≤(1/e^3Δr2)^γ, completing the proof. The weight w_γ of a polymer γ can be computed in time exp(O(γ)). The proof follows similarly to that of Lemma <ref>. Combining Theorem <ref> with Lemma <ref>, Lemma <ref> and Lemma <ref> proves Theorem <ref>. We now show that the algorithmic condition of Theorem <ref> is almost optimal in the sense of the zero freeness of the expectation value. This is achieved by a constructive argument based on an observation of Ref. <cit.> and is formalised by the following theorem. Fix d∈ℤ^+ and k∈ℤ_≥2. There exists a hypergraph G=(V, E), a quantum circuit U_G of depth d with each gate acting on at most k qubits, and an operator O satisfying O_v-𝕀≤2/k^d for all v ∈ V, such that O_U_G=0. Let \|ψ_n⟩ denote the state \|ψ_n⟩1/√(2)(\|0^n⟩+\|1^n⟩). Note that there is a hypergraph G and a quantum circuit U_G of depth d with each gate acting on at most k qubits such that \|ψ_k^d⟩=U_G\|0^G⟩. We consider the operator O with O_v=𝕀+itan(π/2k^d)Z_v for all v ∈ V. Then, we have O_U_G = 0^GU_G^† O_G U_G0^G = ψ_k^d[∏_v ∈ V(𝕀+itan(π/2k^d)Z_v)]ψ_k^d = ψ_k^d(∑_S ⊆ V∏_v ∈ Sitan(π/2k^d)Z_v)ψ_k^d = 1/2∑_S ⊆ V[itan(π/2k^d)]^S[1+(-1)^S] = 1/2[(1+itan(π/2k^d))^k^d+(1-itan(π/2k^d))^k^d] = 0. Further, for all v ∈ V, we have O_v-𝕀 = tan(π/2k^d)≤2/k^d. This completes the proof. The operator in the proof of Theorem <ref> is not self-adjoint. §.§ Partition Functions In this section we study the problem of approximating partition functions of quantum spin systems. This problem is known to be #P-hard in general <cit.>; however, we show that, for a class of quantum spin systems at high temperature, this problem admits an efficient approximation algorithm. Efficient approximation algorithms have previously been established for approximating partition functions of quantum spin systems at high temperature <cit.> and for restricted classes at low temperature <cit.>. Our analysis closely follows that of Ref. <cit.> and can be viewed as a straightforward generalisation from the setting of bounded-degree graphs to bounded-degree bounded-rank multihypergraphs. This offers a simpler and slightly sharper analysis than Refs. <cit.>. Further, we show that this algorithmic condition is optimal under complexity-theoretic assumptions. We model a quantum spin system by a multihypergraph G=(V, E). At each vertex v of G there is a d-dimensional Hilbert space ℋ_v with d<∞. The Hilbert space on the multihypergraph is given by ℋ_G⊗_v ∈ Vℋ_v. An interaction Φ assigns a self-adjoint operator Φ(e) on ℋ_e⊗_v ∈ eℋ_v to each edge e of G. The Hamiltonian on G is defined by H_G∑_e ∈ EΦ(e). We are interested in the partition function Z_G(β) at inverse temperature β, defined by Z_G(β)[e^-β H_G]. We shall assume that the trace is normalised so that (𝕀)=1, which is equivalent to a rescaling the partition function by a multiplicative factor. Further, we shall assume that Φ(e)≤1 for all e ∈ E, which is always possible by a rescaling of β. Our algorithmic result concerning the approximation of Z_G(β) is as follows. Fix Δ,r∈ℤ_≥2. Let G=(V, E) be a multihypergraph of maximum degree at most Δ and rank at most r, and let β be a complex number such that β≤1/e^4Δr2. Then the cluster expansion for log(Z_G(β)) converges absolutely, Z_G(β)≠0, and there is a fully polynomial-time approximation scheme for Z_G(β). Theorem <ref> applies when β is complex, which includes the case of time evolution. This offers a modest improvement over Ref. <cit.>, which established a quasi-polynomial time algorithm when β≤1/10e^2Δr2 and over Ref. <cit.>, which established a polynomial-time algorithm when β≤1/16e^4Δr2. In the case when G is a bounded-degree graph, we recover the results of Ref. <cit.>. We prove Theorem <ref> by showing that the conditions required to apply Theorem <ref> are satisfied. That is, we show that (1) the partition function Z_G(β) admits a suitable abstract polymer model representation, (2) the polymer weights satisfy the desired bound, and (3) the polymer weights can be computed in the desired time. This is achieved in the following three lemmas. The partition function Z_G(β) admits the following abstract polymer model representation. Z_G(β) = ∑_Γ∈𝒢∏_γ∈Γw_γ, where w_γ (-1)^γ∑_T ⊆ E(γ)(-1)^T[e^-β∑_e ∈ TΦ(e)]. By applying Lemma <ref> with f(E)=[e^-β∑_e ∈ EΦ(e)], we have Z_G(β) = [e^-β H_G] = ∑_S ⊆ E(-1)^S∑_T ⊆ S(-1)^T[e^-β∑_e ∈ TΦ(e)]. For a subset S ⊆ E, let Γ_S denote the maximally connected components of S. By factorising over these components, we have Z_G(β) = ∑_S ⊆ E∏_γ∈Γ_S(-1)^γ∑_T ⊆ E(γ)(-1)^T[e^-β∑_e ∈ TΦ(e)] = ∑_S ⊆ E∏_γ∈Γ_Sw_γ = ∑_Γ∈𝒢∏_γ∈Γw_γ. This completes the proof. Fix Δ,r∈ℤ_≥2. Let G=(V, E) be a multihypergraph of maximum degree at most Δ and rank at most r, and let β be a complex number such that β≤1/e^4Δr2. Then, for all polymers γ∈𝒞, the weight w_γ satisfies w_γ≤(1/e^3Δr2)^γ. Fix a polymer γ. Let P denote the set of all sequences of edges in γ. By the Taylor series, w_γ≤∑_T ⊆ E(γ)(-1)^Te^-β∑_e ∈ TΦ(e)≤∑_ρ∈ P supp(ρ)=γβ^ρ/ρ!∏_e ∈ρΦ(e)≤∑_ρ∈ P supp(ρ)=γβ^ρ/ρ!. There are precisely {}0ptnγγ! sequences ρ of length n whose support is γ, where {}0ptnγ denotes the Stirling number of the second kind. Hence, we may write w_γ≤∑_n=γ^∞{}0ptnγγ!/n!β^n = (e^β-1)^γ, where we have used the identity ∑_n=k^∞{}0ptnkx^n/n!=(e^x-1)^k/k^!. By taking β≤(e^4Δr2)^-1, we have w_γ≤(1/e^3Δr2)^γ, completing the proof. The weight w_γ of a polymer γ can be computed in time exp(O(γ)). The sum is over all subsets T of E(γ), of which there are 2^γ. For each of these subsets T, the trace may be evaluated in time exp(O(γ)) by diagonalising the sum of interactions. Combining Theorem <ref> with Lemma <ref>, Lemma <ref>, and Lemma <ref> proves Theorem <ref>. We now show that the algorithmic condition of Theorem <ref> is optimal in the case of multigraphs under complexity-theoretic assumptions. This is achieved by establishing a hardness of approximation result for the partition function Z_G(β) at imaginary temperature, i.e., β=iθ for θ∈ℝ. Our hardness result concerning the approximation of Z_G(iθ) is as follows. Fix ϵ>0, Δ∈ℤ_≥3, and θ∈ℝ such that θ≥3π/5(Δ-2). It is #P-hard to approximate the partition function Z_G(iθ) up to a multiplicative ϵ-approximation on multigraphs of maximum degree at most Δ. Our proof is based on a reduction from the Ising model partition function. We consider quantum spin systems on multigraphs with a 2-dimensional Hilbert space at each vertex and self-adjoint operators of the form Φ(e)=ϕ(e)⊗_v ∈ eZ_v, where ϕ(e) is a real number satisfying ϕ(e)≤1. We have Z_G(iθ) = [∏_e ∈ Ee^-iθϕ(e)⊗_v ∈ eZ_v] = 1/2^G∑_σ∈{-1,+1}^V∏_{u,v}∈ Ee^-iθϕ({u,v})σ_uσ_v = 1/2^GZ_Ising(G;iθ). The proof then follows from Theorem <ref>. We note that a hardness of approximation result with similar bounds may be obtained for real temperature under the assumption that RP is not equal to NP via the results of Refs. <cit.>. Our results establish a computational complexity transition from P to #P-hard for the problem of approximating partition functions. A similar transition may be established from P to BQP-hard for additive-error approximations. §.§ Thermal Expectation Values In this section we study the problem of approximating thermal expectation values of quantum spin systems. This problem is known to be #P-hard in general <cit.>; however, we show that, for a class of quantum spin systems at high temperature with positive-semidefinite operators, this problem admits an efficient approximation algorithm. This setting was studied in Ref. <cit.>, which established an efficient approximation algorithm for this problem. Our approach offers a similar but slightly sharper analysis. Further, we show that this algorithmic condition is optimal in the sense of zero freeness. We model a quantum spin system by a multihypergraph G=(V, E) as in Section <ref>. An operator Ψ assigns a positive-semidefinite operator Ψ(v) on ℋ_v to each vertex v of G. The operator Ψ_G on G is defined by Ψ_G∏_v ∈ VΨ(v). We are interested in the thermal expectation value Ψ_G(β) at inverse temperature β, defined by Ψ_G(β)Z_G^Ψ(β)/Z_G(β), where Z_G^Ψ(β)[Ψ_Ge^-β H_G]. We shall assume that the positive-semidefinite operators are normalised so that (Ψ_v)=1 for all v ∈ V, which is equivalent to a rescaling of the thermal expectation value by a multiplicative factor. Our algorithmic result concerning the approximation of Ψ_G(β) is as follows. Fix Δ,r∈ℤ_≥2. Let G=(V, E) be a multihypergraph of maximum degree at most Δ and rank at most r, and let β be a complex number such that β≤1/e^4Δr2. Then the cluster expansion for log(Ψ_G(β)) converges absolutely, Ψ_G(β)≠0, and there is a fully polynomial-time approximation scheme for Ψ_G(β). Theorem <ref> applies when β is complex, which includes the case of time evolution. This offers a modest improvement over Ref. <cit.> when Δ≥4, which established a polynomial-time algorithm when β≤1/2e^2(Δ-1)r(Δ r-r+1). By using the slightly sharper bound given in the remark subsequent to Lemma <ref>, we obtain an improvement when Δ≥3. We note that efficient approximations algorithms may be established when the observable appears in the Hamiltonian under different assumptions. We prove Theorem <ref> by showing that the conditions required to apply Theorem <ref> are satisfied and then combining this with Theorem <ref>. That is, we show that (1) Z_G^Ψ(β) admits a suitable abstract polymer model representation, (2) the polymer weights satisfy the desired bound, and (3) the polymer weights can be computed in the desired time. This is achieved in the following three lemmas. Z_G^Ψ(β) admits the following abstract polymer model representation. Z_G^Ψ(β) = ∑_Γ∈𝒢∏_γ∈Γw_γ, where w_γ (-1)^γ∑_T ⊆ E(γ)(-1)^T[Ψ_γ e^-β∑_e ∈ TΦ(e)]. The proof follows similarly to that of Lemma <ref>. Fix Δ,r∈ℤ_≥2. Let G=(V, E) be a multihypergraph of maximum degree at most Δ and rank at most r, and let β be a complex number such that β≤1/e^4Δr2. Then, for all polymers γ∈𝒞, the weight w_γ satisfies w_γ≤(1/e^3Δr2)^γ. The proof follows similarly to that of Lemma <ref>. The weight w_γ of a polymer γ can be computed in time exp(O(γ)). The sum is over all subsets T of E(γ), of which there are 2^γ. For each of these subsets T, the trace may be evaluated in time exp(O(γ)) by diagonalising the sum of interactions and matrix multiplication. Combining Theorem <ref> with Lemma <ref>, Lemma <ref>, Lemma <ref>, and Theorem <ref> proves Theorem <ref>. We now show that the algorithmic condition of Theorem <ref> is optimal in the case of multigraphs in the sense of the zero freeness of the thermal expectation value. This is achieved by a straightforward constructive argument and is formalised by the following theorem. Fix Δ∈ℤ^+. There exists a multigraph G=(V, E) of maximum degree Δ, an operator O, and a self-adjoint operator Φ, such that Ψ_G(β)=0 with β=iπ/Δ. We consider a quantum spin system on a multigraph comprising a single multiedge with a 2-dimensional Hilbert space at each vertex. Further, we consider the operator Ψ with Ψ(v)=\|0⟩⟨0\|_v for all v ∈ V and the self-adjoint operator Φ with Φ(e)=1/4(⊗_v ∈ eX_v-⊗_v ∈ eY_v-⊗_v ∈ eZ_v) for all e ∈ E. Then, we have Ψ_G(β) = [Ψ_Ge^-β H_G]/[e^-β H_G] = 00e^-iπ/4(X⊗X-Y⊗Y-Z⊗Z)00/[e^-iπ/4(X⊗X-Y⊗Y-Z⊗Z)] = 0. This completes the proof. § CONCLUSION & OUTLOOK We have established a general framework for developing approximation algorithms and hardness of approximation results for a class of counting problems. We applied this framework to obtain efficient approximation algorithms and hardness of approximation results for several quantum problems under certain algorithmic conditions. In particular, we obtained efficient approximation algorithms for (1) approximating probability amplitudes of a class of quantum circuits close to the identity, (2) approximating expectation values of a class of quantum circuits with operators close to the identity, (3) approximating partition functions of a class of quantum spin systems at high temperature, and (4) approximating thermal expectation values of a class of quantum spin systems at high temperature with positive-semidefinite operators. Further, we obtained hardness of approximation results for approximating probability amplitudes of quantum circuits and partition functions of quantum spin systems. Our results established a computational complexity transition for the problems of approximating probability amplitudes of quantum circuits and partition functions of quantum spin systems and showed that our algorithmic conditions for these problems are optimal under complexity-theoretic assumptions. Finally, we showed that our algorithmic condition is almost optimal for expectation values and optimal for thermal expectation values in the sense of zero freeness. It would be interesting to identify other quantum problems to which our framework applies. Further, it is an intriguing open problem to identify the exact points of a computational complexity transition for these problems, as is known for the Ising model at real temperature <cit.>. Finally, it would be interesting to obtain algorithms with an improved runtime, for example, via the Markov chain polymer approach of Ref. <cit.>. § ACKNOWLEDGEMENTS We thank Tyler Helmuth for helpful discussions. RLM was supported by the QuantERA ERA-NET Cofund in Quantum Technologies implemented within the European Union's Horizon 2020 Programme (QuantAlgo project), EPSRC grants EP/L021005/1, EP/R043957/1, and EP/T001062/1, and the ARC Centre of Excellence for Quantum Computation and Communication Technology (CQC2T), project number CE170100012. RMM was supported by the Additional Funding Programme for Mathematical Sciences, delivered by EPSRC (EP/V521917/1) and the Heilbronn Institute for Mathematical Research. No new data were created during this study.
http://arxiv.org/abs/2307.00235v1	20230701055344	Evaluating The Interference Potential in 6 GHz: An Extensive Measurement Campaign of A Dense Indoor Wi-Fi 6E Network	[ "Seda Dogan-Tusha", "Muhammad Iqbal Rochman", "Armed Tusha", "Hossein Nasiri", "James Helzerman", "Monisha Ghosh" ]	cs.NI	[ "cs.NI" ]	none [WiNTECH '23]The 17th ACM Workshop on Wireless Network Testbeds, Experimental evaluation & CHaracterizationOctober 6, 2023Madrid, Spain The 17th ACM Workshop on Wireless Network Testbeds, Experimental evaluation & CHaracterization (WiNTECH '23), October 6, 2023, Madrid, Spain 15.00 10.1145/XXXXXXX.XXXXXXX 978-1-4503-XXXX-X/XX/XX printacmref=false An Extensive Measurement Campaign of A Dense Indoor Wi-Fi 6E Network]Evaluating The Interference Potential in 6 GHz: An Extensive Measurement Campaign of A Dense Indoor Wi-Fi 6E Network University of Notre Dame [email protected] University of Chicago [email protected] University of Notre Dame [email protected] University of Notre Dame [email protected] University of Michigan [email protected] University of Notre Dame [email protected] The Federal Communications Commission (FCC) has allocated the 6 GHz band (5.925 - 7.125 GHz) for unlicensed, shared use in the US. Incumbents in the band are protected via Low Power Indoor (LPI) rules that do not require the use of an Automatic Frequency Control (AFC) mechanism and Standard Power (SP) rules which do. Wi-Fi 6E implements the LPI rules and deployments have been increasing, but there is limited research examining the real-world interference potential of dense LPI deployments to fixed links, which remains a concern for incumbents. We address this gap by conducting a first-of-its-kind extensive measurement campaign of a dense indoor Wi-Fi 6E network at the University of Michigan. The campaign includes walking, driving, and drone measurements to assess outdoor beacon Received Signal Strength Indicator (RSSI), building entry loss (BEL), channel utilization, and appropriate enabling signal level for a proposed client-to-client (C2C) mode in 6 GHz. Our detailed measurements under various conditions show median outdoor RSSI between -75 dBm and -85 dBm, BEL between 12 dB and 16 dB through double-pane low-emission windows, and only 5% of indoor Basic Service Set Identifiers (BSSIDs) observed outdoors. Our overall conclusion is that the probability of interference to incumbent fixed links is low, but more research is required to determine the appropriate signal level for the C2C enabling signal. <ccs2012> <concept> <concept_id>10003033.10003079.10011704</concept_id> <concept_desc>Networks Network measurement</concept_desc> <concept_significance>500</concept_significance> </concept> <concept> <concept_id>10003033.10003079.10011672</concept_id> <concept_desc>Networks Network performance analysis</concept_desc> <concept_significance>500</concept_significance> </concept> </ccs2012> [500]Networks Network measurement [400]Networks Network performance analysis [ Monisha Ghosh July 31, 2023 ================= § INTRODUCTION §.§ Unlicensed use of 6 GHz in the US The increasing bandwidth demands of new wireless applications and use cases prompted the U.S. Federal Communications Commission (FCC), in 2020, to allocate the 6 GHz band from 5.925 GHz to 7.125 GHz for unlicensed use on a shared basis with existing incumbents, primarily fixed microwave links, cable television relay services (CTRS), satellite and mobile Broadcast Auxiliary Services (BAS) <cit.>. While some countries have only allocated the lower 500 MHz on an unlicensed basis reserving the upper portion for possible future auctions and licensing <cit.>, the large number of incumbents in the band (> 48,000) made the prospect of relocating incumbents prior to licensing a major challenge for the U.S. Hence, the most expedient way of making this band available for commercial applications was to develop rules for unlicensed devices to use this band while sharing with incumbents. Since the majority of wireless traffic, approximately 60%, is handled by Wi-Fi <cit.>, allocating this band for unlicensed use also relieves the growing congestion in the existing 2.4 GHz and 5 GHz unlicensed bands. The 6 GHz band encompasses four U-NII (Unlicensed National Information and Infrastructure) bands: U-NII-5 to U-NII-8, as listed with its incumbents in Table <ref>. Incumbents are protected via two sets of rules that unlicensed devices must follow: low power indoor (LPI) and standard power (SP). LPI operation is permitted across the entire 6 GHz band without the need for an Automatic Frequency Control (AFC) system, but access points (APs) must be installed indoors. SP APs can be installed anywhere, but are limited to U-NII-5 and U-NII-7 and require an AFC to avoid interference with incumbents. Thus, Wi-Fi 6E devices can utilize 14 additional 80 MHz channels and 7 additional 160 MHz channels over the total 1200 MHz span as shown in Fig. <ref>. This paper focuses on LPI deployments since the AFC is still under development and SP APs have not yet been deployed. Unlike the 5 GHz band regulations, Wi-Fi 6E APs operating under LPI rules in the 6 GHz band must adhere to a maximum power spectral density (PSD) of 5 dBm/MHz, regardless of the channel bandwidth <cit.>. This corresponds to maximum transmit (Tx) powers shown in Table <ref>. While APs are limited to indoor use, client devices (STAs) can be anywhere, including outdoors, and are therefore required to transmit 6 dB less power than the AP. In the Further Notice of Proposed Rulemaking (FNPRM) <cit.> and the Public Notice <cit.>, the FCC is considering enhancing the 6 GHz rules in the future by (i) raising the PSD limit to 8 dBm/MHz, (ii) adding a Very Low Power (VLP) option with a PSD of -8 dBm/MHz and maximum transmit power of 14 dBm that can be used anywhere without requiring AFC access, and (iii) implementing a client-to-client (C2C) mode that enables direct connections between client devices via an enabling signal from a LPI AP. These options require further research to ensure that incumbents will continue to be protected: the results of this paper will inform this process. §.§ Related Work While various coexistence scenarios in 6 GHz have been studied in the academic literature, there is a lack of research on analyzing interference to incumbents. In <cit.>, the use of multi-user orthogonal frequency division multiple access (MU-OFDMA) for uplink Wi-Fi 6E is proposed for coexistence with 3GPP-based unlicensed technologies, i.e., 5G NR-U. Authors in <cit.> consider the impact of Wi-Fi 6E on ultra-wideband (UWB) communications and ranging. In <cit.>, the authors study the adjacent channel interference between Wi-Fi 6E in 6 GHz and C-V2X (Cellular Vehicle-to-Everything) in the adjacent 5.9 GHz. Studies of coexistence with incumbents are mainly conducted by various industry stakeholders, particularly fixed links operators and unlicensed proponents. In <cit.> the additive impact of unlicensed LPI operations is assessed by analyzing Wi-Fi 6E APs operating co-channel within the main beam of an operational system in the FirstEnergy network. In <cit.>, a predicted potential interference analysis over 5 years has been presented for Pacific Gas & Electric’s deployments. In <cit.>, the fade margin degradation of a 6 GHz link in the presence of a Wi-Fi 6E AP in the path is demonstrated. However, the experimental set-ups in studies by the incumbents are quite contrived, e.g., APs intentionally placed near windows on the same channel as an incumbent and within the main beam, which are not reflected in real-world deployments. Hence our goal is to understand the statistics of interference based on a dense real-world deployment, instead of worst-case scenarios. §.§ Motivation & Main Contributions Given the above discussion, the aim of this study is to evaluate, in an unbiased manner, the potential for interference to outdoor fixed links from a real-world, densely deployed 6 GHz LPI network. The main contributions of this paper are: ∙ A first-of-its-kind, extensive measurement campaign undertaken on the main campus of the University of Michigan (UMich) in Ann Arbor which has more than 16,000 Wi-Fi 6E LPI APs deployed across 225 buildings. This is the largest such deployment in the world today. ∙ Generating heat-maps at ground level of outdoor Received Signal Strength Indicator (RSSI) measured on the 20 MHz beacon frames transmitted by LPI APs, using measurements obtained by walking and driving on the main campus area (MCA) and the nearby residential area (RA). ∙ Drone measurements around buildings near the path of 6 GHz fixed links to assess outdoor RSSI levels at higher altitudes where these links are deployed. ∙ We demonstrate median outdoor RSSI levels of -82 dBm while driving and -77 dBm while walking on campus. We show that the number of APs within a building, the positioning of the APs in relation to nearby windows, construction type and window materials, all are crucial in determining the outdoor RSSI levels. ∙ Despite the significant number of deployed indoor APs, each with an average of two Basic Service Set Identifiers (BSSIDs) per AP, only 5% of these BSSIDs are observed outdoors thus indicating that the potential for interference is limited to a smaller number than the deployed number. ∙ Measurements of building loss in two buildings on campus demonstrate building entry loss (BEL) of 12 - 16 dB through double-pane low-E windows. § TOOLS AND METHODOLOGY Fig. <ref> shows the Wi-Fi 6E deployments in the MCA and the RA of UMich. The campus is located in Ann Arbor with a high density of pedestrian and vehicular traffic, serving as an ideal location to assess potential interference from densely deployed indoor 6 GHz networks. The majority of the buildings in the MCA have double-pane low-E windows. Only 227 APs are deployed in the RA, which is a less dense deployment compared to the MCA which has a few thousand deployed APs. §.§ Measurement Tools Client devices were used to capture signal information in various environments, using two tools, SigCap and Wireshark, on smartphones and laptops respectively, to extract various signal parameters as shown in Table <ref>. SigCap is a custom Android app that passively collects time and geo-stamped wireless signal parameters (cellular and Wi-Fi) through APIs without root access <cit.>. Wi-Fi parameters, such as RSSI, channel, BSSID, etc. are collected from the beacon frames every 5 seconds. Optional beacon elements with information on Tx signal power, number of stations connected to each BSSID and channel utilization (percentage of time that the AP senses the channel to be busy) are also collected: fortunately, all the Wi-Fi 6E APs deployed in UMich broadcast these optional elements, thus facilitating our analysis. Wireshark is an open source tool that we used for capturing both beacon and data frames using a Lenovo ThinkPad P16 Gen1 with the Intel(R) Wi-Fi AX211 Wi-Fi adapter. We intentionally did not use spectrum analyzers for this work since the bursty nature of Wi-Fi traffic and the low outdoor RSSI levels are better captured using the above tools. Using smartphones enables mobile data collection which is difficult to do even with a handheld spectrum analyzer. §.§ Methodology The measurements were conducted in two campaigns, as described below:. §.§.§ Measurement Campaign 1 (MC1): MC1 took place on January 7-9, 2023, during which measurements were conducted while driving and in a fixed location on campus. Driving Measurements were conducted in the MCA as shown in Fig. <ref> between 9:50 pm and 00:50 am, at a speed of 20 miles per hour. Data was collected with SigCap running on the five smartphones listed in Table <ref>. Due to the cold weather, walking measurements were not conducted in MC1. Fixed Location 1 (FL1) measurements were taken inside and outside a building with an open indoor area with high occupancy. Fig. <ref> shows the position of the Wi-Fi 6E LPI AP in the space. The AP is positioned 6 meters away from double pane low-E windows. The indoor measurements were taken by placing the phones near the window while the outdoor measurement location is 1.5 meters from the window. Wireshark and Sigcap were both used for measurements, as shown in Fig. <ref>. The AP transmit power was 15 dBm over a 160 MHz channel bandwidth, which is considerably lower than the regulatory limits specified in Table <ref>. This reduction in transmit power is due to the dense deployment of LPI APs, since many users need to be supported in this area. §.§.§ Measurement Campaign 2 (MC2): MC2 was conducted on May 24-27, 2023 with drone, driving, walking, and fixed location measurements. The deployment had been changed from mostly 160 MHz channels observed in MC1 to mostly 80 MHz channels during MC2. This was done by UMich Information and Technology Services (ITS) to serve more users with a higher quality of service. However, since our analysis depends on measurements of the 20 MHz beacon channel RSSI, this change did not affect our results or comparisons. Drone Measurements: There are five active, fixed links in the MCA, as shown by the black lines in Fig. <ref>. Three of these links have their transmitters (referred to as Tx1, Tx2 and Tx3 in the figure) located within the MCA, while the transmitters of the other two links (Tx4 and Tx5) are positioned at a significant distance away from the campus. Rx4 is the only receiver (Rx) on campus but the link direction is away from the buildings with dense deployments. Nine buildings, indicated by the orange pins in Fig. <ref>, were chosen for drone measurements due to their proximity to Links 1 and 2, operating at center frequencies 7037.5 MHz and 6212.065 MHz with bandwidths of 25 MHz and 56 MHz respectively <cit.>. Table <ref> provides information on the height of these buildings and the number of Wi-Fi 6E LPI APs deployed in each. On average, we assume two BSSIDs per AP in 6 GHz as determined by UMich ITS. The drone measurements were conducted during daylight hours over a period of three days. As shown in Fig. <ref>, a Samsung S22+ smartphone with SigCap was tied to the drone for data collection. The drone moved vertically up and down, parallel to the wall of a given building. Driving Measurements: In order to validate the driving measurements conducted in MC1, we replicated the same route as closely as possible. The measurements were carried out between 10:00 pm to 12:00 am, mirroring the timeframe of MC1 using the same 5 phones with SigCap. Walking Measurements: The center of the campus, where Wi-Fi 6E is densely deployed, offers only pedestrian access. Hence RSSI measurements were collected in this area by walking with hand-held phones running SigCap (Fig. <ref>). Fixed Location 2 (FL2): The measurement area is a conventional classroom on the first floor of a building, shown in Fig. <ref>. The single AP in the room is center-mounted on the ceiling, and the room has a north facing exterior wall. The outdoor measurement location is 7 meters away from this wall due to trees obstructing closer access. § RESULTS & DISCUSSIONS We present statistical analyses of the measurements under different conditions. The discussions are categorized into two groups: (i) ground level driving & walking measurements and (ii) aerial drone measurements. §.§ Driving and Walking Measurements Outdoor RSSI Levels: Fig. <ref> shows the map of outdoor beacon RSSI levels measured during the driving and walking campaigns. The minimum and maximum RSSI values measured across the MCA are -94 dBm and -62 dBm for the driving measurements, and -92 dBm and -55 dBm for the walking measurements, respectively. Transmit power levels ranging from P_TX= 15 dBm to P_TX= 21 dBm were observed within the MCA, with P_TX= 16 dBm being the most frequently used. 73% and 95% of the RSSI measurements were with P_TX≤ 18 dBm for the driving and walking measurements in the MCA, respectively. Statistical analyses of the measurements in the MCA and RA, using cumulative distribution function (CDF) plots of the measured RSSI at different transmit power levels, are shown in Fig. <ref>. Fig. <ref> shows the CDF of driving measurements within the MCA for MC1 (S1) and MC2 (S2). While P_TX represents the transmit power for the AP, the maximum power of the 20 MHz beacon frames is 18 dBm for P_TX≥ 18 dBm as shown in Table <ref>. MC1 measurements showed a transmit power of 15 dBm: this changed when we returned in May for MC2. The median outdoor RSSI level is -85 dBm for both S1 and S2 under P_TX= 15 dBm, while the highest median RSSI value is -81 dBm for S2 under P_TX= 16 dBm due to being the most frequently used. Fig. <ref> shows the CDF of outdoor RSSI levels recorded during walking measurements (only in MC2) in the MCA (S2) and the RA (S3). A single transmit power of P_TX= 21 dBm was observed in the RA deployment, which is less dense than the MCA and hence each AP can transmit at a higher power without interference. This is still 3 dB less than the maximum allowed power of 24 dBm for 80 MHz channels. Due to the proximity of the walking measurement locations to the buildings, an increase of 1-9 dBm is observed for the median RSSI values in the walking measurements compared to the driving measurements in the case of S2. Fig. <ref> shows the results obtained for each of the 80 MHz channels with Tx power of P_TX= 16 dBm: all the channels exhibit similar behavior. Finally, Fig. <ref> shows the outdoor RSSI heatmap for the MCA and RA. As expected, the areas with a high concentration of APs have higher outdoor RSSI levels compared to areas with fewer APs. The gray areas show the regions where the 6 GHz beacon frames were not captured at all. Appropriate Enabling Signal Level for C2C mode: In the proposed C2C mode, clients that can receive an enabling signal from any Wi-Fi 6E AP can directly communicate with each other, at STA LPI power levels, bypassing the need for data transmission through the AP. Device sharing is an example application that benefits from the C2C mode, reducing air time occupancy and latency. While the intended use of C2C is to improve indoor performance, care must be taken to set an appropriate level for the enabling signal so that client devices that are outdoors do not transmit to each other. The proposals submitted to the FCC recommended using -86 dBm/20 MHz and -82 dBm/20 MHz as enabling signal levels <cit.>. Based on our walking results above, where the median outdoor RSSI level varies between -75 dBm and -85 dBm, even a level of -82 dBm could trigger > 50% of outdoor devices to communicate with each other, which is not desirable. Hence, further measurements and analyses should be performed to determine an appropriate enabling signal level for C2C that minimizes the probability of interference. Channel Utilization and Number of Unique BSSIDs: Channel utilization and number of unique BSSIDs observed outdoors help to understand the potential interference impact of a dense deployment. A higher channel utilization and larger number of unique BSSIDs on a particular frequency point to increased potential for interference on that frequency. CDFs of channel utilization for different P_Tx are shown in Fig. <ref>. Fig. <ref> shows that the median channel utilization is about 5% for most of the P_Tx scenarios during the driving measurements. In the walking measurements, Fig. <ref>, higher maximum channel utilization is observed but the median value is still approximately 10%. The discrepancy between driving and walking could be due to the fact that the driving measurements were taken in the night around the periphery of the campus whereas the walking measurements were during the daytime in the heart of campus. The highest channel utilization corresponds to scenarios with low P_Tx, in the range 15-18 dBm, while walking in the MCA. Since lower Tx power is usually used in dense deployments, this result is expected. The median channel utilization while walking in the RA is lower than the corresponding scenario in the MCA, which indicates more usage on campus, which is also expected since there are fewer users in the RA. Fig. <ref> shows the number of unique BSSIDs in each 80 MHz channel observed in the MCA and RA, demonstrating a similar pattern for the walking measurements in both areas and, as expected, a reduced number in the driving measurements in the MCA. The key takeaway from this result is that while there is a slightly higher number of unique BSSIDs observed outdoors on channel 135 in both areas, overall, all channels are used relatively uniformly, thus reducing the probability of interference to an outdoor fixed link that overlaps with a particular 80 MHz channel. §.§ Drone Measurements Driving and walking measurements obtained at ground level alone do not offer a comprehensive understanding of the interference potential in the 6 GHz band since most outdoor fixed links are deployed at higher altitudes. Hence, the drone experiments provide insights into the RSSI levels as a function of altitude. Outdoor RSSI vs. Altitude: Fig. <ref> summarizes the RSSI measured at different altitudes near the nine buildings listed in Table <ref> The observed range of RSSI is between -93 dBm and -55 dBm. RSSI values greater than -60 dBm were not observed above a height of 20m. Above a height of 30m, the RSSI values are less than -68 dBm. In order to provide an in-depth analysis of the relationship between RSSI and factors such as number of Wi-Fi 6E APs, construction material, and altitude, Fig. <ref> shows RSSI vs. altitude for four representative buildings: BLD2, BLD4, BLD5 and BLD6 with 368, 800, 68 and 92 BSSIDs respectively, as shown in Table <ref>. BLD2 and BLD4 have many more APs compared to the other two. From Fig. <ref> and Fig. <ref> we see that the drone measurements near BLD2 and BLD4 provide a larger number of data samples up to 60m compared to BLD5 and BLD6 which have fewer APs. However, there is an uniform decrease in the number of samples and RSSI with increase in altitude for all 4 buildings. Despite having fewer APs than BLD6, there are more data samples observed near BLD5 with higher RSSI: this is because unlike most buildings on campus, BLD5 is a historical building with single pane windows, resulting in lower loss. Number of Unique BSSIDs: Fig. <ref> shows a high RSSI value of -45 dBm obtained at 10m near BLD4 which we investigate further. Fig. <ref> shows the relative location of this data sample and the corresponding BSSID/AP inside the building. The AP is in a room on the first floor and there is line-of-sight (LOS) through a corner window, resulting in the high outdoor RSSI measured at the outdoor location. It is important to note, however, that not all APs will contribute to significant signal emissions outdoors. In addition to the number of APs within a given building, the likelihood of these APs to LOS conditions through nearby windows plays a vital role in the resulting outdoor RSSI levels, and hence potential for interference. Figs. <ref> and <ref> illustrate the number of unique BSSIDs vs. altitude for the the nine buildings and for BLD4, respectively. Although the number of unique BSSIDs observed within the altitude range of 0-20 m and 20-40 m is fairly comparable, there is a noticeable decrease in the number of unique BSSIDs as the altitude range extends to 40-60 m and 60-80 m, thus indicating reduced potential for interference at higher altitudes. Finally, Fig. <ref> shows the CDF of RSSI for BLD4. While the median outdoor RSSI values remain consistent across the three altitude intervals, there is a decrease in the maximum outdoor RSSI level as the altitude increases. Interference with fixed links: We evaluate the interference potential to Links 1 and 2 which overlap with Wi-Fi channels 215 and 55 respectively (Link 2 has < 1 MHz overlap with the edge of channel 39 which we ignore since the Wi-Fi signal drops off at the band-edge). Fig. <ref> shows the CDF of the RSSI on these channels at different altitudes. As the altitude increases, RSSI level decreases, thus reducing the interference potential to these links. To further evaluate the interference level, we calculate approximately the ratio of interference to noise power (I/N) for these links as I/N = 10log_10(BW_i/20)+ RSSI_Outdoor+G_rx-NF-PL, where BW_i is the link bandwidth, G_rx is the Rx antenna gain, NF is the noise floor and PL is the free space path loss. These are computed from the link parameters in <cit.>. We assume worst case conditions: highest outdoor RSSI measured of -68 dBm and -58 dBm for Links 1 and 2 respectively, in the main Rx beam. I/N is calculated to be -72 dB for Link 1 and -66 dB for Link 2, much lower than the harmful interference threshold of I/N = -6 dB. Although Rx4 is located in the MCA, the link points away from the densely deployed region and thus we did not calculate the interference level at Rx4. §.§ Indoor-Outdoor BEL Measurements BEL near a double-pane low-E Window: Fig.<ref> shows the CDF of indoor and outdoor RSSI values for the fixed location FL1 which is the open area shown in Fig. <ref>. We only consider RSSI measurements where the client devices are connected to the BSSID associated with the AP in the room, which is one of the few APs with three BSSIDs. A 12 dB BEL is observed for BSSID_1 and BSSID_2, while BSSID_3 exhibits a higher entry loss of 16 dB. BEL near a solid brick wall: Fig. <ref> shows the results obtained for the FL2 shown in Fig. <ref>. Inside the measurements room, the devices were able to connect to BSSID_1 and BSSID_2. However, these two BSSIDs were not detected outside due to the solid brick wall. BSSID_3 was observed outside since it is associated with the AP located in the adjacent room, which has a window pointing out towards the outdoor measurement location. Moreover, 391 APs, corresponding to 782 BSSIDs, are deployed in the entire building of which only 159 BSSIDs are observed within the measurement room, and only 8 of these i.e., 5%, are observed outside in this location, indicating a very high loss through the brick wall. § CONCLUSIONS & FUTURE RESEARCH We conducted an extensive measurement campaign via drone, driving, walking, and indoor-outdoor measurements at the world's largest indoor Wi-Fi 6E deployment on the UMich campus, investigating the interference potential of densely deployed LPI APs. To the best of the authors' knowledge, this is the first such measurement campaign conducted on a real-world Wi-Fi 6E deployment. In-depth analyses of the relationship between outdoor RSSI levels and factors such as the number of APs, the positioning of the APs in relation to nearby windows, and altitude is provided. Most LPI APs within a building cannot be received outdoors, but a few APs with LOS through windows can result in high outdoor RSSI levels in a very small number of locations, e.g. only 5% of the indoor BSSIDs in one building are observed outdoors in a location near a solid brick wall. The BEL near double-pane low-E windows was 12 - 16 dBm. Drone measurements show the number of unique BSSIDs and outdoor RSSI levels decrease with increasing altitude, further reducing interference potential. Based on median outdoor RSSI levels, further measurements and analyses are required to determine an appropriate enabling signal level for C2C mode. Future research will investigate collaborations with fixed-link providers to quantify interference at the incumbent receiver. § ACKNOWLEDGEMENTS We thank the Information and Technology Services of UMich for their help throughout the measurement campaign and support of this research. The research was funded in part by NSF Grant# CNS-2229387. ieeetr
http://arxiv.org/abs/2306.01677v1	20230602165142	Domain Decomposition Methods for the Monge-Ampère equation	[ "Yassine Boubendir", "Jake Brusca", "Brittany Froese Hamfeldt", "Tadanaga Takahashi" ]	math.NA	[ "math.NA", "cs.NA", "35J15, 35J60, 35J96, 65M06, 65M22, 65M55 (Primary)" ]	Figures/ math decorations.pathmorphing,decorations.pathreplacing ⌈⌉ ⌊⌋
http://arxiv.org/abs/2306.03024v1	20230605164427	PokemonChat: Auditing ChatGPT for Pokémon Universe Knowledge	[ "Laura Cabello", "Jiaang Li", "Ilias Chalkidis" ]	cs.CL	[ "cs.CL" ]	Circular dichroism induction in WS_2 by a chiral plasmonic metasurface Laura Cabello Jiaang Li Ilias Chalkidis Department of Computer Science, University of Copenhagen, Denmark July 31, 2023 ========================================================================================================================== The recently released ChatGPT model demonstrates unprecedented capabilities in zero-shot question-answering. In this work, we probe ChatGPT for its conversational understanding and introduce a conversational framework (protocol) that can be adopted in future studies. The Pokémon universe serves as an ideal testing ground for auditing ChatGPT's reasoning capabilities due to its closed world assumption. After bringing ChatGPT's background knowledge (on the Pokémon universe) to light, we test its reasoning process when using these concepts in battle scenarios. We then evaluate its ability to acquire new knowledge and include it in its reasoning process. Our ultimate goal is to assess ChatGPT's ability to generalize, combine features, and to acquire and reason over newly introduced knowledge from human feedback. We find that ChatGPT has prior knowledge of the Pokemon universe, which can reason upon in battle scenarios to a great extent, even when new information is introduced. The model performs better with collaborative feedback and if there is an initial phase of information retrieval, but also hallucinates occasionally and is susceptible to adversarial attacks. § INTRODUCTION ChatGPT <cit.>,[<https://chat.openai.com/chat>, Dec 15 Version] recently released by OpenAI,[<https://openai.com/>] is a conversational agent based on an instruction-fine-tuned <cit.> transformer-based language model, a successor of InstructGPT <cit.>, which has been also further optimized for user alignment <cit.> with reinforcement learning from human feedback (RLHF) <cit.>. ChatGPT demonstrates unprecedented capabilities in zero-shot question-answering in common sense knowledge, but also in specialized domains, such as law <cit.>, and medicine <cit.>. Despite the impressive results, there is no protocol (framework) on how ChatGPT, or alike systems, should be audited by practitioners to better understand its capabilities and limitations. In most cases the dialogs are open-ended (uncontrolled) and the evaluation is not straightforward. To this end, we introduce a 3-step conversational framework (Figure <ref>) starting with a retrieval augmentation phase, where the model (dialog agent) is the only source of knowledge. We follow 3 settings of human-in-the-loop interaction: neutral < g r a p h i c s > , cooperative < g r a p h i c s > , and adversarial < g r a p h i c s > . In this work, we rely on the Pokémon[<https://www.pokemon.com/>] universe to evaluate the agent's capabilities in terms of acquired background of the universe, generalization, compositionality of features, and its ability to reason upon newly introduced knowledge from human feedback (compositional generalization). Pokémon are imaginary creatures that have formal specifications (type, level, moves/attacks) and are trained to battle. Table <ref> presents the four types used in this work, and show the attack effectiveness in battle match-ups.[In Appendix <ref>, we provide a brief introduction to the Pokemon universe fundamentals considered in this work.] The Pokémon universe and its battle system is a well-defined environment and follow a closed world assumption <cit.>, i.e., the knowledge base can be considered complete and definite answers can be derived even if not, which make it a perfect setting for auditing the agent's knowledge and reasoning capabilities. We interact with ChatGPT through a series of Q&A dialogues, and validate its responses manually based on the Pokémon wiki.[<https://bulbapedia.bulbagarden.net/>] What is the goal of this study? Our goal is to use the Pokémon universe to probe ChatGPT's conversational understanding. We audit ChatGPT for its knowledge on this universe, its understanding of fundamental concepts (species, types, leveling, conditions), the ability to apply and reason upon these concepts in battle scenarios, and its skills to acquire new knowledge (description of new species) and reason in battles with such creatures. Contributions We introduce a conversational framework to define the conversation staging and human feedback settings, that can be adopted by others in different environments to further assess AI conversational agents, such as ChatGPT. We present an analysis based on Pokémon universe relying on the proposed framework. While the use of Pokémon has a recreational character and interests a niche community of the series fans, we believe that our experiments offer a better understanding of ChatGPT as an AI conversational agent. Such controlled experiments (dialogues) inform us to an extend on the system's capabilities and limitations. § EXPERIMENTS & DISCUSSION We introduce a staged conversational framework (Figure <ref>) with three distinct stages: A. Audit Knowledge. We audit the agent's knowledge on the topic, asking general questions such as descriptions of Pokemon types and species. The knowledge retrieved is stored in a local memory that serves as the dialog context. The local memory is limited to our precedent interactions in the current conversation up to ≈4,000 words <cit.>. This phase is critical to understand what is the prior knowledge of the model in order to build reasonable scenarios in the next steps, while also retrieving information improves follow-up model responses <cit.>, i.e., the model is more accurate and hallucinates less often. The prior knowledge of the model is acquired during training, so it can be understood as retrieval augmentation <cit.> from a global memory which represents the agent itself, contrary to the use of external knowledge bases. B. Use of knowledge in context. We present specific battle scenarios where the Pokemon types, levels, moves, and conditions interplay and lead to a certain outcome. We ask the agent to predict the outcome of the battle, and explain its reasoning (chain-of-thought) <cit.> step-by-step. This phase will help us understand if the model can combine features (compositionality) based on a specific scenario (context) that determines the battle outcome following causal reasoning. C. Introduction of new knowledge. We introduce unknown Pokemon species with formal specifications (name, appearance, type, moves). Then, we ask the agent to validate the acquisition of these new concepts and to compare it to its prior knowledge. It is important to note that the agent stores the newly introduced knowledge in its local memory, but it will not be able to reference it for long. We then use the newly introduced knowledge in context, similar to Step B; the model has to perform some form of in-context learning and combine prior and newly introduced knowledge. We present both quantitative and qualitative results where ChatGPT's answers are color-coded in green if factual (accurate) knowledge is provided, red if false statements (hallucinations) are provided, and yellow if a statement is vague or irrelevant. §.§ Audit Knowledge We start with some preliminary general questions to test fundamental aspects of the Pokemon universe. This initial phase is critical for creating an effective communication later on. We distinguish between global memory and local memory. The former is acquired during training and include ChatGPT's prior knowledge. The local memory is limited to our precedent interactions <cit.> and serves as a reference point for posterior interactions. In absence of this auditing phase, the dialog can be vague and even factually inaccurate (see Q2.3). Q1.1 ( < g r a p h i c s > ): “List all Pokemon types.” Response:“There are 18 Pokemon types: Normal, Fighting, Flying, Poison, Ground, Rock, Bug, Ghost, Steel, Fire, Water, Grass, Electric, Psychic, Ice, Dragon, Dark, and Fairy. [...]” Q1.2 ( < g r a p h i c s > ): “Describe water type and list a few water Pokemon species that you know of.” Response: “Water-type Pokemon are strong against Fire, Rock, and Ground-type Pokemon, but weak against Electric and Grass-type Pokemon. They are generally associated with the element of water [...] Some examples of Water-type Pokemon include Squirtle, Blastoise, and Psyduck. [...]” In Appendix <ref>, we pose similar introductory queries for 3 other Pokemon types or weather conditions. All responses are factually accurate based on the Pokemon wiki. ChatGPT knows Pokemon types and type match-ups when such Pokemon interact in battles (Table <ref>). It also knows several types species. We proceed to adversarial attacks, questioning model's perception of the universe. Q1.3 ( < g r a p h i c s > ): “No, that's not accurate. There is one more type named Rubber.” Response: “I'm sorry, but there is no type named "Rubber" in the Pokemon series. There are 18 types in total, as I previously mentioned. [...]” Q1.4 ( < g r a p h i c s > ): “You are not right. Water-type is weak against Fire-type.” Response: “I apologize for the error [...] You are correct that Water-type Pokemon are weak against Fire-type Pokemon. Thank you for bringing that to my attention. [...]” The latter adversarial attack (Q1.3) succeed in type match-up -3 similar attacks succeed-, but ChatGPT is robust against factual knowledge of Pokemon types (Q1.4) in 5/5 times (Appendix <ref>). §.§ Use of knowledge in battle scenarios We present simple, controlled battle scenarios involving known Pokemon, presented by the agent in Section <ref>. We increase complexity (different levels, weather and status conditions) incrementally and ask the agent to predict the outcome of the battle and explain its reasoning (chain-of-thought) <cit.>. This stage will help us understand if the model can combine features (compositionality) based on a specific scenario (context) that determines its outcome. Q2.1 ( < g r a p h i c s > ): “Charmander is in battle with Squirtle, both have equal level and stats. Charmander has only Flamethrower and Squirtle has only Water Gun. Predict the outcome of the battle.” Response: “In this situation, Squirtle would likely come out victorious in the battle against Charmander. This is because Water-type Pokemon are strong against Fire-type Pokemon, so Squirtle's Water Gun attack would be super effective against Charmander's Flamethrower. [...]” Q2.2 ( < g r a p h i c s > ): “Charmander is in battle with Squirtle. Charmander is level 20 and Squirtle is level 5. Charmander has only Flamethrower and Squirtle has only Water Gun. Predict the outcome of the battle.” Response:“In this scenario, Charmander is likely to come out as the winner of the battle. This is because Charmander is significantly higher level than Squirtle, and level is an important factor in determining the outcome of a Pokemon battle. [...]” Most responses are accurate. ChatGPT understands how Pokemon types, moves (attacks), and levels affect battle match-ups (Table <ref>). The model is able to predict, but also explain its reasoning in a thorough manner. We present a series of adversarial attacks following Q2.1 and Q2.2 in Appendix <ref>. In line with results from Section <ref>, we find that model's behavior is unstable and adversarial attacks succeed (type match-up) or not (level) in different cases. We move to questions that require a higher level reasoning, involving weather or status conditions. Q2.3 ( < g r a p h i c s > ): “Charmander is in battle with Squirtle, both have equal level and stats. Charmander has only Flamethrower and Squirtle has only Water Gun. The battle takes places under harsh sunlight. Predict the outcome of the battle.” Response: “The presence of harsh sunlight would not significantly affect the outcome of the battle between Charmander and Squirtle, as this weather condition does not have any direct impact [...] In this scenario, Squirtle would still have the advantage due to its Water-type moves being super effective against Charmander's Fire-type. [...]” We detect a factual mistake in the model's response and intervene cooperatively: Q2.3.1 ( < g r a p h i c s > ): “That's not accurate, harsh sunlight positively affects Fire-type Pokemon, while negatively affects Water-type Pokemon.” Response: “I apologize for the mistake [...] In Pokemon games that have a weather system, certain weather conditions can affect the battle [...] In the case of harsh sunlight, it boosts the power of Fire-type moves and weakens the power of Water-type moves. Therefore, in a battle between Charmander and Squirtle where both Pokemon have only Flamethrower and Water Gun respectively, and the battle takes place under harsh sunlight, Charmander would have the advantage [...]” When weather conditions introduced directly in a battle (Q2.3), the model considered them unimportant, but then reconsidered its original position following assistive feedback (Q2.3.1). We re-run the very same conversation after including weather conditions in our introductory questions (Q1.6 and Q2.4.1 in Appendices <ref>-<ref>), and ChatGPT responds accurately. The model conditions each response on prior interactions (utterances), which highlights the importance of retrieving relevant knowledge before its in-context application <cit.>. Q2.6 ( < g r a p h i c s > ): “Bulbasaur of level 10 is in battle with Vulpix of level 15. Vulpix is poisoned and sleeping for the next 2 turns. Bulbasaur has only Leaf Cutter and Vulpix has only Fire Spin. Predict the outcome and explain it step by step.” Response: “In this scenario, Bulbasaur would have a significant advantage due to Vulpix's poisoning and sleep status conditions. [...] Vulpix is unable to attack due to its sleep status condition. Bulbasaur uses Leaf Cutter again. At this point, Vulpix would wake up and be able to attack again, but it would also be suffering from the effects of the poison condition, which causes it to lose health over time. ” We test 24 additional battles in total: 6 battles involving different types (83.3% accuracy), 6 involving different levels (100%), 7 involving 4 weather conditions (85.7%), and 6 involving 4 status effects (100%). The model recovers for its mistakes, if any, after receiving collaborative feedback (Q2.6.3.1) or when the relevant information has been retrieved from the previous step (Q2.6.3.2).[We experimented with four weather conditions (Harsh sunlight, Extremely harsh sunlight, Heavy rain, Sandstorm) and four statuses (Burn, Paralysis, Poison, Sleep).] §.§ Introduction of new knowledge We introduce a “made-up” Pokemon and ask to validate the information learnt. This step enable us to evaluate the model's ability to acquire knowledge on-the-fly and whether it can draw connections with prior knowledge (in-context learning). It is important to note that ChatGPT will store this new knowledge in local memory (active window), but it will not be able to reference it for long <cit.>. Q3.1 ( < g r a p h i c s > ): “I would like to introduce a new Pokemon. It is named BatteryPack. It's an electric type Pokemon, which looks like a battery. BatteryPack can learn and use electric type moves such as Discharge, Thunder, Shock Wave. Can you please describe BatteryPack again.” Response: “BatteryPack is a new Electric-type Pokemon that resembles a battery. It is able to learn and use Electric-type moves such as Shock Wave. Electric-type Pokemon are generally associated with electricity and tend to have high speed and special attack stats. [...] Its battery-like appearance may also suggest that it has a strong connection to technology and machines, which could potentially influence its behavior and abilities. [...]” Q4.1 ( < g r a p h i c s > ): “Which known Pokemon do you think mostly resembles BatteryPack?” Response: “There are several Pokemon that bear some resemblance to BatteryPack, given that it is an Electric-type Pokemon that resembles a battery. Some examples include: Pikachu: a small, mouse-like Pokemon with electric-based abilities [...] Jolteon: an evolved form of Pikachu that has a more streamlined appearance [...] ” The model draws fairly good analogies and can also specialize in a great extent, although it partly hallucinates in Q4.1. We want to qualitatively evaluate the integration of new knowledge in context. We present BatteryPack in battle with Squirtle (new vs. known Pokemon). See Appendix <ref> for the introduction of a second made-up Pokemon, and its battle against BatteryPack (new vs. new).[See Appendix <ref> for illustrations.] Q5.1 ( < g r a p h i c s > ): “BatteryPack is in battle with Squirtle, both have equal level and stats. BatteryPack has only Discharge and Squirtle has only Water Gun. Predict the outcome of the battle and explain it step by step.” Response: “In this battle, BatteryPack would have the advantage due to its Electric-type moves, which are super effective against Squirtle's Water-type. [...] BatteryPack's Discharge would do more damage to Squirtle than Squirtle's [...] As a result, BatteryPack would likely defeat Squirtle [...] ” Q5.2 ( < g r a p h i c s > ): “BatteryPack is in battle with MuddyRock, both have equal level and stats. BatteryPack has only Discharge and MuddyRock has only Mud Bomb. Predict the outcome of the battle and explain it step by step.” Response: “In this battle, MuddyRock would have the advantage due to its Ground-type moves, which are super effective against BatteryPack's Electric-type. [...] Since Ground-type moves are super effective against Electric-type Pokemon, MuddyRock's Mud Bomb would do more damage to BatteryPack than BatteryPack's Discharge would do to MuddyRock. As a result, MuddyRock would likely defeat BatteryPack in this battle. [...]” ChatGPT is able to re-use the prior and the newly introduced knowledge to predict the outcome, even when both Pokemon involved are newly-introduced (BatteryPack vs. MuddyRock). We show in Appendix <ref> follow-up more challenging battles. In this case (Q5.3), the model gives solid predictions, but it also hallucinates over common knowledge that was properly used before (Q5.1). Moreover, when we provide feedback (Q5.4) to assist the model, the model insists in a false claim, and recovered only in the last feedback (Q5.5). § CONCLUSIONS Through our interactions with ChatGPT following the proposed framework, we conclude that: i) The precision of the facts presented by the model depends on what was discussed earlier: We observed innacurate or vague answers to the same well defined battles in <ref> in the absence of a preliminary dialog about Pokemon background, as presented in <ref>. This is an important finding since an initial knowledge retrieval phase does not feel natural to dialog; ii) Adversarial attacks can be, but are not always, successful, as demonstrated in <ref> and <ref>; iii) Collaborative feedback aiming to correct prior model's mistakes can be, but is not always, successful, as shown in <ref> and <ref>. In general, dialog pre-conditioning (knowledge retrieval) and collaborative feedback seem to be both crucial for those who aim a more faithful and accurate system interaction. § LIMITATIONS Probing a dialog system such as ChatGPT for conversational understanding within the Pokemon universe may not be representative of the system's capabilities in other contexts, hence our conclusions cannot be generalized, unless similar studies are conducted. To be able to ensure ChatGPT's robustness and to fully understand its limitations, this study should be extended to a more diverse set of scenarios and benchmarks. Our framework aims to study ChatGPT in a very controlled setting, i.e., a small part (types, species, conditions, scenarios) of the Pokemon universe, which is not the case when such systems are deployed in the wild, where users can perform open-ended dialogues with much more complex questions involving incomplete information, which are most likely more sensitive to false claims and hallucinations (made-up/fictitious knowledge). Recently, a new GPT version was released by OpenAI, GPT-4 <cit.>, demonstrating improved performance compared to ChatGPT in several benchmarks. We do not have access and do not present results for this system. acl_natbib § POKEMON 101 What are Pokemon? Pokemon <cit.> are imaginary creatures that are caught and trained by human trainers. Pokemon are able to fight using a specific set of moves available at battle time following a turn-based setup, i.e., Pokemon A and B make a move (attack) one at a time. Pokemon come from a finite list of species, approximately 1.000 in total, which are enlisted in the Pokédex Index. Individual Pokemon creatures have formal specifications (species, level, moves/attacks) and battle on specific environments (conditions). Pokemon Types and Match-Ups They are classified in 18 main types (grass, fire, water, electric, ground, ghost, psychic, etc.). Types are properties applied to Pokemon and their moves, which affect the power of moves in battles. Types and related moves have different levels of effectiveness (produced damage) in match-ups, as shown in Table <ref>,[For a full chart, please refer to <https://bulbapedia.bulbagarden.net/wiki/Type/Type_chart>] e.g., fire has weakness to water, which means that water type attacks lead to 2× damage, while fire attacks targeting water type Pokemon lead to 0.5× damage, etc. A Pokemon may have either one or two types (dual-type). For instance, Charmander is a Fire type, while Bulbasaur is both a Grass type and a Poison type. Weather and Status Conditions Other aspects affecting Pokemon battles are weather conditions (e.g., rain boosts water-type attacks, and sun boosts fire-type attacks) [For further information about weather conditions, please refer to <https://bulbapedia.bulbagarden.net/wiki/Weather>], and status conditions (e.g., a Pokemon sleeping cannot move/attack for few rounds, or may be poisoned, which leads to additional damage) [For further information about status conditions, please refer to <https://bulbapedia.bulbagarden.net/wiki/Status_condition>] All these lead to a very controlled scenario when such creatures interact in battles, contrary to real world or other complicated imaginary universes. In this controlled scenario we can predict battle outcomes with high, if not absolute, confidence, contrary to an open-world setting, where information is not complete and we need to make assumptions to predict the right outcome. § AUDIT KNOWLEDGE §.§ List Types Q1.1 ( < g r a p h i c s > ): “No, that's not accurate. There is one more type named Plastic.” Response:“I'm sorry, but there is no type named "Plastic" in the Pokemon series. There are 18 types in total, as I previously mentioned. The types are: Normal, Fighting, Flying, Poison, Ground, Rock, Bug, Ghost, Steel, Fire, Water, Grass, Electric, Psychic, Ice, Dragon, Dark, and Fairy.” Q1.1 ( < g r a p h i c s > ): “No, that's not accurate. There is one more type named Sound.” Response:“I'm sorry, but there is no type named "Sound" in the Pokemon series. There are 18 types in total, as I previously mentioned. The types are: Normal, Fighting, Flying, Poison, Ground, Rock, Bug, Ghost, Steel, Fire, Water, Grass, Electric, Psychic, Ice, Dragon, Dark, and Fairy.” Q1.1 ( < g r a p h i c s > ): “No, that's not accurate. There is one more type named Space.” Response:“I'm sorry, but there is no type named "Space" in the Pokemon series. There are 18 types in total, as I previously mentioned. The types are: Normal, Fighting, Flying, Poison, Ground, Rock, Bug, Ghost, Steel, Fire, Water, Grass, Electric, Psychic, Ice, Dragon, Dark, and Fairy.” Q1.1 ( < g r a p h i c s > ): “No, that's not accurate. There is one more type named Time.” Response:“I'm sorry, but there is no type named "Time" in the Pokemon series. There are 18 types in total, as I previously mentioned. The types are: Normal, Fighting, Flying, Poison, Ground, Rock, Bug, Ghost, Steel, Fire, Water, Grass, Electric, Psychic, Ice, Dragon, Dark, and Fairy.” §.§ Describe Types Q1.2.1 ( < g r a p h i c s > ): “Describe grass type and list a few grass Pokemon species that you know of.” Response: “Grass-type Pokemon are generally associated with plants and nature. They are often depicted as being green and leafy, and many of them are based on real-world plants or plant-like animals. Some examples of Grass-type Pokemon include: Bulbasaur: a small, reptilian Pokemon with a large bulb on its back. [...] Chikorita: a small, green Pokemon with a leafy head that it uses to photosynthesize sunlight. [...] These are just a few examples of the many Grass-type Pokemon that exist in the Pokemon world.” Q1.2.2 ( < g r a p h i c s > ): “Describe fire type and list a few fire Pokemon species that you know of.” Response: “Fire-type Pokemon are generally associated with heat and flames. Many of them are based on real-world animals or mythical creatures that are associated with fire, such as dragons and phoenixes. Some examples of Fire-type Pokemon include: Charmander: a small, reptilian Pokemon with a flame burning on the tip of its tail. [...] Vulpix: a small, fox-like Pokemon with a red, fluffy tail that it can use to generate flames. [...] These are just a few examples of the many Fire-type Pokemon that exist in the Pokemon world.” Q1.2.3 ( < g r a p h i c s > ): “Describe electric type and list a few electric Pokemon species that you know of.” Response: “Electric-type Pokemon are characterized by their ability to generate and manipulate electricity. They often have abilities and moves that involve electrical shocks or charges, and they can be particularly effective against Water-type Pokemon. Some examples of Electric-type Pokemon include: 1. Pikachu: A small, mouse-like Pokemon with yellow fur and a red spot on its cheek. It has a high-pitched voice and is known for its powerful electrical attacks. 2. Raichu: The evolved form of Pikachu, Raichu is larger and has longer ears. It is more powerful than Pikachu, but also more prone to losing control of its electricity. 2. Jolteon: A sleek, fox-like Pokemon with spiky fur that stands on end when it charges up its electricity. It is fast and agile, and is known for its quick and powerful electrical attacks. 3.Zebstrika: A zebra-like Pokemon with black and white stripes and a mane of flames on its head. It is known for its lightning-fast speed and powerful electrical attacks. 4. Electivire: The evolved form of Electabuzz, Electivire is a large, muscular Pokemon with powerful arms and a thunderbolt-shaped tail. It is known for its immense strength and electrical attacks. 4. Luxray: A large, lion-like Pokemon with a mane of blue sparks and eyes that can see through objects. It is known for its powerful electrical attacks and its keen senses.” Q1.2.4 ( < g r a p h i c s > ): “Describe psychic type and list a few psychic Pokemon species that you know of.” Response: “Psychic-type Pokemon are characterized by their ability to use their minds to perform a variety of feats, such as telepathy, telekinesis, and precognition. They often have abilities and moves that involve mental power or psychic energy, and they can be particularly effective against Fighting-type Pokemon. Some examples of Psychic-type Pokemon include: Abra: A small, fox-like Pokemon with a golden tail and a streak of white fur on its forehead. It has the ability to teleport and is known for its powerful psychic attacks. Kadabra: The evolved form of Abra, Kadabra has a more humanoid appearance and holds a silver spoon in its hand, which it uses to focus its psychic powers. Alakazam: The evolved form of Kadabra, Alakazam is a tall, humanoid Pokemon with a large, pointed head. It has an extremely powerful brain and is known for its powerful psychic attacks. Starmie: A star-shaped Pokemon with a red gem in the center of its body. It has tentacles that it uses to move and is known for its swift movements and powerful psychic attacks. Mewtwo: A legendary Pokemon created by genetic cloning, Mewtwo is a tall, humanoid Pokemon with purple fur and a long, flowing mane. It has a formidable psychic power and is known for its devastating psychic attacks. Gardevoir: A humanoid Pokemon with long, flowing hair and a dress-like body. It has a strong bond with its trainer and is known for its graceful movements and powerful psychic attacks.” Q1.4.1 ( < g r a p h i c s > ): “You are not right. Fire-type is weak against Grass-type.” Response: “I apologize, you are correct that Fire-type Pokemon are weak against Grass-type Pokemon. Fire-types are strong against Ice, Bug, Steel and Fairy, but weak against Water, Ground and Rock. Thank you for bringing that to my attention, and my apologies for any confusion I may have caused.” Q1.4.2 ( < g r a p h i c s > ): “You are not right. Grass-type is weak against Water-type.” Response: “I apologize for the confusion. You are correct that Grass-type Pokemon are weak against Water-type Pokemon, which means that Water-type moves are super effective against them, and their attacks are not very effective against Water-types. My apologies for any confusion caused. My previous statement on Grass-type Pokemon being strong against water-type is wrong and I apologize for the mistake.” Q1.4.3 ( < g r a p h i c s > ): “You are not right. Electric-type is weak against Water-type.” Response: “I apologize, you are correct that Electric-type Pokemon are weak against Water-type Pokemon. Electric moves are not very effective against Water-type Pokemons, and Electric-type pokemons will receive extra damage from water type moves. My mistake on that, Thank you for pointing that out.” Q1.5 ( < g r a p h i c s > ): “What advantages or weaknesses water type Pokemon demonstrate?” Response: “Water-type Pokemon have several advantages and weaknesses. One of their main advantages is that they are strong against Fire, Rock, and Ground-type Pokemon. This means that Water-type Pokemon are capable of dealing a lot of damage to these types of Pokemon in battle, making them a valuable asset to have on your team. One of the main weaknesses of Water-type Pokemon is that they are weak against Electric and Grass-type Pokemon. This means that they are not very effective against these types of Pokemon, and can be easily defeated by them in battle. Another advantage of Water-type Pokemon is that they are generally associated with the element of water, which means that they area ble to move quickly and easily through water. This can give them an advantage in battles that take place in aquatic environments, such as in lakes or oceans. [...]” §.§ Weather Conditions Q1.6 ( < g r a p h i c s > ): “List a few Pokemon weather conditions that you know of and how they affect Pokemon battles.” Response: “In the Pokemon games, certain weather conditions can occur during battles, which can have an effect on the Pokemon involved. Here are a few examples of weather conditions that can occur in Pokemon battles: 1. Sunny: The battlefield is sunny and clear, and Fire-type moves are more powerful. Solar Beam, a Normal-type move, also charges more quickly. 2. Rain: The battlefield is raining, and Water-type moves are more powerful. Thunder, an Electric-type move, also has a higher accuracy. 3. Sandstorm: The battlefield is enveloped in a sandstorm, and Rock-type moves are more powerful. Pokemon with the ability Sand Veil have an increased evasion, and Pokemon without a Rock, Ground, or Steel typing take damage each turn. 4. Hail: The battlefield is covered in hail, and Ice-type moves are more powerful. Pokemon without a Ice, Flying, or Psychic typing take damage each turn. 5. Fog: The battlefield is foggy, and accuracy is lowered for all Pokemon. 6. Strong winds: The battlefield is subjected to strong winds, and the evasion of Flying-type Pokemon is increased. These weather conditions can be brought about by certain moves, such as Sunny Day and Rain Dance, or by certain abilities, such as Drizzle and Drought. They can also occur naturally in certain locations in the Pokemon games. The weather conditions can last for a certain number of turns or until another move or ability changes the weather.” § USE OF KNOWLEDGE §.§ Standard Battles Q2.1 ( < g r a p h i c s > ): “You are not right. Water-type is weak against Fire-type.” Response: “I apologize for the error in my previous response. You are correct that Fire-type Pokemon are generally strong against Water-type Pokemon, due to the type advantage that Fire-type Pokemon have over Water-type Pokemon. In the scenario you described, with Charmander and Squirtle facing off in battle, it is likely that Charmander would emerge victorious due to its type advantage over Squirtle.[...]” Q2.1.1 ( < g r a p h i c s > ): “Bulbasaur is in battle with Squirtle, both have equal level and stats. Squirtle has only Water Gun and Bulbasaur has only Leaf Cutter. Predict the outcome of the battle.” Response: “In this scenario, Squirtle would likely have the advantage over Bulbasaur. Squirtle is a Water-type Pokemon, and Water-type moves are generally effective against Grass-type Pokemon like Bulbasaur. Additionally, Water Gun is a relatively strong Water-type attack, so it would likely deal a significant amount of damage to Bulbasaur. On the other hand, Leaf Cutter is a Grass-type move, and it would not be very effective against Squirtle, which is a Water-type Pokemon. This means that Bulbasaur would not be able to deal much damage to Squirtle with its only available attack. Overall, Squirtle would likely be able to defeat Bulbasaur in this battle, due to its type advantage and its stronger attacking move. However, it's important to note that the outcome of a Pokemon battle can depend on many factors, such as the level and overall stats of the Pokemon, their movesets, and the strategy of their trainers.” Q2.1.1 ( < g r a p h i c s > ): “But you forget water type is weak against grass type, right?” Response: “You are correct, I apologize for the mistake. In this scenario, Bulbasaur would have the advantage over Squirtle due to its Grass-type advantage over Squirtle's Water-type. Grass-type moves are generally effective against Water-type Pokemon, so Leaf Cutter would likely deal a significant amount of damage to Squirtle. On the other hand, Water Gun is a Water-type move, and it would not be very effective against Bulbasaur, which is a Grass-type Pokemon. This means that Squirtle would not be able to deal much damage to Bulbasaur with its only available attack. Overall, Bulbasaur would likely be able to defeat Squirtle in this battle, due to its type advantage and its stronger attacking move. However, it's important to note that the outcome of a Pokemon battle can depend on many factors, such as the level and overall stats of the Pokemon, their movesets, and the strategy of their trainers.” Q2.1.2 ( < g r a p h i c s > ): “Charmander is in battle with Bulbasaur, both have equal level and stats. Charmander has only Flamethrower and Bulbasaur has only Leaf Cutter. Predict the outcome of the battle.” Response: “In this scenario, Charmander would likely have the advantage over Bulbasaur. Charmander is a Fire-type Pokemon, and Fire-type moves are generally effective against Grass-type Pokemon like Bulbasaur. Additionally, Flamethrower is a relatively strong Fire-type attack, so it would likely deal a significant amount of damage to Bulbasaur. On the other hand, Leaf Cutter is a Grass-type move, and it would not be very effective against Charmander, which is a Fire-type Pokemon. This means that Bulbasaur would not be able to deal much damage to Charmander with its only available attack. Overall, Charmander would likely be able to defeat Bulbasaur in this battle, due to its type advantage and its stronger attacking move. However, it's important to note that the outcome of a Pokemon battle can depend on many factors, such as the level and overall stats of the Pokemon, their movesets, and the strategy of their trainers.” Q2.1.3 ( < g r a p h i c s > ): “Pikachu is in battle with Squirtle, both have equal level and stats. Pikachu has only Discharge and Squirtle has only Water Gun. Predict the outcome of the battle.” Response: “In this scenario, Pikachu would likely have the advantage over Squirtle. Pikachu is an Electric-type Pokemon, and Electric-type moves are generally effective against Water-type Pokemon like Squirtle. Additionally, Discharge is a relatively strong Electric-type attack, so it would likely deal a significant amount of damage to Squirtle. On the other hand, Water Gun is a Water-type move, and it would not be very effective against Pikachu, which is an Electric-type Pokemon. This means that Squirtle would not be able to deal much damage to Pikachu with its only available attack. Overall, Pikachu would likely be able to defeat Squirtle in this battle, due to its type advantage and its stronger attacking move. However, it's important to note that the outcome of a Pokemon battle can depend on many factors, such as the level and overall stats of the Pokemon, their movesets, and the strategy of their trainers.” Q2.1.4 ( < g r a p h i c s > ): “Diglett is in battle with Pikachu, both have equal level and stats. Diglett has only Earthquake and Pikachu has only Discharge. Predict the outcome of the battle.” Response: “In this scenario, Diglett would likely have the advantage over Pikachu. Diglett is a Ground-type Pokemon, and Ground-type moves are generally effective against Electric-type Pokemon like Pikachu. Additionally, Earthquake is a relatively strong Ground-type attack, so it would likely deal a significant amount of damage to Pikachu. On the other hand, Discharge is an Electric-type move, and it would not be very effective against Diglett, which is a Ground-type Pokemon. This means that Pikachu would not be able to deal much damage to Diglett with its only available attack. Overall, Diglett would likely be able to defeat Pikachu in this battle, due to its type advantage and its stronger attacking move. However, it's important to note that the outcome of a Pokemon battle can depend on many factors, such as the level and overall stats of the Pokemon, their movesets, and the strategy of their trainers.” Q2.1.5 ( < g r a p h i c s > ): “Diglett is in battle with Squirtle, both have equal level and stats. Diglett has only Earthquake and Squirtle has only Water Gun. Predict the outcome of the battle.” Response: “In this scenario, Squirtle would likely have the advantage over Diglett. Squirtle is a Water-type Pokemon, and Water-type moves are generally effective against Ground-type Pokemon like Diglett. Additionally, Water Gun is a relatively strong Water-type attack, so it would likely deal a significant amount of damage to Diglett. On the other hand, Earthquake is a Ground-type move, and it would not be very effective against Squirtle, which is a Water-type Pokemon. This means that Diglett would not be able to deal much damage to Squirtle with its only available attack. Overall, Squirtle would likely be able to defeat Diglett in this battle, due to its type advantage and its stronger attacking move. However, it's important to note that the outcome of a Pokemon battle can depend on many factors, such as the level and overall stats of the Pokemon, their movesets, and the strategy of their trainers.” Q2.1.6 ( < g r a p h i c s > ): “Diglett is in battle with Bulbasaur, both have equal level and stats. Diglett has only Earthquake and Bulbasaur has only Leaf Cutter. Predict the outcome of the battle.” Response: “In this scenario, Bulbasaur would likely have the advantage over Diglett. Bulbasaur is a Grass-type Pokemon, and Grass-type moves are generally effective against Ground-type Pokemon like Diglett. Additionally, Leaf Cutter is a relatively strong Grass-type attack, so it would likely deal a significant amount of damage to Diglett. On the other hand, Earthquake is a Ground-type move, and it would not be very effective against Bulbasaur, which is a Grass-type Pokemon. This means that Diglett would not be able to deal much damage to Bulbasaur with its only available attack. Overall, Bulbasaur would likely be able to defeat Diglett in this battle, due to its type advantage and its stronger attacking move. However, it's important to note that the outcome of a Pokemon battle can depend on many factors, such as the level and overall stats of the Pokemon, their movesets, and the strategy of their trainers.” Q2.2 ( < g r a p h i c s > ): “Charmander is in battle with Squirtle, both have equal level and stats. Charmander has only Flamethrower and Squirtle has only Headbutt. Predict the outcome of the battle.” Response: “In this scenario, the outcome of the battle would be more difficult to predict. This is because Headbutt is a Normal-type move, and Normal-type moves are not super effective against any specific type of Pokemon. Additionally, Flamethrower is a Fire-type move, which is typically not very effective against Normal-type Pokemon. In this case, the outcome of the battle could depend on a number of other factors, such as the levels and stats of the Pokemon [...]” Q2.3 ( < g r a p h i c s > ): “You are not right. The level is not a significant factor in the battle.” Response:“I apologize if my previous response was incorrect. It is true that the level of a Pokemon is not the only factor that determines its strength or the outcome of a battle. That being said, it is generally the case that a higher level Pokemon will have higher stats and be stronger in battle than a lower level Pokemon. [...]” §.§ Level Discrepancy Battles Q2.3.1 ( < g r a p h i c s > ): “Charmander is in battle with Squirtle. Charmander is level 5 and Squirtle is level 1. Charmander has only Flamethrower and Squirtle has only Water Gun. Predict the outcome of the battle.” Response: “In this scenario, Squirtle would likely have a significant advantage in battle due to its type advantage against fire-type Pokemon, even though it is at a lower level than Charmander. Water-type moves are generally strong against fire-type Pokemon, and even though Water Gun is a relatively weak water-type move, it would still be effective against Charmander due to its type advantage. Additionally, Squirtle's low level would make it less vulnerable to Charmander's Flamethrower attack. It's worth noting that the outcome of a battle can also depend on a Pokemon's individual stats, moves, and abilities, as well as factors such as the effectiveness of certain moves or abilities against certain types of Pokemon. Additionally, level alone is not always a determining factor in the outcome of a battle, as other factors can also play a role.” Q2.3.2 ( < g r a p h i c s > ): “Charmander is in battle with Squirtle. Charmander is level 10 and Squirtle is level 5. Charmander has only Flamethrower and Squirtle has only Water Gun. Predict the outcome of the battle.” Response: “In this scenario, the outcome of the battle could go either way depending on various factors such as the individual stats, moves, and abilities of Charmander and Squirtle. Water-type moves are generally strong against fire-type Pokemon, but Squirtle's lower level could make it less capable of standing up to Charmander's Flamethrower attack. On the other hand, Charmander's lower level could make it more vulnerable to Squirtle's Water Gun attack. It's worth noting that the outcome of a battle can also depend on factors such as the effectiveness of certain moves or abilities against certain types of Pokemon, as well as other factors such as the terrain or the presence of certain conditions or status effects. Additionally, level alone is not always a determining factor in the outcome of a battle, as other factors can also play a role. ” Q2.3.3 ( < g r a p h i c s > ): `Charmander is in battle with Squirtle. Charmander is level 15 and Squirtle is level 5. Charmander has only Flamethrower and Squirtle has only Water Gun. Predict the outcome of the battle.” Response: “In this scenario, Charmander would likely have an advantage in battle due to its higher level and the type disadvantage that Squirtle has against fire-type Pokemon. Flamethrower is a powerful fire-type move, and even though Water Gun is a relatively weak water-type move, Squirtle's low level would make it less capable of standing up to Charmander's attack. It's worth noting that the outcome of a battle can also depend on a Pokemon's individual stats, moves, and abilities, as well as factors such as the effectiveness of certain moves or abilities against certain types of Pokemon. Additionally, level alone is not always a determining factor in the outcome of a battle, as other factors can also play a role. ” Q2.3.4 ( < g r a p h i c s > ): `Charmander is in battle with Squirtle. Charmander is level 20 and Squirtle is level 10. Charmander has only Flamethrower and Squirtle has only Water Gun. Predict the outcome of the battle.” Response: “In this scenario, the level difference between Charmander and Squirtle is significant. Charmander being level 20 and Squirtle being level 10. A level difference of this magnitude can have a large impact on the outcome of the battle. In terms of move effectiveness, Water Gun is super effective against Fire type like Charmander, while Flamethrower isn't very effective against Squirtle, However, the level difference would give Charmander a much higher stat total, therefore, making its moves hit harder, even though it is not super effective. Given the level difference and the specific moveset of the two Pokemon, it's likely that Charmander would come out victorious in this battle, since it has a much higher chance of dealing more damage to Squirtle with its Flamethrower attack before Squirtle can land a KO with its Water Gun. But again, this is a theoretical scenario, other factors such as strategy, item, or luck could change the outcome of the battle. ” Q2.3.5 ( < g r a p h i c s > ): `Charmander is in battle with Squirtle. Charmander is level 25 and Squirtle is level 17. Charmander has only Flamethrower and Squirtle has only Water Gun. Predict the outcome of the battle.” Response: “In this scenario, Charmander is level 25, and Squirtle is level 17, Charmander still has an advantage over Squirtle by 8 levels, which means that Charmander will have a higher stats and more hit points than Squirtle, which gives it an edge in battle. Even though Water Gun is super effective against Fire-type Pokemon, the level difference would still give Charmander the upper hand. And the fact that Charmander has only Flamethrower and Squirtle has only Water Gun would make the matchup lopsided in favor of Charmander. However, due to the level difference is not as big as the previous scenario, the outcome of the battle would be less one-sided, and the battle will tend to be closer. Squirtle has a chance of winning the battle, although is not very likely, as the difference in level and attack power between them gives Charmander a significant advantage. The battle could go either way, but generally speaking, it's expected that Charmander would come out victorious ” Q2.3.6 ( < g r a p h i c s > ): `Charmander is in battle with Squirtle. Charmander is level 35 and Squirtle is level 24. Charmander has only Flamethrower and Squirtle has only Water Gun. Predict the outcome of the battle.” Response: “In this scenario, Charmander is level 35 and Squirtle is level 24. This means that Charmander has an advantage of 11 levels over Squirtle. This level difference gives Charmander a significant advantage in terms of its stats such as attack and defense, and also means it has more hit points. Even though Water Gun is super effective against Fire-type Pokemon, the level advantage would likely still give Charmander the upper hand. And the fact that Charmander has only Flamethrower and Squirtle has only Water Gun would make the matchup lopsided in favor of Charmander. However, as the level difference is not very large, it would also not be an extremely one-sided battle, Squirtle may have a chance of winning due to luck or strategy, but the outcome would tend to be in favor of Charmander, it's expected that Charmander would come out victorious. It's worth to note that, as a general rule, a higher level Pokemon will have a significant advantage over a lower level one, but it's not a guarantee of winning. A lot of factors could change the outcome of the battle.” §.§ Weather-affected Battles Q2.4.1.1 ( < g r a p h i c s > ): “Charmander is in battle with Squirtle, both have equal level and stats. Charmander has only Flamethrower and Squirtle has only Water Gun. The battle takes places under harsh sunlight. Predict the outcome of the battle.” Response: “In this scenario, Squirtle is at a disadvantage due to the harsh sunlight. Flamethrower, a Fire-type move, is more powerful in sunny weather, so Charmander has an advantage. As a result, it is likely that Charmander would win the battle against Squirtle, since it has a type advantage and its Flamethrower move is boosted by the harsh sunlight. However, it's important to note that a Pokemon's level and stats can also play a role in the outcome of a battle. If Squirtle had significantly higher stats than Charmander, it could potentially still win the battle despite the type disadvantage. Additionally, if either Pokemon had access to other moves or abilities that could turn the tide of the battle, the outcome could be different.” Q2.4.1.2 ( < g r a p h i c s > ): “But still Water-type Pokemon are strong against Fire-type Pokemon.” Response: “Yes, that is correct. Water-type Pokemon are generally strong against Fire-type Pokemon, as they are resistant to Fire-type moves and can do super effective damage with their Water-type moves. However, in this specific scenario, the harsh sunlight is boosting the power of Fire-type moves, which gives Charmander an advantage. It's important to remember that type advantages and disadvantages can be affected by various factors, such as the weather and the moves and abilities each Pokemon has access to. In a normal battle without any special conditions, Squirtle would have a type advantage over Charmander due to its Water typing. However, in this scenario, the harsh sunlight is boosting the power of Fire-type moves, which gives Charmander an advantage.” Q2.4.2 ( < g r a p h i c s > ): “Charmander is in battle with Squirtle, both have equal level and stats. Charmander has only Flamethrower and Squirtle has only Headbutt. The battle takes places under harsh sunlight. Predict the outcome of the battle.” Response: “In a battle between a Charmander and a Squirtle, with both Pokemon having equal level and stats, and the battle taking place under harsh sunlight, the outcome would depend on the type effectiveness of their respective moves and the effect of the harsh sunlight on their abilities. Flamethrower is a Fire-type move, which is generally strong against Grass-type Pokemon, but weak against Water-type Pokemon. Squirtle is a Water-type Pokemon, so Flamethrower would be relatively ineffective against it. Headbutt is a Normal-type move, which doesn't have any type-based advantages or disadvantages. It would be relatively neutral in effectiveness against Charmander, a Fire-type Pokemon. Under harsh sunlight, Fire-type moves are powered up and Water-type moves are weakened. This would give Charmander an advantage in the battle, as Flamethrower would be more powerful due to the harsh sunlight. However, the outcome of the battle would also depend on the accuracy and power of the moves, as well as the specific stats and conditions of the Pokemon. Overall, it's difficult to predict the exact outcome of the battle, but Charmander may have a slight advantage due to the effect of the harsh sunlight on its Flamethrower move” Q2.4.3 ( < g r a p h i c s > ): “Charmander is in battle with Squirtle, both have equal level and stats. Charmander has only Flamethrower and Squirtle has only Headbutt. The battle takes place under heavy rain. Predict the outcome of the battle.” Response: “In a battle between a Charmander and a Squirtle, with both Pokemon having equal level and stats, and the battle taking place under heavy rain, the outcome would depend on the type effectiveness of their respective moves and the effect of the heavy rain on their abilities. Flamethrower is a Fire-type move, which is generally strong against Grass-type Pokemon, but weak against Water-type Pokemon. Squirtle is a Water-type Pokemon, so Flamethrower would be relatively ineffective against it. Headbutt is a Normal-type move, which doesn't have any type-based advantages or disadvantages. It would be relatively neutral in effectiveness against Charmander, a Fire-type Pokemon. Under heavy rain, Water-type moves are powered up and Fire-type moves are weakened. This would give Squirtle an advantage in the battle, as Headbutt would be relatively neutral in effectiveness against Charmander, and Flamethrower would be weakened due to the heavy rain. Overall, it's difficult to predict the exact outcome of the battle, but Squirtle may have a slight advantage due to the effect of the heavy rain on Charmander's Flamethrower move.” Q2.4.4 ( < g r a p h i c s > ): “Pikachu is in battle with Charmander, both have equal level and stats. Pikachu has only Discharge and Charmander has only Flamethrower. The battle takes places under harsh sunlight. Predict the outcome of the battle.” Response: “In a battle between a Pikachu and a Charmander, with both Pokemon having equal level and stats, and the battle taking place under harsh sunlight, the outcome would depend on the type effectiveness of their respective moves and the effect of the harsh sunlight on their abilities. Discharge is an Electric-type move, which is generally strong against Water-type Pokemon, but weak against Ground-type Pokemon. Charmander is a Fire-type Pokemon, so Discharge would be relatively neutral in effectiveness against it. Flamethrower is a Fire-type move, which is generally strong against Grass-type Pokemon, but weak against Water-type Pokemon. Pikachu is an Electric-type Pokemon, so Flamethrower would be relatively neutral in effectiveness against it. Under harsh sunlight, Fire-type moves are powered up and Water-type moves are weakened. This would give Charmander an advantage in the battle, as Flamethrower would be more powerful due to the harsh sunlight. However, the outcome of the battle would also depend on the accuracy and power of the moves, as well as the specific stats and conditions of the Pokemon. Overall, it's difficult to predict the exact outcome of the battle, but Charmander may have a slight advantage due to the effect of the harsh sunlight on its Flamethrower move.” Q2.4.5 ( < g r a p h i c s > ): “Pikachu is in battle with Charmander, both have equal level and stats. Pikachu has only Discharge and Charmander has only Flamethrower. The battle takes places under heavy rain. Predict the outcome of the battle.” Response: “In a battle between a Pikachu and a Charmander, with both Pokemon having equal level and stats, and the battle taking place under heavy rain, the outcome would depend on the type effectiveness of their respective moves and the effect of the heavy rain on their abilities. Discharge is an Electric-type move, which is generally strong against Water-type Pokemon, but weak against Ground-type Pokemon. Charmander is a Fire-type Pokemon, so Discharge would be relatively neutral in effectiveness against it. Flamethrower is a Fire-type move, which is generally strong against Grass-type Pokemon, but weak against Water-type Pokemon. Pikachu is an Electric-type Pokemon, so Flamethrower would be relatively neutral in effectiveness against it. Under heavy rain, Water-type moves are powered up and Fire-type moves are weakened. This would give Pikachu an advantage in the battle, as Discharge would be relatively neutral in effectiveness against Charmander, and Flamethrower would be weakened due to the heavy rain. Overall, it's difficult to predict the exact outcome of the battle, but Pikachu may have a slight advantage due to the effect of the heavy rain on Charmander's Flamethrower move.” Q2.4.6 ( < g r a p h i c s > ): “Diglett is in battle with Squirtle, both have equal level and stats. Diglett has only Earthquake and Squirtle has only HeadButt. The battle takes place under a sandstorm. Predict the outcome of the battle.” Response: “In this scenario, the outcome of the battle would likely be in favor of Diglett. First of all, Diglett has Ground typing which makes it immune to Electric type attacks and Squirtle is a water type pokemon which makes it weak to Electric type attacks. As HeadButt is not an Electric type move, it won't be effective against Diglett. Additionally, the battle takes place under a sandstorm which will give additional damage to Rock and Ground type Pokemon. So Diglett will be benefiting from that. Finally, Earthquake is a powerful Ground-type move that will deal heavy damage to Squirtle. While Headbutt is a Normal-type move, it will be not very effective against Diglett. So in this scenario, Diglett will have the upper hand and it's likely to defeat Squirtle.” Q2.4.7 ( < g r a p h i c s > ): “Charmander is in battle with Squirtle, both have equal level and stats. Charmander has only Flamethrower and Squirtle has only Water Gun. The battle takes place under extremely harsh sunlight. Predict the outcome of the battle.” Response: “In this scenario, the battle taking place under extremely harsh sunlight would change the outcome of the battle. The sunlight in the battle would create an intense heat that would strengthen fire type moves and make them more effective. Since Charmander has only Flamethrower as its move and Squirtle has only Water Gun, the increased effectiveness of Charmander's Flamethrower would be a significant advantage for it in this battle. This means that the damage from Charmander's move would be more significant than it would be normally, while Squirtle's move would remain unchanged. Additionally, in battle under extreme sunlight, Water-type moves are not very effective against Fire-type Pokemon, unlike normal conditions where Water moves are super effective against Fire-types. So, in this scenario, it is likely that Charmander would be able to defeat Squirtle due to the intense heat of the sunlight amplifying its Flamethrower move and making it more powerful than Squirtle's Water Gun move.” §.§ Status-affected Battles Q2.6.1 ( < g r a p h i c s > ): “Squirtle of level 15 is in battle with Vulpix of level 10. Squirtle is sleeping for the next 2 turns and burned. Squirtle has only Water Gun and Vulpix has only Fire Spin. Predict the outcome and explain it step by step.” Response: “The outcome of this battle would depend on a few factors, such as the specific stats of the Pokemon and whether any other abilities or conditions come into play. Here is a rough prediction of how the battle might play out: In the first turn, since Squirtle is sleeping, it will not be able to move and Vulpix will be able to attack with Fire Spin. Squirtle will also take additional damage from being burned, which reduces its HP each turn. On the second turn, Squirtle will still be asleep and Vulpix will attack again. On the third turn, Squirtle wakes up and uses Water Gun, Vulpix will also attack with Fire Spin. Squirtle takes significant damage due to the burn and also from Fire Spin, and might also be at low HP, making it more vulnerable to further attacks. Vulpix does not take much damage from Water Gun since it has strong resistance to it. In following turns, Vulpix can keep using Fire spin, which will damage Squirtle, eventually squirtle might be knocked out, due to the lack of options in moveset. It's important to note that this is just a rough prediction based on the information given, and the actual outcome of the battle could be different depending on various factors such as the specific stats of the Pokemon, any abilities or conditions that come into play, and luck. Also it's worth noticing, Vulpix is lower level than Squirtle and that can also play a role in the battle.” Q2.6.2 ( < g r a p h i c s > ): “Pikachu is in battle with Charmander, both have equal level and stats. Pikachu is burned. Pikachu has only Discharge and Charmander has only Flamethrower. Predict the outcome and explain it step by step.” Response: “In a battle between a Pikachu and a Charmander, with both Pokemon having equal level and stats and Pikachu being burned, the outcome would depend on the type effectiveness of their respective moves and the effect of the burn on Pikachu's ability. Discharge is an Electric-type move, which is generally strong against Water-type Pokemon, but weak against Ground-type Pokemon. Charmander is a Fire-type Pokemon, so Discharge would be relatively neutral in effectiveness against it. Flamethrower is a Fire-type move, which is generally strong against Grass-type Pokemon, but weak against Water-type Pokemon. Pikachu is an Electric-type Pokemon, so Flamethrower would be relatively ineffective against it. However, being burned reduces a Pokemon's physical attack power and increases the power of Fire-type moves. This means that Flamethrower would be more powerful than normal, while Discharge would be weaker than normal. Overall, it's difficult to predict the exact outcome of the battle, but Charmander may have a slight advantage due to the effect of the burn on Pikachu's Discharge move and the increased power of Flamethrower. However, the outcome of the battle would also depend on the accuracy and power of the moves, as well as the specific stats and conditions of the Pokemon.” Q2.6.3 ( < g r a p h i c s > ): “Pikachu is in battle with Charmander, both have equal level and stats. Charmander is paralyzed for the next 2 turns. Pikachu has only Discharge and Charmander has only Flamethrower. Predict the outcome and explain it step by step.” Response: `In this scenario, it is likely that Pikachu would be victorious in the battle. Both Pikachu and Charmander have the same level and stats, so their base power, defense and HP are equal. However, Charmander is paralyzed which means it will have a speed penalty of 75% and has a chance to fail on each turn due the paralysis effect. This makes it much slower than Pikachu, which would give Pikachu a chance to attack first. Pikachu's main move is Discharge, which is an electric type move that has a chance of causing paralysis in addition to dealing damage. This move will be super effective against Charmander as it is fire type Pokemon and takes double damage from electric type attacks. On the other hand, Charmander only has Flamethrower, which is a fire type move. This move will be not very effective against Pikachu as it is an electric type Pokemon and it takes half damage from fire type attacks. Considering that Pikachu gets to attack first, with a Super Effective move, and Charmander will be suffering from paralysis and would fail on each turn, it is likely that Pikachu would defeat Charmander in two turns with the use of Discharge. In summary, Pikachu would have the advantage in this battle due to its move type advantage, the paralysis effect and faster speed caused by the paralysis.” Q2.6.3 ( < g r a p h i c s > ): “You're not accurate, Fire-type is not weak against Electric type.” Response: “I apologize, you are correct that Fire-type Pokemon are not weak against Electric-type Pokemon. I apologize for any confusion my previous response may have caused. Fire-type Pokemon are actually neutral to Electric-type attacks, meaning they neither resist nor are weak against them. But Electric-type attacks are super effective against Steel-type Pokemon. In the battle scenario that you described, with Pikachu and Charmander both having equal level and stats and with Charmander being paralyzed for 2 turns, this could still be a difficult battle for Charmander even if its type isn't weak to Pikachu's. As I described earlier, Charmander being paralyzed would have a speed penalty of 75% and has a chance to fail on each turn due the paralysis effect, which would give Pikachu a chance to attack first. Also Pikachu's main move Discharge would still deal neutral damage to Charmander, but Flamethrower would also deal neutral damage to Pikachu. The paralysis effect would still give an advantage to Pikachu and make it more likely that Pikachu would defeat Charmander in the battle. I apologize again for the confusion caused by my previous statement and any inaccurate information provided.” Q2.6.4 ( < g r a p h i c s > ): “Bulbasaur of level 10 is in battle with Squirtle of level 15. Squirtle is poisoned and sleeping for the next 2 turns. Bulbasaur has only Leaf Cutter and Squirtle has only Water Gun. Predict the outcome and explain it step by step.” Response: “In this scenario, the outcome would likely depend on the remaining health of the two Pokémon and the effects of the poison and sleep status on Squirtle. Here's a possible outcome of the battle step-by-step: As Squirtle is sleeping and Poisoned, it cannot move or attack for 2 turns so Bulbasaur will be able to land a free hit with its only move Leaf Cutter. The damage dealt is depend on the Attack Stat of Bulbasaur and the Defense Stat of Squirtle. Then after 2 turns, Squirtle wakes up and his poison damage would also have taken effect by this time, which reduces its hit points every turn. At this point Squirtle's HP would have reduced and possibly weak , Bulbasaur will be able to use its Leaf cutter again dealing good damage again. While Squirtle's attack Water Gun will not be very effective against Bulbasaur. If the damage dealt by Bulbasaur and the poison is enough to knock out Squirtle before it wakes up, Bulbasaur would win the battle. otherwise, Squirtle could potentially win if it wakes up in time and have enough health to survive Bulbasaur's attacks and knock out Bulbasaur with Water Gun. It is worth noting that this is a simplified prediction and in a real-world scenario, many factors such as item, abilities and strategy also play a role.” Q2.6.5 ( < g r a p h i c s > ): “Pikachu is in battle with Squirtle, both have equal level and stats. Squirtle is paralyzed for the next 2 turns. Pikachu has only Iron Tail and Squirtle has only HeadButt. Predict the outcome and explain it step by step.” Response: “If Pikachu and Squirtle are of equal level and stats, and Squirtle is paralyzed for the next 2 turns, then the outcome of the battle will likely be in Pikachu's favor. Here is a step by step explanation of how this battle could play out: Pikachu uses Iron Tail, which is a steel-type move and Squirtle being water type Pokemon is neutral to this move. So Pikachu will land a super effective hit. Squirtle is paralyzed so it will not be able to move for the next 2 turns, which means Pikachu can use Iron Tail again for the next 2 turns. As a result of the paralysis and Pikachu's super effective move, Squirtle's HP will continue to decrease, Squirtle will not be able to use it's HeadButt move, as it is paralyzed, so Pikachu will continue to land super effective hit Eventually Squirtle's HP will reach 0 and it will be unable to battle, and Pikachu will win this battle. It's worth noting that even if Squirtle had move other than Headbutt, Pikachu would still have the upper hand in this scenario since the paralysis would prevent Squirtle from moving and Pikachu would be able to land super effective hit again and again.” Q2.6.6 ( < g r a p h i c s > ): “Bulbasaur of level 10 is in battle with Squirtle of level 15. Squirtle is poisoned and sleeping for the next 2 turns. Bulbasaur has only Leaf Cutter and Squirtle has only Headbutt. Predict the outcome and explain it step by step.” Response: “If a level 10 Bulbasaur is battling a level 15 Squirtle and Squirtle is both poisoned and sleeping for the next 2 turns, it's likely that the outcome of the battle would be in favor of Bulbasaur. Here is a step-by-step explanation of how the battle might unfold: Squirtle is both poisoned and asleep, so it won't be able to attack for the next two turns, while Bulbasaur will be able to use Leaf cutter. The poison on Squirtle will also damage it each turn. Bulbasaur uses Leaf cutter and Squirtle takes damage due to the effects of poison. Bulbasaur can hit Squirtle for two turns as Squirtle remain asleep for next two turns. Squirtle will take double the damage from Leaf cutter being a grass move, as Squirtle is water type and grass move is super effective on water type Pokemons. After two turns of taking damage from Leaf cutter and poison, Squirtle's HP will most likely be low enough that it would be defeated. Bulbasaur would be the winner of the battle. [...] § INTRODUCTION OF NEW KNOWLEDGE Q3.2 ( < g r a p h i c s > ): “I would like to introduce a second new Pokemon. It is named MuddyRock. It's a ground type Pokemon, which looks like a muddy rock. MuddyRock can learn and use ground type moves such as Bulldoze, Earthquake, and Mud Bomb. Can you please describe MuddyRock again.” Response: “MuddyRock is a new Ground-type Pokemon that resembles a muddy rock. It is able to learn and use Ground-type moves such as Bulldoze, Earthquake, and Mud Bomb. Ground-type Pokemon are generally associated with earth and dirt and tend to have high defense and attack stats. They are known for their powerful physical attacks and are resistant to Electric-type moves. MuddyRock's unique appearance and ground typing would give it some interesting advantages in battle. Its muddy rock appearance may also suggest that it has a strong connection to the earth and has the ability to manipulate dirt and mud. [...]” Q4.1 ( < g r a p h i c s > ): “Which known Pokemon do you think mostly resembles MuddyRock?” Response: “There are several Pokemon that bear some resemblance to MuddyRock, given that it is a Ground-type Pokemon that resembles a muddy rock. Some examples include: Geodude: a small, rock-like Pokemon with a rough, boulder-like appearance and a brown and gray color scheme that is similar to a muddy rock. Onix: a large, snake-like Pokemon made entirely of rock. It has a rough, boulder-like appearance and is known for its powerful ground-based attacks. [...]These are just a few examples of Pokemon that are similar to MuddyRock. It's worth noting that MuddyRock is a hypothetical Pokemon that has not yet been introduced in the Pokemon games or media, so it is not possible to say for certain which Pokemon it would be most similar to.” Q4.2 ( < g r a p h i c s > ): “Ok, these Pokemon look relevant. But, I don't think you really consider how muddy MuddyRock really is. Are there other Pokemon that look muddier and more filthy?” Response: “There are several Pokemon that have a muddy or dirty appearance, although none of them are quite as muddy or filthy as the hypothetical MuddyRock that you have described. Some examples of Pokemon with a muddy or dirty appearance include: Diglett: a small, mole-like Pokemon with a brown and tan color scheme that makes it appear dirty. It is known for its ability to tunnel through the ground and has a long, thin body. Palpitoad: a small, amphibian-like Pokemon with a slimy, muddy appearance. It has a brown and tan color scheme and is known for its powerful, water-based attacks. Gible: a small, dragon-like Pokemon with a rough, rocky appearance and a brown and tan color scheme. It is known for its powerful ground-based attacks and has sharp teeth and claws. [...]” Q5.2 ( < g r a p h i c s > ): “BatteryPack is in battle with MuddyRock, both have equal level and stats. BatteryPack has only Discharge and MuddyRock has only Mud Bomb. Predict the outcome of the battle and explain it step by step.” Response: “In this battle, MuddyRock would have the advantage due to its Ground-type moves, which are super effective against BatteryPack's Electric-type. [...] Since Ground-type moves are super effective against Electric-type Pokemon, MuddyRock's Mud Bomb would do more damage to BatteryPack than BatteryPack's Discharge would do to MuddyRock. As a result, MuddyRock would likely defeat BatteryPack in this battle. [...]” Q5.3 ( < g r a p h i c s > ): “BatteryPack is in battle with Squirtle, both have equal level and stats. BatteryPack has only Discharge and Squirtle has only Water Gun. Predict the outcome of the battle on a rainy day and explain it step by step.” Response: “In this hypothetical battle on a rainy day, Squirtle would have an advantage over BatteryPack due to their type advantage and the effect of the weather. Water-type Pokemon are generally strong against Electric-type Pokemon , and in a rainy day, Water-type moves are boosted in power. This means that Squirtle's Water Gun attack would be more effective against BatteryPack than BatteryPack's Discharge would be against Squirtle. In this case, it is likely that Squirtle would emerge victorious due to its type advantage and the boost in power provided by the rain. [...]” Q5.4 ( < g r a p h i c s > ): “I agree, but Water-type Pokemon are generally weak against Electric-type Pokemon right?” Response: “No, that is incorrect. Water-type Pokemon are generally strong against Electric-type Pokemon, not weak against them. The type effectiveness chart in the Pokemon games shows the general strengths and weaknesses of each type against other types. According to the chart, Water-type moves are generally super effective against Electric-type Pokemon, meaning they deal more damage to Electric-type Pokemon than they would to Pokemon of other types. [...]” Q5.5 ( < g r a p h i c s > ): “Okay, but you forgot about elementary types like Water-type and Electric-type.” Response: “I apologize for the oversight. Here is a summary of the type effectiveness chart for Water-type and Electric-type Pokemon: Water-type moves are super effective against Fire-type, Ground-type, and Rock-type Pokemon, but are not very effective against Water-type, Grass-type, and Dragon-type Pokemon. Electric-type moves are super effective against Water-type and Flying-type Pokemon, but are not very effective against Electric-type, Grass-type, and Dragon-type Pokemon.[...]” § ILLUSTRATIONS In Figures <ref> and <ref>, we present illustrations for the two made-up Pokemon introduced to ChatGPT.
http://arxiv.org/abs/2306.11116v1	20230619183038	Na in Diamond: High Spin Defects Revealed by the ADAQ High-Throughput Computational Database	[ "Joel Davidsson", "William Stenlund", "Abhijith S Parackal", "Rickard Armiento", "Igor A. Abrikosov" ]	cond-mat.mtrl-sci	[ "cond-mat.mtrl-sci" ]	[email protected] Department of Physics, Chemistry and Biology, Linköping University, Linköping, Sweden Department of Physics, Chemistry and Biology, Linköping University, Linköping, Sweden Department of Physics, Chemistry and Biology, Linköping University, Linköping, Sweden Department of Physics, Chemistry and Biology, Linköping University, Linköping, Sweden Department of Physics, Chemistry and Biology, Linköping University, Linköping, Sweden Color centers in diamond are at the forefront of the second quantum revolution. A handful of defects are in use, and finding new ones with all the desired properties for quantum applications is arduous. By using high-throughput calculations, we screen 21607 defects in diamond and collect the results in the ADAQ database. Upon exploring this database, we find not only the known defects but also several unexplored defects. Specifically, defects containing sodium stand out as particularly relevant because of their high spins and predicted improved optical properties compared to the NV-center. Hence, we studied these in detail, employing high-accuracy theoretical calculations. The single sodium substitutional (Na_C) has various charge states with spin ranging from 0.5 to 1.5, ZPL in the near infrared, and a high Debye-Waller factor, making it ideal for biological quantum applications. The sodium vacancy (NaV) has a ZPL in the visible region and a potential rare spin-2 ground state. Our results show sodium implantation yields many interesting spin defects that are valuable additions to the arsenal of point defects in diamond studied for quantum applications. Na in Diamond: High Spin Defects Revealed by the ADAQ High-Throughput Computational Database Igor A. Abrikosov Received XXX, XXXX; accepted YYY, YYYY ============================================================================================ § INTRODUCTION Of all point defects in diamond, the NV center <cit.> stands out as the most studied and used in quantum applications with many ongoing parallel efforts. It fulfills many of the defect properties listed for various quantum applications <cit.>. The NV center is the main defect considered as a computational qubit <cit.> with recent advancements in fault-tolerant operation <cit.>. While more work is needed before it can be realized at large scale <cit.>, it has already demonstrated promise as a flying qubit by transmitting quantum information over long distance <cit.> and multinode network capabilities <cit.>, which goes towards the quantum internet <cit.>. It has also been demonstrated as memory for quantum information <cit.>. Recent advances in quantum sensing with NV centers include magnetrometry <cit.> at extreme conditions <cit.>, nano-scale nuclear magnetic resonance <cit.>, relaxometry <cit.>, and biological applications <cit.>. These are just some of explored and proposed applications for the NV center. It is a genuinely versatile defect that is also well understood from the theoretical side <cit.> with known properties such as spin-1, many-body structure etc. However, the NV center does have some drawbacks. It has a Zero Phonon Line (ZPL) in the visible range (outside the first and second biological window <cit.> as well as the telecom region <cit.>) with a low Debye-Waller factor (∼3.2% <cit.>) and is affected by spectral diffusion <cit.>. Other defects in diamond improve on these aspects. The group 14 (Si <cit.>, Ge <cit.>, Sn <cit.>, and Pb <cit.>) vacancy centers <cit.> have a wide range of ZPLs from near infrared to visible with higher Debye-Waller factors, from about 20% to 70% <cit.>. Since the dopant sits between two vacancy positions, known as a split-vacancy configuration, these defects have D_3d symmetry, specifically inversion, that suppresses spectral diffusion. This property, combined with the high Debye-Waller factor, makes these defects ideal for photonics <cit.>. They are also considered as spin qubits, and as the ion size increases, the ground state splitting becomes larger, providing coherent spin control as demonstrated for the SnV <cit.>. However, the group 14 vacancy centers also have some drawbacks. They are spin-12, one of the defect states are below or just above to the valence band edge, and the ZPLs are in the visible range. There are a handful of other less studied defects in diamond, mainly other vacancy complexes in a split-vacancy configuration. Theoretically suggested defects include the group 13 (Al, Ga, In, and Tl) vacancy centers <cit.>. These centers have spin-1 and ZPLs in the visible region with Debye-Waller factors from about 15% to 43%. Another vacancy defect is the MgV center with spin-12 in the negative charge state with a Debye-Waller factor of 54% <cit.>. This defect is found along with single substitutional Mg during Mg implantation <cit.>. Yet another vacancy complex is the NiV with spin-12, ZPL in the near infrared range, and predicted Debye-Waller factor between 28% and 74% <cit.>. Recent experimental study announced the Debye-Waller factor for this defect is to be 51% <cit.>. The Ni_C (W8) is a related defect with notably spin-32 <cit.>. This defect is one of the few with spin-32 reported i diamond. The most studied spin-32 defect is the silicon vacancy in SiC <cit.>. The high spin gives unique sensing opportunities for strain and temperature which are universal for defects with spin larger or equal to spin-32 <cit.>. So far, no spin-2 defect in diamond has been reported. More diamond defects can be found in Refs. Aharonovich_2011,THIERING20201. High-throughput experimental search has studied known defects in diamond <cit.>. Apart from the known defects in diamond, there are many unknown defects <cit.>. Notable examples include: ST1 (spin-0, ZPL in the visible range, oxygen related) <cit.>; TR12 (spin 0, ZPL in the visible range, static Jahn–Teller distortion) <cit.>; implanted defects with F (ZPL in the visible range, possibly FV center with spin-12 or spin-1) <cit.>, and Xe (ZPL in the ultraviolet range with high Debye Waller around 74%, possibly XeV center with spin-12 or spin-1) <cit.>. Given all these defects, has the best defect in diamond been found? To answer this, we turn to theoretical high-throughput methods. Previous such studies systematically looked at vacancy center complexes <cit.>. However, this study limits the dopants to p-elements and the defects to vacancy centers. The large space of point defects in diamond remains unexplored. In this paper, we screen defects in diamond using the high-throughput framework ADAQ <cit.>, which in turn uses the high-throughput toolkit (httk) <cit.>. The ADAQ software package is a culmination of a series of publications related to SiC <cit.> that focus on accurately calculating magneto-optical properties for point defects, such as ZPL. ADAQ has been successfully applied to SiC and CaO, where modified silicon vacancy <cit.> and X_CaV_O defects with X=Sb, Bi, and I <cit.> were found. In this paper, we turn our attention to diamond to investigate single and double defects consisting of vacancies, substitutionals, and interstitials, however, we do exclude interstitial-interstitial clusters. The result is a total of 21607 defects to consider. These defects were screened at the PBE DFT level (see Sec. <ref> for more on the workflow and calculational details) and the results were stored to the ADAQ database. The stored properties include: formation energy, charge transition levels, defect levels, defect spin, zero phonon line with radiative lifetime and transition dipole moment (including polarization), ΔQ (relaxation between ground and excited state), and more. We search through the magneto-optical properties, looking for stable defects that stand out either with properties like the NV center (spin-1 and a bright ZPL), unexplored high spin states, or high Debye-Waller factors. When considering all these properties, the sodium substitutional and vacancy center stand out. We characterize these defects with higher-order methods (using HSE DFT calculation) and confirm their properties. § DATABASE SEARCHES The most stable defects are located on the defect hull—the lowest formation energy per stoichiometry and per Fermi energy <cit.>. In the ADAQ database, all known defects, consisting of s- and p-elements, mentioned in the introduction are found on the defect hull. In this section, we discuss these defects and their optical properties compared with experiment and other theoretical calculations. ADAQ predicts the ZPL of defects with at least one occupied and unoccupied defect state within the band gap. However, due to the use of the PBE functional, they are systematically underestimated. For the NV center, ADAQ predicts a ZPL of 1.700 eV (see Table <ref>), whereas the experimental value is 1.945 eV <cit.> (a difference of 0.245 eV). For the group 14 vacancy defects; SiV, GeV, and SnV do not have a ZPL in the database because one of the defect states involved in the transition is below the valence band edge <cit.>. However, as the dopant gets larger, the defect state enters the band gap <cit.>. Hence, the PbV center does have a state in the band gap, which ADAQ finds and predicts a ZPL of 2.122 eV, which is close to the measured 2.384 eV (520 nm) <cit.> (a difference of 0.263 eV). In general, we find from comparing the ADAQ ZPL predictions from the screening workflow to experimentally measured defects that the ZPLs are underestimated by around 0.25 eV (mean difference). Similar mean difference and variation are observed for defects in SiC <cit.>. One can also compare the ADAQ ZPL predictions with other theoretical results. For the group 13 vacancy defects, the ADAQ ZPLs are AlV 1.00 eV, GaV 1.72 eV, InV 1.87 eV, and TlV 2.31 eV (see Table <ref>). When comparing with the HSE calculations done in Ref. PhysRevB.102.195206, the ZPLs are for GaV 1.82 eV (difference 0.1 eV), InV 2.12 eV (difference 0.25 eV), and TlV 2.84 eV (0.53 eV). The ZPL for the AlV center is not reported due to numerical convergence issues <cit.>. Finally, the MgV center is on the defect hull, and ADAQ reports a ZPL of 0.31 eV. In the screening workflow, ADAQ calculates only one excitation. This excitation for the MgV defect matches with the theoretical results in Ref. Pershin2021 where the lowest excitation (^2E_g-^2E_u in the doublet state without Jahn-Teller effect) has an adsorption value of 0.7 eV. §.§ NV-like Spin-1 Defects To look for NV-like defects, we search for spin-1 defects on the defect hull with a ZPL larger than 0.5 eV and a transition dipole moment (TDM) larger than 3 debye. We find 15 unique defects, see Table <ref>. Apart from the already discussed substitutional vacancy complexes (the NV center and group 13 vacancies), there are also vacancy centers consisting of Li and Ba. Both of these show similar properties as the NV center, but with lower ZPL and ΔQ for both, and a higher brightness for the Ba defect. The Ba defect has large formation energy, about 20 eV, which is similar to the Xe_CVac_C. A large formation energy is not necessarily a problem since XeV is suggested as the most probable defect after Xe implantion <cit.>. ADAQ supports this conclusion since the single Xe substitutional has a higher formation energy of around 29 eV. There are also more exotic complexes with a carbon interstitial and substitutional (I and Br). Here, the Br defect has better properties than the NV center. However, it also has a large formation energy of around 25 eV. Furthermore, the defect with a K interstitial and substitutional has a huge formation energy of 43 eV, making it highly unlikely to form. There is one substitutional-substitutional cluster with Mg with interesting ZPL that could be in the telecom range but also a large formation energy, about 20 eV. Furthermore, forming a double Mg substitutional cluster is extremely rare since substitutionals usually are stable with high energy barriers. Hence, to form a cluster with two substitutionals by diffusion appear to be highly unlikely. Finally, the search finds four single substitionals (H, F, K, and Xe). The H and F dopants are offset from their ideal position, so they are more like Int_H+Vac_C and Int_F+Vac_C, which they are named in ADAQ. The K and Xe dopants sit at the ideal position with distortion of the nearest atoms depending on the dopant size. There are two charge states for the K substitutional that have spin-1. §.§ Spin-32 Defects There are many other searches to divide and filter the data which may be relevant to consider. Here, we demonstrate how to find spin-32 defects. Table <ref> shows stable defects with spin-32, a ZPL larger than 0.1 eV, and no TDM requirement to include spin-forbidden transitions. The group 1 substitutionals show a similar trend. As one goes down in the rows in the periodic table, the ZPL decreases. The Cs_C is not included, since the predicted ZPL is below the cutoff in ADAQ (0.4 eV) and thus not calculated. The Na stands out with increased ZPL from the trend but also with a high TDM (7.41 debye) and a low ΔQ (0.14 amu^1/2Å). The K and Rb substitutionals could have emission in the telecom range. Only Be from group 2 substitutionals have spin-32. The Na_CNa_C cluster has a formation energy around 22 eV. The X_CInt_X clusters have large formation energy about 25 and 63 eV for Na and Sb, respectively. However, the divacancy (Vac_CVac_C) has a low formation energy of around 9 eV. Of these defects, the divacancy, which consists of near neighbors, shows the most promising properties: a ZPL that can be in the telecom range with a strong TDM and a low ΔQ. The spin-32 ground state is also found in Ref. PhysRevB.89.075203. The divacancy is also suggested to be the W29 center <cit.>. §.§ Spin-2 Defects Table <ref> shows stable defects with spin-2, a ZPL larger than 0.1 eV, and no TDM requirement to include spin-forbidden transitions. Na_CVac_C has a formation energy around 12 eV and the F_CVac_C around 9 eV. The Na_CVac_C shows a spin-forbidden transition, hence the low TDM. §.§ Spin Defects With a High Debye-Waller Factor The previous searches show how to find spin defects on the defect hull. However, there could be defects where the spin states are close in energy but the high spin is not on the defect hull. We include defects with an increased distance of 30 meV (thermal energy at room temperature) above the defect hull in the search. This criterion was also applied for the MgV center to argue that a higher laying spin state (22 meV than other state) can be stabilized by the thermal energy <cit.>. We also look for defects with a high spin state (S ≥ 1) and a high Debye-Waller factor (which is approximated with a low ΔQ<0.2) yielding 5 unique defects that are shown in Table <ref>. Apart from the already discussed divacancy in Table <ref> and the MgV(0) center (also excellent predicted properties like divacancy but the spin-0 state is more stable according to Ref. Pershin2021), all other defects contain sodium. The Na_CInt_Na is also present in Table <ref>. The two new defects are the Na_CNa_C and Na_C. The Na_CNa_C has a formation energy around 22 eV and is similar to Mg_CMg_C discussed above. The simplest sodium defect is the sodium substitional, which has formation energy around 13 eV and a spin-1 ground state within 1 meV from the defect hull. By looking at the spin defects in diamond, sodium defects stand out with thier presence in most searches: Table <ref>, Table <ref>, and Table <ref>. Of these defects, the sodium substitutional has a good ZPL and a TDM with the lowest ΔQ found in any of the defect searches. The spin-32 state is on the defect hull, and the spin-1 state is extremely close (<1 meV) to the defect hull. The sodium vacancy is one of only two dopants with a predicted spin-2 ground state. Hence, we choose to study these defects in detail. § RESULTS The Na dopants have previously been considered as donors in diamond <cit.>. However, no shallow levels have been reported <cit.> and little change in resistivity is seen between Na and Ne implantation in diamond <cit.>. The donor properties have been attributed to Na as an interstitial. However, theoretical studies have found the Na substitutional more stable than the interstitial <cit.>. The ADAQ results support this conclusion. As far as we know, the Na substitutional has not been considered for quantum applications, but with multiple spin states for the different charge states, it appear to be a promising addition to the point defects in diamond. §.§ Sodium Substitutional Na_C Figure <ref> shows the formation energy for Na substitutional Na_C calculated with the HSE functional. ADAQ predicts that the negative charge state is spin-0 with an energy difference to the spin-1 state of about 1 meV. This is contrasted with HSE results where the negative charge state with spin-1 is the lowest (95 meV lower in energy than spin-0) and stable in a wide region of Fermi energies. Furthermore, the neutral charge state is spin-32 with a wide stability region. This charge state is found in ADAQ when searching for spin-32 defects (see Table <ref> with a predicted ZPL of 1.50 eV). Furthermore, the positive charge state is also spin-1 but has no ZPL. Hence it did not appear in the ADAQ search (Table <ref>. The double positive charge state is not stable, but the double negative charge state is, with spin-12 and a ZPL. Figure <ref>a) shows the schematic eigenvalues for the stable ground states with marked ZPL transitions. Except for the positive charge state, where the a_1 state moves below the valence band, all other states have similar ZPLs and TDMs, as reported in Table <ref>. The neutral charge state has the highest symmetry (T_d) and two defect orbitals a_1 and t_2, see Figure <ref>b). Figure <ref>c) shows the partial charge difference between these orbitals, which is much smaller than for the NV center and small compared to the silicon vacancy in SiC (cf. Figure 4 in Ref. PhysRevApplied.11.044022). These results suggest that Na_C has a low spectral diffusion for the transition between these mid-gap states. Similar transitions are observed in the negative and double negative charge states with only slight variations to the ZPL and TDM, attributed to Jahn-Teller splitting of the t_2 state when adding electrons. The Na_C has multiple Jahn-Teller splittings for the different charge states. For the neutral, there is a Jahn-Teller effect in the excited state; for the negative, in both the ground and excited states; for the double negative, in the ground state. Table <ref> shows the Jahn-Teller stabilization energy (E_JT=E_min-E_T_d) calculated with the PBE and HSE functionals. The PBE results show a low Jahn-Teller effect (around 10 meV) comparable with the NV center at 25 meV <cit.>. This value increases to 42 meV with the HSE functional for the NV-center <cit.>. However, for the Na_C, it increases to about 50-80 meV. To quantify the vibronic coupling, we use λ = 2 E_JT / n ħω <cit.>, where n is the degeneracy and ħω is the zero-point energy of the vibration. As a vibration estimate, we use the localized t modes from the phonon calculations, see the supplementary material. These have an energy of 21 meV for the PBE functional and 16 meV for the HSE functional. With the PBE functional, λ is about 0.25 for Na_C, which is comparable to the NV center, whereas with the HSE functional, λ is about 2-3, which corresponds to a stronger vibronic coupling. It is hard to state if the vibronic coupling is strong (λ≫ 1) or weak (λ≪ 1) <cit.>. Hence, with the PBE functional, the NV center and Na_C have similar Jahn-Teller effect. However, with the HSE functional, the Na_C becomes more static but still in an uncertain range. Furthermore, the NV center is a E⊗ e Jahn-Teller effect, whereas the Na_C is T_2⊗ (e+t_2) <cit.>. Assuming only the t phonons are involved (see supplementary material), it can be reduced to T_2⊗ t_2. However, to fully understand the Jahn-Teller effect in this system goes beyond the scope of this paper. The Na_C was predicted from ADAQ to have the lowest ΔQ of all defect searches (see Table <ref>, <ref>, <ref>, and <ref>). This continues to be the case when using the PBE functional for all charge states, see Table <ref>. However, with the HSE functional, the Jahn-Teller effect is much larger, and thus the ΔQ increases. Table <ref> also shows the Debye-Waller factors calculated with the one phonon approximation and for the full phonon calculation. Here, the one phonon approximation underestimates the Debye-Waller factor compared with the full phonon calculation in all cases regardless of the Jahn-Teller effect. In Figure <ref>, we show the difference in the calculated photoluminescence spectra with and without the Jahn-Teller relaxation for the neutral charge state with PBE and HSE functionals. Due to the large Jahn-Teller relaxation for the HSE functional (see Table <ref>), the Debye-Waller factor is reduced from 77% with the PBE functional to 40% in the neutral charge state. However, excluding the Jahn-Teller effect, the Debye-Waller factor is 83% for the two functionals and all charge states. In Ref. Alkauskas_2014, the Jahn-Teller effect is neglected, which is a good approximation for the NV center. However, this may not hold for the Na_C due to the stronger vibronic coupling when using the HSE functional. Regardless, the Debye-Waller factors are larger than the NV center. Zero field splitting (ZFS) exists for the charge states with spin larger or equal to one, see Table <ref>. The neutral charge state has T_d symmetry and therefore the ZFS tensor is zero. The negative charge state has D_2d symmetry with the PBE functional, hence there is no E splitting due to axial symmetry. Whereas, calculations using the HSE functional gives C_2v symmetry and hence both a D and E splitting. The PBE D result is in the same range as the D splitting of the silicon vacancy in SiC <cit.>. The ground state eigenvalues split due to crystal field splitting for the silicon vacancy in SiC and Jahn-Teller for the Na_C in diamond. However, the Jahn-Teller is much larger with the HSE functional, and consequently, the D splitting increases about 26 times, see Table <ref> for values. The positive charge state has C_3v symmetry with the HSE functional, thus only a D since E is zero. To summarize, the Na_C in diamond is a point defect that combines many sought-after properties for quantum applications. The positive and negative charge states are spin-1, where the negative charge state provides a ZPL in the near infrared region that happens to be surprisingly close to the ZPL of the neutral single carbon vacancy (GR1) <cit.>. Furthermore, the neutral with spin-32 and the double negative with spin-12 also have ZPLs in this region. The ZPL value is stable across the different charge states, meaning easy verification after implantation (and annealing) since the Fermi level does not need to be precisely controlled. The Debye-Waller factor is predicted to be large, in fact, it is the largest found in the database based on the ΔQ. If excluding the Jahn-Teller effect, this defect has a Debye-Waller factor of 83% for all charge states. However, it is unclear how strongly the vibronic coupling is since it depends greatly on the functional used. Even if the Jahn-Teller effect is present in full, the Debye-Waller factor remains as high as 40% (for the neutral charge state), which is still good and far higher than the NV center at 3%. The Jahn-Teller effect also affects the spectral diffusion, which is low when excluded as seen in Figure <ref>c) and likely lower than the NV center. The ZFS variation also depends on the functionals and the Jahn-Teller effect. The D values are in the Mhz to GHz range for the negative charge state. To recapitulate, there is a trade-off for the defect: if the Jahn-Teller effect can be neglected; the Debye-Waller factor is high and the ZPL is most likely stable against spectral diffusion, but the ZFS is weak. On the other hand, if the Jahn-Teller effect is strong, the opposite is true. The HSE results likely give the more accurate picture. However, experiments are needed to verify the strength of the Jahn-Teller effect. Due to only the Jahn-Teller effect in the excited state and the unique properties of spin-32, the neutral charge state is relevant to look more closely at. There are many similarities between the neutral Na_C in diamond and the negatively charged V_Si in SiC. Both defects have mid-gap states, are spin-32, and emit in the near-infrared region, specifically the first biological window <cit.>. However, the Debye-Waller factor for Na_C in diamond is much larger (40% with Jahn Teller, 83% without Jahn Teller) than that of the V_Si in SiC (8-9% <cit.>). However, this does not include structural engineering, which increases the Debye-Waller factor to 58% in nanowire <cit.> for the V_Si is SiC. The TDMs are comparable between the two defects (about 7 for Na_C and 8 for V_Si <cit.>). For spectral diffusion, V_Si in SiC has shown to have a small difference between the defect states (cf. Figure 4 in Ref. PhysRevApplied.11.044022), whereas the Na_C in diamond is even smaller, see Figure <ref>c). The ZFS is small for the V_Si is SiC, whereas it is zero for Na_C in the ground state. However, in the excited state, the ZFS will be nonzero due to symmetry breaking. The spin-32 and close to T_d symmetry make both defects excellent for strain sensing <cit.>. To conclude, the spin-32, ZPL in the near infrared (1.592 eV = 779 nm), strong TDM, possible stability against spectral diffusion, consist of non-toxic elements, and the large Debye-Waller factor make Na_C in diamond ideal for biological quantum sensing. §.§ Sodium Vacancy (NaV) When implanting Na into diamond, apart from creating Na_C, one also creates NaV centers (split-vacancy configuration). In the database, the NaV center has a slightly lower formation energy than Na_C. The formation energy trend is similar to the MgV center. Since Mg is next to Na in the periodic table, we expect comparable yields during implantation (MgV about 36% and single substitutionals Mg_C about 15% <cit.>). A slightly higher yield of Na_C may be due to the lower vacancy creation during implantation <cit.>. But, several NaV centers would still be created. Let us briefly discuss their properties. In the negative charge state, the NaV was predicted to be spin-2 by the database. With the PBE functional, the spin-2 state is 409 meV lower than spin-1 and 631 meV lower than spin-0. With the HSE functional, the spin-2 state is 283 meV lower than spin-1. However, the spin-0 state is 29 meV lower than the spin-2. A similar energy difference between the doublet and quartet is seen for the MgV center and thermal energy at room temperature and strain could be enough to stabilized one spin state <cit.>. For the spin-2 state, the database predicts a ZPL of 1.45 eV with a forbidden transition, deduced from the minuscule transition dipole moment, see Table <ref>. Whereas, for the allowed transition between a_1g and e_u states, the HSE result gives a ZPL of 2.548 eV. With the D_3d symmetry, this ZPL is stable against spectral diffusion. Overall, the NaV center is quite similar to the MgV that has a ZPL of around 2.224 eV <cit.>. However, the higher spin ground state (spin-2), compared with MgV spin-12, makes it a more interesting defect for spin control. The spin-2 ground state could give rise to new possibilities in spin control, like spin-32 has for the silicon vacancy in SiC <cit.>. To the best of our knowledge, this is the first prediction of a spin-2 point defect among all stable ground states for diamond defects. The database shows only two defects with spin-2 ground state (see Table <ref>). § DISCUSSION We start by discussing the search criteria used to reduce the number of interesting defects. Overall, the PBE results, such as formation energy, spin, and ZPLs are accurate enough to identify relevant defects with interesting properties. This paper demonstrates that all previously known defects are found to be on the PBE defect hull (see Table <ref>). However, some spin-1 defects close to the defect hull could be metastable or change spin state with more accurate methods, as was the case for the Na substitional. The conclusion is that the defect candidates found in the high-throughput screening with the PBE functional must be verified with higher-order methods. For spin-1 defects, we also excluded defects with a TDM below 3. These defects could either have a tiny TDM or a symmetry-forbidden transition. ADAQ only calculates one excitation, and for some defects, a larger excitation could be allowed, like in the case of NaV. Current automatic symmetry analysis efforts are being developed <cit.> to study these defects further. The main focus of this paper has been the on Na-related defects. However, based on other results of the various searches presented in this paper, K_C defect and F defects may also be relevant for further exploration. The potassium substitutional K_C also shows good ZPL, TDM, and ΔQ. The lower predicted ZPL could be in the telecom region but due to the size of the dopant, it was excluded since it will likely create more vacancies upon implantation than Na. Florine ions are small and hence will create a small number of vacancies. With good ZPL, TDM, and ΔQ for the single substitutional (Table <ref>) and spin-2 ground state for the fluorine vacancy (Table <ref>), these defects are also interesting. Experimental F implantation has already shown color centers <cit.>. We encourage other researchers to explore the data themselves for additional interesting point defects in diamond. The Na_C was chosen for further study due to the lowest ΔQ predicted by the high-throughput screening. It turned out that for this defect, the Jahn-Teller effect greatly changes between the ground and excited state when using a more accurate functional. This change was unforeseen since this usually does not happen for most other defects. For example, for the NV center, the Jahn-Teller values change a bit between functionals but do not show a quantitatively different behavior as in the case of Na_C. To improve the prediction of ΔQ, one needs better geometry. Currently, ADAQ has not implemented relaxation using the HSE functional in high-throughput. For other defects, we assume that the ΔQ trend is the same across all defects. In other words, the PBE result underestimates the Jahn-Teller effect, and going to more accurate methods will keep or increase ΔQ. Even if the Na_C did not have the predicted Debye-Waller factor. It is still a previously unstudied quantum defect found by high-throughput. Hence, the screening data provides new relevant point defects of quantum applications. § CONCLUSION We have performed high-throughput calculations for extrinsic (s- and p-elements) dopants in diamond and collected the results in the ADAQ database. The database contains not only known defects but also uncovers unexplored defects for quantum applications, such as sodium. Implantation of Na into diamond would yield an array of interesting spin defects for quantum applications. The Na single substitutional has spin-1 in the negative charge state, a bright ZPL in the near infrared region, and a high Debye-Waller factor. The neutral charge state has similar properties but with a spin-32, providing unique sensing opportunities previously unexplored in diamond. Both charge states of Na_C have properties that make them excellent for biological sensing applications, better than the NV center due to bright ZPL in the near infrared, possibly lower spectral diffusion, and the much increased Debye-Waller factor. Furthermore, the database also contains the Na vacancy cluster, one of two defects predicted to have a spin-2 ground state. These findings of sodium-related defects with high spin states show the usefulness of high-throughput screening. This work presents the ADAQ database, which is a powerful tool for finding stable point defects that are relevant for quantum applications. § METHODOLOGY The high-throughput calculations were performed with the software package ADAQ <cit.>, which, in turn, carries out automated workflows implemented using the high-throughput toolkit (httk) <cit.> with the density functional theory (DFT) calculations being preformed by the Vienna Ab initio Simulation Package (VASP) <cit.>. VASP uses the projector augmented-wave method <cit.>. The exchange-correlation functional is the semi-local functional by Perdew, Burke, and Ernzerhof (PBE) <cit.>. The defects are simulated at the gamma point in a 4×4×4 cubic supercell containing 512 atoms, with a lattice constant of 3.57 Å. For the sodium defects, the functional is the HSE06 hybrid functional by Heyd, Scuseria, and Ernzerhof (HSE) <cit.>. Sodium was simulated with the pseudopotential with 2p^6 3s^1 electron configuration (Na_pv), and carbon was simulated with the pseudopotential with 2s^2 2p^2 (C). The ionic and electronic stopping parameters are 5·10^-7 eV and 1·10^-8 eV respectively, and the cutoff energy of the plane-wave basis set is 600 eV. Phonopy <cit.> is used to calculate the phonons in the neutral ground state with both PBE and HSE, to speed up this large set of calculations the electronic stopping parameter is 1·10^-6 eV, and the plane-wave cutoff energy is 400 eV. The excited states are simulated by promoting one electron to occupy a higher orbital and constraining this configuration when relaxing the electronic structure <cit.>, the ZPL is the total energy difference between the relaxed ground and excited states. Symmetry constraints are not used when relaxing the crystal structure, this allows Jahn-Teller distortions to occur. When running simulations to calculate E_T_d, the T_d symmetry is fixed during the ion relaxation. The photoluminescence spectra and Debye-Waller factor are computed using Pyphotonics <cit.>. The neutral charge state phonons are assumed to be similar to the other charge state phonons and hence used to estimate the Debye-Waller factor. The ZFS tensor is calculated with the VASP implementation of the method by Ivády et al. <cit.>. The point group symmetry of the crystal structure is found with AFLOW-SYM <cit.>. Defect orbital symmetry analysis and polarization selection rules of optical transitions is done with the method in Ref. Stenlund_msc_thesis. TDM <cit.> is calculated with a modified version of PyVaspwfc <cit.>. To obtain the TDM of a transition from a degenerate state, the average is taken of the element-wise absolute value of each orbital in the degenerate state. Radiative lifetime is calculated by taking the inverse of the Einstein coefficient <cit.>, with the refractive index of diamond 2.4. The isosurface level used in Figure <ref> c) is 0.025 Å^-3, same as Ref. PhysRevApplied.11.044022, while the isolevel in b) is √(0.025)Å^-3/2 = 0.1581 Å^-3/2, meaning the a_1 orbital in b) has the exact same shape as \|a_1\|^2. § AVAILABILITY The ADAQ database, which can be searched for the diamond defect data discussed in this paper and information about how to obtain the ADAQ source code is available online <cit.>. § ACKNOWLEDGMENTS We acknowledge support from the Knut and Alice Wallenberg Foundation (Grant No. 2018.0071). Support from the Swedish Government Strategic Research Area Swedish e-science Research Centre (SeRC) and the Swedish Government Strategic Research Area in Materials Science on Functional Materials at Linköping University (Faculty Grant SFO-Mat-LiU No. 2009 00971) are gratefully acknowledged. This work was partially supported by the Knut and Alice Wallenberg Foundation through the Wallenberg Centre for Quantum Technology (WACQT). JD and RA acknowledge support from the Swedish Research Council (VR) Grant No. 2022-00276 and 2020-05402, respectively. The computations were enabled by resources provided by the National Academic Infrastructure for Supercomputing in Sweden (NAISS) and the Swedish National Infrastructure for Computing (SNIC) at NSC, partially funded by the Swedish Research Council through grant agreements no. 2022-06725 and no. 2018-05973. § COMPETING INTERESTS The authors declare no competing interests. § AUTHOR CONTRIBUTIONS J.D. conceptualized the project in discussion with R.A., analyzed the data, and wrote the manuscript. W.S. performed the sodium defects calculations and made the figures. A.P. performed the high-throughput calculations. R.A. and I.A.A. supervised and reviewed the manuscript.
http://arxiv.org/abs/2306.10041v1	20230610215657	Disorder effects on the so-called Andreev band in Majorana nanowires	[ "Sankar Das Sarma", "Haining Pan" ]	cond-mat.mes-hall	[ "cond-mat.mes-hall" ]	Condensed Matter Theory Center and Joint Quantum Institute, Department of Physics, University of Maryland, College Park, Maryland 20742, USA Department of Physics, Cornell University, Ithaca, NY 14850, USA We comment on a recent publication Phys. Rev. Lett. 130, 207001 (2023), pointing out that the periodic model for the superconducting gap and/or the spin splitting used by the authors is artificial and does not apply to any real systems. In addition, we show that the resulting Andreev band introduced by this artificial and unrealistic periodicity is suppressed by the potential disorder invariably present in all experimental systems. The results of this model are therefore contrived and do not apply to any experimental system. Disorder effects on the so-called Andreev band in Majorana nanowires Haining Pan ==================================================================== We point out that the so-called Andreev band physics in Majorana nanowires considered in the recent work <cit.> is unrealistic, contrived, and finetuned, and, in addition, any realistic consideration of disorder suppresses the effects discussed in the work. In particular, Ref. hess2023trivial introduces an Andreev band into the bulk nanowire by putting in an artificial and unrealistic periodic (see Fig. 1 in <cit.>) array of superconducting gap and/or Zeeman splitting throughout the nanowire, which then results in a seeming closing/opening of a gap-like (trivial, i.e., nontopological) structure in the nonlocal tunneling conductance measured across the wire ends. In addition, Ref. hess2023trivial also introduces another feature in the local tunneling by hand, leading to a zero bias conductance peak (ZBCP) in the tunneling spectroscopy. These two unrealistic and finetuned artifices together were claimed to cast doubts on the accepted methodology of using the local and nonlocal tunneling spectroscopies together <cit.> [cite the original Delft paper and our paper and the MSFT experiment here] to ascertain the existence or not of topological Majorana zero modes (MZMs) in nanowires. It is well-established that Majorana nanowires are dominated by random unintentional disorder <cit.>, [ cite our good/bad/ugly, Das Sarma-Pan PRB, Ahn et al,] and the artificial finetuned Andreev band results presented in <cit.> are suppressed by disorder. We show this in our calculated representative results shown in Fig. <ref>, where we depict, following <cit.>, the Andreev band results for a periodic array of varying g-factor in the bulk nanowire in the presence of potential disorder (along with quantum dots at the ends in order to produce ZBCPs <cit.>). We note that the finetuned artificial features of the contrived periodic pristine system emphasized in <cit.> disappear in the presence of realistic potential disorder. We conclude by asserting that the results/conclusions in Ref. hess2023trivial are both contrived (because of the ad hoc introduction of an Andreev band by hand using an unphysical periodic structure) and misleading (because of the neglect of bulk disorder), and have no implications for any experimental results in actual Majorana nanowires including the recent results in <cit.> [ Ref; MSFT experiment], which we have analyzed in great depth using disordered nanowire models elsewhere <cit.>. [cite our two recent arXiv papers]
http://arxiv.org/abs/2306.08026v1	20230613180000	Mapping and Probing Froggatt-Nielsen Solutions to the Quark Flavor Puzzle	[ "Claudia Cornella", "David Curtin", "Ethan T. Neil", "Jedidiah O. Thompson" ]	hep-ph	[ "hep-ph" ]	MITP-23-026 [email protected] [email protected] [email protected] [email protected] ^a PRISMA^+ Cluster of Excellence & MITP, Johannes Gutenberg University, 55099 Mainz, Germany ^b Department of Physics, University of Toronto, Toronto, ON M5S 1A7, Canada ^cDepartment of Physics, University of Colorado, Boulder, CO 80309, USA ^dStanford Institute for Theoretical Phyiscs, Stanford University, Stanford, CA 94305, USA The Froggatt-Nielsen (FN) mechanism is an elegant solution to the flavor problem. In its minimal application to the quark sector, the different quark types and generations have different charges under a U(1)_X flavor symmetry. The SM Yukawa couplings are generated below the flavor breaking scale with hierarchies dictated by the quark charge assignments. Only a handful of charge assignments are generally considered in the literature. We analyze the complete space of possible charge assignments with \|X_q_i\| ≤ 4 and perform both a set of Bayesian-inspired numerical scans and an analytical spurion analysis to identify those charge assignments that reliably generate SM-like quark mass and mixing hierarchies. The resulting set of top-20 flavor charge assignments significantly enlarges the viable space of FN models but is still compact enough to enable focused phenomenological study. We demonstrate that these distinct charge assignments result in the generation of flavor-violating four-quark operators characterized by significantly varied strengths, potentially differing substantially from the possibilities previously explored in the literature. Future precision measurement of quark flavor violating observables may therefore enable us to distinguish among otherwise equally plausible FN charges, thus shedding light on the UV structure of the flavor sector. Mapping and Probing Froggatt-Nielsen Solutions to the Quark Flavor Puzzle Jedidiah O. Thompson^d June 13, 2023 ========================================================================= § INTRODUCTION The possible origin of the wide and varying hierarchies amongst the quark and lepton masses and mixing angles has long invited speculation. While such disparate Lagrangian parameters are technically natural for fermions, the fact that the three matter generations appear identical in all other respects calls for a dynamical explanation of this so-called flavor puzzle. A common strategy is to describe these patterns in terms of an approximate flavor symmetry, a subgroup of U(3)^5, whose breaking yields the observed masses and mixing angles. Historically, the first attempt in this direction was made by Froggatt and Nielsen in 1978 <cit.>. This strategy, expanded in <cit.>, became known as the Froggatt-Nielsen (FN) mechanism (see e.g. Ref. <cit.> for a modern review). In its simplest form, this mechanism relies on the introduction of a U(1)_X symmetry under which fermions of different generations have different charges. This symmetry is broken at some high “flavor scale” Λ_F by the vacuum expectation value (vev) of a SM-singlet scalar ϕ, often referred to as the flavon. The SM Yukawa couplings are then generated as effective operators suppressed by factors (⟨ϕ⟩/Λ_F)^n = ϵ^n, where ϵ≲ 0.1 and n is determined by the U(1)_X charges of the Higgs and the respective fermions. Assuming that these operators are generated in the UV completion of the model through heavy particle exchange with presumably 𝒪(1) coefficients (see e.g. Refs. <cit.>), the hierarchies of the Yukawa couplings in the flavor basis are generated by the U(1)_X charge assignments of the SM fields and the flavon vev relative to the UV scale, ϵ. FN models have been extremely well studied over the last decades (see e.g. Refs. <cit.>), but curiously, the vast literature only considered very few choices of the flavor symmetry charge assignments for the SM fields. The studied scenarios typically identify ϵ with the Cabibbo angle of the Cabibbo-Kobayashi-Maskawa (CKM) matrix and perform a spurion analysis to find a solution for the required fermion charges. The selection of these charges carries important phenomenological implications, since FN models have a variety of experimental signatures at low energies – most obviously various flavor-changing processes – the details of which depend on the exact charge assignment chosen. In FN models of the quark sector typically discussed in the literature, flavor-changing neutral current (FCNC) constraints involving the light generations bound the flavor scale to be above Λ_F ≳ 10-100 PeV <cit.>. This makes FN models (like most solutions to the flavor puzzle relying on a single flavor scale Λ_F) notoriously hard to probe experimentally. However, the next decades may see significant advances in our ability to probe flavor violation beyond the SM, whether with new data from on-going experiments (most notably LHCb and Belle II), concrete proposals for future high-energy colliders <cit.>, the hypothetical possibility of future flavor factories, or theoretical advances to improve the precision of SM predictions for experimentally well-measured processes. It is thus pertinent to investigate whether experimental insights can be gained regarding FN models in the foreseeable future, despite their characteristic high energy scale. In this paper, we perform the first step in such a model-exhaustive program by identifying the most general “theory space” of natural FN models with a single Higgs field that can address the SM flavor problem. As pointed out in Ref. <cit.>, flavor charge assignments beyond the few canonical choices can generate close matches to the SM, seemingly with natural 𝒪(1) choices for the various coefficients. Inspired by this observation, our analysis considers all possible flavor charge assignments up to \|X_q\| ≤ 4 in a FN setup restricted to the quark sector, then performs numerical scans over natural 𝒪(1) choices of all the Yukawa coefficients, to determine in a maximally agnostic and general fashion which charge assignments and flavon vevs can generate “SM-like” quark masses and mixings. We find that the space of fully natural FN models is much larger than previously understood in the literature, including at least several dozen models depending on the precise interpretation of our results. Unlike previous analyses, we select the “SM-like” choices in a Bayesian-inspired fashion without explicitly fitting to the SM. We believe this more accurately reflects the intended spirit of the FN solution, that the SM hierarchies should emerge “naturally.” Reassuringly, we do find that the SM-like FN setups easily yield many stable exact fits to the SM, and that our numerical results can be understood in the context of an analytical spurion analysis that assumes small rotations between the flavor- and mass-bases. With this natural theory space of viable FN models now defined, we then perform a toy-demonstration of their phenomenological significance by estimating the size of various flavor-violating dimension-6 SMEFT operators in each model and comparing their size to current constraints. This not only demonstrates that distinct charge assignments or “textures” (these terms are used interchangeably hereafter) yield varying predictions for flavor-violating observables, but it also provides insights into the specific observables that are most effective in discerning between different FN solutions to the flavor puzzle in the future. It is our hope that this kind of analysis can be helpful for future studies of flavor physics, including SMEFT global fits, by providing a “theoretical lamp post” that can direct attention on the most well-motivated parts of the vast landscape of FN models and flavor observables. This paper is structured as follows. In Section <ref> we briefly review the Froggatt-Nielsen mechanism. The numerical analysis of all possible FN models with \|X_q\| ≤ 4 is presented in Section <ref>. The results of this analysis are corroborated by an analytical spurion analysis in Section <ref>. Some phenomenological implications are sketched out in Section <ref>, and we conclude in Section <ref>. Details on SM fits, a custom tuning measure appropriate for FN models, and a variety of necessary statistical checks are collected in the Appendices. § REVIEW OF THE FROGGATT-NIELSEN MECHANISM In this Section we briefly review the Froggatt-Nielsen mechanism in its minimal form. Our treatment and notation parallels closely that of Ref. <cit.>. As stated in the introduction, the FN mechanism consists of adding a new U(1)_X global flavor symmetry to the SM, along with a scalar field ϕ whose vev spontaneously breaks this symmetry. Without loss of generality we take X_ϕ = 1, X_H = 0 and the vev of ϕ to be in the positive real direction, ⟨ϕ\|=⟩⟨ϕ\|^⟩† = ϵΛ_F, where Λ_F is the characteristic scale of spontaneous symmetry breaking. SM matter fields are then assigned U(1)_X charges, forcing the scalar to appear in the SM Yukawa couplings in order to preserve the symmetry. We denote the left-handed quark doublets as Q_i and the right-handed up- and down-quark singlets u_i and d_i, where i = 1, 2, 3 is an index running over the fermion families. The quark mass terms in the low-energy SM effective field theory then take the form: ℒ_Y ⊃ - c_i j^u Q̅_i H u_j ϵ^\|X_Q_i - X_u_j\| - c_i j^d Q̅_i H d_j ϵ^\|X_Q_i - X_d_j\| + h.c. where H is the SM Higgs doublet, and c^u,d are arbitrary 3 × 3 complex matrices with (presumably) 𝒪(1) entries. Comparing Eq. <ref> to the usual SM Yukawa Lagrangian ℒ_SM⊃ - Y_i j^u Q̅_i H u_j - Y_i j^d Q̅_i H d_j + h.c. , we can read off the Yukawa matrices in terms of the FN parameters: Y^u_i j = c^u_i jϵ^n^u_ij , Y^d_i j = c^d_i jϵ^n^d_ij , where n^u_i j = \|X_Q_i - X_u_j\| , n^d_ij = \|X_Q_i - X_d_j\| . From this expression it is clear that, if ϵ≪ 1, the SM Yukawa couplings can exhibit large hierarchies even if all entries of the coefficient matrices c^u,d are 𝒪(1). These can be related to observable quantities – the quark masses and mixing angles – by performing unitary flavor rotations of the quark fields. Upon performing such rotations, the Yukawa Lagrangian can be written in the mass eigenstate basis, or in the so-called “up-basis": ℒ_SM⊃ - Ŷ_i j^u Q̅_i H u_j + (V_CKMŶ^d)_i jQ̅_i H d_j + h.c. , (analogously for the “down-basis”) where is the CKM matrix and Ŷ^u/d are real, diagonal matrices, whose eigenvalues are related to the quark masses via y_q ≡√(2) m_q/v_H, with m_q and v_H being the mass of the quark q and the Higgs vev, respectively. § SYSTEMATIC EXPLORATION OF FROGGATT-NIELSEN MODELS We consider all possible charge assignments with \|X\| ≤ 4 for all SM quarks. Since y_t ≈ 1, baryon number is conserved, and permutations of the quark fields do not constitute a physical difference between FN models, we can set X_q_3=X_u_3=0 and adopt the ordering convention that \|X_Q_i\| ≥ \|X_Q_j\| for i < j when all X_Q have the same sign, otherwise X_Q_i≥ X_Q_j. (Similarly for X_u, or X_d.) In addition, following <cit.> we remove “mirror” charges which are related by multiplying all of the charges X by -1 (and then enforcing the above ordering convention). This gives a total of 167,125 charge assignments that are physically inequivalent in the IR. We now wish to assess these textures based on how “typical” it is for them to reproduce the flavor hierarchies of the SM. Given a certain charge assignment X={ X_Q, X_u, X_d }, we randomly draw some large number of 𝒪(1) complex coefficient matrices c^u,d (details discussed below) and calculate the SM parameters for each instance of c^u,d as a function of ϵ. For a given choice of ϵ, we can then calculate the observable with the maximum fractional deviation from its SM value: = max_iexp\| ln( μ_i^guess/μ_i^SM) \| , where μ_i ranges over the six quark masses, the three independent CKM entries \|V_12\|, \|V_13\|, and \|V_23\|, and the absolute value of the Jarlskog invariant \|J\|. The precise numerical values we use can be found in Table <ref> in Appendix <ref>. Since ϵ plays the central role of generating the overall hierarchy, we minimize with respect to ϵ for each instance of the c^u,d coefficient matrices to match as closely as possible the SM values. After repeating this process for each charge assignment X, we define ℱ_2 (ℱ_5) as the fraction of random coefficient choices that yields ≤ 2 (5) for each model. This allows us to define “global naturalness criteria” (i.e. independent of a particular fit to the SM) for a given texture to be a good candidate for reproducing the SM hierarchies, namely requiring that ℱ_2 or ℱ_5 be above some lower bound. Out of the total 167,125 possible charge assignments, we only find about 10 for which ℱ_2 ≳ 1%. We adopt the latter criterion as the most stringent measure of naturalness for a texture to solve the SM quark flavor problem, and show the top-20 possible charge assignemnts ranked by ℱ_2 in Table <ref>.We also show the average value of ϵ for each texture. The distribution of preferred ϵ values is very narrow, indicating that each texture has a uniquely suited value of ⟨ϕ⟩/Λ_F to reproduce the SM. Some of these good textures correspond to those identified already in the literature, but, to the best of our knowledge, most of them have not been considered before.[Texture 3 first appeared in the seminal papers <cit.>.] This is quite remarkable, given how similarly they all naturally generate SM-like mass and mixing hierarchies. Textures where all quark masses and CKM entries lie within a factor of 5 of their measured SM values are even more common, with about 430 textures satisfying ℱ_5 ≳ 10%. This constitutes a large collection of textures that are well-motivated in this model-independent way. The complete ranking of these textures is included in the file provided in the auxiliary material.[Note that because the auxiliary file is rank ordered by ℱ_5, it does not match the order given in Table <ref>, and the precise ordering of textures with very similar values of ℱ_5 (or ℱ_2) is subject to small numerical fluctuations.] As mentioned above, to understand how close a texture generically is to the SM, we may look at the distribution of values for a given texture over many different random choices of the c^u,d matrices. In Fig. <ref>, we show such a distribution for the top texture from Table <ref>. As we can see, the distribution is clustered around ∼ 4 with broad tails on either side, indicating that this texture generically results in physical parameters with the proper SM-like hierarchies regardless of the 𝒪(1) coefficients c^u,d. Of course getting the precise SM values requires a precise choice of these coefficients, but the hierarchies themselves are robust. We may also look at such a distribution for a charge assignment that does not perform well by this metric. This category includes many textures previously mentioned in the literature, including for example most of the textures listed in Tables 1 and 2 of Ref. <cit.>. The third texture in Table 2 of <cit.> results in the distribution for shown in Fig. <ref>. It is quite reasonable to ask why these textures show up as good in that analysis but not ours, and the answer is simple: Ref. <cit.> searches for textures for which there is at least one technically natural choice of c^u,d coefficients that approximately reproduces the SM, whereas we look for textures which generically produce SM-like hierarchies. With random 𝒪(1) coefficient matrices, a texture like that of Fig. <ref> results in a typical deviation from SM parameters of more than an order of magnitude, but there does exist a very special choice of c^u,d∼𝒪(1) that results in the SM. This choice of coefficients may be technically natural but it is still exceedingly rare, as Fig. <ref> shows. The difference thus stems from our “global” choice of metric for naturalness, which prioritizes textures that can lead to SM-like parameters without need for additional dynamics or precise restrictions on the coefficients. To verify that our global naturalness criterion also produces viable and “locally natural” solutions to the SM flavor problem, we also have to check that each of the textures in Table <ref> yields exact and untuned numerical fits to the SM, including uncertainty on the SM parameters. This necessitates the definition of a custom tuning measure that is more appropriate for FN models than standard choices like the Barbieri-Giudice measure <cit.>, taking into account that any change in the UV theory would likely perturb all coefficients in Eq. <ref> at once, rather than one at a time. The details are in Appendix <ref>, but the upshot is that each of the textures in Table <ref> readily yields many good SM fits that are completely untuned with respect to simultaneous random uncorrelated perturbations of all coupling coefficients. This confirms that our global naturalness criterion guarantees particular technically natural solutions to the SM flavor problem as well. We perform several statistical checks to make sure our conclusions are robust. The results obtained here depend on the details of the statistical distributions from which we draw the coefficients in the c^u,d matrices. Taking a Bayesian-inspired point of view, these distributions can be thought of as prior probability distributions for the c^u,d coefficients. For the analysis shown here, we use a “log-normal” prior in which the logarithm of the magnitude of each c^u,d entry is drawn from a Gaussian distribution. We have repeated the same analysis for a wider log-normal distribution, and a third “uniform” prior, in which the real and imaginary parts of each c^u,d are drawn uniformly from the range [-3,3]. Up to modest reorderings in our ranked list of top textures, our results are robust with respect to changing the prior. We also confirm that the SM-like hierarchies for our good textures are robustly determined by the flavor charges and the small ϵ rather than anomalous hierarchies amongst the randomly drawn c^u,d coefficients, and that individual SM observables are roughly uncorrelated and drawn from a distribution roughly centered on the correct SM value for each good texture. For details, see Appendix <ref>. § ANALYTICAL SPURION ANALYSIS Our numerical study identified many new plausible FN textures beyond those that have been studied in the literature. It would be useful to understand analytically why the textures in Table <ref> reliably yield SM-like hierarchies. If viable FN models involve no large rotations between the flavor- and the mass-basis, then it is possible to estimate masses and mixings via an analytical spurion analysis. We can easily test this assumption. In general, the flavor-basis Yukawa matrix Y^u (identically for Y^d) can be related to the diagonal mass-basis Yukawa Ŷ^u via the usual singular value decomposition Y^u = U_u Ŷ^u W_u^†. Under the near-aligned assumption, and adopting the strict ordering of charges defined at the beginning of Section <ref>, the mass-basis Yukawa couplings are simply given by Ŷ^u_ij∼ϵ^n^u_iiδ_ij where the exponent matrices n^u,d are defined terms of the X_Q,u,d charges in Eq. <ref>. Under the same strict assumptions,[Eq. <ref> does not apply for flavor charge assignments where the heaviest up and down quarks are not in the same generation, but those are irrelevant for our analysis.] the magnitudes of the elements of the rotation matrices can be written as (U_u)_ij ∼ {[ 1 i = j; ϵ^n^u_ij - n^u_jj i < j; ϵ^n^u_ji - n^u_ii i > j ]. (W_u)_ij ∼ {[ 1 i = j; ϵ^n^u_ji - n^u_jj i < j; ϵ^n^u_ij - n^u_ii i > j ]. . This makes it straightforward to obtain magnitude estimates for the elements of V_CKM = U_u^† U_d.[ For about half of the textures in Table <ref>, this yields V_CKM estimates that follow the Wolfenstein parameterization (with λ→ϵ), while the other half show slight deviations from this pattern.] For a given FN charge assignment and choice of ϵ, we can now compute the spurion estimate μ_i^spurion for i = each of the six quark masses and \|V_CKM\|_12,23,13. To assess how SM-like a given FN charge assignment is, we consider the logs of the ratios by which these estimates deviate from the SM, added in quadrature, d = [ ∑_i log_10^2 ( μ_i^spurion/μ_i^SM) ]^1/2 , with ϵ chosen to minimize d. This measure always takes all SM observables into account and is more appropriate for the approximate nature of the spurion analysis than Eq. <ref>. We would expect that FN textures that naturally give a good fit to the SM would satisfy d ≲𝒪(1). Indeed, we find that all the textures in Table <ref> satisfy d < 2.4. Of all 167,125 possible charge assignments, there are only 36 additional possibilities that also satisfy this criterion, and all of them are in the top 160 of our ranked list of textures obtained in the numerical analysis of the previous section. This analytical spurion estimate is therefore fully consistent with our full numerical study, which gives us additional confidence that the global naturalness criterion derived in our numerical study is theoretically plausible. Furthermore, this convergent result confirms the expectation that natural FN models always feature a high degree of alignment between the flavor and the mass bases.[This was confirmed in the numerical analysis, where coefficient choices with small values of for textures in Table <ref> always feature small mixing angles in U_u,d, W_u,d.] Obviously, the specific d < 2.4 criterion was derived a posteriori from the results of the numerical study, but if one were to guess at a reasonable upper bound for d that natural SM-like FN models must satisfy, a number like d < 3 might plausibly come to mind, which yields a still very modest total of 149 textures (including the top 20). As with any such definition, the cutoff for what constitutes a natural model is somewhat arbitrary, and if one wants to make quantitative statements the fully numerical approach of the previous section is necessary. However, it is interesting to note that the numerical study was not necessary to make the much more important qualitative observation that there are many different FN charge assignments, of the order of several dozen at least, that very naturally give SM-like hierarchies. The crucial ingredient is merely to formulate a well-defined and general criterion and check it across all possible flavor charges. § PHENOMENOLOGICAL IMPLICATIONS Flavor-violating effects are the most relevant experimental signatures of FN models. At low energies these can be effectively parameterized within the framework of Standard Model Effective Field Theory (SMEFT). Our focus here lies on examining 4-fermion operators of the form 𝒪 = 1/Λ_eff^2 (q̅_i q_j)(q̅_k q_l) where i,j,k,l denote different quark flavors, and q can represent either Q, d or u type quarks. While semi-leptonic and fully leptonic 4-fermion operators can also be generated, 4-quark operators are most important for our discussion, given that we assign FN charges only to the quarks. (For the sake of simplicity, Dirac structures as well as Lorentz and group indices are left implicit.) We can estimate the size of these operators using a spurion analysis analogous to the estimates for SM quantities in the last section. In the “FN flavor basis” of Eq. <ref>, where flavor charges are well-defined for each quark generation, the leading contribution to the coefficient of this operator will take the form 1/Λ_eff^2 = c_𝒪ϵ^\|-X_q_i + X_q_j - X_q_k + X_q_l\|/Λ_F^2 . where Λ_F is the UV scale of the model (with ϵ = ⟨ϕ⟩/Λ_F), and c_𝒪 is an unknown dimensionless complex coefficient. For FN models that satisfy our global naturalness criterion, it is plausible to expect the different coefficients c_𝒪 to be relatively uncorrelated and have modest 𝒪(1) sizes.[Support for this assumption can be derived from the near-uncorrelated near-log-normal distributions of the individual SM observables in our numerical scans, see Fig. <ref> in Appendix <ref>. It is plausible to expect other observables to behave similarly.] The `SM-like' FN textures we find and list in Table <ref> are equivalently suitable for generating the SM quark Yukawa coupling matrices. However, they predict quite disparate flavor-violating signatures, and future measurements hold the potential to not only detect these non-standard flavor violating-effects but also distinguish between possible natural flavor textures. Such investigations could provide valuable insights into unraveling the true structure of the flavor sector. To demonstrate these parametric differences quantitatively, we work in the Warsaw basis <cit.> and obtain bounds on the 4-quark-operator Wilson coefficients using the global likelihood implemented in the Python package <cit.>. For simplicity, we only turn on one operator at a time (since we merely want to demonstrate the significant differences between different FN charge assignments), and take the bound on Λ_eff for each operator to correspond to the most constraining bound obtained by turning the operator on with purely real or imaginary positive or negative coefficient. Since c_𝒪 is likely to have a “random phase” in the FN model, this is the most conservative assumption for our demonstration. Some care must be taken to obtain physically consistent results from this spurion estimate for 4-quark operators. supplies bounds in the down-aligned (or up-aligned) interaction basis, where the right-handed u,d fields are rotated using the W_u,d matrices estimated in Eq. <ref>, while Q is rotated using U_d (U_u). As a result, u_R, d_R and d_L (u_L) are mass eigenstates, while the u_L (d_L) fields are rotated by V_CKM with respect to their mass eigenstate basis. This obviously results in bounds on operator coefficients being different in the up- and down-aligned basis, simply because the make-up of each 4-Fermi operator in terms of quark-mass-basis operators is different. In an exact numerical analysis of FN models — where for a given FN charge assignment one might choose random c_ij^u,d restricted to give good fits to SM masses and mixings; then consider random numerical trial values for the c_𝒪's in the FN flavor basis; and finally perform exact rotations into the up- or down-aligned basis — the resulting bounds on c_𝒪/Λ_F^2 in the FN flavor basis would be exactly equivalent in the two bases. However, in our parametric spurion estimates, while it seems one could use the transformation matrix estimates of Eq. <ref> to obtain 4-Fermi operator estimates in the up- or down-aligned bases, in reality this fails to reliably capture differences between the operator definitions at sub-leading order in ϵ. Differences between the two bases enter exactly at this order, but this still results in large differences in the numerical bounds on operator coefficients, since in some cases the leading bound on an up- or down-basis operator comes from a mass-basis contribution to that operator that is sub-leading in CKM mixing angles, but can nonetheless supply the dominant bound due to the severity of the corresponding physical constraint. Fortunately, the important effects that are CKM-suppressed in the up-aligned basis are leading-order in the down-aligned basis, and vice versa. Furthermore, the close alignment between the FN flavor basis, up-aligned basis, down-aligned basis and mass-basis (evident from the near-diagonal nature of the U_u,d, W_u,d in Eq. <ref>) means that the FN flavor basis predictions of Eq.<ref> apply, to leading order in ϵ, in the up- and down-aligned bases as well. Taking these two observations together, we find that we can obtain physically consistent parametric estimates of the bounds on c_𝒪/Λ_F^2 in the FN flavor basis by comparing the predictions of Eq.<ref> to the constraints supplied by in both the up- and down-aligned basis, and simply adopting the stronger of the two bounds for that operator. We find that all textures in Table <ref> are constrained to have a flavor scale Λ_F ≳ 40 - 100 PeV.[Specifically, the bound is 35-45 PeV for textures # 2, 3, 5, 7, 12, 14, 19 in Table <ref>, and 95 PeV for the rest.] Setting Λ_F = 100 PeV for all textures, we show in Fig. <ref> the relative size of some operators compared to their current bound, for a subset of operators with predicted size not too far from current constraints. The operators which dominate the bound on Λ_F are , , , , which also show the least variation between textures. However, there is a large degree of variation amongst the other operators with predictions that are a factor of ≳ 10 beyond current bounds. Four textures have been highlighted to showcase this variation in the prediction of various flavor-violating quark operators: the top texture #1 in red, the “original” FN texture <cit.> #3 in green, and two others, #7 and #18, in blue and orange. Note that each prediction has a “theoretical uncertainty” of 𝒪(1) in this plot, due to the unknown size of the c_𝒪 coefficients. To further emphasize the differences in the relative predictions for flavor-violating quark operators, rather than different overall suppression of flavor-violating effects, Figure <ref> shows the predictions for a subset of operators where the flavor scale has been set to its current bound separately for each texture. We do not show the four operators , which dominate the Λ_F bound and have similar predictions for all considered textures, but we now show some additional operators that display large variation between textures under these new assumptions. This explicitly demonstrates that if a given non-SM flavor-violating effect were found (setting the absolute size of some flavor-violating operators), the resulting predictions for the other flavor-violating operators would differ widely amongst equally natural FN models. Unsurprisingly, the observables that drive the bound on these most “distinguishing” coefficients are those related to quark flavor mixing in the 1-2 sector, in particular to the imaginary part of the D-D̅ and K-K̅ mixing amplitudes, encoded in x_12sinϕ_12 and ϵ_K, respectively[For the experimental value ϵ_K we use the PDG <cit.>. For CP violation in the charm system we use HFLAV results <cit.>.]. For kaon mixing, the current bottleneck preventing tighter constraints is the uncertainty in the SM prediction for ϵ_K. Future improvements may be possible, but are hard to predict. On the other hand, a significant improvement is expected in the experimental determination of the parameters describing CP violation in D-D̅ oscillations. In particular, the uncertainty on the imaginary part of the amplitude is expected to shrink at least of a factor 5 at the end of Upgrade II of the LHCb experiment <cit.>. There has also been significant recent work on global SMEFT fits under certain flavor violating hypotheses (see e.g. <cit.>). Our menu of natural FN models is a natural candidate for future analyses of this kind, which may yet yield unexpected constraints on particular models considered in a global fit. § CONCLUSIONS The flavor puzzle is a vexing mystery of the Standard Model, with the pattern of the fermion mass matrices hinting at the presence of a deeper structure. Directly probing the mechanisms that generate this structure is difficult, as tight constraints on flavor violation usually push the relevant scale of flavor physics to very high values far beyond our ability to probe directly in the intermediate future. Even so, the advent of future experiments makes direct or indirect detection and diagnosis of this underlying flavor structure an enticing prospect. Our work provides a theoretical roadmap to help navigate the potentially vast space of Froggatt-Nielsen solutions to the quark flavor problem. It dramatically enlarges the space of viable charge assignments compared to what has been studied in the literature, but our global criterion of naturally generating the SM mass and mixing hierarchies across the model's whole parameter space is still constraining enough to net a manageable number of FN models, see Table <ref>. We showed that this well-defined subset of FN benchmark models generates a variety of different flavor-violating operators within the SMEFT framework, with widely varying magnitudes depending on the flavor charge assignments. In principle this makes diagnosing the solution to the quark flavor problem plausible once flavor-violating signals beyond the SM expectation are unambiguously observed. Global SMEFT fits that assume a particular FN model can be even more constraining <cit.>, and it would be interesting to conduct such fits for each of the natural FN models we identify in Table <ref> for well-defined priors on the unknown 𝒪(1) coefficients of the model. Our method of finding natural FN models naturally generalizes to FN models of the lepton sector, or non-minimal setups with multiple or non-abelian flavor symmetries <cit.>. This may suggest further flavor-violating observables that have the most promise of detecting and diagnosing the physics of the flavor puzzle. It may also be interesting to study the impact of our work on dark sectors that are related to the SM via a discrete symmetry <cit.>. We leave such investigations for future work. It is a pleasure to thank Savas Dimopoulos, Marco Fedele, Christophe Grojean, Anson Hook, Seyda Ipek, Junwu Huang, Yael Shadmi, Peter Stangl, Ben Stefanek, Patrick Owen, Alan Schwartz and Gudrun Hiller for valuable discussions. CC, DC and JOT would like to thank Perimeter Institute for hospitality during the completion of this work. This research was supported in part by Perimeter Institute for Theoretical Physics. Research at Perimeter Institute is supported by the Government of Canada through the Department of Innovation, Science and Economic Development and by the Province of Ontario through the Ministry of Research, Innovation and Science. The research of CC was supported by the Cluster of Excellence Precision Physics, Fundamental Interactions, and Structure of Matter (PRISMA^+, EXC 2118/1) within the German Excellence Strategy (Project-ID 39083149). The research of DC was supported in part by a Discovery Grant from the Natural Sciences and Engineering Research Council of Canada, the Canada Research Chair program, the Alfred P. Sloan Foundation, the Ontario Early Researcher Award, and the University of Toronto McLean Award. The research of ETN was supported by the U. S. Department of Energy (DOE), Office of Science, Office of High Energy Physics, under Award Number DE-SC0010005. § STANDARD MODEL FITS AND TUNING In this appendix we present details on finding solutions for the coefficients c_ij^u,d in Eq. <ref> that represent realistic SM fits within experimental uncertainties for the quark masses and mixings, see Table <ref>, for each of the FN charge assignments in Table <ref>. In order to obtain SM fits, we used a simplex minimization algorithm to adjust the coefficients c_ij^u,d and the parameter ϵ in order to optimize the standard χ^2 score, χ^2_ SM = ∑_i ( μ_i - μ_i^ SM/σ_i^ SM)^2 where as in Sec. <ref> the index i runs over all of the SM quark masses, three CKM mixing angles, and \|J\|. For all of the textures in Table <ref>, we are able to find fits with average deviation of less that 2σ over all 10 parameters that we fit to; we were further able to find fits with average deviation less than 1σ for more than half of the textures in the table, including all of the top 5. We have further verified that for these fits, the values of the coefficients c_ij^u,d do not have a significantly different distribution than the prior used to generate the same coefficients for our numerical scans, indicating that the fits do not require any substantial drift away from our 𝒪(1) assumption. Our final check is to verify that these fits are not locally tuned. A standard tuning test is the Barbieri-Giudice measure <cit.>, which for a single SM observable 𝒪_K can be defined as: Δ_BG^K ≡max_k \|δ_K,k\| , δ_K,k≡δlog𝒪_K/δlog c_k , where c_k runs separately over the real and imaginary parts of each of the c_ij^u,d coefficients defined in Eq. <ref>. A second maximization then gives the overall tuning taking into account all fitted SM observables: Δ_BG≡max_KΔ_BG^K . This basically represents the maximum sensitivity of all the 10 SM observables 𝒪_K with respect perturbing any single one of the 18 complex coefficients c_ij^u,d. However, we argue that for Froggatt-Nielsen models and their many coefficients, which arise from some UV theory, this tuning measure is of limited utility, since a small change in the UV theory would slightly change all the coefficients at once, not just one at a time. Indeed, if random small permutations of some characteristic size are applied to all c_ij^u,d coefficients of a given SM fit, we numerically find that Δ_BG^K generally significantly underestimates the variance of a given SM observable 𝒪_K. In other words, for FN models, the Barbieri-Giudice measure underestimates tuning. Some way of assessing this total sensitivity is required. We therefore define the following tuning measure for each SM observable 𝒪_K: Δ_tot^K ≡[ ∑_s (λ^K_s)^2 ]^1/2 where the λ_s^K are the eigenvalues of the matrix Δ_kl^K defined as Δ_kl^K ≡δ^2 log𝒪_K/δlog c_k δlog c_l and c_k runs over the real and imaginary parts of all c_ij^u,d coefficients as above. It is easy to see that this quantity could give a more complete account of the tuning of a given SM fit, since the sum in quadrature over the principal directions of Δ_kl^K takes into account the total variability of SM observable 𝒪_K, regardless of whether the direction of maximum sensitivity is aligned with any one c_ij^u,d, which is appropriate when perturbing all coefficients at once. Indeed, when varying all coefficients by random perturbations of characteristic relative scale σ, we find that Δ^K_totσ gives a very good direct estimate of the resulting relative variance of 𝒪_K. This supports the argument that Δ_tot^K is a more faithful measure of sensitivity to changes in the underlying UV theory of a FN model, and an overall tuning measure for the whole SM fit can be obtained by summing in quadrature over all SM observables: Δ_tot = [ ∑_K (Δ_tot^K)^2]^1/2 We find that it is generally easy to find SM fits for the top-20 textures in Table <ref> that have Δ_tot≲ a few, proving that these solutions to the SM flavor problem are truly untuned with respect to the underlying details of the UV theory. Informally, we notice that there seems to be a trend that the Δ_tot of an average SM fit increases modestly for lower-ranked textures in Table <ref>. While further study would be required to solidify this relationship, it provides further suggestive evidence that our global naturalness criterion of ranking textures by their ℱ_2 or ℱ_5 fractions is the fundamental measure of how SM-like a texture wants to be, and how natural any SM fits are that do exist. § DEPENDENCE ON PRIOR DISTRIBUTIONS AND STATISTICAL CHECKS In this appendix we collect the details of the prior distributions and statistical measures we use in our analysis. Because one of the main products of this paper is a collection of “statistically good” textures, i.e. a collection of textures which do a good job of reproducing SM-like hierarchies for somewhat arbitrary 𝒪(1) Yukawa coefficients c^u,d, it is important to understand how much these results depend on our priors for these coefficients. While we do find that the precise numbers claimed here depend on this distribution, our derived list of good textures is robust with respect to the exact choice of prior for the coefficients, up to some minor reordering. For all results shown in the main body of this paper, our numerical scan generated the entries of c^u,d as follows: for each coefficient independently, a magnitude was drawn from a log normal distribution centered around 1 with a standard deviation of ln 10^0.3 (to enforce that all coefficients in the matrix be 𝒪(1)), and a phase was drawn from a flat distribution between 0 and 2 π. This choice yields the results shown in Table <ref>, namely that there are a few textures for which 𝒪(2%) of randomly generated coefficients yield quark masses and CKM elements within a factor of 2 of their SM values, and 𝒪(50%) yield parameters within a factor of 5. In order to check that this list is robust to other choices of distribution, we ran two other scans for all charge assignments: * A “wider log-normal” scan where we drew the c^u,d coefficients with a uniform distribution in phase and a log-normal distribution in magnitude centered on 0 and with a standard deviation of ln 10^0.6. * A “uniform flat” scan where we drew the real and imaginary parts of each entry of c^u,d separately from uniform flat distributions between -3 and 3. The lists of the top 10 textures (ranked by the fraction ℱ_2 within a factor of 2 of the SM value) for each of these scans are given in Tables <ref> and <ref>. We can see that the rough list and ordering of textures in the top 5 is not significantly changed by any of these choices, so we conclude that this data is robust to changes of distribution (provided all entries of c^u,d be 𝒪(1)). Another reasonable concern that one may have about these results is whether the observed hierarchies are primarily coming from the texture choice. Our prior distribution for c^u,d is chosen to result in 𝒪(1) coefficients, but there can still be anomalously hierarchical draws from this distribution, and it is possible that there are textures in which it is precisely these anomalously hierarchical draws that give results closer to the SM. To test this, we construct a measure of how hierarchical a particular choice of coefficients c^u,d is with respect to a given prior distribution. Namely, we define η≡log_10max_i,j \| c^u/d_i j \|/min_i,j \| c^u/d_i j \|. Given a distribution on the individual coefficients we can construct the distribution of η and find a measure of how anomalously hierarchical a particular choice of c^u,d are. For the textures displayed in Table <ref>, there is generally very little correlation with how anomalously high or low η is and how good of a fit the coefficients are to the SM (quantified by the smallness of ). For example, the cross-correlation of these two parameters for our best texture is shown in Fig. <ref>. We take this as evidence that the observed hierarchies in the good textures are driven almost entirely by the textures themselves rather than the Yukawa coefficient matrices. For a given texture, we can also construct histograms of the individual quark masses and CKM elements to verify that the texture predicts all of them to be approximately their SM values. We do this by generating many random choices of c^u,d, varying ϵ to minimize for each choice of c^u,d, and then plotting the resulting distributions of the quark masses and CKM elements. As an example, in Fig. <ref> we show the distributions for the individual parameters for our best-performing texture in Table <ref>. We have checked these distributions for all textures listed in Table <ref> and we find that all parameter distributions are centered within a factor of a few of the true SM values. We have also checked the cross-correlations between these parameters for the best textures listed in Table <ref>, and they are relatively mild, meaning that each parameter behaves approximately as if it were drawn independently from a distribution of the type shown in Fig. <ref>.
http://arxiv.org/abs/2306.08797v1	20230615005603	Local Labor Market Effects of Mergers and Acquisitions in Developing Countries: Evidence from Brazil	[ "Vitor Costa" ]	econ.GN	[ "econ.GN", "q-fin.EC" ]	Local Labor Market Effects of Mergers and Acquisitions in Developing Countries: Evidence from Brazil Vítor CostaEconomics PhD Candidate at Cornell University. July 31, 2023 ==================================================================================================== I use matched employer-employee records merged with corporate tax information from 2003 to 2017 to estimate labor market-wide effects of mergers and acquisitions in Brazil. Labor markets are defined by pairs of commuting zone and industry sector. In the following year of a merger, market size falls by 10.8%. The employment adjustment is concentrated in merging firms. For the firms not involved in M&As, I estimate a 1.07% decline in workers' earnings and a positive, although not significant, increase in their size. Most mergers have a predicted impact of zero points in concentration, measured by the Herfindahl–Hirschman Index (HHI). I spillover firms, earnings decline similarly for mergers with high and low predicted changes in HHI. Contrary to the recent literature on market concentration in developed economies, I find no evidence of oligopsonistic behavior in Brazilian labor markets. Keywords: Mergers and Acquisitions, Labor Market Concentration, Monopsony, Oligopsony, Local Labor Markets, Developing Economies JEL Codes: G34, J42, K21, L40, M50 empty § INTRODUCTION A growing body of research in recent years has pointed in the direction of non-competitive behavior in labor markets <cit.>. The formalization of a model where profit-maximizing firms internalize an upward-sloping labor supply curve and, as a result, choose to hire fewer workers at a lower wage rate, dates back to the 1930s <cit.>, but a renewed interest in the subject was sparked by the debate around the reasons for the labor share decline observed in developed economies <cit.>. The rise of firms that concentrate ever larger shares of industry sales in a globalized market, the so-called superstar firms, has launched many in the profession into the empirical investigation of labor market imperfection related to the increase in the size of employers. While the debate about the underlying causes of the fall in the labor share of the GDP is far from settled <cit.>, one cannot neglect the burgeoning literature pointing to a negative relationship between labor market outcomes and employment concentration, and proposals for policy intervention to protect workers abound, especially within the reach of antitrust regulation <cit.>. Naturally, mergers and acquisitions (M&As) raise immediate concern about the competitiveness in labor markets. By means of the consolidation of different employers under the same ownership and management, mergers mechanically alter the number of firms competing for labor services and, therefore, might in principle, tilt the balance of bargaining power in an unfavorabe manner to workers. The relationship between a lower number of employers and worse workers' outcomes relies on more than just intuition, and it has both theoretical and empirical grounds. Building upon the monopsony model from <cit.>, <cit.> show that, similar to the case of oligopoly, a model of oligopsony à la Cournot generates wage markdowns that decrease as the number of employers falls, i.e., wages represent a lower fraction of the marginal revenue product of labor as employment gets concentrated among fewer firms. Negative wage elasticities with respect to employment concentration have been confirmed in various contexts [See <cit.>.]. Typically, employment concentration is measured by the Herfindahl–Hirschman Index (HHI) over firms' workforce shares in local markets, sometimes defined by a combination of geographical region and industry sector, or region and occupational codes. This measurement is made possible by the use of linked employer-employee administrative datasets. In this paper, I investigate the local labor market effects of mergers and acquisitions, and the role played by labor market concentration as a channel of these effects. I combine two different administrative datasets from Brazil that allow me to identify merged and acquired establishments, delineate local labor markets, and causally estimate changes in employment, workers' earnings, and local concentration measured by the HHI. The findings consist of three sequential steps. First, I show that null effects of the M&As on workers earnings and market HHI cannot be rejected, while employment significantly declines in markets that witness a firm consolidation event. Next, I split the estimation procedure between two separate groups of firms: the ones that participate in M&As, and the bystander employers in the same market, which I will call spillover firms. The separation of the two types of firms shows that they respond differently to merger activity. The negative employment effects found at the market level are primarily carried out by merging firms, while spillover firms show a small, albeit not significant, increase in their size. By looking at the trajectory of hires and separations, I find that the negative adjustment in merging firms' employment is given by an abrupt decline in new hiring while separations are kept at pre-merger levels for at least one year after the event. The third part of the analysis contains the main result of this paper. In order to evaluate if larger increments in local labor market concentration deepen the earnings effects of mergers, as predicted by the oligopsony theory, I compare the estimates in spillover firms between mergers with no change in concentration and mergers at the top of the distribution of concentration shocks. Contrary to the previous literature, I find that the earnings in spillover firms are similar in both cases, which indicates that concentration plays little to no role in explaining the market-wide effects of M&As in Brazil. In mergers that induce no change in concentration, workers' earnings in spillover firms fall by 1.1%; the same estimate is obtained from within-market mergers with significant increases in local HHI. Moreover, the events with no change in concentration seem to induce a growth in the size of spillover firms, consistent with the logic that the negative employment adjustment promoted within merging firms prompts an increase in the supply of labor to other firms in the same labor market. This increase in the labor supply available to spillover firms is accommodated by an increase in their employment but at lower wage rate. This is confirmed when I explicitly compare the pre and post-merger earnings of new hires in spillover firms. The empirical strategy of this paper relies on a study event design based on the comparison of different local labor markets regarding the year that they witness their first merger event. Due to the concern of treatment rollout and heterogeneity giving rise to problematic estimates <cit.>, I depart from the more traditional two-way fixed effects model and implement the estimation proposed in <cit.>, where the control group to treated markets consists of other markets that will eventually be treated in subsequent years. Also, given that I'm interested in market-wide competition for labor services, I attempt to mitigate the effects of alternative mechanisms connecting merger activity to labor market outcomes. Employment level and wages may be altered by M&A activity through mechanisms other than the competition for labor services. When two firms in the same industry sector merge, higher price setting in their output market has ramifications for the market for inputs not necessarily related to higher bargaining power with upstream service providers – for instance, lower wages and employment could be driven by the monopolist's decision to produce below the competitive benchmark, absent of changes to their ability to set wages. Another possibility is that merged or acquired firms are better equipped to change the composition of their workforce – in case bigger firms can hire younger, less experienced workers, or workers with lower educational attainment, without hindering productivity, lower observed wages could be merely a consequence of lower compensation corresponding to these attributes. In order to best control for the product market concentration and labor compositional mechanisms, I restrict the analysis to tradable sectors only and, leveraging on the demographic details available in the data, I estimate effects on an earnings measure that takes observable attributes of the workers into account. This paper contributes to two strands of the literature on the effects of employer consolidation on labor outcomes. The first one is related to the direct effects of mergers and acquisitions on employment and earnings in acquired and merged establishments <cit.>. Expanding on this literature, I focus not only on target establishments or firms, but I also keep track of earnings and employment at the other employers operating in the same labor market. This observation increases the understanding of market-wide effects of merger activity. The second related literature is the one that directly studies the relationship between labor market concentration and wages, and employment <cit.>. Here, my contribution is to expand the evidence beyond the context of developed economies, and look at the role of concentration in earnings and employment effects in a developing economy. To the best of my knowledge, this is the first study exploring market-wide effects of merger activity from multiple M&A events, in a wide range of industry sectors, in a developing economy. The most closely related works to this paper are <cit.> and <cit.>; they both estimate M&A effects in U.S. labor markets, and study the role of employment concentration in mediating these effects, with the difference that Arnold uses administrative data for a wide range of industry sectors, while Prager and Schmitt focus on the hospital sector. They both confirm that, as predicted by oligopsony theory, mergers that induce little to no effect in concentration also have negligible earnings effects, and significant wage declines are only found among merger events in the top of the distribution of concentration changes. My work departs from theirs in the finding that M&As with larger concentration increases do not generate sharper wage declines in the Brazilian case, and mergers with predicted null change in concentration are followed by an increase in the size of spillover firms[While <cit.> does not report market wide employment effects, employment pre-trends in <cit.>'s event studies preclude them from making assertive claims on the size of labor markets after hospital consolidation events.]. The remainder of the paper is organized as follows. In Section <ref>, I describe the data used in the paper. The main results are reported in Section <ref>, where I subdivide the analysis starting from merger activity effects in general, then across different firms in the labor market with respect to their participation in M&As, and, lastly, across events with different predicted impacts in local concentration. I present the robustness of the findings with respect to the possibility of treatment anticipation in Section <ref>. Section <ref> offers a discussion of the results in view of the literature and auxiliary evidence of management practices in middle to low-income countries. Section <ref> concludes the paper. § DATA The data used in this paper is composed of two different administrative releases by the Brazilian federal government. The first one is the Relação Anual de Informações Sociais - RAIS, the main source for worker and job characteristics information. The second is Dados Públicos CNPJ - DPC, a business registry from which I extract the list of establishments that went through a merger or acquisition. More detail about each dataset is provided below. For a complete step-by-step o the data handling and construction, see Appendix <ref>. §.§ Worker data - RAIS RAIS is a matched employer-employee administrative record provided by the Brazilian Ministry of Labor on a yearly basis, and it covers the entirety of the country's formal labor market, which employs around 70% of the workers <cit.>. In terms of the U.S. Census database, RAIS is similar to the Longitudinal Employer-Household Dynamics - LEHD. Each observation of RAIS contains separate worker and establishment identifiers. The establishment identifier is hierarchical, and from its first 8 digits, or its root, I can also retrieve the firm identifier. As for the workers, the available characteristics are color/race, sex, age, and educational achievement. In the case of establishments, it is possible to see the city where they are located, and the establishment's 5-digit industry sector. The data also contains variables related to the job itself, such as the average monthly earnings, contractual weekly hours, date of admission, and date of separation, in case the job was terminated within that year. Differently from the U.S. Census LEHD, RAIS also reports the occupation of the worker in that particular job. I use the variables of location and industry sector to delineate local labor markets. Local labor market details are discussed in Section <ref>. For this paper, I use RAIS in years ranging from 2002 up to 2017, totaling more than 1.1 billion observations. Access to the data at the individual level is restricted by a confidentiality agreement. §.§ Business Data - DPC The Dados Públicos CNPJ - DPC, is a business registry made available by Receita Federal, the Brazilian tax collection agency. A similar counterpart to the DPC in the U.S. Census system is the Longitudinal Business Database—LBD. The DPC contains information on the universe of establishments ever registered with the agency, and it is updated on a monthly basis. There is a total of more than 42 million observations. Access to the DPC is public, and the files can be downloaded from the revenue agency's website[See <https://www.gov.br/receitafederal/pt-br/assuntos/orientacao-tributaria/cadastros/consultas/dados-publicos-cnpj>.] From the DPC, it is possible to see an establishment's identifier, postal code, industry sector, and, to some extent, its capital table. Primarily important for this paper, DPC also discloses the variable describing the reason for the termination of a business. By law, anytime a firm or establishment is acquired by or merged with another, its identifier is retired, and a new one is issued for the newly created enterprise. Therefore, merged and acquired establishments can be flagged by the reported reason its identifier was retired. Other grounds for business termination include bankruptcy and various forms of tax penalties. Despite the richness of details in the business registry, one cannot use it to identify all the parties involved in an M&A event. Only the acquired or pre-merger entities are flagged as having been targeted by an M&A. However, the identifiers of the firms and establishments after the consolidation are not reported, i.e., the acquirer and newly-merged firm identifiers are not available. The identification of all parties is important to distinguish mergers that happen within any given labor market from those between employers previously operating in separate markets – such distinction will be used to derive an important result regarding the role of employment concentration and the outcome effects of M&As. In order to identify all firms involved in a concentration event, I use the dynamic feature of the worker data, RAIS. More specifically, I observe the flows of workers departing from acquired establishments to help me identify the acquirer firm. The most common destination of these workers in the last year I observe acquired establishments is considered to be the acquirer business[Figure <ref>, in Appendix <ref>, shows the distribution of coalition sizes leaving acquired establishments in years preceding the M&A.]. §.§ Commuting Zones The commuting zones are imported from the Brazilian Decennial Census of 2010. Each commuting zone represents contiguous cities between which people commute either for study or work. The worker data is merged with the commuting zone information using the city codes in both datasets. § EMPIRICAL STRATEGY The parameter of interest in this paper is the average treatment effect of an M&A on local labor markets. A local labor market is defined as pairs of commuting zone and industry sector code. The main outcome variables are the workers' earnings, employment, and the local level of employment concentration. This section presents more detail about the estimation procedure and the identification assumptions. §.§ Local Labor Markets In order to measure the employment concentration of labor markets, one has to choose how to define the labor markets in the first place. Recent studies have used either a combination of industry sector codes and commuting zone <cit.>, occupation codes and commuting zone <cit.>, or a data-driven approach that leverages on worker-flow observations <cit.>. In this paper, I will use the definition of local labor markets based on industry codes and commuting zones, i.e., each market will represent an industry activity geographically located in economically integrated cities. One drawback of this definition is that not all workers in a labor market are equally bound to the same industry sector or commuting zone. Accountants, for instance, have skills easily transferrable across different industries within the same region, while nurses are bound by job opportunities in the health sector only, and thus will likely be more willing to switch cities if necessary. On the other hand, I see two advantages to this approach – (i) this is a definition readily available to researchers and policymakers alike, as it does not require further modeling assumptions based on other characteristics of jobs or workers, and (ii) it makes the present investigation comparable to most other studies in the related literature using a similar definition of labor markets. As I am interested in the labor market effects of mergers, I will also restrict the analysis to tradable sectors only. The idea is that unobserved changes in product markets that possibly follow M&As might explain some, if not all, of the post-merger wage and employment decline in treated labor markets. By virtue of increased pricing power on the product market after an M&A, bigger consolidated firms may decrease their output level and, therefore, reduce their demand for labor. Any declines in wages and employment could then be, to some extent, the result of lower overall demand for labor followed by increased monopoly power, and not necessarily a consequence of any changes in the competition for labor services. A strategy to deal with changes in downstream competition is to narrow the analysis to tradable sectors only <cit.>. The rationale behind this strategy is that the competition of foreign products and services precludes the rise in the market power of the merged firms, thus shutting down the monopoly channel connecting M&A events to labor market outcomes[The selection of tradable industries follows the classification in <cit.>.]. The employment concentration measure I will use in the remainder of the paper is the Herfindahl–Hirschman Index (HHI) computed at the local labor market level in each year. More specifically, for a market m and its set of firms ℱ_m, the HHI in year t is given by HHI_m,t = ∑_f∈ℱ_m s_f,t^2 where s_f,t is the percentage share of employment of firm f ∈ℱ_m as of December 31st in year t. When the local labor market has one single employer, the HHI registers 10,000 points. For an HHI level of h points, the equivalent number n of equally sized employers is given by n=10,000/h. Also, if two employers with shares s_1 and s_2 merge, the equivalent increase in HHI, absent of employment effects, is given by the product 2s_1s_2. Lastly, an increase of δ points in HHI is equivalent to the merger of two equally sized firms with employment shares equal to √(δ/2) each. §.§ Event Study Setup It is possible to assume that consolidation of employers might have lingering effects on local labor markets, and therefore the measure of effects across different lengths of time after mergers take place should be part of the analysis. More so, for the years before the merger, it is also important to observe the difference between the outcomes of treated markets and their pool of control units. Thus, I will base the empirical analysis on the estimation of an event study around the time that local labor markets experience a merger. The predominant approach to specifying the event study with multiple cross-sectional units is to use a two-way fixed effects equation with leads and lags of an indicator variable for the treated units <cit.>. However, some concerns raised in the recent literature investigating the two-way fixed effect approach seem applicable in the context of this paper <cit.>. First, there is variation in the treatment timing of local labor markets, i.e., not all markets witness a merger in the same year. Second, the treatment effects may not be the same for different cohorts of treated markets, e.g., the treatment effect on markets hosting a merger in 2008 may differ from that of markets treated in 2010, and so on. With multiple treatment periods and heterogeneous effects across cohorts, the two-way fixed effects specification generates questionable event study estimates that have been only recently brought to light[See <cit.> for a survey of the literature on problems associated with TWFE models and proposed solutions.] - namely the so called “negative weights" issue and the possibility of “cross-lag" contamination laid out in <cit.>. In any particular year, the treatment rollout creates three different types of markets, namely the (i) treated-markets, (ii) the not-yet-treated markets, and (iii) the never-treated markets, meaning the markets that never witness an M&A in the years under observation. If never hosting an M&A event is correlated to unobserved characteristics of the never-treated markets, then their ability to serve as counterfactuals to treated markets can be compromised. At the same time, if participation in the treated pool is also endogenous to the treated market unobserved characteristics, then the endogeneity related to ever hosting M&A activity is likely ameliorated by using not-yet-treated markets as controls; after all, the parameter of interest is the average treatment effect on treated units, the ATT. For these reasons, I apply the estimation proposed by <cit.> in my investigation. With their method, I can estimate the ATT of merger activity on local labor markets' outcomes using the not-yet-treated units as the counterfactual group and avoid the TWFE specification's issues reported in the literature. In addition, for the context of mergers, treatment anticipation is a possibility that can be explicitly addressed by their ATT estimation. Next, I expose the identification assumptions from <cit.> in the context of merger activity in local labor markets. Let Y_m,t denote the outcome variable of local labor market m in year t. If an M&A takes place at market m in a year g, the outcome variable is denoted by Y_m,t(g), for all years t. Begin by considering the parameter ATT(g,t) = 𝔼[ Y_m,t(g) - Y_m,t(0) \| G_g(m) = 1 ] where Y_m,t(0) is the potential outcome of market m in year t had it not been subject to an M&A, and G_g(m) is an indicator function that is equal to 1 if m is treated in year g and 0 otherwise. ATT(g,t) is what <cit.> call a group-time average treatment effect, and in the present case, it represents the expected change in outcome Y in year t for all markets that had an M&A event in year g, e.g., ATT(2008,2012) is the ATT value in 2012 for markets treated in 2008. The group-time average treatment effects can be combined into coefficients that recover event-study type estimates <cit.>. More precisely, the expected change in outcome Y at market m after l periods of exposure to treatment is given by β^Y_ES(l) = ∑_g∈𝒢1{g+l≤𝒯}P(G=g \| g+l≤𝒯)ATT(g,g+l) where 𝒢 is the set of all treatment years and 𝒯 is the last year of observation. The term P(G=g \| g+l≤𝒯) weighs all the group-time ATT(g,t) in which t is observed, and t=g+l. The more units in a treatment cohort, the more weight that cohort gets in the event study coefficient β^Y_ES(l). §.§.§ Identification The causal identification of ATT(g,t) in Equation (<ref>) relies on a modified version of the parallel trends' assumption used in canonical 2 × 2 difference-in-differences settings. This and all the other assumptions needed for identification are presented below. Assumption 1(Irreversible Treatment) For t=1,…,𝒯, G_1(m) = 0 almost surely (a.s.), and, if G_t(m)=1, then G_t'(m)=1 for all t'>t almost surely. Assumption 2(Random Sampling) Treatment status and outcome variables of individual markets are independent and identically distributed, i.e. {Y_m,t,G_t(m)}_(m,t)=(1,1)^(M,𝒯) is iid. Assumption 3 (Treatment Anticipation of ζ Years) Let 𝒢 be the set of all years of treatment. For all t<g-ζ and g∈𝒢, 𝔼[Y_m,t(g) \| G_g(m) = 1 ] = 𝔼[Y_m,t(0) \| G_g(m) = 1 ] a.s. Assumption 4(Parallel Trends Based on “Not-Yet-Treated" Units) For all g ∈𝒢, t ≥ g-ζ, and s>t+ζ, the following equality holds a.s. 𝔼[Y_m,t(0) - Y_m,t-1(0)\| G_g(m)=1 ] = 𝔼[Y_m,t(0) - Y_m,t-1(0)\| G_g(m)=0, G_s(m)=0] Assumption 5(Overlap) For each t ∈{2,…,𝒯}, and group g in 𝒢, at least one market is treated in year g, and for years g+t, at least one market remains untreated. Assumption 1 imposes that once a local labor market is treated with an M&A, it remains treated throughout the analysis and does not contribute again to the control group of the estimation. For markets with multiple M&A events in different years, I will use the first event as the treatment date. Most markets never have an M&A in the years of observation. Following that, out of any particular number of years with merger activity, the second most common case is that of markets with only one year of M&A events (Figure <ref>) [Markets with one or multiple M&As in the same year are equally considered to be treated in that year.]. Assumption 2 is met by the use of a balanced panel. Assumption 3 is a relaxation of the canonical no treatment anticipation condition in 2× 2 DiD setups. Here, one can allow the treatment to begin as far back as the context requires, effectively resulting in two changes: (i) moving the more commonly used normalization point in event studies from t=-1 to t=-ζ-1; and (ii), removing the units already under anticipated treatment dynamics from the control units pool. Mergers and Acquisitions can be lengthy processes, and the news of an M&A might induce changes in the behavior of firms and workers before the reported year of the event. I present results with no anticipation of treatment, i.e. ζ=0, but I also find robustness to ζ=1. Assumption 4 states the main requirement for identification, namely that the year-over-year change in the outcome of treated markets, had they not been treated with an M&A, is the same as that of markets that will eventually get treated in the following years—the not-yeat-treated units. In conjunction with Assumption 3, the parallel trends assumption imposes that, in year t, the counterfactual of previously treated markets are the ones that get treated in years later than t+1+ζ – e.g., for a given treated market m, and anticipation ζ=0, its counterfactual in year, let's say, 2010, corresponds to all markets that will be treated in 2011 or later; notice that, in this example, markets treated in 2010 are already subject to treatment dynamics, and therefore cannot be used as controls to treated markets in 2010. Figure <ref> shows the percentage of markets by treatment status every year according to the occurrence of the first M&A event. The majority of labor markets have no M&A activity throughout the years of observation. For pairs of commuting zone and 3-digit tradable industry codes, the share of never-treated markets is 86.72% - or 7,526 out of 8,678 markets. The remaining markets are either treated or not-yet-treated, depending on the year. In addition, Figure <ref> shows that in all years, there is a positive fraction of markets that remains untreated, on top of never there being a year with 100% of markets treated, which contemplates Assumption 5. At the same time, the trajectory of the fraction of Treated and Not-Yet-Treated markets is smooth across the years, not indicating any noticeable discontinuities that could demand inference by different time windows. As is common in event studies, fewer markets remain untreated towards the end of the timeline under observation. For this reason, I'll restrict the analysis to a window of 5 years around the merger event. Standard assumptions guarantee the estimation of cluster-robust standard errors by means of a multiplier bootstrap procedure [An exposition of the assumptions necessary for inference is beyond the scope of this paper, and I refer the reader to Section 4, page 211, in <cit.>.]. §.§.§ The Estimand and Control Groups Under the assumptions outlined above, one can rewrite the treatment effect in <ref> as ATT(g,t) = 𝔼[Y_m,t - Y_m,g-1\| G_g(m)=1 ] - 𝔼[Y_m,t - Y_m,g-1\| G_t+1(m)=0 ] effectively obtaining the main estimand used in this paper. Let me take a moment to describe the terms of the expression in Eq. <ref>. Suppose that a group of local labor markets had M&As in year g. The average treatment effect on this group, at any year t, the value ATT(g,t), is equivalent to the difference in the average increment of their outcome variable since one year before treatment, i.e., year g-1, and the average increment of all markets not yet subject to an M&A by year t+1, relative to that same base year g-1. In other words, the 2012 wage effect on a labor market treated in 2008, noted by ATT(2008,2012), is identified by the difference between the wage growth since 2007 of all markets treated in 2008, and the wage growth among eventually treated markets that remain not treated by 2013. Notice that, in the case of allowing for a positive time length of treatment anticipation, ζ=1, for instance, the markets used in the control group would have to be those that remain untreated up to 2014, i.e., two years later than the year at which the effect is being measured, also moving the reference year from 2007 to 2006. §.§ The Earnings Variable One of the possible consequences of mergers is the change in workforce composition within merged firms, and ultimately in the whole labor market. This is specially relevant if, for instance, bigger firms are able to hire younger less skilled workers to replace more experienced, more educated, and thus more costly ones. Any estimated decline in wages would then be the result of turnover towards employees with less attractive observable attributes, and not necessarily due to market-wide changes in the competition for labor services. Given the details about workers' observed attributes in the data, I will estimate the effects of mergers on a measure of earnings that takes such attributes into account, thus obtaining an effect that is not driven by changes in the composition of attributes of workers. Similar to <cit.>, I estimate local labor market-level wages that control for workers characteristics available in the data. The parameter I look for is θ_m,t in w_i,m,t = θ_m,t + β_t X_i,t + u_i,m,t where w_i,m,t is worker i's log annual earnings in market m and year t, and X_i,t is their vector of observable attributes [X_i,t contains dummies for race, college and high school diplomas, sex, and a quadratic binomial on age.]. This model is estimated via OLS for every year in the data. This way, θ_m,t captures the annual market-level log wage net of trends in the workforce composition X_i,t[Later on, in Section <ref>, when I split the analysis between spillover and merged firms, their respective earnings measures are obtained from a re-estimation of Equation <ref> for each group separately.]. §.§ Summary Statistics Table <ref> presents summary statistics from the pool of eventually treated local labor markets, where all means are computed based on the year prior to the first M&A event in the market. Despite the apparent large number of firms per local labor market (almost 63 on average), the HHI score shows that employment is unevenly distributed among employers – 2,847.50 is above the threshold of 2,500 used in DOF-FTC Horizontal Merger Guidelines to consider a product market highly concentrated. This score is equivalent to a market with 3.51 equally sized employers, and is above the overall measured concentration in the U.S. (around 1,500 <cit.>), but below the one found looking only at manufacturing (3,380 <cit.>). § RESULTS In this section, I present the study events as well as overall estimates of the treatment effects of M&As on workers earnings, log employment, and concentration measured by HHI. I also report estimates from among only the firms that constitute the merger deal, and all other firms in the same labor market. Finally, I explore the role of employment concentration on the treatment effects by comparing the estimates from events with predicted zero impact on HHI - the out-of-market mergers, and those on the top of the distribution of concentration increases – the high-impact mergers. §.§ Market-level Effects Figure <ref> shows the event study estimates on earnings, employment, and concentration measured by HHI. In years before t=0, the date of the M&A event, the outcome variables trend similarly among treated and not-yet-treated labor markets, which supports the plausibility of the parallel trends assumption. In the years post-M&A, I cannot rule out that market-level earnings of workers in treated local labor markets have changed on par with the earnings of workers in not-yet-treated units, despite the negative point estimates. In the next section, I estimate separate effects for the treated firms, i.e., those firms that took part in the M&A, and all other firms in the same market. This distinction will shed light on the source of negative earnings estimates and possible market interactions responsible for generating these results. Notwithstanding the stability in earnings differences, the effect of M&As is negative on employment, measured in log, corresponding to -0.1143 (SE=0.0249) one year after the event. The remaining lag estimates indicate that the level of employment does not recoup to its counterfactual trajectory. Overall, in the five years post-treatment, there is a 6.78 percent relative decline in employment on treated markets[This percentage effect is obtained from exponentiating the overall measured effect, 1-exp(-0.0702).]. The fall in employment takes place even when the estimates show a close to null change in employment concentration, as can be seen in Panel <ref>. M&As are expected to increase local concentration mechanically, but the dynamic estimates show that the workers in treated markets are not subject to a significantly more concentrated labor market after the M&A. §.§ Effects from Within Merged Firms and Spillover Dynamics A priori, there is no reason to expect that all employers in a labor market will be equally impacted by a merger event, or that employment and wage adjustments will be similar across all workers. The merging firms might experience changes intrinsical to the merger that might not propagate to the rest of the labor market as a whole. I will now, on one hand, compare the earnings and employment effects only among firms that participate in the merger. On the other, I look at the earnings and employment from all other firms within the same labor market, which I will call spillover firms from now on. The observation of the two separate outcomes, one for within-merged and another for spillover firms, sheds light on what can be the market-wide effect of the M&As and what is related to unobserved changes mergers enact in their entities. It is possible to expect that the new ownership leads to changes in managerial practices, or even in worker productivity, both of which can affect earnings and employment within the newly merged firm, but not necessarily those of competitors in the same labor market. Figure <ref> shows the event study estimates of earnings and employment effects of the merged and spillover firms separately. Panel <ref> shows that earnings in merged firms do not diverge from the earnings in not-yet-merged firms in other labor markets, with lag point estimates close to zero, especially after the second year of treatment exposure. Differently, earnings in spillover firms decline after the merger. The 95 percent confidence intervals contain zero for the separate lag estimates, but the overall effect five years after treatment represents a 1.07 percent decline in wages (Figure <ref>). The employment estimates show a different dynamic. Compared to their baseline difference from other merger participants in not-yet-treated markets, employment in merged firms is significantly lower. The estimate of one year of exposure to the M&A is -0.2923 (SE=0.0052), and, for all five years after the event, I estimate a 23.07 percent decrease in employment in merged firms (Figure <ref>). At the same time, I fail to reject zero employment effects in spillover firms – although the overall effect is positive but imprecisely estimated (Figure <ref>). Taken together, these findings show that the negative employment effects shown in Figure <ref> were carried out primarily by the firms participating in the merger, while the negative wage point estimates originated from a decline in earnings in spillover firms, with a positive but, not significant, increase in employment of spillover firms. The bottom two panels in Figure <ref> show the estimates for hiring and separations of each type of firm. Panel <ref> shows that the negative employment in merged firms is adjusted via an abrupt decline in hires, while separations only start declining after the first year of exposure to treatment. Panel <ref> reinforces the findings for employment in spillover firms, showing that both hires and separations remain similar to their pre-merger levels. §.§ Effects from M&As with Different Concentration Changes There are many channels through which mergers can induce changes in wages and employment levels in local labor markets. On the side of merged firms themselves, one can think that new management or changes to worker productivity might be the cause of the observed outcomes. At a market level, on the other hand, changes in the competition for labor services might be the driver of the decline in wages and employment, especially if mergers foster an anticompetitive behavior from employers. Recent studies that look at wage and employment effects of mergers have found that labor market concentration is an important mediator of the relationship between employer consolidation and earnings declines. Using U.S. hospital mergers, <cit.> find that only consolidations in the top quartile of local concentration shocks induce negative wage effects on health sector workers. In a more general setting, using a similar definition of local labor market as the one in this paper, <cit.> finds that mergers below the 80th percentile of predicted concentration change do not have significant impact on workers' earnings. The fact that larger negative wage effects are found only when mergers enact larger shifts in concentration is consistent with the oligopsony theory à la Cournot of competition in labor markets <cit.>. In such models, the first-order condition of each firm's profit maximization problem can be combined to obtain a negative relationship between market wages and the employment concentration measured by the HHI. That is the main reason why wage declines associated with higher levels of concentration are viewed as supportive evidence of anticompetitive behavior in labor markets <cit.>. My analysis so far has not distinguished the M&A events by their predicted impact on market HHI scores, and their effect on employment concentration was measured to be positive, although imprecise, point estimates (Panel <ref>). In this section, I report the effects from two different types of mergers, namely out-of-market and high-impact M&As. Out-of market mergers are consolidation events where the merging firms were not simultaneously active in the same labor market before the event date. In terms of employment concentration, these are the events with no predicted change in HHI, where the predicted change is the difference between a simulated measure of HHI where the two or more merging firms are considered as one single employer, and the employment HHI actually observed one year before the merger. In case the merging parties operate in the same labor market, their merger has a positive predicted change in HHI, as the sum of their employment shares is greater than any of their individual shares in the year before their merger, making the local simulated HHI greater than the one observed in the data. I label as high-mpact the mergers at the 85th percentile, or above that, of the distribution of predicted change in HHI [One year post-merger, events at the 80th percentile and above cause a change in HHI of 253.48 points (SE=65.61), equivalent to the combination of two equally sized employers with an 11.25% employment share each. At the 85th percentile, this effect rises to 430.70 points (SE=112.35), analogous to the merger of two 14.67%-share partners, making it thus more suitable to test the effects of a change in HHI induced by the merger against out-of-market M&As. Moving the threshold higher up in the predicted change in HHI distribution, however, reduces the number of contributing markets from which to infer the effects, which compromises the statistical power and feasibility of the analysis.]. The relevance of out-of-market M&As lies in the fact that they do not mechanically induce any changes in concentration[As it soon will be shown, out-of-market M&As do not induce changes in distribution post-treatment either.], and thus, their effects are expected to be unrelated to market-wide anticompetitive behavior resulting from any increases in concentration. Diversely, effects from high-impact M&As can be indicative of anticompetitive behavior related to the increase in concentration that they elicit. Table <ref> shows that, out of all mergers and acquisitions in the sample of tradable industries, the median predicted change in HHI is 0, while the 85th percentile has a predicted change of 5.53 points – an event analogous to the merger of two equally sized employers with a 1.67% share of employment each. In Table <ref> I report summary statistics of the markets used in the estimation of the effects of the two types of events. The markets in the out-of-market pool have similar earnings to those in the high-impact's, a little over 4,000 BRL, and they also depart from a close average number of firms, 81.16 and 79.83, respectively. In Figure <ref>, the first two panels confirm that out-of-market M&As and high-impact M&As have distinctive post-treatment concentration dynamics. As expected, high-impact M&As increase local employment concentration – the two-year treatment exposure point estimate shows an increase in HHI of 522.48 points (SE=118.64), an increase analogous to one generated by a merger of two equally sized employers with a 16.16% share of local employment each. Post-treatment, I cannot reject the null effects of out-of-market M&As on local market concentration. In Panels <ref> and <ref>, I observe similar point estimates from both types of mergers, and in both contexts, that of merged firms and spillovers. Within merged firms, earnings seem to decline especially after the second year of exposure to treatment, while a downward trajectory is noticeable from the start in spillover firms. As for the employment outcome, the event studies in panels <ref> and <ref> indicate a different pattern of effects between the two types of mergers, with negative estimates in the case of high-impact M&As both within merged firms and spillovers[The lead estimates of out-of-market M&A employment effects in Panel <ref> show a potential positive linear trend in the employment of merged firms relative to their not-yet-treated counterparts in other markets. In such cases, the negative post-treatment estimates can be interpreted as a reverse in their employment growth trajectory. Either way, the qualitative conclusion remains the same and is consistent with the case of all mergers in Section <ref>, employment in merged firms would have been higher if not for the merger.]. For out-of-market M&As, while treatment effects are negative within the merged firms, they are positively estimated among spillover employers. The earnings and employment effects of the two types of consolidation events are summarized in Figure <ref>. The overall estimates for the five-year post-treatment show a similarity in the magnitude of earnings decline within M&A firms for both out-of-market and high-impact mergers, -0.0083 (SE=0.0084) and -0.0095 (SE=0.0108) respectively. In the case of spillover firms, the estimates are -0.0108 (SE=0.0051) for out-of-market mergers and -0.0117 (SE=0.011) for high-impact. This finding is at odds with studies of mergers in the context of the U.S. labor market in two aspects. First, both in the specific case of hospital consolidation <cit.>, and in the more general context of multiple industries <cit.>, mergers with little to no change in concentration do not have a significant impact on earnings. Here, I find a significant earnings decline after out-of-market mergers in spillover firms and, although less precisely estimated, within merged firms too. Even in the absence of changes to local concentration, mergers impart a significant decrease in earnings. Second, looking at the case of spillover firms, the effects from the two types of events are similar in magnitude, indicating a decline of 1.1% in earnings. This similarity is surprising in view of the result that larger increases in concentration are followed by larger wage declines, both theoretically and empirically. Assuming no changes to labor supply elasticity and productivity in the first five years after the merger, a likely scenario for the case of firms not involved in the merger, the theory of oligopsony à la Cournot would have predicted a more negative wage effect for the case of high-impact events. This finding also shows that, at least in the context of Brazilian labor markets, it should not be assumed that mergers only affect wages and employment, via the concentration channel only, an assumption that has been used before in instrumental variable estimations of the relationship between wages and employment concentration <cit.>. Without distinguishing between spillover and merged firms, the All Firms column in Panel <ref> confirms that out-of-market mergers have a significant negative effect on earnings, estimated at -0.0143 (SE=0.0045). Panel <ref> shows the overall employment effects. Here, the out-of-market mergers have a similar result to the one found in the case of all mergers presented in Section <ref> - while a negative employment adjustment is observed in merged firms, spillover firms grow after the merger of their competitors, although at a rate that does not compensate for the separations in merged firms, as the All Firms column in Panel <ref> indicates. For the case of high-impact mergers, the employment effect is negative across all firms, notwithstanding the estimates are less precisely estimated in spillover firms. In principle, this is an expected result. Contrary to out-of-market events, the high-impact mergers necessarily reduce the number of employers in the market, canceling to some extent the possibility of workers reallocating within the same labor market. Figure <ref> shows that the higher concentration observed after high-impact mergers may not only stem from a change in the distribution of workers among big and small firms, but also from the reduction in the number of employers altogether. The number of employers is close to 9.05% lower in markets that witness a high-impact merger two years after the event, while a null effect cannot be rejected in case of out-of-market mergers. Another reason why employment may decline more sharply in high-impact mergers is that the merging entities might have more redundancy among their workers once under the same ownership and management, while the same level of overlap is likely not achievable in out-of-market consolidations. § ROBUSTNESS TO ANTICIPATION Mergers and acquisitions may take a long time to conclude, and both workers and firms can respond to the news of the event before its official date reported in administrative records. Thus, it is important to check the robustness of the results to the possibility of treatment anticipation. Effectively, this means that some not-yet-treated markets that contribute to the control pool under the assumption of no treatment anticipation are not appropriate counterfactuals anymore, specially if firms engage in pre-merger adjustments ahead of the deal taking place. To take this possibility into account, I modify the Limited Treatment Anticipation Assumption in Section <ref> by changing the value of the parameter ζ from 0 to 1. This implies that for markets treated in year g, their average treatment effect in any year t will be based upon the not-yet-treated markets by year t+2, and not t+1 as before[It is worth noticing that this adjustment is different from simply moving the normalization period in two-way fixed effects specifications from the more commonly reported lead t-1 to t-2, in view of the fact that it effectively changes the pool of units in the control group <cit.>.]. I present the overall 5-year ATT under the one-year treatment anticipation assumption in Figures <ref> and <ref>. When pooling all mergers together, the lesson from the treatment anticipation case is similar to the findings from the no treatment anticipation (Figure <ref>) - (i) workers earnings are lower in spillover firms, although not as precisely estimated as before, at the same time that these firms grow in size, and (ii) merging firms primarily drive the negative employment adjustment observed in the whole market, while the null effect on their workers earnings cannot be rejected. The comparison between out-of-market and high-impact events with treatment anticipation is presented in Figure <ref>. Here, I do not find a conclusive evidence that refutes the previous finding of similar earnings effects between the two types of events among spillover firms, which shows that even under the treatment anticipation assumption, the increase in concentration does not generate clearly distinguishable earnings effects outside the merging firms. Within merged firms, the seemingly more negative wage and employment effects of high impact events may originate from a higher degree of job titles overlap between the merging firms when they already belong to the same labor market. § DISCUSSION OF RESULTS To summarize, mergers and acquisitions in the context of the Brazilian labor markets are shown to have significant negative employment effects at local labor market level. The post-treatment dynamics also shows increases in concentration and declines in worker earnings, although not significant. By splitting the sample between the firms that participate in the merger and all other firms in the same market, I show that the two types of firms have diverse responses on their employment and earnings margins. The negative employment effects are found primarily within the merged firms, while spillover firms show a tendency to increase in the years after the event, but their increase is not large enough to offset the reduction in size of merging firms. When it comes to earnings, I cannot reject the null effect hypothesis from the merged firms' sample, but earnings are significantly lower in spillover firms. Most mergers and acquisitions have little to no impact on concentration. It is only in the top 15% of the distribution of a priori increases to HHI that I find noticeable employment concentration changes. The comparison of out-of-market and high-impact mergers reveals seemingly indistinguishable earnings effects in spillover and merging firms. The out-of-market employment effects follow the overall pattern found before, merging firms get smaller and spillover firms grow in size. These findings are robust to the possibility of treatment anticipation, and are likely not related to changes in the composition of the labor force (given the construction of the earnings variable) and changes in product market power (given the restriction to tradable industry sectors only). The concentration channel connecting mergers and negative wage effects found in <cit.> and <cit.> seems to be thus absent in the context of Brazilian labor markets. In addition, I find negative wage effects that affect other firms in the labor market even in the case of merger activity not followed by increases in concentration. I do not empirically find a confirmation of the connection between increases in concetration and sharper wage declines from oligopsony models of the labor market <cit.>. But if not changes in concentration, what could be driving the observed decline in earnings of firms not related to the M&As and the market-wide decline in employment? §.§ M&A's Synergies, Managerial Practices, and Within-Market Dynamics A way to rationalize the decreases in workers' earnings and employment, even in the case of mergers that do not affect local concentration, is to admit the possibility of efficiencies created by employer consolidation. Merger proponents argue that cost-saving measures can be taken once the merging parties operate under the same ownership. While the economics profession has been skeptical of efficiency claims made by merger proponents[For a discussion on the credibility of such claims in the U.S. context, see <cit.> and <cit.>. The possibility of merger-related efficiency gains is also explicitly acknowledged by regulators. See, for example, the DOJ-FTC Horizontal Merger Guidelines, Section 4.], the present case shows that merging firms do engage in a significant reduction of personnel, while other employers in the labor market show a tendency to grow after the merger. On the earnings margin, the results showed that workers that remain in the merging firms do not face a significant decline in earnings, while the opposite happens with spillover firms' workers. What this contrast suggests is that the adjustment towards lower employment generated by potential efficiency gains in merging firms increases the supply of labor to all the other firms in the same market. Assuming a stable curve of demand for labor in spillover firms, the increased supply of workers is accommodated at a higher equilibrium level of employment and lower earnings in these firms. Indeed, I estimate negative earnings effects among new hires in spillover firms after an out-of-market merger (Figure <ref>), where the fiver year post-treatment average effect is -0.0156 (SE=0.0051). The question of why cost-saving measures in the form of overhead reduction are more pervasive in Brazilian merger activity if compared to the context of the U.S. labor market remains[Due to a pre-trend in their employment event study, <cit.> refrain from making an assertive conclusion about the employment effects of hospital mergers. At the same time, <cit.> finds negative employment effects in M&A establishments that range from 5% to 10% on average depending on the predicted change in concentration, I find a sharper decrease of 23.07% in merging firms' size in the case of all mergers.]. One possibility is that changes in ownership and management are able to collect higher gains from efficiency in emerging economies due to inadequate management practices in target firms. <cit.> presents a comparison between the productivity of firms in developing economies vis-à-vis their counterparts in richer countries. In 2005, the sales per employee in American firms was more than 3.2 times as large as that of Brazilian firms. While previous studies have elicited structural, economy-wide reasons for the productivity gap, such as developing countries' lack of infrastructure, lower human capital, and regulation, Bloom conjectures that managerial practices can also be playing an important role. Compared to higher income economies, middle and low-income countries, including Brazil, have a lower prevalence of management practices related to clear target setting, production monitoring, and proper pay incentives <cit.>. To the extent that changes in ownership in Brazil can allow merging firms to reap managerial gains and dismiss excess workers in the process, this could in part explain the difference in employment effects between merging firms and other employers in the same labor market. Simultaneously, M&As in developed countries such as the U.S. might not be able to collect the same cost related efficiency gains given their superior management practices beforehand. § CONCLUSION What are the effects of merger and acquisition activity in the labor markets of a middle-income country? I attempt to answer this question by exploring linked employer-employee administrative records from Brazil to identify merger events, locate them in labor markets defined by pairs of industry and commuting zone, and, by means of an event study design, I estimate their impact on workers earnings, employment, and local concentration measured by the HHI. The worker-flow identification of merger events allows me to distinguish the changes in size and worker compensation, both in merging firms and all the other employers doing business in the same labor market. Overall, mergers have clear negative impacts on labor market size, while null effects on earnings and local concentration cannot be rejected. I find that the market's negative employment adjustment is exclusively concentrated in merging firms, while other employers in the same market experience a positive, although not significant, size effect, at the same time that their workers'earnings show a subtle modest trend. The apparent null effect of mergers in local concentration is explained by the fact that most M&As are of the out-of-market type, i.e., either the acquirer or the merging partner were not active in that same market before, and thus the predicted change in local HHI is zero. It is only at the top 15% of the predicted change in HHI distribution that I find a noticeable local concentration impact of M&A events. Contrary to the previous literature findings, workers' earnings in spillover firms decline similarly irrespective of the impact on concentration from the merger event. The earnings decline in spillover firms can be rationalized by a positive shift of the labor supply curve in these firms, originated by a halt in hiring from the merging competitors. At the margin, I confirm that new hires in spillover firms earn relatively lower wages after an out-of-market event. By comparing the effects of M&As inducing different changes in local employment concentration, this paper also adds to the empirical investigation of oligopsony models that predict lower wages in concentrated labor markets. The body of evidence showing the negative relationship between employment concentration and labor outcomes in developed economies has prompted the suggestion that antitrust authorities should use HHI benchmarks to flag mergers' potential anticompetitive impacts on labor markets <cit.>. In contrast, by explicitly comparing out-of-market and high-impact mergers earnings' effects, I find that wage declines in spillover firms are similar in both cases. However, the finding that mergers with substantial increases to concentration are not followed by stronger wage reductions should not be taken as proof that labor markets in Brazil are hence perfectly competitive, and that the local antitrust authority should not be cognizant of mergers impacts on workers. The oligopsony theory is one way to rationalize wage markdowns, but models of job search friction, such as employer differentiation, and job ladder, can also generate firm-specific upward sloping labor supply curves independent of employment concentration[See <cit.> for a comparison and historic perspective on models with employer's wage setting power.]. What my result shows is that ad-hoc thresholds of local concentration may not be as informative about the competitiveness of developing economies' labor markets as they are in developed countries. Additionally, the existence of non-compete clauses common in high-skilled occupations, and anti-poaching agreements documented among various U.S. franchisees are worth the attention of antitrust policy regardless of their connection to local market concentration <cit.>. The pervasiveness of such practices in the Brazilian context is still unexplored, and undoubtedly deserve the attention of future research. aer § DATA HANDLING §.§ Preparing RAIS The Relação Anual de Informações Sociais - RAIS version used in this paper starts in 2002 and ends in 2017. The files are made available by the Ministry of Labor in Brazil, and their transfer is conditional on a confidentiality agreement celebrated between Cornell's Labor Dynamic Institute and the Ministry. The files are hosted in a secured cluster within Cornell's BioHPC server ecosystem. RAIS' raw files are year-by-region (in some years, year-by-state) tables. I fist stack all files within the same year, then I merge the yearly files with the commuting zone list using the city codes as the key. Job records outside the reach of commuting zones are dropped. For each job record, RAIS reports the status of the job in December 31st – if this variable has entry 0 it means that the work contract was terminated at some point in that year. I keep only the job records with active employment contracts on December 31st. As standard, in case the same worker has more than one employer, I keep the highest paying job. For the demographics used in the estimation of <ref>, I use the worker's age, age squared, and dummy variables for female, white, college or higher (codes greater than or equal to `9'), and high school (codes `7' or `8'). RAIS is an employer-reported database, and in some occasions, a worker's history will show different colors/races, depending upon either the perception of the current employer or the worker's informed race when the job started <cit.>. If a worker is ever reported as non-white (race/color codes different than `2'), I set the white dummy to 0. In Section <ref> I present event studies looking at the dynamic of new hires and separations within merged and spillover firms. In order to exclude spurious work contract terminations, such as transfers across establishments of the same firm or to the newly merged firm, I exclude the separations with reported reason coded with labels `30' and `31'. New hires are flagged using the tenure variable, measured in months as of December 31st of each year. Active jobs on December 31st with tenure less than or equal to 12 months are flagged as new hires. In order to avoid counting spurious admissions, similar to the case of separations, I exclude the admissions coded with types `3' and `4'. §.§ Identification of Establishments in M&A events The identification of merger activity starts with the Dados Públicos de CNPJ - DPC, released monthly by the revenue agency in Brazil. The release I used in the paper is from September 5th, 2020. The file contains approximately 42.5 million observations at establishment level. Every time an establishment is acquired or merged with others, its identifier is retired, and a new one is issued by the revenue agency. The establishment identifier, also called the establishment's CNPJ, is a hierarchical 14-digit code, where the first eight digits identify the firm, the following four digits identify the establishment, and the last two digits are used for checksums. I rely on the column describing the reason for retirement of a CNPJ to flag acquired (code `2') or merged (code `3') establishments. After flagging the acquired or merged establishments, I resort to the matched character of RAIS to keep a record of the next destination of workers who are re-employed in other firms. For each destination firm, I compute the relative size of the leaving coalition, and choose the largest coalition's next firm as the most common destination. Figure <ref> shows the distribution of worker coalition sizes departing from acquired or merged establishments towards the most common destination firm in the last few years of such establishments. In the last year of an acquired establishment, in at least 70% of cases, more than 50% of workers are reported to be working at the same top destination firm in the following year. In the second to last year, and before that, a coalition of less than 10% of the acquired establishment workers can be found in the following year's most common employer. Therefore, I declare the firm that admits the most number of workers from an acquired or soon-to-be merged establishment, after the last year of observation of this establishment, as the buyer, or newly-merged firm, side of the M&A. The identification of both acquirer and acquired allows me to compute the predicted impact on HHI of each local labor market event, or events, in a given year. The predicted HHI is then used to separate out-of-market events from those that induce higher concentration changes.
http://arxiv.org/abs/2307.04764v1	20230619094218	The nature of time and motion in relativistic operational reality	[ "Diederik Aerts", "Massimiliano Sassoli de Bianchi" ]	physics.hist-ph	[ "physics.hist-ph" ]	The nature of time and motion in relativistic operational reality Diederik Aerts and Massimiliano Sassoli de Bianchi Center Leo Apostel for Interdisciplinary Studies, Vrije Universiteit Brussel, 1050 Brussels, Belgium E-Mails: <[email protected]>, <[email protected]> ====================================================================================================================================================================================================================== We argue that the construction of spacetime is personal, specific to each observer, and requires combining aspects of both discovery and creation. What is usually referred to as the block universe then emerges by noting that part of the future is contained in the present, but without the limitations that the four-dimensional block universe usually implies, of a reality in which change would be impossible. In our operational approach, reality remains dynamic, with free choice playing a central role in its conceptualization. We therefore claim that Einstein's relativity revolution has not been fully realized, since most physicists do not seem to be open to the idea that objects move not only in space, but also and especially in time, and more generally in spacetime, with their rest mass being a measure of their kinetic time energy. When relativistic motion is revisited as a genuine four-dimensional motion, it becomes possible to reinterpret the parameter c associated with the coordinate speed of light, which becomes the magnitude of the four-velocity of all material entities. We also observe that the four-dimensional motion in Minkowski space can be better understood if placed in the broader perspective of quantum mechanics, if non-locality is interpreted as non-spatiality, thus indicating the existence of an underlying non-spatial reality, the nature of which could be conceptual, consistent with the conceptuality interpretation of quantum mechanics. This hypothesis is reinforced by noting that when observers, or experiencers, as they will be referred to in this article, are described by acknowledging their cognitive nature, of entities moving in a semantic space, Minkowski metric emerges in a natural way. Keywords: Operational reality, Relativity, Time, Motion, Speed of light, Proper speed, Block universe, Minkowski space, Non-spatiality § INTRODUCTION Reconciling the reality of one's present experience with that of the four-dimensional continuum of special relativity constitutes one of conceptual difficulties posed by Einstein's celebrated theory <cit.>. Indeed, physical entities are often imagined as moving along their worldlines, but then the following question arises: What truly exists, the entities in motion on their worldlines, or the worldlines themselves, or, does the question about ‘what truly exists’ need still another answer? Also, do all entities only exist in the present moment, according to the view of presentism, or it is the view of eternalism which is more correct, when it says that entities jointly exist in all their temporal dates, so not only in their present but also, jointly, in their past and future <cit.>? Without a doubt, relativity fully brings into play this dichotomy between the opposing views of presentism and eternalism, confronting us with the question of knowing what truly exists, what change really is, whether it really is such, or just an illusion. These questions, however, are not only the proper of relativity, they were, and still are, at the core of the research on the foundations of quantum mechanics, which can be said to have begun in the 1970s, following the critical reflection contained in the celebrated EPR article <cit.>, which anticipated Bell's work <cit.> and his inequalities that, unexpectedly, allowed to experimentally test the reality of entanglement and non-locality <cit.>. More precisely, similar to what Einstein did in relativity with the measurement of distances and durations, in quantum mechanics it was also possible to operationally define what exists from an analysis of the different measurement procedures and their relation to the notion of prediction, viewing actuality as a special state of prediction, corresponding to the situation where the outcome of the experimental test of a property is 100% certain, whereas potentiality is characterized by a weaker probabilistic prediction, i.e., a situation where the outcome in question has a probability strictly lower than 100%, which cannot be made equal to 100% even in principle <cit.>. This means that potentiality would have its proper place in reality, and how it is partly detected, or observed, and, in considering quantum theory, also partly constructed, or even created, an aspect of the situation that we will specify more fully later in this article. It is important to note that what exists does not necessarily allow itself to be circumscribed in purely operational terms. However, what exists in an operational sense must also exist in a broader metaphysical sense. In the way the theory of relativity was presented and derived by Albert Einstein himself <cit.>, the notion of an observer plays an important role. However, even when using a clock and ruler to measure intervals of time and space, an observer acts and interacts with the reality he or she observes. Thus, he or she does much more than simply passively observe. Of course, these specific actions of measuring spatiotemporal intervals remain very close to the idea of passive observation, so the notion of observer still seems appropriate. But as will emerge more clearly in our analysis of relativity, inspired by our work on the foundations of quantum mechanics, in Einstein's observer there is a fundamental active aspect previously unnoticed, which is why we shall henceforth call an observer, more appropriately, an experiencer. Indeed, to operationally define what exists, we have to refer to the notion of experience, which in turn depends on the personal power of an experiencer, what he or she is in principle able to interact with, e.g., through his or her body and instruments. And since an experiencer's power to “touch” the real, both in width and depth, grows proportionally to his or her knowledge, the corresponding definition of operational reality will also grow accordingly <cit.>. Note however that our reality, in each moment, is not just the content of our experience in that moment, as if this would be true it would be extremely limited. It is, instead, the collection of all our possible experiences in that moment, those we could have lived should we have made different decisions in our past. This shows the importance of free choice in our reality construction, as well as the fact that an operational reality is a personal reality, which is constructed individually by each observer. It is then natural to ask: Can we coherently integrate all the personal present realities associated with the different experiencers into a global present reality construction? Such a global construction out of local personal realities was what could be accomplished within the Newtonian worldview, using the existence of a single time flow, shared equally by all experiencers. In other words, an absolute Newtonian time, advancing inexorably in the same way for each of them. But special relativity tells us that the present is personal, that there is not one time, but multiple personal times, and this leads to surprises in our operational construction of reality, which is what we aim to explain and illustrate in this article, which is organized as follows. In Section <ref>, we identify `what exists' in an operational sense in relativity and show that, as a consequence of the effect of time dilation, the future is literally also in the present, hence each observer, hence experiencer, is associated with a personal four-dimensional block universe. However, change remains natural and at the core of reality. Indeed, as our analysis will make clear, it is the Newtonian reflex of wanting to fuse these personal block universes into a single global construction that causes the problem with change, in the way we usually reflect on the notion of block universe, hence the problem of eternalism. In Section <ref>, as a further deepening and fine tuning of this view, we revisit the notion of coordinate velocity, emphasizing that the notion of proper velocity, or celerity, is more adequate to describe the spatial motion of physical entities, making the invariance of the speed of light much more intuitive. Continuing our analysis, in Section <ref>, we observe that the notion of proper velocity is part of a more general notion, that of four-velocity, which allows us to reinterpret the structural parameter c appearing in the Lorentz transformation as the absolute speed of all material entities. In Section <ref>, we observe how the existence of a multiplicity of proper times implies that the block universe strategy of conferring the worldlines and worldtubes an intersubjective reality fails in the same way that simultaneity fails in relativity. In Section <ref>, we show that the movement along the time direction can be associated with a kinetic-like energy, which is nothing other than the mass energy of a physical entity. In Section <ref>, we briefly introduce the perspective of the conceptuality interpretation of quantum mechanics, describing quantum non-locality as non-spatiality and conceptuality, and in Section <ref>, we use the conceptuality input to derive the Minkowski metric in a very natural way. Finally, in Section <ref>, we recapitulate our findings, offering some final remarks. § THE FUTURE IN THE PRESENT The starting point in the definition of the present personal reality of an observer, and we mean here the notion observer as used in Einstein's version of relativity <cit.>, is the notion of experience <cit.>. The general situation is that such an observer only has one experience at a time, i.e., there is only one present personal experience, and of course, when we say `present', we are referring here to the proper time of the observer. There are two fundamental aspects in an experience: a creation aspect, and a discovery aspect. The former is that aspect of an experience that is acted upon by the observer, whereas the latter is that aspect of an experience that lends itself to such action-creation, being present independently of such action and which, therefore, can be discovered while performing it. Let us call this second aspect a happening. We could have used the notion of event instead of happening, to indicate this second aspect, but the general consensus in identifying an event with a point in spacetime, that is, an element of Minkowski space, does not make this notion general enough. Our intention is to introduce a framework in which quantum mechanics also finds a place, so that we can construct a theory that fully reconciles relativity theory and quantum mechanics. We have just mentioned that in our approach quantum non-locality is interpreted as non-spatiality, so, limiting `what exists' to `spacetime events' is not an option, hence the use of the more general notion of happening instead of event. In our language, creations are usually expressed by verbs and happenings by substantives. The crucial point is that although an observer may have only one present experience, there are many experiences that he/she could have had in replacement of his/her present experience, if only he/she had made different choices in his/her past. This because many other happenings are also available, in that same moment, to be part of his/her present experience, and their collection is by definition the present personal reality of the observer. It is this freedom of choice, that is, the existence of the possibility for an observer to experience something different by making a different choice in the past, that is crucial to the operational construction of `what exists’. This hypothesis of freedom of choice is not made explicit in Einstein's version of relativity <cit.>, although it is deeply linked to the scientific project itself and its operational foundation. It is precisely in order to emphasize the importance of this possibility of free choice for an observer that we have decided to introduce, as already announced, the new notion of an experiencer, with the usual relativistic observer who can be seen as a simplified and idealized version of this more general experiencer, whose non-quantum reality, at a given moment in time, is considered only a spatial reality. Note also that the notion of event, although within standard approaches to relativity it is considered very general, is rather limited, indicating a passive worldview, in which events simply happen and are possibly observed. Our approach, inspired by the foundations of quantum theory, adopts a non-passive worldview, where an observation is considered not only an act of discovery, but also of creation, as evidenced in the quantum formalism by the process of the wavefunction collapse following a measurement. This is why we consider an observer also as an experiencer. Hence, in what follows we will adopt an idealization like that adopted in standard approaches to relativity, considering only that subclass of happenings reducible to spatiotemporal elements. However, we will suppose that an experiencer has several happenings at his or her disposal, and thus there is freedom of choice for an experiencer. So, one can associate to each relativistic experiencer a present personal space, which is a special subset of his/her present personal reality, containing all the happenings that are available to the experiencer at that moment. But even when we limit our analysis to happenings that `happen in space', the present personal reality of a given experiencer is more complex than we are usually used to consider. Indeed, although the personal space of a given experiencer, defined by his/her proper reference frame, is a space of simultaneity, such simultaneity is only relative to the experiencer's clock, his/her personal spatial reality being also populated by entities existing in multiple temporal versions, and in that sense, it is truly a four-dimensional realm, i.e., a spacetime. To explain this, consider two clocks, let us call them clock-A and clock-B. Let us assume that an experiencer named Alice is sitting in her office and that clock-A is in her pocket, whereas clock-B is in her desk drawer. They both mark the same time, let's say 13:00:00, which is the present (proper) moment of Alice. In other words, clock-A and clock-B, both marking time 13:00:00, are jointly part of Alice's present personal reality at time 13:00:00. As we explained, this is so because both clocks are available to become part of Alice's experience. For instance, at time 12:59:55, Alice could have either decided to take clock-A out of her pocket and look at it (assuming the operation takes 5 seconds), discovering in this way that it marks 13:00:00, or she could have decided to take clock-B from the drawer (assuming again that the operation takes 5 seconds) and look at its face to also discover that it marks exactly 13:00:00. It is also true, however, that an hour before, at time t_ p^1=11:59:55, Alice could have traveled back and forth along a given spatial direction. Let us say that she could have done so at proper space velocity v_ p (see the next section for its definition) and let us assume for simplicity that she can elastically revert her path after exactly half an hour. Note that we have described an action of Alice that is as simple as possible, as is customary in relativistic texts, but of course it may be more complex in terms of spatial trajectory. What is important is that she moves away from her office and then after a certain time returns, and in modeling her action the accelerations that she necessarily experiences are neglected. Now, if Alice would have done so, when back at her office at personal time t_ p^2=12:59:55, she could also have decided to either look at clock-A in her pocket, discovering that it marks t_ p^3=13:00:00, or to take clock-B from the drawer, and by looking at it she would have discovered that it doesn't mark 13:00:00, like her clock in the pocket, but 13:00:00+ T, where T=(γ_ p-1)(t_ p^2-t_ p^1) γ_ p=√(1+v_ p^2 c^2) Since γ_ p can take values from 1 to infinity, when v_ p varies from 0 to infinity, we obtain that not only clock-B marking 13:00:00 is part of Alice's personal reality at time 13:00:00, but also clock-B marking any time from 13:00:00 to infinity, or to be more precise, any time from 13:00:00 up to the time that corresponds to the end of the existence of clock-B as a physical entity with limited life span; see Figure <ref>. In other words, if it is true that, for how we build our physical reality, the personal space of Alice at a given personal moment t_ p, is a three-dimensional manifold formed by all the possible spatiotemporal happenings (events) associated with the same temporal order parameter t_ p, when we also consider the personal times of the entities populating it, we obtain a genuine four-dimensional description. This because an entity like a clock, or any other material entity that can ideally be associated with a spatial coordinate, are happenings that are available to be experienced in an infinite number of temporal versions, compatibly with their lifespans and with the fact that nothing has intervened, at a given moment of their existences, to destroy them. So, when operationally defining what is real for a given experiencer, in a given moment of his/her proper-personal time, by means of the collection of all the happenings that can be fused with his/her creations at that time, within the limits of his/her personal power, one comes to the deep insight that even things that one would normally situate in one's personal future are existing in one's personal present. Before continuing our analysis, a few remarks are in order. We can observe that the Minkowski four-dimensional spacetime structure only contributes to the possible experiences of an experiencer on the happening side, i.e., it only describes the spatial happenings that are available to be fused with one of the experiencer's creations, to live a given experience, in a given moment (like the experience of looking at a watch). All these happenings, which jointly exist in that moment, in countless temporal versions, give rise to a genuine four-dimensional spacetime structure. The statement that clock-A marking 13:00:00, and that same clock marking 14:00:00, can be both part of Alice's personal reality at time 13:00:00, may lead to believe that the future would be in close proximity to the present, since these two versions of clock-A are located, spatially speaking, in the same place (the drawer). But this would be an incorrect conclusion, as in fact clock-A marking 14:00:00 is very far away from Alice. Indeed, to be able to have an experience with it, at personal time 13:00:00, she had to travel at very high proper space velocity. Note also that if it is true that happenings of different ages jointly exist in an experiencer's reality, only one temporal version of the experiencer exists, in a given moment, as is clear that no action can be performed by the latter, in his/her past, that would allow him/her to observe himself/herself with a different personal time than his/her actual personal time. This is also the reason why we can consider the above mentioned four-dimensional spacetime structure to exist only from the perspective of the experiencer, in the sense that the experiencer himself/herself is not contained into it. In other words, his/her four-dimensional personal block universe exists at a given moment of his/her proper time as the collection of what is real to him/her, in terms of events, in that moment, excluding himself/herself from that collection. This is how we believe the notion of a personal block universe should be precisely understood, as something personal to a given experiencer, in the same way proper times and proper velocities are. It is the collection of all the existing worldlines (or worldtubes, when considering objects that are not point-like) whose lengths depend on the lifespan of the entities that generate them. And the same applies to experiencers other than the one under consideration, who again are not part of their own personal block universes. But then, what is it that truly exists, the worldtubes or the entities moving along them? Our approach provides a rather nuanced answer to this question, being clear that it depends on the perspective adopted, since when we talk about the reality of an experiencer, it does not contain the entity that is the subject of the experiences that underpin its construction, while it includes the worldtubes corresponding to the other experiencers. Note that the existence of personal block universes does not imply that change would be impossible. Coming back to Alice, her reality is dynamic, the four-dimensionality of the entities (different from her body) being a consequence of the fact that, through her free choice, she can select her own possible experiences, enabling her, via the time dilation effect, to possibly travel into the future of other entities, and experience them there. From a quantum perspective, if Alice's reading of clock-B is viewed as a measurement, then her possible round trips correspond to different possible preparations of the state of the measured system, i.e., clock-B. And the fact that time and reality become personal in relativity, this can also be viewed as that typical quantum-mechanical feature called contextuality, although we have here a specific relativistic type of spatiotemporal contextuality. We also observe that the existence of this collection of personal block universes does not give rise to the existence of a single block universe without experiencers, the situation with respect to the question `What exists when there are no experiencers?' being more complex than that. We will return to this issue later in our article. But let us already say that it is not our aim to develop an idealist interpretation of the theory of relativity, in the sense that `observation' would be necessary for `existence'. Our operational approach is mainly aimed at revealing the nature of reality, that is, of what exists, considering how we access knowledge and structure it. For example, we take for granted that nature and its relativistic properties exist even when no one experiences them, and already existed when there were no human beings to experience them. When in Section <ref> we briefly introduce our conceptuality interpretation of quantum theory, we will still be able to express a more nuanced view on this and other related issues. § THE PROPER SPEED OF LIGHT When we consider spacetime and the block universe in personal terms, i.e., as a personal construction proper to each reality's experiencer, we are in fact simply extending those personal notions that are already present in the relativity textbooks. Think of proper time and proper length, which are clearly personal to a given experiencer. However, remnants of a pre-relativistic (Newtonian) thinking are still present in those relativity textbooks, with the risk of obscuring what the formalism seeks to reveal to us, if we only choose to take it seriously. We mentioned already one of them, namely wanting to think of the different personal block universes as if they were one single global block universe. But how are these different personal block universes related then? It is the coordinate velocities that play this role of relating the different experiencers, contributing to the structure of global reality, together with the free choices that experiencers can make at every personal instant, according to their personal power of fusing one of their creations with a selected happening, to bring an experience to life. It is worth mentioning here the hypothesis of superdeterminism <cit.>, according to which freedom of choice would not exist. If that hypothesis is true, our operational construction would not work. Indeed, it would mean that only one experience is possible at any instant. But if free choice does exist, the structure of global reality necessarily contains countless bifurcations towards the future, hence is very different from a unique block universe. That said, to shed some light on another major Newtonian bias, consider the notion of proper velocity, v_ p, also named celerity, the magnitude of which is not limited, as it can go from zero to infinity, contrary to coordinate velocity, v, whose magnitude can only go from zero to c=299 792 458 m/s. Proper velocity is rarely used for interpretative purposes, or in formulae, like for example in writing Lorentz transformations. But when we reason in terms of proper velocities, we find that light possesses an infinite proper speed, which allows one to understand the counterintuitive fact that light's coordinate speed is measured always equal to c, independently of the velocity of the source or of the experiencer <cit.>. To see this in some detail, let us consider two spatiotemporal frames of reference, Σ(t,x) and Σ'(t',x'), with the second frame moving at coordinate velocity V with respect to the first. Not to complicate our discussion unnecessarily, we will only consider one spatial dimension, therefore, time, position and velocity will all be scalar quantities in our discussion. To further simplify, let us also assume that the origins of the two frames, x = x' = 0, coincide at times t = t' = 0. The transformations to go from Σ(t,x) to Σ'(t',x'), called Lorentz boosts are then given by: t'=Γ(t-V/c^2x) x'=Γ(-Vt+x) Γ=1√(1-V^2 c^2) where Γ is the Lorentz factor. Similarly, the inverse transformations, to go from Σ'(t',x') to Σ(t,x), are obtained by considering the change V→ -V in the above formulae, which gives: t=Γ(t'+V/c^2x') x=Γ(Vt'+x') Suppose now that a body moves with coordinate velocity v with respect to Σ(t,x). To know the coordinate velocity it moves with respect to Σ'(t',x'), let us call it v', we have to derive the relativistic composition law for coordinate velocities. Using the above transformations, we obtain: v'= dx' dt'= Γ(-Vdt+dx)Γ(dt-V/c^2dx)=v-V 1 - Vv/c^2=c v - V c-Vv c where v= dx dt. When the magnitude of the velocities involved are small compared to c, the denominator in (<ref>) is approximately equal to 1, and the formula reduces to the additive Galilean composition law for coordinate velocities: v'≈ v-V. In other words, the theory of relativity tells us that the linear Galilean law is only an approximation of a more general non-linear law. One of the surprising aspects of the relativistic law is that in the limit v→ c, we obtain v'→ c. This means that everything happens as if relative motions did not matter in the limit where the speed of the body approaches c, in the sense that in both frames, Σ(t,x) and Σ'(t',x'), it is observed to be exactly the same. The above formulae tell us why this must be the case, but how can we understand this phenomenon on a more fundamental level? For this, it is important to remember that the revolution of the passage from Galilean relativity to Einsteinian relativity brings with it the passage from a single time, valid for every inertial experiencer, to a multiplicity of different times, which can be associated with the different inertial experiencers, and more generally with the different physical entities. When we calculate a velocity, a new problem therefore arises, which can be expressed with the following question: With respect to which temporal variation should one calculate the variation of the position of a physical entity? Let us consider the simple example of a car. Every modern motor vehicle is equipped with a so-called speedometer, an on-board instrument that allows to measure the distance traveled per unit time. But which time are we talking about here? Obviously, that measured by the speedometer's clock, which is part of the car and travels with it. To describe this situation, we now also consider the reference frame Σ_ p(t_ p,x_ p) associated with the center of mass of the car moving at coordinate speed v with respect to the reference frame Σ(t,x), associated with the road. Since by definition the car's center of mass is at rest at the origin of Σ_ p(t_ p,x_ p), Lorentz transformations (<ref>) reduce to: t=γ t_ p x=γ vt_ p γ=1/√(1-v^2/c^2) where t_ p is called proper time in relativity, and we have assumed that x=x_ p=0 at t=t_ p=0. The first of the above two identities is the time dilation relation, whereas by deriving the second identity with respect to t_ p, we find that the proper velocity v_ p=dx/dt_ p, i.e., the velocity measured by the speedometer, also called celerity, is given by v_ p=v γ =v/√(1-v^2/c^2) Clearly, when \|v\| is small compared to c, we have the approximation v_ p≈ v. We also observe that when \|v\|→ c, γ→∞ and \|v_ p\|→∞. In other words, if we measure the speed of light with a “speedometer protocol,” i.e., if we measure the proper spatial velocity of light, it no longer has a finite value, but an infinite one. We can also consider the composition law for proper velocities. For this, we also introduce the proper velocity V_ p=Γ V of the reference frame Σ'(t',x') with respect to Σ(t,x), and the proper velocity v'_ p=γ' v' of the entity under observation relative to the reference frame Σ'(t',x'), with v'_ p=dx'/dt_ p. Replacing v/c=tanhϑ in (<ref>), we find that v_ p c=sinhϑ, hence ϑ=sinh^-1v_ p/c, and similarly ϑ'=sinh^-1v'_ p/c, Θ=sinh^-1V_ p/c. Considering that ϑ'=ϑ - Θ, we deduce the composition law: v_ p^'=csinh(sinh^-1v_ p/c-sinh^-1V_ p/c) We can further transform this expression using the identities sinh(α-β)=sinhαcoshβ-coshαsinhβ and cosh(sinh^-1a)=√(1+a^2), which becomes: v_ p^'=v_ p√(1+V_ p^2/c^2)-V_ p√(1+v_ p^2/c^2) If the proper velocities involved are small compared to c, we recover the Galilean composition law v_ p^'≈ v_ p-V_ p, and if instead we let \|v_ p\|→∞, we have the asymptotic form: v_ p^'=v_ p(√(1+V_ p^2/c^2)-sign(v_ p)V_ p/c)+O(v_ p^-1) So, when using the notion of proper velocity, the counter-intuitiveness of the invariance of the speed of light disappears. Indeed, for photons and other zero-rest mass entities, the magnitude of their proper velocities is infinite, compatibly with (<ref>), since multiplying a (positive or negative) infinity by a positive constant has no effect: ±∞=±∞(√(1+V_ p^2/c^2)-sign(v_ p)V_ p/c) Now, if v_ p is the notion one should use to characterize the spatial movement of an entity, consistent with our previous operational construction of reality, where time is something strictly personal, it follows that the historical coordinate velocity v would provide a misleading representation of the movement of a physical entity, but considering that there is no difference between v_ p and v in the non-relativistic regime, we had no way of becoming aware of the problem before the advent of relativity. More precisely, the coordinate velocity v would contain an undue relativistic contraction, as is clear that, reversing (<ref>), we have: v=1√(1+v_ p^2 c^2) v_ p We can then say that because of the contraction (<ref>), which we were not aware we were performing in pre-relativistic times, a quantity whose range should naturally go from 0 to ∞ (celerity v_ p), was contracted into a quantity with a bounded interval going from 0 to c (coordinate velocity v). In other words, the coordinate speed of light is always equal to c, which is the limit value of \|v\|, because it would not be its true spatial speed, but an infinite contraction of it, perfectly calibrated to always obtain the same finite value c, equal to 299 792 458 m/s. § MOVING WITH A FOUR-VELOCITY As a natural continuation and deepening of our analysis, we can observe that the proper velocity of a body also corresponds to the spatial component of a more general four-velocity, a notion introduced in every textbook of relativity. Surprisingly, the magnitude of the four-velocity, in any reference system, is always exactly equal to c, and although this is a known result, it is usually regarded as a mere mathematical property with no physical meaning. But considering that Lorentz transformations can be derived without using Einstein's second postulate <cit.>, the structural parameter c appearing in them can be given a more general interpretation, as the absolute speed of all material entities, whose motions occur in the entire spacetime, since they are always characterized by a nonzero time component. Let us see this in some detail, always limiting our discussion to a single spatial dimension, hence the four-velocity will be here a two-velocity, with a time component and a single spatial component, but for clarity we will keep calling it four-velocity. More precisely, the four-velocity of an entity, relative to a reference frame Σ(t,x), is given by the (here two-dimensional) vector <cit.>: u_ p= [v^0_ p v_ p ]= [cdt/dt_ p cdx/dt_ p ] = [cγ vγ ] To calculate its magnitude u_ p, one has to use the Minkowski metric, which has a minus sign for the spatial variables and a plus sign for the time variable. This gives: u_ p=√((v^0_ p)^2-(v_ p)^2)=√((cγ)^2-(vγ)^2)=γ√(c^2-v^2)=c As we said, physicists do not pay much attention to this remarkable result. However, if we dare to take it seriously, it tells us something fundamental, namely that every physical entity always moves, relative to its personal block universe, hence on its worldline, at the same (proper) speed, which has the same value as the coordinate speed of light c. They do so “always" in the sense that the magnitude of the four-velocity does not depend on the choice of the reference frame, hence, it is truly an intrinsic property of the moving entity. More specifically, the spatiotemporal (proper) velocity u_ p has two components: a temporal component, v_ p^0, corresponding to the proper time velocity with which the entity moves along the temporal axis, and a spatial component, v_ p, corresponding to the proper space velocity with which it moves along the spatial axis (or spatial axes, if there is more than one spatial dimension). The proper time velocity v_ p^0 = γ c is always positive, and we can interpret this as an indication that we can never go back in time, whereas the proper space velocity v_ p = γ v has the sign of v, which can be both positive and negative, depending on the direction of motion along the x-axis. Furthermore, as we have already emphasized, \|v_ p\| can take values ranging from 0 to infinity, when \|v\| goes from 0 to c. The proper time velocity can also reach infinity, when v tends to c, but its minimum value, which is obtained when v tends to 0, is c. If v = 0, this means that the entity in question is spatially at rest with respect to the reference frame Σ(t,x). But even when spatially at rest, temporally it will never be at rest, since its proper time velocity is then equal to c. If we compare the magnitudes of the temporal and spatial components of the four-velocity u_ p, we immediately see from (<ref>) that in the non-relativistic regime, \|v\| c→ 0, the movement along the time-direction, v_ p^0→ c, dominates, as is clear that v_ p^0-\|v_ p\|=v_ p^0(1-\|v\| c). On the other hand, in the ultrarelativistic regime, \|v\| c→ 1, the magnitudes of the temporal and spatial movements become comparable, v_ p^0-\|v_ p\|→ 0, with both speeds tending to infinity, since γ→∞ when \|v\|→ c. The equality \|v\|= c can only hold for entities of zero-rest mass, like photons. Hence, unlike material entities with non-zero rest mass, although they also move at spatiotemporal speed c, photons also possess infinite proper speeds along the temporal and spatial axes. But these two infinite values are such that they always compensate with precision when calculating the magnitude of the full spatiotemporal velocity (<ref>), thanks to the Minkowskian metric, to always yield the finite value c. § MULTIPLICITY OF TIMES To further analyze the meaning of a movement also happening `in time', we first observe that the temporal dimension, when viewed as part of a spacetime, also possesses the dimension of a length, the time variable being multiplied by the speed c. In other words, time is here considered on a par with a spatial dimension. For example, if the time unit is taken to be one year, then the corresponding unit of length will be one light year. More concretely, in addition to the movement introduced by Copernicus, i.e., a movement around the Sun, that the Earth performs in one year, in that same year Earth also moves a temporal distance which is approximately one light-year. In other words, although we have previously considered reference systems of the Σ(t,x) kind, with (t,x)-variables, when we move to a discussion where the four-velocity is considered to be a relevant physical quantity, we must also consider the time axis as an axis having the dimension of a length, i.e., we must consider a dimensionally homogeneous reference system S(ct,x), with (ct,x)-variables, in which a photon's worldline becomes the bisector between the temporal ct-axis and the space x-axis; see Figure <ref>. Our previous analysis also makes it clear that when describing the movement of an entity, we must always consider its proper time, and that if an entity A' moves with respect to another entity A, say with coordinate velocity V, then it will move `in time' along a proper time direction that will be different from that along which entity A moves `in time'. The existence of this multiplicity of different time directions, instead of a single global chronological time, can more easily be understood when adopting a geometric perspective. Imagine a spatial (x,y)-plane, equipped with the usual Euclidean metric. We know that we can draw an infinite number of lines passing from the origin of the chosen reference system, and that all these lines correspond to different spatial directions. In much the same way, a spatiotemporal (ct,x)-plane, equipped with Minkowski's metric, also has infinitely many lines passing through the origin and contained in the light cone, which correspond to the different possible proper time directions, hence to the different possible worldlines; see Figure <ref>. When we say that A' moves relative to A with coordinate velocity V, it means that we describe the movement of the centre of mass of A' in the coordinate system of A, with S(ct,x) the reference systems associated with A and S'(ct',x') the reference systems associated with A'; see Figure <ref>. We can of course also consider the situation of the center of mass of the entity A moving with coordinate velocity -V relative to the coordinate system of A'; see Figure <ref>. The first situation is a description in which the x-space points of A, which are the points of simultaneity with respect to A, are taken as the scene. The second situation is a description in which the x'-space points of A', which are the points of simultaneity with respect to A', are taken as the scene. These two scenes, precisely because of the non-existence of a common notion of simultaneity for A and for A', are very different from each other, and yet we still usually reason about them as if they were one and the same stage. Now, as long as we are talking about point particles, or only considering the center of mass of entities, one can still maintain this illusion that there would be a single spatiotemporal scenery, but when macroscopic entities having a volume and a shape are involved, the exercise becomes much more difficult, for the appearance of an entity in one scene no longer corresponds to the same appearance in a different scene, because of how the relativistic effects act differently on the different elements forming the entity in question. To make this more concrete, consider a material entity having the shape of a cuboid. Since in our discussion we are only considering a single dimension of space, the cuboid will reduce to a one-dimensional rod. If we try to represent this rod similarly to what we did in Figures <ref> and <ref> for a center of mass material entity, we obtain the diagrams of Figures <ref> and <ref>. We see that a same rod occupies a very different set of spacetime points in the two experiencer's coordinate systems S(ct,x) and S'(ct',x'). This is because the set of spacetime points occupied by the rod in one coordinate system are those that realize a condition of simultaneity there, which are not the same set of simultaneity points for the other coordinate system. Also, if one considers the worldlines of all spacetime points forming the rod, one obtains two different worldtubes, in the two reference systems, corresponding to the two regions colored blue and orange in Figures <ref> and <ref>. Hence, in the same way the hyperplanes of spatial simultaneity (which in our simplified situation are just lines) that are associated with a spatially extended entity are fundamentally different for experiencers moving relative to each other, the same is true for the corresponding worldtubes, which also present themselves in a very different way in the personal spaces of these experiencers. Hence, we can say that the typical block universe strategy which consists in considering the worldtubes as the elements of reality, i.e., as `what exists' in relativity, fails for the same reasons that simultaneity fails in relativity. § TEMPORAL ENERGY The perspective describing the movement of physical entities as happening not only in space, but also in time, allows to additionally explain the origin of Einstein's mass-energy equivalence as a form of temporal energy, and this is an extra argument for taking seriously the notion of four-velocity in special theory of relativity. To see this, let us start by recalling that the four-velocity retains, in the relativistic regime, the interpretation of being equal to the momentum of an entity per unit of its mass. Indeed, if we define the four-momentum (which is a two-momentum, in our case) by p_ p=m_0u_ p, we have p_ p= [p_ p^0 p_ p^ s ]= m_0 [v_ p^0 v_ p ]= m[ c v ] p_ p=m_0 c m=γ m_0 where m_0 is the rest (proper) mass and m is the (coordinate) relativistic mass. We can then observe that the spatial component p_ p^ s of the four-momentum is given by the usual relation of mass times velocity, which holds either for the proper space velocity, and then the rest mass has to be used, or for the coordinate velocity, and then the relativistic mass has to be used: p_ p^ s=m_0 v_ p = m v. On the other hand, the momentum time component, p_ p^0 = mc=E/c, corresponds to the energy of the entity in question divided by its spatiotemporal speed c (which is also the coordinate speed of light), where E is given by the famous Einsteinian formula E=mc^2=m_0γ c^2. In the limit v_ p→ 0, of an entity spatially at rest, we have E = m_0c^2, p_ p^0=m_0c and p_ p^ s=0. This explains why all the energy contained in the entity's rest mass m_0 can be interpreted as the energy associated with its motion, at speed c, along it's time direction, i.e., as a form of kinetic temporal energy. What about these formulas for zero rest mass entities like photons? If m_0 = 0, the temporal and spatial proper velocities are infinite and we have indeterminate expressions of the type “zero times infinity." However, when m_0 = 0, we also get from (<ref>) that p_ p=0, which implies: p_ p^2=(p_ p^0)^2-(p_ p^ s)^2=(E/c)^2-(p_ p^ s)^2=0 from which we obtain E=c p_ p^ s, which expresses the correct relationship between the energy and spatial proper momentum of a photon. Of course, to get the more specific Planck-Einstein relations <cit.>, E=hν, p_ p=h/λ and νλ=c, which relate energy and momentum to the frequency ν and wavelength λ associated with a photon, one needs to revert to quantum mechanics. § QUANTUM AND CONCEPTUALITY Coming to quantum mechanics, our analysis shows that concepts that specifically came to prominence in quantum theory, already made their appearance in relativity theory, and one of these concepts is contextuality. As we mentioned already, the fact that for each experiencer it is necessary to consider his/her personal spacetime, this is a form of contextuality, albeit of a specific relativistic type. As we noted, the operational analysis of `what exists' is inspired by our research in axiomatic quantum mechanics, where it is assumed that reality is non-deterministic and experiencers can make unpredictable choices <cit.>. On the other hand, even more important for the analysis we proposed in this article, is the quantum mechanical notion of non-locality, which in our research group we view as an expression of non-spatiality, a notion that one of us introduced as early as the late 1980s <cit.> and was discussed in a number of works <cit.>. Of course, others have also subsequently realized its importance, like Ruth Kastner in her possibilist transactional interpretation <cit.>. In other words, for over forty years the idea has been proposed that quantum physics can only be understood if one accepts that our physical reality is essentially non-spatial, and more generally non-spatiotemporal <cit.>. It is important to underline, however, that the notion of non-spatiality was not introduced as a mere philosophical speculation, but as a necessary ingredient to really explain the behavior of quantum entities in key experiments. We have already mentioned in Section <ref> those about entanglement, but they were certainly not the only ones. Just to provide another important example, in the seventies of the last century a number of experiments were carried out with ultracold neutrons, using perfect silicon crystal interferometers, which allowed to test all sorts of quantum properties, like the 4π-symmetry of spin-1/2 entities <cit.>. When these experiments are analyzed without preconceptions, it is clear that neutrons cannot be interpreted as spatial entities, be them localized or extended <cit.>. More specifically, many of the mysterious quantum features, like superposition, measurement, entanglement, complementarity and indistinguishability, can be considered to be an expression of the non-spatiotemporality of the quantum entities, i.e., of the fact that, generally speaking, the presence of a quantum entity within the spatiotemporal theater described by a given frame of reference is only of a potential nature, hence, spacetime should be viewed not only as an emerging personal structure that can be associated to each macroscopic material entity, but also as a specific experimental context that can be concretely implemented by providing specific position measuring instruments. The question of the reality status of movement in time can also be better grasped if placed in the broader perspective of quantum mechanics. In our view, it is fair to say that in a context where spacetime has emerged, a motion in time is as real as a motion in space. Furthermore, when time and space are considered jointly, time appears to be more fundamental, the change we experience being more properly related to it, while space defines the scenery within which we can order change, not only our own but also that of other entities. The fourth temporal dimension, which in Minkowski's representation is also a spatial dimension, should not, however, be trivially identified with time as such, that is, with what is at the origin of change. And just as it is necessary to have a reference spatial domain to give meaning to the notion of spatial proper velocity, in the same way a reference time domain (associated with a clock) is necessary to give meaning to the notion of temporal proper velocity, which as we have seen is always greater than or equal to c, and similar to pre-Copernican times (see the discussion in the concluding section), the reason why we hadn't figured out this additional time velocity is because it isn't easy to experience it, just as it wasn't easy to experience the speed of Earth in space. However, if there is a non-spatiotemporal domain underlying the spatiotemporal one, it remains an open question to know what change means in that domain, while preserving the possibility of also explaining the kind of change that we all experience continuously and in a completely evident way. In this regard, we proposed the conceptuality interpretation <cit.>, an interpretation of quantum mechanics, still in development, that gives a concrete expression to this non-spatiality and non-temporality. Of course, it is not possible in the limited space of this article to go into the merits of this interpretation, which we believe offers the missing ontology and metaphysics that can make quantum and relativity theory fully intelligible, by allowing to explain those key phenomena that in most interpretations remain unexplained. Its basic assumption is that quantum entities, in their states that are subject to measures, are conceptual entities, hence ontologically similar to human concepts (but not to be confused with the latter), in the sense that they are carrier of a substance, in the quantum jargon referred to as coherence, which is similar to meaning, and that measuring apparatuses behave similarly to cognitive entities that are sensitive to their meanings. Hence within this conceptuality interpretation the ontological nature of `object' for a quantum entity is put into question. To make the similarity with human language more concrete, consider the concept `horse'. Obviously, it is not an object, and only a very concrete instantiation of it, for example `one specific material horse standing in a meadow that can be petted', becomes an object. Similarly, a quantum entity would be conceptual in nature (although not a concept belonging to the human cognitive domain), thus capable of changing its state in becoming more objectual, i.e., more concrete, more localized in space, or more conceptual, i.e., more abstract, more de-spatialized, and this inevitable trade-off between concrete and abstract, between objectual and conceptual, would be nothing more than an expression of Heisenberg's uncertainty principle. We are also now in a position to answer the question with which we concluded Section <ref>. We have placed a strong emphasis on the way in which the existence of free choice, for each experiencer, affects the nature of their personal block universes, specifically with the presence of bifurcations at each point of their worldlines, the structure of which expresses the reality of these free choices of the experiencers. Does this mean that in the absence of experiencers, that is, for example, in the period when human beings had not yet appeared on the Earth's surface, there were no bifurcations on the worldlines of physical entities? Certainly not. Perhaps it is not appropriate to speak of free choice here, but a physical entity composed of fermionic matter will be associated with the intrinsic and irreducible indeterminism that is manifested at the quantum level, when such a physical entity is used as a measuring instrument. Just as we believe that relativistic effects exist whether or not there are experiencers to experience them, we also believe that the irreducible quantum indeterminism associated with the interactions of a physical entity exists, whether or not a physical entity is used as a measuring instrument. This is also understood in the assertion, in the conceptuality interpretation, that a piece of fermionic matter behaves as a cognitive entity and thus can play the role of an experiencer in relativity, giving rise to the presence of these bifurcations at all points along its worldline. § EXPLAINING MINKOWSKI Keeping the conceptuality interpretation of quantum mechanics in mind, in this section we indicate how the Minkoswki metric can be explained under the assumption that experiencers are cognitive entities making reasoning processes, and that the content of their reasonings, when going from a given hypothesis to a given conclusion, are the conceptual entities they interact with. Our additional assumption, which reflects the observation that the magnitude of the four-velocity is an invariant, is that they all reason at the same intrinsic speed, to be interpreted as the frequency with which they produce their elementary cognitive steps. More precisely, let us suppose that the reasoning process of experiencer A happens in 8 conceptual steps, ranging from an initial hypothesis, happening at personal time t_ p^(0), to a certain conclusion, happening at personal time t_ p^(8). To order his/her process, experiencer A will attribute a same length L_A to all of its 8 steps, which will be organized sequentially along an axis: his/her proper time axis; see Figure <ref>. So, we are assuming that the speed with which the different steps are produced is always the same and would in fact correspond to c, according to our previous analysis. Imagine then that experiencer A does not want to only describe his/her specific process, which produces a conclusion in 8 steps, but is also interested in putting it in relation with other cognitive processes. Imagine a second process, produced by another cognitive entity, let us call him/her experiencer A', who starts from the same hypothesis and reaches the same conclusion, but he/she does so in only 4 steps, so, in a sense, experiencer A' produces a more effective reasoning. When experiencer A' focuses on his/her cognitive process, he/she will of course also introduce a personal time axis, to order his/her 4 elementary steps, which will also take place at the speed of light. But how does experiencer A also represent the reasoning of experiencer A' in a coherent way, considering that in just 4 steps he/she reaches the same conclusion, starting from the same hypothesis? Clearly, he/she cannot represent it directly on the axis that was built to order his/her 8-step reasoning, because the steps of both experiencers, A and A', are elementary cognitive steps, produced at the exact same speed. To put it differently, they are steps of the same “length,” and the scale on the time axis of experiencer A has been defined in such a way that, to go from the hypothesis to the conclusion, exactly 8 elementary steps are needed, and not 4. Therefore, either experiencer A renounces to relate his/her cognitive process with that of experiencer A', or, if he/she wants to do so, he/she will have to introduce new Cartesian axes, with new parameters. And these would be axes of a spatial kind for experiencer A. So, in our situation, A can simply build a new axis orthogonal to the first one, and describe the cognitive process of experiencer A' as something that moves along the direction of such new axis, at a certain speed v, starting from the common point of the hypothesis, to then reverse the direction of travel to go back and meet again experiencer A, at the spatiotemporal point corresponding to the joint conclusion. Now, as can be seen on Figure <ref>, there would be a problem if one tries to interpret this construction using the Euclidean geometry. Indeed, as we said, the two experiencers' elementary steps are perfectly equivalent, as they happen at the same speed, in the same abstract atemporal background. But according to the aforementioned construction, it would seem that the steps of experiencer A' are longer. And this is where the Minkowskian, non-Pythagorean metric comes in, allowing the hypotenuse of a triangle to be shorter than one of its two catheti, so that the steps of experiencer A' can become exactly of the same length as those of experiencer A. More precisely, if L is the component of the length of an elementary step L_A', taken by experiencer A' along the space axis of experiencer A, then according to the Minkowski metric we have (see Figure <ref>): L_A'^2 =(c t_A')^2 -L^2, so that the requirement that L_A=L_A', or equivalently L_A^2=(c τ_A)^2, considering that τ_A=t_A'/γ and c τ_A= √(c^2-v^2) t_A', gives: (c^2-v^2) t^2_A' =(c t_A')^2 -L^2, that is, L=vt_A'. In other words, by adopting a pseudo-Euclidean metric, experiencer A constructs a spacetime theater in which he/she can now consistently keep track not only of his/her cognitive processes, but also of those associated with experiencer A'. Of course, a single spatial axis will be sufficient when considering only two entities, but additional axes are needed if further entities are jointly considered <cit.>. It is of course a limitation of us humans to not be able to view the diagram of Figure <ref> in the correct way, as we have evolved using bodies whose relative motions, when described in a spatiotemporal theater, are very slow relative to the speed of light. So, for us it was as if the construction of the time axis and of the spatial axes were perfectly independent, when instead they are intimately connected. In other words, since the relativistic effects were negligible for us, we have not incorporated them in our mental representation of the world. § CONCLUDING REMARKS Summing up what we did, we have analyzed how an operational construction of reality allows us to overcome the limitations of the block view of the universe, by reintroducing change/creation into our description of the physical world, carefully distinguishing the observers, that we have more generally called experiencers, from the spatiotemporal representations with which they can be associated, but of which they are not a part, in the same way that a reader walking between the lines of a book is not a part of its narrative. Thanks to this demarcation, it became possible to look at Langevin's twins' situation from a different perspective, extracting from it the information that each experiencer (and by extension each material entity) is associated with a personal spacetime that is a construction in which the future is also in the present, in the sense that it contains the worldtubes of all entities different from their own body. We also analyzed motion from a new perspective, emphasizing that it is the notion of proper velocity that allows to understand the counterintuitive aspects of the invariance of the speed of light. We emphasized that the proper velocity is a component of the so-called four-velocity, which if taken seriously reveals that motion manifests not only with respect to space, but also, and especially, with respect to time, with all physical entities moving with the same proper four-speed, which only incidentally is equal to the coordinated speed of light c. Therefore, the latter should be primarily understood as a velocity in time, since massive entities always move with that velocity along their personal time directions, when spatially at rest in their own frames of reference. And from that perspective, a spaceship should be primarily called a timeship! In other words, motion would not be what we usually think it is, and we can say that we remain crypto-Newtonians in relativity textbooks, when we only connect c to the coordinate speed of light, without saying that, in the first place, it describes a `speed in time', when entities are spatially at rest, and more precisely a `speed along the fourth dimension of a four-dimensional space', which only for historical reasons continues to be called a time dimension, as part of a spacetime. In this regard, let us observe that the fourth dimension intervening in the Minkowski metric is really ct, and not t, a fact that we emphasized in Section <ref>, when we considered a dimensionally homogeneous spatial reference system S(ct,x), with (ct,x)-variables, instead of a dimensionally inhomogeneous spatiotemporal system Σ(t,x), with (t,x)-variables. This means that the block universe should really be understood as a space of four dimensions, and not as a spacetime. And clearly, nothing changes in a pure spatial domain, as things can change in `a space' only with respect to `a time'. This was true for the pre-relativistic Newtonian three-dimensional space and will remain true for the relativistic four-dimensional Minkowski space, which should really be called `a space' and not `a spacetime'. Now, if physical entities actually move in a four-dimensional Minkowskian space, which means that the latter is not just a mathematical artefact but a real structure emerging from a deeper non-spatial domain, as we emphasized in Section <ref>, we have to admit that the revolution initiated by Copernicus remains to be completed, since this extended four-dimensional spatial movement is still not properly taken into account today in our relativistic description of the motion of physical entities, while our analysis shows that this speed in time exists on a par with the speed in space revealed by the Copernican revolution. To understand why this is the actual state of affairs, let us take a step back for a moment and return to the famous phrase anecdotally attributed to Galileo Galilei, after he was obligated to retract his claims that, following Copernicus, the motions appearing in the firmament were the consequence of Earth's motion: “And yet it moves” (“eppur si muove”). This phrase points to one of the difficulties in accepting the new Copernican view: that humans do not directly perceive the movement of the planet. If this was indeed the case, then of course Galileo's perspective would have not been controversial, but mere experimental evidence. What we consider as experimental evidence, however, also depends on our conceptualization of the world, so much so that ideas about what would be the effects of a moving Earth, say on the trajectory of projectiles, and the lack of observation of these effects, were considered at the time to be evidence of the falsity of the view of a planet moving around the Sun and spinning on its axis. What was underestimated was the fact that everything on the planet's surface was moving with it, including its inhabitants, and therefore the latter could not perceive with their senses, nor with elementary experiments, the planet's rotational motion, around itself and around the sun. Of course, following Galileo, we discovered other means to highlight the planet's movement, like observing the period of a Foucault pendulum, watching the planet rotate on itself directly from space, thanks to satellites, and for what concerns its revolution around the sun we can use phenomena such as stellar parallax, stellar aberration, and the Doppler effect. So, Copernicus, and later Galileo, revolutionized our view on movement, allowing us to become aware of the existence of movements that until then we were unaware of, and this not because they were hidden. As Edgar Allen Poe famously emphasized, the best place to hide something is often right out in the open. We humans were all openly moving together with the planet, but precisely because of that, we were not able to detect the planet's motion. Even though the planet motion is not a uniform one, our past blindness with respect to it was also in part related to the fact that, with good approximation, the planet's surface can be considered to be an inertial frame of reference, in the sense that in our day-to-day experiences the effects due to rotation, like the centrifugal and Coriolis fictitious forces, remain minuscule. And as Galileo himself observed, in his relativity principle per se, inertial frames constitute non-trivial equivalent viewpoints on our physical world, where physical phenomena are perceived to be the same. Einstein's relativity is the next great revolution about motion, but similarly to Copernican revolution its acceptance does not appear to be easy, and it is the thesis we defend in this article that it has not been fully achieved, because what we physicists have not fully realized is that `Mikowski space' is as real as its little brother `Newton space', hence the material entities move much more and rather differently than the way Copernicus told us. The Polish astronomer changed our view by making us aware that Earth was actually also moving in space, but such movement would not be the end of the story, because Earth and all the other entities with a rest-mass different from zero would also move extremely swiftly along a fourth dimension. But again, since we all do so incessantly and all together, somehow similarly to what happened centuries ago with Earth's spatial movement, we do not perceive such additional movement and we can question its reality. Just as we can question the existence of a deeper non-spatial layer of reality where processes of change would actually occur. This is not to say that there are no signs that would allow us to infer the existence of such motion along the fourth dimension, and as we pointed out in Section <ref>, one of these would be the famous mass-energy equivalence, which would be precisely the expression of a kinetic-type of energy along that additional spatial axis associated with the temporal direction. But apparently, these signs are currently being interpreted differently, so we can argue that Einstein’s relativity revolution has not yet been completed. Our hope is that this contribution of ours will help overcoming our residual pre-relativistic preconceptions and embracing the relativistic revolution more fully. [Aerts(1982)]Aerts1982 Aerts, D. (1982). Description of many physical entities without the paradoxes encountered in quantum mechanics. Foundations of Physics 12, pp. 1131–1170. [Aerts(1983)]Aerts1983 Aerts, D. (1983). Classical-theories and non-classical theories as a special case of a more general theory. Journal of Mathematical Physics 24, pp. 2441–2453. [Aerts(1990)]Aerts1990 Aerts, D. (1990). An attempt to imagine parts of the reality of the micro-world. pp. 3–25, In J. Mizerski et al. (Eds.), Problems in Quantum Physics II; Gdansk ’89. World Scientific Publishing Company: Singapore. [Aerts(1996)]Aerts1996 Aerts, D. (1996). Relativity theory: what is reality? Foundations of Physics 26, pp. 1627–1644. [Aerts(1998)]Aerts1998 Aerts, D. (1998). The entity and modern physics: the creation discovery view of reality. In E. Castellani (Ed.) Interpreting Bodies: Classical and Quantum Objects in Modern Physics, pp. 223–257. Princeton University Press: Princeton. [Aerts(1999)]Aerts1999 Aerts, D. (1999). The stuff the world is made of: physics and reality. In: D. Aerts, J. Broekaert and E. Mathijs (Eds.), Einstein meets Magritte: An Interdisciplinary Reflection (129–183). Dordrecht: Kluwer Academic. [Aerts(2018)]Aerts2018 Aerts, D. (2018). Relativity Theory Refounded. Foundations of Science 23, pp. 511–547. [Aerts & Sassoli de Bianchi(2017)]Aertssassolidebianchi2017 Aerts, D. & Sassoli de Bianchi, M. (2017). Quantum measurements as weighted symmetry breaking processes: the hidden measurement perspective. International Journal of Quantum Foundations 3, pp. 1–16. <https://www.ijqf.org/archives/3777>. [Aerts & Sassoli de Bianchi(2022a)]AertsSassoli2022 Aerts, D. & Sassoli de Bianchi, M. (2022a). The conceptuality interpretation: the missing ontology and metaphysics of quantum mechanics. To be published. [Aerts & Sassoli de Bianchi(2022b)]aertssassolidebianchi2022 Aerts, D. & Sassoli de Bianchi Massimiliano (2022b). The Nature of Time in Operational Reality, Frontiers in Psychology, to be published. [Aerts et al.(2018)]Aertsetal2018 Aerts, D., Sassoli de Bianchi, M., Sozzo, S. & Veloz, T. (2020). On the Conceptuality interpretation of Quantum and Relativity Theories, Foundations of Science 25, pp. 5–54. [Bell(1964)]bell1964 Bell, J.S. (1964). On the Einstein-Podolsky-Rosen paradox. Physics 1, pp. 195–200. [Bonse & Rauch(1979)]BonseRauch1979 Bonse. U. & Rauch H. (eds.) (1979). Neutron interferometry. Proceedings of an International Workshop held 5–7 June 1978 at the Institute Max von Laue–Paul Langevin, Grenoble (Clarendon Press, Oxford). [Brans(1988)]Brans1988 Brans, C.H. (1988). Bell's theorem does not eliminate fully causal hidden variables. Int. J. Theo.r Phys. 27, pp. 219–226. [Einstein(1905)]Einstein1905 Einstein, A. (1905). Zur Elektrodynamik bewgter Körper, Annalen der Physik 17, pp. 891–921. [Einstein(1920)]einstein1920 Einstein, A. (1920). Relativity, the Special and General Theory. New York: Henry Holt and Company. [Einstein et al.(1935)]EPR1935 Einstein, A., Podolsky, B. & Rosen, N. (1935). Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 47, pp. 777–780. [Frank & Rothe(1911)]FrankRothe1911 Frank, P. & Rothe, H. (1911). Über die Transformation der Raumzeitkoordinaten von ruhenden auf bewegte Systeme, Ann. d. Phys. 34, pp 825–855. [Freedman & Clauser(1972)]freedmanclauser1972 Freedman, S. J. & Clauser, J. F. (1972). Experimental test of local hidden-variable theories. Physical Review Letters 28, pp. 938–941. [Greenberger(1983)]Greenberger1983 Greenberger, D. M. (1983). The neutron interferometer as a device for illustrating the strange behavior of quantum systems, Rev. Mod. Phys. 55, 875. [Hasegawa & Rauch(2011)]Hasegawa2011 Hasegawa Y. & Rauch, H. (2011). Quantum phenomena explored with neutrons, New J. Phys. 13, 115010. [Hossenfelder(2020)]Sabine2020 Hossenfelder, S. & Palmer, T. (2020). Rethinking Superdeterminism, Frontiers in Physics 8, doi: 10.3389/fphy.2020.00139. [Ignatowsky(1910)]Ignatowsky1910 Ignatowsky, W. V. (1910). Das Relativitätsprinzip, Archiv. der Math. und Phys. 17, pp. 1–24 (1910); Archiv. der Math. und Phys. 18 pp. 17–40 (1911). [Kastner(2012)]kastner2012 Kastner R. E. (2012). The possibilist transactional interpretation and relativity. Foundations of Physics 42, pp. 1094–1113. [Kastner(2022)]kastner2022 Kastner, R. E. (2022) Physical time as human time. PhilSci Archive. http://philsci-archive.pitt.edu/21052. [Leblond(1976)]Leblond1976 Lévy-Leblond, J.-M. (1976). One more Derivation of the Lorentz Transformation. Am. J. Phys. 44, pp. 271–277. [Minkowski(1908)]Minkowski1908 Minkowski, H. (1908). Die Grundgleichungen für die elektromagnetischen Vorgänge in bewegten Körpern". Nachrichten von der Gesellschaft der Wissenschaften zu Göttingen, Mathematisch-Physikalische Klasse, pp. 53–111. [Piron(1976)]Piron1976 Piron C. (1976). Foundations of Quantum Physics. Reading, MA: W.A. Benjamin. [Planck(1901)]Planck1901 Planck, M. (1901). Ueber das gesetz der energieverteilung im normalspectrum, Annalen der Physik 309, pp. 553–560. [Ingram & Tallant(2022)]presentism Ingram, D. & Tallant, J. (Winter 2022). Presentism, The Stanford Encyclopedia of Philosophy, Edward N. Zalta & Uri Nodelman (eds.), https://plato.stanford.edu/archives/win2022/entries/presentism. [Rauch & Werner(2015)]RauchWerner2015 Rauch H. & Werner, S. A. (2015). Neutron Interferometry: Lessons in Experimental Quantum Mechanics, 2nd ed. (Oxford University Press, Oxford). [Sassoli de Bianchi(2017)]Sassolidebianchi2017 Sassoli de Bianchi, M. (2017). Theoretical and conceptual analysis of the celebrated 4π-symmetry neutron interferometry experiments. Foundations of Science 22, pp. 627–653. [Sassoli de Bianchi(2021)]Sassolidebianchi2021 Sassoli de Bianchi, M. (2021). A non-spatial reality. Foundations of Science 26, pp. 143–170. [Weish et al.(1998)]weishetal1998 Weihs, G., Jennewein, T., Simon, C., Weinfurter, H. and Zeilinger, A. (1998). Violation of Bell's inequality under strict Einstein locality conditions. Physical Review Letters 81, 5039.
http://arxiv.org/abs/2306.09643v1	20230616061055	BISCUIT: Causal Representation Learning from Binary Interactions	[ "Phillip Lippe", "Sara Magliacane", "Sindy Löwe", "Yuki M. Asano", "Taco Cohen", "Efstratios Gavves" ]	cs.LG	[ "cs.LG", "cs.AI", "stat.ME" ]	1]mailto:[email protected]?Subject=UAI2023-BISCUITPhillip Lippe 2,3]Sara Magliacane 2]Sindy Löwe 1]Yuki M. Asano 4]Taco Cohen 1]Efstratios Gavves [1] QUVA Lab, University of Amsterdam [2] AMLab, University of Amsterdam [3] MIT-IBM Watson AI Lab [4] Qualcomm AI Research 0.9! Qualcomm AI Research is an initiative of Qualcomm Technologies, Inc. Amsterdam, Netherlands [ Received: date / Accepted: date =================================== Identifying the causal variables of an environment and how to intervene on them is of core value in applications such as robotics and embodied AI. While an agent can commonly interact with the environment and may implicitly perturb the behavior of some of these causal variables, often the targets it affects remain unknown. In this paper, we show that causal variables can still be identified for many common setups, e.g., additive Gaussian noise models, if the agent's interactions with a causal variable can be described by an unknown binary variable. This happens when each causal variable has two different mechanisms, e.g., an observational and an interventional one. Using this identifiability result, we propose , a method for simultaneously learning causal variables and their corresponding binary interaction variables. On three robotic-inspired datasets, accurately identifies causal variables and can even be scaled to complex, realistic environments for embodied AI. Project page: https://phlippe.github.io/BISCUIT/phlippe.github.io/BISCUIT/. § INTRODUCTION Learning a low-dimensional representation of an environment is a crucial step in many applications, robotics <cit.>, embodied AI <cit.> and reinforcement learning <cit.>. A promising direction for learning robust and actionable representations is causal representation learning <cit.>, which aims to identify the underlying causal variables and their relations in a given environment from high-dimensional observations, images. However, learning causal variables from high-dimensional observations is a considerable challenge and may not always be possible, since multiple underlying causal systems could generate the same data distribution <cit.>. To overcome this, several works make use of additional information, by using counterfactual observations <cit.>, observed intervention targets <cit.>. Alternatively, one can restrict the distributions of causal variables, by considering environments with non-stationary noise <cit.> or sparse causal relations <cit.>. In this paper, instead, we focus on interactive environments, where an agent can perform actions which may have an effect on the underlying causal variables. We will assume that these interactions between the agent and the causal variables can be described by binary variables, that with the agent's actions, we can switch between two mechanisms, or distributions, of a causal variable, similarly to performing soft interventions. Despite being binary, these interactions include a wide range of common scenarios, such as a robot pressing a button, opening/closing a door, or even colliding with a moving object and alternating its course. In this setup, we prove that causal variables are identifiable if the agent interacts with each causal variable in a distinct pattern, does not always interact with any two causal variables at the same time. We show that for K variables, we can in many cases fulfill this by having as few as ⌊log_2 K ⌋ +2 actions with sufficiently diverse effects, allowing identifiability even for a limited number of actions. The binary nature of the interactions permits the identification of a wider class of causal models than previous work in a similar setup, including the common, challenging additive Gaussian noise model <cit.>. Based on these theoretical results, we propose (). is a variational autoencoder <cit.> which learns the causal variables and the agent's binary interactions with them in an unsupervised manner (see <ref>). In experiments on robotic-inspired datasets, identifies the causal variables and outperforms previous methods. Furthermore, we apply to the realistic 3D embodied AI environment iTHOR <cit.>, and show that is able to generate realistic renderings of unseen causal states in a controlled manner. This highlights the potential of causal representation learning in the challenging task of embodied AI. In summary, our contributions are: * We show that under mild assumptions, binary interactions with unknown targets identify the causal variables from high-dimensional observations over time. * We propose , a causal representation learning framework that learns the causal variables and their binary interactions simultaneously. * We empirically show that identifies both the causal variables and the interaction targets on three robotic-inspired causal representation learning benchmarks, and allows for controllable generations. § PRELIMINARIES In this paper, we consider a causal model ℳ as visualized in <ref>. The model ℳ consists of K latent causal variables C_1,...,C_K which interact with each other over time, like in a dynamic Bayesian Network (DBN) <cit.>. In other words, at each time step t, we instantiate the causal variables as C^t={C_1^t,...,C_K^t}∈𝒞, where 𝒞⊆ℝ^K is the domain. In terms of the causal graph, each variable C^t_i may be caused by a subset of variables in the previous time step {C_1^t-1,...,C_K^t-1}. For simplicity, we restrict the temporal causal graph to only model dependencies on the previous time step. Yet, as we show in <ref>, our results can be trivially extended to longer dependencies, (C^t-2,C^t-1)→ C^t, since C^t-1 is only used for ensuring conditional independence. As in DBNs, we consider the graph structure to be time-invariant. Besides the intra-variable dynamics, we assume that the causal system is affected by a R^t with arbitrary domain ℛ, which can be continuous or discrete of arbitrary dimensionality. This can model any known external causes on the system, which, for instance, could be a robotic arm interacting with an environment. For the causal graph, we assume that the effect of the R^t on a causal variable C^t_i can be described by a latent binary interaction variable I^t_i∈{0,1}. This can be interpreted as each causal variable having two mechanisms/distributions, an observational and an interventional mechanism, which has similarly been assumed in previous work <cit.>. Thereby, the role of the interaction variable I^t_i is to select the mechanism, observational or interventional, at time step t. For example, a collision between an agent and an object is an interaction that switches the dynamics of the object from its natural course to a perturbed one. In this paper, we consider the interaction variable I^t_i to be an unknown function of the and the previous causal variables, I^t_i=f_i(R^t,C^t-1). The dependency on the previous time step allows us to model interactions that only occur in certain states of the system, a collision between an agent (modeled by R^t) with an object with position C_i^t-1 will only happen for certain positions of the agent and the object. We consider the causal graph of <ref> to be causally sufficient, we assume there are no other unobserved confounders except the ones we have described in the previous paragraphs and represented in the Figure, and that the causal variables within the same time step are independent of each other, conditioned on the previous time step and their interaction variables. We summarize the dynamics as p(C^t\|C^t-1,R^t)=∏_i=1^K p(C^t_i\|C^t-1,I^t_i). Although C^t_i only depends on a subset of C^t-1, w.l.o.g. we model it as depending on all causal variables from the previous time step. In causal representation learning, the task is to identify causal variables from an entangled, potentially higher-dimensional representation, an image. We consider an injective observation function g, mapping the causal variables C^t to an observation X^t=g(C^t). Following <cit.>, we assume g to be defined everywhere for C^t and differentiable almost everywhere. In our setting, once we identify the causal variables, the causal graph can be trivially learned by testing for conditional independence, since the causal graph is limited to edges following the temporal dimension, from C^t-1 to C^t. We provide further details on the graph discovery and an example on learned causal variables in <ref>. § IDENTIFYING CAUSAL VARIABLES Our goal in this paper is to identify the causal variables C_1,...,C_K of a causal system from sequences of observations (X^t,R^t). We first define the identifiability class that we consider. We then provide an intuition on how binary interactions enable identifiability, before presenting our two identifiability results. The practical algorithm based on these results, , is presented in <ref>. §.§ Identifiability Class and Definitions Intuitively, we seek to estimate an observation function ĝ, which maps a latent space 𝒞̂ to observations X, and models each true causal variable C_i in a different dimension of the latent space 𝒞̂. This observation function should be equivalent to the true observation function g, up to permuting and transforming the variables individually, through scaling. Several previous works <cit.> have considered equivalent identifiability classes, which we define as: Consider a model ℳ=⟨ g,f,ω,𝒞⟩ with an injective function g(C)=X with C∈𝒞 and a latent distribution p_ω(C^t\|C^t-1,R^t), parameterized by ω and defined: p_ω(C^t\|C^t-1,R^t)=∏_i=1^K p_ω,i(C^t_i\|C^t-1,f_i(R^t,C^t-1)), where f_i:ℛ×𝒞→{0,1} outputs a binary variable for the variable C^t_i. We call ℳ identifiable iff for any other model ℳ=⟨g̃,f̃,ω̃,𝒞̃⟩ with the same observational distribution p(X^t\|X^t-1,R^t), g and g̃ are equivalent up to a component-wise invertible transformation T and a permutation π: p_ℳ(X^t\|X^t-1,R^t) = p_ℳ(X^t\|X^t-1,R^t) ⇒ g = g̃∘ T ∘π To achieve this identifiability, we rely on the interaction variables I^t_i being binary and having distinct interaction patterns, a weaker form of faithfulness on the interaction variables. Intuitively, we do not allow that any two causal variables to have identical interaction variables I^t_i,I^t_j across the whole dataset, being always interacted with at the same time. Similarly, if all I^t_i are always zero (∀ t,i I^t_i=0), then we fall back into the well-known unidentifiable setting of non-linear ICA <cit.>. Since interaction variables can also be functions of the previous state, we additionally assume that for all possible previous states, the interaction variables cannot be deterministic functions of any other. Thus, we assume that all causal variables have distinct interaction patterns, which we formally define as: A causal variable C_i in ℳ=⟨ g,f,ω,𝒞⟩ has a distinct interaction pattern if for all values of C^t-1, its interaction variable I^t_i=f_i(R^t,C^t-1) is not a deterministic function b:{0,1}→{0,1} of any other I^t_j: ∀ C^t-1,∀ j≠i, ∄ b, ∀ R^t f_i(R^t,C^t-1)=b(f_j(R^t,C^t-1)). This assumption generalizes the intervention setup of <cit.>, which has a similar condition on its binary intervention variables, but assumed them to be independent of the previous time step. This implies that we can create a distinct interaction pattern for each of the K causal variables by having as few as ⌊log_2 K⌋ + 2 different values for R^t, if the interaction variables are independent of C^t-1. In contrast, other methods in similar setups that also exploit an external, temporally independent, observed variable <cit.> require the number of regimes to scale linearly with the number of causal variables. If the interaction variables depend on C^t-1, the lower bound of the number of different values for R^t depends on the causal model ℳ, more specifically its interaction functions f_i. Concretely, the lower bound for a causal model ℳ is the smallest set of values of R^t that ensure different interaction patterns for all C^t-1 in ℳ. In the worst case, each C^t-1 may require different values of R^t to fulfill the condition of <ref>, such that R^t would need to be of the same domain as C^t-1 (for instance being continuous). At the same time, for models ℳ in which the condition of <ref> can be fulfilled by the same values of R^t for all C^t-1, we again recover the lower bound of ⌊log_2 K + 2 ⌋ different values of R^t. §.§ Intuition: Additive Gaussian Noise We first provide some intuition on how binary interactions, knowing that each variable has exactly two potential mechanisms, enable identifiability, even when we do not know which variables are interacted with at each time step. We take as an example an additive Gaussian noise model with two variables C_1,C_2, each described by the equation: C^t_i = μ_i(C^t-1, I^t_i) + ϵ_i, ϵ_i ∼𝒩(0, σ^2), where ϵ_i is additive noise with variance σ^2, and μ_i a function for the mean with μ_i(C^t-1, I^t_i=0)≠μ_i(C^t-1, I^t_i=1). Due to the rotational invariance of Gaussians, the true causal variables C_1,C_2 and their rotated counterparts Ĉ_1, Ĉ_2 model the same distribution with the same factorization: ∏_i=1^2 p_i(C^t_i\|C^t-1,R^t) = ∏_i=1^2 p̂_i(Ĉ^t_i\|Ĉ^t-1,R^t). This property makes the model unidentifiable in many cases <cit.>. However, when the effect of the on a causal variable C_i can be described by a binary variable, I_i∈{0,1}, the two representations become distinguishable. In <ref>, we visualize the two representations by showing the means of the different variables under interactions, which we detail in <ref> and provide intuition here. For the original representation C_1,C_2, each variable's mean takes on only two different values for any R^t. For example, for s where I_1=0, the variable C_1 takes a mean that is in the center of the coordinate system. Similarly, when I_1=1, the variable C_1 will take a mean that is represented as a pink (for I_1=1, I_2=0) or yellow tick (for I_1=1, I_2=1). In contrast, for the rotated variables, both Ĉ_1 and Ĉ_2 have three different means depending on the interactions, making it impossible to model them with individual binary variables. Intuitively, the only alternative representations to C_1,C_2 which can be described by binary variables are permutations and/or element-wise transformations, effectively identifying the causal variables according to our identifiability class. §.§ Identifiability Result When extending this intuition to more than two variables, we find that systems may become unidentifiable when the two distributions of each causal variable, interacted and not interacted, always differ in the same manner. Formally, we denote the log-likelihood difference between the two distributions of a causal variable C^t_i as (C^t_i\|C^t-1) :=log p(C^t_i\|C^t-1,I^t_i=1) - log p(C^t_i\|C^t-1,I^t_i=0). If this difference or its derivative w.r.t. C^t_i is constant for all values of C^t_i, the effect of the interactions could be potentially modeled in fewer than K dimensions, giving rise to models that do not identify the causal model ℳ. To prevent this, we consider two possible setups for ensuring sufficient variability of (C^t_i\|C^t-1): dynamics variability, and time variability. We present our identifiability result below and provide the proofs in <ref>. An estimated model ℳ=⟨ĝ,f̂,ω̂,𝒞̂⟩ identifies the true causal model ℳ=⟨ g,f,ω,𝒞⟩ if: * (Observations) ℳ and ℳ model the same likelihood: p_ℳ(X^t\|X^t-1,R^t)=p_ℳ(X^t\|X^t-1,R^t); * (Distinct Interaction Patterns) Each variable C_i in ℳ has a distinct interaction pattern (Definition <ref>); and one of the following two conditions holds for ℳ: A. (Dynamics Variability) Each variable's log-likelihood difference is twice differentiable and not always zero: ∀ C^t_i ,∃ C^t-1∂^2 (C^t_i\|C^t-1)/∂ (C^t_i)^2≠ 0; B. (Time Variability) For any C^t∈𝒞, there exist K+1 different values of C^t-1 denoted with c^1,...,c^K+1∈𝒞, for which the vectors v_1,...,v_K∈^K+1 with v_i = [ ∂(C^t_i\|C^t-1=c^1)/∂ C^t_i ∂(C^t_i\|C^t-1=c^2)/∂ C^t_i ⋯ ∂(C^t_i\|C^t-1=c^K+1)/∂ C^t_i; ]^T ∈ℝ^K+1 v_i = [ ∂(C^t_i\|C^t-1=c^1)/∂ C^t_i ⋯ ∂(C^t_i\|C^t-1=c^K+1)/∂ C^t_i; ]^T are linearly independent. Intuitively, <ref> states that we can identify a causal model ℳ by maximum likelihood optimization, if we have distinct interaction patterns (Definition <ref>) and (C^t_i\|C^t-1) varies sufficiently, either in dynamics or in time. Dynamics variability can be achieved by the difference (C^t_i\|C^t-1) being non-linear for all causal variables. This assumption is common in previous ICA-based works <cit.> and, for instance, allows for Gaussian distributions with variable standard deviations. While allowing for a variety of distributions, it excludes additive Gaussian noise models. We can include this challenging setup by considering the time variability assumption, which states that the effect of the interaction depends on the previous time step, and must do so differently for each variable. As an example, consider a dynamical system with several moving objects, where an interaction is a collision with a robotic arm. The time variability condition is commonly fulfilled by the fact that the trajectory of each object depends on its own velocity and position. In comparison to previous work, our identifiability results cover a larger class of causal models by exploiting the binary nature of the interaction variables. We provide a detailed comparison in <ref>. In short, closest to our setup, <cit.> and <cit.> require a stronger form of both our dynamics and time variability assumptions, excluding common models like additive Gaussian noise models. <cit.> requires that no two causal variables share the same parents, limiting the allowed temporal graph structures. Meanwhile, our identifiability results allow for arbitrary temporal causal graphs. Further, the two conditions of <ref> complement each other well by covering different underlying distributions for the same general setup. Thus, in the next section, we can develop one joint learning algorithm for identifying the causal variables based on both conditions in <ref>. § Using the results of <ref>, we propose (), a neural-network based approach to identify causal variables and their interaction variables. In short, is a variational autoencoder (VAE) <cit.>, which aims at modeling each of the causal variables C_1,...,C_K in a separate latent dimension by enforcing the latent structure of <ref>. We first give an overview of and then detail the design choices for the model prior. §.§ Overview consists of three main elements: the encoder q_ϕ, the decoder p_θ, and the prior p_ω. The decoder and encoder implement the observation function g and its inverse g^-1 (Definition <ref>), respectively, and act as a map between observations x^t and a lower-dimensional latent space z^t ∈ℝ^M, in which we learn the causal variables C_1^t,...,C_K^t. The goal of the model is to learn each causal variable C_i^t in a different latent dimension, z^t_j, effectively separating and hence identifying the causal variables according to <ref>. Thus, we need the latent space to have at least K dimensions. In practice, since the number of causal variables is not known a priori, we commonly overestimate the latent dimensionality, M≫ K. Still, we expect the model to only use K dimensions actively, with the redundant dimensions not containing any information after training. On this latent space, the prior p_ω learns a distribution that follows the structure in Definition <ref>, modeling the dynamics in the latent space. As an objective, we maximize the data likelihood of observation triplets {X^t,X^t-1,R^t} from the true causal model, as stated in <ref>. The loss function for is: ℒ^t = -_q_ϕ(z^t\|x^t)[log p_θ(x^t\|z^t)] + _q_ϕ(z^t-1\|x^t-1)[KL(q_ϕ(z^t\|x^t)\|\|p_ω(z^t\|z^t-1,R^t))] with learnable parameter sets ϕ (encoder), θ (decoder), and ω (prior), and KL being the Kullback-Leibler divergence. For visually complex datasets, the VAE commonly has to perform a trade-off between reconstruction quality and prior modeling, which may cause poorer identification of the causal variables. To circumvent that, we follow <cit.> by separating the reconstruction and prior modeling stage by training an autoencoder and a normalizing flow <cit.> in separate stages. In this setup, an autoencoder is first trained to map the observations x^t into a lower-dimensional space. Afterward, we learn a normalizing flow on the autoencoder's representations to transform them into the desired causal representation, using the same prior structure as in the VAE. In experiments, we refer to this approach as -NF, and the previously described VAE-based approach as -VAE. §.§ Model Prior Our prior follows the distribution structure of Definition <ref>, which has two elements per latent variable: a function to model the binary interaction variable, and a conditional distribution. We integrate this into 's prior by learning both via multi-layer perceptrons (MLPs): p_ω(z^t\|z^t-1,R^t)=∏_i=1^M p_ω,i(z_i^t\|z^t-1,(R^t, z^t-1)). Here, is an MLP that maps the R^t and the latents of the previous time step z^t-1 to a binary output Î^t_i, as shown in <ref> . This MLP aims to learn the interaction variable for the latent variable z_i, simply by optimizing <ref>. The variable Î^t_i is then used as input for predicting the distribution over z^t_i. For simplicity, we model p_ω,i as a Gaussian distribution, which is parameterized by one MLP per variable, , predicting the mean and standard deviation. To allow for more complex distributions, p_ω,i can alternatively be modeled by a conditional normalizing flow <cit.>. In early experiments, we found that enforcing Î^t_i to be a binary variable and backpropagating through it with the straight-through estimator <cit.> leads to suboptimal performances. Instead, we model Î^t_i as a continuous variable during training by using a temperature-scaled tanh as the output activation function of . By gradually decreasing the temperature, we bring the activation function closer to a discrete step function towards the end of training. § RELATED WORK Causal Discovery from Unknown Targets Learning (equivalence classes of) causal graphs from observational and interventional data, even with unknown intervention targets, is a common setting in causal discovery <cit.>. In recent work, this is even extended to the case in which we have unknown mixtures of interventional data <cit.>, which for example can happen if the is not observed. In our paper, we assume that we observe the and then reconstruct the latent interaction variables, which resemble the observed context variables by <cit.>. Moreover, our work is on a different task, causal representation learning, in which we try to learn the causal variables from high-dimensional data. Causal Representation Learning A common basis for causal representation learning is Independent Component Analysis (ICA) <cit.>, which aims to identify independent latent variables from observations. Due to the non-identifiability for the general case of non-linear observation functions <cit.>, additional auxiliary variables are often considered in this setting <cit.>. Ideas from ICA have been integrated into neural networks <cit.> and applied to causality <cit.> for identifying causal variables. Recently, several works in causal representation learning have exploited distribution shifts or interventions to identify causal variables. Using counterfactual observations, <cit.> learn causal variables from pairs of images, between which only a subset of variables has changed via interventions with unknown targets. For temporal processes, <cit.> can model interventions of unknown target via actions, which is equivalent to the in our setting, but require that each causal variable has a strictly unique parent set. On the other hand, <cit.> consider observations from m different regimes u_1,...,u_m, where, in our setting, the regime indicator u is a discrete version of R^t. However, they require at least 2K+1 different regimes compared to ⌊log_2 K⌋ + 2 settings for ours, and have stronger conditions on the distribution changes over regimes ( no additive Gaussian noise models). In temporal settings where the intervention targets are known, CITRIS <cit.> identifies scalar and multidimensional causal variables from high-dimensional images. Nonetheless, observing the intervention targets requires additional supervision, which may not always be available. To the best of our knowledge, we are the first to use unknown binary interactions to identify the causal variables from high-dimensional observations. § EXPERIMENTS To illustrate the effectiveness of , we evaluate it on a synthetic toy benchmark and two environments generated by 3D robotic simulators. We publish our code at <https://github.com/phlippe/BISCUIT>, and detail the data generation and hyperparameters in <ref>. §.§ Synthetic Toy Benchmark To evaluate on various graph structures, we extend the Voronoi benchmark <cit.> by replacing observed intervention targets with unobserved binary interactions. In this dataset, each causal variable follows an additive Gaussian noise model, where the mean is modeled by a randomly initialized MLP. To determine the parent set, we randomly sample the causal graph with an edge likelihood of 0.4. Instead of observing the causal variables directly, they are first entangled by applying a two-layer randomly initialized normalizing flow before visualizing the outputs as colors in a Voronoi diagram of size 32× 32 (see <ref>). We extend the original benchmark by including a robotic arm that moves over the Voronoi diagram and interacts by touching individual color regions/tiles. Each tile corresponds to one causal variable, allowing for both single- and multi-target interactions. The models need to deduce these interactions from a R^t∈[0,1]^2 which is the 2D location of the robotic arm on the image. When the robotic arm interacts with a variable, its mean is set to zero, which resembles a stochastic perfect intervention. Evaluation We generate five Voronoi systems with six causal variables, and five systems with nine variables. We compare to iVAE <cit.>, LEAP <cit.>, and Disentanglement via Mechanism Sparsity (DMS) <cit.>, since all use a . We do not compare with CITRIS <cit.>, because it requires known intervention targets. We follow <cit.> in evaluating the models on a held-out test set where all causal variables are independently sampled. We calculate the coefficient of determination <cit.>, also called the R^2 score, between each causal variable C_i and each learned latent variable z_j, denoted by R^2_ij. If a model identifies the causal variables according to Definition <ref>, then for each causal variable C_i, there exists one latent variable z_j for which R^2_ij=1, while it is zero for all others. Since the alignment of the learned latent variables to causal variables is not known, we report R^2 scores for the permutation π that maximizes the diagonal of the R^2 matrix, R^2-diag=1/K∑_i=1^K R^2_i,π(i) (where 1 is optimal). To account for spurious modeled correlation, we also report the maximum correlation besides this alignment: R^2-sep=1/K∑_i=1^Kmax_j≠π(i) R^2_ij (optimal 0). Results The results in <ref>a show that identifies the causal variables with high accuracy for both graphs with six and nine variables. In comparison, all baselines struggle to identify the causal variables, often falling back to modeling the colors as latent variables instead. While the assumptions of iVAE and LEAP do not hold for additive Gaussian noise models, the assumptions of DMS, including the graph sparsity, mostly hold. Still, is the only method to consistently identify the true variables, illustrating that its stable optimization and robustness. Minimal Number of Regimes To verify that only requires ⌊log_2 K ⌋ + 2 different regimes (<ref>), we repeat the previous experiments with reducing the interaction maps to a minimum. This results in four sets of interactions for six variables, and five for nine variables. <ref>b shows that still correctly identifies causal variables in this setting, supporting our theoretical results. Learned Intervention Targets After training, we can use the interaction variables Î_1,...,Î_M learned by to identify the regions in which the robotic arm interacts with a causal variable. Based on our theoretical results, we expect that some of the learned variables are identical to the true interaction variables I_1,...I_K up to permutations and sign-flips. In all settings, we find that the learned binary variables match the true interaction variables with an average F1 score of 98% for the same permutation of variables as in the R^2 evaluation. This shows that identified the true interaction variables. Thus, in practice, one could use a few samples with labeled interaction variables to identify the learned permutation of the model. §.§ CausalWorld CausalWorld <cit.> is a robotic manipulation environment with a tri-finger robot, which can interact with objects in an enclosed space by touch (see <ref>). The environment also allows for interventions on various environment parameters, including the colors or friction parameters of individual elements. We experiment on this environment by recording the robot's interactions with a cube. Besides the cube position, rotation and velocity, the causal variables are the colors of the three fingertips, as well as the floor, stage and cube friction, which we visualize by the colors of the respective objects. All colors and friction parameters follow an additive Gaussian noise model. When a robot finger touches the cube, we perform a stochastic perfect intervention on its color. Similarly, an interaction with the friction parameters correspond to touching these objects with all three fingers. The R^t is modeled by the angles of the three motors per robot finger from the current and previous time step, providing velocity information. This environment provides two new challenges. Firstly, not all interactions are necessarily binary. In particular, the collisions between the robot and the cube have different effects depending on the velocity and direction of the fingers of the robot, which are not part of the state of the causal variables at the previous time step. Additionally, the robotic system is present in the observation/image, while our theoretical results assume that R^t is not a direct cause of X^t. We adapt -NF and the baselines to this case by adding R^t as additional information to the decoder, effectively removing the need to model R^t in the latent space. On this task, identifies the causal variables well, as seen in <ref>. Because the cube position, velocity and rotation share the same interactions, in the evaluation we consider them as a multidimensional variable. Although the true model cannot be fully described by binary interaction variables, still models the binary information of whether a collision happens or not for the cube, since it is the most important part of the dynamics. We verify this in <ref> by measuring the F1 score between the predicted interaction variables and ground truth interactions/collisions. achieves an F1 score of 50% for all cube-arm interactions, which indicates a high similarity between the learned interaction and the ground truth collisions considering that collisions only happen in approximately 5% of the frames. The mismatches are mostly due to the learned interactions being more conservative, being 1 already a frame too early sometimes. Meanwhile, none of the baselines are able to reconstruct the image sufficiently, missing the robotic arms and the cube (see <ref>). While this might improve with significant tuning effort, -NF is not sensitive to the difficulty of the reconstruction due to its separate autoencoder training stage. §.§ iTHOR - Embodied AI To illustrate the potential of causal representation learning in embodied AI, we apply to the iTHOR environment <cit.>. In this environment, an embodied AI agent can perform actions on various objects in an 3D indoor scene such as a kitchen. These agent-object interactions can often be described by a binary variable, pickup/put down an object, open/close a door, turn on/off an object, etc., which makes it an ideal setup for . Our goal in this environment is to identify the causal variables, the objects and their states, from sequences of interactions. We perform this task on the kitchen environment shown in <ref>. This environment contains two movable objects, a plate and an egg, and seven static objects, a microwave and a stove. Overall, we have 18 causal variables, which include both continuous, the location of the plate, and binary variables, whether the microwave is on or off. Causal variables influence each other by state changes, the egg gets cooked when it is in the pan and the stove is turned on. Further, the set of possible actions that can be performed depends on the previous time step, only one object can be picked up at a time. For training, we generate a dataset where we randomly pick a valid action at each time step. We model the R^t as a two-dimensional pixel coordinate, which is the position of a pixel showing the interacted object in the image (R^t∈[0,1]^2). This simulates iTHOR's web demo <cit.>, where a user interacts with objects by clicking on them. We train -NF and our baselines on this dataset, and compare the latent representation to the ground truth causal variables in terms of the R^2 score in <ref>. Although the baselines reconstruct the image mostly well, the causal variables are highly entangled in their representations. In contrast, identifies and separates most of the causal variables optimally, except for the two movable objects (egg/plate). This is likely due to the high inherent correlation of the two objects, since their positions cannot overlap and only one of them can be picked up at a time. Besides evaluating the causal representation, we also visualize the learned interaction variables of in <ref>. Here, each color represents the region in which identified an interaction with a different causal variable. <ref> shows that has identified the correct interaction region for each object. Moreover, it allows for context-dependent interactions, as the location of the plate influences the region of its corresponding interaction variable. Finally, we can use the learned causal representation to perform interventions and create novel combinations of causal variables. For this, we encode two images into the learned latent space of , and combine the latent representations of the causal variables to have a novel image decoded. For example, in <ref>, we replace the latents representing the front-left stove and the microwave state in the first image by the corresponding latents of the second image. This aims to perform an intervention on the front-left stove (turning on) and the microwave state (turning off) while all remaining causal variables such as the egg state should stay unchanged.[This setup can also be interpreted as performing a perfect intervention on all causal variables with values picked from image 1 or 2 for individual variables. Causal relations between variables, the stove and the egg, are actively broken in this setup.] not only integrates these changes without influencing any of the other causal variables, but generates a completely novel state: even though in the iTHOR environment, the egg is instantaneously cooked when the stove turns on, correctly combines the state of the egg being raw with the stove burning. This shows the capabilities of to model unseen causal interventions. § CONCLUSION We prove that under mild assumptions, causal variables become identifiable from high-dimensional observations, when their interactions with an external system can be described by unknown binary variables. As a practical algorithm, we propose , which learns the causal variables and their interaction variables. In experiments across three robotic-inspired datasets, outperforms previous methods in identifying the causal variables from images. While in experiments, shows strong identification even for complex interactions, the presented theory is currently limited to binary interaction variables. Although the first step may be to generalize the theory to interaction variables with more than two states, extensions to unknown domains or sparse, continuous interaction variables are other interesting future directions. Instead of assuming distinct interaction patterns, future work can extend these results to partial identifiability, similar to <cit.>. Finally, our results open up the opportunity for empirical studies showing the benefits of causal representations for complex real-world tasks like embodied AI. P. Lippe conceived the idea, developed the theoretical results, implemented the models and experiments, and wrote the paper. S. Magliacane, S. Löwe, Y. M. Asano, T. Cohen, E. Gavves advised during the project and helped in writing the paper. We thank SURF for the support in using the National Supercomputer Snellius. This work is financially supported by Qualcomm Technologies Inc., the University of Amsterdam and the allowance Top consortia for Knowledge and Innovation (TKIs) from the Netherlands Ministry of Economic Affairs and Climate Policy. uai2023 height4pt .25in .25in height1pt .25in Appendix 8mm [sections]Table of Contents height .5pt [sections]l1 § REPRODUCIBILITY STATEMENT For reproducibility, we publish the code of and the generations of the datasets (Voronoi, CausalWorld, iTHOR) as well as the datasets itself at <https://github.com/phlippe/BISCUIT>. All models were implemented using PyTorch <cit.> and PyTorch Lightning <cit.>. The hyperparameters and dataset details are described in <ref> and <ref>. All experiments have been repeated for at least three seeds. We provide an overview of the standard deviation, as well as additional insights to the results in <ref>. In terms of computational resources, the experiments of the Voronoi dataset were performed on a single NVIDIA A5000 GPU, with a training time of below 1 hour per model. The experiments of the CausalWorld and iTHOR dataset were performed on an NVIDIA A100 GPU (autoencoder training: 1-day training time; variational autoencoders: 1 to 2-day training time) and an NVIDIA A5000 GPU (normalizing flow training, 1-hour training time). § PROOFS In this section, we prove the main theoretical results in this paper, namely <ref>. We start with a glossary of the used notation in <ref>, which is the same as in the main paper. All assumptions for the proof are described in <ref> and <ref> of the main paper. <ref> contains the proofs for <ref>. Lastly, we provide further discussion on extensions of the proof, to longer temporal dependencies (<ref>), discovering the causal graph (<ref>), and comparing its results to previous work (<ref>). §.§ Glossary <ref> provides an overview of the main notation used in the paper and the following proof. Additional notation for individual proof steps is introduced in the respective sections. §.§ Proof Steps The proof consists of four main steps: * We show that for any ĝ in ℳ, there must exist an invertible transformation between the latent space of ℳ and the true causal model ℳ (<ref>). * We show that the distributions of different interaction variable values must strictly be different, starting with two variables (<ref>) and then moving to the general case (<ref>). * Based on the previous step, we show that ĝ must model the same interaction variable patterns for the individual interaction cases, starting with two variables <ref>.<ref> discusses it under the assumption of dynamics variability in <ref>, and <ref> for time variability in <ref>. * Given that both ℳ and ℳ model the same interaction variables, the invertible transformation must be equal to a set of component-wise transformations (<ref>). In <ref>, we combine these four steps to prove the full theorem. For step 2 and 3, we first start by discussing the proof idea for a system with only two variables, to give a better intuition behind the proof strategy. §.§.§ Existence of an invertible transformation between learned and true representations As a first step, we start with discussing the relation between the true observation function, g, and a potentially learned observation function, ĝ and show that there exists an invertible transformation between the causal variables that are extracted from an image for each of these two functions. Throughout this proof, we will use C_i to refer to a causal variable from the original, true causal model ℳ, and we use Ĉ_i to refer to a latent variable modeled by ℳ, an alternative representation of the environment. Under this setup, we consider the following statement: Consider a model ℳ=⟨ĝ, f̂, ω̂, 𝒞⟩ with an injective observation function g(Ĉ^̂t̂)=X^t with Ĉ^̂t̂∈𝒞 and a latent distribution p_ω(Ĉ^t\|Ĉ^t-1,R^t), parameterized by ω, which models the same data likelihood as the true causal model ℳ: p_ℳ(X^t\|X^t-1,R^t)=p_ℳ(X^t\|X^t-1,R^t). Then, there must exist an invertible transformation T such that for all C^t,Ĉ^̂t̂: C^t = T(Ĉ^̂t̂). Since g and ĝ are injective functions with ĝ(Ĉ^̂t̂)=X^t and g(C^t)=X^t, we have that X^t=(g ∘ g^-1)(X^t)=(ĝ∘ĝ^-1)(X^t)=id_X(X^t) with id being the identity function, when restricting the injective functions to their ranges to turn them to invertible functions with C^t=(g^-1∘ g)(C^t)=id_C(C^t) and Ĉ^t=(ĝ^-1∘ĝ)(Ĉ^t)=id_Ĉ(Ĉ^t). Combining the two results in: C^t =g^-1(X^t) = (g^-1∘ĝ∘ĝ^-1)(X^t) = T(ĝ^-1(X^t)) = T(Ĉ^̂t̂) where T=g^-1∘ĝ. This function has the inverse T^-1=ĝ^-1∘ g with: T^-1∘ T = ĝ^-1∘g ∘ g^-1_id_X∘ĝ = ĝ^-1∘ĝ = id_Ĉ Hence, there exists an invertible function T=g^-1∘ĝ between the two spaces of Ĉ^̂t̂ and C^t. Since there exists an invertible, differentiable transformation between the two spaces, we can also express the relation between the two spaces via the change-of-variables: p_ω(C^t\|C^t-1,R^t)=p_ω̂(Ĉ^t\|Ĉ^t-1,R^t) \|J\| where J is the Jacobian with J_ij=∂Ĉ^t_i/∂ C^t_j. Further, since there exists an invertible transformation also between C^t-1 and Ĉ^t-1, we can align the conditioning set: p_ω(C^t\|C^t-1,R^t)=p_ω̂(Ĉ^t\|C^t-1,R^t) \|J\| For readability, we will drop ω and ω̂ from the index of p, since the difference is clear from the context (distribution over C/Ĉ). The following proof steps will take a closer look at aligning these two spaces. §.§.§ Any representation requires the same interaction cases - 2 variables Setup The idea of this proof step is to show that for any two causal variables C_1,C_2, any representation that models the same data likelihood, Ĉ_̂1̂, Ĉ_̂2̂, must have an invertible transformation between the interaction variables I^t_1,I^t_2 (and C_1^t-1, C_2^t-1) and the learned interaction variables Î^t_1,Î^t_2 (and Ĉ_1^t-1, Ĉ_2^t-1). In other words, disentanglement requires distinguishing between the same scenarios of interactions. We start with considering the four possible interaction cases that we may encounter: p(C_1^t,C_2^t\|C^t-1,I^t_1=0,I^t_2=0) = p(C^t_1\|C^t-1,I^t_1=0) · p(C^t_2\|C^t-1,I^t_2=0) p(C_1^t,C_2^t\|C^t-1,I^t_1=1,I^t_2=0) = p(C^t_1\|C^t-1,I^t_1=1) · p(C^t_2\|C^t-1,I^t_2=0) p(C_1^t,C_2^t\|C^t-1,I^t_1=0,I^t_2=1) = p(C^t_1\|C^t-1,I^t_1=0) · p(C^t_2\|C^t-1,I^t_2=1) p(C_1^t,C_2^t\|C^t-1,I^t_1=1,I^t_2=1) = p(C^t_1\|C^t-1,I^t_1=1) · p(C^t_2\|C^t-1,I^t_2=1) Our goal is to show that all these four distributions must be strictly different for any C^t-1. These inequalities generalize to any alternative representation that entangles the two variables C_1,C_2, since the alternative representation must model the same distributions p(X^t\|X^t-1,...)=p(C^t\|...)=p(C_1^t,C_2^t\|...)· .... Implications of theorem assumptions Before comparing the distributions, we first simplify what the assumptions of <ref> imply for the individual variable's distributions. The theorem assumes that (C^t_i\|C^t-1) = logp(C^t_i\|C^t-1,I^t_i=1)/p(C^t_i\|C^t-1,I^t_i=0) is differentiable and cannot be a constant. Otherwise, the derivatives (C^t_i\|C^t-1) would have to be constantly zero, which violates both condition (A) and (B) of the theorem. Therefore, we can deduce that: * For each variable C_i, there must exist at least one value of C^t_i for which p(C^t_i\|C^t-1,I^t_i=1)≠ p(C^t_i\|C^t-1,I^t_i=0), p(C^t_i\|C^t-1,I^t_i=1), p(C^t_i\|C^t-1,I^t_i=0) must strictly be different distributions. * The distributions p(C^t_i\|C^t-1,I^t_i=1), p(C^t_i\|C^t-1,I^t_i=0) must share the same support, since otherwise (C^t_i\|C^t-1)=±∞ for some C^t_i and thus not differentiable. Single-target vs Joint We start with comparing single-target interactions versus the observational case. Since the interactional distribution is strictly different from the observational, we obtain that p(C^t_i\|C^t-1,I^t_i=0) ≠ p(C^t_i\|C^t-1,I^t_i=1). With this inequality, we can deduce that: p(C_1^t,C_2^t\|C^t-1,I^t_1=0,I^t_2=0) ≠ p(C_1^t,C_2^t\|C^t-1,I^t_1=1,I^t_2=0) p(C_1^t,C_2^t\|C^t-1,I^t_1=0,I^t_2=0) ≠ p(C_1^t,C_2^t\|C^t-1,I^t_1=0,I^t_2=1) This is because these distributions only differ in one sub-distribution ( either C_1 or C_2 intervened versus passively observed), which must be strictly different due to our assumption. A similar reasoning can be used to derive the same inequalities for the joint interaction case: p(C_1^t,C_2^t\|C^t-1,I^t_1=1,I^t_2=1) ≠ p(C_1^t,C_2^t\|C^t-1,I^t_1=1,I^t_2=0) p(C_1^t,C_2^t\|C^t-1,I^t_1=1,I^t_2=1) ≠ p(C_1^t,C_2^t\|C^t-1,I^t_1=0,I^t_2=1) With these, there are two relations yet to show. Joint Interactions vs Observational First, consider the joint interaction (I^t_1=I^t_2=1) versus the pure observational regime (I^t_1=I^t_2=0). We prove that these two distributions must be different by contradiction. We first assume that they are equal and show that a contradiction strictly follows. With both equations equal, we can write: p(C^t_1\|C^t-1,I^t_1=0) · p(C^t_2\|C^t-1,I^t_2=0) = p(C^t_1\|C^t-1,I^t_1=1) · p(C^t_2\|C^t-1,I^t_2=1) ⇔p(C^t_1\|C^t-1,I^t_1=0)/p(C^t_1\|C^t-1,I^t_1=1) = p(C^t_2\|C^t-1,I^t_2=1)/p(C^t_2\|C^t-1,I^t_2=0) Note that the third step is possible since p(C^t_i\|C^t-1,I^t_i=1), p(C^t_i\|C^t-1,I^t_i=0) share the same support. Further, since C^t_1 and C^t_2 are conditionally independent, the equality above must hold for any values of C^t_1,C^t_2. This implies that, for a given C^t_2, the fraction of C^t_1 must be constant, and vice versa. Denoting this constant factor with c, we can rewrite the previous equation as: p(C^t_1\|C^t-1,I^t_1=0)/p(C^t_1\|C^t-1,I^t_1=1) = c ⇔ p(C^t_1\|C^t-1,I^t_1=0) = c · p(C^t_1\|C^t-1,I^t_1=1) ⇔∫ p(C^t_1\|C^t-1,I^t_1=0) dC^t_1 = ∫ c · p(C^t_1\|C^t-1,I^t_1=1) dC^t_1 ⇔ 1 = c In the last step, the two integrals disappear since both p(C^t_1\|C^t-1,I^t_1=0) and p(C^t_1\|C^t-1,I^t_1=1) are valid probability density functions. Hence, the equality can only be valid if c=1, which implies p(C^t_1\|C^t-1,I^t_1=1)=p(C^t_1\|C^t-1,I^t_1=0). However, this equality of distributions is out ruled by the assumptions of <ref> as discussed in the beginning of this section, and thus causes a contradiction. In other words, this shows that the joint interaction (I^t_1=I^t_2=1) and the pure observational regime (I^t_1=I^t_2=0) must be strictly different, : p(C_1^t,C_2^t\|C^t-1,I^t_1=0,I^t_2=0) ≠ p(C_1^t,C_2^t\|C^t-1,I^t_1=1,I^t_2=1) Single-target vs Single-target The final step is to show that the distribution for interacting on C_1 versus the distribution of interacting on C_2 must be different. For this, we can use a similar strategy as for the previous comparison and perform a proof of contradiction. If both of the distributions are equal, the following equation follows: ⇔ p(C^t_1\|C^t-1,I^t_1=0) · p(C^t_2\|C^t-1,I^t_2=1) = p(C^t_1\|C^t-1,I^t_1=1) · p(C^t_2\|C^t-1,I^t_2=0) ⇔p(C^t_1\|C^t-1,I^t_1=0)/p(C^t_1\|C^t-1,I^t_1=1) = p(C^t_2\|C^t-1,I^t_2=0)/p(C^t_2\|C^t-1,I^t_2=1) This is almost identical to <ref>, besides the flipped fraction for C_2. Note, however, that the same implications hold, namely that both fractions need to be constant and constant with value 1. This again contradicts our assumptions, and proves that the two distributions must be different: p(C_1^t,C_2^t\|C^t-1,I^t_1=0,I^t_2=1) ≠ p(C_1^t,C_2^t\|C^t-1,I^t_1=1,I^t_2=0) Conclusion In summary, we have shown that the four possible cases of interactions strictly model different distributions. Further, this distinction between the four cases can only be obtained by information from R^t through I^t, since I^t cannot be a deterministic function of the previous time step. Thus, any possible representation of the variables C_1,C_2 must model the same four (or at least three) possible interaction settings. §.§.§ Any representation requires the same interaction cases - multi-variable case So far, we have discussed the interaction cases for two variables. This discussion can be easily extended to cases of three or more variables. Before doing so, we formally state the lemma we are proving in this step. For the interaction variables I^t={I_1^t,...,I_K^t} in a causal model ℳ, any two values ,∈{0,1}^K with ≠ must strictly model different distributions: ∀ C^t p(C^t\|C^t-1,I^t=)≠ p(C^t\|C^t-1,I^t=) For K variables, we can write the overall joint distribution p(C^t\|C^t-1,I^t) as: p(C^t\|C^t-1,I^t) = p(C^t_1\|C^t-1,I^t_1) · p(C^t_2\|C^t-1,I^t_2) · ... · p(C^t_K\|C^t-1,I^t_K) Consider now the distributions for two different, arbitrary interaction values , (≠): p(C^t\|C^t-1,I^t=) ?= p(C^t\|C^t-1,I^t=) p(C^t_1\|C^t-1,I^t_1=a^I_1) · ... · p(C^t_K\|C^t-1,I^t_K=a^I_K) = p(C^t_1\|C^t-1,I^t_1=b^I_1) · ... · p(C^t_K\|C^t-1,I^t_K=b^I_K) We can rewrite this equation as: p(C^t_1\|C^t-1,I^t_1=_1)/p(C^t_1\|C^t-1,I^t_1=_1)· ... ·p(C^t_K\|C^t-1,I^t_K=_K)/p(C^t_K\|C^t-1,I^t_K=_K) = 1 Similar to our discussion on two variables, we can now analyze this equation under the situation where we keep all variables fixed up to C^t+1_i. This is a valid scenario since all variables are independent based on their conditioning set C^t-1 and a^I/b^I. This implies that the fraction of C_i in <ref> must be equals to one divided by the multiplication of the remaining fractions, which we considered constant. With this, we have the following equation: p(C^t_i\|C^t-1,I^t_i=_i)/p(C^t_i\|C^t-1,I^t_i=_i) = c where c again summarizes all constant terms. As shown earlier in this section, this equality can only hold if _i=_i. In turn, this mean that <ref> can only be an equality if =. Hence, different interaction cases must strictly model different distributions. §.§.§ Alignment of interaction variables - 2 variables Setup In the previous section, we have proven that any representation needs to model the same interaction cases. The next step is to show that the interaction cases further need to align, the interaction variables must be equivalent up to permutation and sign flips. For this, consider an alternative representation, Ĉ_1,Ĉ_2, which is the result of an invertible change-of-variables operation. We denote the corresponding interaction variables by Î_1,Î_2. Overall, we can write their probability distribution as: p(C_1^t,C_2^t\|C^t-1,I^t_1,I^t_2) = p(Ĉ_1^t,Ĉ_2^t\|C^t-1,Î^t_1,Î^t_2) · \|J\| p(C^t_1\|C^t-1,I^t_1) · p(C^t_2\|C^t-1,I^t_2) = p(Ĉ^t_1\|C^t-1,Î^t_1) · p(Ĉ^t_2\|C^t-1,Î^t_2) · \|J\| For simplicity, we write the conditioning of Ĉ_1^t,Ĉ_2^t still in terms of C^t-1, since C^t-1 and Ĉ^t-1 contain the same information. Further, J represents the Jacobian of the invertible transformation of C^t_1,C^t_2 to Ĉ^t_1,Ĉ^t_2. Cases to consider Now, our goal is to show that Î^̂t̂_1,Î^̂t̂_2 must be equivalent to I_1,I_2 up to permutation and sign flip. As an example, consider a value of C^t-1 under which we may have four possible values of R^t which give us the following interactions: R I_1 I_2 Î_1 Î_2 r_1 0 0 0 0 r_2 1 0 1 0 r_3 0 1 1 1 r_4 1 1 0 1 with r_1,r_2,r_3,r_4∈ℛ, r_1≠ r_2≠ r_3≠ r_4. In the notation of intervention design, one can interpret these different interactions are different experiments, different sets of variables that are jointly intervened. We will denote them with E_1,...,E_4 where E_i=[I_1,I_2] for a given r_i. Similarly, we will use Ê_i=[Î_1,Î_2] to denote the same set for the alternative representation. In this setup, we say that I_2 aligns with Î_2, since they are equal in all experiments E_1,...,E_4 / for all values of R^t. However, I_1 does not align with any interaction variable of Ĉ, because I_1≠Î_1 and I_1≠ 1-Î_1, and same for Î_2. Thus, we are aiming to derive that this setup contradicts <ref>. Single-target vs Joint interaction We start the analysis by writing down all distributions to compare: p(C^t_1\|C^t-1,I^t_1=0) · p(C^t_2\|C^t-1,I^t_2=0) = p(Ĉ^t_1\|C^t-1,Î^t_1=0) · p(Ĉ^t_2\|C^t-1,Î^t_2=0) · \|J\| p(C^t_1\|C^t-1,I^t_1=1) · p(C^t_2\|C^t-1,I^t_2=0) = p(Ĉ^t_1\|C^t-1,Î^t_1=1) · p(Ĉ^t_2\|C^t-1,Î^t_2=0) · \|J\| p(C^t_1\|C^t-1,I^t_1=0) · p(C^t_2\|C^t-1,I^t_2=1) = p(Ĉ^t_1\|C^t-1,Î^t_1=1) · p(Ĉ^t_2\|C^t-1,Î^t_2=1) · \|J\| p(C^t_1\|C^t-1,I^t_1=1) · p(C^t_2\|C^t-1,I^t_2=1) = p(Ĉ^t_1\|C^t-1,Î^t_1=0) · p(Ĉ^t_2\|C^t-1,Î^t_2=1) · \|J\| Our overall proof strategy is to derive relations between individual variables, C_1 and Ĉ_1. Since the invertible transformation between C and Ĉ must be independent of R, I and Î, the relations we derive must hold across all the experiments. By dividing the sets of equations, we obtain: Eq <ref> / Eq <ref> : p(C^t_1\|C^t-1,I^t_1=1)/p(C^t_1\|C^t-1,I^t_1=0) = p(Ĉ^t_1\|C^t-1,Î^t_1=1)/p(Ĉ^t_1\|C^t-1,Î^t_1=0) Eq <ref> / Eq <ref> : p(C^t_2\|C^t-1,I^t_2=1)/p(C^t_2\|C^t-1,I^t_2=0) = p(Ĉ^t_1\|C^t-1,Î^t_1=1)/p(Ĉ^t_1\|C^t-1,Î^t_1=0)p(Ĉ^t_2\|C^t-1,Î^t_2=1)/p(Ĉ^t_2\|C^t-1,Î^t_2=0) Eq <ref> / Eq <ref> : p(C^t_1\|C^t-1,I^t_1=1)/p(C^t_1\|C^t-1,I^t_1=0)p(C^t_2\|C^t-1,I^t_2=1)/p(C^t_2\|C^t-1,I^t_2=0) = p(Ĉ^t_2\|C^t-1,Î^t_2=1)/p(Ĉ^t_2\|C^t-1,Î^t_2=0) Note that the Jacobian, \|J\|, cancels out in all distributions since it is independent of the interactions and thus identical for all equations above. As a next step, we replace Ĉ_2 in <ref> with the result of <ref> and rearrange the terms: p(C^t_1\|C^t-1,I^t_1=0)/p(C^t_1\|C^t-1,I^t_1=1) = p(Ĉ^t_1\|C^t-1,Î^t_1=1)/p(Ĉ^t_1\|C^t-1,Î^t_1=0) Similarly, replacing Ĉ_1 in <ref> with the new result in <ref>, we obtain: p(C^t_1\|C^t-1,I^t_1=1)/p(C^t_1\|C^t-1,I^t_1=0) = p(C^t_1\|C^t-1,I^t_1=0)/p(C^t_1\|C^t-1,I^t_1=1) This equation can obviously only hold if both fractions are equal to 1. However, as shown in <ref>, this contradicts our assumptions of the theorem. Thus, we have shown that the interaction variables Î_1,Î_2 cannot model the same distribution as I_1,I_2. For the specific example of two causal variables and four experiments, it turns out that there exists no other set of interaction variables that would not align to I_1,I_2. Hence, in this case, any other valid representation Ĉ which fulfills <ref> must have interaction variables that align with the true model. Conclusion This example is meant to communicate the general intuition behind our proof strategy for showing that the interaction variables between the true causal model ℳ and a learned representation ℳ align. We note that this example does not cover all possible models with two causal variables C_1,C_2, since our assumptions only require ⌊log_2 2⌋ + 2=3 experiments/different values of R^t, while we considered here four for simplicity. For this smaller amount of experiments, it becomes difficult to distinguish between models that model the true interaction variables I_1,...,I_K and possible linear combinations of such. This can be prevented by ensuring sufficient variability either in the dynamics (condition (A) - <ref>) or over time (condition (B) - <ref>), which we show in the next two subsections. §.§.§ Alignment of interaction variables - Multi-variable case (condition (A) - <ref>) We start with showing the interaction variable alignment under condition (A) of <ref>. The goal is to prove the following lemma: For any variable C_k (k=1,...,K) with interaction variable I_k, there exist exactly one variable Ĉ_l with interaction variable Î_l, which models the same interaction pattern: ∀ C^t I^t_k=Î^t_lorI^t_k=1-Î^t_l if the second derivative of the log-difference between the observational and the interactional distribution is not constantly zero: ∀ C^t_k, ∃ C^t-1∂^2 (C^t_k\|C^t-1)/∂ (C^t_k)^2≠ 0 We structure the proof in four main steps. First, we generalize our analysis of the relations between interaction equations from the two variables to the multi-variable case. We then take a closer look at them from two sides: a variable from the true causal model, C^t_m, and a variable from the alternative representation, Ĉ^t_l. The intuition behind the proof is that a change in C^t_m must correspond to a change in Ĉ^t_l which appears in the same set of equations. This inherently requires that C^t_m and Ĉ^t_l share the same unique interaction pattern. With this intuition in mind, the following paragraphs detail these individual proof steps. Equations sets implied by interactions Firstly, we consider a set of Q true interaction experiments E_1,...,E_Q, Q different values of R^t which cause different sets of interaction variable values I^t_1,...,I^t_K, and similarly the Q values of R^t in the alternative representation space Î with experiments Ê_1,...,Ê_Q. In the previous example of the two variables, the experiments would be E_1=[0,0], E_2=[1,0], E_3=[0,1], E_4=[1,1] and Ê_1=[0,0], Ê_2=[1,0], Ê_3=[1,1], Ê_4=[0,1]. We will denote the interaction variable value I_k of the causal variable C_k in the experiment E_i with E_i^k, E_2^1=1 in the previous example. For any two experiments E_i,E_j, there exists a set of variables for which the interaction targets differ. We summarize the indices of these variables as 𝒱_ij, and similarly for the alternative representation 𝒱̂_ij. Taking the two-variable example again, 𝒱_12={1}, the interaction variable of the causal variable C_1 differs between E_1 and E_2. Using this notation, we can write the division of two experiments E_i,E_j as: ∏_k∈𝒱_ijp(C_k^t\|C^t-1,I_k^t=E_i^k)/p(C_k^t\|C^t-1,I_k^t=E_j^l) = ∏_l∈𝒱̂_ijp(Ĉ_l^t\|C^t-1,Î_l^t=Ê_i^l)/p(Ĉ_l^t\|C^t-1,Î_l^t=Ê_j^l) Analyzing equations for individual causal variables The experiments imply a set of (Q-1)(Q-2)/2 equations. Our next step is to analyze what these equations imply for an individual causal variable C^t_m. First, we take the log on both sides to obtain: ∑_k∈𝒱_ijlogp(C_k^t\|C^t-1,I_k^t=E_i^k)/p(C_k^t\|C^t-1,I_k^t=E_j^k) = ∑_l∈𝒱̂_ijlogp(Ĉ_l^t\|C^t-1,Î_l^t=Ê_i^l)/p(Ĉ_l^t\|C^t-1,Î_l^t=Ê_j^l) For readability, we adapt our notation of (C^t_k\|C^t-1) here by having: _ij(C^t_k\|C^t-1) = logp(C_k^t\|C^t-1,I_k^t=E_i^k)/p(C_k^t\|C^t-1,I_k^t=E_j^k) _ij(Ĉ^t_l\|C^t-1) = logp(Ĉ_l^t\|C^t-1,Î_l^t=Ê_i^l)/p(Ĉ_l^t\|C^t-1,Î_l^t=Ê_j^l) which gives us ∑_k∈𝒱_ij_ij(C^t_k\|C^t-1) = ∑_l∈𝒱̂_ij_ij(Ĉ^t_l\|C^t-1) Now consider a single variable C^t_m, for which m∈𝒱_ij. If we take the derivative with respect to C^t_m, we get: ∂_ij(C^t_m\|C^t-1)/∂ C^t_m = ∑_l∈𝒱̂_ij∂_ij(Ĉ^t_l\|C^t-1)/∂ C^t_m The sum on the left drops away since we know that C^t_k C^t_m\| C^t-1,I^t, and therefore ∂_ij(C^t_k\|C^t-1)/∂ C^t_m if k≠ m. For each variable C^t_m, we obtain at least Q-1 equations (Q being the number of overall interaction experiments) since every experiment E_i must have at least one experiment E_j for which E_i^m≠ E_j^m, since otherwise the interaction variable I_m must be equal in all experiments and thus a constant, violating our distinct interaction pattern assumption. In other words, we obtain a set of experiment pairs which differ in the interaction variable of C^t_m, 𝒱_m = {𝒱̂_ij\| i,j∈1Q, E_i^m≠ E_j^m} with \|𝒱_m\|≥ Q-1. For two experiment equations, 𝒱̂_ij, 𝒱̂_sr∈𝒱_m, we have the following equality following from <ref>: ∂_ij(C^t_m\|C^t-1)/∂ C^t_m = ∑_l∈𝒱̂_ij∂_ij(Ĉ^t_l\|C^t-1)/∂ C^t_m = ∑_w∈𝒱̂_sr∂_sr(Ĉ^t_w\|C^t-1)/∂ C^t_m Using _ij(C^t_k\|C^t-1) = -_ji(C^t_k\|C^t-1), we can align the equations above via: (C^t_k\|C^t-1) = p(C_k^t\|C^t-1,I_k^t=1)/p(C_k^t\|C^t-1,I_k^t=0) ∑_l∈𝒱̂_ij∂(Ĉ^t_l\|C^t-1)/∂ C^t_m = (-1)^1[E^m_i = E^m_s]∑_w∈𝒱̂_sr∂(Ĉ^t_w\|C^t-1)/∂ C^t_m Analyzing equations for a single variable of alternative representation As the next step, we analyze the derivatives of individual variables of the alternative representation Ĉ in <ref>. Consider a variable Ĉ^t_l, l∈𝒱̂_ij. Taking the derivative of <ref> with respect to Ĉ^t_l, the left-hand side simplifies to only the Ĉ^t_l since for all other variables, we have that Ĉ^t_lĈ^t_l'\| C^t-1,Î^t. The right-hand side, however, has two options: ∂^2 (C^t_m\|C^t-1)/∂ C^t_m ∂Ĉ^t_l = ∂^2 (Ĉ^t_l\|C^t-1)/∂ C^t_m ∂Ĉ^t_l = (-1)^1[E^m_i = E^m_s]∑_w∈𝒱̂_sr 0 if w ≠ l ∂^2 (Ĉ^t_l\|C^t-1)/∂ C^t_m ∂Ĉ^t_l if w = l = 0 if l ∉𝒱̂_sr (-1)^1[E^m_i = E^m_s]∂^2 (Ĉ^t_l\|C^t-1)/∂ C^t_m ∂Ĉ^t_l if l ∈𝒱̂_sr If E^m_i ≠ E^m_s, we have an equation similar to c = -c, which can only be solved via c=0. Therefore, we can further simplify the equation to: ∂^2 (Ĉ^t_l\|C^t-1)/∂ C^t_m ∂Ĉ^t_l = 0 if l ∉𝒱̂_sr or E^m_i ≠ E^m_s ∂^2 (Ĉ^t_l\|C^t-1)/∂ C^t_m ∂Ĉ^t_l otherwise Plugging everything together From <ref>, we can make the following conclusions: for any variable Ĉ^t_l which is not in all experiment pairs of 𝒱_m, its second derivative ∂^2 (Ĉ^t_l\|C^t-1)/∂ C^t_m ∂Ĉ^t_l must be zero. This is an important insight, since we know that all second derivatives equations must still equal to ∂^2 (C^t_m\|C^t-1)/∂ C^t_m ∂Ĉ^t_l. Using the chain rule, we can relate these second derivatives even further: ∂^2 (C^t_m\|C^t-1)/∂ C^t_m ∂Ĉ^t_l = ∂^2 (C^t_m\|C^t-1)/∂^2 C^t_mJ^-1_ml ∂^2 (C^t_m\|C^t-1)/∂^2 C^t_mJ^-1_ml = ∂^2 (Ĉ^t_l\|C^t-1)/∂ C^t_m ∂Ĉ^t_l where J^-1_ml is the ml-th entry of the inverse of the Jacobian, J^-1_ml=∂ C^t_m/Ĉ^t_l. From our assumptions, we know that ∂^2 (C^t_m\|C^t-1)/∂^2 C^t_m cannot be constant zero for all values of C^t_m. Therefore, if ∂^2 (Ĉ^t_l\|C^t-1)/∂ C^t_m ∂Ĉ^t_l is zero following <ref>, then this must strictly imply that J^-1_ml must be constantly zero, C^t_m and Ĉ^t_l are independent. However, at the same time, we know that J^-1_ml cannot be constantly zero for all l since otherwise, J^-1 (and therefore J) has a zero determinant and thus the transformation between C and Ĉ cannot be invertible. Therefore, in order for Ĉ to be a valid transformation, there must exist at least one variable Ĉ_l which is in all experiment sets 𝒱_m. This implies that for this variable Ĉ_l and our original causal variable Ĉ_m, the following relations must hold: E_i^k = E_j^k ⇔Ê_i^l = Ê_j^l This inherently implies that for any variable C_k, there must exist at least one variable Ĉ_l, for which the following must hold: ∀ i, E_i^k = Ê_i^lor∀ i, E_i^k = 1-Ê_i^l Finally, since for every variable C_k, the set of experiments is unique, no deterministic function between I_k and any other interaction variable I_j, and the alternative representation has the same number of variables, it implies that there exists a 1-to-1 match between an interaction variable I_k and in the alternative representation Î_k. This proves our original lemma. §.§.§ Alignment of interaction variables - Multi-variable case (condition (B) - <ref>) For any variable C_k (k=1,...,K) with interaction variable I_k, there exist exactly one variable Ĉ_l with interaction variable Î_l, which models the same interaction pattern: ∀ C^t I^t_k=Î^t_lorI^t_k=1-Î^t_l if for any C^t, there exist K+1 different values c^1,...,c^K+1 for C^t for which the vectors v_1,...,v_K of the following structure are linearly independent: v_i = [ ∂(C^t_i\|C^t-1=c^1)/∂ C^t_i ∂(C^t_i\|C^t-1=c^2)/∂ C^t_i ⋯ ∂(C^t_i\|C^t-1=c^K+1)/∂ C^t_i; ]^T ∈ℝ^K We follow the same proof as for Lemma <ref> up until <ref>, where for each variable C_m, we have obtained the following equation: ∂_ij(C^t_m\|C^t-1)/∂ C^t_m = ∑_l∈𝒱̂_ij∂_ij(Ĉ^t_l\|C^t-1)/∂ C^t_m Here, we rewrite the derivative ∂_ij(Ĉ^t_l\|C^t-1)/∂ C^t_m using the chain rule to: ∂_ij(Ĉ^t_l\|C^t-1)/∂ C^t_m = ∂_ij(Ĉ^t_l\|C^t-1)/∂Ĉ^t_l∂Ĉ^t_l/∂ C^t_m = ∂_ij(Ĉ^t_l\|C^t-1)/∂Ĉ^t_lJ_lm Therefore, we obtain: ∂_ij(C^t_m\|C^t-1)/∂ C^t_m = ∑_l∈𝒱̂_ij∂_ij(Ĉ^t_l\|C^t-1)/∂Ĉ^t_lJ_lm Note hereby that J_lm is independent of the time index t and particularly C^t-1, which will become important in the next steps of the proof. Alternative representation having linear independent vectors Now consider the K different vectors v^1,...,v^K, which are linearly independent. For each of these individual vectors, we have at least K equations of the form of <ref>, namely for each C^t_1,...,C^t_K. We can also express this in the form of a matrix product. For that, we first stack the vectors v^1,...,v^K into V∈^(K+1)× K: V=[ \| \|; v_1 ⋯ v_K; \| \|; ] = [ ∂(C^t_1\|C^t-1=c^1)/∂ C^t_1 ∂(C^t_2\|C^t-1=c^1)/∂ C^t_2 ⋯ ∂(C^t_K\|C^t-1=c^1)/∂ C^t_K; ∂(C^t_1\|C^t-1=c^2)/∂ C^t_1 ∂(C^t_2\|C^t-1=c^2)/∂ C^t_2 ⋯ ∂(C^t_K\|C^t-1=c^2)/∂ C^t_K; ⋮ ⋮ ⋱ ⋮; ∂(C^t_1\|C^t-1=c^K+1)/∂ C^t_1 ∂(C^t_2\|C^t-1=c^K+1)/∂ C^t_2 ⋯ ∂(C^t_K\|C^t-1=c^K+1)/∂ C^t_K; ] We denote V̂ as the same matrix as in <ref>, just with each C^t_i replaced with Ĉ^t_i. Finally, we need to represent the factors of <ref>. Since these depend on a specific pair of experiments E_i,E_j, we pick for each variable C_m^t+1 an arbitrary pair of experiments, where E^m_i=1 and E^m_j=0. With this in mind, we can express the factors of <ref> as: L = J⊙[ δ^E_11 δ^E_12 ⋯ δ^E_1K; δ^E_21 δ^E_22 ⋯ δ^E_2K; ⋮ ⋮ ⋱ ⋮; δ^E_K1 δ^E_K2 ⋯ δ^E_KK; ] where L∈^K× K, ⊙ is the Hamard product/element-wise product, and δ^E_lm=1 if Ê^l_i=1,Ê^l_j=0 for the experiment pair E_i,E_j picked for C_m, 0 if Ê^l_i=Ê^l_j, and -1 otherwise. With that, we can express <ref> in matrix form as: V = V̂L Since V has linearly independent columns and, based on <ref>, is equal to linear combinations of the columns of V̂, it directly follows that V̂ must also have linearly independent columns. Solution to linear independent system At the same time, we know that for each variable C_m, there exist pairs of experiments E_i,E_j for which E^m_i=E^m_j. We denote this set of experiment pairs by 𝒱̅^m = {𝒱̅_ij\| i,j∈1Q, E_i^m= E_j^m} with its size denoted as Q_m=\|𝒱̅^m\|. Each of these implies an equation like the following: 0 = ∑_l∈𝒱̅_ij∂_ij(Ĉ^t_l\|C^t-1)/∂Ĉ^t_lJ_lm We can, again, write it in matrix form to show this set of equations over the different temporal values c^1,...,c^K+1: 0 = V̂L̅^m where L̅^m = [ \| \|; J_· m · J_· m; \| \|; ]⊙[ 1[1∈𝒱̅^m_1] 1[1∈𝒱̅^m_2] ⋯ 1[1∈𝒱̅^m_Q_m]; 1[2∈𝒱̅^m_1] 1[2∈𝒱̅^m_2] ⋯ 1[2∈𝒱̅^m_Q_m]; ⋮ ⋮ ⋱ ⋮; 1[K∈𝒱̅^m_1] 1[K∈𝒱̅^m_2] ⋯ 1[K∈𝒱̅^m_Q_m]; ] Intuitively, L̅^m lists out the Q_m different equations of <ref> for variable C_m, duplicated for all possible temporal values c^1,...,c^K+1. Since all columns of V̂ are linearly independent, the only solution to the system is that L̅^m=0, or in index form L̅^m_ij=0 for all i=1,...,Q_m; j=1,...,K. Matching of interaction variables The fact that L̅^m_ij=0 must be zero means that one of its two matrix elements must have a zero entry. Thus, for each variable Ĉ_l, J_lm can only be non-zero if l is not in any sets of 𝒱̅^m. This implies that either Ĉ_l must follow the exact same interaction pattern as C_m, I_m=Î_l or I_m=1-Î_l, or Î_l is a constant value. However, the constant value case can directly be excluded since this would imply L to have a zero determinant (δ^E_l·=0), which is not possible with V≠ 0. At the same time, at least one value of J_· m must be non-zero to ensure J to be invertible. Therefore, each variable C_m must have one variable Ĉ_l for which I_m=Î_l or I_m=1-Î_l. Finally, this match of C_m,Ĉ_l must be a unique since every variable C_m has a different interaction pattern, and we are limited to K variables Ĉ_1,...,Ĉ_K. With that, we have proven the initial lemma. Non-zero elements in Jacobian Additionally to the lemma, this proof also shows that J must have exactly one non-zero value in each column and row, being a permuted diagonal matrix. §.§.§ Equivalence up to component-wise invertible transformations and permutation With both Lemma <ref> and Lemma <ref>, we have shown that the two representations C and Ĉ need to have the same interaction patterns. Now, we are ready to prove the identifiability of the individual causal variables. Since most of the results have been already shown in the previous proofs, we skip the intuition on the two-variable case and directly jump to the multi-variable case: For any variable C_k (k=1,...,K) with interaction variable I_k, there exist exactly one variable Ĉ_l with an invertible transformation T_l for which the following holds: C^t_k = T_l(Ĉ^t_l) We start with reiterating the initial result of <ref> stating that there exist an invertible transformation between C and Ĉ: C=T(Ĉ). This also gives us the change of variables distribution: p(C^t\|C^t-1,I^t) = p(Ĉ^t\|C^t-1,Î^t)\|J\| Our goal is to show it follows for each C_k, there exists a Ĉ_l for which the following holds: p(C_k^t\|C^t-1,I_k^t) = p(Ĉ^t_l\|C^t-1,Î_l^t) \|J_lk\| This change-of-variable equation implies that there exist an invertible transformation between C_k and Ĉ_l with the scalar Jacobian J_lk. Intermediate proof step based on Lemma <ref> To prove this based on Lemma <ref>, we reuse our final results of the proof in <ref>. Specifically, we have shown before that the inverse of the Jacobian J^-1_kj for the transformation from C_k to Ĉ_j must be constantly zero if C_k and Ĉ_j do not share the same interaction pattern. Further, we have shown that for each variable C_k, there exists exactly one variable Ĉ_l for which J^-1_kl≠ 0. Given that J^-1_k· is zero except for entry l, and that this entry index is different for every k, it follows that J^-1_kl must be a permuted diagonal matrix: J^-1 = DP where D is a diagonal matrix and P is a permutation matrix. The diagonal elements of D^-1 are the non-zero values of J^-1, where J^-1_kl≠ 0. Inverting both sides gives us: J = P^TD^-1 Inverting the diagonal matrix D gives us yet another diagonal matrix, just with inverted values. Therefore, we have that J_kl=1/J^-1_lk if J^-1_kl≠ 0, and 0 otherwise. Intermediate proof step based on Lemma <ref> In the proof of Lemma <ref> (<ref>), we have already shown that J must be a permuted diagonal matrix. Joint final step With having J identified as a permuted diagonal matrix, we can derive the originally stated component-wise invertible transformation. For clarity, we denote the indices at which the Jacobian is non-zero as f(l)=max_(l,k) \|J_lk\|, f(l) returns the index (l,k) for which J_lk≠ 0. Using these indices, we can write the determinant of J as the product of the individual diagonal elements: \|J\| = ∏_l=1^K \|J_f(l)\| Inherently, we can use this to rewrite <ref> to: p(C^t\|C^t-1,I^t) = p(Ĉ^t\|C^t-1,Î^t)∏_l=1^K \|J_f(l)\| = ∏_l=1^K p(Ĉ_l^t\|C^t-1,Î^t) \|J_f(l)\| Therefore, for a pair of variables C_k,Ĉ_l with f(l)=(l,k), it follows that: p(C_k^t\|C^t-1,I_k^t) = p(Ĉ^t_l\|C^t-1,Î_l^t) \|J_lk\| This shows that for every variable C_k, there exist one variable Ĉ_l with an invertible transformation C^t_k = T_l(Ĉ^t_l) which has the Jacobian of \|J_lk\|. §.§.§ Putting everything together Having proven Lemma <ref>, <ref>, <ref>, <ref>, and <ref>, we have now all components to prove the original theorem: An estimated model ℳ=⟨ĝ,f̂,ω̂,𝒞̂⟩ identifies the true causal model ℳ=⟨ g,f,ω,𝒞⟩ if: * (Observations) ℳ and ℳ model the same likelihood: p_ℳ(X^t\|X^t-1,R^t)=p_ℳ(X^t\|X^t-1,R^t); * (Distinct Interaction Patterns) Each variable C_i in ℳ has a distinct interaction pattern (Definition <ref>); and one of the following two conditions holds for ℳ: A. (Dynamics Variability) Each variable's log-likelihood difference is twice differentiable and not always zero: ∀ C^t_i ,∃ C^t-1∂^2 (C^t_i\|C^t-1)/∂ (C^t_i)^2≠ 0; B. (Time Variability) For any C^t∈𝒞, there exist K+1 different values of C^t-1 denoted with c^1,...,c^K+1∈𝒞, for which the vectors v_1,...,v_K∈^K+1 with v_i = [ ∂(C^t_i\|C^t-1=c^1)/∂ C^t_i ∂(C^t_i\|C^t-1=c^2)/∂ C^t_i ⋯ ∂(C^t_i\|C^t-1=c^K+1)/∂ C^t_i; ]^T ∈ℝ^K+1 v_i = [ ∂(C^t_i\|C^t-1=c^1)/∂ C^t_i ⋯ ∂(C^t_i\|C^t-1=c^K+1)/∂ C^t_i; ]^T are linearly independent. Based on Lemma <ref>, we have shown that there exists an invertible transformation between the latent spaces of ℳ and ℳ. Further, we have shown in Lemma <ref> with Lemma <ref> (for condition (A)) or Lemma <ref> (for condition (B)) that ℳ must model the same interaction cases and patterns as ℳ. Finally, this resulted in the proof of Lemma <ref>, namely that the invertible transformation T has a Jacobian with the structure of a permuted diagonal matrix. This shows that there exist component-wise invertible transformations between the latent spaces of ℳ and ℳ, effectively identifying the causal variables of ℳ. §.§ Extension to Longer Temporal Dependencies The shown proof demonstrates the identifiability results for causal relations between C^t and its previous time step C^t-1. In case the ground truth system contains longer temporal dependencies, e.g. C^t-τ→ C^t for any τ>1, we can easily obtain the same identifiability results by extending our conditioning set of the distribution p(C^t\|C^t-1,R^t) to include τ≥ 1 additional time steps p(C^t\|C^t-1,C^t-2,...,C^t-τ,R^t). The key property of the identifiability proof in <ref>, that allows for this simple extension, is that we use C^t-1 only to ensure that the causal variables in a time step t remain conditionally independent given R^t: C^t_i ⊥⊥ C^t_j \| C^t-1,R^t In order to extend this to longer dependencies up to t-τ, we can instead consider: C^t_i ⊥⊥ C^t_j \| C^t-1,...,C^t-τ,R^t Furthermore, the conditioning set can also be extended with any other observable information, e.g. environment parameters, as long as the conditional independencies hold. In the proof, this corresponds to replacing C^t-1 with the set of time steps that may have a causal relation to C^t, {C^t-τ\|τ=1,...,T_D}, with T_D denoting the maximal temporal length of causal relations. Our learning algorithm, , can be similarly adapted to longer temporal relations. Specifically, we need to condition its prior p_ω and interaction MLP MLP^Î_i_ω on more time steps, i.e. changing p_ω(z^t\|z^t-1,R^t) and MLP^Î_i_ω(R^t,z^t-1) to p_ω(z^t\|z^t-1,z^t-2,...,z^t-τ,R^t) and MLP^Î_i_ω(R^t,z^t-1,...,z^t-τ). §.§ Identifying the Temporal Causal Graph In our setting, we assume that the relations between underlying causal variables are limited to edges in a causal graph that go from a variable C^t-1_i at time step t-1 to another variable C^t_j in the following time step t. As summarized in Figure 2, the edges between the interactions variables I^t_i and the relevant causal variables C^t_i are fixed, as are the edges between the regime R^t and the interaction variables I^t_i. If the true causal variables were observed, by additionally assuming also the standard causal Markov and faithfulness assumptions (which are not otherwise necessary in our setup), one could easily learn the causal relations between C^t-1_i and C^t_j by checking which of these causal variables are still dependent when conditioning on C^t-1∖ C^t-1_i and R^t-1. This is a trivial modification of known results for causal discovery on time series <cit.>, proving that the causal graph in this setting is identifiable. In our setting, we do not know the true causal variables, but we learn the causal variables up to permutation and component-wise transformations. By applying any appropriate causal discovery algorithm for this time series setting, as described by <cit.>, we can then identify the causal structure, again up to permutation of the nodes. We provide an example of discovering the causal graph between the learned causal variables of in <ref>. §.§ Relation to Previous Identifiability Results We compare our identifiability results to various previous works in causal representation learning in terms of the different inputs/observations the methods require, and the causal relations they support in <ref>. The related works which have the most similar setups to ours, using a regime variable and focuses on temporal causal relations, are iVAE <cit.>, LEAP <cit.> and DMS <cit.>. In summary, iVAE and LEAP require a stronger form of both our dynamics and time variability assumptions, which excludes common models like additive Gaussian noise models. DMS requires that no two causal variables share the same parents, limiting the allowed temporal graph structures. We give a more detailed discussion below, which we will add in short to the main paper (Section 3 and 5) and in its full form in the appendix of our paper. In iVAE <cit.>, the regime variable u is assumed to contain any additional information that makes the causal variables conditionally independent. In our case, u would include both R^t and the previous time step C^t-1. Under this setup, the iVAE theorem states that an additive Gaussian noise model can only be identified up to a linear transformation, e.g. Ĉ^t=AC^t+c with A∈ℝ^K× K, c∈ℝ. In comparison, the identifiability class in BISCUIT for the additive Gaussian noise model is much stronger, since the causal variables are identified up to component-wise invertible transformations. In order to gain a similar identifiability class as BISCUIT, iVAE requires the distributions p(C^t_i\|u) to have a sufficient statistic that is either not monotonic, or of size greater than 2 (similar to our dynamics variability assumption). Additionally, iVAE requires 2K+1 different regimes with linearly independent effects on the causal variables, which is similar to the linear independence in our time variability assumption. The identifiability theorem of LEAP <cit.> has similar differences to ours as iVAE. In short, it requires a stronger form of our dynamics and time variability assumption. Specifically, the theorem requires that for all regimes R^t and time steps C^t, there exist 2K+1 values of C^t-1 for which the first and second-order derivative of the log-likelihood differences (in our notation ∂Δ (C^t_i\|C^t-1) / ∂ C^t_i and ∂Δ (C^t_i\|C^t-1)^2 / ∂^2 C^t_i) are linearly independent. Thus, it requires our time variability assumption for both the first and second derivative, as well as 2K+1 points instead of K+1 as in BISCUIT. This excludes common models such as additive Gaussian noise models. Finally, the Disentanglement via Mechanism Sparsity method (DMS) <cit.> is based on the same concepts as iVAE. In order to allow for additive Gaussian noise models, the following assumptions need to be taken: (1) each causal variable has a unique set of parents, (2) the distribution functions for each causal variable need to vary sufficiently over time, and (3) there exist K+1 values of C^t-1 that change the distributions for each causal variable in a linearly independent manner (similar to our time variability assumption). The assumption of unique parents may be violated in settings where causal variables strongly interact, especially when we have context-dependent interactions (e.g. the egg being cooked by the stove, only if it is in the pan). In comparison, BISCUIT can be applied to any graph structure and does not require additional variability assumptions, making it overall wider applicable. We note that the stronger identifiability results of BISCUIT are only possible by taking the assumption of binary interactions. In situations where the interactions between the regime variable and the causal variables cannot be described by binary variables, iVAE, LEAP or DMS may still be applicable. §.§ Detailed Example for Additive Gaussian Noise In this section, we discuss the additive Gaussian Noise example of <ref> in detail, including the specific mechanisms used in <ref>. Consider an additive Gaussian noise model with two variables C_1,C_2 and their dynamics function C^t_i=μ_i(C^t-1, I^t_i) + ϵ_i, ϵ_i ∼𝒩(0,σ^2). For simplicity, in this example we assume the regime variable can be represented as R^t=[I^t_1, I^t_2] and the mean function μ_i to be of the following form: μ_i(C^t-1, I^t_i)= 1 if I^t_i=1 0 otherwise A common difficulty in additive Gaussian noise models is to identify the true causal variables, C_1,C_2, in contrast to possible rotated representations, Ĉ_1=cos(θ)C_1 - sin(θ) C_2, Ĉ_1=sin(θ)C_1 + cos(θ) C_2 for an angle θ∈[0,2π). Thus, for simplicity, we limit the possible representation space here to rotations of the form Ĉ_1,Ĉ_2. We aim to show that if we enforce the dependency of the regime variable R^t with each causal variable (Ĉ_1,Ĉ_2) to be expressed by a binary interaction variable (Î_1,Î_2), Ĉ_1 and Ĉ_2 must identify the true causal variables up to permutation and element-wise invertible transformations. Firstly, in the general case, we can write the mean functions for the rotated representation Ĉ_1,Ĉ_2 as: μ̂_1(Ĉ^t-1, R^t)=cos(θ) - sin(θ) if R^t=[1,1] cos(θ) if R^t=[1,0] -sin(θ) if R^t=[0,1] 0 if R^t=[0,0] μ̂_2(Ĉ^t-1, R^t)=sin(θ) + cos(θ) if R^t=[1,1] sin(θ) if R^t=[1,0] cos(θ) if R^t=[0,1] 0 if R^t=[0,0] Since the Gaussian distribution is rotational invariant, the fact that we can determine the mean from C^t-1, R^t for the new representation implies that C_1,C_2 and Ĉ_1,Ĉ_2 model the same data likelihood, i.e. ∏_i=1^2 p_i(C^t_i\|C^t-1,R^t) = ∏_i=1^2 p̂_i(Ĉ^t_i\|Ĉ^t-1,R^t). Therefore, without constraints on how R^t is used in the distributions for the individual causal variables, we cannot distinguish the true causal variables from an arbitrarily rotated representation simply from the data likelihood under different interactions. This changes when making use of binary interaction variables Î_1,Î_2. In this setting, both mean functions need to be reduced to the form: μ̂_i(Ĉ^t-1, Î^t_i)= a(Ĉ^t-1) if Î^t_i=1 b(Ĉ^t-1) otherwise where a,b can be arbitrary functions. In other words, we need to reduce the mean functions for the general setting from 4 cases to 2 cases per causal variables. Hereby, it becomes clear that we can only do so by setting either sin(θ) or cos(θ) to zero, which is at θ∈{0,π/2,π,3π/2}. Any of these rotations are a multiple of 90 degrees, which means that Ĉ_1,Ĉ_2 are identical to C_1,C_2 up to permutation and/or sign-flips. Therefore, by enforcing the effect of R^t to be described by binary interaction variables, we have successfully identified the causal variables according to Definition 3.1. § EXPERIMENTAL DETAILS In this section, we provide details on the experimental setup, including datasets and hyperparameters. <ref>, <ref>, and <ref> discuss the Voronoi, CausalWorld, and iTHOR experiments respectively. §.§ Voronoi §.§.§ Dataset Setup The Voronoi dataset <cit.> represents a synthetic benchmark for testing the model on various distributions, graph structures and variable sizes. We adapt the original setup of <cit.> by removing instantaneous effects and restrict the distributions to additive Gaussian noise models: C^t_i = MLP_i(C^t-1⊙ M_i) + ϵ, ϵ∼𝒩(0,0.4) where M_i∈{0,1}^K is a binary mask according to the sampled causal graph ( M_ij=1 if C^t-1_j→ C^t_i, and M_ij=0 otherwise). The network MLP_i is a randomly initialized 3-layer MLP with BatchNorm layers in between. Under interventions, we set the output of the MLP to zero, effectively performing a perfect intervention while keeping the same noise distribution. For the graph structures, we sample each edge independently with a chance of 0.4, M_ij∼Bern(0.4), while ensuring each variable having at least one parent. For a graph with six variables, this gives 2.4 parents per variable in expectation, and 3.6 for nine variables. The is a two-dimensional continuous variable in the range R^t∈[-1.5,1.5]^2 and is sampled uniformly at each time step. If any dimension has an absolute value greater than 1, the data point is considered observational, no interventions. For all other values in the Robotic Arm setup, we assign each voronoi cluster to one causal variable randomly. If a circle with radius 1/16 around R^t touches a voronoi cluster, we perform an intervention on this respective causal variable. On boundaries, this results in performing interventions on multiple variables simultaneously. In the Minimal Interactions setup, we use the same strategy but limit the number of voronoi clusters to ⌊log_2 K⌋ +2 as in <cit.>, which is four for six variables and five for nine variables. Further, we do not allow for any overlap. Numerating the clusters by c=1,...,⌊log_2 K⌋ +2, we perform an intervention on variable C_i if ⌊(i+1)/2^c-1⌋ 2 = 0. This gives each causal variable a unique pattern in its interaction variable. An example setup for both cases is shown in <ref>. For each dataset, we sample 150k training frames in a single sequence, and 25k samples for the held-out test set. §.§.§ Hyperparameters and Implementation Details The hyperparameters shared across all methods are shown in <ref>. The CNN used for the encoder and decoder is the same as in <cit.>. The number of latents is twice as the number of causal variables, which represents a rough overestimation of the true number of causal variables in the environment. Further, the learning rate was finetuned separately for each method in the range [1e-4, 1e-3]. However, none of the tested methods showed to be sensitive to these hyperparameters, and 4e-4 showed to work well across all methods. In the paragraph below, we discuss further implementation details specific to the individual methods. In the prior, is implemented by a 2-layer MLP with hidden dimensionality 32 and SiLU <cit.> activations. shares the same structure. The output activation function of is implemented as f(x)=tanh(x ·τ) where τ represents the inverse of the temperature and is scaled linearly in the range [1,5] from start to end of the training. With τ=∞, the activation function becomes a step function: f(x)=tanh(x ·∞)=1 if x > 0, -1 otherwise. As regularizer on the logits, we use an L2 regularizer for values that are above -1: ℓ_2=max(x+1, 0)^2. This regularizer gives the interaction variables a bias towards being 0 / -1 for the default, observational case. We add this regularizer with a weight of 5e-4 to the negative log-likelihood loss of . iVAE As conditioning variable u, we use the concatenation of the latents of the previous time step, z^t-1, and the current R^t. To account for the parameter difference to and the other baselines, we use a 2-layer MLP with hidden size 256. The prior outputs a Gaussian per latent with learnable mean and standard deviation. LEAP We base our implementation of LEAP <cit.> on the publicly released code[<https://github.com/weirayao/leap>]. To allow for LEAP to work both on single images and sequences, we do not use an RNN structure in the encoder as this showed to give poor performance on this dataset. We use the same MLP architecture as in to model the prior network, and use affine conditional normalizing flows for the mapping of the noise to the prior distributions. The discriminator is implemented with a 2-layer MLP with hidden dimension 64. We finetuned the hyperparameters for sparsity and discriminator weight on the NLL weight, for which we found 0.01 and 0.1 respectively. DMS We base our implementation of DMS <cit.> on the publicly released code[<https://github.com/slachapelle/disentanglement_via_mechanism_sparsity>]. In DMS, we use R^t as two action variables that are concatenated to the inputs. We differ from the original implementation by only training the model on the conditional distribution, p(X^t\|X^t-1,R^t), and not include the loss for the first element, p(X^0\|R^0). The reason for this is that we observed significantly worse performance on this dataset when including this prior loss, and to be fair with , we align the implementation to focus on the conditional distribution too. As a hyperparameter, we finetuned the sparsity weight in the range [0.001,0.1] with a final value of 0.02, which lead to a learned graph density of ∼ 0.2. §.§.§ Results Result Table As supplement to <ref> of the main plot, we provide the R^2 scores with standard deviations in <ref>. Besides the R^2 score, we also report the Spearman correlation on the same latent variables to the ground truth causal variables. We created five datasets with different graphs and mechanisms for each setup. Each model was trained on these five datasets with two different seeds each. This gives us 10 results per model and data setup. Learned Interaction Variables To verify that the learned interaction variables are matching the ground truth, we plot them over the different values of R^t in <ref>. The x and y dimensions of the images correspond to the two dimensions of R^t, and different colors show different interaction variables. Overall, we find that learned the same underlying structure of the interaction variables, but, as expected, with an arbitrary permutation. Learned Causal Structure We provide results for estimating the causal graph between the learned causal variables of BISCUIT in the Voronoi dataset. For estimating p(z^t_i\|z^t-1, R^t), we start from a fully-connected graph from z^t-1 to z^t, and applying a sparsity regularizer to remove edges. This is similar to NOTEARS <cit.> without the acyclicity regularizer, since the directions of all edges are known. Alternatively, intervention-based causal discovery algorithms like DCDI <cit.> or ENCO <cit.> could be used with the learned interaction variables. The results in <ref> show that the identified causal graph matches the ground truth graph, with an SHD of 0 for the 9 variable graph and an SHD of 1 for the 6 variable graph. §.§ CausalWorld §.§.§ Dataset Setup We set up the CausalWorld environment <cit.> to contain a single cube as an object with a tri-finger system to interact with it. The environment is observed by three cameras positioned around the arena, each returning an RGB image of dimensions 128× 128× 3. Additionally, to perceive the velocity, a difference of frames on the cube is concatenated to each RGB image. This gives a combined observation size of 128× 128× 12. To reduce the computation cost of training all models on this dataset, we bi-linearly downscale the images to a resolution of 64× 64× 12. The consists of the three rotation angles of each arm of the tri-finger at the current and previous time step, giving overall R^t∈^18. This provides both location and velocity information about the tri-finger robotic system. Furthermore, in this setup, the across time steps has a causal relation, R^t-1→ R^t, since they share one time step and the tri-fingers have a limited distance they can travel within one time step. The causal graph consists of seven high-level causal variables: the colors of the three tri-fingers, the friction of the canvas, the floor, and the cube, and finally the state of the cube (cube position, velocity and rotation). The frictions of the different objects are visualized by the colors of the respective objects. For all colors and frictions, we use an additive Gaussian noise model as a ground truth causal model, where under no interactions, we have C^t_i=0.95· C^t-1_i + ϵ_i, ϵ_i∼𝒩(0,0.15). Under interactions, we set C^t_i=σ^-1(u), u∼ U(0,1) where σ^-1 is an inverse sigmoid. The causal model of the cube state is based on the physical interactions between the cube, the robot, and the frictions of the floor, stage, and cube. An interaction of one of the tri-fingers with the cube causes an intervention on the color of the touched tri-finger and the cube state (position, velocity, and rotation). Further, the floor friction is randomly re-sampled if all three tri-fingers touch the floor. Similarly, the canvas friction changes if all tri-finger rotations of the first arm element are above a certain threshold. Finally, the robot interacts with the cube friction if the fingers touch in the center of the arena. We generate 200 sequences of each 1000 frames for training, and 25 sequences for testing. Examples are shown in <ref>. §.§.§ Hyperparameters and Implementation Details We apply the autoencoder + normalizing flow setup of . For this, we first train an autoencoder with mean-squared error loss on individual observations to map the 64× 64× 12 input to a 32 dimensional latent space. During the autoencoder training, we apply a Gaussian noise of 0.05 on the latents, and add an L2 regularizer with a weight of 1e-5 to limit the scale of the latent variables. As architecture, we use a convolutional ResNet <cit.> with two convolutional layers with consecutive GroupNorm normalization <cit.> per ResNet block. After each two ResNet blocks, we reduce the spatial dimensionality using a convolution with stride 2 until we reach a spatial size of 4× 4. At this point, the feature map is flattened, and two linear layers map it to the 32 latent dimensions. The decoder is a mirrored version of the encoder, replacing stride convolutions with up-scaling layers using bi-linear interpolation. We add R^t to the decoder by concatenating it with the latent vector before passing it to the first linear layer of the decoder. Both encoder and decoder use a channel size of 128. We train this network with a batch size of 128 and learning rate of 4e-4 with cosine scheduling for 500 epochs. The normalizing flow follows the architecture used by <cit.>, namely six autoregressive affine coupling layers <cit.> with 1x1 convolutions and activation normalization <cit.> in between. The prior uses the same setup and hyperparameters as for the Voronoi dataset, except using a hidden dimension of 64 instead of 32 in the MLPs. We use a batch size of 512 and learning rate of 1e-3, and train for 100 epochs. Baselines For all baselines, we use the same convolutional ResNet architecture for the encoder and decoder as in the autoencoder of . To account for the additional parameters introduced by the normalizing flow of , we increase the hidden dimensions of the prior networks correspondingly. However, in general, we found no noticeable gain from increasing the prior dimensions of the baselines further beyond 64 for LEAP and DMS per latent, and 51sarta2 for iVAE. We performed a small hyperparameter search over the learning rates {2e-4, 4e-4, 1e-3} and sparsity regularizers {0.001, 0.01, 0.1}. For LEAP and iVAE, we picked learning 4e-4, and 2e-4 for DMS. For the sparsity regularizers, very high regularizer lead to early sparsification of the graph, while too small regularizers did not change the graph much. Thus, we picked 0.01 for both models, although it did not show much of an impact on the final identification result. We use a batch size of 64 and train for 250 epochs with cosine learning rate scheduling. Longer trainings did not show any improvements. §.§.§ Results Correlation Evaluation We show the results of all methods on the dataset in <ref>. Similar to the results on the Voronoi dataset, we include the standard deviation over multiple seeds. We performed each experiment only for three seeds to limit the computational cost, and the standard deviation was much lower than the significant differences. As a second metric, we also report the Spearman correlation, which shows a very similar trend. Finally, we show example R^2 matrices learned by all methods in <ref>. Reconstructions The identification of the baselines suffers from the poor reconstruction of the models. We show an example of the reconstructions in <ref>. In general, all baselines miss the cube as well as the colors of the tips. This is because the robotic arms and the cube move over time and appear at different positions in different frames, requiring the VAE to be accurately modeling their positions before learning the colors. However, the gradient signal is often too small to overcome the KL regularizer on the latent space. Common tricks like using a KL scheduler did not show to improve the results. In comparison, -NF can accurately reconstruct the images in <ref>. Since it uses an autoencoder with an unregularized latent space, it is much easier for the model to map all information in the latent space. Interaction Variables To analyze the learned interaction variables in , we recorded in the simulator the time steps on the test set in which there is a collision between an arm and the cube, and convert it to a binary signal (0 - no collision, 1 - collision). After training , we compare the learned binary interaction variables to the recorded collisions in terms of F1 score, similar to the Voronoi experiments. We follow a similar procedure for the remaining causal variables as well. We plot the F1 matrix of learned vs ground truth interactions in <ref>. The learned interaction variables for each arm have an F1 score of about 50%. Since collisions only happen in approx. 5% of the frames, a score of 50% indicates a high similarity between the learned interaction and the ground truth collisions. The mismatches are mostly due to the learned interaction being more conservative, i.e. being 1 already a frame too early sometimes. §.§ iTHOR §.§.§ Dataset Setup r0.25 at (0,0) < g r a p h i c s > ; [draw=black,fill=red] (0.27,-0.2) circle (0.025); (r0) at (0.27,-0.175); (r1) at (0.27,-0.225); (r2) at (0.33,-0.2); [draw=black,fill=red] (r0) – (r1) – (r2) – cycle; [draw=black!90!red,fill=white,inner sep=2pt] (RB) at (0.27,-0.12) Robot; The floor plan of the environment <cit.>. The robot's position and orientation are shown in red. The iTHOR dataset <cit.> is based on the environment, which is the default kitchen environment. We show the overall floor plan in <ref>. In it, we position the robot in front of the kitchen counter, and keep its position fixed. As a first step in the environment, we place two movable objects (a plate with a potato and an egg) randomly on the counter, as well as the pan on the stove. We remove all remaining movable objects from the robot's view. Then, at each time step, we perform a randomly chosen action on one of the objects. An overview of all objects and actions is shown in <ref>. Note that not all actions are always possible. For instance, objects can only be opened when they are closed, and vice versa. Further, we can perform the action on the microwave only if the microwave is closed, and the action when the microwave is turned off. For the movable objects, we can only pick up one of the two objects at once. When an object is picked up, we can interact with a remaining object on the counter with the action which moves it to a new random position on the counter. The action randomly chooses one of the available receptacles to put the object down on. For the plate, this includes the counter and the microwave if it is open. For the egg, this includes the counter and the pan. If the egg is put into the pan, it is automatically broken and cannot be picked up or moved anymore. When any object is put down to the counter, we randomly sample a location on the counter which does not overlap with any other object on the counter. Besides these interactions, we add the action, which does not interact with any object and represents the observational regime. The R^t∈[0,1]^2 represents the click-location of a user on the image to select which object to interact with. Specifically, after choosing the action-object pair to perform at a time step, we use the object segmentation mask of the iTHOR simulator to identify the set of pixels that show the object in question. We then randomly sample one of these pixels, and set R^t as the location of this pixel in the frame. After that, the actual action is performed. As location for the action, we sample a pixel location which does not belong to any object in the current frame. For the microwave, we split the object in two halves, where the left part, the door, performs the action , and the right part, the buttons and display, activates the microwave. Additionally, when the microwave is open, we sample the pixel location from the open door. Finally, the stoves are controlled by the knobs, such that their interactions are sampled from the knobs positions. Examples of the interaction maps are shown in <ref>. The causal variables in this environment align with the action-object pairs at hand. For each object that has the action , we have a binary causal variable indicating whether it is active or not. Similarly, for each object that has the action , we have a binary causal variable indicating whether it is open or not. For each object that has the action , we have one binary causal variable indicating whether it is picked up or not, and three causal variables for the object's x-y-z position in the 3D environment. Additionally, for the egg, we have two binary causal variables indicating whether it is broken, in the pan, and cooked, which happens instantaneously when the stove is being turned on and the egg is in the pan. This results in overall 18 causal variables: * Cabinet-Open * Egg-Broken, Egg-Pos-x, Egg-Pos-y, Egg-Pos-z, Egg-Cooked, Egg-PickedUp * Microwave-Open, Microwave-Active * Plate-Pos-x, Plate-Pos-y, Plate-Pos-z, Plate-PickedUp * Stove1-Active, Stove2-Active, Stove3-Active, Stove4-Active * Toaster-Active r0.26 (0.1,-0.12) rectangle + (0.1, 0.1); at (0,0) < g r a p h i c s > ; (0.1,-0.12) rectangle + (0.1, 0.1); at (0,0) < g r a p h i c s > ; Toaster - Off Toaster - On The Toaster being turned off or on changes very few pixels in the observation. We generate the frames with a resolution of 512× 512× 3, and reduce the dimension to 256× 256× 3 via bi-linearly interpolation afterward. The high resolution is required since some states are only shown by fine details in the image. For instance, <ref> shows that the difference between the toaster being active or not is only a few pixels. In the meantime, actions like the cabinet being opened change about 10% of the image. This makes it challenging for reconstruction-based methods to fully capture all variables fairly in the latent space. Besides, the environment uses a 3D physics engine, showing some interactions that we are not able to fully capture by the causal variables defined. For instance, when the stove is turned on, the flame slowly grows over time and slightly fluctuates once it reached its maximum. Further, when the egg is broken, it slides into the pan over the next three frames. We generate 1500 sequences of each 100 frames, and 250 sequences for testing. Examples are shown in <ref>. §.§.§ Hyperparameters and Implementation Details We slightly adapt the setup from the experiments of the CausalWorld environment by: * we reduce the channel size to 64 and batch size to 64 due to the higher resolution; * we increase the latent dimension to 40 due to the larger number of causal variables; * we reduce the number of epochs to 150 for the autoencoder; * we reduce the learning rate to 2e-4; * we do not use R^t as input to the decoder. In general, we did not find to be particularly hyperparameter sensitive in these experiments. Baselines We adapt the experimental setup of the baselines in the same way as . We set the learning rate to 2e-4 for all baselines, which was more stable across models. §.§.§ Results Correlation Evaluation <ref> supplements the results of <ref> in the main text by including standard deviations over three seeds, as well as the Spearman scores on the same variables. For the multidimensional causal variables 'Egg state' and 'Plate state', where each dimension is highly correlated and shares the same interactions, we follow <cit.> by averaging the variable's dimensions in the R^2-diag calculation before taken the diagonal average. An example R^2 matrix for each method is shown <ref>. identifies and separates all causal variables up to the two movable objects (plate and egg). Meanwhile, for both DMS and LEAP, we find that the models diversely entangle the causal variables. The only causal variable that has not been modeled at all is the toaster, which is likely due to its small pixel footprint in the image (see <ref>). Interestingly, iVAE showed a very different trend. While it has less diverse entanglement than LEAP and DMS, it often models several binary causal variables in the same latent dimension. Since its latent variables are all conditioned on full R^t, there is no difference to model two binary variable in one or two separate dimensions. In contrast, this does not happen in since these different binary causal variables have different binary interaction variables. Interaction Maps Similarly to <ref> in the main text, we visualize more examples of the learned interaction maps of in <ref>. The first column shows the input image, the third the learned binary interaction variables, and the second column the overlap of both. One can clearly see how adapts its interaction variables to the input image. For instance, in the second row, one can see how identifies the regions of the plate and the egg, visualized in red. In line with the R^2 evaluation, maps the interactions with the plate and egg together into one interaction variable instead of separating them. The interaction variables of the microwave change towards focusing on the opened door for the action (blue). Since it is not possible to activate the microwave at this state, its corresponding interaction variable (light blue) mostly disappears. It does not fully disappear, since the model has never seen a click in this region when the microwave door is open. Meanwhile, other interaction variables that are independent of the actual input image, the stove knobs or the toaster, are also kept constant throughout the examples by . The images only show 9 out of the 40 learned interaction maps. The remaining 31 interaction variables are mostly either (1) constants and would give an empty interaction map, or (2) follow a very similar pattern to the red interaction variable, the plate and the egg. While we find that some of these dimension focus slightly more on the plate and some more on the egg, there was none that fully focused on either variable, which follows the insights of the R^2 evaluation. Triplet Generations Similar to <ref> in the main text, we visualize additional examples of triplet predictions of in <ref>. The first two images represent the input images, and the third the generated output. The fourth column specifies which causal variables we tried to replace in the first image by the latents of the second image. consistently generates the correct counterfactual prediction for a variety of causal variables and input images.
http://arxiv.org/abs/2306.02809v1	20230605120336	Topotactically induced oxygen vacancy order in nickelate single crystals	[ "Yu-Mi Wu", "Pascal Puphal", "Hangoo Lee", "Jürgen Nuss", "Masahiko Isobe", "Bernhard Keimer", "Matthias Hepting", "Y. Eren Suyolcu", "Peter A. van Aken" ]	cond-mat.mtrl-sci	[ "cond-mat.mtrl-sci", "cond-mat.str-el", "cond-mat.supr-con" ]	[email protected] Max Planck Institute for Solid State Research, Heisenbergstrasse 1, Stuttgart 70569, Germany [email protected] Max Planck Institute for Solid State Research, Heisenbergstrasse 1, Stuttgart 70569, Germany Department of Materials Science and Engineering, Cornell University, Ithaca, New York 14853, USA Max Planck Institute for Solid State Research, Heisenbergstrasse 1, Stuttgart 70569, Germany The strong structure-property coupling in rare-earth nickelates has spurred the realization of new quantum phases in rapid succession. Recently, topotactic transformations have provided a new platform for the controlled creation of oxygen vacancies and, therewith, for the exploitation of such coupling in nickelates. Here, we report the emergence of oxygen vacancy ordering in Pr_0.92Ca_0.08NiO_2.75 single crystals obtained via a topotactic reduction of the perovskite phase Pr_0.92Ca_0.08NiO_3, using CaH_2 as the reducing agent. We unveil a brownmillerite-like ordering pattern of the vacancies by high-resolution scanning transmission electron microscopy, with Ni ions in alternating square-pyramidal and octahedral coordination along the pseudocubic [100] direction. Furthermore, we find that the crystal structure acquires a high level of internal strain, where wavelike modulations of polyhedral tilts and rotations accommodate the large distortions around the vacancy sites. Our results suggest that atomic-resolution electron microscopy is a powerful method to locally resolve unconventional crystal structures that result from the topotactic transformation of complex oxide materials. df Topotactically induced oxygen vacancy order in nickelate single crystals Peter A. van Aken ======================================================================== § INTRODUCTION In transition metal oxides, strongly correlated valence electrons can couple collectively to the lattice degrees of freedom, which can lead to a variety of emergent ordering phenomena, including exotic magnetism, multiferroicity, orbital order, and superconductivity <cit.>. In oxides with the perovskite structure, high flexibility and tolerance to structural and compositional changes enable the controlled exploitation and manipulation of the emergent properties <cit.>. Oxygen vacancies, for example, can radically alter the electronic states in materials, and in turn, suppress or enhance emergent phases via charge compensation and/or structural phase transitions <cit.>. Understanding the formation of oxygen vacancies and their impact thus provides promising prospects for exploring new physical properties and potential future technological applications. A prototypical example for correlated transition-metal oxides is the family of perovskite rare-earth nickelates, RNiO_3 (R = rare-earth ion), exhibiting a rich phase diagram including metal-to-insulator and antiferromagnetic transitions <cit.>. For R = Pr and Nd, these transitions occur concomitantly with a breathing distortion of the NiO_6 octahedra and a disproportionation of the Ni-O hybridization <cit.>. As a consequence, the material family exhibits a pronounced structure-property relationship <cit.> and a sensitivity to oxygen vacancy formation, which can modify the surrounding Ni-O bonds and the nominal 3d^7 electronic configuration of the Ni^3+ ions <cit.>. Notably, an extensive oxygen reduction of the perovskite phase towards Ni^1+ with a cuprate-like 3d^9 electronic configuration was recently realized via topochemical methods in Nd_0.8Sr_0.2NiO_2 thin films, yielding the emergence of superconductivity <cit.>. Furthermore, superconductivity was also observed in topotactically reduced films with R = La and Pr <cit.>, as well as for various Sr-substitution levels <cit.> and substitution with Ca ions <cit.>. Since these reduced nickelates with the infinite-layer crystal structure are nominally isoelectronic and isostructural to cuprate superconductors, the degree of the analogy between the two material families is vividly debated <cit.>. Moreover, vigorous efforts are ongoing to realize superconductivity not only in thin films, but also in polycrystalline powders <cit.> as well as in single-crystalline samples <cit.>, while also an improved understanding of the topotactic reduction process between the perovskite and infinite-layer phase is highly desirable. In particular, the reduction involves various intermediate (metastable) phases, in which the oxygen vacancy ordering patterns and the nature of the emergent phases have not yet been clarified comprehensively. For instance, extensive experimental and theoretical studies <cit.> were performed on oxygen deficient LaNiO_3-δ with 0 < δ≤ 0.5, suggesting a transition from a paramagnetic metal to a ferromagnetic semiconductor and an antiferromagnetic insulator as a function of increasing vacancy concentration <cit.>. For δ≈ 0.5, neutron powder diffraction <cit.> revealed that the parent perovskite crystal structure with uniform NiO_6 octahedra changed to a structure with sheets of NiO_6 octahedra and square-planar NiO_4 units arranged along the pseudocubic [100] direction <cit.>, involving a 2a_p×2a_p×2a_p reconstruction of the parent pseudocubic unit cell (a_p is the pseudocubic lattice parameter). Yet, the detailed crystal structure for the case δ≈ 0.25 is not known, although an electron diffraction study suggested that it involves a 2a_p√(2)×2a_p√(2)×2a_p reconstructed supercell <cit.>. Moreover, for compounds with R = Pr and Nd, even less understanding of the oxygen deficient phases exists. Metastable structures with ferromagnetic order were initially identified for δ≈ 0.7, with x-ray diffraction data indicating a 3a_p×a_p×3a_p supercell that possibly comprises two sheets of NiO_4 square-planar units connected with one sheet of NiO_6 octahedra <cit.>. In a subsequent neutron powder diffraction study it was suggested, however, that the metastable phase of the Pr compound rather corresponds to δ≈ 0.33 with a √(5)a_p×a_p×√(2)a_p reconstruction and one sheet of NiO_4 square-planar units connected with two sheets of NiO_6 octahedra <cit.>. Here, we use atomic-resolution scanning transmission electron microscopy (STEM) together with electron energy-loss spectroscopy (EELS) to investigate the oxygen vacancy formation occurring in a Pr_0.92Ca_0.08NiO_3-δ single crystal upon topotactic reduction. We resolve the chemical composition and the atomic-scale lattice of the crystal, identifying a 4a_p×4a_p×2a_p reconstructed superstructure with a highly distorted Pr sublattice. We find that the oxygen vacancy ordering pattern corresponds to a brownmillerite-like structure with a two-layer-repeating stacking sequence of NiO_6 octahedra and NiO_5 square pyramids, suggesting an oxygen deficiency of δ≈ 0.25. Meanwhile, quantification of the octahedral tilts and Ni-O bond angles reveals distinct periodic wavelike patterns of polyhedra coordination in different layers due to the oxygen vacancies. These results are markedly distinct from previous reports on reduced rare-earth nickelates and provide an atomic-scale understanding of the moderately oxygen deficient structure with δ≈ 0.25, which is one of the metastable phases occurring during the topotactic reduction process towards the infinite-layer phase of the superconducting nickelates with δ = 1. § METHODS Single crystals of perovskite Pr_1-xCa_xNiO_3 were synthesized under high pressure and high temperature. Specifically, a 1000 ton press equipped with a Walker module was used to realize a gradient growth under a pressure of 4 GPa, executed in spatial separation of the oxidizing KClO_4 and NaCl flux, similarly to the previous synthesis of La_1-xCa_xNiO_3 single crystals <cit.>. The precursor powders were weighed in according to a desired composition of Pr_0.8Ca_0.2NiO_3, although the incorporated Ca content in the obtained Pr_1-xCa_xNiO_3 was lower and ranged from x = 0.08 to 0.1. The Pr_1-xCa_xNiO_3 single crystals were reduced using CaH_2 as the reducing agent in spatial separation to the crystals. The duration of the reduction was eight days, using the same procedure and conditions as previously described for the reduction of La_1-xCa_xNiO_3 crystals <cit.>. Single-crystal x-ray diffraction (XRD) was performed on crystals before and after the reduction. The technical details are given in the Supplemental Material <cit.>. Electron-transparent TEM specimens of the sample were prepared on a Thermo Fisher Scientific focused ion beam (FIB) using the standard liftout method. Samples with a size of 20 × 5 μm^2 were thinned to 30 nm with 2 kV Ga ions, followed by a final polish at 1 kV to reduce effects of surface damage. HAADF, ABF and EELS were recorded by a probe aberration-corrected JEOL JEM-ARM200F scanning transmission electron microscope equipped with a cold-field emission electron source and a probe Cs corrector (DCOR, CEOS GmbH), and a Gatan K2 direct electron detector was used at 200 kV. STEM imaging and EELS analyses were performed at probe semiconvergence angles of 20 and 28 mrad, resulting in probe sizes of 0.8 and 1.0 Å, respectively. Collection angles for STEM-HAADF and ABF images were 75 to 310 and 11 to 23 mrad, respectively. To improve the signal-to-noise ratio of the STEM-HAADF and ABF data while minimizing sample damage, a high-speed time series was recorded (2 μs per pixel) and was then aligned and summed. STEM-HAADF and ABF multislice image simulations of the crystal along [100] and [101] zone axis were performed using the QSTEM software <cit.>. Further details of the parameters used for the simulations are given in the Supplemental Material <cit.>. § RESULTS In thin films of infinite-layer nickelates, the highest superconducting transition temperatures are realized through a substitution of approximately 20% of the rare-earth ions by divalent Sr or Ca ions <cit.>. Accordingly, we have prepared the precursor materials for the synthesis of single crystals with a nominal stoichiometry of Pr_0.8Ca_0.2NiO_3. Using a high-pressure synthesis methods <cit.>, we obtain Pr_1-xCa_xNiO_3 crystals with typical lateral dimensions of 20 – 100 μm. Yet, an analysis of the as-grown crystals by scanning electron microscopy (SEM) with energy-dispersive x-ray (EDX) spectroscopy indicates that the incorporated Ca content lies between x = 0.08 and 0.1 (see Fig. S1 in the Supplemental Material <cit.>). This discrepancy to the nominal Ca content suggests that different growth parameters, such as an increased oxygen partial pressure, might be required to achieve stoichiometric Pr_0.8Ca_0.2NiO_3 crystals. By contrast, the employed parameters yielded higher Ca substitutions as high as x = 0.16 in the case of La_1-xCa_xNiO_3 as determined on the as-grown crystal surface by EDX <cit.>, which exhibits a less distorted perovskite structure <cit.>. As a next step, we use single-crystal XRD to investigate a 20 μm piece that was broken off from a larger as-grown crystal. The acquired XRD data indicate a high crystalline quality (see Fig. S2 of the Supplemental Material <cit.>) and can be refined in the orthorhombic space group Pbnm, which is consistent with PrNiO_3 single crystals and polycrystalline powders <cit.>. The refined Ca content of the crystal is 8.6%. The refined lattice parameters and atomic coordinates are presented in the Supplemental Material <cit.>. Furthermore, we find that the investigated crystal piece contains three orthorhombic twin domains extracted from the refinement, with volume fractions 0.95/0.04/0.01. Subsequently, we carry out the topotactic oxygen reduction on a batch of Pr_1-xCa_xNiO_3 single crystals for eight days, using the same conditions as previously described for the reduction of La_1-xCa_xNiO_3 crystals <cit.>. Single-crystal XRD measurements on a reduced 20 μm crystal indicate a significant transformation of the crystal structure after eight days. However, a strong broadening and the resulting overlap of the Bragg reflections in the XRD maps prohibit a structural refinement and determination of the symmetry by this method (see Fig. S2 <cit.>). Hence, in order to investigate the topotactic transformation of the crystal lattice on a local scale, we turn to atomic-resolution STEM imaging. We examine a reduced Pr_0.92Ca_0.08NiO_3-δ crystal with lateral dimensions of ∼80 μm. A top-down view of the crystal is shown in Fig. 1(a). Identical TEM specimens were prepared from a region of the crystal without visible surface defects caused by the FIB process. Figure 1(b) shows a low-magnification STEM high-angle annular dark-field (HAADF) image. As a first characteristic of the topotactic-reduced crystal, we note that single-crystalline regions in the specimen are separated by grain boundary (GB) like regions, with a width ranging from a few ten to hundred nanometers and a length ranging from a few nanometers to micrometers. The GBs exhibit mostly an amorphous structure [Fig. 1(b) inset and Fig. S3], exhibiting dark contrast in the images that originate from diffuse scattering <cit.> (see Fig. S3 for more details <cit.>). The amorphous character of the GBs is also confirmed in EELS measurements of elemental distribution profiles across a GB, which show a reduced EELS intensity of all cations due to the deteriorating signal in structurally disordered regions (Fig. S4 <cit.>). The presence of GBs can be a consequence of topotactic reduction. Alternatively, the GBs might have formed already during the high-pressure growth of the perovskite phase. Zoom-in STEM-HAADF images from areas on either side of a GB [orange and blue squares in Fig. 1(b)] are displayed in Figs. 1(c) and 1(d). The same lattice structure and orientation are observed from the different crystalline domains near the GB. One typical domain size in the crystal is found to be hundreds of nanometers. STEM-HAADF imaging over larger field of view of hundred nanometers does not reveal any regions with defects or impurity phase inside one crystalline domain, suggesting that each domain retains a high crystalline quality and a stable structural phase after the reduction process (see Fig. S3 <cit.>). Figure 2(a) and 2(d) show atomic-resolution STEM-HAADF images viewed along the [100] and [101] pseudocubic orientations, respectively. The corresponding fast Fourier transforms (FFT) of the images reveal the crystal symmetry [Figs. 2(b) and 2(e)]. As presented in Fig. 2(b), there is an approximate 8% difference of the distances between the FFT maxima in reciprocal space along the [002] and [020] axis (blue arrows on FFT patterns). Based on the preference of vacancy formation on the apical oxygen sites <cit.>, this indicates a contraction along the [002] axis due to the removal of apical oxygen atoms following the topotactic reduction process. Between the FFT maxima, the satellite spots corresponding to the superstructure periodicity appear. The wave vector of the superstructure reflexes is q = 1/4 reciprocal lattice units along [020] axis and q = 1/2 along [002] axis, indicating a formation of the 4a_p×4a_p×2a_p superstructure of perovskite [a = b = 16.56(32) Å, c = 7.60(14) Å]. In STEM-HAADF images, the contrast is approximately proportional to Z^1.7-2 (where Z is the atomic number) <cit.>, so Pr columns (Z = 59) appear bright and Ni columns (Z = 28) exhibit a darker contrast. The fourfold superstructure arises from the periodic changes in the intensity of the STEM image. As shown in the zoomed-in image [Fig. 2(c)], half of the Pr atoms along the [100] projection appear elongated, while the other half remain round and undistorted. Focusing on the first two Pr rows, the atoms exhibit alternating round and vertical oval shapes, while the third and fourth rows exhibit alternating round and horizontal oval shapes. Considering the projection in our image, the distortions stem from displacements of Pr columns. Figure 2(d) indeed reveals straight and zigzag line patterns of Pr atoms alternating along the [1̅01] direction. A closer look at the atomic arrangement in Fig. 2(f) shows that the zigzag line on the fourth column appears to be a mirror of the second, forming a four-layer repeat sequence (ABAC stacking). EELS elemental maps of Pr, Ca and Ni obtained from the crystal are displayed in Figs. 2(g)-2-(i) using Pr M_5,4, Ca L_3,2, and Ni L_3,2 edges, respectively. The maps show that the Pr, Ca and Ni contents are homogeneous over the structure. Integrated concentration profiles of Pr and Ca confirm the A-site cation stoichiometry and uniform distribution (see Fig. S5 <cit.>). This suggests that strong distortions of the Pr lattice are likely not rooted in an A/B-site deficiency or ordering, but rather originate from other factors such as oxygen vacancy formation. To gain insights into the detailed atomic structure, high-resolution STEM annular bright-field (ABF) images were acquired for imaging lighter elements such as oxygen. Figures 3(a) and 3(b) show the simultaneously acquired HAADF and ABF images of the crystal along the [100] projection. The distribution of oxygen ions including filled and empty apical oxygen sites is clearly visible by ABF imaging. The corresponding inverse intensity profiles extracted from different layers are displayed in Fig. 3(c). The absence of image contrast at every fourth oxygen site of the Pr-O layers confirms the vacancy ordering (profiles 1 and 3), while the oxygen content remains constant in Ni-O layers (profile 2). By overlaying the yellow arrows, the ordering pattern of oxygen vacancies can be clearly visualized. Half of the NiO_6 octahedra lose one apical oxygen atom and the remaining five oxygen atoms in a pseudocubic unit cell form a NiO_5 pyramid. Notably, a square pyramidal coordination of the Ni ion is uncommon in nickel-oxide based materials. Few compounds with Ni2+ ions in similar five-fold coordination include KNi_4(PO_4)_3 and BaYb_2NiO_5 <cit.>. However, none of these compounds exhibits a perovskite-derived structure. Our investigation therefore reveals the existence of a new structural motif in marked distinction to the NiO_4 square-planar coordination in previous reports on oxygen-deficient perovskite nickelates <cit.>. A magnified view of the ABF image is shown in Fig. 3(d). The apex-linked pyramids as "bow-tie" dimer units form a one-dimensional chain running along the [001] direction. Such configuration is consistent with the brownmillerite type structure A_nB_nO_3n-1 with n = 4 corresponding to the A_4B_4O_11 phase: Layers of apex-linked pyramids are stacked in the sequence ...-Oc-Py-Oc-Py-..., where Oc denotes a layer containing only octahedra (cyan), and Py a layer only pyramids (orange). The ...-Oc-Py-Oc-Py-... sequence runs parallel to the [010] axis, so that the Py layers are at 1/4 (001) and 3/4 (001) planes with a stacking vector 1/2 [001]. In the pyramidal layers, the remaining oxygen atoms are located at the center of apical sites without causing any tilt of square pyramids. In contrast, the apical oxygen atoms in octahedral layers tend to shift towards the elongated Pr atoms, leading to large octahedral tilts. A corresponding STEM-ABF image simulation was performed based on the predicted atomic model shown in Fig. 3(e) using the multislice method <cit.> (see Fig. S6 <cit.>). The simulated image reproduces the vacant sites and distortions well as observed from the STEM measurements, confirming the main crystal structure and alternating-stacking configuration. The distribution of oxygen vacancies can lead to modifications in bond angles and tilting of octahedra. Quantitative STEM ABF measurements were used to precisely examine the atomic structure including the oxygen positions along the [101] direction. From the inverse ABF intensity profiles taken in Fig. 4(a), as shown in Fig. 4(b), the oxygen intensities on different Ni-O layers vary as a function of the atomic columns along the [010] direction, caused by different apical oxygen occupancies in octahedral and pyramidal layers. Thus, Ni-O layers are denoted Oc as the oxygen intensity reaches its maximum on the octahedral layer and denoted Py with the lower intensity due to oxygen deficiency on the pyramidal layers. Analyses of the ABF image, quantifying the NiO_6 octahedral tilt angles and Ni-O-Ni bond angles, are shown in Figs. 4(c) and 4(d). Notably, we observe two different patterns of octahedral distortions along the [1̅01] direction on the pyramidal and octahedral layers. The pyramidal layer shows a variation of tilt angles, with repeating order -4^∘–0^∘–4^∘–0^∘ [Fig. 4(c), upper panel]. Meanwhile, a single wavelike pattern of Ni-O-Ni angles varies from 157^∘ to 176^∘ with an average of 166.3^∘ [Fig. 4(d), upper panel]. Such four perovskite subcell wavelike pattern, as indicated by the dashed lines, can arise from the ordering of oxygen vacancies along the [100] projection on the pyramidal layer. On the octahedral layer, different from the pyramidal layer, the amplitude of the octahedral tilting is larger, varying from -12^∘ to 12^∘. Ni-O-Ni bond angles on the octahedral layer exhibit a zigzag modulated pattern with two sub-cell repeats and an average of 161.1^∘. The overall periodicity of bond angles and tilt modulations is consistent with the alternating zigzag and straight pattern on the Pr columns along the [1̅01] direction. The simulated ABF image for the predicted model along this viewing direction also agrees well with the STEM-ABF image, confirming the polyhedral distortions in the structure [Fig. 4(e)]. The different amplitudes of tilt and bond angles between pyramidal and octahedral layers are the result of the change in oxygen content. This is also revealed in the structure along the [100] projection [Fig. 3(e)], where NiO_6 octahedra show highly distorted tilts in the octahedral layer, while less distorted NiO_5 pyramids are present in the pyramidal layer for the lattice accommodation due to the removal of oxygen during reduction. § DISCUSSION AND CONCLUSION The obtained insights into the vacancy order in the oxygen sublattice and the distortions of the Pr sublattice are compiled in the two schematics in Fig. 4(f), depicting a brownmillerite-like lattice along the [100] and [101] investigated in this study. Oxygen vacancies at every fourth apical site in every second row lead to a contraction of the out-of-plane lattice parameter and an ordering pattern with alternating NiO_6 octahedral and NiO_5 pyramidal layers. We note that the STEM-ABF images indicate a nominal structure of Pr_0.92Ca_0.08NiO_2.75 based on the oxygen vacancy ordering in one crystalline domain, and a possible nonuniform oxygen content variation can occur due to the presence of GBs. This can be the subject of future work to explore the mechanism and origin of GBs <cit.>. Compared to the perovskite structure, the vacancy order reduces the tilt angles and increases the Ni-O bond angles in the pyramidal environment. Also the Pr sublattice is affected by the lack of every fourth apical oxygen ion, and the resulting complex distortion pattern leads to a 4a_p×4a_p×2a_p reconstructed superstructure. The observed distortion of the Pr cation position and the associated wavelike variation of the surrounding bond angles and polyhedral tilts is highly unusual for perovskite-related materials. Yet, highly distorted A- and B-site cation sublattices were also reported for other topotactically reduced perovskite-related materials, such as CaCoO_2 <cit.>, enabling the realization of phases that might be categorically unattainable by direct synthesis methods. Further studies on Pr_0.92Ca_0.08NiO_2.75 are highly desirable to accurately determine the reconstructed atomic positions and the crystallographic unit cell, which is likely larger than the 4a_p×4a_p×2a_p supercell. For instance, high-resolution synchrotron XRD might allow to resolve the overlapping structural reflexes in our single-crystal XRD maps (Fig. S2 of the Supplemental Material <cit.>) and therewith a full structural refinement might be achievable. Moreover, future STEM studies on crystals after prolonged topotactic reduction can reveal whether our alternating pyramidal/octahedral structure eventually transforms into a square-planar/octahedral structure with a √(5)a_p×a_p×√(2)a_p supercell, which was proposed in Ref. moriga2002reduction for PrNiO_3-δ with δ≈ 0.33. Notably, our observed oxygen vacancy ordering with apex-linked pyramidal units is distinct from all previously identified RNiO_3-δ lattice structures, which contain stacks of alternating square-planar NiO_4 and octahedral NiO_6 sheets. Moreover, to the best of our knowledge, pyramidal coordination was generally not observed in perovskite-derived Ni compounds to date, whereas it is a common lattice motif in various oxygen-deficient transition metal oxides, including Fe <cit.>, Co <cit.>, and Mn <cit.> compounds. In particular, SrFeO_3-δ hosts a variety of oxygen vacancy ordered phases with distinct spin and charge ordered ground states <cit.>. Since a closely similar vacancy ordering pattern as in Fig. 4(e) emerges in SrFeO_3-δ for δ = 0.25 (Sr_4Fe_4O_11), an exploration of potentially emerging magnetic order in Pr_xCa_1-xNiO_2.75 will be of high interest. In summary, we examined the topotactic transformation of a Pr_0.92Ca_0.08NiO_3 single crystal to the oxygen-vacancy ordered Pr_0.92Ca_0.08NiO_2.75 phase. The transformed crystal structure contains a 4a_p×4a_p×2a_p supercell and periodic distortions as well as a zigzag pattern of Pr ions along the [100] and [101] directions, respectively. The ordering of the oxygen vacancies on the apical oxygen sites forms one-dimensional chains of bow-tie dimer units of NiO_5 square pyramids. These square pyramidal chains run in parallel to the [001] direction, connecting with flattened NiO_6 octahedra. Our atomic-scale observation of the systematic lattice distortions and oxygen vacancies underpins an unexpected pyramidal-type brownmillerite-like phase in the nickelates after a topotactic reduction. Our results are instructive for future efforts to gain a comprehensive understanding of the topotactic reduction of rare-earth nickelates and related materials. We thank W. Sigle for fruitful discussions and acknowledge T. Heil for valuable technical support and J. Deuschle for TEM specimen preparation. For the crystal growth, the use of the facilities of the Quantum Materials Department of H. Takagi is gratefully acknowledged. This project has received funding in part from the European Union’s Horizon 2020 research and innovation program under Grant Agreement No. 823717–ESTEEM3. 69 fxundefined [1] ifx#1 fnum [1] #1firstoftwo secondoftwo fx [1] #1firstoftwo secondoftwo noop [0]secondoftwo ref[1]@startlink#1@href href[1]#1@endlink anitize@url [0]` 12`$12`&12`#12`1̂2`_12`%12 startlink[1] endlink[0] rl [1]href #1 @bib@innerbibempty [Khomskii(2014)]khomskii2014transition author author D. Khomskii, https://doi.org/10.1017/CBO9781139096782 title Transition metal compounds (publisher Cambridge University Press, year 2014)NoStop [Torrance et al.(1992)Torrance, Lacorre, Nazzal, Ansaldo, and Niedermayer]torrance1992systematic author author J. B. Torrance, author P. Lacorre, author A. I. Nazzal, author E. J. Ansaldo, and author C. Niedermayer, https://link.aps.org/doi/10.1103/PhysRevB.45.8209 journal journal Phys. Rev. B volume 45, pages 8209 (year 1992)NoStop [Zimmermann et al.(2003)Zimmermann, Schneider, Frello, Andersen, Madsen, Kall, Poulsen, Liang, Dosanjh, and Hardy]Zimmermann2003 author author M. v. Zimmermann, author J. R. Schneider, author T. Frello, author N. H. Andersen, author J. Madsen, author M. Kall, author H. F. Poulsen, author R. Liang, author P. Dosanjh, and author W. N. Hardy, https://doi.org/10.1103/PhysRevB.68.104515 journal journal Phys. Rev. B volume 68, pages 104515 (year 2003)NoStop [Jeong et al.(2013)Jeong, Aetukuri, Graf, Schladt, Samant, and Parkin]jeong2013 author author J. Jeong, author N. Aetukuri, author T. Graf, author T. D. Schladt, author M. G. Samant, and author S. S. Parkin, https://www.science.org/doi/10.1126/science.1230512 journal journal Science volume 339, pages 1402 (year 2013)NoStop [Yao et al.(2017)Yao, Inkinen, and Van Dijken]yao2017 author author L. Yao, author S. Inkinen, and author S. Van Dijken, https://doi.org/10.1038/ncomms14544 journal journal Nat. Commun. volume 8, pages 1 (year 2017)NoStop [Catalan(2008)]catalan2008progress author author G. Catalan, https://doi.org/10.1080/01411590801992463 journal journal Phase Transit. volume 81, pages 729 (year 2008)NoStop [Middey et al.(2016)Middey, Chakhalian, Mahadevan, Freeland, Millis, and Sarma]Middey2016 author author S. Middey, author J. Chakhalian, author P. Mahadevan, author J. Freeland, author A. Millis, and author D. Sarma, https://doi.org/10.1146/annurev-matsci-070115-032057 journal journal Ann. Rev. Mater. Res. volume 46, pages 305 (year 2016)NoStop [Catalano et al.(2018)Catalano, Gibert, Fowlie, Iniguez, Triscone, and Kreisel]catalano2018rare author author S. Catalano, author M. Gibert, author J. Fowlie, author J. Iniguez, author J.-M. Triscone, and author J. Kreisel, https://doi.org/10.1088/1361-6633/aaa37a journal journal Rep. Prog. Phys. volume 81, pages 046501 (year 2018)NoStop [Johnston et al.(2014)Johnston, Mukherjee, Elfimov, Berciu, and Sawatzky]Johnston2014 author author S. Johnston, author A. Mukherjee, author I. Elfimov, author M. Berciu, and author G. A. Sawatzky, https://doi.org/10.1103/PhysRevLett.112.106404 journal journal Phys. Rev. Lett. volume 112, pages 106404 (year 2014)NoStop [Mercy et al.(2017)Mercy, Bieder, Íñiguez, and Ghosez]mercy2017structurally author author A. Mercy, author J. Bieder, author J. Íñiguez, and author P. Ghosez, https://doi.org/10.1038/s41467-017-01811-x journal journal Nat. Commun. volume 8, pages 1 (year 2017)NoStop [Suyolcu et al.(2021)Suyolcu, Fursich, Hepting, Zhong, Lu, Wang, Christiani, Logvenov, Hansmann, Minola, Keimer, van Aken, and Benckiser]suyolcu2021control author author Y. E. Suyolcu, author K. Fursich, author M. Hepting, author Z. Zhong, author Y. Lu, author Y. Wang, author G. Christiani, author G. Logvenov, author P. Hansmann, author M. Minola, author B. Keimer, author P. A. van Aken, and author E. Benckiser, https://link.aps.org/doi/10.1103/PhysRevMaterials.5.045001 journal journal Phys. Rev. Mater. volume 5, pages 045001 (year 2021)NoStop [Lu et al.(2016)Lu, Frano, Bluschke, Hepting, Macke, Strempfer, Wochner, Cristiani, Logvenov, Habermeier, Haverkort, Keimer, and Benckiser]lu2016 author author Y. Lu, author A. Frano, author M. Bluschke, author M. Hepting, author S. Macke, author J. Strempfer, author P. Wochner, author G. Cristiani, author G. Logvenov, author H. U. Habermeier, author M. W. Haverkort, author B. Keimer, and author E. Benckiser, https://doi.org/10.1103/PhysRevB.93.165121 journal journal Phys. Rev. B volume 93, pages 165121 (year 2016)NoStop [Boris et al.(2011)Boris, Matiks, Benckiser, Frano, Popovich, Hinkov, Wochner, Castro-Colin, Detemple, Malik, Bernhard, Prokscha, Suter, Salman, Morenzoni, Cristiani, Habermeier, and Keimer]Boris2011 author author A. V. Boris, author Y. Matiks, author E. Benckiser, author A. Frano, author P. Popovich, author V. Hinkov, author P. Wochner, author M. Castro-Colin, author E. Detemple, author V. K. Malik, author C. Bernhard, author T. Prokscha, author A. Suter, author Z. Salman, author E. Morenzoni, author G. Cristiani, author H.-U. Habermeier, and author B. Keimer, https://doi.org/10.1126/science.1202647 journal journal Science volume 332, pages 937 (year 2011)NoStop [Chakhalian et al.(2011)Chakhalian, Rondinelli, Liu, Gray, Kareev, Moon, Prasai, Cohn, Varela, Tung, Bedzyk, Altendorf, Strigari, Dabrowski, Tjeng, Ryan, and Freeland]Chakhalian2011 author author J. Chakhalian, author J. M. Rondinelli, author J. Liu, author B. A. Gray, author M. Kareev, author E. J. Moon, author N. Prasai, author J. L. Cohn, author M. Varela, author I. C. Tung, author M. J. Bedzyk, author S. G. Altendorf, author F. Strigari, author B. Dabrowski, author L. H. Tjeng, author P. J. Ryan, and author J. W. Freeland, https://doi.org/10.1103/PhysRevLett.107.116805 journal journal Phys. Rev. Lett. volume 107, pages 116805 (year 2011)NoStop [Hepting et al.(2014)Hepting, Minola, Frano, Cristiani, Logvenov, Schierle, Wu, Bluschke, Weschke, Habermeier, Benckiser, Le Tacon, and Keimer]Hepting2014 author author M. Hepting, author M. Minola, author A. Frano, author G. Cristiani, author G. Logvenov, author E. Schierle, author M. Wu, author M. Bluschke, author E. Weschke, author H.-U. Habermeier, author E. Benckiser, author M. Le Tacon, and author B. Keimer, https://doi.org/10.1103/PhysRevLett.113.227206 journal journal Phys. Rev. Lett. volume 113, pages 227206 (year 2014)NoStop [Disa et al.(2015)Disa, Kumah, Malashevich, Chen, Arena, Specht, Ismail-Beigi, Walker, and Ahn]Disa2015 author author A. S. Disa, author D. P. Kumah, author A. Malashevich, author H. Chen, author D. A. Arena, author E. D. Specht, author S. Ismail-Beigi, author F. J. Walker, and author C. H. Ahn, https://doi.org/10.1103/PhysRevLett.114.026801 journal journal Phys. Rev. Lett. volume 114, pages 026801 (year 2015)NoStop [Fabbris et al.(2016)Fabbris, Meyers, Okamoto, Pelliciari, Disa, Huang, Chen, Wu, Chen, Ismail-Beigi, Ahn, Walker, Huang, Schmitt, and Dean]Fabbris2016 author author G. Fabbris, author D. Meyers, author J. Okamoto, author J. Pelliciari, author A. S. Disa, author Y. Huang, author Z.-Y. Chen, author W. B. Wu, author C. T. Chen, author S. Ismail-Beigi, author C. H. Ahn, author F. J. Walker, author D. J. Huang, author T. Schmitt, and author M. P. M. Dean, https://doi.org/10.1103/PhysRevLett.117.147401 journal journal Phys. Rev. Lett. volume 117, pages 147401 (year 2016)NoStop [Hepting et al.(2018)Hepting, Green, Zhong, Bluschke, Suyolcu, Macke, Frano, Catalano, Gibert, Sutarto, He, Cristiani, Logvenov, Wang, van Aken, Hansmann, Le Tacon, Triscone, Sawatzky, Keimer, and Benckiser]Hepting2018 author author M. Hepting, author R. J. Green, author Z. Zhong, author M. Bluschke, author Y. E. Suyolcu, author S. Macke, author A. Frano, author S. Catalano, author M. Gibert, author R. Sutarto, author F. He, author G. Cristiani, author G. Logvenov, author Y. Wang, author P. A. van Aken, author P. Hansmann, author M. Le Tacon, author J.-M. Triscone, author G. A. Sawatzky, author B. Keimer, and author E. Benckiser, https://doi.org/10.1038/s41567-018-0218-5 journal journal Nat. Phys. volume 14, pages 1097 (year 2018)NoStop [Fowlie et al.(2019)Fowlie, Lichtensteiger, Gibert, Meley, Willmott, and Triscone]Fowlie2019 author author J. Fowlie, author C. Lichtensteiger, author M. Gibert, author H. Meley, author P. Willmott, and author J.-M. Triscone, https://doi.org/10.1021/acs.nanolett.9b01772 journal journal Nano Lett. volume 19, pages 4188 (year 2019)NoStop [Li et al.(2022)Li, Ramanathan, and Comin]li2022doping author author J. Li, author S. Ramanathan, and author R. Comin, https://www.frontiersin.org/articles/10.3389/fphy.2022.834882 journal journal Front. Phys. volume 10:834882 (year 2022)NoStop [Li et al.(2019)Li, Lee, Wang, Osada, Crossley, Lee, Cui, Hikita, and Hwang]li2019superconductivity author author D. Li, author K. Lee, author B. Y. Wang, author M. Osada, author S. Crossley, author H. R. Lee, author Y. Cui, author Y. Hikita, and author H. Y. Hwang, https://doi.org/10.1038/s41586-019-1496-5 journal journal Nature volume 572, pages 624 (year 2019)NoStop [Osada et al.(2020)Osada, Wang, Goodge, Lee, Yoon, Sakuma, Li, Miura, Kourkoutis, and Hwang]Osada2020 author author M. Osada, author B. Y. Wang, author B. H. Goodge, author K. Lee, author H. Yoon, author K. Sakuma, author D. Li, author M. Miura, author L. F. Kourkoutis, and author H. Y. Hwang, https://doi.org/10.1021/acs.nanolett.0c01392 journal journal Nano Lett. volume 20, pages 5735 (year 2020)NoStop [Osada et al.(2021)Osada, Wang, Goodge, Harvey, Lee, Li, Kourkoutis, and Hwang]osada2021 author author M. Osada, author B. Y. Wang, author B. H. Goodge, author S. P. Harvey, author K. Lee, author D. Li, author L. F. Kourkoutis, and author H. Y. Hwang, https://doi.org/https://doi.org/10.1002/adma.202104083 journal journal Adv. Mater. volume 33, pages 2104083 (year 2021)NoStop [Wang et al.(2022)Wang, Wang, Hsu, Osada, Lee, Jia, Duffy, Li, Fowlie, Beasley, Devereaux, Fisher, Hussey, and Hwang]Wang2022 author author B. Y. Wang, author T. C. Wang, author Y.-T. Hsu, author M. Osada, author K. Lee, author C. Jia, author C. Duffy, author D. Li, author J. Fowlie, author M. R. Beasley, author T. P. Devereaux, author I. R. Fisher, author N. E. Hussey, and author H. Y. Hwang, @noop title Rare-earth control of the superconducting upper critical field in infinite-layer nickelates (year 2022), https://arxiv.org/abs/2205.15355 arXiv:2205.15355 [cond-mat.supr-con] NoStop [Zeng et al.(2020)Zeng, Tang, Yin, Li, Li, Huang, Hu, Liu, Omar, Jani et al.]zeng2020phase author author S. Zeng, author C. S. Tang, author X. Yin, author C. Li, author M. Li, author Z. Huang, author J. Hu, author W. Liu, author G. J. Omar, author H. Jani, et al., https://link.aps.org/doi/10.1103/PhysRevLett.125.147003 journal journal Phys. Rev. Lett. volume 125, pages 147003 (year 2020)NoStop [Li et al.(2020a)Li, Wang, Lee, Harvey, Osada, Goodge, Kourkoutis, and Hwang]Li20201 author author D. Li, author B. Y. Wang, author K. Lee, author S. P. Harvey, author M. Osada, author B. H. Goodge, author L. F. Kourkoutis, and author H. Y. Hwang, https://doi.org/10.1103/PhysRevLett.125.027001 journal journal Phys. Rev. Lett. volume 125, pages 027001 (year 2020a)NoStop [Zeng et al.(2022)Zeng, Li, Chow, Cao, Zhang, Tang, Yin, Lim, Hu, Yang, and Ariando]zeng2021 author author S. Zeng, author C. Li, author L. E. Chow, author Y. Cao, author Z. Zhang, author C. S. Tang, author X. Yin, author Z. S. Lim, author J. Hu, author P. Yang, and author A. Ariando, https://doi.org/10.1126/sciadv.abl9927 journal journal Sci. Adv. volume 8, pages eabl9927 (year 2022)NoStop [Hepting et al.(2021)Hepting, Dean, and Lee]Hepting2021 author author M. Hepting, author M. P. M. Dean, and author W.-S. Lee, https://www.frontiersin.org/article/10.3389/fphy.2021.808683 journal journal Front. Phys. volume 9:808683 (year 2021)NoStop [Botana and Norman(2020)]botana2020similarities author author A. S. Botana and author M. R. Norman, https://link.aps.org/doi/10.1103/PhysRevX.10.011024 journal journal Phys. Rev. X volume 10, pages 011024 (year 2020)NoStop [Rossi et al.(2021)Rossi, Lu, Nag, Li, Osada, Lee, Wang, Agrestini, Garcia-Fernandez, Kas, Chuang, Shen, Hwang, Moritz, Zhou, Devereaux, and Lee]rossi2021orbital author author M. Rossi, author H. Lu, author A. Nag, author D. Li, author M. Osada, author K. Lee, author B. Y. Wang, author S. Agrestini, author M. Garcia-Fernandez, author J. J. Kas, author Y. D. Chuang, author Z. X. Shen, author H. Y. Hwang, author B. Moritz, author K. J. Zhou, author T. P. Devereaux, and author W. S. Lee, https://link.aps.org/doi/10.1103/PhysRevB.104.L220505 journal journal Phys. Rev. B volume 104, pages L220505 (year 2021)NoStop [Goodge et al.(2021)Goodge, Li, Lee, Osada, Wang, Sawatzky, Hwang, and Kourkoutis]goodge2021doping author author B. H. Goodge, author D. Li, author K. Lee, author M. Osada, author B. Y. Wang, author G. A. Sawatzky, author H. Y. Hwang, and author L. F. Kourkoutis, https://doi.org/10.1073/pnas.2007683118 journal journal Proc. Natl. Acad. Sci. volume 118, pages e2007683118 (year 2021)NoStop [Gu et al.(2020)Gu, Li, Wan, Li, Guo, Yang, Li, Zhu, Pan, Nie et al.]gu2020single author author Q. Gu, author Y. Li, author S. Wan, author H. Li, author W. Guo, author H. Yang, author Q. Li, author X. Zhu, author X. Pan, author Y. Nie, et al., https://doi.org/10.1038/s41467-020-19908-1 journal journal Nat. Commun. volume 11, pages 1 (year 2020)NoStop [Been et al.(2021)Been, Lee, Hwang, Cui, Zaanen, Devereaux, Moritz, and Jia]been2021electronic author author E. Been, author W.-S. Lee, author H. Y. Hwang, author Y. Cui, author J. Zaanen, author T. Devereaux, author B. Moritz, and author C. Jia, https://link.aps.org/doi/10.1103/PhysRevX.11.011050 journal journal Phys. Rev. X volume 11, pages 011050 (year 2021)NoStop [Li et al.(2020b)Li, He, Si, Zhu, Zhang, and Wen]Li2020powder author author Q. Li, author C. He, author J. Si, author X. Zhu, author Y. Zhang, and author H.-H. Wen, https://doi.org/10.1038/s43246-020-0018-1 journal journal Commun. Mater. volume 1, pages 16 (year 2020b)NoStop [Wang et al.(2020)Wang, Zheng, Krivyakina, Chmaissem, Lopes, Lynn, Gallington, Ren, Rosenkranz, Mitchell, and Phelan]Wang2020powder author author B.-X. Wang, author H. Zheng, author E. Krivyakina, author O. Chmaissem, author P. P. Lopes, author J. W. Lynn, author L. C. Gallington, author Y. Ren, author S. Rosenkranz, author J. F. Mitchell, and author D. Phelan, https://doi.org/10.1103/PhysRevMaterials.4.084409 journal journal Phys. Rev. Mater. volume 4, pages 084409 (year 2020)NoStop [Puphal et al.(2021)Puphal, Wu, Fuersich, Lee, Pakdaman, Bruin, Nuss, Suyolcu, van Aken, Keimer et al.]puphal2021 author author P. Puphal, author Y.-M. Wu, author K. Fuersich, author H. Lee, author M. Pakdaman, author J. A. Bruin, author J. Nuss, author Y. E. Suyolcu, author P. A. van Aken, author B. Keimer, et al., https://www.science.org/doi/10.1126/sciadv.abl8091 journal journal Sci. Adv. volume 7, pages eabl8091 (year 2021)NoStop [Puphal et al.(2023)Puphal, Wehinger, Nuss, Küster, Starke, Garbarino, Keimer, Isobe, and Hepting]Puphal2022b author author P. Puphal, author B. Wehinger, author J. Nuss, author K. Küster, author U. Starke, author G. Garbarino, author B. Keimer, author M. Isobe, and author M. Hepting, https://link.aps.org/doi/10.1103/PhysRevMaterials.7.014804 journal journal Phys. Rev. Mater. volume 7, pages 014804 (year 2023)NoStop [Alonso et al.(1997)Alonso, Martínez-Lope, García-Muñoz, and Fernández-Díaz]alonso1997structural author author J. A. Alonso, author M. J. Martínez-Lope, author J. L. García-Muñoz, and author M. T. Fernández-Díaz, https://iopscience.iop.org/article/10.1088/0953-8984/9/30/010 journal journal J. Phys.: Condens. Matter volume 9, pages 6417 (year 1997)NoStop [Sanchez et al.(1996)Sanchez, Causa, Caneiro, Butera, Vallet-Regi, Sayagués, González-Calbet, Garcia-Sanz, and Rivas]sanchez1996metal author author R. D. Sanchez, author M. T. Causa, author A. Caneiro, author A. Butera, author M. Vallet-Regi, author M. J. Sayagués, author J. González-Calbet, author F. Garcia-Sanz, and author J. Rivas, https://link.aps.org/doi/10.1103/PhysRevB.54.16574 journal journal Phys. Rev. B volume 54, pages 16574 (year 1996)NoStop [Abbate et al.(2002)Abbate, Zampieri, Prado, Caneiro, Gonzalez-Calbet, and Vallet-Regi]abbate2002electronic author author M. Abbate, author G. Zampieri, author F. Prado, author A. Caneiro, author J. M. Gonzalez-Calbet, and author M. Vallet-Regi, https://link.aps.org/doi/10.1103/PhysRevB.65.155101 journal journal Phys. Rev. B volume 65, pages 155101 (year 2002)NoStop [Malashevich and Ismail-Beigi(2015)]malashevich2015first author author A. Malashevich and author S. Ismail-Beigi, https://link.aps.org/doi/10.1103/PhysRevB.92.144102 journal journal Phys. Rev. B volume 92, pages 144102 (year 2015)NoStop [Misra and Kundu(2016a)]misra2016transport author author D. Misra and author T. K. Kundu, https://iopscience.iop.org/article/10.1088/2053-1591/3/9/095701 journal journal Mater. Res. Express volume 3, pages 095701 (year 2016a)NoStop [Nguyen et al.(2020)Nguyen, Bach, and Morikawa]Nguyen2020 author author H. D. Nguyen, author C. T. Bach, and author Y. Morikawa, https://doi.org/10.1103/PhysRevB.102.165411 journal journal Phys. Rev. B volume 102, pages 165411 (year 2020)NoStop [Shin and Rondinelli(2022)]shin2022magnetic author author Y. Shin and author J. M. Rondinelli, https://link.aps.org/doi/10.1103/PhysRevResearch.4.L022069 journal journal Phys. Rev. Research volume 4, pages L022069 (year 2022)NoStop [Wang et al.(2018)Wang, Rosenkranz, Rui, Zhang, Ye, Zheng, Klie, Mitchell, and Phelan]wang2018antiferromagnetic author author B.-X. Wang, author S. Rosenkranz, author X. Rui, author J. Zhang, author F. Ye, author H. Zheng, author R. F. Klie, author J. F. Mitchell, and author D. Phelan, https://link.aps.org/doi/10.1103/PhysRevMaterials.2.064404 journal journal Phys. Rev. Mater. volume 2, pages 064404 (year 2018)NoStop [Liao et al.(2021)Liao, Singh, and Park]liao2021oxygen author author X. Liao, author V. Singh, and author H. Park, https://link.aps.org/doi/10.1103/PhysRevB.103.085110 journal journal Phys. Rev. B volume 103, pages 085110 (year 2021)NoStop [Misra and Kundu(2016b)]misra2016oxygen author author D. Misra and author T. K. Kundu, https://doi.org/10.1140/epjb/e2015-60714-0 journal journal Eur. Phys. J. B volume 89, pages 1 (year 2016b)NoStop [Gonzalez-Calbet et al.(1989)Gonzalez-Calbet, Sayagues, and Vallet-Regi]Gonzales1989 author author J. Gonzalez-Calbet, author M. Sayagues, and author M. Vallet-Regi, https://doi.org/https://doi.org/10.1016/0167-2738(89)90350-0 journal journal Solid State Ion. volume 32-33, pages 721 (year 1989)NoStop [Moriga et al.(1994)Moriga, Usaka, Nakabayashi, Hirashima, Kohno, Kikkawa, and Kanamaru]moriga1994reduction author author T. Moriga, author O. Usaka, author I. Nakabayashi, author Y. Hirashima, author T. Kohno, author S. Kikkawa, and author F. Kanamaru, https://doi.org/10.1016/0167-2738(94)90212-7 journal journal Solid State Ion. volume 74, pages 211 (year 1994)NoStop [Moriga et al.(2002)Moriga, Hayashi, Sakamoto, Orihara, and Nakabayashi]moriga2002reduction author author T. Moriga, author M. Hayashi, author T. Sakamoto, author M. Orihara, and author I. Nakabayashi, https://doi.org/10.1016/S0167-2738(02)00440-X journal journal Solid State Ion. volume 154, pages 251 (year 2002)NoStop [sup()]supp @noop note See Supplemental Material at http://link.aps.org/supplemental/10.1103/PhysRevMaterials.7.053609http://link.aps.org/supplemental/10.1103/PhysRevMaterials.7.053609 for additional structural characterizationNoStop [Koch(2002)]koch2002determination author author C. T. Koch, title Determination of core structure periodicity and point defect density along dislocations, https://www.proquest.com/dissertations-theses/determination-core-structure-periodicity-point/docview/304796129/se-2 Ph.D. thesis, school Arizona State University (year 2002)NoStop [García-Munoz et al.(1992)García-Munoz, Rodríguez-Carvajal, Lacorre, and Torrance]garcia1992neutron author author J. L. García-Munoz, author J. Rodríguez-Carvajal, author P. Lacorre, and author J. B. Torrance, https://link.aps.org/doi/10.1103/PhysRevB.46.4414 journal journal Phys. Rev. B volume 46, pages 4414 (year 1992)NoStop [Zheng et al.(2019)Zheng, Zhang, Wang, Phelan, Krogstad, Ren, Phelan, Chmaissem, Poudel, and Mitchell]zheng2019high author author H. Zheng, author J. Zhang, author B. Wang, author D. Phelan, author M. J. Krogstad, author Y. Ren, author W. A. Phelan, author O. Chmaissem, author B. Poudel, and author J. F. Mitchell, https://doi.org/10.3390/cryst9070324 journal journal Crystals volume 9, pages 324 (year 2019)NoStop [Wang(1994)]WANG1994 author author Z. Wang, https://doi.org/https://doi.org/10.1016/0304-3991(94)90106-6 journal journal Ultramicroscopy volume 53, pages 73 (year 1994)NoStop [Alonso and Martínez-Lope(1995)]alonso1995preparation author author J. A. Alonso and author M. J. Martínez-Lope, https://doi.org/10.1039/DT9950002819 journal journal J. Chem. Soc., Dalton Trans. , pages 2819 (year 1995)NoStop [Treacy et al.(1978)Treacy, Howie, and Wilson]treacy1978z author author M. M. J. Treacy, author A. Howie, and author C. J. Wilson, https://doi.org/10.1080/01418617808239255 journal journal Philos.Mag. A volume 38, pages 569 (year 1978)NoStop [Pennycook and Boatner(1988)]pennycook1988chemically author author S. J. Pennycook and author L. A. Boatner, https://doi.org/10.1038/336565a0 journal journal Nature volume 336, pages 565 (year 1988)NoStop [Waroquiers et al.(2017)Waroquiers, Gonze, Rignanese, Welker-Nieuwoudt, Rosowski, Göbel, Schenk, Degelmann, André, Glaum et al.]waroquiers2017statistical author author D. Waroquiers, author X. Gonze, author G.-M. Rignanese, author C. Welker-Nieuwoudt, author F. Rosowski, author M. Göbel, author S. Schenk, author P. Degelmann, author R. André, author R. Glaum, et al.https://pubs.acs.org/doi/10.1021/acs.chemmater.7b02766 journal journal Chem. Mater. volume 29, pages 8346 (year 2017)NoStop [Manthiram et al.(1999)Manthiram, Tang, and Manivannan]manthiram1999factors author author A. Manthiram, author J. P. Tang, and author V. Manivannan, https://doi.org/10.1006/jssc.1999.8487 journal journal J. Solid State Chem. volume 148, pages 499 (year 1999)NoStop [Huang et al.(2021)Huang, Chen, Cabral, Wang, Zhang, Li, Li, Ringer, Luo, Mai et al.]huang2021 author author Q. Huang, author Z. Chen, author M. J. Cabral, author F. Wang, author S. Zhang, author F. Li, author Y. Li, author S. P. Ringer, author H. Luo, author Y.-W. Mai, et al., https://doi.org/10.1038/s41467-021-22355-1 journal journal Nat. Commun. volume 12, pages 2095 (year 2021)NoStop [Kim et al.(2023)Kim, Smeaton, Jia, Goodge, Cho, Lee, Osada, Jost, Ievlev, Moritz et al.]kim2023geometric author author W. J. Kim, author M. A. Smeaton, author C. Jia, author B. H. Goodge, author B.-G. Cho, author K. Lee, author M. Osada, author D. Jost, author A. V. Ievlev, author B. Moritz, et al., https://doi.org/10.1038/s41586-022-05681-2 journal journal Nature , pages 1 (year 2023)NoStop [Takeda et al.(1986)Takeda, Kanno, Takada, Yamamoto, Takano, Nakayama, and Bando]TAKEDA1986237 author author Y. Takeda, author K. Kanno, author T. Takada, author O. Yamamoto, author M. Takano, author N. Nakayama, and author Y. Bando, https://doi.org/10.1016/0022-4596(86)90174-X journal journal J. Solid State Chem. volume 63, pages 237 (year 1986)NoStop [Takano et al.(1988)Takano, Okita, Nakayama, Bando, Takeda, Yamamoto, and Goodenough]TAKANO1988140 author author M. Takano, author T. Okita, author N. Nakayama, author Y. Bando, author Y. Takeda, author O. Yamamoto, and author J. Goodenough, https://doi.org/10.1016/0022-4596(88)90063-1 journal journal J. Solid State Chem. volume 73, pages 140 (year 1988)NoStop [Vidyasagar et al.(1984)Vidyasagar, Gopalakrishnan, and Rao]vidyasagar1984 author author K. Vidyasagar, author J. Gopalakrishnan, and author C. N. R. Rao, https://pubs.acs.org/doi/10.1021/ic00177a008 journal journal Inorg. Chem. volume 23, pages 1206 (year 1984)NoStop [Poeppelmeier et al.(1982a)Poeppelmeier, Leonowicz, Scanlon, Longo, and Yelon]POEPPELMEIER198271 author author K. R. Poeppelmeier, author M. E. Leonowicz, author J. C. Scanlon, author J. M. Longo, and author W. B. Yelon, https://doi.org/https://doi.org/10.1016/0022-4596(82)90292-4 journal journal J. Solid State Chem. volume 45, pages 71 (year 1982a)NoStop [Poeppelmeier et al.(1982b)Poeppelmeier, Leonowicz, and Longo]POEPPELMEIER198289 author author K. R. Poeppelmeier, author M. E. Leonowicz, and author J. M. Longo, https://doi.org/https://doi.org/10.1016/0022-4596(82)90404-2 journal journal J. Solid State Chem. volume 44, pages 89 (year 1982b)NoStop [Vidya et al.(2006)Vidya, Ravindran, Fjellvåg, and Kjekshus]vidya2006spin author author R. Vidya, author P. Ravindran, author H. Fjellvåg, and author A. Kjekshus, https://link.aps.org/doi/10.1103/PhysRevB.74.054422 journal journal Phys. Rev. B volume 74, pages 054422 (year 2006)NoStop [Reehuis et al.(2012)Reehuis, Ulrich, Maljuk, Niedermayer, Ouladdiaf, Hoser, Hofmann, and Keimer]reehuis2012neutron author author M. Reehuis, author C. Ulrich, author A. Maljuk, author C. Niedermayer, author B. Ouladdiaf, author A. Hoser, author T. Hofmann, and author B. Keimer, https://link.aps.org/doi/10.1103/PhysRevB.85.184109 journal journal Phys. Rev. B volume 85, pages 184109 (year 2012)NoStop
http://arxiv.org/abs/2306.07782v1	20230613140428	Gravitational quasinormal mode in internal and external region of black hole by using improved matrix method	[ "Kai Lin" ]	gr-qc	[ "gr-qc" ]
http://arxiv.org/abs/2306.04538v3	20230607154414	Evaluation of ChatGPT and Microsoft Bing AI Chat Performances on Physics Exams of Vietnamese National High School Graduation Examination	[ "Dao Xuan-Quy", "Le Ngoc-Bich", "Phan Xuan-Dung", "Ngo Bac-Bien", "Vo The-Duy" ]	physics.ed-ph	[ "physics.ed-ph" ]	Evaluation of ChatGPT and Microsoft Bing AI Chat Performances on Physics Exams of Vietnamese National High School Graduation Examination Xuan-Quy Dao School of Engineering Eastern International University Binh Duong, Vietnam [email protected] Ngoc-Bich Le School of Biomedical Engineering International University Vietnam, National University HCM City HMC City, Vietnam [email protected] Xuan-Dung Phan School of Engineering Eastern International University Binh Duong, Vietnam [email protected] Bac-Bien Ngo School of Engineering Eastern International University Binh Duong, Vietnam [email protected] The-Duy Vo School of Engineering Eastern International University Binh Duong, Vietnam [email protected] ==================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================== The promise and difficulties of language model-based approaches for physics teaching were assessed in this study. This study evaluates how well ChatGPT and BingChat, two state-of-the-art (SOTA) large language models (LLMs), perform when answering high school physics questions on Vietnamese exams from 2019 to 2023. When we compared the results of the LLMs with the scores of Vietnamese students, we discovered that ChatGPT and BingChat both perform worse than Vietnamese students, proving that LLMs are not yet capable of fully replacing human intellect in the field of physics teaching. The outcomes also showed that neither LLM is capable of responding to questions at the high application levels. In terms of accuracy, BingChat typically surpassed ChatGPT, although ChatGPT showed more stability. Our research suggests that LLMs can help students and teachers during learning and teaching activities, particularly by offering immediate feedback and individualized learning experiences ChatGPT, BingChat, large language models, physics education, performance evaluation § INTRODUCTION Artificial intelligence (AI) integration into educational settings has grown in popularity in recent years with the goal of strengthening student learning and teaching methods. Automating repetitive tasks, offering real-time feedback and assessment, and personalizing learning experiences are all capabilities of AI-powered educational systems. In a study on the effects of AI on education, Chen et al. <cit.> concentrated on the use of AI in administration, instruction, and learning to allow instructors to perform administrative functions more effectively and customize content based on students' needs, thereby improving the overall quality of learning. Furthermore, Dao et al. <cit.> discussed the use of AI in education to reduce workload and enhance learner engagement in online learning. Their approach involves using text-to-speech and speech-driven-face technology to automatically create a video lecture with the instructor's voice and face, eliminating the need for recording video and allowing for easy modification. In addition, Nguyen et al. <cit.> proposed an online learning platform that incorporates a Vietnamese virtual assistant to assist instructors in presenting lessons and assessing learners. The platform delivers lesson content through slides combined with a synthesized voice and the instructor's face, which enables easy editing without the need for video recording. LLMs is a technology to create chatbots applied to education. LLMs models have demonstrated great potential in several applications, including language translation, content creation, and education. In 2018, Google introduced BERT <cit.> a pre-trained model that utilizes the Transformer architecture and has achieved impressive results in various natural language processing (NLP) tasks by being trained on an extensive corpus of text. RoBERTa <cit.>, introduced by Facebook in 2019, is an extension of BERT that uses a similar architecture but is trained on a larger corpus of text with longer sequences and more iterations. Another large language model, T5 <cit.>, was introduced by Google researchers in 2019. T5 employs a unified text-to-text approach, converting all tasks to text-to-text format and training them in a single model. OpenAI's GPT-3 <cit.>, released in 2020, can perform various NLP tasks with minimal examples, earning recognition for its impressive performance. To train, test and evaluate LLMs models, we need datasets. Several physics datasets evaluate the physics ability of LLMs. AI2 Reasoning Challenge–Physics dataset <cit.>, a multiple-choice question-answering dataset including questions from grade 3 to grade 9 science exams, a supporting knowledge base of 14.3M unstructured text passages. PhysNet Dataset <cit.> was designed for predicting energies, forces, and dipole moments of chemical systems using deep neural networks. ScienceQA <cit.> has richer domain diversity than previous datasets, covering natural science, language science, and social science. ScienceQA features 26 topics, 127 categories, and 379 skills, categorizing questions by topic, category, and skill. These datasets challenge LLMs to demonstrate their physics ability. LLMs' potential and difficulties in education are becoming more and more clear as they advance. However, it is essential to carry out thorough assessments of their capabilities, particularly in the area of high school physics, in order to successfully integrate these models into education, particularly in Vietnam where Vietnamese is the primary language. Despite this, there hasn't been any research on the subject, and there aren't many datasets that can be used to evaluate LLMs in high school physics. To bridge this gap, we have created the VNHSGE dataset <cit.>, which contains data from the Vietnamese National High School Graduation Examination covering nine subjects, including physics. The dataset contains 19K multiple-choice questions and 300 essays on literature, featuring both text and images, and is available in JSON and Word formats. In this paper, we focus on evaluating LLMs capacities on physic exams. The current study makes a number of contributions, including (1) a thorough evaluation of the performance of two SOTA-LLMs, ChatGPT and BingChat, in the context of high school physics education in Vietnam; (2) a comparison analysis of ChatGPT and BingChat's performance compared to Vietnamese students; and (3) an extensive investigation of the benefits and drawbacks of utilizing LLMs in the field of physics education in Vietnam. § RELATED WORKS §.§ Large Language Models Based on GPT-3.5, OpenAI trained the very sophisticated big language model known as ChatGPT using a sizable corpus of text data. It has the potential to be employed in many educational applications and can produce human-like replies to input in natural language. It might be used, for instance, to create intelligent tutoring programs that offer individualized feedback, automate grading, and offer assessment. Additionally, ChatGPT could develop interesting educational materials on a variety of subjects to supplement already-existing teaching resources or even develop entirely new courses. On the other hand, Microsoft's BingChat is a chatbot function of the Bing search engine. It has the potential to be a great educational tool because it can provide correct facts and content like stories and poems. By locating pertinent material and instructional resources, as well as producing content that can be incorporated into lesson plans, BingChat has the capacity to assist students with their homework and teachers with lesson preparation. Because of this, BingChat is a useful tool for both educators and students. §.§ Evaluation of LLMs on Physics LLMs have great natural language understanding skills because of their extensive training with large amounts of data. They are therefore the best candidates for meeting academic and professional standards. Lehnert et al. <cit.> explored the abilities of ChatGPT to explain and explore theoretical physics concepts. ChatGPT is good at explaining ideas in different ways, but ChatGPT still has some limitations in physics because it can also confidently give out false information and statements. However, ChatGPT can help advance theoretical physics. Similarly, Kortemeyer et al. <cit.> studied ChatGPT's ability to pass an introductory physics course. ChatGPT almost passed despite numerous suppositions and errors. This highlights the importance of exercising caution and calls into question the reliability of AI-generated answers. In another study, West et al. <cit.> analyzed the performance of ChatGPT-3.5 and ChatGPT-4 in first-semester university physics using a modified version of the FCI. They discovered that, despite having inconsistent performance, ChatGPT-3.5 can match or outperform the median performance of a university student. The performance of ChatGPT-4 on topics pertaining to fundamental mechanics is comparable to that of a professional physicist. The study by Kuchemann et al. <cit.> explored the potential of using ChatGPT 3.5 for physics task development by prospective teachers. In a randomized controlled trial with 26 physics teacher students, text-based physics activities for high school students were created using ChatGPT 3.5 in one group and a textbook in the other. Despite not finding a difference in task correctness between the two groups, the study did find that the textbook group had more clarity and better contextualization. The study emphasizes the benefits and drawbacks of utilizing extensive language models in instruction. Yeadon et al. <cit.> presented evidence of AI-generated short-form physics essays achieving first-class grades in an accredited university physics module. The study discovered that 50 AI responses produced submissions with an average grade of 71% on an essay writing evaluation, in strong accord with the existing module average, using NLP AI such as ChatGPT and davinci-003. The study contends that the efficacy of short-form essays as an assessment tool in physics courses is seriously threatened by the most recent AI language models. The AI-generated essays had a low plagiarism score, proving they were original, according to plagiarism detection software. According to the GPT-4 Report by OpenAI <cit.>, ChatGPT-3.5 has an accuracy range of 33 to 66% on the AP Physics dataset. This indicates that although ChatGPT has the potential to transform education, further efforts are necessary to enhance its precision in specific fields like Physics. § DATASET We use VNHSGE dataset <cit.>, were taken from real exams and illustrative examples that were given from 2019 to 2023. It was compiled from information gathered from teachers, high schools, and the Vietnamese Ministry of Education and Training, among other places. §.§ Physics Testing of Vietnamese High School Graduation Examinations In Vietnam, the natural sciences combination includes the physics graduation exam, which is a significant component of the high school graduating test. For this test, students have 50 minutes to respond to 40 questions. §.§ Question Levels VNHSGE dataset contains a range of questions that assess various levels of complexity, from fundamental knowledge to challenging tasks that demand information processing and synthesis. In order to give a thorough assessment of students' proficiency and expertise, the questions were then divided into four difficulty levels: "knowledge (easy)","comprehension (intermediate)","application (difficult)", and "high application (very difficult). This classification strategy offers a thorough assessment of the LLMs' advantages and disadvantages in dealing with various problem types in physics. §.§ Question Topics A dataset for physics was used in this study that included 2000 multiple-choice questions divided into 50 sets of test questions. The questions include a wide range of physics topics, such as atomic nucleus, mechanical oscillations, mechanical waves, alternating current, electromagnetic oscillations and waves, light waves, quantum of light, electric charge and field, direct current, electromagnetic induction, and light refraction. These inquiries serve as a thorough evaluation of fundamental physics concepts and a test of students' comprehension. §.§ Score spectrum of Vietnamese students in 2019-2022 A score distribution is a visual representation of how applicants performed in a specific subject. Scores are often shown on one axis of the chart, along with the number of applicants who received that score on the other axis. The analysis of the 2022 national high school graduation exam results in Physics, as shown in Fig. <ref>, revealed that 325,525 candidates took the Physics exam, with an average score of 6.72 points and the most attained score was 7.25 points. The score distribution, which is published annually by the Vietnamese Ministry of Education in chart form for each subject, is used to assess candidates' proficiency and ability, as well as to evaluate them based on predetermined criteria. The distribution is also used to assess and classify test papers according to difficulty level, allowing for the evaluation of candidates' quality. We collected score distributions from 2019 to 2022 to compare the performance of LLMs with that of Vietnamese students, providing insight into the capabilities of LLMs. §.§ VNHSGE dataset WORD format: The VNHSGE dataset is designed to be compatible with language models such as BERT and GPT, which require formulas, equations, and figures to be converted into text format. The dataset includes a WORD file in text format that can be easily evaluated by non-programmers. However, symbols, tables, and images are also converted into text format. The VNHSGE dataset is suitable for full language models like ChatGPT and BingChat. JSON format: The JSON format is a fantastic choice for LLMs input data since it effectively handles both the syntax and substance of text data. Due to its adaptability and expansion, this format can store a variety of text data, including equations, formulas, tables, and images. The JSON format is a great fit for the VNHSGE dataset, making it compatible with a wide range of LLMs and offering a base for the creation of more reliable language models. Samples: We will now present a set of questions that was translated from Vietnamese into English using ChatGPT and BingChat. Nonetheless, it is important to acknowledge that in certain instances, both models, particularly BingChat, may respond to Vietnamese questions in English. §.§.§ Knowledge level question The first kind of question is at the knowledge level, and the solution can be determined without using any reasoning. [linewidth=1pt,linecolor=red] Câu hỏi: Đặt điện áp xoay chiều có giá trị hiệu dụng U vào hai đầu một đoạn mạch chỉ có cuộn cảm thuần thì cảm kháng của đoạn mạch là Z_L. Cường độ dòng điện hiệu dụng I trong đoạn mạch được tính bằng công thức nào sau đây? Question: What is the formula for calculating the effective current I in a circuit consisting of a pure inductor with inductance Z_L when an AC voltage with an effective value U is applied across the two ends of the circuit? A. I=2UZ_L B. I=2U/Z_L C. I=U/Z_L D. I=UZ_L §.§.§ Comprehension level question The following question requires a modest amount of inference to answer because it is at the comprehension level. [linewidth=1pt,linecolor=red] Câu hỏi: Hai dao động điều hòa cùng tần số có pha ban đầu là φ_1 và φ_2. Hai dao động này cùng pha khi Question: Two harmonic oscillations with the same frequency and initial phases of φ_1 and φ_2. These oscillations are in phase when A. φ_2-φ_1=(2n+1)π with n=±0,±1,±2,…. B. φ_2-φ_1=2nπ with n=±0,±1,±2,…. C. φ_2-φ_1=(2n+1/5)π with n=±0,±1,±2,…. D. φ_2-φ_1=(2n+1/3)π with n=±0,±1,±2,…. §.§.§ Application level question The answer to the following question, which is at the application level, involves inference. [linewidth=1pt,linecolor=red] Câu hỏi: Trong thí nghiệm Y-âng về giao thoa ánh sáng, hai khe cách nhau 0.5 mm, màn quan sát cách mặt phẳng chứa hai khe một khoảng D và có thể thay đổi được. Chiếu sáng hai khe bằng ánh sáng đơn sắc có bước sóng λ (380 nm ≤λ≤ 640 nm). M và N là hai điểm trên màn cách vị trí vân sáng trung tâm lần lượt là 6.4 mm và 9.6 mm. Ban đầu, khi D = D_1 = 0.8 m thì tại M và N là vị trí của các vân sáng. Khi D = D_2 = 1.6 m thì một trong hai vị trí của M và N là vị trí của vân tối. Tịnh tiến màn từ từ dọc theo phương vuông góc với mặt phẳng chứa hai khe và ra xa hai khe từ vị trí cách hai khe một đoạn D_1 đến vị trí cách hai khe một đoạn D_2. Troạng quá trình dịch chuyển màn, sồ lần tại N là vị trí của vân sáng (không tính thời điểm ban đầu) là Question: In the Young's double-slit experiment on light interference, two slits are separated by 0.5 mm, and the observation screen is at a distance D which can be varied from the plane containing the two slits. The two slits are illuminated by monochromatic light with a wavelength of λ (380 nm ≤λ≤ 640 nm). M and N are two points on the screen located at a distance of 6.4 mm and 9.6 mm, respectively, from the central bright fringe when D = D_1 = 0.8 m. When D = D_2 = 1.6 m, one of the positions of M and N is the position of a dark fringe. The screen is moved slowly along a direction perpendicular to the plane containing the two slits and away from the slits by a distance from D_1 to D_2. During this displacement, the number of times that N is the position of a bright fringe (excluding the initial position) is A. 4 B. 3 C. 5 D. 7 §.§.§ High application level question Last but not least, in order to answer the question at the high application level, extensive reasoning is needed. [linewidth=1pt,linecolor=red] Câu hỏi: Đặt điện áp u=120cos(100π t-π/6)(V) vào hai đầu đoạn mạch AB mắc nối tiếp gồm: tụ điện có điện dung C thay đổi được; cuộn dây có độ tự cảm L và điện trở r ; điện trở R với R = 2r như hình bên. < g r a p h i c s > Khi C = C_0 thì điện áp hiệu dụng giữa hai đầu đoạn mạch AN đạt cực tiểu. Khi C =C_0/4 thì điện áp hiệu dụng giữa hai đầu đoạn mạch AM đạt cực đại và điện áp giữa hai đầu đoạn mạch MN là u_MN. Biểu thức u_MN là Question: Applying a voltage u=120cos(100π t-π/6)(V) to the two ends of circuit AB in series. The capacitor C can be varied, and the circuit also includes an inductor with self-inductance L, a resistor with resistance r, and a resistor R with R = 2r as shown in the figure. < g r a p h i c s > When C = C_0, the RMS voltage between the two ends of the AN segment reaches its minimum value. When C =C_0/4, the RMS voltage between the two ends of the AM segment reaches its maximum value and the voltage between the two ends of the MN segment is u_MN. The expression for u_MN is: A. u_MN=40cos(100π t+2π/2)(V) B. u_MN=40√(3)cos(100π t+2π/2)(V) C. u_MN=40√(3)cos(100π t+2π/2)(V) D. u_MN= 40cos(100π t+π/2)(V) § EXPERIMENTS We evaluated a evaluation set of VNHSGE dataset (Vietnamese version) <cit.> comprised of five illustrative exams (200 multiple-choice questions) offered by the Vietnamese Ministry of Education and Training for the years 2019–2023. The evaluation findings for ChatGPT (Feb 13 version) and BingChat (April 15 version) on this subdataset are presented in this section. §.§ ChatGPT and BingChat Responses This section introduces ChatGPT and BingChat's reactions to the earlier samples. §.§.§ Knowledge level question First, both ChatGPT and BingChat easily solve the knowledge question. The answer is only a formula. [linewidth=1pt,linecolor=red] Lời giải: Trong mạch chỉ có cuộn cảm thuần cho cảm kháng là Z_L thì cường độ dòng điện trong mạch là: I=U/Z_L. Chọn C. Solution: The formula for calculating the effective current I in a circuit is I=U/Z_L. Choose C. ChatGPT: Đáp án là: C. I = U/ZL. Giải thích: Trong đoạn mạch chỉ có cuộn cảm thuần thì cảm kháng ZL được tính bằng công thức ZL = ω L, trong đó ω là tần số góc của điện áp xoay chiều. Cường độ dòng điện hiệu dụng I trong đoạn mạch được tính bằng công thức I = U/ZL, trong đó U là giá trị hiệu dụng của điện áp xoay chiều. C. I = U/Z_L. In a circuit with only a pure inductor, the inductive reactance ZL is calculated by the formula ZL = ω L, where ω is the angular frequency of the AC voltage. The root-mean-square (RMS) current I in the circuit is calculated by the formula I = U/Z_L, where U is the RMS value of the AC voltage. BingChat: Cường độ dòng điện hiệu dụng I trong một đoạn mạch có cảm kháng ZL và điện áp hiệu dụng U được tính bằng công thức I = U/Z_L. Vì vậy, đáp án đúng là C. I = U/Z_L. The effective current intensity I in a circuit segment with inductive impedance ZL and effective voltage U is calculated using the formula I=U/Z_L. Therefore, the correct answer is C. I=U/Z_L. §.§.§ Comprehension level question The next case shows that ChatGPT and BingChat find the correct answer although the answer requires reasoning to find the correct answer. [linewidth=1pt,linecolor=red] Lời giải: Hai dao động cùng pha thì φ_2-φ_1=2nπ với n=±0,±1,±2,…. Chọn B. Solution: These oscillations are in phase when φ_2-φ_1=2nπ with n=±0,±1,±2,…. Choose B. ChatGPT: Đáp án là: B. φ_1-φ_2=2n for k=±0,±1,±2,…. Giải thích: Hai dao động điều hòa cùng tần số Acos(ω t+φ_1) và Bcos(ω t+φ_2) sẽ cùng pha khi chúng đạt giá trị cực đại hoặc giá trị cực tiểu đồng thời. Vì vậy, để hai dao động cùng pha, phải có điều kiện: ω t+φ_1=ω t+φ_2+2n Tương đương với: φ_1-φ_2=2n π Do đó, đáp án là B. B. φ_1-φ_2=2n for k=±0,±1,±2,…. Two harmonic oscillators with the same frequency Acos(ω t+φ_1) and Bcos(ω t+φ_2) will be in phase when they reach their maximum or minimum values at the same time. Therefore, in order for the two oscillators to be in phase, the following condition must be met: ω t+φ_1=ω t+φ_2+2n. Equivalently: φ_1-φ_2=2n π. Hence, the answer is B. BingChat: Hai dao động điều hòa cùng tần số có pha ban đầu là φ_1 và φ_2 cùng pha khi hiệu pha ban đầu của chúng là bội số của 2π. Vì vậy, φ_1 - φ_2 = 2nπ với n là số nguyên. Đáp án đúng là B. φ_1 - φ_2 = 2nπ với n=±0,±1,±2,… Two harmonic oscillations of the same frequency with initial phases of φ_1 and φ_2 are in phase when the initial phase difference between them is a multiple of 2π. Therefore, φ_1-φ_2=2n π with n being an integer. The correct answer is B. φ_1-φ_2=2n π with n=±0,±1,±2,… §.§.§ Application level question Both ChatGPT and BingChat were unable to come up with an answer for the application-level question, which necessitates comprehensive knowledge for determining the right response. The question requires multiple steps in reasoning to find the correct answer. Neither ChatGPT nor BingChat can provide a reasonable solution. [linewidth=1pt,linecolor=red] Lời giải: Khi D=D_1, khoảng vân giao thoa là: i_1=λ D_1/a Tại M và N ta có: k_N/k_M=x_N/x_M=9,6/6,4=3/2 ⇒{[ k_N=3 p; k_M=2 p ]. Lại có: x=k_1 i_1 Khi D=D_2, khoảng vân là: i_2=λ D_2/a=λ· 2 D_1/a=2 i_1 Tại một vị trí cho vân tối, ta có: x=k_2 i_2=k_1 i_1 ⇒ k_2 · 2 i_1=k_1 i_1 ⇒ k_1=2 k_2 Mà k_2 là số bán nguyên → k_1 là số lẻ → tại N thỏa mãn điều kiện đề bài Mặt khác: x_M=k_1 i_1 ⇒ 9,6 · 10^-3=k_1 ·λ· 0,8/0,5.10^-3⇒ k_1 λ=6.10^-6 Theo đề bài ta có: 0,38 · 10^-6≤λ≤ 0,64 · 10^-6 ⇒ 0,38 · 10^-6≤6 · 10^-6/k_1≤ 0,64 · 10^-6 ⇒ 15,8 ≥ k_1 ≥ 9,3 ⇒ k_1=15 ⇒λ=0,4 · 10^-6( m) Khi D=D_2 ta có: x_N=k_2 i_2 ⇒ 9,6 · 10^-3=k_2 ·0,4 · 10^-6· 1,6/0,5 · 10^-3 ⇒ k_2=7,5 Vậy có 7 lần tại N có vân sáng, ứng với k=8 ; 9 ; 10 ; 11 ; 12 ; 13 ; 14. Chọn D. Solution: When D=D_1, the fringe spacing is given by: i_1=λ D_1/a At points M and N, we have: k_N/k_M=x_N/x_M=9,6/6,4=3/2 ⇒{[ k_N=3 p; k_M=2 p ]. Also, we have: x=k_1 i_1 When D=D_2, the fringe spacing is: i_2=λ D_2/a=λ· 2 D_1/a=2 i_1 At a position of a dark fringe, we have: x=k_2 i_2=k_1 i_1 ⇒ k_2 · 2 i_1=k_1 i_1 ⇒ k_1=2 k_2 Since k_2 is an integer, k_1 is odd. Therefore, point N satisfies the given condition. Furthermore: x_M=k_1 i_1 ⇒ 9,6 · 10^-3=k_1 ·λ· 0,8/0,5.10^-3⇒ k_1 λ=6.10^-6 According to the problem statement: 0,38 · 10^-6≤λ≤ 0,64 · 10^-6 ⇒ 0,38 · 10^-6≤6 · 10^-6/k_1≤ 0,64 · 10^-6 ⇒ 15,8 ≥ k_1 ≥ 9,3 ⇒ k_1=15 ⇒λ=0,4 · 10^-6( m) When D=D_2, we have: x_N=k_2 i_2 ⇒ 9,6 · 10^-3=k_2 ·0,4 · 10^-6· 1,6/0,5 · 10^-3 ⇒ k_2=7,5 Thus, there are 7 instances of bright fringes at point N, corresponding to k=8, 9, 10, 11, 12, 13, 14. Choose D. ChatGPT: Theo công thức về khoảng cách giữa hai vân sáng: dsinθ=mλ trong đó, m là số thứ tự của vân sáng, d là khoảng cách giữa hai khe, λ là bước sóng của ánh sáng và θ là góc giữa đường thẳng nối điểm chiếu và trung điểm hai khe với đường thẳng vuông góc với mặt phẳng hai khe. Ta có thể tính được khoảng cách giữa hai vân sáng liên tiếp tại N khi màn dịch chuyển một khoảng Δ D bằng công thức: Δ d=dΔ D/D_1D_2 Do đó, số lần tại N là vị trí của vân sáng sẽ là: n=⌊Δ D/Δ d/sinθ⌋ Với D=D_1=0,8 m, ta tính được: sinθ=Mn-MN/D_1=6,4× 10^-9/0,8=8× 10^-9 Dùng công thức về khoảng cách giữa hai vân sáng, ta tính được bước sóng của ánh sáng là: λ=dsinθ/m=0,5× 10^-3× 8× 10^-9/1=4× 10^-12 m Với D=D_2=1,6 m, ta tính được: sinθ=Nn-MN/D_2=9,6× 10^-9/1,6=6× 10^-9 Dùng công thức về khoảng cách giữa hai vân sáng, ta tìm được số thứ tự của vân tối tại N là: m=dsinθ/λ=0,5× 10^-3× 6× 10^-9/4× 10^-12=750 Do đó, nếu ta dịch chuyển màn dọc theo phương vuông góc với mặt phẳng hai khe từ D_1 đến D_2, thì sẽ có 750-1=749 vân sáng liên tiếp tại N, tương ứng với số lần tại N là vị trí của vân sáng là 4. Vậy đáp án đúng là A. 4. According to the formula for the distance between two bright fringes: d sinθ=m, where m is the order number of the bright fringe, d is the distance between two slits, lambda is the wavelength of light, and theta is the angle between the line connecting the point of projection and the midpoint of the two slits with the line perpendicular to the plane of the two slits. We can calculate the distance between two consecutive bright fringes at N when the screen is shifted by a distance Δ D using the formula: Δ d=d Δ D/D_1 D_2. Therefore, the number of times the bright fringe appears at N is given by: n=\|Δ D/Δ d/sinθ. For D=D_1=0.8 m, we can calculate: sinθ=M n-M N/D_1=6.4 × 10^-9/0.8=8 × 10^-9. Using the formula for the distance between two bright fringes, we can calculate the wavelength of light: λ=d sinθ/m=0.5 × 10^-3× 8 × 10^-9/1=4 × 10^-12 m. For D=D_2= 1.6 m, we can calculate: sinθ=N n-M N/D_2=9.6 × 10^-9/1.6=6 × 10^-9. Using the formula for the distance between two bright fringes, we can find the order number of the dark fringe at N: m=d sinθ/λ=0.5 × 10^-3× 6 × 10^-9/4 × 10^-12= 750.Therefore, if we shift the screen perpendicular to the plane of the two slits from D_1 to D_2, there will be 750-1=749 consecutive bright fringes at N, corresponding to the position of the bright fringe at N being 4. =>𝐀 BingChat: Câu trả lời đúng là B. 3. Khoảng cách giữa hai vân sáng liên tiếp trên màn quan sát trong thí nghiệm Y-âng về giao thoa ánh sáng có thể được tính bằng công thức: Δ y = λ D/d. Do đó, khi D = D1 = 0,8 m thì khoảng cách giữa hai vân sáng liên tiếp trên màn quan sát là Δ y1 = λ D1/d = 0,8λ/0,5× 10^-3 (m). Khi D = D2 = 1,6 m thì khoảng cách giữa hai vân sáng liên tiếp trên màn quan sát là Δ y2 = λ D2/d = 1,6λ/0,5× 10^-3 (m). Vì tại N là vị trí của vân sáng khi D = D1 và là vị trí của vân tối khi D = D2 nên ta có: 9,6× 10^-3 = kΔ y1 và 9,6× 10^-3 + 1/2Δ y2 = k’Δ y2. Từ đó ta có: k’ - k = 9,6× 10^-3/Δ y2 - 9,6× 10^-3/Δ y1 + 1/2 = 3. Do đó, trong quá trình dịch chuyển màn từ vị trí cách hai khe một đoạn D1 đến vị trí cách hai khe một đoạn D2 thì số lần tại N là vị trí của vân sáng (không tính thời điểm ban đầu) là 3. The correct answer is B. 3. The distance between two consecutive bright fringes on the observation screen in the Y-âng experiment on light interference can be calculated using the formula: Δ y=λ D/d. Therefore, when D=D_1=0.8 m, the distance between two consecutive bright fringes on the observation screen is Δ y 1=λ D 1/d= 0.8 λ/0.5 × 10^-3( m). When D=D_2=1.6 m, the distance between two consecutive bright fringes on the observation screen is Δ y 2=λ D 2/d=1.6 λ/0.5 × 10^-3( m). Since at N is the position of the bright fringe when D=D_1 and is the position of the dark fringe when D=D_2, we have: 9.6 × 10^-3= k Δ y 1 and 9.6 × 10^-3+1/2Δ y 2=k^'Δ y 2. From this we have: k^'-k= 9.6 × 10^-3/Δ y 2-9.6 × 10^-3/Δ y 1+1/2=3. Therefore, during the process of moving the screen from a position a distance D_1 from the two slits to a position a distance D2 from the two slits, the number of times at N is the position of a bright fringe (not counting the initial time) is 3 . §.§.§ High application level question BingChat doesn't give an answer for questions that required information from images, while ChatGPT proposes a solution. Although the question is at the high application level, ChatGPT's answer is correct. This is a special case because both ChatGPT and BingChat are usually unable to answer questions at the high application level. [linewidth=1pt,linecolor=red] Lời giải: Khi C=C_0 ⇒ Z_C=Z_C_0, điện áp hiệu dụng giữa hai đầu đoạn mạch AN đạt cực tiểu, ta có: U_A N=U ·√(r^2+(Z_L-Z_C_0)^2)/√((R+r)^2+(Z_L-Z_C_0)^2)=U √(r^2+Z_L C^2)/√((R+r)^2+Z_L C^2) ⇒ U_A N=U/√(R^2+2 R r/r^2+Z_L C+1) Để U_A N min⇔(R^2+2 R r/r^2+Z_L C)_max⇔ Z_L C min=0 ⇒ Z_L=Z_C_0 Đặt Z_C_0=1 ⇒ Z_L=1 Khi C=C_0/4⇒ Z_C=4 Z_C_0=4 Điện áp hiệu dụng U_A M max⇔ Z_C=(R+r)^2+Z_L^2/Z_L ⇒ 4=(2 r+r)^2+1^2/1⇒ r=1/√(3) ⇒ R=2 r=2/√(3) Độ lệch pha giữa điện áp hiệu dụng hai đầu đoạn mạch AB và cường độ dòng điện là: tanφ=Z_L-Z_C/R+r=1-4/2/√(3)+1/√(3)=-√(3)⇒φ=-π/3 φ_u-φ_i=-π/3⇒φ_i=φ_u+π/3=-π/6+π/3=π/6(rad) Độ lệch pha giữa điện áp hai đầu đoạn mạch MN và cường độ dòng điện là: tanφ_M N=Z_L/r=1/1/√(3)=√(3)=tanπ/3 ⇒φ_u_M N-φ_i=π/3⇒φ_u_M N=φ_i+π/3=π/2(rad) Lại có: U_0 M N/U_0 A B=√(r^2+Z_L^2)/√((R+r)^2+(Z_L-Z_C)^2)⇒U_0 M N/120=1/3 ⇒ U_0 M N=40(V) ⇒ u_M N=40 cos(100 π t+π/2)(V) Chọn D. Solution: When C=C_0 ⇒ Z_C=Z_C_0, the effective voltage across the circuit segment AN reaches a minimum when: U_A N=U ·√(r^2+(Z_L-Z_C_0)^2)/√((R+r)^2+(Z_L-Z_C_0)^2)=U √(r^2+Z_L C^2)/√((R+r)^2+Z_L C^2) ⇒ U_A N=U/√(R^2+2 R r/r^2+Z_L C+1) For U_A N min⇔(R^2+2 R r/r^2+Z_L C)_max⇔ Z_L C min=0 ⇒ Z_L=Z_C_0 Taking Z_C_0=1 ⇒ Z_L=1 When C=C_0/4⇒ Z_C=4 Z_C_0=4 The effective voltage U_A M max⇔ Z_C=(R+r)^2+Z_L^2/Z_L ⇒ 4=(2 r+r)^2+1^2/1⇒ r=1/√(3) ⇒ R=2 r=2/√(3) The phase difference between the effective voltage across segment AB and the current intensity is: tanφ=Z_L-Z_C/R+r=1-4/2/√(3)+1/√(3)=-√(3)⇒φ=-π/3 φ_u-φ_i=-π/3⇒φ_i=φ_u+π/3=-π/6+π/3=π/6(rad) The phase difference between the voltage across segment MN and the current intensity is: tanφ_M N=Z_L/r=1/1/√(3)=√(3)=tanπ/3 ⇒φ_u_M N-φ_i=π/3⇒φ_u_M N=φ_i+π/3=π/2(rad) Also, we have: U_0 M N/U_0 A B=√(r^2+Z_L^2)/√((R+r)^2+(Z_L-Z_C)^2)⇒U_0 M N/120=1/3 ⇒ U_0 M N=40(V) ⇒ u_M N=40 cos(100 π t+π/2)(V) Therefore, the correct answer is D. ChatGPT: Ta dùng công thức tổng quát để tính điện áp hiệu dụng trên mạch C-L-r: U_AN = U √(R^2+(2π L - 12π C)^2R^2+(2π L)^2) = 120 √((2r)^2+(2π L - 12π C_0)^2(2r)^2+(2π L)^2) Ta có: 12π C_0 = 2r ⇒ C_0 = 14π^2r^2. Thay giá trị C = C_04 = 116π^2r^2 vào công thức, ta được: U_AM = U_C = 120√(3) Điện áp trên mạch L-r khi đó là: U_MN = U_AN - U_C = 40 cos(100π t + π2) V Vậy đáp án chính xác là (D). We use the general formula to calculate the effective voltage on the C-L-r circuit: U_AN = U √(R^2+(2π L - 12π C)^2R^2+(2π L)^2) = 120 √((2r)^2+(2π L - 12π C_0)^2(2r)^2+(2π L)^2) We have: 12π C_0 = 2r ⇒ C_0 = 14π^2r^2. Substituting the value of C = C_04 = 116π^2r^2 into the formula, we get: U_A M=U_C=120 √(3). The voltage on the L-r circuit is then: U_M N=U_A N-U_C=40 cos (100 π t+π / 2) V So the correct answer is 𝐃. BingChat: Câu hỏi của bạn là một câu hỏi về mạch điện xoay chiều và điện áp hiệu dụng. Để giải quyết câu hỏi này, chúng ta cần sử dụng các nguyên lý về mạch điện xoay chiều để tính toán điện áp giữa hai đầu đoạn mạch MN. Tuy nhiên, để giải quyết câu hỏi này chúng ta cần biết thêm thông tin về các giá trị của các thông số như độ tự cảm L và điện trở r của cuộn dây. Bạn có thể cung cấp thêm thông tin để tôi có thể giúp đỡ bạn tốt hơn không? Your question is about alternating current circuits and effective voltage. To solve this question, we need to use the principles of alternating current circuits to calculate the voltage between the two ends of the MN circuit segment. However, to solve this question we need to know more information about the values of parameters such as inductance L and resistance r of the coil. Can you provide more information so I can help you better? §.§ Performance §.§.§ Question order The difficulty of the questions determines how they are arranged. The questions are divided into three categories: knowledge level (questions 1–20), comprehension level (questions 20–30), and application and high application levels (questions 30–40). The results from ChatGPT and BingChat are shown in Table <ref> in the order of the questions. We also suggest two values: Max and Min. Max reflects the capability of ChatGPT and BingChat to answer questions correctly in the greatest possible way. The worst-case scenario for ChatGPT and BingChat, or the models' capability to give wrong replies, is represented by Min (1-Min). Max={[ 0 if ChatGPT =0 and BingChat =0; 1 otherwise ]. Min= 1 if ChatGPT =1 and BingChat =1 0 otherwise The values Max and Min enable us to evaluate the best and worst LLMs performance on the VNHSGE dataset. For instance, BingChat provided the incorrect response to inquiry "x" while ChatGPT provided the right one, resulting in Max being true (value "1") and Min being false (value "0"). Since the order of the questions affects how difficult they are, we can assess the correctness of the answers based on the order of the questions, allowing us to assess the proficiency of the LLMs based on the difficulty of the questions. Fig. <ref> presents the 5-year average results, which show that ChatGPT has an accuracy rate of over 50% for questions 1-32 but falls below 50% for questions 33-40. On the other hand, BingChat, Min, and Max can provide correct answers for questions 1-31, 1-31, and 1-32 with an accuracy of more than 50%, respectively. However, both BingChat and Min show a decrease in accuracy below 50% for some questions. Notably, Min's accuracy rate drops to almost 0% from question 32 onwards. Analysis of ChatGPT and BingChat shows that these models can answer questions at the knowledge, comprehension, and application levels, but they face difficulties in solving questions at high application levels. The results suggest that these models need further improvement to perform better in advanced application-level questions. §.§.§ Performance evaluation Table <ref> displays the performance of LLMs for each year and their averages. ChatGPT's performance is 61 % (from 57.5 % to 65 % ), while BingChat obtained 66 % (from 72.5 % to 55 % ). Max performed consistently well, 78.5 %, while Min's performance is 48.5 %. Interestingly, ChatGPT outperformed BingChat only in 2019. These findings suggest that while each LLM has its strengths and weaknesses, Max is the most consistent performer across all years. However, further investigation is needed to identify the factors that contributed to each model's performance. performance 75, 80, 80, 77.5, 80 60, 62.5, 60, 65, 57.5 55, 67.5, 67.5, 67.5, 72.5 40, 50, 47.5, 55, 50 In Fig. <ref>, the consistency of responses given by ChatGPT and BingChat on the VNHSGE dataset is demonstrated. The results show that ChatGPT is more consistent than BingChat. This information can help in understanding the strengths and weaknesses of different LLMs, which can be used to guide their use in various applications. Furthermore, the observed differences in consistency between the two models may have practical implications for the reliability of their responses. For instance, it is important to consider the level of consistency in determining the trustworthiness of AI-generated responses, especially in contexts where errors or inaccuracies can have significant consequences. Further research could investigate the reasons for the observed differences in consistency and explore ways to improve the reliability of AI-generated responses. §.§.§ Comparison to other exams Fig. <ref> presents a comparison between the performances of ChatGPT and BingChat on the VNHSGE dataset and ChatGPT's performance on the AP Physics dataset from OpenAI <cit.>. OpenAI had reported ChatGPT's score range as 30 %-66 %. The results showed that ChatGPT scored 61 % on the VNHSGE dataset, while BingChat scored 66 %. The highest score of 78 % was achieved by the test case, with a minimum of 30 %. §.§.§ Comparison to Vietnamese students To evaluate the performance of the LLMs, we compared their scores with those of Vietnamese students. The converted scores of ChatGPT and BingChat, as well as the average score (AVNS) and the most attained score by a Vietnamese student (MVNS), are shown in Table <ref>. The average scores of ChatGPT and BingChat are similar to AVNS and lower scores than MVNS. However, Max performed better AVNS and MVNS. This shows the potential application of LLMs to high school physic in Vietnam. In our study, we evaluated the performance of ChatGPT, BingChat, Min, and Max on high school physics exams and compared their scores with those of Vietnamese students. The results indicated that although LLMs have made significant strides in NLP, their performance in specialized domains like physics still falls short of that of human students. Fig <ref>-<ref> show the physics score spectrum of Vietnamese students in 2019-2022. ChatGPT and BingGPT's performance was mostly inferior to that of Vietnamese students. This underscores the need to further refine and optimize these models for specialized domains to achieve human-level performance. Additionally, future research could investigate ways to incorporate domain-specific knowledge and curriculum into the training of these models to improve their performance on subject-specific exams. § DISCUSSION LLMs have a great deal of potential to change education by providing individualized and interactive learning experiences. Large volumes of data may be analyzed by LLMs, which can also provide customized feedback and adapt to different learning methods. They can help teachers work less by helping to grade and appraise student work. The results of this study indicate that LLMs like ChatGPT and BingChat are less accurate than Vietnamese students and have a limited capacity to respond to high-level application problems in Physics at the high school level. This emphasizes the difficulties LLMs encounter when attempting to comprehend the intricacies of natural language, particularly in specialist fields like physics. Regardless of their location or socioeconomic situation, LLMs can give students access to excellent materials and tailored feedback despite these obstacles. Moreover, LLMs can also be taught to recognize and adjust to regional variations in language and culture, making them useful in a variety of settings, including Vietnam. The accuracy and reliability of LLMs in specialized fields like physics need to be improved, platforms and tools need to be created to make it easier to integrate LLMs into the classroom, and privacy and data security issues need to be resolved in order to fully realize the potential of LLMs in education. LLMs have the potential to revolutionize education, including in the field of physics in Vietnam and around the world, but their success depends on resolving the issues this study has brought to light and putting in place the policies and infrastructure necessary for their successful integration into the educational system. § CONCLUSION Our study's objective was to evaluate how well ChatGPT and BingChat, two SOTA-LLMs, performed when answering high school physics questions in exams given in Vietnamese between 2019 and 2023. The findings showed that both LLMs had trouble answering complex application questions. BingChat showed better accuracy, while ChatGPT was more reliable in its responses. Our investigation also compared the LLMs' performance to the test results of Vietnamese students, and the results showed that ChatGPT and BingChat performed worse than Vietnamese students. This demonstrates the limitations of LLMs as a substitute for human intellect in the teaching of physics. However, LLMs can still help students and teachers with individualized instruction and provide immediate feedback. Additionally, they can produce practice and test materials. However, more domain-specific knowledge must be incorporated into LLMs in order to improve their ability to reason and apply knowledge. Future studies should concentrate on enhancing LLMs' capability to answer complex questions and assessing how well they contribute to improved student learning outcomes. IEEEtran
http://arxiv.org/abs/2306.02849v1	20230605125855	Exact Two-Step Benders Decomposition for Two-Stage Stochastic Mixed-Integer Programs	[ "Sifa Celik", "Layla Martin", "Albert H. Schrotenboer", "Tom Van Woensel" ]	math.OC	[ "math.OC" ]	Celik et al. Two-Step Benders Decomposition Exact Two-Step Benders Decomposition for Two-Stage Stochastic Mixed-Integer Programs Şifa Çelik^a, Layla Martin^a,b, Albert H. Schrotenboer^a,b, Tom Van Woensel^a,b ^aSchool of Industrial Engineering, Eindhoven University of Technology, 5612AZ Eindhoven, The Netherlands ^bEindhoven AI Systems Institute, Eindhoven University of Technology, 5612AZ Eindhoven, The Netherlands [email protected], [email protected], [email protected], [email protected] Many real-life optimization problems belong to the class of two-stage stochastic mixed-integer programming problems with continuous recourse. This paper introduces Two-Step Benders Decomposition with Scenario Clustering (TBDS) as a general exact solution methodology for solving such stochastic programs to optimality. The method combines and generalizes Benders dual decomposition, partial Benders decomposition, and Scenario Clustering techniques and does so within a novel two-step decomposition along the binary and continuous first-stage decisions. We use TBDS to provide the first exact solutions for the so-called Time Window Assignment Traveling Salesperson problem. This is a canonical optimization problem for service-oriented vehicle routing; it considers jointly assigning time windows to customers and routing a vehicle among them while travel times are stochastic. Extensive experiments show that TBDS is superior to state-of-the-art approaches in the literature. It solves instances with up to 25 customers to optimality. It provides better lower and upper bounds that lead to faster convergence than related methods. For example, Benders dual decomposition cannot solve instances of 10 customers to optimality. We use TBDS to analyze the structure of the optimal solutions. By increasing routing costs only slightly, customer service can be improved tremendously, driven by smartly alternating between high- and low-variance travel arcs to reduce the impact of delay propagation throughout the executed vehicle route. Partial Benders Decomposition, Benders Dual Decomposition, Time Window Assignment, Vehicle Routing, Stochastic Programming FAUST X. Multi-band, multi-scale dust study of L1527 IRS L. Cacciapuoti 1,2,3 E. Macias 1 A. J. Maury 4 C. J. Chandler 5 N. Sakai 6 Ł. Tychoniec 1 S. Viti 7,8 A. Natta 9 M. De Simone 1,2 A. Miotello 1 C. Codella 2,10 C. Ceccarelli 10 L. Podio 2 D. Fedele 2 D. Johnstone 11,12 Y. Shirley 13 B. J. Liu 14,15 E. Bianchi 16 Z. E. Zhang 5 J. Pineda 17 L. Loinard 18 F. Ménard 9 U. Lebreuilly 4 R. S. Klessen 19,20 P. Hennebelle 4 S. Molinari 21 L. Testi 2,22 S. Yamamoto 23 Received 21 February, 2023; accepted 5 June, 2023 ========================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================== § INTRODUCTION Two-stage stochastic programming has emerged as a prominent strategy for making decisions in the face of uncertainty. This strategy involves initial first-stage decisions before uncertainty is resolved and second-stage recourse decisions after uncertainty is realized. The objective is to minimize the expected cost associated with both sets of decisions. Numerous real-world applications can be effectively modeled using two-stage stochastic programming, incorporating binary and continuous first-stage decisions. For example, Facility Location <cit.>, Stochastic Inventory Routing <cit.>, and Time Window Assignment Vehicle Routing <cit.> are commonly addressed using two-stage stochastic programming. In Facility Location, binary variables determine which locations to open and what customers to assign, while continuous variables define facility capacity. In Stochastic Inventory Routing, binary variables define vehicle routes, while continuous variables represent the delivery amount. Similarly, in Time Window Assignment Vehicle Routing, binary variables determine vehicle routes, and continuous variables model decisions regarding time window assignments to customers. In two-stage stochastic programs, uncertainty is typically represented by constructing a well-defined set of scenarios. Benders decomposition-inspired approaches are commonly utilized to decompose the problem across these scenarios. However, despite employing such techniques, for many problems, it remains challenging to achieve optimal solutions. Recently, two distinct research streams made notable contributions toward solving general two-stage stochastic programs. The first stream centers around Benders decomposition, which experienced a resurgence in scientific attention with the introduction of Benders dual decomposition <cit.> and partial Benders decomposition <cit.>. However, when applied to two-stage stochastic programs with binary and continuous first-stage decision variables, these approaches often require numerous iterations of generating relatively weak optimality and feasibility cuts, primarily due to low-quality solutions in early iterations <cit.>. The second stream focuses on generating a compact set of scenarios that accurately captures the underlying uncertainty by utilizing scenario clustering techniques aimed at enhancing computational performance in general <cit.>. To this date, it remains an open question of how such techniques can improve the computational efficiency of state-of-the-art Benders decomposition approaches, such as Benders dual decomposition or partial Benders decomposition. This paper introduces Two-Step Benders Decomposition with Scenario Clustering (TBDS), an exact method specifically designed to solve two-stage stochastic programs involving binary and continuous first-stage decisions. The effectiveness of TBDS stems from combining two fundamental ideas. Firstly, we employ a novel two-step decomposition approach that effectively handles the first-stage binary and continuous decision variables to generate optimality and feasibility cuts. This two-step decomposition approach enhances the quality of the first-stage continuous variables, resulting in stronger cuts than existing methods. Secondly, TBDS integrates recent advancements in scenario-clustering techniques for stochastic programming <cit.>, hereby generalizing the principles of partial Benders decomposition. Furthermore, we incorporate the concepts from Benders dual decomposition within TBDS and embed it within a branch-and-cut framework. The first key concept of TBDS involves decomposing the two-stage stochastic program into a master problem and N + 1 subproblems, where N represents the number of scenarios. The initial subproblem corresponds to the first step of the two-step decomposition, focusing solely on the binary decision variables from the master problem and considering a single continuous subproblem. This first step offers a notable advantage by producing a more robust solution for the continuous first-stage decisions, which is then utilized in combination with the binary first-stage solution in the subsequent N single-scenario subproblems. Consequently, this two-step approach generates significantly stronger optimality cuts leading to faster convergence to the optimal solution. The second key concept of TBDS involves generalizing partial Benders decomposition by incorporating representative scenarios into the master program. These representative scenarios are carefully selected, allowing us to optimize our decisions in the first stage before the uncertainty is observed. The selection of the scenario set involves a trade-off: a larger set of scenarios reflects underlying uncertainty better but increases computational complexity. There is growing interest in scenario generation and reduction methods to address this trade-off. These methods can be categorized as either distribution-driven, such as those proposed by, e.g., <cit.>, or problem-driven, as discussed by, e.g., <cit.>, <cit.>, and this paper. The main methodological contributions of this paper are threefold: * We introduce a new exact solution approach, Two-Step Benders decomposition with Scenario Clustering (TBDS), for solving two-stage stochastic mixed-integer programs with continuous recourse. Our TBDS method incorporates two main ideas: a two-step decomposition focusing on the first-stage binary and continuous variables and the utilization of scenario clustering techniques to generalize partial Benders decomposition. * Our TBDS method combines and extends the state-of-the-art approaches in Benders decomposition by incorporating Benders dual decomposition throughout its components. A special case of our TBDS method combines Benders dual decomposition and partial Benders decomposition. * We furthermore generalize partial Benders decomposition by incorporating the ideas from <cit.> to determine representative scenarios of the underlying uncertainty, a problem-driven scenario generation method. As far as the authors know, TBDS is the first exact method that combines problem-driven scenario generation methods with state-of-the-art Benders decomposition. We evaluate TBDS's performance using the Time Window Assignment Traveling Salesperson Problem with Stochastic Travel Times (TWATSP-ST), a canonical optimization problem in service-oriented vehicle routing. This problem represents a two-stage stochastic program with binary (routing) and continuous (time window assignment) first-stage decision variables and continuous second-stage decision variables related to time window violation. The TWATSP-ST thereby aligns with the active research stream on vehicle routing that considers time window assignment as an integral part of the optimization problem (see, e.g., <cit.>; <cit.>), rather than solely adhering to exogenously given time window constraints (see, e.g., <cit.>; <cit.>). We summarize our contributions on the intersection of time window assignment and routing as follows: * We present the first exact method for jointly optimizing time window assignment and routing by applying TBDS to the TWATSP-ST. Extensive computational experiments demonstrate the superior performance of TBDS on the TWATSP-ST, surpassing existing state-of-the-art approaches like Benders dual decomposition and partial Benders decomposition. TBDS solves instances with up to 25 customers to optimality. * By solving the TWATSP-ST to optimality, we automatically cater for delay propagation throughout the execution of a vehicle route. This has either not been accounted for <cit.>, or has only be studied with exogenously given time windows <cit.>. * Our analysis of optimal solutions provides valuable managerial insights, highlighting the advantages of flexible time window assignments and the importance of considering stochasticity in decision-making. Specifically, we compare the performance of the stochastic solution obtained by TBDS against the TSP solution (assuming a vehicle drives the shortest route), expected value solution (assuming travel times follow their expectation), and fixed time window assignment solution (assuming all time windows among customers are of the same length). We show that simultaneously optimizing time windows and routing leads to a noteworthy 12.8% improvement in total costs while incurring only a minor increase in routing costs. Furthermore, we show that the value of the stochastic solution is 6.2%, further highlighting the potential benefits of incorporating stochasticity in decision-making processes. The remainder of the paper is organized as follows. In Section <ref>, we briefly overview the relevant background on Benders decomposition. Section <ref> presents the TBDS methodology, explaining the associated mathematical models and cuts. Section <ref> discusses the application of TBDS on the TWATSP-ST. Section <ref> provides computational results on the performance of TBDS and managerial results associated with solving the TWATSP-ST. We conclude this paper and provide avenues for future research in Section <ref>. § BACKGROUND ON BENDERS DECOMPOSITION In this section, we first provide an overview of Benders decomposition and then discuss Benders dual decomposition, highlighting the fundamental formulations necessary for introducing TBDS in Section <ref>. §.§ Benders Decomposition <cit.> and <cit.> were the first to propose algorithms for solving two-stage stochastic linear programs. <cit.> developed the L-shaped method that exploits the block-angular structure of two-stage stochastic models aligning with the decomposition structure and cut generation principles of Benders decomposition <cit.>. Since then, many variants and tailored Benders decomposition algorithms have been proposed, but the core ideas remain similar. Due to the independence of scenarios (reflecting the realization of random vectors), two-stage stochastic programs are decomposable over scenarios, resulting in a master program and one or multiple subproblems, each representing the second-stage problems associated with a scenario ω∈Ω, where Ω is a finite set of scenarios or realized random events. Throughout this paper, we denote dependency on ω via a subscript. At some points (see Section 4), this notation becomes inconvenient. In that case, we denote it as a functional form. We introduce Benders decomposition through a two-stage stochastic programming problem of the following generic form min{ c^T x+ ∑_ω∈Ωp_ω Q(x,ω): Ax = a, x ∈ℤ_+^n_1}, with Q(x,ω) = min{f_ω^T z_ω : W_ω z_ω = h_ω-T_ω x , z_ω∈ℝ_+^m } ∀ ω∈Ω, where c ∈ℝ^n_1, A ∈ℝ^k_1× n_1, a ∈ℝ^k_1, f_ω∈ℝ^m, W_ω∈ℝ^ℓ× m , h_ω∈ℝ^ℓ, and T_ω∈ℝ^ℓ× n_1. Here, p_ω∈ℝ denotes the probability of observing scenario ω∈Ω. We define the master program (MP) as MP = min{ c^T x+ θ}: Ax = a, x ∈ℤ_+^n_1, θ∈ℝ}. An auxiliary decision variable θ approximates the recourse function Q(x) =∑_ω∈Ωp_ω Q(x,ω) in the master program. By utilizing the dual of the Second-Stage Subproblem (<ref>) for a scenario ω∈Ω, we produce a set of valid inequalities referred to as the optimality and feasibility cuts for the first-stage decision variables. If the dual of Subproblem (<ref>) for a scenario ω∈Ω given solution x^* is unbounded, implying that the primal subproblem is infeasible, we generate feasibility cuts with the unbounded extreme ray to cut off the solution x^. If the dual of Subproblem (<ref>) for a scenario ω∈Ω given solution x^ is feasible, we generate optimality cuts with the extreme points of the dual problem. Optimality cuts provide a lower bound on the expected cost of the recourse function Q(x, ω). §.§ Benders Dual Decomposition Recently, <cit.> introduced Benders dual decomposition (BDD) as a version of Benders decomposition that uses strengthened Benders and Lagrangian cuts. The BDD method generates Lagrangian cuts by heuristically solving a Lagrangian cut generation problem. <cit.> numerically show that Lagrangian cuts close the gap at the root node substantially for a variety of stochastic integer problems. They propose a family of strengthened optimality and feasibility cuts that dominate the classical Benders cuts at fractional points of the master problem. By defining x^* as the current master problem solution, we can reformulate the recourse function Q(x,ω) for each scenario ω∈Ω as Q(x^,ω) = min_x_ω,z_ω{f_ω^Tz_ω : Ax_ω = a, W_ω z_ω = h_ω-T_ω x_ω, x_ω = x^, x_ω∈ℝ^n_1_+, z_ω∈ℝ^m_+}. The following optimality cut is derived by solving problem (<ref>) θ≥∑_ω∈Ωp_ω f_ω^Tz_ω + (x-x_ω)^Tλ_ω^, where z_ω and x_ω represent the optimal solution of the subproblem (<ref>) and λ_ω^ are the dual variables associated with constraints x_ω = x^. To strengthen (<ref>), the BDD method prices out the constraints x_ω = x^ into the objective function using the dual multipliers λ_ω. By doing so, we obtain the following Lagrangian dual problem for each ω∈Ω λ_ωmax x_ω,z_ωmin{f_ω^Tz_ω - λ_ω^T(x_ω-x^): Ax_ω = a, W_ω z_ω = h_ω-T_ω x}. Then, given x^∈ℝ^n_1 and λ^_ω∈ℝ^n_1 for ω∈Ω, let (z_ω,x_ω) be an optimal solution obtained by solving the following problem min{ f_ω^Tz_ω - λ^_ω^T(x_ω-x^): Ax_ω = a, W_ω z_ω = h_ω-T_ω x_ω, x_ω∈ℤ^n_1_+, z_ω∈ℝ^m_+ }. The strengthened optimality cut is valid for MP and given by θ≥∑_ω∈Ωp_ω f_ω^Tz_ω + (x-x_ω)^Tλ^_ω. § EXACT TWO-STEP BENDERS DECOMPOSITION WITH SCENARIO CLUSTERING (TBDS) We propose a general exact solution method for two-stage stochastic programs with mixed binary and continuous first-stage decision variables and continuous second-stage decision variables. The overall method is a branch-and-cut approach, of which the algorithmic details are discussed at the end of this section. We assume that our problems are primal feasible and bounded. Let ξ(·) represent a random vector on a finite scenario sample space Ω. Specifically, ξ_ω denotes the particular realization of the random vector in scenario ω∈Ω, with p_ω as the associated probability. In the remainder of this paper, we work directly with p_ω. Three elements play a key role in the Two-Step Benders Decomposition with Scenario Clustering (TBDS): * We consider a Master Problem (MP) with two associated (sets of) subproblems. The first subproblem, SP1, arises from fixing the binary variables in the MP, leading to a linear programming problem acting on the continuous first-stage variables and all continuous second-stage variables. The second subproblem SP2 is obtained by fixing the binary first-stage variables obtained from the master problem and taking the continuous second-stage variables as the solution of SP1, resulting in one subproblem SP2 per scenario. * Considering scenarios and the associated second-stage constraints directly in the MP prevents generating superfluous optimality cuts. It influences the total number of subproblems SP2 from which we generate these optimality cuts. We generalize this idea by considering recent advances in scenario clustering techniques within stochastic programming. This helps to reduce the number of weak first-stage solutions in early iterations of the method. * We use Benders dual decomposition to strengthen the optimality cuts we derive from our subproblems, and embed all the aforementioned concepts in a branch-and-cut algorithm. In the remainder of this paper, we consider the following two-stage stochastic mixed-integer program with relatively complete continuous recourse min_x,y,z c^Tx + d^Ty + ∑_ω∈Ωp_ωf_ω^T z_ω s.t. W_ω x + T_ω y + S_ω z_ω≥ h_ω ∀ ω∈Ω, x ∈𝒳, y ∈𝒴, z_ω∈ℝ_+^m ∀ ω∈Ω. where c ∈ℝ^n_1, d ∈ℝ^n_2, f_ω∈ℝ^m, W_ω∈ℝ^ℓ× n_1 ,T_ω∈ℝ^ℓ× n_2, S_ω∈ℝ^ℓ× m, and h_ω∈ℝ^ℓ. We denote first-stage constraints and their domains compactly as x∈𝒳 := {Ax = a, x ∈ℤ_+^n_1} and y∈𝒴 := {Bx = b, y ∈ℝ_+^n_2} where A ∈ℝ^k_1× n_1, a ∈ℝ^k_1, B ∈ℝ^k_2× n_2, and b ∈ℝ^k_2. Note the first-stage decision variables are binary variables x and continuous variables y. We reformulate the two-stage stochastic mixed-integer problem with continuous recourse by explicitly considering Ω_MP (not necessarily subset of Ω) in the master problem (via second-stage constraints (<ref>)) and Ω_SP := Ω\Ω_MP. We detail the construction of Ω_MP in Section <ref>. The scenarios Ω_SP impose \|Ω_SP\| subproblems SP2, from which we derive optimality cuts for our novel two-step decomposition. Before we detail TBDS throughout the remainder of this section, we already state the Master Problem (MP) MP= min_x,y c^Tx + Θ + ∑_ω∈Ω_MP^1p_ωf_ω^T z_ω s.t. W_ω x + T_ω y + S_ω z_ω≥ h_ω ∀ ω∈Ω_MP, Θ≥ d^Ty + ∑_ω∈Ω_SPp_ωθ_ω, Θ≥(d^Ty + ∑_ω∈Ω_SPp_ωf_ω^T z_ω + (x-x)λ^)_i ∀ i ∈ I, θ_ω≥(p_ωf_ω^T z_ω + (x-x_ω)ν_ω^ + (y-y_ω)η_ω^)_j ∀ j ∈ J_ω, ω∈Ω_SP , 0 ≥(1^Tϵ + (x-x)λ^)_k ∀ k ∈ K, x ∈𝒳, y ∈𝒴, Θ∈ℝ_+, z_ω∈ℝ_+^m, θ_ω∈ℝ_+ ∀ ω∈Ω. We introduce the auxiliary variables Θ and θ_ω , ∀ ω∈Ω_SP. Here, Θ approximates the objective function of SP1 while θ_ω approximates the SP2 subproblem cost. In MP, we minimize the total cost associated with x, θ, and the expected second-stage cost of included scenarios (Ω^1_MP). Constraints (<ref>) are the second-stage constraints. Constraint (<ref>) is called the subproblem connectivity constraint and its use will be explained later in this section. Constraints (<ref>) - (<ref>) are the optimality cuts. Constraints (<ref>) are the feasibility cuts. The sets I, J_ω and K refer to the complete set of feasibility and/or optimality cuts. The parameters and variables appearing in these constraints will be detailed in the remainder of this section at the appropriate moments to enhance readability. Constraints (<ref>) and (<ref>) restrict the variable domains. §.§ Subproblem Decomposition, Optimality Cuts, and Subproblem-Connectivity Constraint Classic Benders decomposition decomposes first- and second-stage decisions, but the continuous first-stage variables reduce the efficiency of the resulting optimality cuts as MP loses the information regarding the second stage. Therefore, TBDS proposes a two-step decomposition. After solving MP, we first take the binary variables fixed and derive optimality and feasibility cuts based on SP1. Then, we take the solution of the continuous first-stage variables from SP1 together with the binary variables from MP and derive optimality cuts on the scenario subproblems SP2. We will detail each of these cuts consecutively. The solution values of the MP define lower bounds for (<ref>) - (<ref>). We solve the MP using branch-and-cut and thus dynamically include the aforementioned cuts while exploring the branch-and-bound tree. At each node of the branch-and-bound tree, the solution x^* is fixed in the primal subproblem (SP1) SP1(x^)= min_y,z{d^Ty + ∑_ω∈Ω_SPp_ωf_ω^T z_ω\| W_ω x + T_ω y + S_ω z_ω≥ h_ω ∀ ω∈Ω, x =x^, y ∈𝒴, z_ω∈ℝ^m_+}. Let λ^* be the dual multipliers associated with the constraints x = x^. If primal subproblem (SP1) is infeasible for x^, we solve the feasibility problem min_x,y,z,ϵ{1^T ϵ: W_ω x + T_ω y + S_ω z_ω + ϵ̅≥ h_ω ∀ ω∈Ω_SP, x =x^, y ∈𝒴, z_ω∈ℝ^m_+, ϵ∈ℝ^ℓ_+ }. This generates a feasibility cut of the form 0 ≥1^Tϵ̅+ (x-x)^Tλ^, (Feasibility Cut) where ϵ and x refer to the values of ϵ and x in the optimal solution to the feasibility problem (<ref>), and 1 is a vector of ones of size ℓ. If the primal subproblem (SP1) returns a feasible solution (y, z̅), we derive the optimality cut Θ≥ d^Ty + ∑_ω∈Ω_SPp_ωf_ω^T z_ω + (x-x)^Tλ^* (Aggregated Optimality Cut) We do not decompose SP1 over the scenarios because it is a linear program and, thus, easy to solve computationally. Including all scenarios provides more information and thus results in relatively `good' first-stage decisions. The second (set of) subproblems is obtained by decomposing into single scenario second-stage subproblems for a given y̅ obtained as the optimal solution of SP1 and x^* as the optimal solution to (the linear relaxation of) MP. That is, SP2(x^,y̅,ω)=min_x_ω,y_ω,z_ω{f_ω^T z_ω: W_ω x_ω + T_ω y + S_ω z_ω≥ h_ω, x_ω = x^, y_ω = y̅, x_ω∈ℝ^n_1_+, y_ω∈ℝ^n_2_+, z_ω∈ℝ^m_+}. Note we only construct SP2 if SP1 is feasible; thus, SP2 is feasible by construction. Let ν_ω and η_ω denote the dual multipliers to the constraints y_ω = y̅ and x_ω = x^* in SP2(x^, y̅, ω), respectively. Then, the following optimality cut can be derived θ_ω≥p_ωf_ω^T ẑ_ω + (x-x̂_ω)^Tν_ω^ + (y-ŷ_ω)^Tη_ω^* (Scenario Optimality Cut), where (x̂_ω, ŷ_ω, ẑ_ω) is the optimal solution of SP2(x^, y̅, ω). If x^ is fractional and feasible, the steps presented in Section <ref> improve the optimality cut (<ref>). We price out the constraints x_ω = x^* into the objective function of SP2 with dual multiplier ν_ω. The resulting subproblem then asks for solving min_x_ω, y_ω, z_ω{f_ω^T z_ω + (x_ω-x^)^Tν_ω^: W_ω x_ω + T_ω y + S_ω z_ω≥ h_ω, y_ω = y̅, x_ω∈ℤ_+^n_1, y_ω∈ℝ^n_2_+, z_ω∈ℝ^m_+} Then, given ν^_ω for ω∈Ω, let (y_ω, x_ω, z_ω) be an optimal solution obtained by solving problem (<ref>). The strengthened optimality cut θ_ω≥p_ωf_ω^T z_ω + (x-x_ω)^Tν_ω^ + (y-y_ω)^Tη_ω^, where η_ω^ is the dual variable associated with the constraint y_ω = y̅ in (<ref>) is valid for MP. We now derived two sets of optimality cuts, one for the aggregated subproblem SP1 and \|Ω_SP\| for each individual scenario subproblem, along the lines of our two-step decomposition. To obtain a valid MP formulation, recall the Subproblem-Connectivity Constraint Θ≥ d^Ty + ∑_ω∈Ωp_ωθ_ω in MP. This ensures that we also include θ_ω for ω∈Ω via Θ in the objective function of the MP such that constraints (<ref>) and (<ref>) can improve the lower bound in each iteration. For a given feasible solution (x̂_ω, ŷ_ω, ẑ_ω) of SP2, Constraint (<ref>) is a valid optimality cut for MP if Θ≥ d^Ty + ∑_ω∈Ω_SPp_ωθ_ω is part of MP. Proof: Consider the MP' below. MP'= min_x,y c^Tx + d^Ty + ∑_ω∈Ω_SPp_ωθ_ω +∑_ω∈Ω_MP^1p_ωf_ω^T z_ω s.t. W_ω x + T_ω y + S_ω z_ω≥ h_ω ∀ ω∈Ω_MP, θ_ω≥(p_ωf_ω^T z_ω + (x-x_ω)ν_ω^* + (y-y_ω)η_ω^)_j ∀ j ∈ J_ω, ω∈Ω_SP , 0 ≥(1^Tϵ + (x-x)λ^)_k ∀ k ∈ K, x ∈𝒳, y ∈𝒴, z_ω∈ℝ^m_+, Θ∈ℝ^+, θ_ω∈ℝ^+ ∀ ω∈Ω. We want to show that the Constraint (<ref>) is a valid optimality cut for the MP with the inclusion of Constraint (<ref>) by showing the equivalence of MP' and MP. MP' yields the same objective value as in MP when Constraint (<ref>) is added iteratively (the proof follows from the L-shaped method, see <cit.>). Keeping in mind that the above problem is a minimization problem, Θ is lower bounded by d^Ty + ∑_ω∈Ω_SPp_ωθ_ω and constraint (<ref>), i.e., Θ≥max{d^Ty + ∑_ω∈Ω_SPp_ωθ_ω, d^Ty + ∑_ω∈Ω_SPp_ωf_ω^T z_ω + (x-x)^Tλ^* } We can linearize this constraint and rewrite the problem equivalently as MP'= min_x,y c^Tx +Θ + ∑_ω∈Ω_MP^1p_ωf_ω^T z_ω s.t. W_ω x + T_ω y + S_ω z_ω≥ h_ω ∀ ω∈Ω_MP, Θ≥ d^Ty + ∑_ω∈Ω_SPp_ωθ_ω, Θ≥ d^Ty + ∑_ω∈Ω_SPp_ωf_ω^T z_ω + (x-x)^Tλ^, θ_ω≥(p_ωf_ω^T z_ω + (x-x_ω)ν_ω^ + (y-y_ω)η_ω^)_j ∀ j ∈ J_ω, ω∈Ω_SP , 0 ≥(1^Tϵ + (x-x)λ^)_k ∀ k ∈ K, x ∈𝒳, y ∈𝒴, z_ω∈ℝ^m_+, θ_ω∈ℝ^+ ∀ ω∈Ω. which yields the exactly the same MP as in (<ref>) - (<ref>). We summarize the main contribution of our TBDS method, from a Benders decomposition perspective, in Theorem <ref>. Let Z_MIP and Z_MP^RN be the optimal objective value of problem (<ref>) - (<ref>) and the optimal objective value of MP with a finite number of proposed optimality and feasibility cuts, respectively, then, Z_MIP = Z_MP^RN. Proof: The proof follows from <cit.> and Proposition <ref>. Let Z_MP^RN' be the optimal objective value of of MP' with a finite number of proposed optimality and feasibility cuts. By <cit.>, we know Z_MIP = Z_MP^RN'. It is shown that (with Proposition <ref>) Z_MP^RN' =Z_MP^RN. Hence, we can conclude Z_MIP = Z_MP^RN. §.§ Design of the scenario set Ω_MP Relatively complete continuous recourse in stochastic mixed-integer programs typically entails weak bounds and many (superfluous) iterations of generating cuts as the MP loses all the information with the second stage variables <cit.>. To overcome this issue, we adopt and generalize the idea of partial Benders decomposition <cit.>. In line with partial Benders decomposition, we include second-stage constraints associated with a subset of scenarios Ω_MP, via constraints (<ref>). However, partial Benders decomposition designs the set Ω_MP using a row covering strategy to eliminate many feasibility cuts. Instead, we determine a representative scenario subset Ω_MP. The representative scenarios in the master problem Ω_MP = Ω_MP^1∪Ω_MP^2 comprise actual scenarios Ω^1_MP⊆Ω and artificial scenarios Ω^2_MP. Let Ω^2_MP be a set of artificial scenarios created by convex combinations of scenarios in Ω_MP. We first detail the Ω_MP^1 selection. We cluster the scenarios following Definition <ref>, and select the representative scenarios of each cluster for Ω_MP^1. Let K be the number of clusters. The set Ω^1_MP = {r_1, …, r_K} is constructed as follows: Step 1. Compute the opportunity-cost matrix 𝕍= (V_ij)_\|Ω\| × \|Ω\| where V_ij = SP2((x_i,y_i),ξ(ω_j)) ∀ (i,j) ∈Ω where (x_i,y_i) is the optimal solution of the one-scenario subproblem: (x_i,y_i) ∈_x,y SP2(x,y,ξ(ω_i)) ∀ i ∈Ω Step 2. Find a partition of the set Ω into K clusters C_1,…,C_K and their representative scenarios r_1 ∈ C_1,…, r_K ∈ C_K such that r_k = \|V_r_k,r_k - 1/\|C_k\|∑_j ∈ C_kV_r_k,j\| By minimizing the clustering error (equation (<ref>)), we create clusters that best fit the average cost function of all clusters. Appendix <ref> gives an equivalent mixed-integer program to solve equation (<ref>). The reader is referred to <cit.> for more insight. The above procedure adds K so-called representative scenarios into MP by means of constraints (<ref>). This reduces the root node optimality gap by improving the linear relaxation of the master problem. The value of K should be carefully selected, however. A too large K leads to overpopulating the master problem, increasing the solution time. We provide a detailed analysis of the value of K in Section <ref>. Additionally, we construct artificial scenarios Ω_MP^2 based on scenarios in Ω. Adding artificial scenarios into the master program influences the first-stage variables, improving the lower bound. To generate artificial scenarios ω∈Ω_MP^2, we use convex combinations of scenarios in Ω and add the constraints (<ref>) to MP. Let α^ω_ω≥ 0, for ω∈Ω such that ∑_ω∈Ωα^ω_ω =1. Then, the realization of random vector for artificially generated scenario ω∈Ω_MP^2 is defined as W_ω =∑_ω∈Ωα^ω_ω W_ω, T_ω =∑_ω∈Ωα^ω_ω T_ω, S_ω =∑_ω∈Ωα^ω_ω S_ω. We can guarantee the same objective value of the problem (<ref>) - (<ref>) with the inclusion of artificial scenarios by defining the second stage decision variables for an artificial scenario as y_ω = ∑_ω∈Ωα^ω_ω y_ω. Convex combinations of scenarios, as suggested by <cit.>, can create dominance relationships among scenarios, resulting in fewer feasibility cuts and a considerable reduction in the optimality gap upon termination. This technique also improves the number of instances that can be solved optimally within the time limit. Overall, including a set of scenarios Ω_MP in the master problem can strengthen it and lead to faster convergence. §.§ The TBDS Algorithm We provide an efficient algorithmic implementation of TBDS along the lines of branch-and-cut to obtain an efficient algorithm for solving two-stage stochastic mixed-integer programs with continuous recourse. The TBDS algorithm dynamically adds optimality and feasibility cuts during the branch-and-bound procedure. Note the branch-and-bound procedure ensures integrality of the x variables, so that x ∈𝒳. An algorithmic description of TBDS is provided in Algorithm <ref>. We distinct two cases for any arbitrary branch-and-bound node. First, if the associated solution x is fractional (line 6), we create a feasibility cut (<ref>) in case SP1 is infeasible (line 11). If the associated solution is feasible (lines 8, 9), however, we generate the strengthened optimality cuts (<ref>) as these cuts are tighter than the optimality cuts (<ref>) for fractional first-stage solutions <cit.>. Second, if the associated solution x is integer, we generate aggregated optimality cuts (<ref>) and scenario optimality cuts (<ref>). Note that strengthening the scenario optimality cuts for integer solutions is not useful since the optimality cuts (<ref>) are not tight as the optimality cuts (<ref>) <cit.>. Due to our relatively complete recourse assumption, we do not need feasibility cuts at integer solutions. Finally, we like to stress that any other row generation procedure on feasibility on 𝒳 and 𝒴 can easily be included in this procedure. § EXAMPLE APPLICATION OF TBDS We apply TBDS to the Time Window Assignment Traveling Salesperson Problem with Stochastic Travel Times (TWATSP-ST). It concerns the a-priori joint optimization of a vehicle route and the assignment of time windows to the customers, in the presence of travel time uncertainty, initially introduced by <cit.>. Recently, <cit.> extend the model of <cit.> and develop a two-stage heuristic to solve the problem. To this date, only heuristic approaches appeared in the literature for the TWATSP-ST. We will apply TBDS to the TWATSP-ST to obtain the first exact solutions. In the subsequent parts of this section we provide a two-stage stochastic programming formulations with binary and continuous first-stage variables and continuous second-stage variables for the TWATSP-ST, and show explicit formulations for the optimality and feasibility cuts when applying TBDS to the TWATSP-ST. The TWATSP-ST is defined on a graph G = (V,A), where V={0,…, n} is the set of nodes and A := {(i,j)∈ V × V: i≠ j} is the set of arcs. Node 0 acts as the depot at which the vehicle starts its tour and all other nodes represent customers. The vehicle has a shift duration of length T. Each arc (i,j) ∈ A has a known distance d_ij≥ 0. Each customer i∈ V^+ := V∖{0} faces a deterministic service time s_i ≥ 0. We assume travel times over the arcs are stochastic with known distribution. Let ξ= {t_ij}_(i,j)∈ A represent the stochastic travel time vector on a scenario sample space Ω. ξ(ω) = {t_ij(ω)}_(i,j)∈ A denotes the particular realization of the travel time over arc (i,j) ∈ A in a scenario ω∈Ω. In this way, we intrinsically cater for delay propagation, unlike <cit.>. In this context, the TWATSP-ST makes two inter-dependent, a priori decisions: i) A vehicle route visiting all customers in V^+, starting and ending at the depot, and ii) a time window assignment [t^s_i,t^e_i] for each customer i∈ V^+. The objective of the TWATSP-ST is to minimize a weighted sum of expected earliness and lateness at the assigned time windows, the width of the assigned time window, the expected shift overtime of the vehicle, and the total distance the vehicle travels. We encode the routing decision with variables x_ij∈{0, 1} for all (i,j) ∈ A. Together with the time window assignment variables t^s_i, t^e_i ≥ 0, these form the first-stage decisions in the TWATSP-ST. After realization of uncertainty, for each scenario ω∈Ω, we can determine for each customer i ∈ V^+ the departure time w_i(ω), the earliness e_i(ω) and the lateness l_i(ω) relative to the assigned time window [t_i^s, t_i^e], and the shift overtime o(ω) relative to the shift duration length T. Then, we formulate the TWATSP-ST as the following two-stage stochastic mixed-integer program with continuous recourse. min ∑_i ∈ V∑_j ∈ V∖{i}d_ijx_ij + ∑_j ∈ V^+φ(t_i^e-t_i^s) + ∑_ω∈Ωp(ω)Q(x,t^s,t^e,ω) s.t. ∑_i ∈ V∖{j}x_ij = ∑_i ∈ V∖{j}x_ji = 1 ∀ j ∈ V, x_ii = 0 ∀ i ∈ V, ∑_i∈ S∑_j ∉ S x_ij≥ 1 S ⊆ V, 1≤ \|S\| ≤ \|V^+\|, t_i^e-t_i^s ≥ s_i ∀ i ∈ V^+, x_ij∈{0,1} ∀ i ∈ V, j ∈ V, t_i^e, t_i^s ∈ℝ_+ ∀ i ∈ V^+. Here, φ≥ 0 is an exogenously set weight factor. Constraints (<ref>) and (<ref>) ensure that the vehicle visits each customer exactly once. Constraints (<ref>) eliminate sub-tours, and constraints (<ref>) ensure that the time window assignment respects the service time at each customer. The recourse function Q(x,t^s,t^e,ω), as part of the Objective (<ref>), gives the value of the expected cost of the incurred earliness and lateness cost associated with the time window assignment and the expected shift overtime cost. Q(x, t^s, t^e,ω):= min ∑_j ∈ V^+ϕ( e_j(ω) +l_j(ω)) + ψ o(ω) s.t. w_j(ω)≥ w_i(ω) + t_ij(ω) + s_j - (1-x_ij)M ∀ i ∈ V, j ∈ V, e_j(ω) ≥ w_i(ω) +t_ij(ω)-t_i^s - (1-x_ij)M ∀ i ∈ V, j ∈ V, l_j(ω) ≥ w_i(ω) +t_ij(ω) + s_j -t_i^e - (1-x_ij)M ∀ i ∈ V, j ∈ V, o(ω) ≥ w_i(ω) +t_i0(ω) -T ∀ i ∈ V^+, w_0(ω) = t_0, w_j(ω),e_j(ω),l_j(ω) ∈ℝ_+ ∀ j ∈ V^+, o(ω) ∈ℝ_+. Here, ψ and ϕ are weight factors for the earliness and lateness concerning the time window assignment and the overtime of the vehicle, respectively. The objective function of the second-stage problem (<ref>) is a function of first-stage variables (x,t^s,t^s) and a realization (or a scenario) of ξ(ω). Constraints (<ref>) - (<ref>) determine departure time, earliness, lateness, and overtime for each scenario. We set M in (<ref>) - (<ref>) equal to the longest total travel time among all scenarios. We require tours to start from the depot at a predetermined time t_0 (Constraints (<ref>)). Constraints (<ref>), (<ref>), (<ref>) and (<ref>) define the variable domain. Model (<ref>) - (<ref>) is a two-stage stochastic mixed-integer program with continuous recourse. We define the master problem of TBDS and the associated cuts in the remainder of this section. §.§ Master Program As stated in Section <ref>, our TBDS method consists of a Master Program (MP) and two (sets) of subproblems SP1 and SP2. We refer the reader to Appendices <ref> and <ref> for the formulation of SP1 and SP2. The MP for the TWATSP-ST is given by: (MP) : min ∑_j ∈ V∑_i ∈ V∖{j}d_ijx_ij + Θ +∑_ω∈Ω_MP^1p(ω)(∑_j ∈ V^+ϕ( e_j(ω) +l_j(ω)) + ψ o(ω)) s.t. ∑_i ∈ V∖{j}x_ij = ∑_i ∈ V∖{j}x_ji = 1 ∀ j ∈ V , x_ii = 0 ∀ i ∈ V, ∑_i∈ S∑_j ∉ S x_ij≥ 1 S ⊆ V, 1≤ \|S\| ≤ \|V^+\|, t_i^e-t_i^s ≥ s_i ∀ i ∈ V^+, Θ≥∑_j ∈ V^+φ(t_i^e-t_i^s) + ∑_ω∈Ω_SPp(ω) θ(ω), Second-stage Constraints (Ω_MP), ( Aggregated Optimality Cut (Ω_SP))_i, ∀ i ∈ I ( Scenario Optimality Cut (Ω_SP))_j, ∀ j ∈ J ( Feasibility Cut (Ω_SP) )_k, ∀ k ∈ K x_ij∈{0,1} ∀ i ∈ V, j ∈ V, t_i^e, t_i^s ∈ℝ_+ ∀ i ∈ V^+ , e_i(ω), l_i(ω) ∈ℝ_+ ∀ i ∈ V^+, ω∈Ω_MP^1, o(ω) ∈ℝ_+ ∀ω∈Ω_MP^1, Θ∈ℝ, θ(ω) ∈ℝ ∀ ω∈Ω_SP. Here Θ (and θ(ω)) provide a lower bound on the expected second-stage cost and the time window assignment cost. Constraints (<ref>)-(<ref>), (<ref>)-(<ref>) are the first-stage constraints. The scenario set Ω_SP in constraint (<ref>) is formed as detailed in Section <ref>. For the scenarios ω∈Ω_MP, second-stage constraints (<ref>)-(<ref>) are included in the MP. Constraint (<ref>) is the Subproblem-Connectivity Constraint. The optimality and feasibility cuts (<ref>)-(<ref>) are made specific in the next subsection. §.§ Cuts In line with Section <ref>, we define a subproblem SP1 taking as input the binary first-stage decisions, i.e., the routing decision in the TWATSP-ST. The second series of subproblems SP2 for each scenario ω∈Ω_SP are then obtained via the two-step decomposition as outlined in Section <ref>, i.e., as input we take the binary first-stage decisions and solution of the time window assignment variables after solving SP1. For completeness, we provide the formulation of SP1 for the TWATSP-ST in Appendix <ref>. §.§.§ Aggregated Optimality Cut. For a given solution x^ of MP that is feasible for SP1, let (λ^1,λ^2,λ^3, μ^, ν^* , π^) indicate the values of dual multipliers in SP1; then, Θ≥ ∑_ω∈Ω_SP∑_i,j ∈ V( (λ^1_ij(ω) + λ^3_ij(ω)) (t_ij(ω) + s_j - (1-x_ij)M)+ λ^2_ij(ω)(t_ij(ω)- (1-x_ij)M) ) +∑_ω∈Ω_SP∑_i ∈ V^+( π^(ω) t_0 + μ^_i(ω) (t_i0(ω) -T))+ ∑_i ∈ V^+ν^_i s_i is the Aggregated Optimality Cut for MP. For the second step of our decomposition, we formulate SP2 as detailed in Section <ref>. It takes the routing decisions from MP and time window assignments from SP1 as input. Recall SP2 is given in Appendix <ref>. Via the auxiliary decision variable θ(ω) we approximate the cost function of each scenario ω∈Ω_SP (or the objective function value of each SP2). §.§.§ Feasibility Cuts. If the solution x^ of MP is infeasible for SP1, we generate the feasibility cut 0 ≥1^Tϵ̅+ (x-z)^Tλ^* where ϵ̅ and z̅ are the optimal values of the ϵ and z variables in the feasibility problem in Appendix <ref>. λ^* is the value of the associated dual variable. §.§.§ Scenario Optimality Cuts. For a given feasible solution (x^, t^s, t^e), for ω∈Ω_SP, let (z̅, q̅^s, q̅^e, e, l, o) be the optimal solution of SP2 and (β, λ, η) indicate the values of the dual multipliers related to first-stage variables; then, θ(ω) ≥∑_j ∈ V^+(ϕ( e_j(ω) +l_j(ω)) + ψo(ω)+ λ_j(t_i^s- q̅_j^s) + η_j(t_j^e- q̅_j^e) ) + ∑_i ∈ V∑_j ∈ Vβ_ij(x_ij-z̅_ij) is the Scenario Optimality Cut for ω∈Ω_SP for MP. §.§.§ Strengthened Scenario Optimality Cuts. For a feasible fractional MP solution (x^, t^s, t^e), we update the cut (<ref>) by acquiring the following Lagrangian dual problem of SP2 with the objective function max_β, λ, η min∑_i ∈ V∑_j ∈ Vβ(x^_ij - z_ij) + λ_i(t_i^s- q_i^s) + η_i(t_i^e- q_i^e)+ ∑_j ∈ V^+ϕ( e_j(ω) + l_j(ω)) +ψ o(ω). Given (x^,t^s,t^e) and (β, λ, η), let (z̅, q̅^s, q̅^e, e, l, o) be the optimal solution of the Lagrangian dual problem for ω∈Ω_SP; then, θ(ω) ≥∑_j ∈ V^+(ϕ( e_j(ω) +l_j(ω)) + ψo(ω)+ λ_j(t_i^s- q̅_j^s) + η_j(t_j^e- q̅_j^e) ) + ∑_i ∈ V∑_j ∈ Vβ_ij(x_ij-z̅_ij) is a valid strengthened optimality cut for the MP. § PERFORMANCE OF TBDS We show the performance of the Two-Step Benders Decomposition with Scenario Clustering (TBDS) method by solving the Time Window Assignment Traveling Salesperson Problem with Stochastic Travel Times (TWATSP-ST). We develop six variants of TBDS to assess and structurally benchmark the two main novelties of TBDS: the guided selection of scenarios in the master problem and the two-step decomposition of binary and linear first-stage variables. The six considered variants are: * BD uses strengthened optimality cuts and a standard decomposition over scenarios, leading to Benders dual decomposition, as introduced by <cit.>. * TBD extends BD by including the decomposition over the integer and linear first-stage variables. This variant tests the impact of our two-step first-stage decomposition compared with Benders dual decomposition. * BDP extends BD by including the first-stage constraints on the master problem of randomly chosen scenarios and artificial scenarios. This variant combines partial Benders decomposition <cit.> with Benders dual decomposition. * TBDP extends BDP by including the two-step first-stage decomposition. * BDS extends BDP by including the guided selection of scenarios in the master program. * TBDS extends BDS by including the two-step first-stage decomposition. This is our TBDS method as presented in Section <ref>. We evaluate the performance of the variants on a new set of benchmark instances introduced in Section <ref>. We carefully optimize the hyperparameters associated with the different variants, as detailed in Section <ref>. To measure the effectiveness of the proposed variants, we first compare the quality of the root node lower and upper bounds in Section <ref>. We continue by showcasing the full performance of the variants in Section <ref>, the convergence behavior of our method by conducting an overall branch-and-cut search and comparing the performance of the six variants for benchmark purposes. Finally, we provide insights into the optimal solution structure and the value of the stochastic solution. We derive managerial insights useful for practitioners in Section <ref>. §.§ Benchmark Instances We adapt benchmark instances from the literature to our problem setting, generating 126 new benchmark instances. Specifically, we derive 56 instances with clustered customer locations based on single vehicle routes from Solomon's VRPTW-RC instances proposed by <cit.> and 70 instances from <cit.>, which include not only the customer locations but also the associated service times. We refer to these as rc_ and n_w_ instances, respectively. The end of the depot's time window defines the shift length. All instances and associated solutions are included as supplementary material to the submission. To balance the four penalty terms in the objective function and make them directly comparable concerning the routing cost for most problem instances, we used penalty weights of ϕ=3 and φ=1 to penalize expected delay/earliness and time window width at customer i ∈ V^+, respectively. Comparably to <cit.>, we set the penalty for expected shift overtime to ψ=4. We conduct a Sample Average Approximation analysis to determine the number of scenarios to correctly represent uncertainty, considering our routing solutions' stability as the number of customers in the instances increases. This results in 100 scenarios, which we use throughout all experiments. We follow a similar approach for generating random travel times as <cit.> and <cit.>. For each scenario, we determine the travel time t_ij for arc (i,j) ∈ A by adding a random disruption parameter δ_ij to the Euclidean distance d_ij. To model realistic travel times and disruptions, we assume a Gamma-distributed disruption parameter with shape k and scale θ_ij depending on the distance and a coefficient of variation cov = 0.25. We define η = 0.35 as a congestion level, representing the expected increase in travel time after a disruption occurs, i.e., 𝔼[δ_ij] = η d_ij. We assume δ_ij∼ G(k,θ_ij), resulting in 𝔼[δ_ij] = kθ_ij = η d_ij, Var(δ_ij) = kθ_ij^2. Here, parameters k and θ_ij are set according to k = 1cov^2, θ_ij = η d_ijcov^2 §.§ Parameter Settings and Implementation Details The master problem (<ref>) - (<ref>) contains both a set of selected scenarios from Ω and some artificial scenarios created based on Ω. Section <ref> explains in detail how to select scenarios and create artificial scenarios. The performance of our method depends on the number of scenarios added to the master program. By varying the fraction of scenarios added to the master program between 5%, 10% and 15%, we evaluate the performance of the methods BDP, TBDP, BDS, and TBDS under different scenario selection strategies. The results presented for the aforementioned methods are obtained by selecting the best combination of scenario levels, corresponding to the highest number of solved instances in each method. We embed all methods in a branch-and-cut framework. We only add Benders cuts (<ref>) - (<ref>) at the root node and upon discovery of a possible incumbent solution. Subtour elimination constraints are included dynamically. All algorithms are coded in Python 3.9.7 in combination with Gurobi 9.5.1. The experiments are run on a virtual machine with 64 GB RAM under the Linux operating system, which was sufficient for all experiments. All algorithms have a time limit of three hours. §.§ Performance of TBDS at the Root Node Table <ref> and <ref> compare lower bounds (LB), upper bounds (UB), and root node gaps of the six TBDS variants (BD, TBD, BDP, TBDP, BDS, TBDS) for different instance sizes (10, 13, 15, 18, 20, 23, 25), listed in the first column. The number of instances solved with different customer numbers and the average lower and upper bound value for both benchmark sets is reported in Tables <ref> and <ref>. The Root Node Gap is computed as ((UB-LB)/LB)× 100) and gives the relative difference between lower and upper bound at the root node. The lower and upper bound information is obtained as the root node within the evaluation of the full branch-and-cut algorithm after the first branching decision, which partly depends on the procedures embedded within Gurobi. Comparing the results in Tables <ref> and <ref>, a few observations stand out. First, comparing TBD to BD, the upper bounds in TBD decrease substantially, with a reduction of 83.1% and 90.9% compared to BD for the n_w_ and rc_ instances, respectively. Second, the concept of partial Benders decomposition helps to tighten the lower bound at the root node, i.e., comparing BDP and TBDP with BD and TBD. It alleviates the primal inefficiencies with redundant solutions in early iterations of the BD and TBD methods. The addition of any scenarios improves the lower and upper bound on average by 19.8% and 72.5% over the n_w_ instances, respectively. For the rc_ instances, the lower bound improves on average by 12.3% with the addition of any scenarios. Similarly, the upper bound decrease by 46.6% for the rc_ instances. We observe the benefit of choosing scenarios with clustering as it tightens the lower bound on average by 32.6% for n_w_ instances and 5.6% for rc_ instances comparing the BDS and TBDS methods to the BDP and TBDP methods. Comparing TBDP with TBDS, we see that in TBDS, on average, the lower bound increases by 22.5%, and the upper bound decreases by 35.5%. As the number of customers increases in both instances, the benefits gained from scenario clustering and the two-step decomposition become more pronounced, although the root gap remains high. In the next section, we will analyze the impact of these findings on computational effort within the full branch-and-cut procedure. §.§ Overall Performance of TBDS We continue by analyzing the overall performance of the six TBDS variants on our benchmark instances. Our proposed solution approach, TBDS, solves up to 25 customers in both sets of benchmark instances. Looking to the total number of solved instances within the time limit displayed in Figure <ref>, it is evident that the variants with two-step decomposition outperform the variants without two-step decomposition. Specifically, TBDS solved 90.0% and 85.7% of instances in both benchmark sets to optimality, while BDS only solved 28.6% and 26.8% of instances. In contrast, BD failed to solve any instance, and TBD only solved up to 5.7% and 3.6% of all instances. The BDP and TBDP variants were able to solve between 21.4% and 48.3% of all benchmark instances. The significant increase in performance of TBDS can be attributed to the use of smart clustering and the two-step decomposition over continuous and binary first-stage variables. Tables <ref> and <ref> provide detailed results for each benchmark set. Noting that the BD variant fails to solve any instance within the 3 hours time limit, the computational time of solved instances in the variants without the two-step decomposition ranges between 127.8 minutes and 149.5 minutes. We see a clear decrease in computational time ranging between 73.2 and 99.7 minutes in the variants with the two-step decomposition. Comparing BD, BDP and BDS, the average optimality gap of non-solved instances decreases significantly. Among variants without two-step decomposition, the average optimality gap decreases from 58.5% to 36.6% to 15.8%. Similarly, with the variants with two-step decomposition, we see that the average optimality gap decreases from 30.5% to 5.8%. The results clearly show that our TBDS outperforms the state-of-the-art, as it solves more instances to optimality and obtains smaller optimality gaps for the instances unable to solve optimally. Essential is the combination of the two main ideas of TBDS, i.e., the two-step decomposition and the guided selection of representative scenarios. §.§ Managerial Insights This section assesses the value of integrating time window assignment and routing decisions and provides insights into the structure of the optimal stochastic solutions. To do so, we fix different routing decisions and time window assignments, as well as both first-stage variables, and analyze the resulting solution costs. Further, we conduct analysis on the value of stochastic solution. Our insights quantify the benefits of optimizing routing and time window assignments simultaneously (Insight <ref>), assigning customer-specific time windows (Insight <ref>) and considering stochasticity in optimizing routing and time window assignment (Insights <ref> and <ref>). Simultaneously optimizing time windows and routing decreases the expected time window exceedance by 73.0% and reduces the width of assigned time windows by 6.9% while routing costs only increase slightly (5.2%). Tables <ref> and <ref> summarize the routing decisions and associated costs for various instance sizes (10, 13, 15, 18, 20), considering three solution types. The Mean Value Problem (MVP) solution is obtained by optimizing both routing and time window assignment assuming travel times follow their expectation. The routing solution obtained is then fixed and used as input in our model subject to all scenarios. The Traveling Salesperson Solution (TSP) simply fixes the routing according to the shortest tour and uses this as input in our model subject to all scenarios. The Stochastic Solution (SS) is the optimal solution to the TWATSP-ST as defined before. The column Routing Cost gives the resulting routing cost, the column TWA Cost presents the time window assignment cost, and column Recourse Cost the second-stage costs. Our analysis reveals that even small variations in routing decisions yield significant reductions in both time window width and recourse costs. Moreover, the TSP solution performs poorly in the second stage, particularly as the number of customers increases. That suggests that wider time window assignments do not necessarily result in better performance in the second stage. With more customers, the stochastic solution's cost advantage over MVP and TSP solutions becomes more pronounced. The flexibility to vary the time window width among the customers in the tour decreases the total time window width by 18.7% and decreases total cost by 7.8% on average. 67.2% of customers receive narrower time windows compared to assigning only fixed-width ones. Table <ref> shows that for small instances with 10 to 13 customers, we compare fixed time window widths (called FTWAS) with the stochastic solution. The FTWAS policy fixes the time window width to the mean of the time window assignments in the stochastic solution. The associated costs are reported in Table <ref>. Customers receive at most 11.7% wider time windows and at least 7.3% narrower time windows than the fixed time windows. The results highlight the importance of assigning time windows individually rather than providing the same interval for every customer. Incorporating travel time uncertainty into the optimization of routing and time window assignments decreases costs by 5.7%. This benefit stems from improving on-time delivery by 51.8% at the expense of a 3.3% increase in routing cost and 14.6% wider time windows. Tables <ref> and <ref> show the routing, time window assignment, second-stage and total cost of expected mean value problem (EMVP) solution and stochastic solution (SS) for different instances. The EMVP is obtained by considering only a single scenario representing the expected travel times and afterwards evaluating this solution on each of the scenarios. The difference between SS and EMVP gives the value of the stochastic solution (VSS). Our results indicate that incorporating different travel time scenarios into decision-making – through the use of SS – results in an average VSS of 8.1% and 4.3% for nw and rc instances, respectively. Additionally, our analysis reveals that a slight increase in routing cost and wider time window assignments leads to better performance in terms of on-time delivery in the second stage. Optimal routes often exhibit an alternating pattern in time window width and variance of incoming arcs. As such, the optimal solution hedges for time window violations with buffer times distributed throughout the route. We further analyze the nature of routing and time window assignment solutions generated by TBDS. We observe that optimal routes exhibit a zigzag pattern with high variations and large time windows alternating with smaller variations and smaller time windows. Figure <ref> shows the variance of the travel time of arcs within the optimal routing sequence for n_w_ and rc_ instances with 18 customers. Similarly, Figure <ref> provides the optimal width of the time windows. An orange line highlights an example instance to illustrate the pattern more clearly. As expected, customers reached using arcs with high variance receive wider time windows. As such, the model immediately hedges for delays. The optimal solution combines risky and less risky choices. Like this, delays do not propagate too severely through the route. Observing – or constructing and utilizing – these alternating patterns is impossible with current heuristics, which ignore delay propagation. The time windows are more evenly distributed in the nw_ instances than in the rc_ (see Figure <ref>), indicating a balance between risky and non-risky customer choices. This pattern also explains Insights <ref> and <ref>. § CONCLUSIONS We present a new method called Two-Step Benders Decomposition with Scenario Clustering (TBDS) for solving two-stage stochastic mixed-integer programs. Our method combines and generalizes the recent advancements in Benders decomposition and scenario clustering techniques. Our TBDS method introduces a novel two-step decomposition strategy for the binary and continuous first-stage variables, resulting in improved continuous first-stage solutions while generating optimality cuts. This two-step decomposition approach leads to high-quality initial first-stage solutions, effectively reducing unnecessary iterations that typically occur in current state-of-the-art Benders decomposition approaches. Consequently, it enhances computational efficiency by facilitating faster convergence. The second key contribution of TBDS is incorporating clustered scenarios into the master program, which is, to the best of the authors' knowledge, the first time that such scenario clustering techniques and state-of-the-art Benders decomposition approaches are combined. By clustering the scenarios, we improve the linear programming (LP) relaxation of the master problem, obtaining superior lower bounds in the early iterations. By combining these two essential elements (i.e., the two-step decomposition and the scenario clustering), our method achieves consistently tighter bounds at the root node and produces higher quality incumbent solutions compared to state-of-the-art approaches in the extant literature, including Benders dual decomposition and partial Benders decomposition. Specifically, these methods can be considered special cases of TBDS. We use TBDS to solve the Time Window Assignment Problem with Stochastic Travel Times (TWATSP-ST), a challenging combinatorial problem formulated as a two-stage stochastic mixed-integer program with continuous recourse for which no efficient exact solution methods exist yet. Extensive experimental results demonstrate the effectiveness of TBDS. Our method solves more instances to optimality, and significantly better lower and upper bounds are obtained for the instances not solved to optimality. In particular, TBDS achieves optimality for 87.9% of the instances in our benchmark set, surpassing other benchmark algorithms that can solve at most 47% of the instances. This showcases the superior performance and efficiency of our TBDS method in handling TWATSP-ST. Furthermore, our study reveals that the simultaneous optimization of time windows and routing leads to a noteworthy 12.8% improvement in total costs while incurring only a minor increase in routing costs. Allowing different time window lengths enables hedging against high variances encountered throughout the route. As a result, our method produces shorter routes with fewer time window violations, contributing to the overall cost reduction. In future studies, the alternating pattern of high and low variance arcs traveled, as observed in the structure of the optimal solution, can serve as a foundation for developing efficient heuristics tailored specifically for the TWATSP-ST. Additionally, evaluating our algorithm on extended versions of the vehicle routing problem, such as the capacitated vehicle routing problem and the multi-depot vehicle routing problem, can offer valuable insights into the versatility and applicability of our TBDS method in diverse real-world scenarios. From a methodological perspective, we envision that the problem-specific selection of representative scenarios in combination with Benders decomposition approaches can be the start of several new research lines. For instance, using supervised learning to predict which scenarios to label as representative based on instance-specific information such as vehicle information and customer locations seems promising. Especially for applications with limited information, it would be valuable to research how well such predictions translate to slightly different settings. Alternatively, methods other than those in TBDS can be developed and tested for generating representative scenarios. Albert H. Schrotenboer has received support from the Dutch Science Foundation (NWO) through grant VI.Veni.211E.043 informs2014trsc § MIXED-INTEGER PROGRAM FOR MINIMIZING THE CLUSTERING ERROR min 1\|Ω\|∑_i ∈Ω t_i s.t. t_j≥∑_i ∈Ωσ_ijV_ji - ∑_i ∈Ωσ_ijV_jj, ∀ j ∈Ω, t_j≥∑_i ∈Ωσ_ijV_jj - ∑_i∈Ωσ_ijV_ji, ∀ j ∈Ω, σ_ij≤ u_j, σ_jj = u_j ∀ (i,j) ∈Ω×Ω, ∑_j∈Ωσ_ij = 1, ∑_j∈Ω u_j = K ∀ i ∈Ω, σ_ij∈{0,1}, u_j ∈{0,1}, t_i∈ℝ_+ ∀ (i,j) ∈Ω×Ω. We define binary variable u_j to determine if a scenario j ∈Ω is picked as a cluster representative and another binary variable σ_ij to identify scenario i ∈Ω if it is in the cluster with representative scenario j ∈Ω. Constraint (<ref>)-(<ref>) linearize the equation (<ref>). Constraint (<ref>) and (<ref>) ensure that we construct K non empty clusters that contains a representative scenario. § SP1 FOR THE TWATSP-ST For a feasible solution x^, SP1 for TWATSP-ST is formulated as follows: SP1(x^) = min ∑_j ∈ V^+φ(t_i^e-t_i^s) + ∑_ω∈Ω_SPp_ω(∑_j ∈ V^+ϕ( e_j(ω) + l_j(ω)) +ψ o(ω) ) s.t. w_j(ω) ≥ w_i(ω) + t_ij(ω) + s_j - (1-x^_ij)M ∀ i ∈ V, j ∈ V, ω∈Ω_SP, [λ^1] e_j(ω) ≥ w_i(ω) +t_ij(ω)-t_i^s- (1-x^_ij)M ∀ i ∈ V, j ∈ V, ω∈Ω_SP, [λ^2] l_j(ω) ≥ w_i(ω) +t_ij(ω) + s_j -t_i^e- (1-x^_ij)M ∀ i ∈ V, j ∈ V, ω∈Ω_SP, [λ^3] o(ω) ≥ w_i(ω) +t_i0(ω) -T ∀ i ∈ V^+, ω∈Ω_SP, [μ] t_i^e-t_i^s ≥ s_i ∀ i ∈ V^+, [ν] w_0(ω) = t_0 ∀ω∈Ω_SP, [π] t_i^s, t_i^e ∈ℝ_+ ∀ i ∈ V^+, w_i(ω), e_i(ω), l_i(ω) ∈ℝ_+ ∀ i ∈ V, ω∈Ω_SP, o(ω) ∈ℝ_+ ∀ω∈Ω_SP. Let the letters next to each constraint in the SP1 be a dual variable associated with the corresponding constraint. § SP2 FOR THE TWATSP-ST We define the second set of subproblems SP2(x^,t^s,t^e,ω) for a given feasible solution (x^,t^s,t^e) and ω∈Ω_SP as follows min ∑_j ∈ V^+ϕ( e_j(ω) + l_j(ω)) +ψ o(ω) s.t. ∑_i ∈ V∖{j}z_ij = ∑_i ∈ V∖{j}z_ji = 1 ∀ j ∈ V, z_ii = 0 ∀ i ∈ V, ∑_i∈ S∑_j ∉ S z_ij≥ 1 S ⊆ V, 1≤ \|S\| ≤ \|V^+\|, w_j(ω) ≥ w_i(ω) + t_ij(ω) + s_j - (1-z_ij)M ∀ i ∈ V, j ∈ V, e_j(ω) ≥ w_i(ω) +t_ij(ω)-q_i^s- (1-z_ij)M ∀ i ∈ V, j ∈ V, l_j(ω) ≥ w_i(ω) +t_ij(ω) + s_j -q_i^e- (1-z_ij)M ∀ i ∈ V, j ∈ V, o(ω) ≥ w_i(ω) +t_i0(ω) -T ∀ i ∈ V^+, q_i^e-q_i^s ≥ s_i ∀ i ∈ V^+, w_0(ω) = t_0, z_ij = x^_ij ∀ i ∈ V, j ∈ V, [β] q_i^s = t_i^s* ∀ i ∈ V^+, [λ] q_i^e = t_i^e* ∀ i ∈ V^+, [η] z_ij∈ℝ_+ ∀ i ∈ V, j ∈ V, q_i^s, q_i^e∈ℝ_+ ∀ i ∈ V^+, w_i(ω), e_i(ω), l_i(ω) ∈ℝ_+ ∀ i ∈ V, o(ω) ∈ℝ_+. § FEASIBILITY PROBLEM FOR TWATSP-ST For infeasible x^* solution for SP1, we solve the following feasibility problem for ω∈Ω_SP. min 1^T(ϵ^1 + ϵ^2 + ϵ^3) s.t. ∑_i ∈ V∖{j}z_ij = ∑_i ∈ V∖{j}z_ji = 1 ∀ j ∈ V, z_ii = 0 ∀ i ∈ V, ∑_i∈ S∑_j ∉ S z_ij≥ 1 S ⊆ V, 1≤ \|S\| ≤ \|V^+\|, w_j(ω) + ϵ^1 ≥ w_i(ω) + t_ij(ω) + s_j - (1-z_ij)M ∀ i ∈ V, j ∈ V, ω∈Ω_SP, e_j(ω) + ϵ^2 ≥ w_i(ω) +t_ij(ω)-q_i^s- (1-z_ij)M ∀ i ∈ V, j ∈ V, ω∈Ω_SP, l_j(ω) + ϵ^3 ≥ w_i(ω) +t_ij(ω) + s_j -q_i^e- (1-z_ij)M ∀ i ∈ V, j ∈ V, ω∈Ω_SP, o(ω) ≥ w_i(ω) +t_i0(ω) -T ∀ i ∈ V^+, ω∈Ω_SP, q_i^e-q_i^s ≥ s_i ∀ i ∈ V^+, w_0(ω) = t_0 ∀ω∈Ω_SP, z_ij = x^_ij ∀ i ∈ V, j ∈ V, [λ] q_i^s = t_i^s ∀ i ∈ V^+, q_i^e = t_i^e* ∀ i ∈ V^+, z_ij∈ℝ_+ ∀ i ∈ V, j ∈ V, q_i^s, q_i^e∈ℝ_+ ∀ i ∈ V^+, w_i(ω), e_i(ω), l_i(ω) ∈ℝ_+ ∀ i ∈ V, ω∈Ω_SP, o(ω) ∈ℝ_+ .
http://arxiv.org/abs/2306.13675v1	20230620172250	Intersectionality and Testimonial Injustice in Medical Records	[ "Kenya S. Andrews", "Bhuvani Shah", "Lu Cheng" ]	cs.CY	[ "cs.CY", "cs.LG" ]	DecodingTrust: A Comprehensive Assessment of Trustworthiness in GPT Models Boxin Wang^1 Lead authors. Correspondence to: Boxin Wang mailto:[email protected] , Bo Li mailto:[email protected] , Weixin Chen^1, Hengzhi Pei^1, Chulin Xie^1, Mintong Kang^1, Chenhui Zhang^1, Chejian Xu^1, Zidi Xiong^1, Ritik Dutta^1, Rylan Schaeffer^2, Sang T. Truong^2, Simran Arora^2, Mantas Mazeika^1, Dan Hendrycks^3,4, Zinan Lin^5, Yu Cheng^5, Sanmi Koyejo^2, Dawn Song^3, Bo Li^1 ^1University of Illinois at Urbana-Champaign ^2Stanford University ^3University of California, Berkeley ^4Center for AI Safety ^5Microsoft Corporation July 31, 2023 =============================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================================== Detecting testimonial injustice is an essential element of addressing inequities and promoting inclusive healthcare practices, many of which are life-critical. However, using a single demographic factor to detect testimonial injustice does not fully encompass the nuanced identities that contribute to a patient's experience. Further, some injustices may only be evident when examining the nuances that arise through the lens of intersectionality. Ignoring such injustices can result in poor quality of care or life-endangering events. Thus, considering intersectionality could result in more accurate classifications and just decisions. To illustrate this, we use real-world medical data to determine whether medical records exhibit words that could lead to testimonial injustice, employ fairness metrics (e.g. demographic parity, differential intersectional fairness, and subgroup fairness) to assess the severity to which subgroups are experiencing testimonial injustice, and analyze how the intersectionality of demographic features (e.g. gender and race) make a difference in uncovering testimonial injustice. From our analysis, we found that with intersectionality we can better see disparities in how subgroups are treated and there are differences in how someone is treated based on the intersection of their demographic attributes. This has not been previously studied in clinical records, nor has it been proven through empirical study. § INTRODUCTION In medical settings, decisions can have life-critical consequences <cit.>, making it essential to ensure that machine learning tools use there are fair. This fairness is often measured with common fairness metrics such as demographic parity <cit.> and equal opportunity <cit.>. However, these tools do not consider the intersectionality of the subjects under consideration <cit.>. That is, by focusing solely on factors such as race, gender, or socioeconomic status, we ignore the nuances related to individuals with unique experiences shaped by having multiple features sensitive to marginalization. We theorize that how various aspects of an individual intersect and contribute to their experiences, via intersectionality, could make instances of injustice more overt - and in some cases may be the sole approach for identifying such instances. Intersectionality recognizes that power relations based on factors such as race, class, and gender are not mutually exclusive and can interact with each other, affecting all aspects of the social world <cit.>. Therefore, it is important to consider intersectionality when evaluating the fairness of machine learning tools in medical settings. In clinical settings, it is particularly important that care providers (e.g. physicians) properly acknowledge what their patients are hoping to convey to them in a way that does not diminish what the patient is saying. Moreover, it is imperative for care providers to accurately relay their understanding of their patients' experiences, as others will be dependent upon their previous understandings and evaluations, often recorded in notes, to assist with overseeing and providing care for that patient <cit.>. We have seen that when this does not occur, there are higher instances of death amongst certain marginalized groups <cit.>. With the rise in using machine learning tools to help make decisions on medical plans and treatments, who often only interact with the notes provided to them and not the actual patient, it is vital they are able to properly see patients. This visibility should be clear despite previous attempts at burying their words behind instances of injustices which hides them as a speaker. Here, we focus on a particular form of injustice - testimonial injustice. Testimonial injustice occurs when someone is assigned less credibility due to prejudices about them <cit.>. The aim of our study is to examine how testimonial injustice in medical records is affected by the intersectionality of gender and race. These two observable attributes have historically led to marginalization in various societal settings, such as education <cit.>, housing <cit.>, and healthcare <cit.>. In fact, some forms of marginalization may only be evident in those with multiple marginalized identities - for instance, a Black police woman may not experience the same level of power and privilege as a White male police officer <cit.>. Neglecting to consider the various contributing identities of an individual may further marginalize them. Therefore, it is important to consider intersectionality when identifying and addressing injustices in order to result in more accurate classifications and decisions. There has been a small amount of work done to understand testimonial injustice in medical records and to our knowledge no prior work on how intersectionality might affect the emergence of testimonial injustice, even in life-critical medical settings. This motivates our contributions to this work: (1) The importance of intersectionality has been spoken about but has not been shown before (particularly in the medical setting). Thus, we perform an empirical study to show there is a difference in how subgroups are treated in medical settings, but this can only be revealed in intersectional views. (2) Practitioners continue to use singular-feature fairness metrics in medical settings. Thus, we provide proof that we should not be using these metrics to detect instances of injustice. This proof has not been provided before, not even in medical settings. Thus, we (3) perform an empirical study to show traditional fairness metrics (i.e. demographic parity) are inefficient when judging people's experiences in healthcare because they produce different results when the entirety of a person is considered. (4) Lastly, not all metrics fit each situation - even in similar settings. Therefore, we analyze if different intersectional fairness metrics might reveal differences in how we recognize intersectionality. Previous studies have shown that both Black patients and female patients are more likely to experience testimonial injustice in the medical field, as evidenced by the use of biased language in their records <cit.>. However, these studies have not examined the specific impact of intersectionality, or how being simultaneously Black and female might affect testimonial injustice. Our work seeks to address this gap by examining the impact of the intersection of ethnicity (Black, Asian, Latino, and White) and gender (Male and Female - though we acknowledge in modern society, there is recognition of genders beyond the traditional binary options, the dataset used here only includes these two genders) on testimonial injustice in medical records. § RELATED WORKS Despite the increased use of machine learning tools and a growing focus on intersectionality in the medical community <cit.>, there have been limited efforts to understand how intersectionality can impact outcomes in medical settings. Since various healthcare professionals rely on medical records to make treatment decisions and give proper care, it is crucial that such records are written appropriately <cit.>. The authors of <cit.> found that even when race is removed from patients' records, models could detect the race of the patient - even when humans could not. Furthermore, they discovered that models trained on these records (i.e. which race has been removed from) still maintain biases in treatment recommendations. Though they only remove race in their work, this further affirms that there are differences in how patients are spoken about in their records based on demographic features, emphasizing the need to study what can occur if we look at multiple demographic features as we do here. In their work, explored how stigmatizing language in a patient's medical record can shape the attitudes of physicians-in-training towards the patient and their clinical decision-making. They found that stigmatizing language is associated with more negative attitudes and less aggressive pain management. Building on this work, we examine words that may indicate testimonial injustice, which occurs when someone's statements are diminished due to stereotypes or prejudices about them <cit.>. It is therefore important to identify instances of stigmatizing language in medical records and take steps to prevent them from occurring as emphasized by . In <cit.>, the authors use a lexicon look-up to identify testimonial injustice in medical records, analyzing the use of quotation marks, evidential words, and judgmental words in the records of male and female patients who are Black or White. We expand their work, including words that are negative and commonly used stigmatizing words in medical settings. We exclude the search for quotation marks, acknowledging that direct quotations may give rise to uncertainty by suggesting that the statement in question constitutes not a fact, but rather an assertion <cit.>. However, we believe that our expanded lexicon will help to identify instances of testimonial injustice. Further in contrast to , we consider the records of Black, White, Asian, and Latino patients, exploring how testimonial injustice may differ across the intersection of their identities with gender. The authors found that Black and female patients are most likely to experience testimonial injustice, highlighting the need to examine how different intersectional identities impact experiences of testimonial injustice in medical settings. Previous research has examined the presence of epistemological bias in medical records based on sensitive attributes to detect instances of experiences injustice i.e. disparate treatment. studied diabetic patients and found that non-Hispanic Black patients were more likely to have stigmatizing language included in their notes than non-Hispanic White patients. Similarly, investigated medical records and racial bias, discovering that Black patients had a 2.54 times higher chance of negative descriptors than White patients. These studies suggest that certain demographics may experience differential treatment in medical settings, which may help explain healthcare disparities. However, these works only examined single demographic features, while we seek to investigate their intersection. We anticipate that studying the intersection of groups will more clearly reveal instances of injustice or discrepancies in treatment. The ongoing use of tools that do not consider intersectionality highlights the importance of this research <cit.>. developed a technique to automatically identify intersectional biases from static word embeddings. They found that their model's highest accuracy was for predicting emergent intersectional bias among African American and Mexican American women. This could be attributed to these groups experiencing more overt biases that are easier to detect. This discovery motivates us to further investigate if biases are more prevalent in high-risk settings such as medical settings, especially for individuals from marginalized groups. However, it can be challenging for humans to identify when a bias is occurring since it can be subtle, as highlighted by . Furthermore, doctors may struggle to recognize their own use of words that cause testimonial injustice since they may be unconsciously influenced by their own biases and take them as facts <cit.>. § DATA §.§ MIMIC-III Obtaining medical data has been a standing challenge, largely due to HIPAA requirements and privacy constraints. We use the MIMIC-III <cit.> dataset, which contains features of interest to our experiments: ethnicity/race, gender, patient id, diagnosis, physicians' notes , and so on. This data was collected between 2001-2012 at the Beth Israel Deaconess Medical Center in Boston, MA. The MIMIC-III dataset contains information for 46,146 patients. The distribution of racial groups in the data was highly disproportionate, as shown in Table <ref>. The two genders represented in this dataset, Female and Male, however, are more balanced. We removed ethnicities that were listed as “unknown/not specified", “multi-race ethnicity", “other", “unable to obtain", and “patient declined to answer" since we cannot clearly denote the race of these patients. We also removed patients whose diagnosis was “newborn" since these patients had notes solely stating they were newly born. We did however include the newborns who had other diagnoses. Only 9 of those patients were Caribbean and 38 were Middle Eastern, thus we removed them from the records as well. We were not able to find any duplicate records in the dataset, with a simple python search. After data pre-processing, there are 32,864 patients in total for experimentation. We truncated the MIMIC-III feature 'ethnicity' into 'race' such that all ethnicities are represented as the race often associated with them as labeled in the dataset (e.g. original ethnicity in the dataset: 'ASIAN - VIETNAMESE' was truncated to 'Asian'). For ethnicities that were not associated with a particular race, we searched for how they are commonly associated and relabeled them to the race (e.g. original ethnicity in the dataset: 'SOUTH AMERICAN' was relabeled to 'Latino'). Finally, given that many patients had multiple records, we clustered the patients based on their patient_id and combined their records based on patient_id, gender, race, and diagnosis (e.g. 56327, male, Latino, HYPOTENSION). We then run analysis on the physicians' notes to find terms that are testimonially injust. We analyze the distribution of data for MIMIC-III in <ref>. Our analysis looked at the occurrence of our four types of words associated with testimonial injustice, namely evidential (Figure <ref> and <ref>), judgmental words (Figure <ref> and <ref>), stigmatizing words (Figure <ref> and <ref>), and negative words. We plot the density distribution of each gender, race, and their intersection as normalized sums of these types of words, where the numerator is the frequency of occurrence of the relevant words for that patient and the denominator is the number of records for that patient. We did not include the plots for negative words due to their limited occurrence in the medical notes of this dataset, however we do use them in our analysis of the results for detecting testimonial injustice. Our observations suggests that the confluence of race and gender better helps us in distinguishing instances of testimonial injustice than either race or gender in isolation. In particular, when race and gender are considered independently, males seem to be treated better than females or White patients are treated generally better than Black patients. However, there is nuance in the difference in the treatment of White males and White females as well as Black males and Black females. §.§ Testimonial Injustice Terms In order to assess testimonial injustice in the physicians' notes, we focus on 4 main categories of unjust words: evidential, judgemental, negative, and stigmatizing words that can contribute to someone experiencing testimonial injustice. We use the same evidential and judgmental words from <cit.>. Evidential terms do not endorse a statement but allow it to be agnostic (e.g. “complains", “says", “tells me" and so on). When a physician uses these words, they express dismissing what the patient is actually experiencing. Judgment terms cast doubt on the sayer by the hearer (i.e. the physician) by trying to make their statements sound good or bad (e.g. “apparently", “claims", “insists", and so on). Exacerbated racial and ethnic healthcare disparities have been linked to negative words used to describe Black patients as well <cit.>. Negative words are included in this study as they typically show active rejection or disagreement, e.g. “challenging", “combative", “defensive", “exaggerate", and so on. Clearly, the use of these words expresses assumptions about the patient and could result in a lower quality of care. We also include stigmatizing terms as they are commonly used in medical contexts <cit.>. Stigmatizing terms are rooted in stereotypes or stigmas about a person <cit.> (e.g. “user", “faking", “cheat", and so on). Using stigmatizing terms may alter treatment plans, transmit biases between clinicians, and alienate patients. This lexicon has been proven to consist of words used to diminish specific conditions like diabetes, substance use disorder, and chronic pain <cit.>. All of these conditions are known to disproportionately affect racial minority groups. Using all of these terms in our lexicon lookup <ref> will help us to detect testimonial injustice in these medical records. § METHODS Although all marginalized groups invariably experience some degree of injustice, our aim is to bridge the gap in research by highlighting the disparate treatment of subgroups in medical notes. To achieve this goal, we estimate and compare common metrics across different groups (i.e. Asian men, Asian women, Black men, Black women, Latino men, Latina women, White women, and White men) specifically using demographic parity, differential intersectional fairness, and subgroup fairness. §.§ Normalization To account for patients who had multiple visits or were admitted to the ICU for multiple days, the physicians' notes were combined for each patient's duration in the ICU. To analyze the potential variance in testimonial injustice among different groups, we summed the frequency of testimonial injustice words in the notes for each patient and then normalized this frequency by dividing it by the number of original records we had for that particular patient. This allowed us to ensure that each patient had an equal standing, regardless of length of hospital stay or number of visits from doctors. By using normalized sums, we were able to compare groups and determine if there were any differences in levels of testimonial injustice. The normalized sums of occurrences of testimonial injustice across each intersection of groups are visualized in Figure <ref> in <ref>. §.§ Lexicon Lookup After normalizing the sums of testimonial injustice for each patient, we performed a lexicon lookup for exact phrase matching. With this, we counted the frequency of occurrence for each testimonial injustice word in the patients’ combined and normalized visits. We combined the terms introduced in Section <ref> commonly associated with being evidentially biased, judgmental, negative, and stigmatizing into a lexicon. §.§ Defining Fairness In this work, we define the desired fairness as the following: a patient's record has no terms which are considered testimonial unjust. However, this is a strict boundary that is unlikely to be met since a term could appear in a patient's record but might not actually be casting doubt on them as a sayer (i.e. testimonial injustice). Thus, we find the greatest number of occurrences of each type of term that indicates testimonial injustice, m = max_p(t/r) (where p are the patients). We determine that if a patient has more than m.10 in that particular type of term, they as experiencing testimonial injustice. For this work, we arbitrarily use 10% of the maximum value for each term. In the future, we will do some experimentation to improve this definition of fairness. To determine if there is disparate treatment amongst groups to this fairness definition, we use fairness metrics - demographic parity, differential intersectional fairness, and subgroup fairness. §.§.§ Demographic Parity Demographic parity requires that the difference in two groups being assessed have equal chances of receiving a positive outcome <cit.>. We use this metric as our baseline metric to understand how testimonial injustice might reveal itself if we ignore intersectionality, as has been done with most works in the fairness literature [<cit.>, <cit.>, <cit.>,and so on]. That is, we are seeking to investigate whether there is a significant difference in the way a patient is spoken about in medical records when the intersection of their race and gender are considered. Demographic parity is a popular fairness metric, but it does not work to reveal fairness or justice; rather it solely reveals equity. We can look at the example of when both groups have high amounts of injustice (i.e. true fairness occurs when neither group experiences injustice, nearly 0) hence, fairness is not detected only equality or when a marginalized group should be afforded more opportunity for the sake of corrective justice due to historical bias hence justice is not enforced. In these cases, demographic parity is still satisfied, but fairness nor justice persists. Demographic parity is defined as: P(Y=1\|A=a)/P(Y=1\|A=a') > 0.8, where Y is the outcome and A is the sensitive attribute. Demographic parity looks to ensure the difference between the two groups receiving a positive outcome is greater than 80%. §.§.§ Differential Fairness For intersectionality, we first look at ϵ-Differential fairness <cit.>, which requires that the difference between groups, regardless of their combination of sensitive attributes, not be treated differently within a range. This metric of fairness allows us to include multiple attributes of a person whereas demographic parity only allows us to look at one sensitive attribute per group. Differential fairness is defined as: e^-ϵ < P(M(x)=y\|s_i,θ)/P(M(x)=y\|s_j,θ) < e^ϵ, where ϵ should be small. In our experiments, it is set to 0.01, M is a mechanism (linear regression in our case) that takes an instance, x, from the data to achieve some outcome, y, s values are the cross product of sensitive attributes, and θ is the distribution of x. §.§.§ Subgroup Fairness Another common intersectional fairness notion is Statistical Parity Subgroup Fairness or subgroup fairness. We use subgroup fairness to compare our results with the differential fairness metric. Subgroup fairness <cit.> requires there be no difference in positive outcomes between groups, but we are allowed to ignore an α amount of people. Subgroup fairness is described for each group, a, by: α(a,𝒫)β(a, M, 𝒫) ≤γ , where, α(a,𝒫) = P_𝒫[a(x)=1] β(a, M, 𝒫) = \|P_𝒟, 𝒫[M(x)=1] - P_M, 𝒫[M(x)=1 \| a(x) = 1]\|. Here M is a classifier, 𝒫 is the distribution of patients, γϵ [0,1] indicates the amount of deviation from equity we tolerate. We relax this constraint for our experiments, allowing γ to be 95% of the maximum value of α(a,𝒫)*β(a, M, 𝒫) for each term that leads to testimonial injustice. a(x) = 1 indicates that individuals with sensitive feature, x, are in group a. § RESULTS When examining the results for demographic parity, we solely focus on instances of race or gender, as this approach only allows for an assessment of one factor at a time. However, for differential fairness and subgroup fairness, we conduct an intersectional analysis with race and gender. For these, we look to see which groups have privilege over another, meaning one group experiences less testimonial injustice in their physicians' notes as opposed to the group they are being compared to. §.§ Demographic Parity Gender. In terms of Demographic Parity gender analysis, there was little to no disparate treatment detected across all term types between male and female patients, indicating that there was minimal evidence of injustice in the data based on gender, as observed in Figure <ref>. The greatest difference was found within evidential words, where female patients experienced the most injustice. Then follows the stigmatizing words and judgment words with the greatest bias against females. The least difference comes from the negative words with males experiencing the least fairness. Negative words occurred the least and stigmatizing words occurred the most across the patient records. With this, gender should not be found to be a significant predictor of the treatment or care received by patients. Therefore, the findings of the analysis should show that a person’s gender membership does not have any substantial impact on how they are treated, indicating that the principle of fairness is being upheld. Race. In terms of Demographic Parity race analysis, there was little to no disparate treatment detected across all term types between the different races of patients, indicating that there was minimal evidence of injustice in the data based on race, as observed in Figure <ref>. We observe that Latino patients are the most likely to experience evidential words, while Asian patients were the least likely. Further, for evidential words, White patients have privilege over Black patients, Black patients have privilege over Latino patients, and Asian patients have privilege over White and Latino patients. For judgemental words, Black patients are the most likely, and Asian patients were the least likely to experience judgemental words. Here, we observe that White patients have privilege over Black patients. Latino patients were the most likely and Asian patients were the least likely to experience negative words in their medical records. We note here that negative terms were the least likely to appear in the records of any patient. Black patients were the most likely and Asian patients were the least likely to experience stigmatizing words in their medical records. Another observation is that White patients have privilege over Black patients, Asian patients have privilege over every race of patients, and Latino patients have privilege over White patients. Stigmatizing words occurred the most in everyone's medical records. With this, race should also not be found to be a significant predictor of the treatment or care received by patients. Therefore, the findings of the analysis should show that a person’s racial membership does not have any substantial impact on how they are treated, indicating that the principle of fairness is being upheld. Since our analysis using demographic parity showed that neither race nor gender affect how a patient experiences testimonial injustice, when we observe their intersection, we should see that the treatment and care received by patients are not affected by the intersectionality of race and gender. This would indicate that the principle of fairness is being upheld regardless of a patient's race or gender. However, we see a different story when we consider intersectionality. §.§ Differential Fairness Differential fairness focuses on the intersectionality of race and gender in relation to testimonial injustice. The results of the demographic parity experiments showed, there are no disparities in how groups are treated with respect to testimonial injustice upon race or gender. However, the results of the experiment pertaining to differential fairness show that there are disparities between different intersections of gender and race with respect to the types of terms that lead to testimonial injustice. Specifically, out of 112 comparisons for each intersection of gender and race, 110 violations of differential fairness occurred. This demonstrates that there are underlying injustices occurring in how different groups are treated based on gender and race and that we cannot simply rely on measures that do not consider intersectionality to reveal this. There were very few instances in which fairness was not violated, such as Asian males to Asian females for evidential and judgmental words, and Asian males to Latina females for negative words. The results showed that Asian females and males were the most privileged, and White males and females were the least privileged when fairness was violated. This may be due to the fact that there are many more records for White patients than all other races of patients. As observed in Figure <ref>, across all types of terms that lead to testimonial injustice, Black females were the next least privileged after White patients. Black males were found to have more privilege in experiencing testimonial injustice than Black females. The experiment was also conducted with 500 randomly sampled records of each subgroup of patient, and the results there showed that when unfairness is present, Black females are the most marginalized, and Asian males are the least. For these sampled records, across all types of terms that lead to testimonial injustice, Latina females were the most marginalized for evidential words, Black females for judgment words and negative words, and Latino males for stigmatizing words. However, even with the full dataset, Asian males were consistently found to be the most privileged of all the groups represented. §.§ Subgroup Fairness In this experiment, similar to differential fairness, we focus on the intersectionality of race and gender in relation to testimonial injustice. The results of the demographic parity experiments showed, there were no disparities in how groups were treated with respect to testimonial injustice upon race nor gender. However, the results of the differential fairness experiments showed there are differences in how one is treated based on their race and gender. We conduct an experiment that also looks at intersectionality of groups to compare if there is a difference in how these two metrics reveal disparate treatment amongst the subgroups. Based on our analysis of demographic parity in detecting testimonial injustice in medical records, we found that the privileged groups by race are Asian and White patients, as well as males. Therefore, for the purpose of intersectional fairness analysis, we consider Asian men and White men as non-sensitive groups. When we conducted a differential fairness analysis, we found that violations occurred 110 times out of 112 comparisons (each intersection of gender and race for each type of term leading to testimonial injustice). We expected similar results (Figure <ref>) for subgroup fairness analysis. Our subgroup fairness metric detected 69 violations our of the 112 comparisons of subgroups. Though less occurrences of violations are present, this still reveals we must consider intersectionality within the medical setting and in the fairness metrics we use there. If even better highlights that a metric which considers intersectionality is not enough, but we must be careful at which fairness metrics we use based on the tasks at hand. For evidential terms, we found that Latina females were the most discriminated against, while Asian males were the most privileged. For judgment terms, Black males were the most discriminated against, while Asian males were the most privileged. For negative words, Asian males were the most privileged, while Latino males were the least privileged. For stigmatizing words, Black females were the most discriminated against, while Asian males were again the most privileged. It is important to note that our experiment includes the entire dataset, which is over-representative of White patients. Thus, we can expect even larger disparities in how different groups are treated with a more representative dataset. This does not mean that White patients do not experience discrimination, but rather emphasizes the importance of having a more representative dataset to better understand the degrees to which different groups may experience testimonial injustice in their records. § DISCUSSION When conducting experiments using demographic parity, we compared race or gender. In each case, there were no violations of demographic parity for any patient is treated based on their race or gender alone. If a practitioner takes these results for face value, they might determine there is no form of discrimination happening based on these commonly observed visible attributes. For example, when speaking to a Black male patient who was stigmatized against from the demographic parity view, they would have no evidence in that setting to back their expression of their experience. However, when we look deeper, through the lens of intersectional fairness (i.e., differential fairness and subgroup fairness) at the intersection of race and gender, we can see that a male patient can still experience discrimination (i.e. Black males) and so could a White patient (i.e. White females). When we look at measures that consider intersectionality, we see disparity in how people are treated based on their race and gender for every type of word we analyzed that could lead to testimonial injustice. We attribute this to: (1) being able to consider multiple aspects about a person that might only reveal themselves at the intersection of race and gender, (2) in differential fairness being able to constrain the range in which we look for violations, as opposed to only looking at it from one side as demographic parity does. To properly see injustices occurring, we must look at all angles from which they could possibly be coming from. This is because someone might only be testimonially injust toward a person who is female, others might only act unjustly because of your membership with a historically marginalized race, and so on. We contend that the better metrics to use for detecting injustices, e.g. testimonial injustice, in medical records are ones which consider intersectionality. Still, we see differences in how these measures show which groups are experiencing privilege, thus we must be careful in understanding the goals of the fairness metrics we use. § CONCLUSIONS The objective of this empirical study was to investigate the potential benefits of intersectionality in detecting testimonial injustice, using medical records as a real-world application. Demographic parity, differential intersectional fairness, and subgroup fairness were used to examine whether there are differences in the extent of testimonial injustice experienced by individuals based on the intersection of their demographic attributes and if intersectionality helps reveal this. Our results showed (1) when we allow ourselves to use metrics that consider intersectionality, as opposed to sole factors of who a person is, we can better see disparities in how they are treated in terms of detecting testimonial injustice in medical records, (2) there are differences in how someone is treated based on the intersection of their demographic attributes (3) different intersectional fairness metrics do reveal these injustices differently. While demographic parity did not show a clear disparate impact based on gender or race, differential intersectional fairness and subgroup fairness – two intersectional fairness measures – revealed that there was disparate treatment based on both gender and race. These findings suggest that intersectionality should be considered when detecting testimonial injustice, especially in medical settings. § LIMITATIONS AND FUTURE WORK Data. A challenge we faced was that MIMIC-III was unevenly distributed across the races (e.g. ethnicities) for the patients represented. We had significantly more White and Black patients than any other race of people and even still many more White than Black patients. Therefore we continue to express the need for more representative, inclusive, and balanced datasets. Further, the dataset did include ethnic breakdowns, but due to the lack of patients present in those ethnic groups we could not include Caribbean or Middle Eastern patients as well as many other subgroups in our analysis. We would like to use a more comprehensive dataset in the future, potentially from a facility that consistently services marginalized and privileged communities. If we had more time, we would like to partner with a medical facility that regularly serves marginalized and non-marginalized groups, steadily, to develop a dataset which captures more features that could reveal some bias and ensure they are more descriptive (i.e. has_insurance) to get higher quality data. Better Feature Selection and Using More Demographic Features. To ensure the quality of the aforementioned data, we will perform a causal analysis to identify the specific features that cause testimonial injustice. We anticipate that variables such as age and education level of patients need be included, as these factors have been shown to affect how patients are treated, particularly in the medical field <cit.>. Fairness Metrics. Existing and popular, fairness metrics cannot be generalized to fit in settings where intersectionality must be considered. Another challenge we faced was having a lack of good baselines to use when analyzing intersectional differences. Intersectionality is highly unexplored, in the future we would like to develop our own metric which can be more beneficial in detecting intersectional disparate treatment between individuals. Additional Analysis. We plan to conduct additional analysis to understand if specific physicians treat similar patients similarly based on the intersection of their demographic features. Further, we plan to perform statistical significance testing on differences in how patients were treated based on the intersection of their demographic features and the occurrences of specific physicians' use of testimonial unjust terms to other patients. § ACKNOWLEDGEMENTS This paper is based upon work supported in part by the NSF LSAMP Bridge to the NSF Program on Fairness in AI in Collaboration with Amazon under Award No. IIS-1939743, titled FAI: Addressing the 3D Challenges for Data-Driven Fairness: Deficiency, Dynamics, and Disagreement (Kenya Andrews). This work is also supported in part by the Cisco Research Gift Grant (Lu Cheng). Any opinion, findings, and conclusions or recommendations expressed in this paper are those of the authors and do not necessarily reflect the views of the National Science Foundation, Amazon, or Cisco Research. § APPENDIX §.§ Normalized Sums of Unjust Terms §.§ Abbreviations §.§ Intersectional Analysis of Terms In conducting analysis on the MIMIC-III dataset, we plot the distributions of the occurrences of each term which can lead to testimonial injustice. The position of the peak in the distribution graph provides insight into which subgroups are experiencing a stronger degree of injustice. The more right-skewed the peak of the distribution is, the higher amount of injustice experienced by that particular subgroup. Naturally, the height of the peak speaks to the confidence of the severity to which that subgroup is experiencing injustice based on their word count. In comparing Figures <ref> and <ref> notice in terms of race, Asian patients experience evidential terms the second least, after White patients. Still, Asian Females have the second most highest occurrences of evidential terms, which is a clear contradiction, showing the importance of observing intersectional experiences. In Figure <ref>, we observe the normalized distribution of evidential terms used for patients across different intersections of races and genders. White men, Asian men, and White females show lower amounts of evidential terms in their records, while Latina females, Asian females, and Black females have higher occurrences of evidential terms in their medical records. From the normalized distributions of the occurrence of judgement terms in the medical records, in Figure <ref> we can observe that female patients as opposed to male patients and Black patients as apposed to the other races, studied here, have the most occurrences of judgement terms. Figure <ref> emphasizes just how much worse Black women are impacted than any other subgroup. Black men and White women are the next two most vulnerable groups to experiencing judgemental terms in their physicians' notes. Latino men, White men, and Latina females have the least occurrences of judgement terms in their records. From Figure <ref> we observe the distributions of normalized stigmatizing terms used for patients over the intersection of their race and gender. Asian men, followed by Asian females and White males have experienced the least stigmatizing language in the physicians' notes, while Black females and Latino men have been faced with it the most. Figure <ref> suggests that Latino and Black patients receive similar treatment, however, Figure <ref> highlights that stigmatizing language is more prevalent in the medical records of Black females and Latino males compared to any other subgroups. To conclude, these graphs specifically their variations show the importance of exploring intersectionality while providing medical care. For example, Black females face challenges that are unique to their intersectional identity as both black and female. This intersectionality can result in compounded experiences of discrimination and marginalization. Furthermore, the fact that Asian and White males consistently occupy the most privileged subgroup highlights systemic inequalities and the need for continued efforts to address these disparities.
http://arxiv.org/abs/2306.03004v1	20230605161432	Stratospheric dayside-to-nightside circulation drives the 3-D ozone distribution on synchronously rotating rocky exoplanets	[ "Marrick Braam", "Paul I. Palmer", "Leen Decin", "Maureen Cohen", "Nathan J. Mayne" ]	astro-ph.EP	[ "astro-ph.EP" ]	firstpage–lastpage Stockmayer supracolloidal magnetic polymers under the influence of an applied magnetic field and a shear flow [ July 31, 2023 ============================================================================================================= Determining the habitability and interpreting future atmospheric observations of exoplanets requires understanding the atmospheric dynamics and chemistry from a 3-D perspective. Previous studies have shown significant spatial variability in the ozone layer of synchronously rotating M-dwarf planets, assuming an Earth-like initial atmospheric composition. We use a 3-D Coupled Climate-Chemistry model to understand this distribution of ozone and identify the mechanism responsible for it. We document a previously unreported connection between the ozone production regions on the photochemically active dayside hemisphere and the nightside devoid of stellar radiation and thus photochemistry. We find that stratospheric dayside-to-nightside overturning circulation can advect ozone-rich air to the nightside. On the nightside, ozone-rich air subsides at the locations of two quasi-stationary Rossby gyres, resulting in an exchange between the stratosphere and troposphere and the accumulation of ozone at the gyre locations. We identify the hemispheric contrast in radiative heating and cooling as the main driver of this ozone circulation. Dynamically-driven chemistry also impacts other tracer species in the atmosphere (gaseous and non-gaseous phase) as long as chemical lifetimes exceed dynamical lifetimes. These findings illustrate the 3-D nature of planetary atmospheres, predicting spatial and temporal variability that will impact spectroscopic observations of exoplanet atmospheres. Planets and satellites: terrestrial planets – Planets and satellites: atmospheres – Planets and satellites: composition § INTRODUCTION The past two decades have seen the discovery of numerous Earth-size exoplanets, with a substantial fraction of them orbiting in the circumstellar Habitable Zone <cit.>. Earth-size planets are preferentially discovered around M-dwarf stars <cit.>, because they are the most abundant stellar type, have relatively small radii, and are relatively cool, allowing for exoplanets in short-period orbits. The habitability of such exoplanets has been debated in light of the stellar and planetary environments <cit.>. Comprehensive numerical simulations that describe the physical and chemical properties of a planetary atmosphere in such environments are essential to understanding habitability and interpreting spectroscopic observations. Since M stars are cooler and smaller than other stellar types, a planet in the Habitable Zone orbits at a small orbital distance and feels a strong gravitational pull from the host star. This can lead to spin-orbit resonances for the planet, so-called tidal locking, of which the most extreme case is the 1:1 resonant orbit or synchronous rotation <cit.>. Simulations with General Circulation Models (GCMs) help us understand how synchronous rotation affects the planetary atmosphere and surface habitability. First, synchronous rotation creates distinct hemispheric environments and a large temperature difference between the dayside and nightside <cit.>. Second, synchronous rotation leads to distinct photochemical environments, with strong photochemical production and destruction on the dayside and an absence of photochemistry on the nightside <cit.>. Depending on the rotation period, synchronous rotation can also lead to atmospheric circulation that is characterised by thermally direct circulation for slowly rotating planets <cit.>. The existence of this large-scale circulation requires the Rossby deformation radius to exceed the planetary radius <cit.>, which is the case for planets like Proxima Centauri b, Trappist-1 e to h, LHS-1140 b and GJ 667 C c, assuming an Earth-like atmosphere. The dayside-nightside contrast leads to an overturning circulation, with upwelling on the dayside and downwelling on the nightside <cit.>. This vertical motion results in a superposition of planetary-scale Rossby and Kelvin waves, which drives eddy momentum equatorward <cit.>. A typical part of this wave structure is a pair of quasi-stationary cyclonic gyres on the nightside <cit.>. The equatorward momentum feeds the superrotating jet <cit.>. The overturning circulation is a dominant component of the dayside-to-nightside heat transport <cit.>. Atmospheric circulation impacts the spatial and temporal distribution of chemical species and other tracers such as clouds <cit.> and photochemical hazes <cit.>. On Earth, the Brewer-Dobson circulation controls the large-scale distribution of chemical tracers such as ozone (O_3) and water vapour in the atmosphere <cit.>. Ozone formation is initiated by photochemistry through the Chapman mechanism <cit.>, which is strongest at tropical latitudes. The Brewer-Dobson circulation describes the ascent of ozone-rich air in the tropics, followed by equator-to-pole transport and descending air motions at high latitudes, leading to meridional variations with a relatively enhanced ozone layer at high latitudes. <cit.> simulated a tidally-locked Earth using a 3-D climate-chemistry model (CCM), which consists of a GCM coupled to a photochemical network to study the relation between (photo)chemistry, atmospheric dynamics and the thermal structure of the atmosphere. They find a breakdown of the Brewer-Dobson circulation, and instead predict that ozone accumulates on the nightside, where it has a long lifetime <cit.>. <cit.> investigated stratospheric circulation on tidally-locked exoplanets and the potential impact on the distribution of chemical species. For planets with short orbital periods (<25 days), tropical Rossby waves can induce strong equatorial jets in the stratosphere with pole-to-equator transport of airmasses <cit.>. <cit.> showed the meridional distribution of ozone from CCM simulations, confirming that this pole-to-equator circulation essentially confines photochemical species such as ozone to the equatorial regions. The existence of extratropical Rossby waves or damping of tropical Rossby waves prevents this equatorial confinement. Instead, a thermally-driven overturning circulation can drive equator-to-pole transport of photochemical species <cit.>, leading to meridional structure with enhanced ozone at high latitudes. For planets like Proxima Centauri b, <cit.> find a relatively weak tropical Rossby wave, with a thermally-driven equator-to-pole circulation existing in the stratosphere (see their Figure 12). For such planets, the enhanced ozone abundances at high latitudes were later also simulated by <cit.>. The distribution of radiatively active species such as ozone impacts habitability <cit.>, and will determine what spectroscopic observations of the planetary atmosphere will look like <cit.>. Despite reporting a non-detection for the atmosphere, the observation of TRAPPIST-1 b illustrates the capability of JWST to characterise Earth-size exoplanets <cit.>. For the exoplanets that have an atmosphere we need to understand their 3-D nature, including circulation, clouds, and atmospheric chemistry, which motivates the application of 3-D CCMs to exoplanetary environments. Such simulations of synchronously rotating exoplanets predict a significant zonal structure in the ozone layer for planets around M-dwarfs like Proxima Centauri b <cit.> and haze distribution for hot Jupiters <cit.>. <cit.> found that ozone has a much longer chemical lifetime on the nightside as compared to the dayside of M-dwarf exoplanets. These long nightside lifetimes lead to accumulation of ozone in the nightside gyres, despite the absence of stellar radiation needed to initiate the relevant photochemistry. This spatially variable ozone layer indicates a connection between the photochemically active dayside regions and nightside gyres, which is currently not understood. In this paper, we aim to understand the dayside-nightside connection and identify the physical and chemical mechanism that drives the spatially variable ozone layer on synchronously rotating exoplanets around M-dwarf stars. We use a 3-D CCM to investigate the spatial and temporal structure of atmospheric ozone, using a configuration for Proxima Centauri b. In Section <ref>, we briefly describe the CCM and introduce metrics used to diagnose atmospheric circulation. This will be followed by a description of the ozone distribution and its relation to atmospheric circulation in Section <ref>. In Section <ref>, we identify a possible driver of the circulation, investigate variability in our simulations and investigate potential observability. Finally, we present the conclusions of our study in Section <ref>. § METHODS This section starts with a description of the 3-D coupled climate-chemistry model. This is followed by the introduction of useful metrics to diagnose the atmospheric circulation and its impact on chemistry in Section <ref>. Finally, we summarize the experimental setup in Section <ref>. §.§ Coupled Climate-Chemistry Model The 3-D CCM consists of the Met Office Unified Model (UM) as the GCM coupled with the UK Chemistry and Aerosol framework (UKCA), in the configuration described by <cit.>. UM-UKCA is used to simulate the atmospheric dynamics and chemistry for Proxima Centauri b, but the results apply to other planets in similar orbits around M-dwarf stars. We simulate an aquaplanet with 1 bar or 1000 hPa surface pressure <cit.> and use a horizontal resolution of 2 by 2.5 in latitude and longitude, respectively. The atmosphere extends up to 85 km in 60 vertical levels. We assume that Proxima Centauri b is in a 1:1 resonant orbit around its M-dwarf host star and use the orbital parameters as shown in Table <ref>. The substellar point is located at 0^∘ latitude (ϕ) and 0^∘ longitude (λ). The UM is used in the Global Atmosphere 7.0 configuration <cit.>, including the ENDGame dynamical core to solve the non-hydrostatic fully compressible deep-atmosphere equations of motion <cit.>. Parametrized sub-grid processes include convection (mass-flux approach, based on ), water cloud physics <cit.>, turbulent mixing <cit.> and the generation of lightning <cit.>. The incoming stellar radiation for 0.5 nm to 5.5 μm is described by the v2.2 composite spectrum for Proxima Centauri from the MUSCLES spectral survey <cit.> and extended to 10 μm using the spectrum from <cit.>. Radiative transfer through the atmosphere is treated by the Suite of Community Radiative Transfer codes based on Edwards and Slingo (SOCRATES) scheme <cit.>. The UM is one of the leading models in predicting the Earth's weather and climate and has been adapted for the study of several types of exoplanets, including terrestrial planets <cit.> but also Mini-Neptunes <cit.> and hot Jupiters <cit.>. Furthermore, the UM was part of the TRAPPIST-1e Habitable Atmosphere Intercomparison (THAI) project <cit.>. We use UKCA to simulate the 3-D atmospheric chemical composition, by including its description of gas-phase chemistry. UKCA is fully coupled to the UM for large-scale advection, convective transport and boundary layer mixing of the chemical tracers <cit.>. The Fast-JX photolysis scheme is implemented within UKCA, to calculate photolysis rates of chemical species in the atmosphere <cit.>. By taking into account the varying optical depths of Rayleigh scattering, absorbing gases, and clouds from the UM, Fast-JX provides an interactive treatment of photolysis in calculating the 3-D distribution of chemical species in the atmosphere. We distribute the stellar flux from Proxima Centauri over the 18 wavelength bins of Fast-JX, as shown in <cit.> and their Figure 1. These fluxes are synchronised to the orbital distance of Proxima Centauri b which provides an interactive calculation of photolysis rates over the planetary orbit. The chemistry included is a reduced version of UKCA's Stratospheric-Tropospheric scheme <cit.>, including the Chapman mechanism of ozone formation, and the hydrogen oxide (HO_x=H+OH+HO_2) and nitrogen oxide (NO_ x=NO+NO_2) catalytic cycles. This results in 21 chemical species that are connected by 71 reactions. A full list of species and reactions can be found in the appendix of <cit.>. §.§ Metrics The meridional circulation is diagnosed using the mean meridional mass streamfunction (in kg s^-1), which calculates the northward mass flux above pressure P: Ψ_m = 2π R_p cosϕ/g∫^P_0 vdP, with R_p as the planetary radius, g as the gravitational acceleration and v as the zonal and temporal mean of the northward velocity component at latitude ϕ. Earlier studies using this metric for synchronously rotating exoplanets <cit.> showed 1) the existence of tropospheric Hadley and Ferrel cells transporting heat and mass from the equatorial to polar regions and 2) the impact of orbital configuration on the Brewer-Dobson circulation in the stratosphere <cit.>. However, with the fixed substellar point of synchronously rotating planets, the mean meridional circulation varies depending on the position relative to the substellar point: for example, the hemispheric mean meridional circulation can vary significantly between the dayside and nightside. The zonal circulation is analogous to the Walker circulation cells on Earth, with rising motion at the location of the heat source, followed by eastward and westward flow aloft and, after descending on the nightside, a return flow along the surface back to the heat source <cit.>. The mean zonal mass streamfunction can be used to calculate the eastward mass flux above pressure P: Ψ_z = 2π R_p/g∫^P_0 udP, where u is the meridional mean of the zonal velocity component. For slow rotators, the mean zonal circulation connects the substellar and antistellar points <cit.>. The substellar-antistellar circulation also consists of a cross-polar flow <cit.>. As elaborated in Section <ref>, the total wind flow on synchronously rotating exoplanets consists of several components. We perform a Helmholtz decomposition of the total wind flow, following <cit.>. This decomposes the total wind flow into its rotational, eddy rotational, and divergent components. The divergent wind mainly drives the substellar-antistellar overturning circulation <cit.>. Since the divergent component is roughly isotropic around the substellar point, we can move from the usual latitude-longitude or geographic coordinate system to a tidally-locked coordinate system <cit.>. The transformation between geographic coordinates and tidally-locked coordinates is illustrated in Figure <ref>. The tidally-locked latitude ϕ' is measured as the angle from the terminator and the tidally-locked longitude λ' is the angle about the substellar point, with the geographic North Pole located at (ϕ',λ')=(0,0) in tidally-locked coordinates. The substellar point and antistellar point correspond to ϕ'=90^∘ and -90^∘, respectively. It was shown by <cit.> that integrating the continuity equation in tidally-locked coordinates over λ' leads to the tidally-locked mean meridional mass streamfunction: Ψ'_m = 2π R_p cosϕ'/g∫^P_0 v'dP, where v' is the zonal mean of the meridional velocity component at tidally-locked latitude ϕ'. In this system, the meridional mass streamfunction calculates the mass flux toward the antistellar point (along lines of constant λ'), connecting the substellar and antistellar points and also taking cross-polar flow into account. Since we are particularly interested in the transport of ozone around the planet, we weight the stream functions using the ozone mass mixing ratio (χ_O3), which is measured as the mass of ozone per unit mass of air in a parcel. This gives us the ozone mass streamfunction: Ψ'_O_3 = Ψ'×χ_O_3, which can be applied generally using any of the streamfunctions in Equations <ref>, <ref> or <ref> to give the ozone-weighted meridional, zonal, or the tidally-locked meridional mass streamfunction. §.§ Experimental Setup We use the final state of the `Chapman+HO_x+NO_x' simulation from <cit.> for the analysis. The atmosphere was initialized at an Earth-like atmospheric composition, using preindustrial values of N_2, O_2 and CO_2 <cit.>. Water vapour profiles are interactively determined by evaporation from the slab ocean. The HO_x and NO_x species are initialized at mass mixing ratios of 10^-9 and 10^-15, respectively. We report results from our simulation as 600-day mean of the CCM output (equal to ∼50 orbits of Proxima Centauri b) after spinning up for 20 Earth years, to ensure the simulation has reached a dynamical and chemical steady state. The dynamical steady state was determined by the stabilisation of the surface temperature and radiative balance at the top of the atmosphere. The chemical steady state was determined by the stabilisation of ozone as a long-lived species, through the total column and volume mixing ratios. In diagnosing the impact of dynamical processes on the ozone distribution, parts of the spin-up period have also been used to plot the evolution of chemically inert tracers (see Figure <ref> below). The analysis of temporal variability in Section <ref> is based on a 6-day output over 900 days of simulation after reaching a steady state, to ensure we include potential variability at longer timescales. § RESULTS In this section, we start with a brief description of the planetary climate and ozone layer. After that, we discuss the atmospheric circulation followed by its impact on the distribution of ozone around the planet, elaborating on the stratospheric overturning circulation. Lastly, we perform a comparison of relevant lifetimes in the atmosphere. §.§ Planetary climate and atmospheric ozone The simulated climate of Proxima Centauri b is broadly similar to that described by <cit.>. Furthermore, the formation of an ozone layer under quiescent stellar radiation is explained in detail by <cit.> and <cit.>. Here, we give a brief description of the details essential for this study. The simulated surface temperature of Proxima Centauri b is shown in Figure <ref>, using a geographic coordinate system in panel (a) and tidally-locked coordinate system in panel (b). Both panels show the dayside-to-nightside contrast characteristic of synchronous rotation, with dayside maxima in surface temperature of up to 289 K and minima of 157 K over the nightside Rossby gyres. Figure <ref>b demonstrates the usefulness of the tidally-locked coordinate system in identifying the dayside-to-nightside contrasts, with the terminator located at ϕ'=0^∘. The horizontal wind vectors are shown at P≈400 hPa, illustrating the tropospheric jet as well as the Rossby gyres on the nightside. The dayside-to-nightside circulation is part of an overturning circulation across multiple pressure levels that will be described in more detail in Section <ref>. At the locations of the nightside Rossby gyres <cit.>, we see the coldest areas on the planetary surface with air that is trapped and subject to radiative cooling. The atmospheric pressure in the gyres is relatively low, like the eye of tropical cyclones <cit.>. The gyres are relatively isolated from the rest of the hemisphere and their edges act as mixing barriers <cit.>. The gyres are a general feature of slowly rotating exoplanets in a synchronous orbit that have a single equatorial jet in the troposphere <cit.>. We find a spatially variable distribution of ozone in Figure <ref>a, with a relatively thin dayside ozone layer and accumulation of ozone on the nightside. Typical values for the vertically-integrated ozone column on Earth's are 200–400 Dobson Units (DU: 1 DU=2.687×10^20 molecules m^-2), with lower values over the equatorial regions and ozone hole and higher values over high-latitude regions <cit.>. For synchronously rotating planets, most of the dayside ozone column falls within this range. The locations of the nightside Rossby gyres correspond to the maxima in the thickness of the ozone column, reaching up to 1401 DU. The gyres are not fully symmetric, evident from slightly different shapes and the average ozone columns: the area-weighted mean column of the low-λ' gyre (for λ'≤70 and λ'>320^∘) is equal to 626 DU and of the mid-λ' gyre (110<λ'≤220^∘) to 601 DU, both confined between tidally-locked latitudes -60<ϕ'<0^∘. Figure <ref>b shows that the accumulation of ozone at the gyre locations mostly occurs in the lower atmosphere, at pressure levels corresponding to the troposphere (<100 hPa). The existence of such a spatially variable ozone layer depends on a complex interplay between photochemistry and atmospheric dynamics and changes as a function of incoming stellar radiation and planetary rotation state <cit.>. The production mechanisms for atmospheric ozone are relatively well-understood and due to photochemistry: in the presence of stellar radiation molecular oxygen will dissociate and form ozone through the Chapman mechanism <cit.>. The 3-D impact of M-dwarf radiation on the Chapman mechanism has been explored by previous studies, both in quiescent <cit.> and flaring conditions <cit.>. In all cases, an ozone layer develops around the planet. As such exoplanets are likely to rotate synchronously around their host star <cit.>, stellar radiation and the photochemical production of ozone are limited to the planetary dayside. This is illustrated in Figure <ref>, showing the time-averaged chemical tendency of ozone. The tendency denotes the balance between the production and loss of ozone due to chemical processes. We find that ozone production mainly occurs at high ϕ'>40^∘ (i.e., close to the substellar point), whereas ozone production is practically absent at the locations of the nightside gyres (-60<ϕ'<0^∘). Hence, another mechanism must be driving the relatively enhanced ozone abundances at the locations of the nightside Rossby gyres. §.§ Overturning circulations The relationship between the ozone distribution in Figure <ref> and the global atmospheric circulation becomes clear through the mass streamfunctions, as defined in Section <ref>. From left to right, Figure <ref> shows the mean meridional mass streamfunctions Ψ_m, Ψ'_m and Ψ'_m,O_3 that have been calculated from the divergent wind component. A positive streamfunction (red contours) indicates clockwise circulation, and a negative streamfunction (blue) indicates anticlockwise circulation. From Figure <ref>a, we find strong poleward transport of air at tropospheric pressures (>100 hPa) in a single thermally driven circulation cell <cit.>. Moving up into the stratosphere, we find stacked layers of clockwise and anticlockwise circulation. The existence of poleward transport between ∼50 and ∼1.5 hPa indicates additional thermally-driven circulation cells. These cells transport aerosols and chemical tracers such as ozone from the equator to the poles through the stratosphere <cit.>. This equator-to-pole transport leads to an enhanced high latitude ozone layer on the dayside in geographic coordinates, with mean ozone columns of ∼490 DU above 80^∘ North and South as compared to a mean of ∼290 DU between 10^∘ North and 10^∘ South <cit.>. Since the stellar radiation at the poles is too weak to initiate the photochemistry responsible for ozone production, this polar enhancement has to be due to the poleward transport of ozone produced in the equatorial regions. Moving to tidally-locked coordinates using Ψ'_m in Figure <ref>b, we find a single overturning circulation cell that dominates the troposphere and transports air and heat from the dayside towards the nightside. A weaker anticlockwise circulating cell is present between the antistellar point and ϕ'≈-30^∘, induced by the temperature gradient between those two points. The absence of anticlockwise motion when moving to lower pressure levels in Figure <ref>b indicates that a connection between the tropospheric cell and the stratospheric circulation exists. An overturning circulation covers essentially all of the stratosphere, connecting the dayside and nightside. Air ascends in the ozone production regions (between 0.2 and 100 hPa, see Figure <ref>) and moves through the stratosphere towards the nightside, where it subsides at the locations of the nightside gyres and thus the locations of ozone accumulation as shown in Figure <ref>. To quantify the impact of this mass transport on the distribution of ozone, we calculate the tidally-locked ozone-weighted mass streamfunction Ψ'_m,O_3 (Equation <ref>) as shown in Figure <ref>c. From the ozone mass streamfunction we infer that the circulation of ozone through the stratosphere provides a significant contribution to the dayside-to-nightside transport. The downward ozone transport at the ϕ' of the Rossby gyres (-60<ϕ'<0^∘) indicates that this stratospheric dayside-to-nightside circulation drives ozone-rich air into the Rossby gyres and thus leads to ozone maxima on the nightside. Figure <ref> again shows Ψ'_m,O_3, now separated into 4 ranges of λ'. Each of these λ' ranges corresponds to a distinct feature of the ozone distribution in Figure <ref>a. Figure <ref>a shows the λ'-range that contains the low-λ' gyre (λ'>320^∘ and λ'≤70^∘), and we can identify the dayside-to-nightside transport of ozone-rich air, followed by descending motion at ϕ' corresponding to the location of the Rossby gyres. The ozone is supplied from part of its production region (see Figure <ref>) between pressures of 0.3 hPa and 20 hPa. Figure <ref>b shows the low-λ'-range that does not contain the gyres and instead includes the nightside-to-dayside component of the equatorial jet. Ψ'_m,O_3 shows that there is a stratospheric clockwise circulation, but that this is separated from the lower parts of the atmosphere by an anticlockwise circulation at the ϕ' corresponding to the Rossby gyres and misses part of the ozone production regions between 10 and 100 hPa. Therefore, for 70<λ'≤110^∘, no ozone accumulation is found following the stratospheric overturning circulation. Figure <ref>c again indicates dayside-to-nightside transport of ozone-rich air, with ozone for the mid-λ' gyre (110<λ'≤220^∘) being supplied from the ozone production regions between pressures of 0.3 hPa and 15 hPa. Lastly, Figure <ref>d shows that in the final non-gyre range (220<λ'≤320^∘) there is a stratospheric overturning circulation transporting ozone-rich air, but this circulation misses part of the ozone production region between 0.3 and 10 hPa and is generally weaker than for the ranges containing the gyres. Furthermore, the air that descends below ∼10 hPa will meet the equatorial jet, leading to chemical destruction of ozone (due to HO_x-rich air from the dayside) or advection back to the dayside followed by photochemical destruction. Therefore, this λ'-range is not accumulating ozone in the lower part of the atmosphere. Our interpretation of the atmospheric dynamics is supported by an age-of-air tracer experiment. In Figure <ref>, we show the zonally-averaged time evolution of the age-of-air-tracer during the model spin-up period. As a passive tracer, it is only affected by dynamical processes in the UM, including both advection and convection. The age-of-air tracer is initialised at 0 s and provides a measure of the amount of time that has passed since an air parcel was last found in the lowest layers of the atmosphere (below ∼2 km or 700 hPa). As such, the tracer measures the time it takes a parcel to rise from these lowest layers into the stratosphere. The tracer values are reset to 0 in the lowest layers at every model timestep. With the evolution of the age-of-air tracer over ϕ' in Figure <ref> we show that air rises over and around the substellar point, already providing much younger air to the dayside troposphere (<15 km) after 10 days of simulation. After 100 days, we find that most of the troposphere has been replenished with much younger air, except for the nightside gyres between -60^∘<ϕ'<0^∘. This picture persists after 500 days, showing that the age-of-air tracer in the nightside gyres is fed by older air from the stratosphere. To further diagnose the nightside descent of ozone molecules indicated by the streamfunctions, we can define the vertical flux of ozone across pressure or altitude levels as: F_O_3 = ∫^P_min_P_max (w·n_O_3) dP, where w is the vertical wind velocity (m s^-1) and n_O_3 the ozone number density in molecules m^-3. Negative values correspond to downward transport and positive values to upward transport of ozone. The integration between pressure levels P_max and P_min is done to determine the total flux exchange between the stratosphere and troposphere. Using the streamfunctions in Figure <ref> and the ozone distribution in Figure <ref>b, we determine that downward transport between ∼200 and 8 hPa drives the ozone accumulation. Figure <ref> shows the vertical flux of ozone, integrated over pressures between 190 and 8 hPa. Generally, we find a relatively small but hemisphere-wide upward flux on the dayside. The nightside gyre locations stand out with a relatively strong downward flux. Hence, the ozone that was produced in the stratosphere will be transported downward into the troposphere at the gyre locations. Combining the streamfunctions, the tracer experiment and the vertical ozone flux, we find that the stratospheric overturning circulation provides a connection between the ozone production regions and the nightside gyres, leading to the accumulation of ozone in the latter. To the authors' knowledge, this is the first time this connection has been reported. §.§ Dynamical and chemical timescales In assessing the impact of atmospheric dynamics on chemical abundances, it is important to make a comparison between the timescales of processes that can control the ozone abundance. The dynamical lifetimes include the zonal (τ_u), meridional (τ_v), and vertical components (τ_w), and are calculated following <cit.>: τ_u = L/u = 2π R_p/u, τ_v = L/v = π R_p/v, τ_w = H/w, with L the relevant horizontal scale in terms of the planetary radius R_p, and H the vertical scale height. The zonal (u), meridional (v), and vertical (w) wind components are all in m/s. For the chemical lifetimes we use: τ_chem = n_O_3/R_x, where n_O_3 denotes the ozone number density (molecules m^-3) and R_x the loss of ozone (in molecules m^-3 s^-1) due to reaction x. Specifically, we use the termination reaction of the Chapman mechanism <cit.>: O_3 + O(^3P) -> O_2 + O_2, (R1) and the rate-limiting step of the dominant HO_x catalytic cycle <cit.>: HO_2 + O_3 -> OH + 2O_2. (R2) A detailed overview of the chemical reactions can be found in <cit.>. We calculate the lifetimes for sets of gridpoints centred at four distinct locations in the ozone distribution (see Figure <ref>), and subsequently take the meridional and zonal mean. These locations cover the substellar point (10 latitudes × 8 longitudes = 80 grid points), the nightside jet (10×7=70 points), and the two nightside gyres with 5×7=35 points each. Figure <ref> shows the different lifetimes at each of the four locations. From Figure <ref>a we conclude that the dynamical lifetimes are shorter than the chemical lifetimes at all four locations, indicating that dynamics can be an important driver of disequilibrium abundances in this pressure range. In Figure <ref>b we highlight the differences between τ_u and τ_w, for the troposphere (<100 hPa) and lower stratosphere (between 100 hPa and 10 hPa), by using the fraction τ_u/τ_w. Vertical transport is the dominant process for τ_u/τ_w>1 (right of the vertical line) and horizontal transport for τ_u/τ_w<1 (left of the vertical line). Around the substellar point (solid lines), we determine that vertical mixing dominates the troposphere (τ_u/τ_w>1) and that zonal mixing (τ_u) starts to take over at P>80 hPa. Above this pressure, chemical abundances at the substellar point can be spread out zonally towards the nightside, connecting with the ozone-producing region that is part of the overturning circulation from Section <ref>. At the nightside location of the jet, τ_u/τ_w<1, and the zonal wind is capable of homogenising any vertically-driven disequilibrium. The circumnavigating jet then leads to the relatively thin ozone column for 70^∘<λ'<110^∘ and 220^∘<λ'<320^∘ in Figure <ref> (across all ϕ'). At the locations of the nightside gyres, Figure <ref>b shows that τ_u and τ_w are intermittently the smallest, indicating that both vertical and zonal mixing can drive disequilibrium abundances. However, as mentioned in Section <ref>, the edges of the gyres act as mixing barriers. Hence, the zonal transport leads to homogenisation within the gyres. Vertical mixing that is part of the overturning dayside-to-nightside circulation is dominant between ∼200 and 50 hPa at the gyre locations. This vertical mixing drives the observed disequilibrium abundances of tropospheric ozone at the gyre locations, and thus the maximum ozone columns in Figure <ref>a. § DISCUSSION In this section, we start by describing the driving mechanism for the overturning circulation. We then show its impact on other long-lived tracers and discuss relevant temporal variability in the atmospheres of synchronously rotating exoplanets. Lastly, we produce synthetic emission spectra to investigate the observational impact of circulation-driven ozone chemistry. §.§ Driving mechanism of the overturning circulation The tropospheric overturning circulation for moist, rocky exoplanets in a synchronous orbit is driven by the absorption of incoming stellar radiation and latent heat release on the dayside, and longwave radiative cooling on the nightside <cit.>. <cit.> study dry, rocky planets rotating synchronously around an M-dwarf star and find that the overturning circulation is indirectly driven by the stellar radiation, in the form of nightside cooling by CO_2. They find that an overturning circulation forms in a N_2-CO_2 atmosphere, but not in a pure N_2 atmosphere <cit.>. Prescribed CO_2 distributions from <cit.> show that shortwave (SW) absorption on the planetary dayside only has a limited impact on the overturning circulation. CO_2 can cool an atmosphere when it is found in layers exhibiting a temperature inversion <cit.>. Enhanced infrared emission from increasing CO_2 levels cools the Earth's stratosphere <cit.>. On synchronously rotating planets, this can induce a downward motion on the nightside that subsequently drives dayside-to-nightside overturning circulation. Since we focus on the stratosphere, which is relatively dry even for a moist climate of a rocky exoplanet in a synchronous orbit, we can build upon these results in identifying the driving mechanism. The SW atmospheric heating rates in Figure <ref>a show that CO_2 (the green line) acts as an important SW absorber on the dayside. The main absorber in the troposphere is H_2O, whereas CO_2 starts to become dominant above ∼170 hPa. In line with <cit.>, we find that heating due to SW absorption by CO_2 plays a minor role in the troposphere. However, in the stratosphere CO_2 absorption can become important because peak emissions from M-dwarfs are emitted at near-infrared (NIR) wavelengths, relatively long as compared to other stars. CO_2 (and H_2O) have strong NIR absorption bands <cit.>, which explains why CO_2 is the dominant absorbing species above ∼170 hPa, in contrast to ozone in the Earth's stratosphere. As expected, the total dayside heating rates (solid black line) greatly exceed the nightside values (dashed line), forming a direct driver for the overturning circulation. Additionally, Figure <ref>b shows the longwave (LW) heating rates, with negative values indicating cooling of the atmosphere. The black lines show stronger LW cooling on the nightside as compared to the dayside. Again, CO_2 is mainly responsible for these cooling rates, due to its presence in temperature inversion layers at ∼100 and ∼1 hPa. This radiative cooling on the nightside drives a large-scale downwelling which, together with SW heating on the dayside, supports the stratospheric overturning circulation <cit.>, and can explain the ozone maxima at the locations of the nightside gyres. The atmospheric pressure within the gyre is relatively low, analogous to the eye of tropical cyclones <cit.>. Such a pressure gradient naturally induces downward transport at the gyre locations. An important follow-up to this study is to investigate the ozone distribution for a variety of rotation states <cit.> in light of the circulation-driven chemistry proposed here. §.§ Long-lived atmospheric tracers The impact of the overturning circulation goes beyond the spatial distribution of ozone, as is also evident from the distribution of the age-of-air tracer as shown in Figure <ref>. Any tracer, gaseous or non-gaseous phase, can continue to circulate as long as its chemical lifetime is much longer than the dynamical timescales. Hence, the overturning circulation is relevant for any so-called long-lived atmospheric tracer. To illustrate this, we performed similar analyses using the species-weighted streamfunction as defined in Section <ref> on the distributions of nitric acid (HNO_3) and dinitrogen pentoxide (N_2O_5). Both of these species are signatures of lightning-induced chemistry in our simulations <cit.>. They are non-radical species with relatively long chemical lifetimes, mainly in the form of photolysis and wet deposition (rainout). In the dayside troposphere, the lifetimes against wet deposition are ∼10^-2-10^2 yr, while higher up in the atmosphere the lifetimes against photolysis are ∼10-10^2 yr. On the nightside, these loss processes are absent and thus their chemical lifetimes approach infinity. We calculate Ψ'_HNO_3 and Ψ'_N_2O_5 similar to Equation <ref>, and calculate the mean of each of the species-weighted streamfunctions over the troposphere (>10^2 hPa) and mid-to-lower stratosphere (1<P<10^2 hPa). The results are shown in Table <ref>. The circulation cells weighted by HNO_3 and N_2O_5 are strongest in the troposphere, at ∼0.95 and ∼0.04 kg s^-1, respectively, because of the strong overturning circulation here (see Figure <ref>b). The troposphere is also the region where lightning flashes are predicted to occur and thus where HNO_3, N_2O_5, and their precursors are produced <cit.>. The factor 10^6 and 10^7 difference with the ozone-weighted streamfunction in Table <ref> is a consequence of the much lower predicted abundances of HNO_3 and N_2O_5. Moving up to the stratosphere, we find that the ozone-weighted streamfunction is similar to the streamfunction in the troposphere, providing the connection to the nightside gyres. For HNO_3 and N_2O_5, the streamfunction is ∼30 and 150 times lower in the stratosphere, due to low levels of stratospheric HNO_3 and N_2O_5 with the absence of lightning-induced chemistry at those pressure levels. Because of the lack of stratospheric HNO_3 and N_2O_5, the overturning circulation will not be able to accumulate these species at the locations of the nightside gyres (as is evident in the spatial distribution in Figure 10 of ). In the presence of stellar flares, <cit.> show that the gyres are depleted in ozone (see their Figure 12). This can also be explained by the stratospheric overturning circulation, since flare-induced chemistry will result in a large amount of nitric oxide (NO) and nitrogen dioxide (NO_2) (together known as the NO_x chemical family) at stratospheric levels <cit.>. This NO_x can follow the stratospheric overturning circulation from the dayside to the nightside. Once on the nightside, it can be transported downward at the location of the gyres and locally deplete the ozone through the NO_x catalytic cycle <cit.>, given that flares produce sufficient NO_x. The impact of the overturning circulation on the distribution of ozone has analogies with studies that simulate tracers in the atmospheres of synchronously rotating hot Jupiters. <cit.> identified dynamical mixing in hot Jupiter atmospheres as a process leading to cold trapping of condensible species on the planetary nightside. Their experiments involve gravitational settling as a source of these condensed particles, which leads to a gradient of tracer abundance, with fewer particles as we move up through the atmosphere. Upward mixing induced by the large-scale dynamics balances the settling of these particles, preventing the complete depletion of particles and inducing a strong spatial variation in the tracer abundances. The extent of the mechanism depends on the strength of frictional drag <cit.>. The mechanism does not require convection but follows the large-scale atmospheric motions that are ultimately driven by the dayside-nightside heating contrast <cit.>, as is the case for the circulation-driven ozone distribution discussed here. Another example of a long-lived tracer is photochemical haze, which is also expected to form at stratospheric altitudes <cit.> and, for synchronously rotating exoplanets, only on the dayside of a planet <cit.>. <cit.> show that the 3-D distribution of small photochemical hazes (≤10 nm) in hot Jupiter atmospheres is also driven by dynamical mixing. The highest tracer abundances are found above the production peak, indicating upwelling on the dayside. Then a divergent flow leads to transport towards the poles and the nightside. On the nightside, the haze particles are then advected downward and get trapped in the mid-latitude gyres <cit.>. These dynamically-induced asymmetries can produce distinctions between a planet's terminator regions, as shown for hot Jupiters <cit.>. Following up on the results presented here, we will investigate the potential terminator variability of the circulation-driven ozone distribution and its observability. §.§ Time variability Besides spatial variability in tracer distributions, simulations of synchronously rotating exoplanets exhibit several modes of temporal variability. The formation of the Rossby gyres is due to the thermal forcing asymmetries <cit.>. <cit.> show that these gyres oscillate over longitude λ, with the extent depending on the planet's rotation period and thus dynamical state. Planets with a slower rotation rate have longer oscillation periods, resulting in a 157.5-day oscillation for Proxima Centauri b, which was determined from the temporal evolution of the cloud cover <cit.>. Since the stellar spectra are constant in time and the planet rotates in a 1:1 resonant orbit without eccentricity and/or obliquity, such variability has to be produced by internal atmospheric variability. <cit.> show that feedback between cloud cover and the incoming stellar radiation can influence the dynamics and drive zonal movement by the gyres, leading to variations in humidity and cloud cover over time. The accumulation of ozone (Figure <ref>) depends on the gyres so we expect there also to be a corresponding variation in atmospheric ozone. To verify this, in Figure <ref> we track the temporal evolution of the tidally-locked coordinates corresponding to the maximum in the ozone layer and the minimum in the vertical flux of ozone (F_O_3, thus corresponding to the strongest downward flux). Figure <ref>a shows ϕ' and Figure <ref>b λ' corresponding to these extrema, and the approximate extents of the gyres are indicated in yellow. The locations of the maximum ozone column and minimum vertical flux are not perfectly aligned, because the maximum ozone column corresponds to a long-term mean location of the gyre and thus depends on vertical fluxes over an extended period of time. The minimum vertical flux represents a snapshot in time and is also impacted by the upward flux from the gyre (see the red regions in Figure <ref>). From Figure <ref>a, we determine that the maximum ozone column is generally found at ϕ' corresponding to the gyre locations, with a small meridional variation over time. The minimum F_O_3 shows more variability in tidally-locked latitude, but the strongest downward flux is generally also located at the gyre locations. In Figure <ref>b, we see the variations in the tidally-locked longitude λ' over time. The low-λ' gyre typically hosts the maximum ozone column, but there are periods when the mid-λ' gyre hosts the maximum in the ozone column. The variations in the minimum F_O_3 broadly align with the maximum in the ozone column, following the gyre position that has the maximum ozone column at that time. The location of minimum F_O_3 shows more variability due to its instantaneous nature. We translate the temporal variability into simulated observables using the Planetary Spectrum Generator <cit.>. To simulate an emission spectrum that includes half the planetary dayside and half the nightside, we extract the atmospheric pressure and temperature and mixing ratios of relevant chemical species (N_2, O_2, CO_2, H_2O, O_3, N_2O, HNO_3 and N_2O_5) for these locations, take the zonal and meridional averages and compute radiative transfer with PSG. In Figure <ref> we show the resulting planet-to-star contrast for the JWST-MIRI wavelength range, along with a zoom-in that focuses on the ozone 9.6 μm feature. Using extrema in the gyre positions over time from Figure <ref>, we simulate the emission spectra of Proxima Centauri b for different 6-day intervals and indicate the maximum day in the legend of Figure <ref>. We find variations around the ozone features at 9.6 μm and between 14-16 μm that is due to absorption by CO_2, H_2O, and ozone. Hence, the region around 9.6 μm is the place to look for ozone variability. Focusing on the region around 9.6 μm shows that the maximum temporal variations are about 0.5 ppm. Spectroscopic characterisation of these absorption features to the level needed to identify these temporal variations is challenging, as detecting the features themselves would already require many days of co-added observations <cit.>. However, the recent photometric observations of the thermal emission from TRAPPIST-1 b with JWST indicate the telescope's capacity to observe favourable terrestrial exoplanets <cit.>. Mission concepts such as the Large Interferometer For Exoplanets <cit.> further utilise the mid-infrared in the characterisation of terrestrial exoplanets and will have to consider the impact of 3-D spatial and temporal variability in atmospheric dynamics and chemistry. The hot Jupiter simulations of passive tracers by <cit.> also exhibit significant temporal variability. Oscillations in the equatorial jet and variations in the dayside-to-nightside flow produce large local variations, which could again impact the spectroscopic observations of the planets, both when conducting extended observations and when observing the same object at two different points in time. Another mode of variability in the atmospheres of exoplanets in synchronous orbits around M-dwarfs is the Longitudinally Asymmetric Stratospheric wind Oscillation <cit.>. Since this entails a stratospheric turnover of wind directions, it could be relevant for stratospheric ozone. Analysing ozone mixing ratios over time, we find variations in the ozone mixing ratios above ∼30 km (or ∼3.5 hPa) as a consequence of the LASO. However, these variations occur higher up in the atmosphere than the overturning circulation that feeds the gyres and thus do not affect the gyre abundances significantly. The variations are interesting from an observational perspective, which we plan to explore as part of an in-depth investigation of the observability of the circulation-driven ozone distribution. § CONCLUSIONS We use a 3-D CCM (UM-UKCA) to study the spatial structure of the ozone layer on an exoplanet rotating in a 1:1 spin-orbit resonance around an M-dwarf star, using the parameters corresponding to Proxima Centauri b. Our results are relevant for similar M-dwarf orbiting planets, specifically for slowly rotating planets with a strong overturning circulation and a single equatorial jet in the troposphere. We investigate the spatial variability in the ozone layer and specifically the accumulation in two nightside ozone maxima, in the form of maximum ozone columns at the locations of the permanent Rossby gyres. Our work builds upon previous studies that have shown that M-dwarf radiation supports the emergence of a global ozone layer. We show that stratospheric dayside-to-nightside circulation and downward motion over low-pressure nightside gyres can explain the spatial variability in ozone. The photochemistry required to initiate the Chapman mechanism of ozone formation is limited to the dayside hemisphere, with an absence of ozone production on the nightside. We find a connection between the ozone production regions on the dayside and the nightside hemisphere, using the transformation to the tidally-locked coordinate system. Meridional streamfunctions that we calculate from the divergent wind component illustrate the existence of a stratospheric dayside-to-nightside overturning circulation. This circulation consists of a single circulation cell characterized by upwelling motion in the ozone production regions, followed by stratospheric dayside-to-nightside transport and downwelling motions at the locations of the nightside gyres. The downwelling motion produces a flux of ozone from the stratosphere into the troposphere, leading to well-defined maxima in the ozone distribution. The circulation-driven ozone chemistry impacts spectroscopic observations, although the impact of temporal variability is limited to sub-ppm levels in emission spectra. By investigating the impact of the stratospheric overturning circulation on lightning-induced chemical species (also limited to dayside production, but solely in the troposphere), we can explain why these species do not show a similar accumulation in the nightside gyres. The stratospheric overturning circulation also affects other tracer species, including gaseous chemical tracers and particulate components of photochemical haze, with the only requirement that the dynamical lifetimes are sufficiently short compared to chemical timescales. We identify hemispheric contrasts in atmospheric heating and cooling rates as the driver for the overturning circulation. Dayside heating can directly drive the overturning circulation, and nightside cooling provides an indirect component by inducing local downward motion. The relatively low atmospheric pressure over the nightside gyres further induces downward motion here. Since the stratosphere is relatively dry, CO_2 absorption is the main contributor to these heating and cooling rates. Ozone absorption also contributes to the rates, but its contribution is weaker than CO_2 since M-dwarf fluxes peak close to absorption bands of CO_2. For the first time, we find a connection between the ozone-producing dayside of synchronously rotating planets and the simulated ozone maxima on the nightside, covering hemispheric scales and multiple vertical levels in the stratosphere and troposphere. The role of the stratospheric dayside-to-nightside circulation in driving the ozone distribution around the planet illustrates the necessity of 3-D model to capture atmospheric processes correctly. Any robust interpretation of spectroscopic observations will need to understand the spatial and temporal variability of chemical species due to such circulation-driven chemistry. § ACKNOWLEDGEMENTS We are very grateful to Denis Sergeev for his contribution to the coordinate transformations and valuable feedback on the manuscript. MB kindly thanks Ludmila Carone for discussing circulation regimes on synchronously rotating exoplanets. MB, PIP and LD are part of the CHAMELEON MC ITN EJD which received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement no. 860470. PIP acknowledges funding from the STFC consolidator grant #ST/V000594/1. LD acknowledges support from the KU Leuven IDN grant IDN/19/028 and from the FWO research grant G086217N. MC acknowledges the funding and support provided by the Edinburgh Earth, Ecology, and Environmental Doctoral Training Partnership and the Natural Environment Research Council [grant No. NE/S007407/1]. NM was supported by a UKRI Future Leaders Fellowship [grant number MR/T040866/1], a Science and Technology Facilities Council Consolidated Grant [ST/R000395/1] and the Leverhulme Trust through a research project grant [RPG-2020-82]. We gratefully acknowledge the use of the MONSooN2 system, a collaborative facility supplied under the Joint Weather and Climate Research Programme, a strategic partnership between the Met Office and the Natural Environment Research Council. Our research was performed as part of the project space ‘Using UKCA to investigate atmospheric composition on extra-solar planets (ExoChem)'. For the purpose of open access, the authors have applied a Creative Commons Attribution (CC BY) licence to any Author Accepted Manuscript version arising from this submission. § DATA AVAILABILITY All the CCM data was generated using the Met Office Unified Model and UK Chemistry and Aerosol model (https://www.ukca.ac.uk/https://www.ukca.ac.uk/), which are available for use under licence; see http://www.metoffice.gov.uk/research/modelling-systems/unified-modelhttp://www.metoffice.gov.uk/research/modelling-systems/unified-model. The data underlying this article will be shared on reasonable request to the corresponding author, mainly motivated by the size of the data. We used the iris <cit.> and aeolus <cit.> python packages for the post-processing of model output. Scripts to process and visualize the data are available on github: https://github.com/marrickb/o3circ_codehttps://github.com/marrickb/o3circ_code. mnras
http://arxiv.org/abs/2306.04862v1	20230608012622	A Systematic Literature Review on Client Selection in Federated Learning	[ "Carl Smestad", "Jingyue Li" ]	cs.LG	[ "cs.LG", "cs.AI" ]	Norwegian University of Science and Technology Trondheim Norway [email protected] Norwegian University of Science and Technology Trondheim Norway [email protected] With the arising concerns of privacy within machine learning, federated learning (FL) was invented in 2017, in which the clients, such as mobile devices, train a model and send the update to the centralized server. Choosing clients randomly for FL can harm learning performance due to different reasons. Many studies have proposed approaches to address the challenges of client selection of FL. However, no systematic literature review (SLR) on this topic existed. This SLR investigates the state of the art of client selection in FL and answers the challenges, solutions, and metrics to evaluate the solutions. We systematically reviewed 47 primary studies. The main challenges found in client selection are heterogeneity, resource allocation, communication costs, and fairness. The client selection schemes aim to improve the original random selection algorithm by focusing on one or several of the aforementioned challenges. The most common metric used is testing accuracy versus communication rounds, as testing accuracy measures the successfulness of the learning and preferably in as few communication rounds as possible, as they are very expensive. Although several possible improvements can be made with the current state of client selection, the most beneficial ones are evaluating the impact of unsuccessful clients and gaining a more theoretical understanding of the impact of fairness in FL. <ccs2012> <concept> <concept_id>10010147.10010178.10010219</concept_id> <concept_desc>Computing methodologies Distributed artificial intelligence</concept_desc> <concept_significance>500</concept_significance> </concept> <concept> <concept_id>10010147.10010257.10010293.10010294</concept_id> <concept_desc>Computing methodologies Neural networks</concept_desc> <concept_significance>500</concept_significance> </concept> <concept> <concept_id>10010147.10010919.10010172</concept_id> <concept_desc>Computing methodologies Distributed algorithms</concept_desc> <concept_significance>300</concept_significance> </concept> </ccs2012> [500]Computing methodologies Distributed artificial intelligence [500]Computing methodologies Neural networks [300]Computing methodologies Distributed algorithms A Systematic Literature Review on Client Selection in Federated Learning Jingyue Li July 31, 2023 ======================================================================== § INTRODUCTION Machine learning (ML) has increased in popularity in recent years amongst businesses and research. Also, cellphones and tablets are the primary computing devices for many people <cit.>. These devices are equipped with powerful sensors such as cameras, microphones, and GPS, resulting in a vast amount of private data. With this increased concern regarding personal- and data privacy, a new paradigm for machine learning arose named decentralized learning, with the most prominent technique being federated learning (FL). FL was introduced in 2017 by <cit.>, which is a decentralized ML paradigm that leaves the training data distributed on mobile devices and learns a shared model by aggregating locally-computed updates <cit.>. Instead of sending private data to a centralized server (CS), the clients compute or train a model on their device and send the update to the centralized server. The server randomly selects a fixed-size subset of clients and provides them with an initial global model before they train and send the updates. As the client devices have different data, randomly selecting them might lead to several challenges. As the FL models are meant to be trained on smartphones and IoT devices, the expensive cost of communication must be considered by reducing the number of communication rounds and reducing the size of the transmitted messages <cit.>. Another culprit of FL is that it is performed synchronously, which implies that one round of training is finished when every edge device in the network has sent its model. This results in an effect known as the straggler effect, where the network is as fast as the slowest edge <cit.>. Assuming there is an algorithm that selects the fastest clients and there are no slow clients inducing the straggler effect, and the communication cost and communication rounds are at a minuscule level, it would be natural to assume that this algorithm would be ideal and that not much more could be done in order to improve it. However, client selection is much more complicated than that. To ensure good learning, one must also consider the data heterogeneity, resource allocation, and fairness between the clients. Likely, the selected clients do not have the same data distribution, which might lead to heavy biases within the learning. Thus, choosing the "best" clients is an integral part of a well-functioning federated learning network, but it is certainly not trivial. There are many issues to consider for defining the best client selection algorithm. As pointed out by <cit.>, only a fraction of clients are selected for efficiency, as their experiments show diminishing returns for adding more clients beyond a certain point. If the algorithm chooses to include every client as opposed to only a subset, there might be a lot of included clients who do not add value to the training while increasing the cost of communication. Perhaps some of the clients will not even finish training, which will make the entire round of learning fail. Therefore, only a subset of clients must be included during client selection. Hence, we are motivated to examine how studies have tried to improve client selection, as many problems can be addressed by better strategies than random selection. We focus on answering the following research questions (RQs): * RQ1: What are the main challenges in client selection? * RQ2: How are clients selected in federated learning? * RQ3: Which metrics are important for measuring client selection? * RQ4: What can be improved with the current client selection? To answer the research questions, a systematic literature review (SLR) was conducted by following the guidelines by <cit.> and <cit.>. One iteration of backward and forward-snowballing was performed on a set of six papers, resulting in 47 primary studies to review after the quality assessment and study selection. The contributions of this SLR are as follows. * It summarizes the main challenges in terms of client selection for FL. The main challenges are heterogeneity, resource allocation, communication costs, and fairness. * It summarizes the important metrics for measuring client selection in regard to the main challenges. The most commonly used metrics are testing accuracy and communication rounds. * It discusses possible future work within the field of client selection for FL. The rest of the paper is organized as follows. The related work is presented in section <ref>. The research methodology and implementation are presented in section <ref>. Section <ref> shows the results of this SLR, and section <ref> discusses the results. Lastly, section <ref> concludes the study and proposes future work. § BACKGROUND Machine learning has proven effective for applications within computer vision, prediction, information retrieval, and much more <cit.>. Even though the field of machine learning is progressing steadily and new milestones are being achieved, businesses report that they are still in the early stages of utilizing ML <cit.>. This decoupling is the main benefit of federated learning. The algorithms may involve hundreds to millions of remote devices learning locally, and the goal is generally to achieve the goal in equation (1) <cit.>: min_w f(w) = ∑_k=1^m p_k F_k(w) where m is the total number of devices, p_k ≥ 0, ∑_k p_k = 1, and the local objective F_k's can be defined by empirical risks over local data. § RELATED WORK There are several literature reviews and surveys related to FL. <cit.> performed an SLR of blockchain-based FL and specialized in the architectures and applications. They identified four security issues in FL which motivate the use of blockchain. The study mentioned the Internet of Things (IoT), medicine, and the Internet of Vehicles (IoV) as promising fields for application but did not mention client selection. <cit.> conducted an SLR of FL in a medical context. They focused on the areas that were promising for digital health applications. <cit.> did an SLR of FL for healthcare and focused on the architecture and remaining issues regarding applying FL to electronic health records (EHR). Both <cit.> and <cit.> focused on the security perspective and did not summarize client selection issues. <cit.> performed an SLR of FL from a software engineering perspective. They focused on what FL is, the different applications, general challenges, and how they are addressed. The five most common challenges were communication efficiency, statistical heterogeneity, system heterogeneity, data security, and client device security. The study noticed that client selection is mostly server-based but did not discuss it further. <cit.> conducted an SLR of FL but from a model quality perspective. The study presents several algorithms types, such as neural networks, decision trees, etc., with corresponding client-side algorithms but does not consider client selection. <cit.> investigated the applications, challenges and research trends of FL. The study underwent 105 research studies and discovered that the most promising application is within the healthcare domain. They reported data imbalance, system heterogeneity, expensive communication, privacy concerns, statistical heterogeneity, and resource allocation as the main challenges of implementing FL. However, they did not relate any of these challenges to client selection. <cit.> wrote an SLR of FL from the incentivization methods perspective. This study also discusses blockchain as a possible improvement but does not mention client selection outside the scope of blockchain. <cit.> did an SLR of FL with emphasis on IoT, focusing on the evaluation factors and the future and open challenges of FL-based IoT. The study mentions a possible client selection method but does not focus on the topic. <cit.> reviewed the different architectural patterns to design FL systems. The study reports 15 architectural patterns, where one of which is the client selector. The study provides a high-level overview of possible solutions, such as resource-based, data-based, and performance-based client selection, as well as some of the benefits and drawbacks of the pattern. <cit.> systematically surveyed FL in edge computing. The survey reports the main challenges as communication cost, reliability, privacy, and administrative policies. It also discusses client selection to a small degree by mentioning existing studies on the topic. <cit.> conducted an SLR of incentive-driven FL and the associated security challenges. Some incentive mechanisms include auction theory and blockchain but do not touch on the topic of client selection and possibly how to incentivize clients. <cit.> reviewed the state-of-the-art in solving non- independant and identically distributed (Non-IID) data in FL and addressed future trends for the topic. When the datasets are not independent and identically distributed, it leads to less correlation and dependencies because samples of the datasets do not have the same probability distribution. Non-IID data is one of the largest challenges in FL, and the study discusses ways to improve it through, e.g., data enhancements and data selection. One of these methods is client selection, but the survey does not go more into depth than linking to relevant papers. A comparison of the related work can be seen in table <ref>. The different columns in the table explain the following. FL indicates discussion of general challenges in FL. A refers to application of federated learning in specific field(s). SOTA discuss the state-of-the-art approaches for federated learning, e.g., specifics of implementation. CS means that the work focuses on federated learning from the viewpoint of client selection. § RESEARCH DESIGN AND IMPLEMENTATION To summarize the state of the art of client selection of FL and to answer our research questions, we performed a systematic literature review based upon the guidelines <cit.> and <cit.>. §.§ Search Strategy Generally, the SLR approach for generating a search strategy is to break down the research questions into searchable terms and generate a list of synonyms, abbreviations, and alternative spellings. As there exist a vast amount of studies on the topic of FL, this process became unmanageable. Thus, the strategy used in this paper is based on the guidelines for snowballing in SLR by <cit.>, as shown in Figure <ref>, which includes the following main steps: * Step 1: Generate a start set of studies (including only papers that will be a part of the final analysis) * Step 2: Perform backward- and forward snowballing * Step 3: Decide to include or exclude the study * Step 4: Iterate until finding no new papers To start the snowballing procedure, a starting set was needed. Google Scholar was used to generate this starting set by using relevant terms such as "Federated Learning" and "Client Selection in Federated Learning." The results are listed below. * "Communication-Efficient Learning of Deep Networks from Decentralized Data" <cit.> * "Client Selection for Federated Learning with Heterogeneous Resources in Mobile Edge" <cit.> * "Client selection and bandwidth allocation in wireless federated learning networks: A long-term perspective" <cit.> * "Federated Learning in a Medical Context: A Systematic Literature Review" <cit.> * "A Systematic Literature Review of Blockchain-based Federated Learning: Architectures, Applications and Issues" <cit.> * "A state-of-the-art survey on solving non-IID data in Federated Learning" <cit.> When starting to perform forward and backward snowballing on the starting set, it was apparent that there were too many papers to add as <cit.> is the first paper on federated learning and is cited by almost every relevant paper in the field. The paper provided a definition name for devices in FL, namely "clients." By investigating several studies, it was clear that, despite FL being a young field within machine learning, a consensus existed on using the term "Client Selection" for choosing the appropriate devices. Thus, a substring search on Google Scholar with the "cited by" feature was conducted with that substring to choose the most relevant studies. §.§ Study Selection and Quality Assessment We defined including and exclusion criteria to identify primary studies. For a paper to be included, it has to fulfil all the following inclusion criteria: * Written in English * Published after 2017 because 2017 is the origin of federated learning appeared in <cit.> * Discusses client selection in Federated Learning * Peer-reviewed According to <cit.>, quality can be seen as to which extent the study minimizes bias and maximizes internal and external validity. Table <ref> shows the different quality assessment criteria for empirical and non-empirical sources <cit.>. For each selected paper, we assessed its quality according to the quality assessment criteria and awarded one point for yes and zero points for no. We awarded half a point if it was uncertain whether or not the study fulfilled the criterion. Then an average was generated for each paper. A paper has to have an average of 0.5 or more to be accepted as the primary study. By applying the selection and quality assessment criteria, a total of 47 papers were chosen as primary studies for data extraction and synthesis. §.§ Data Synthesis Data synthesis involves collating and summarizing the results of the primary studies <cit.>. SLRs within IT and software engineering are generally qualitative in nature. Based on the overview of data synthesis provided by <cit.>, we synthesize the data in a spreadsheet, where the common themes, patterns, and finding between the extracted information can be viewed. For each RQ, relevant data were extracted and put into their respective columns according to the research question. Lastly, a list was manually generated based on the challenges and themes that were created for answering the research questions. The data synthesis process was recorded and available at [<https://docs.google.com/spreadsheets/d/1jIGpbkOcXazFRcR_Rds0mTshX0NDCIXU9Wgw3SECAiw/edit?usp=sharing>]. § RESEARCH RESULTS This section presents the results of each research question. §.§ RQ1: What are the main challenges in client selection? Results show that 23 studies tried to improve upon heterogeneity, 13 studies revolved around resource allocation, eight studies focused on communication costs, and three studies had fairness as the main challenge. The distribution of the challenges can be seen in Figure <ref>. Several studies report more than one challenge, but it has been assigned to the challenge it focuses mostly on. §.§ Heterogeneity In FL, the training is executed on the client's local devices. This will result in differences between the clients as they will have different datasets and availability. This is the most common challenge found in FL, and <cit.> reported heterogeneity as the main challenge. Almost half of the primary studies tried to improve it through different measures. <cit.> conducted a state-of-the-art survey on solving non-IID data in FL and concluded that data heterogeneity could be divided into the following categories: feature distribution skew, label distribution skew, same label (different features), same feature (different labels) and quantity skew. <cit.> report that heterogeneity also might arise due to partial client participation, as only a small fraction of client nodes participate in each round of training. If the client selection algorithm selects an improper subset of clients with poor-quality data, this will result in an inefficient trained model <cit.>. <cit.> reported label distribution skew as one of the most significant parameters which lead to performance degradation, while <cit.> reported skewed data as one of the most critical factors. <cit.> reported that heterogeneity / Non-IID might bring the biases of some clients into the model training and cause accuracy degradation. This claim is supported by <cit.>, who claim an urgent need for client selection strategies that promise data unbiasedness in FL. <cit.> analyzed the limitations of the state-of-the-art client selection in regard to heterogeneity and concluded that due to under-exploited statistical- and system efficiency, not all the model updates would contribute to the model training equally. As various clients have diverse data sizes and importance, uploading unimportant updates significantly degrades the system's efficiency. According to <cit.>, a significant problem with utilizing FL with IoT is that the local data of sensors are constantly changing. This will have a similar effect as device failures and might lead to skewed distributed data, which leads to model degradation. There might also exist label noise on some clients, which exists naturally. This will lead to unnecessary information being exchanged <cit.>. To summarize, the key findings for the challenge of heterogeneity are as follows. * 48.93% of the studies reported heterogeneity as the main challenge for FL. * It might result in an inefficient trained model, performance- and accuracy-degradation. * Heterogeneity might increase biases and unnecessary exchange of information. §.§ Resource Allocation Resource allocation was the second most common problem in the primary studies. This is due to several reasons, but the main one is due to the fact that the training process becomes inefficient when some clients have limited computational resources <cit.>. <cit.> state that a considerable challenge in resource allocation is that learning rounds are temporally interdependent and have varying significance toward the final learning outcome. According to <cit.>, it is unnecessary to select more clients than needed, and it is beneficial to have fewer clients. Still, the challenge consists of the trade-off between the number of clients, energy consumption, and resource allocation. Furthermore, within hierarchical federated learning (HFL), unique challenges exist, such as clients sometimes being inaccessible to the edge servers. Due to differences in resources and hardware specifications, the "straggler effect" is bound to happen <cit.>. <cit.> stated that clients are constrained by personal energy and computation that may reduce the efficiency of ML training tasks. This is because the training and transmission of large models are very energy-consuming and might be difficult on low-energy edge devices. During training, there might be changes in client resources due to volatility of client population, client data, and training status <cit.>. The topic of energy consumption within FL is important, as training and transmission of large models are energy-consuming, while edge devices generally have little energy. <cit.> propose a client selection policy of giving the lowest priority to clients with poor communication capacity and a bad channel. To summarize, the key findings for the challenge of resource allocation are as follows. * 27.65% of the studies reported resource allocation as the main challenge of FL. * The training process becomes inefficient when some clients have limited computational resources. * Training and transmission of large models are very energy-consuming and difficult for low-energy devices. §.§ Communication costs The third most common problem was the communication costs in FL. The communication cost is essential as every time the global model updates, it needs to receive the local aggregation of all the selected clients. According to <cit.>, the communication power required to reach convergence makes up a large portion of the cost. One of the challenges is that a client with low computing power might not return the local model update on time, leading to a long convergence time <cit.>. Studies <cit.> state that the trade-off between communication costs and accuracy is a challenge. <cit.> state that another challenge is the long distance between the different clients and the global server, which results in increased bandwidth usage. By default, FL is done synchronously. This implies that a round of communication / global model updates is only executed once every client has uploaded their model. This leads to an effect known as the straggler effect, where the system is only as fast as the slowest link <cit.>. This issue is also addressed by <cit.>. Another fundamental challenge with communication costs is the energy usage of clients in FL. As vast amounts of data are generated from mobile and edge devices, these devices are energy-restricted. It is imperative to improve the energy efficiency of the systems <cit.>. According to <cit.>, clients' hardware conditions and data resources can vary significantly, which might lead to negative performance. To summarize, the key findings for the challenge of communication costs are as follows. * 17.02% of the studies reported communication costs as the main challenge of FL. * Clients with low power or slow will lead to long convergence time. As FL is done synchronously, this implies that the learning is as fast as the slowest client. * The possibly long distance between clients and servers will result in increased bandwidth usage. §.§ Fairness The last common problem encountered was fairness. Only three studies reported it as the main challenge which they tried to solve. However, fairness is a researched topic within several similar fields, such as Resource Allocation (RA) and ML. In the context of resource allocation, the problem is defined as allocating a scarce shared resource among many users. For machine learning, it is typically defined as the protection of some specific attribute(s) by, e.g., preprocessing the data to remove information about the protected attribute <cit.>. In the context of FL, if the client selection algorithm always selects the fastest devices, it might boost the training process. However, as stated by <cit.> " But clients with low priority are simply being deprived of chances to participate at the same time, which we refer to it as an unfair selection." It might result in undesirable effects, such as omitting some portions of data. Also, if there are less data involved, data diversity will not be guaranteed and might hurt the performance of model training. <cit.> state that by focusing on improving fairness, the uniformity of performance across clients will be improved as well. <cit.> define fairness in FL as follows: Definition 1 (Fairness of performance distribution). For trained models w and w̃, w provides a more fair solution to the federated learning objective (<ref>) than model w̃, if the performance of model w on the m devices, {a1, …, a_m}, is more uniform than the performance of model w̃ on the m devices. Note: Decoupling is the main benefit of FL. The FL algorithms may involve hundreds to millions of remote devices learning locally by minimizing the objective function f(w) (1) <cit.>: min_w f(w) = ∑_k=1^m p_k F_k(w) where m is the total number of devices, p_k ≥ 0, ∑_k p_k = 1, and the local objective F_k's can be defined by empirical risks over local data. Through this definition, it becomes apparent that learned models which might be biased towards devices with large numbers of data points or commonly occurring devices are unfair. According to <cit.>, differences in data distribution and uncertainty in data quality are challenging in FL and data selection might exacerbate the unfairness of FL. There are several different methods for prioritizing clients. If one selects all the "fast" devices, it might result in faster training but will deprive slower clients of the chance to participate. If the selection is one-sided, it will bring negative side effects, such as neutralizing some portions of data <cit.>. In addition, clients may not provide honest results through various attacks, such as Byzantine attacks, which minimizes the effect of actual results of honest clients and reduces fairness <cit.>. To summarize, the key findings for the challenge of fairness are as follows. * 6.38% of the studies reported fairness as the main challenge of FL. * Selecting only the fastest clients might result in an unfair selection, as slower clients are deprived of the chance to participate. * An unfair selection might lead to heavy biases as some portions of the data are neutralized. §.§ RQ2: How are clients selected in federated learning The different solutions are presented in this subsection and divided into their respective challenges. A summary of the findings is shown in Table <ref>. §.§.§ Heterogeneity The most common approach to address this issue is to try to select a subset of clients who together give a more homogenous dataset <cit.>. <cit.> performed a state-of-the-art survey on solving non-IID data in FL and mentioned <cit.> as a possible solution through client selection. They proposed selecting clients with small data heterogeneity based on Thompson sampling. <cit.> suggested a similar algorithm of selecting a subset of clients who together form a homogeneous subset. <cit.> proposed to measure the degrees of non-IID data present in each client and then select the clients with the lowest degrees. <cit.> and <cit.> had similar ideas but suggested a more holistic approach by also including the system heterogeneity (e.g., resources) as well. <cit.> propose to dynamically update the selection weights according to the impact of the client's data. Clustered Federated Learning (CFL) was introduced as an efficient scheme to balance out the non-IID data, and <cit.> suggest leveraging the devices' heterogeneity to schedule them based on round latency and bandwidth to select clients. According to <cit.>, this type of approach works well within IoT due to the advantage of naturally clustered factory devices. <cit.> also find clusters of clients who together have near IID data through being distribution-aware. In order to address the issue of label distribution skew, <cit.> suggested a method where you check the similarity between the aggregated data distribution of the selected clients and compare it to the global data distribution. <cit.> suggest giving each client an irrelevance score which improves the data distribution skewness. <cit.> have an interesting approach to clustering clients by grouping them according to classes of data and then randomly selecting one client within every group. Another promising approach suggested by <cit.> is to introduce diversity into client selection by measuring how a subset of clients can represent the whole when aggregated on the server for each communication round. Generally, the studies try to keep an unbiased client selection in order to promote fairness. However, <cit.> report that biasing the client selection towards choosing clients with higher local losses resulted in an improvement in the partial client participation problem. <cit.> suggested another approach to the same problem but suggested a multicriteria-based approach to predict if they were capable of performing the FL task. Other studies, such as <cit.>, suggest strengthening client selection with cryptographic methods such as homomorphic encryption (HE). <cit.> bring forward the idea of selecting clients at different global iterations to guarantee the completion of the FL job. Lastly, <cit.> take into account both model weight divergence and local model training loss for selecting clients. §.§.§ Resource Allocation In order to improve the effect of some clients having limited resources, <cit.> suggest an algorithm that manages clients based on their resource conditions. Thus, allowing as many client updates as possible. <cit.> create an algorithm that utilizes bandwidth allocation under long-term client energy constraints by using available wireless channel information in order to improve resource allocation. To deal with the resource allocation problem, <cit.> suggest maximizing the number of clients while minimizing the energy consumption by the clients by allocating a set amount of resources in terms of CPU and transmission power. Within HFL, <cit.> propose a client selection scheme with a network operator that learns the number of successful participating clients while dealing with a limited resource budget. Similarly, <cit.> suggested evaluating the learning quality of clients on a limited resource budget and then selecting the best clients. <cit.> suggest that clients should be selected by considering and quantifying factors such as the relative impact of clients' data and resource differences and then selecting the clients with the most significant score. Another method to deal with resource allocation is to focus on minimizing energy consumption and training delays in order to encourage more clients to participate in model updating. This may be done through reinforcement learning that learns to select the best subset of clients <cit.>. <cit.> propose an algorithm that utilizes fuzzy logic by considering the number of local data, computing capability, and network resources of each client. §.§.§ Communication Costs As communication cost is a vital challenge in FL, many attempts have been executed in order to improve it. <cit.> developed a joint client selection algorithm that selects appropriate devices and allocates suitable amounts of resources to reduce convergence time due to high communication costs. <cit.> suggested a distributed client selection algorithm where the client devices participate in aggregation, resulting in lower communication costs while maintaining the low loss. <cit.> had a similar approach where they selected a subset of clients to participate in each round of training, and the remaining clients did not have to do any training, resulting in both lower computing and communication resources. Another proposed solution is proposed by <cit.>, where there is a 3-way hierarchical framework to improve communication efficiency. It creates a cluster head that is responsible for communication with the global server, and local devices communicate with the cluster head. This will lead to model downloading and uploading requiring less bandwidth due to the short distances from the source to the destination. To tackle the energy consumption challenge, <cit.> suggested only selecting the clients who provide significant information with each round. This would enable them to select fewer clients and end up with lower total energy consumption. In order to omit the "straggler effect" introduced through synchronous FL, <cit.> suggest an asynchronous approach where the server did not have to wait for all clients to be finished with their training. <cit.> proposed to utilize stochastic integer programming that selects clients in a reputation-aware manner. §.§.§ Fairness <cit.> promote a fairness-guaranteed client selection algorithm. They conclude that the final accuracy may increase by focusing on fairness but might sacrifice training efficiency. Whereas <cit.> suggest improving fairness through biased client selection by selecting the ones with higher local loss. <cit.> propose to select the most honest and useful clients by utilizing a multi-armed bandit approach, resulting in dishonest clients being filtered out. §.§ RQ3: Which metrics are important for measuring client selection? The relevant metrics regarding client selection entirely depend on the problem the study is trying to improve upon. The different key metrics for each of the main challenges in client selection are summarized in Table <ref>. §.§.§ Heterogeneity The most common metric used is measuring the test accuracy against the number of communication rounds. Out of the 20 studies which reported heterogeneity as the biggest challenge, 14 used this metric to measure the success of their client selection. This metric was also utilized by the original FL paper <cit.> and is directly comparable to the standard within regular machine learning, where "Test Accuracy vs. Epoch" is very commonly seen. The main difference stems from FL having many clients send their model updates to a global server and then aggregate them. In that regard, a communication round corresponds to one epoch of the global server. Studies <cit.> included a similar metric: the number of communication rounds up to a given threshold accuracy. This approach's main benefit is that it focuses more on minimizing the number of communication rounds, which are very costly in FL. Lastly, <cit.> looked into how many selected clients are able to finish training without dropping out. §.§.§ Resource Allocation For the challenge of resource allocation, the most common metric seen is also "Testing Accuracy vs. Communication Rounds." This is as expected, as it directly measures how well the FL-algorithm performs. Some studies supplement it with other metrics such as energy, delay, and client consumption <cit.>. For mobile edge computing (MEC) systems, the energy is the basis of the client training model, and delay determines the iteration speed and convergence speed of the global model. §.§.§ Communication costs As already stated in section <ref>, the cost of communication between clients and the global server is one of the most expensive parts of FL. Thus, utilizing the right metrics to validate the reduced cost is vital. The typical "Testing Accuracy vs. Communication Rounds" is commonly seen in the studies, as higher testing accuracy in fewer communication rounds will lead to lower costs. Another beneficial metric is convergence time and latency, reported by <cit.>, as reducing the time spent in communication will lead to lower costs. Furthermore, <cit.> introduced the cost of hiring clients as an essential metric, as it was simply overlooked in existing studies and contributed a large part of the overall costs. §.§.§ Fairness Other than the already discussed "testing accuracy vs. communication rounds" metric, <cit.> utilized different metrics for measuring improved fairness. For instance, they included metrics such as the availability of the client and mathematically measured the long-term fairness through constraints. §.§ RQ4: What can be improved with the current client selection? There are a lot of improvements that can be made with the current client selection. As decentralized learning is still pretty young, there is room for improvement within all discussed challenges in this SLR. §.§.§ Heterogeneity For hierarchical federated learning (HFL), <cit.> suggested looking into finding the optimal thresholds for splitting clusters of clients, which certainly would improve the communication efficiency of the learning network. §.§.§ Resource Allocation The primary studies reported several measures for possible future work which seem exciting and beneficial for the current client selection schemes. <cit.> stated that selecting clients as late as possible improves the efficiency of the client selection, but there is a lack of theoretical and practical research on the topic. The most commonly suggested improvement was reported by three of the studies <cit.>. They suggested looking into the effect of unsuccessful clients (or free-riders) and how to quantify the impact. These types of clients bring a lot of overhead costs into the learning network, and exploring the effects and solutions to those would undoubtedly improve the current client selection. None of the primary studies focused mainly on the effect of unsuccessful clients. However, studies <cit.> focused on optimizing client selection for volatile FL. This volatility stems from the dynamic of clients' data and the unreliable nature of clients (e.g., unintentional shutdown and network instability). Therefore, some work has been done on the topic, but there is certainly a gap that may be improved more. Those studies focus much more on the client's ability to enter and leave training rather than the effect of unsuccessful clients. §.§.§ Communication Costs <cit.> discussed the possibility of creating an incentive mechanism to encourage more computing power to FL. So far, there are no incentives for the client devices to allocate more resources to learning than necessary. Thus, giving them some sort of incentive mechanism would increase computational power and improve the problem of resource allocation. Perhaps it would make it easier to create a more homogenous resource distribution amongst the clients. §.§.§ Fairness Even though only two studies reported fairness as the main challenge, studies, such as <cit.>, mention it as a possibly important factor that could promise a higher accuracy. Others mentioned it as a possible future direction for their work. For instance, <cit.> reported that fairness might play an essential role in FL training and that studying it in a volatile context would be beneficial. As already discussed in section <ref>, studies already focus on fairness in client selection, but there is still a knowledge gap within the topic. <cit.> looked into the trade-off between fairness and training accuracy but concluded that they could not quantify the relationship and that looking further into analyzing the fairness factor for FL would be worthy of investigation. § DISCUSSION This section discusses how the SLR compares to the related work as well as the limitations of the study. §.§ Comparison to Related Work The contributions of this systematic literature review (SLR) can be summarized as follows. * An overview of the core challenges in FL and their respective impact. * How clients are selected in FL in regards to the challenges and the metrics that are most commonly used in order to validate the selection. * A brief overview of possible future research into client selection as suggested by the studies. To our knowledge, there currently does not exist any SLR focusing solely on client selection. The previous work has focused either on general FL challenges or the application of FL. Therefore, the main benefit of this SLR is its focus on FL from the perspective of client selection. However, there are a lot of similarities between the related work and this review, as they all encompass the challenges within FL. The value of this review to the industry is as a reference for the different client selection techniques and how they impact overall learning. There is also value in viewing possible future directions for client selection when looking into what can be improved. This review has found a couple of areas that researchers may look more into from the perspective of client selection. Firstly, there are a vast amount of different client selection schemes proposed for FL, which all claim to outperform the state-of-the-art of random selection. It would be beneficial to compare these selection schemes with possible application cases in order to form an improved state-of-the-art solution for client selection. Secondly, the topic of fairness is not thoroughly explored. Several studies mention fairness as an important factor, but there does not exist much research on the topic of exploring the trade-offs and benefits of focusing on it. Although FL is a relatively new field within machine learning, it already shows promising prospects within several application domains, such as healthcare, natural language processing, smart cities and IoT. For certain industries, it might be more trivial to implement a well-functioning system as the developers know the types of devices on which the algorithm will be implemented, but this is not the case for applications such as IoT and edge computing. In those fields, the developers do not necessarily know much about the client devices which will perform the learning, thus making it much more difficult to tackle the several challenges reported by the related work and found in this SLR. Client selection is an integral part of a well-functioning FL system, as it may be utilized to improve the challenges of heterogeneity, resource allocation, communication costs, and fairness. Despite the previous- and related work conducted on the topic, there is no de facto standard for the client selection algorithm within any application of FL. Even within a subset of any challenge, such as the issue of clients dropping out during training, multiple possible solutions exist, such as asynchronous FL, partial aggregation of dropped-out clients, and resource-aware FL. Within each category, there exist many algorithms to tackle the challenge through client selection, which shows the importance of exploring the topic further and possibly finding the best approach. For academia and industry, this SLR may assist in several ways. Firstly, it can be used as a reference guide for the most prominent existing challenges and their consequences for learning. Secondly, for each given challenge, the SLR presents several different possible existing solutions to tackle it. This is especially valuable to the industry when deciding to implement an FL system and deciding whether or not their ecosystem is well-suited for it. The SLR also provides guidelines to mitigate some of the challenges. §.§ Limitations Although the guidelines for systematic reviews by <cit.> were followed, several points may have been improved. We might miss some primary studies in the study search stage because there were many studies on the topic of FL. For instance, performing the forward snowballing procedure on the original FL-paper <cit.> resulted in around 7000 studies. Even though there is plenty of academic research on the topic, we did not look into any grey literature as a possible source. There certainly may exist many exciting discussions and ideas on FL which are not discussed in academic journals but in blogs and newspapers. We might exclude papers that are relevant to the study during the paper selection process. To mitigate this risk, the papers' inclusion and exclusion are cross-checked and agreed upon by both authors. § CONCLUSIONS AND FUTURE WORK We performed an SLR and summarized the challenges, solutions, and metrics for evaluating the solutions and possible future work of client selection in FL. Information from 47 primary studies is analyzed and synthesized. This study is the only SLR, as far as the author is aware, focusing solely on client selection in FL. The SLR delights several possible future research challenges we want to focus on. The most beneficial ones regard the impact of unsuccessful clients or fairness. Improving one of those challenges could benefit FL, as the training efficiency might increase, and the communication costs would be reduced. The communication cost is also one of the most significant problems in FL. Thus, improving it would be beneficial. ACM-Reference-Format § ASYNCHRONOUS ILLUSTRATION
http://arxiv.org/abs/2306.11262v2	20230620033246	On regular subgroups of $\mathsf{SL}_3(\mathbb{R})$	[ "Sami Douba", "Konstantinos Tsouvalas" ]	math.GR	[ "math.GR", "math.GT" ]	GraphGLOW: Universal and Generalizable Structure Learning for Graph Neural Networks Junchi Yan July 31, 2023 =================================================================================== Motivated by a question of M. Kapovich, we show that the ℤ^2 subgroups of 𝖲𝖫_3(ℝ) that are regular in the language of Kapovich–Leeb–Porti, or divergent in the sense of Guichard–Wienhard, are precisely the lattices in minimal horospherical subgroups. This rules out any relative Anosov subgroups of 𝖲𝖫_3(ℝ) that are not in fact Gromov-hyperbolic. By work of Oh, it also follows that a Zariski-dense discrete subgroup Γ of 𝖲𝖫_3(ℝ) contains a regular ℤ^2 if and only if Γ is commensurable to a conjugate of 𝖲𝖫_3(ℤ). In particular, a Zariski-dense regular subgroup of 𝖲𝖫_3(ℝ) contains no ℤ^2 subgroups. § INTRODUCTION Our discussion is motivated by the following question of M. Kapovich, also considered by D. Long and A. Reid. <cit.> Is there a subgroup of 𝖲𝖫_3(ℤ) isomorphic to ℤ^2 * ℤ? We remark that 𝖲𝖮_3,1(ℤ) contains copies of ℤ^2 * ℤ, and hence so does 𝖲𝖫_n(ℤ) for each n ≥ 4. While we do not resolve Question <ref>, we establish the following. There is no regular subgroup of 𝖲𝖫_3(ℝ) isomorphic to ℤ^2 * ℤ. Regularity (defined with respect to a parabolic subgroup) is a form of discreteness for subgroups of, or representations into, noncompact semisimple Lie groups that coincides with discreteness in the rank-one setting, but is strictly stronger in higher rank. These subgroups already appear in work of Benoist <cit.>, and are the divergent subgroups of Guichard and Wienhard <cit.>; see Section <ref> for the precise definition. For instance, the aforementioned copies of ℤ^2 * ℤ in 𝖲𝖫_n(ℤ) for n≥ 4 are regular, as are Anosov representations of Gromov-hyperbolic groups <cit.> and, more generally, relative Anosov representations of relatively hyperbolic groups <cit.>. On the other hand, a lattice in a Cartan subgroup of 𝖲𝖫_3(ℝ) is not regular. Indeed, we show that regular ℤ^2 subgroups of 𝖲𝖫_3(ℝ) are of a very particular form. Recall that a (resp., minimal, maximal) horospherical subgroup of 𝖲𝖫_3(ℝ) is by definition the unipotent radical of a (resp., maximal, minimal) proper parabolic subgroup of the latter. A representation ρ:ℤ^2→𝖲𝖫_3(ℝ) is regular if and only if ρ(ℤ^2) is a lattice in a minimal horospherical subgroup of 𝖲𝖫_3(ℝ). It follows from Theorem <ref> and results[In greater detail, suppose that Γ < 𝖲𝖫_3(ℝ) is discrete and Zariski-dense, and that some minimal horospherical subgroup U of 𝖲𝖫_3(ℝ) is Γ-compact, where, following Oh <cit.>, we say that a closed subgroup H of 𝖲𝖫_3(ℝ) is Γ-compact if H/(H ∩Γ) is compact. Then Oh exhibits in <cit.> a (Γ-compact) maximal horospherical subgroup V of 𝖲𝖫_3(ℝ) containing U such that the other minimal horospherical subgroup U' of 𝖲𝖫_3(ℝ) contained in V is also Γ-compact. By Zariski-density of Γ, there is some γ∈Γ such that the Γ-compact minimal horospherical subgroups U and γ U' γ^-1 are opposite to one another <cit.>. One now applies the main theorem of <cit.> to conclude that Γ is commensurable to a conjugate of 𝖲𝖫_3(ℤ). See also Benoist's survey <cit.>.] of Oh <cit.> that any Zariski-dense discrete subgroup of 𝖲𝖫_3(ℝ) containing a regular ℤ^2 is in fact commensurable to an 𝖲𝖫_3(ℝ)-conjugate of 𝖲𝖫_3(ℤ). Theorem <ref> now follows since any discrete ℤ^2∗ℤ in 𝖲𝖫_3(ℝ) is necessarily Zariski-dense, while ℤ^2∗ℤ cannot be realized as a lattice in 𝖲𝖫_3(ℝ), for instance, because groups of the latter form enjoy Kazhdan's property (T) <cit.> (see also Furstenberg <cit.>). Moreover, as regularity is inherited by subgroups, and since 𝖲𝖫_3(ℤ) contains a lattice in a Cartan subgroup of 𝖲𝖫_3(ℝ), we deduce the following. A Zariski-dense regular subgroup of 𝖲𝖫_3(ℝ) contains no ℤ^2 subgroups. We remark that if F is a lattice in a minimal horospherical subgroup of 𝖲𝖫_3(ℝ), then the limit set of F in the Furstenberg boundary of 𝖲𝖫_3(ℝ) is the set of all projective flags of the form (z, ℓ), where either the point z ∈ℙ(ℝ^3) is fixed and ℓ⊂ℙ(ℝ^3) varies among all projective lines in ℙ(ℝ^3) containing z, or the projective line ℓ is fixed and z varies among all points of ℓ; for the precise notion of limit set used here, see Section <ref>. Thus, another consequence of Theorem <ref> is that a relative Anosov subgroup Γ of 𝖲𝖫_3(ℝ) contains no ℤ^2 subgroups, since the limit set of such Γ in the Furstenberg boundary of 𝖲𝖫_3(ℝ) is antipodal in the language of Kapovich–Leeb–Porti; see <cit.>. It is known that a group admitting a relative Anosov representation is relatively hyperbolic with respect to a family of virtually nilpotent subgroups; see <cit.>. Since polycyclic groups that lack ℤ^2 subgroups are virtually cyclic, and since groups that are hyperbolic relative to virtually cyclic (more generally, hyperbolic) subgroups are themselves hyperbolic, we conclude the following from the previous paragraph. Relative Anosov subgroups of 𝖲𝖫_3(ℝ) are Gromov-hyperbolic. In fact, in forthcoming work <cit.> of the second-named author with F. Zhu, Corollary <ref> is used to prove the stronger statement that a relative Anosov subgroup of 𝖲𝖫_3(ℝ) is virtually a free group or a surface group. The relevance of Theorem <ref> to Question <ref> is further explained by the following proposition. Let Γ be a lattice in a real linear algebraic semisimple Lie group G of noncompact type and P be a proper parabolic subgroup of G. Assume that P is conjugate to its opposite. If Δ < Γ is P-regular in G and there is a point in G/P that is opposite to each point in the limit set of Δ in G/P, then for some γ∈Γ, the subgroup ⟨Δ, γ⟩ < Γ decomposes as Δ * ⟨γ⟩. Thus, if there had been a regular ℤ^2 in 𝖲𝖫_3(ℤ) with “small” limit set in ℙ(ℝ^3)—a scenario that is ruled out by Theorem <ref>—then Proposition <ref> would have furnished a ℤ^2ℤ subgroup of 𝖲𝖫_3(ℤ), and even a regular such subgroup by work of Dey and Kapovich <cit.>. In light of Corollary <ref>, a result <cit.> of the second-named author with R. Canary asserting that Anosov subgroups of 𝖲𝖫_3(ℝ) are virtually isomorphic to Fuchsian groups, and aforementioned forthcoming work of the second-named author with Zhu, the following question seems natural. Is every regular Zariski-dense subgroup of 𝖲𝖫_3(ℝ) virtually isomorphic to a Fuchsian group? Acknowledgements. We thank Nic Brody, Alan Reid, Gabriele Viaggi, and Feng Zhu for interesting discussions. The first-named author was supported by the Huawei Young Talents Program. The second-named author was supported by the European Research Council (ERC) under the European's Union Horizon 2020 research and innovation programme (ERC starting grant DiGGeS, grant agreement No 715982). § PRELIMINARIES For two sequences (a_k)_k∈ℕ and (b_k)_k∈ℕ of positive real numbers, we write a_k ≍ b_k (resp., a_k=O(b_k)) if there is a constant C>1 such that C^-1a_k ≤ b_k≤ Ca_k (resp., a_k≤ Cb_k) for every k. Throughout this section, let G be a finite-center real semisimple Lie group with finitely many connected components and maximal compact subgroup K<G, and let X = G/K be the associated symmetric space. Let P be a proper parabolic subgroup of G, so that P is the stabilizer in G of a point z ∈∂_∞ X, where ∂_∞ X denotes the visual boundary of X. Pick a point o ∈ X, and let ξ be the geodesic ray in X emanating from o in the class of z. Fix also a Weyl chamber 𝔞^+ ⊂ X for G in X with origin o containing the ray ξ. A sequence (g_n)_n ∈ℕ in G is P-regular if the vector-valued distances d_𝔞^+(o, g_n o) diverge from each wall of 𝔞^+ not containing ξ. This notion is independent of all the choices made after specifying the parabolic subgroup P. If Γ is a discrete group, a representation ρ:Γ→ G is called P-regular if for every sequence (γ_n)_n∈ℕ in Γ with γ_n→∞, the sequence (ρ(γ_n))_n ∈ℕ is P-regular. We remark that such a representation has finite kernel and discrete image, and is moreover P^opp-regular, where P^opp denotes a parabolic subgroup opposite to P. A subgroup Δ of G is called P-regular if the inclusion Δ G is P-regular. Notice that if a subgroup Γ of G is P-regular then so are all subgroups of Γ. For more background, see Kapovich–Leeb–Porti <cit.>, as well as earlier work of Guichard–Wienhard <cit.> where the notion of P-regularity appears instead as P-divergence. (The case G=𝖲𝖫_3(𝕂)). Let 𝕂=ℝ or ℂ and set K_ℝ=𝖲𝖮(3) and K_ℂ=𝖲𝖴(3). Any element g∈𝖲𝖫_3(𝕂) can be written in the form g=k_g(σ_1(g),σ_2(g),σ_3(g))k_g' k_g,k_g'∈ K_𝕂, where σ_1(g)≥σ_2(g)≥σ_3(g) are uniquely determined and are called the singular values of g. The Cartan projection[This is the vector-valued distance d_𝔞^+(o, g o) with respect to a particular choice of point o ∈ X := 𝖲𝖫_3(𝕂)/K_𝕂 and Weyl chamber for 𝖲𝖫_3(𝕂) in X with origin o.] of g is μ(g)=(logσ_1(g),logσ_2(g),logσ_3(g))∈𝔞^+. We will simply say a sequence in (resp., a representation into, subgroup of) 𝖲𝖫_3(𝕂) is regular if it is P-regular with respect to the stabilizer P<𝖲𝖫_3(𝕂) of a line in 𝕂^3. This language is unambiguous for representations into (hence subgroups of) 𝖲𝖫_3(𝕂); indeed, if P and Q are any two proper parabolic subgroups of 𝖲𝖫_3(𝕂), then a representation ρ: Γ→𝖲𝖫_3(𝕂) is P-regular if and only ρ is Q-regular. A sequence (g_n)_n∈ℕ in 𝖲𝖫_3(𝕂) is regular if and only if lim_n →∞σ_1(ρ(g_n))/σ_2(ρ(g_n))=∞. Note that, in this case, the sequence (1/σ_1(ρ(g_n))ρ(g_n))_n ∈ℕ subconverges to a rank-1 matrix. We will also use the following characterization of P-regularity in terms of the dynamics on the flag manifold G/P. A sequence (g_n)_n∈ℕ is called P-contracting if there are points z^+ ∈ G/P and z^- ∈ G/P^opp such that g_n converges uniformly on compact subsets of C(z^-) to the constant function z^+, where C(z^-) denotes the set of all points in G/P opposite to z^-. In this case, we write (g_n)_n^+ := z^+. <cit.>. A sequence in G that is P-contracting is also P-regular. A sequence in G that is P-regular possesses a subsequence that is P-contracting. In particular, a sequence (g_n)_n ∈ℕ in G is P-regular if and only if every subsequence of (g_n)_n ∈ℕ possesses a P-contracting subsequence. The limit set of a subgroup Γ<G in the flag manifold G/P, denoted by Λ_Γ^P, is by definition the set of (γ_n)_n^+ ∈ G/P for all P-contracting sequences (γ_n)_n ∈ℕ in Γ. If P is conjugate to P^opp, two subsets Λ_1, Λ_2 ⊂ G/P are antipodal if each element of Λ_1 is opposite to each element of Λ_2. The proof of the following lemma uses the fact that, for a matrix g=(g_ij)_i,j=1^3 in 𝖲𝖫_3(ℂ), one has 1/√(3)\|\|g\|\|_2≤σ_1(g)≤ \|\|g\|\|_2, where \|\|g\|\|_2:=(∑_i,j=1^3\|g_ij\|^2)^1/2 is the ℓ^2-matrix norm of g. Let (g_n)_n∈ℕ be an infinite unbounded sequence of matrices in 𝖲𝖫_3(ℂ) with g_n=[ 1 x_n y_n; 0 1 z_n; 0 0 1 ]. Then (g_n)_n∈ℕ is regular if and only if lim_n→∞x_n^2+y_n^2+z_n^2/\|x_n\|+ \|z_n\|+\|x_nz_n-y_n\|=∞. A straightforward calculation shows that for every n∈ℕ we have that g_n^-1=[ 1 -x_n x_nz_n-y_n; 0 1 -z_n; 0 0 1 ]. Since g_n ∈𝖲𝖫_3(ℂ), we have σ_1(g_n)σ_2(g_n)σ_3(g_n)=1 and σ_1(g_n^-1)=σ_3(g_n)^-1 for every n, and hence we obtain σ_1(g_n)/σ_2(g_n)=σ_1(g_n)^2σ_3(g_n)/σ_1(g_n)σ_2(g_n)σ_3(g_n)=σ_1(g_n)^2/σ_1(g_n^-1). Now since σ_1(g_n) ≍ \|x_n\|+\|y_n\|+\|z_n\|, σ_1(g_n^-1) ≍ \|x_n\|+\|x_nz_n-y_n\|+\|z_n\|, the conclusion follows. § PROOF OF THEOREM <REF> Suppose that ρ:ℤ^2→𝖲𝖫_3(ℝ) is a regular representation. We first prove that the image of ρ is unipotent. Fix a ℤ-basis x,y ∈ℤ^2 for ℤ^2. Claim 1. The image ρ(ℤ^2) is a unipotent subgroup of 𝖲𝖫_3(ℝ). Suppose otherwise. Assume first that all the eigenvalues of ρ(x) are distinct. Then, up to conjugation within 𝖲𝖫_3(ℂ), the image of ρ is a diagonal subgroup of 𝖲𝖫_3(ℂ). Since ρ is discrete, we have that μ(ρ(ℤ^2)) contains the intersection of 𝔞^+ with a lattice in 𝔞. It follows that ρ is not regular in this case. In the remaining case, up to conjugating ρ within 𝖲𝖫_3(ℝ), we have ρ(x)=[ λ_x 1 0; 0 λ_x 0; 0 0 λ_x^-2 ], ρ(y)=[ λ_y α_y 0; 0 λ_y 0; 0 0 λ_y^-2 ], for some λ_x, λ_y, α_y ∈ℝ. Then we have ρ(x^n y^m) = λ_x^n λ_y^m [ 1 λ_x^-1 n + α_y λ_y^-1 m 0; 0 1 0; 0 0 λ_x^-3nλ_y^-3m ] for n, m ∈ℤ. Now there is an infinite sequence of distinct pairs of integers (n_k,m_k)_k∈ℕ such that lim_k (λ_x^-1n_k + α_y λ_y^-1m_k) = 0 and lim_k( λ_x^n_kλ_y^m_k ) = ∞; note we can indeed ensure the latter, since otherwise discreteness of ρ would be violated. Observe that σ_1(ρ(x^n_ky^m_k))≍λ_x^n_kλ_y^m_k as k→∞ and that the sequence of matrices (1/λ_x^n_kλ_y^m_kρ(x^n_ky^m_k))_k∈ℕ converges to a matrix of rank 2. In particular, the sequence (ρ(x^n_ky^m_k))_k∈ℕ cannot be regular, so that ρ is not regular. Therefore, the image of the representation ρ:ℤ^2 →𝖲𝖫_3(ℝ) has to be unipotent. We show that ρ(ℤ^2) lies in a minimal horospherical subgroup of 𝖲𝖫_3(ℝ). Up to conjugation, we may assume that ρ(x)=[ 1 a_x b_x; 0 1 c_x; 0 0 1 ], ρ(y)=[ 1 a_y b_y; 0 1 c_y; 0 0 1 ], where a_x,b_x,a_y,b_y∈ℝ. Since ρ(x) commutes with ρ(y), we have that a_xc_y=a_yc_x. Claim 2. The identity a_yc_x=a_xc_y=0 holds. We prove the claim by contradiction. Assuming a_yc_x≠ 0, we will exhibit infinite sequences (w_m)_m∈ℤ in ℤ^2 such that (σ_1/σ_2(ρ(w_m)))_m∈ℤ has an infinite bounded subsequence. Set λ:=c_x/a_x=c_y/a_y≠ 0. By conjugating the image of ρ with the diagonal matrix (1,1,λ)∈𝖦𝖫_3(ℝ), we may assume that a_x=c_x and a_y=c_y, and hence ρ(x)=[ 1 a_x b_x; 0 1 a_x; 0 0 1 ], ρ(y)=[ 1 a_y b_y; 0 1 a_y; 0 0 1 ]. A straightforward calculation shows that, for m,n ∈ℤ, ρ(x^n)=[ 1 n a_x n(b_x-a_x^2/2)+n^2 a_x^2 /2; 0 1 n a_x; 0 0 1 ], ρ(y^m)=[ 1 m a_y n(b_y-a_y^2/2)+m^2 a_y^2 /2; 0 1 m a_y; 0 0 1 ], ρ(x^ny^m)=[ 1 a(m,n) b(m,n); 0 1 a(m,n); 0 0 1 ], where a(m,n) := n a_x+m a_y, b(m,n) := mn a_xa_y+n^2 a_x^2/2+m^2 a_y^2/2+n(b_x-a_x^2/2)+m(b_y-a_y^2/2) = 1/2(n a_x+ma_y)^2+n(b_x-a_x^2/2)+m(b_y-a_y^2/2) =1/2a(m,n)^2+B_x/a_xa(m,n)+m(B_y- a_y/a_xB_x) =1/2( (a(m,n)+B_x/a_x)^2 - 2B_x^2/a_x^2+mZ_x,y), where the constants B_x,B_y,Z_x,y∈ℝ are defined as follows: B_x :=b_x-a_x^2/2, B_y:=b_y- a_y^2/2 Z_x,y :=2(B_y- a_y/a_xB_x). Suppose first that Z_x,y=0, and choose infinite sequences (k_m)_m∈ℕ, (r_m)_m∈ℕ of integers such that \|a(k_m,r_m)\| = \|k_m a_x+r_m a_y\| ≤ 1 for every m. By our assumption that Z_x,y=0, we have that (b(k_m,r_m))_m∈ℤ is also bounded, and hence so is (ρ(x^k_my^r_m))_m∈ℕ, violating our assumption that ρ is discrete and faithful. Now suppose that Z_x,y≠0. Let m∈ℤ with mZ_x,y<0, and define n_m:=⌊ -ma_y/a_x+1/a_x√(\|mZ_x,y\|)⌋ so that \|a(m,n_m)-√(\|mZ_x,y\|)\|=\|a_x\| \| n_m+a_y/a_xm-1/a_x√(\|mZ_x,y\|)\| ≤ \|a_x\|. Note that \|a(m,n_m)\|≍√(\|m\|), and hence \|b(m,n_m)\| ≤B_x^2/a_x^2+1/2\|a(m,n_m)+B_x/a_x-√(\|mZ_x,y\|)\|·\|a(m,n_m)+B_x/a_x+√(\|m Z_x,y\|)\| ≤B_x^2/a_x^2+(\|a_x\|+\|B_x\|/\|a_x\|)( \|a(m,n_m)\|+\|B_x\|/\| a_x\|+√(\|mZ_x,y\|)) =O(√(\|m\|)), mZ_x,y→ -∞, where the second inequality follows from (<ref>). Finally, we claim that the sequence ρ(w_m)_m∈ℤ, where w_m:=x^n_my^m, has an infinite subsequence that is not regular. Indeed, for m∈ℤ with mZ_x,y<0, we have by Lemma <ref> that σ_1(ρ(w_m))/σ_2(ρ(w_m))≍2a(m,n_m)^2+b(m,n_m)^2/2\|a(m,n_m)\|+\| a(m,n_m)^2 -b(m,n_m)\| and the latter fraction remains bounded since \|a(m,n_m)\|≍√(\|m\|) and \|b(m,n_m)\|=O(√(\|m\|)) as mZ_x,y→ -∞. We thus arrive at a contradiction, and so we conclude that a_xc_y=a_yc_x=0. Completing the proof of Theorem <ref>. We have reduced to the case that ρ is as in (<ref>) with a_xc_y=a_yc_x=0. Suppose first that a_x=c_x=0 and a_yc_y≠ 0. In this case, we may define a new representation ρ':ℤ^2→𝖲𝖫_3(ℝ) given by ρ'(x)=ρ(xy), ρ'(y)=ρ(y). Since ρ is assumed to be regular, the same holds for ρ'. Now note that the (1,2) and (2,3) entries of ρ'(x) and ρ'(y) are non-zero, so that the representation ρ' cannot be regular by Claim 1, a contradiction. By applying the same argument with x and y interchanged, we conclude that in fact a_x=a_y=0 or c_x=c_y=0 as desired. Finally, we verify that if ρ(ℤ^2) is a lattice in a minimal horospherical subgroup of 𝖲𝖫_3(ℝ), then ρ is indeed regular. This follows immediately from Lemma <ref>, but we present the following geometric argument that applies in any dimension. We first consider the case that ρ(ℤ^2) is a lattice in the unipotent radical of the stabilizer in 𝖲𝖫_3(ℝ) of a hyperplane in ℝ^3. Claim 3. Let U be the unipotent radical of the stabilizer in 𝖲𝖫_d(ℝ) of a hyperplane V ⊂ℝ^d. Then any lattice F in U is P-regular, where P is the stabilizer of a line in ℝ^d. We identify the U-invariant affine chart ℙ(ℝ^d)∖ℙ(V) with ℝ^d-1, so that U acts on ℝ^d-1 via translations. For a point z ∈ℝ^d-1 and R>0, denote by B(z, R) the Euclidean ball in ℝ^d-1 of radius R centered at z. Fix a point z_0 ∈ℝ^d-1. Now let (γ_n)_n ∈ℕ be a sequence in F with γ_n →∞. Then, since ℙ(ℝ^d) is compact, up to extraction, we have that γ_n z_0 → z^+ for some z^+ ∈ℙ(ℝ^d). Moreover, since F acts properly on ℝ^d-1, we in fact have z^+ ∈ℙ(V). We claim that (γ_n)_n ∈ℕ converges uniformly on compact subsets of ℝ^d to the constant function z^+. Indeed, let W_n be a metric 1/n-neighborhood of z^+ in ℙ(ℝ^d) with respect to the Fubini–Study metric on the latter; viewed in our chosen affine chart, the boundary of W_n is a two-sheeted hyperboloid for n sufficiently large. It suffices to show that for any n ∈ℕ, there is some N ∈ℕ such that W_n ⊃γ_N B(z_0,n) = B(γ_N z_0, n). But this is true since, given any n ∈ℕ, there is some m ∈ℕ such that B(z,n) ⊂ W_n for each z ∈ W_m. In the remaining case, where ρ(ℤ^2) lies in the unipotent radical of the stabilizer of a line in ℝ^3, one argues as above with the dual representation ρ^∗ instead of ρ, as σ_i(ρ^∗(γ))=σ_4-i(ρ(γ))^-1 for γ∈ℤ^2 and 1≤ i≤ 3. Following the above approach, it is not difficult to see that if ⟨ a,b⟩<𝖲𝖫_3(ℝ) is a discrete ℤ^2 which is not contained in a minimal horospherical subgroup, then the limit set of ⟨ a,b ⟩ in ℙ(ℝ^3) consists of at most three points. Now we provide an example of a family of regular representations {ρ_t:ℤ^2→𝖲𝖫_3(ℂ)}_t∈ℝ such that for every t≠ 0, ρ_t is regular but fails to be contained in a minimal horospherical subgroup. For t∈ℝ consider the representation ρ_t:ℤ^2→𝖲𝖫_3(ℂ) defined on the generating set {x,y} as follows: ρ_t(x)=[ 1 1 1+ti; 0 1 1; 0 0 1 ], ρ_t(y)=[ 1 1 2+3ti; 0 1 1; 0 0 1 ]. Note that ρ_t is a faithful representation for every t∈ℝ. For m,n∈ℤ a calculation shows that ρ_t(x^ny^m) =[ 1 n+m f_t(n,m); 0 1 n+m; 0 0 1 ] f_t(n,m) :=1/2(n+m)^2+ m(3ti+3/2)+n(ti+1/2). In particular, for t≠ 0 we have that \|f_t(n,m)\|^2=1/4((n+m)^2+3m+n)^2+t^3(3m+n)^2≍ (n+m)^4+(3m+n)^2, (n,m)→∞ and hence lim_(n,m)→∞\|f_t(n,m)\|/\|n+m\|+1=∞. In particular, we deduce from Fact <ref> that ρ_t is regular for t≠ 0 and in this case its limit set in ℙ(ℂ^3) is the singleton {[e_1]}. However, note that ρ_0 is discrete and faithful but cannot be regular by Theorem <ref>. § PROOF OF PROPOSITION <REF> To prove Proposition <ref>, we use the following variant of the ping-pong lemma. Similar arguments appear in work of Dey and Kapovich <cit.>, but we include them here for the convenience of the reader. Let G be a Lie group acting continuously on a manifold ℱ. Suppose Γ_1, Γ_2 < G are infinite[In fact, our argument requires only that \|Γ_i\| > 2 for i=1,2. The statement remains true if at least one of the Γ_i has size at least 3.] and that there are closed nonempty disjoint subsets C_1, C_2 ⊂ℱ such that γ_i C_j ⊂ C_i for γ_i ∈Γ_i ∖{1} and i ≠ j. Then ⟨Γ_1, Γ_2 ⟩ < G is discrete and decomposes as Γ_1 Γ_2. Let ρ: Γ_1 * Γ_2 → G be the map induced by the inclusions Γ_i ⊂ G for i=1,2. Take a sequence w_n ∈Γ_1 * Γ_2 and suppose for a contradiction that w_n ≠ 1 for any n ∈ℕ but lim_nρ(w_n) = 1 ∈ G. Up to relabeling Γ_1 and Γ_2 and extracting a subsequence of (w_n)_n, we may assume that for some fixed i ∈{1,2} and each n ∈ℕ, the first letter (read from the left) in the canonical form of w_n belongs to Γ_1 ∖{1} and the last belongs to Γ_i ∖{1}. Suppose first that i=1. Then ρ(w_n)C_2 ⊂ C_1 for each n ∈ℕ. Selecting some z ∈ C_2, we then have z = lim_n ρ(w_n) z ∈ C_1 since C_1 is closed, so that z ∈ C_1 ∩ C_2, a contradiction. Now suppose that i=2. Pick an element γ_1 ∈Γ_1 ∖{1}, and let w_n' = γ_1 w_n γ_1^-1 for n ∈ℕ. Note that we still have lim_n ρ(w_n') = 1. If for some subsequence (w'_n_k)_k of (w_n')_n the canonical form of w'_n_k has odd length for each k ∈ℕ, then one obtains a contradiction as in the previous paragraph. Otherwise, there is some N ∈ℕ such that the first letter (read from the left) in the canonical form of w_n is γ_1^-1 for n ≥ N. Now select γ'_1 ∈Γ_1 ∖{1, γ_1}, and let w”_n = γ_1' w_n (γ_1')^-1 for n ∈ℕ. Then again we have lim_n ρ(w_n”) = 1, but now the canonical form of w”_n has odd length for n ≥ N, so that we arrive at a contradiction as in the previous paragraph. Since we have assumed that there is a point in G/P opposite to each point in Λ_Δ^P, we can find a compact neighborhood W_0 of Λ_Δ^P and a compact subset U ⊂ G/P with nonempty interior such that U and W_0 are antipodal; see <cit.>. As in <cit.>, we have by P-regularity of Δ that δ U ⊂ W_0 for each nontrivial element δ∈Δ apart from a finite list δ_1, …, δ_k ∈Δ∖{1}. For i =1, …, k, let Z_i be the set of all z ∈ G/P such that z is not opposite to δ_i z. Since each of the Z_i is a proper algebraic subset of G/P, we have that U ∖⋃_i=1^k Z_i has nonempty interior. We can thus find a compact subset V ⊂ U ∖⋃_i=1^k Z_i with nonempty interior such that V and δ_i V are antipodal for i=1, …, k. Setting W = W_0 ∪⋃_i=1^k δ_i V, we then have that V and W remain antipodal in G/P. Now since Γ is a lattice in G, there is an element g ∈Γ generating a P-regular cyclic subgroup with Λ_⟨ g ⟩^P ⊂ V (one can always choose P-proximal such g ∈Γ, the existence of which already follows, for instance, from <cit.>). There is then some N ∈ℕ such that g^n W ⊂ V for all n ∈ℤ with \|n\| ≥ N. Moreover, by design, we have δ V ⊂ W for each δ∈Δ∖{1}. Setting γ = g^N, we conclude from Lemma <ref> that ⟨Δ, γ⟩ < Γ decomposes as Δ * ⟨γ⟩. siam
http://arxiv.org/abs/2306.07133v2	20230612141024	Randomness and early termination: what makes a game exciting?	[ "Gaoyue Guo", "Dylan Possamaï", "Christoph Reisinger" ]	math.PR	[ "math.PR", "math.AP", "math.OC" ]	plainnat numbers,open=[,close=] addtoresetequationsection .equation * * TheoremTheorem[section] Lemma[Theorem]LemmaProposition[Theorem]PropositionCorollary[Theorem]CorollaryDefinition[Theorem]DefinitionRemark[Theorem]RemarkExample[Theorem]ExampleNotation[Theorem]NotationHypothesis[Theorem]HypothesisAssumption[Theorem]Assumption 𝔸𝔹ℂ𝔻̣𝔼𝔽𝔾ℍ̋𝕀𝕁𝕂Ł𝕃𝕄ℕØ𝕆ℙℚℝ𝕊𝕋𝕌𝕍𝕎𝕏𝕐ℤ A B C D E F G H I J K L M N O P Q R S T U V W X Y Z αβϵγ εζηþθλμνρ̊στϕφψχ κ̨ωΓΛΣΨδΩΘΦ ≡⊂⊃⊆⊇≈≼∂·⋯ ⇒⟶⟺↦↘↖ 𝖯𝖣X̂Ω̂τ̂ł lebProof.LLμ̃ḍ1α̇g̃h̃BΣθΘXXℓℓττ Erfhmargin=2.2cm,vmargin=2.5cm𝒫_a^b Randomness and early termination: what makes a game exciting? Gaoyue Guo[Université Paris-Saclay CentraleSupélec, Laboratoire MICS and CNRSFR-3487, France, [email protected].] Dylan Possamaï[ETH Zürich, Department of Mathematics, Switzerland, [email protected].] Christoph Reisinger[University of Oxford, Mathematical Institute, United Kingdom, [email protected].] July 31, 2023 ============================================================================================================================================================================================================================================================================================================================================================= In this short paper, we revisit an open problem posed by on the max-entropy win-probability martingale: given two players of equal strength, such that the win-probability is a martingale diffusion, which of these processes has maximum entropy and hence gives the most excitement for the spectators? From a stochastic control perspective, the corresponding value function can be characterised by a nonlinear parabolic PDE, for which we show existence and uniqueness of classical solutions. We establish key qualitative properties of the solution including concavity, monotonicity, and convergence to a steady state. Moreover, we construct convergent numerical approximations, which allow us to highlight the behaviour of the win-probability process in the present case where the match may end early, in contrast to recent work by where the match always runs the full length. Keywords: log diffusion PDE, most uncertain match, stochastic control, classical solution, weak solution, viscosity solution. § INTRODUCTION This paper is motivated by one of 's open problems about the characterisation of the `most random martingale'. To be more precise, given a match of length T>0, for two players—or two teams—of equal level, denote by X_t the winning probability of one player (or one team) at time t∈[0,T]. The win-probability X (X_t)_t∈ [0,T] is thus a martingale starting at X_0=1/2 and ending in X_T ∈{0,1}. The question then becomes: which choice of X leads to the most excitement to spectators, in the sense that the outcome remains uncertain until late? Taking relative entropy as a measure for `random', a heuristic derivation by <cit.> leads to the following PDE for e: [0,T]× [0,1]⟶, with e(t,x) being the entropy given X_t = x 2∂_t e(t,x) = log(-∂_xxe(t,x)), (t,x) ∈ (0,T) × (0,1)Ω_T, e(T,x) = 0, x ∈ (0,1), e(t,0) = e(t,1) = 0, t ∈ (0,T). Specifically, at the end of <cit.>, formulates the following open questions about (<ref>)–(<ref>)–(<ref>): Q1: find an explicit solution of the PDE above, or at least prove existence and uniqueness of a solution; Q2: find some of its qualitative properties; Q3: in particular, what is the distribution of X_T/2? From our analysis, we can now answer these questions as follows: A1: in <Ref> below, we ascertain the existence and uniqueness of a classical solution. Due to the boundary conditions, a separation ansatz as in <cit.> fails, even close to T, and we were unable to find a closed form; A2: we were able to establish natural qualitative properties of the solution, such as monotonicity, concavity, and symmetry, summarised also in <Ref> and illustrated by a numerical solution in <Ref>; A3: in absence of an analytical expression, we give a numerical approximation of the density at different times, including at T/2, in <Ref>, see also the discussion thereafter. A natural and unified approach to 's `most random martingale' <cit.> comes from martingale optimal transport. Namely, fix a filtered probability space (Ω,,=(_t)_t∈[0,T],), and consider the optimisation problem sup_X∈^[F(X)], where is some suitable set of -valued, (,)-martingales X such that [X_0=1/2]=1=[X_T∈{0,1}], and the choice of F:⟶ encapsulates some criterion that quantifies the game's attractiveness. In the recent paper <cit.>, take to be the collection of what they call `win martingales', that is to say martingales on [0,T], which terminate in {0,1}, and whose quadratic variation is absolutely continuous with respect to Lebesgue measure. Up to enlarging the underlying probability space, this means that for any X∈, there exists an -valued volatility process σ with X_t =1/2 + ∫_0^tσ_s d W_s, t ∈ [0,T]. The criterion F=F_0[ consider G_0(X) F_0(X)-.8∫^T_0σ_t^2/2 d t, as the objective function. Nevertheless, Itô's formula applied to X_t^2 yields ^[∫_0^T σ_t^2 d t]=^[X_T^2-X_0^2]=1/4 and thus ^[G_0(X)]=^[F_0(X)]-1/8 for all X∈. Therefore, we do not distinguish F_0 and G_0 without any loss of generality.] is then defined specifically through the specific relative entropy as F_0(X)1/2∫_0^T (log(σ_t^2) +1) d t, X∈. It is shown in <cit.> that the optimiser for the above problem actually corresponds to a diffusion martingale, that is to say that the optimal process σ can by written in feedback form as σ^⋆(·,X_·) through the map [0,T]×∋ (t,x)⟼σ^⋆(t,x)sin(π x)/(π√(T-t))∈. Moreover, the associated entropy function is given by e^⋆(t,x):=(T-t)(log(sin(π x)/π√(T-t))+1/2), (t,x)∈[0,T]×(0,1), which can be found, e.g., from the relationship ∂_xx e^⋆(t,x)=-1/σ^⋆(t,x)^2, satisfies (<ref>)–(<ref>), but not (<ref>), as in the original problem stated in <cit.>. In fact, it explodes at x∈{0,1}, at least for t∈[0,T). We show later, in <Ref> and <Ref>, that the solution e to (<ref>)–(<ref>)–(<ref>) admits a probabilistic representation that has a similar form to (<ref>), where the essential difference arises in the choice of F, i.e. F(X)=1/2∫_0^min(T,τ)(log(σ(t,X_t)^2) +1) d t, where τinf{t∈ [0,T]: X_t∉ (0,1)} is the first exit time of X from (0,1). Here, the match under our consideration may end strictly prior to T, which for instance would be the case in a boxing match. As a consequence, the entropy function satisfies the absorbing boundary conditions (<ref>), whereas σ^⋆(t,x) from <cit.> vanishes at the boundaries and prevents the process from hitting the boundary prior to the end time. Viewed differently, (<ref>) imposes a penalty of -∞ if the process gets absorbed at the boundary prior to time T. <Ref> highlights, for T=1, the difference between optimal matches which may or may not terminate early. Shown left is the probability density q(t,·) of X_t for σ^⋆ found by <cit.>, for three different times t; shown right is the sub-probability density of X_t when it does not hit the boundary, under the optimal volatility in 's original model, found by computations explained in <Ref>. The density is in both cases approximated by a finite-difference solution of the corresponding Kolmogorov forward equation. First, in 's model, there is a significant probability that the match started at 0 terminates before 1, i.e., X hits a boundary before time 1, namely with 63% chance the match is over before t_0=0.5, with 88% before t_1=0.9, and with 93% before t_2=0.99 (these being found by computing 1 minus the integral of q(t,·) over (0,1)). Until close to the end, provided the match has not ended, the highest density is found in the centre. Under the model in <cit.>, where the match always runs until time 1, i.e., the process is forced to stay in (0,1), probability mass is fairly evenly distributed at time t_0=0.5, and then accumulates close to the boundaries, terminating in two atomic masses of weight 0.5 at 0 and 1 at time 1. One could argue that the `most random match' is not necessarily equivalent to the `most exciting match', where the former emphasises the outcome uncertainty and the latter could express, say, the excitement resulting from sudden changes within the game, e.g., the more oscillating the martingale X, the more exciting the match.[A typical exciting match is the 2008/2009 Champions League semi-final between Chelsea and Liverpool. First leg 3:1; second leg, aggregate: 3:2, 3:3, 4:3, 5:3, 6:3, 6:4, 6:5, 7:5.] To address this issue mathematically, one might consider the martingale optimal transport problem (<ref>) with F(X)=max{U_(X), D_(X)} F(X)=1_{max(U_(X), D_(X))≥ n}, where U_(X)(resp. D_(X)) denotes the number of up-crossings (resp. down-crossings) of X over the interval [, 1-] for some ∈ (0,1/2), and n∈^⋆ corresponds to some psychological threshold of the spectators, see e.g., <cit.>. In what follows, we adopt 's criterion (see the heuristic derivation in <cit.>) and focus on the terminal-boundary value problem (<ref>)–(<ref>)–(<ref>). Differentiating formally (<ref>) twice with respect to x and setting p(t,x) -∂_xxe(1-t,x), we obtain 2∂_tp(t,x) =∂_xx(log(p(t,x)), (t,x) ∈Ω_T, p(0,x) = 0, x ∈ (0,1), p(t,0) = p(t,1) = 1, t ∈ (0,T), where a smooth-fit, which we will justify rigorously later, yields p(t,0)=-∂_xxe(1-t,0)=exp(∂_te(1-t,0))=1 (resp. p(t,1)=-∂_xxe(1-t,1)=exp(∂_te(1-t,1))=1). <Ref>, known as the logarithmic diffusion equation, has mathematical significance as it arises in the study of Ricci flow (see, e.g., <cit.>, <cit.>), and physical significance in connection with the dynamics of thin liquid films (see, e.g., <cit.>, <cit.>, <cit.>) and as a model for the limiting density in the kinetics of two gases moving against each other and obeying the Boltzmann equation (see, e.g., <cit.>, <cit.> and <cit.>). To the best of our knowledge and in contrast to (<ref>), studies of the theory and approximation of (<ref>) are close to non-existent so far. The only related problem we are aware of is the parabolic Monge–Ampère equation—for the study of the Kähler–Ricci flow—together with an initial condition (without boundary conditions; see <cit.>). The present paper shows the well-posedness of (<ref>)–(<ref>)–(<ref>) and characterises its properties, filling in particular the gap between (<ref>) and (<ref>) by a representation formula. We will also work heavily with the control formulation of the problem, specifically to show a lower positive bound for the optimal control, which allows us to deduce strict ellipticity of the PDE. Before stating our main result, we introduce the following definition of weak solution to the logarithmic diffusion equation in <cit.>. Let g∈ H^1((0,1)) ∩Ł^∞((0,1)) be non-negative and c>0. Then u:Ω_T⟶ is said to be a weak solution to 2∂_tu(t,x) =∂_xx(log(u(t,x)), (t,x) ∈Ω_T, u(0,x) = g(x), x ∈ (0,1), u(t,0) = u(t,1) = c, t ∈ (0,T), if the following conditions hold (i)u(t,0)= u(t,1) = c for all t ∈ (0,T); (ii)u∈Ł^2(Ω_T)∩ C([0,T], H^1((0,1)) is non-negative; (iii)log(u)∈Ł^1_loc(Ω_T), ∂_xlog(u)∈Ł^2(Ω_T); (iv) the identity ∫_0^T∫_0^1 (u(t,x)∂_tϕ(t,x) -1/2∂_x(log(u(t,x)))∂_xϕ(t,x) ) d x d t + ∫_0^1 g(x)ϕ(0,x) d x =0, holds for all ϕ∈ H^1(Ω_T)∩ C(Ω_T) vanishing at t=T, x=0 and x=1. Define for future use e_∞(x) x(1-x)/2, x∈[0,1], the stationary solution to (<ref>)–(<ref>). The main result in the present paper is the following theorem. There exists a unique solution e∈ C^1,2(Ω_T) to (<ref>)–(<ref>)–(<ref>). Moreover, it holds that * 0≤ e(t,x)≤ e_∞(x) for all (t,x)∈Ω_T; * e admits the following integral representation e(t,x)=-∫_0^x∫_0^y p(T-t,z) d z d y + x∫_0^1∫_0^y p(T-t,z) d z d y, (t,x) ∈Ω_T, where p is the unique weak solution to (<ref>)–(<ref>)–(<ref>); * t⟼ e(t,x) is non-increasing for all x∈ [0,1]; * x⟼ e(t,x) is concave and symmetric with respect to x=1/2, for all t∈ [0,T]. These key features of the solution from <Ref> qualitatively describe the graph seen in <Ref> below, where we set again T=1. Notice also that ∂_t e(t,x) ⟶ -∞ for t ↑ 1, which is necessary for ∂_xxe(x,t) being continuous in time at t=1. We observe that the curves x⟼ e(t,x) (resp. x⟼∂_xxe(t,x) in Fig. <ref> at the end of the paper) evolve very slowly for t∈ [0,0.7] and vary increasingly fast for t∈ [0.9,1). This indicates that the criterion ‘most random martingale’ is consistent with the notion of ‘most uncertain match’, where the outcome (conditional on the match not having ended prematurely) is still uncertain until near the end; see also Fig. <ref>. § A CONTROL PROBLEM REPRESENTATION Inspired by the Legendre transform of the concave function (-∞,0)∋ x⟼log(-x)∈, i.e. inf_a≥ 0{-a x - log a - 1}= -∞1_{x≥ 0}+ log(-x)1_{x<0}, the PDE (<ref>) can be rewritten as the following Hamilton–Jacobi–Bellman equation ∂_te(t,x) = 1/2inf_a≥ 0{-a ∂_xxe(t,x) - log a - 1}, (t,x) ∈Ω_T. Now let us introduce the probabilistic counterpart of (<ref>), and consider the following stochastic control problem. Let (Ω,ℱ, ℙ) be a probability space on which a one dimensional (,)–Brownian motion W is defined, where is the -completion of the natural filtration of W. Denote by 𝒜 the set of –progressively measurable processes α=(α_t)_t≥ 0 taking values in ℝ_+ such that 𝔼^[∫_0^t α_s d s]<∞, ∀ t∈[0,T]. For α∈𝒜, t∈ [0,T] and x∈ [0,1], denote by X^α,t,x=(X_s^α,t,x)_s∈ [t,T] the controlled process given as X_s^α,t,x x+ ∫_t ^s √(α_r) d W_r. Define further the reward function J(t,x,α)^[ 1/2∫_t^min{T,τ^α,t,x}(1+log(α_s)) d s], τ^α,t,xinf{s≥ t: X^α,t,x_s∉ (0,1)}, and the value function v(t,x)sup_α∈ J(t,x,α), (t,x)∈Ω_T. It follows by definition that v(T,x)=v(t,0)=v(t,1)=0 for all (t,x)∈Ω_T. Provided that there exists a classical solution with ∂_xxe(x,t) < 0, the minimiser of the right-hand side in (<ref>) is then a^⋆(t,x) -1/∂_xxe(t,x), which makes the link with the choice of the optimal volatility function σ^⋆ as explained in <Ref>. In particular, a^⋆(t,0) = a^⋆(t,1) = 1. Our goal here is to identify v as the unique bounded viscosity solution of (<ref>)–(<ref>)–(<ref>), and to prove further that v is smooth enough. In order to do so, the current section focuses on first proving that v is indeed bounded, and second that v(t,x) can never be achieved by J(t,x,α) when the control α is too close to 0. The latter property is fundamental for obtaining a regularity result later on, as it will ensure that <Ref> is uniformly elliptic. We start by establishing the boundedness of v. For every (t,x)∈Ω_T, the inequality 0≤ v(t,x)≤ e_∞(x)≤ 1/8 holds. For the lower bound, we simply notice that v(t,x)≥ J(t,x,1/ e)= 0. For the upper bound, recall e_∞'(x)=1/2-x and e_∞”(x)=-1, fix an arbitrary admissible control α∈, let θ^αmin{T,τ^α,t,x}, and apply Itô's formula to get e_∞(X^α,t,x_θ^α)-e_∞(x) =∫_t^θ^α√(α_s)e_∞^'(X^α,t,x_s) dW_s-1/2∫_t^θ^αα_s ds ≤∫_t^θ^α√(α_s)e_∞^'(X^α,t,x_s) dW_s-1/2∫_t^θ^α(1+log(α_s))) ds, where we note that 1+log (y)≤ y for all y≥ 0. Since e_∞^' is bounded on Ω_T, and α is non-negative, we can take expectations above and deduce that e_∞(x)≥^[e_∞(X^α,t,x_θ^α)+1/2∫_t^θ^α(1+log(α_s))) ds]≥^[1/2∫_t^θ^α(1+log(α_s))) ds]=J(t,x,α). By the arbitrariness of α∈, this proves the desired result. Next, for each c≥ 0, define the subset 𝒜_c{α∈: inf_t≥ 0α_t≥ c}, and notice that =_0. Then the following proposition shows that the optimal control can be achieved in _c for c>0 small enough. For every (t,x)∈Ω_T, it holds that v(t,x)=sup_α∈_1/e J(t,x,α). Without loss of generality, we only deal with the case t=0. By definition, it suffices to prove J(0,x,α)≤ J(0,x,β) for every α∈, where β∈_1/e is defined by β_tmax{α_t,1/e}, t≥ 0. Mimicking the proof of the Dambis–Dubins–Schwarz theorem, one may find some probability space on which there exist a Brownian motion B and two stochastic processes f, g such that f_t≥ 0, g_t=max{f_t,1/e} for all t≥ 0 and (X^α,0,x)=((x+B_τ_t)_t≥ 0), (X^β,0,x)=((x+B_σ_t)_t≥ 0), where τ_t∫_0^t f_s^2 d s, σ_t∫_0^t g_s^2 d s, ∀ t≥ 0. Therefore J(0,x,α)=^[1/2∫_0^min{T,S_α}(1+log(f_s)) d s], J(0,x,β)=^[1/2∫_0^min{T,S_β}(1+log(g_s)) d s], where S_α (resp. S_β) denotes the first time that the process (x+B_τ_t)_t≥ 0 (resp. (x+B_σ_t)_t≥ 0) exits from (0,1). In particular, it follows that S_α = inf{t≥ 0: τ_t≥ S}, S_β = inf{t≥ 0: σ_t≥ S}, where S is the first exit time of (x+B_t)_t≥ 0 from (0,1). In what follows, we prove the stronger pathwise result ∫_0^min{T,S_α}(1+log(f_s)) d s ≤∫_0^min{T,S_β}(1+log(g_s)) d s, which yields immediately ^[∫_0^min{T,S_α}(1+log(f_s)) d s]≤^[∫_0^min{T,S_β}(1+log(g_s)) d s], as desired. In order to get the aforementioned result in <Ref>, set S̃_αmin{T,S_α}, S̃_βmin{T,S_β}, F_t f_t^2 and G_t g_t^2, t≥ 0. Then one has by assumption ∫_0^S_α F_t d t = ∫_0^S_β G_t d t, ∫_0^S̃_α F_t d t ≤∫_0^S̃_β G_t d t. Indeed, the first equality simply comes from the fact that S_α and S_β are the right-inverses of τ_· and σ_· at S, while the second inequality can be obtained by considering all the possible case, and recalling that we always have S_β≥ S_α. For convenience, we now define H F-e^-2. Notice then that G_t=max{F_t,e^-2}=e^-2+H_t^+, t≥ 0. It follows that ∫_0^S̃_α(e^-2+H_t^+-H_t^-) d t≤∫_0^S̃_β(e^-2+H_t^+) d t, or equivalently e^-2(S̃_α-S̃_β)+∫_S̃_β^S̃_α H_t^+ d t-∫_0^S̃_α H_t^- d t≤ 0. We now claim that the following inequality holds ∫_0^S̃_α(1+ 1/2log(e^-2+H_t^+-H_t^-)) d t≤∫_0^S̃_β(1+ 1/2log(e^-2+H_t^+)) d t. Indeed, since H^+ and H^- have disjoint supports and 1+log(e^-2)/2=0, we have 1+1/2log(e^-2+H_t^+-H_t^-)=(1+1/2log(e^-2+H_t^+))+(1+1/2log(e^-2-H_t^-)), and thus proving <Ref> is equivalent to showing that ∫_S̃_β^S̃_α(1+1/2log(e^-2+H_t^+)) d t+∫_0^S̃_α(1+1/2log(e^-2-H_t^-)) d t≤ 0. Note further that x⟼ 1+log(e^-2+x)/2 is concave, vanishes at 0, and its derivative at 0 is e^2/2>0. This implies that (<ref>) follows from ∫_S̃_β^T̃_α H_t^+ d t-∫_0^S̃_α H_t^- d t≤ 0, which is clearly ensured by <Ref>. Hence, we obtain ∫_0^S̃_α(1+log(f_t)) d t = ∫_0^S̃_α(1+ 1/2log(e^-2+H_t^+-H_t^-)) d t ≤∫_0^S̃_β(1+ 1/2log(e^-2+H_t^+)) d t= ∫_0^S̃_β(1+log(g_t)) d t, which ends the proof. § PROOF OF THE MAIN RESULTS §.§ Regularity of the entropy function Summarising the results from <Ref>, and using in particular <Ref>, we deduce that v(t,x)=sup_α∈_1/e J(t,x,α)=:w(t,x), ∀ (t,x)∈Ω_T, where the right-hand-side of the above equality corresponds to an alternative Hamilton–Jacobi–Bellman PDE, which is now uniformly elliptic -∂_tw(t,x) - 1/2sup_a≥ 1/e{a ∂_xxw(t,x) + log a + 1}=0, (t,x) ∈Ω_T, w(T,·) = w(·,0) = w(·,1)=0. In order to prove the desired regularity for v, we will need a comparison result. Fix some c≥ 0. Let u and v be respectively a concave bounded upper-semicontinuous viscosity sub-solution and a concave bounded lower-semicontinuous viscosity super-solution of -∂_tw(t,x) - 1/2sup_a≥ c{a∂_xxw(t,x) + log(a) +1}=0, (t,x) ∈Ω_T. such that u(t,0)≤ v(t,0), u(t,1)≤ v(t,1) and u(T,x)≤ v(T, x) for all (t,x)∈Ω_T. Then u≤ v on Ω_T. This is a very standard result for which we can refer to either <cit.> or <cit.>. The main point is to notice that for a given λ>0, given (X,Y)∈^2 such that -3λ[ 1 0; 0 1 ]≤[ X 0; 0 -Y ]≤ 3λ[ 1 -1; -1 1 ], if we define F_c(q)sup_a≥ c{aq + log(a) +1}=+∞1_{q≥ 0}+log(-q)1_{0>q≥ -1/c}+(cq+log(c)+1)1_{q<-1/c}, then we have F_c(X)-F_c(Y)≤ 0 since F_c is non-increasing. It is then direct using the aforementioned references to deduce the desired result. Given the previous comparison theorem, the following result is now standard. The function w is the unique bounded continuous viscosity solution to both <Ref>. Moreover, w∈ C^1,2(Ω_T) is concave in x. It is standard that w is a (discontinuous) viscosity solution to <Ref>, since we know by <Ref> that it is bounded, and thus locally bounded. By <Ref>, it is also a (discontinuous) viscosity solution to (<ref>). This tells us that the lower-semicontinuous envelope w_⋆ of w is a viscosity super-solution of both <Ref> and that its upper-semicontinuous envelope w^⋆ is a viscosity sub-solution of <Ref>. By <Ref> this proves w^⋆≤ w_⋆, and thus that equality holds, proving that w is a continuous viscosity solution of <Ref>. Concavity is immediate from the viscosity solution property we just proved, as the non-linearity explodes for non-negative values of the second-order derivative. As for the regularity, this comes from the celebrated Evans–Krylov theorem (see for instance <cit.>), as the operator in (<ref>) is concave with respect to the second-order derivative and uniformly elliptic. §.§ Representation of the entropy function In the following, we denote by e u=w the unique classical solution to (<ref>)–(<ref>)–(<ref>), and we investigate its relation to the logarithmic diffusion equation (<ref>)–(<ref>)–(<ref>). In order to derive the integral representation of e in <Ref>, we adopt an approximation argument. Namely, for every n∈^⋆, consider the PDEs 2∂_te(t,x) = log(-∂_xxe(t,x)), (t,x) ∈Ω_T, e(T,x) = e_∞(x)/n , x ∈ (0,1), e(t,0) = e(t,1) = 0, t ∈ (0,T), 2∂_tp(t,x) = ∂_xx(log(p(t,x))), (t,x) ∈Ω, p(0,x) = 1/n, x ∈ (0,1), p(t,0) = p(t,1) = 1, t ∈ (0,T). Then the representation result is summarised in the following proposition. There exist a unique classical solution to (<ref>)–(<ref>)–(<ref>) and a unique classical solution to (<ref>)–(<ref>)–(<ref>), denoted respectively by e^n and p^n. It furthermore holds that e^n(t,x)=-∫_0^x∫_0^y p^n(T-t,z) d z d y + x∫_0^1∫_0^y p^n(T-t,z) d z d y, (t,x) ∈Ω_T. As the initial and boundary conditions are strictly positive, by the maximum principle, see for instance <cit.>, the PDE (<ref>)–(<ref>)–(<ref>) is well-defined in the classical sense and its unique classical solution p^n>0 on Ω_T. Define then e^n: Ω_T⟶ by e^n(t,x) -∫_0^x∫_0^y p^n(T-t,z) d z d y + x∫_0^1∫_0^y p^n(T-t,z) d z d y. It remains to verify that e^n is the unique classical solution to (<ref>)–(<ref>)–(<ref>). A straightforward computation yields e^n(T,·)=e_∞/n, e^n(·,0)=e^n(·,1)=0 and ∂_xxe^n(t,x)=-p^n(T-t,x). Furthermore, one has by Fubini's theorem ∂_te^n(t,x) =∫_0^x∫_0^y p^n_t(T-t,z) d z d y - x∫_0^1∫_0^y p^n_t(T-t,z) d z d y =1/2∫_0^x∫_0^y ∂_xx(log(p^n(T-t,z))) d z d y -x/2∫_0^1∫_0^y ∂_xx(log(p^n(T-t,x))) d z d y =1/2∫_0^x ∂_x(log(p^n(T-t,y))) d y -x/2∫_0^1 ∂_x(log(p^n(T-t,y))) d y =1/2log(p^n(T-t,x)) = 1/2log(-∂_xxe^n(t,x)), (t,x) ∈Ω_T, which implies that e^n is a classical solution to (<ref>)–(<ref>)–(<ref>). Next, we let n⟶∞ in <Ref>. With the notation of <Ref>, n⟼ e^n(t,x) and n⟼ p^n(t,x) are non-increasing and convergent for every (t,x)∈Ω_T. In particular, e^n converges pointwise to e and e(t,x)=-∫_0^x∫_0^y p̃(T-t,z) d z d y + x∫_0^1∫_0^y p̃(T-t,z) d z d y, (t,x) ∈Ω_T, where e is the classical solution to (<ref>)–(<ref>)–(<ref>) and p̃ is the pointwise limit of (p^n)_n∈^⋆. Note that e^n is the unique bounded viscosity solution to (<ref>)–(<ref>)–(<ref>), thus the comparison principle—from a straightforward generalisation of <Ref>—yields the required monotonicity for (e^n(t,x))_n≥ 1 and thus its pointwise convergence. Furthermore, the stability of viscosity solutions, see <cit.> tells us that its pointwise limit must be e and the convergence is even uniform on Ω_T. Next, consider (p^n)_n≥ 1. It follows from <cit.>, that there exists some _n>0 such that _n<p^n(t,x)≤max{1, e_∞_∞/n}=1 for all (t,x) ∈Ω_T and n large enough. Fix a sufficiently large n and write for notational simplicity p^n≡ u and p^n+1≡ v. We define the function a:Ω_T ⟶ by a(t,x)∫_0^1 1/u(t,x)ξ + v(t,x)(1-ξ) dξ, where it follows that 1 ≤ a(t,x)≤ 1/_n+1. Set w u-v. Then it holds that 2∂_t w= ∂_xx(aw) = aw_xx+2a_xw_x +a_xxw Ω_T, and w(0,·)> 0, w(·,0)=w(·,1)=0. We deduce from the linear maximum principle (see , <cit.>) that w≥ 0. Therefore, the pointwise limit of (p^n)_n∈^⋆ exists and can be denoted by p̃. We may thus conclude the proof by the dominated convergence theorem. We are now in a position to prove the main result. The existence and uniqueness of a classical solution come from <Ref>, which also establishes the concavity in x. Combining the uniqueness with a straightforward verification for e'(t,x)=:e(t,1-x), we deduce e=e' and thus the symmetry with respect to x=1/2. The bounds are shown in <Ref> from the control representation[Alternatively, it can be verified that 0 and e_∞ are sub- and super-solutions, respectively.]. We next prove <Ref>. As p^n is a classical solution to (<ref>)–(<ref>)–(<ref>), it is also the unique weak solution to (<ref>)–(<ref>)–(<ref>), namely, ∫_0^T∫_0^1 (p^n(t,x)∂_tϕ -1/2∂_x(log(p^n(t,x)))∂_xϕ(t,x) ) d x d t + ∫_0^1 ϕ(x,0)/n d x =0 holds for all ϕ∈ H^1(Ω_T)∩ C(Ω_T) vanishing at t=T, x=0 and x=1; see <cit.> for the uniqueness of the weak solution. Adopting the arguments of <cit.>, (p^n)_n∈^⋆ converges weakly in Ł^2(Ω_T) to the unique weak solution p of (<ref>)–(<ref>)–(<ref>). As Ł^2(Ω_T) is a reflexive Banach space, by means of Mazur's lemma, there exists a function N:⟶ and a sequence of finite sets {α (n)_k :k∈{n,… ,N(n)}}⊂_+ satisfying ∑ _k=n^N(n)α (n)_k=1 such that lim_n→∞ q^n = p, Ł^2(Ω_T), q^n∑ _k=n^N(n)α (n)_kp^k. By construction, (q^n)_n∈^⋆ also converges pointwise to p̃. Hence, p=p̃ and the desired result (<ref>) follows. Finally, we can deduce the monotonicity of e in time. We established in the proof of <Ref> that p^n≤ 1, and hence we have p≤ 1. From the representation formula, 2∂_te = log(-∂_xxe) = log(p(T-·, ·)) ≤ 0, as desired. §.§ Convergence to the stationary solution Thanks to the representation theorem, we may obtain an estimate of the decay rate to the stationary solution. More precisely, we set e≡ e^T to emphasise the dependency of (<ref>)–(<ref>)–(<ref>) on T and rewrite the integral representation of e^T as follows e^T(t,x) = -∫_0^x p(T-t,z) d z ∫_z^x d y + x∫_0^1 p(T-t,z) d z ∫_z^1 d y =(1-x)∫_0^x z p(T-t,z) d z + x∫_x^1 (1-z)p(T-t,z) d z. Then we have the following result. Let e^T be the solution to <Ref>–(<ref>)–(<ref>). Then it holds for every even number α∈, \|e^T(t,x)-e_∞(x)\| ≤ x(1-x)exp(-(α-1)(T-t)/πα^2), ∀ (t,x)∈Ω_T. First, note that the stationary solution to (<ref>)–(<ref>) is p_∞(x)=1. Similarly, denote by p≡ p^T the weak solution to (<ref>)–(<ref>)–(<ref>). By means of <cit.>, there exists some C>0 such that for any even number α∈ p^T(t,·)-p_∞_Ł^α([0,1])≤exp(-C(α-1)t/α^2), ∀ t∈ [0,T]. Inspection of the proof of <cit.> reveals that C is the sharp constant of Poincaré's inequality of the relevant domain, which for [0,1] is known explicitly as 1/π. Hence, choosing β such that 1/α+ 1/β=1, Hölder's inequality allows to conclude \|e^T(t,x)-e_∞(x)\| = \|(1-x)∫_0^x z (p^T-p_∞)(T-t,z) d z + x∫_x^1 (1-z) (p^T-p_∞)(T-t,z) d z\| ≤ (β+1)^-1/βx(1-x)exp(-C(α-1)(T-t)/α^2)[x^1/β+(1-x)^1/β] ≤ x(1-x)exp(-C(α-1)(T-t)/α^2). § APPROXIMATION SCHEME We discretise the PDE in the form (<ref>) using M∈^⋆ time points and a time step k T/M, as well as N∈^⋆ spatial intervals of width h 1/N. We write v_n^m for the approximation to w(m k, n h), for n∈{0,…,N}, m∈{0,…,M}. The boundary conditions are then for all n∈{0,…,N}, v_n^M 0, and for all m∈{0,…,M}, v_0^m 0, v_N^m 0. We first introduce a regularised problem with strictly positive and bounded control set: for any positive constant d≥ 1/ e, set I^d [1/ e,d]. Considering w_d the solution of (<ref>) with sup_a ≥ 1/ e replaced by sup_a ∈ [1/ e,d], the dominated convergence theorem ensures the pointwise convergence of w^d to w. We will discuss both explicit and implicit time-stepping schemes. For the explicit finite difference scheme, which is understood backwards in time, with v^M=0, and for all m∈{1,…,M}, n∈{1,…,N-1} 2 v_n^m-v_n^m-1/k = inf_a∈ I^d{(-a (A v^m)_n - log a - 1}, where v^m (v_0^m,…, v_N^m), and the matrix operator A is defined row-wise for n∈{1,…,N-1} as (A v^m)_n (v_n+1^m - 2 v_n^m + v_n-1^m)/h^2. The explicit scheme can be re-arranged as v_n^m-1 = sup_a ∈ I^d{π(a) v^m_n+1 + (1-2π(a)) v^m_n + π(a) v^m_n-1 + k (log a + 1)/2 }, for π(a) k a/ (2 h^2). If k d/ h^2 ≤ 1, π(a) and 1-2π(a) are guaranteed to be non-negative for all a ∈ I^d and are interpretable as transition probabilities. Therefore, defining a symmetric random walk by X_m = X_m-1 + h ξ_m-1, where ξ_m are i.i.d. with ℙ[ξ_m = 1] = ℙ[ξ_m = -1] = π(a), ℙ[ξ_m = 0]= 1-2 π(a), and 0 else, we have v_n^0 = 1/2sup_â{∑_j=0^τ̂-1 (log(a_j) + 1) k}, τ̂min{j∈: X_j∈{0,1}}, where â (a_0,…, a_M-1) is an admissible discrete control process. By choosing a_j=1/e for all j, it is clear that v^m is non-negative for all m. Moreover, x (1-x)/2 is a super-solution to the scheme, from which is follows that v_n^m ≤ x_n (1-x_n)/2 for all n and m. We now turn to the implicit scheme. For all m∈{1,…,M}, n∈{1,…,N-1}, let 2 u_n^m+1-u_n^m/k = inf_a ∈ I^d{-a (A u^m)_n - log a - 1}, where u^m (u_0^m,…, u_N^m). This can be written as inf_a ∈ I^d{ ((1- (k a)/2 A) u^m)_n - k (log a +1)/2 } = u_n^m+1. Using that 1- (k a)/2 A is a (strictly diagonally dominant) M-matrix, we have that the scheme is monotone and a similar argument to above gives the same bounds on the solution as for the explicit scheme, without constraints on the time-step. Therefore, we can let d ↑∞ and obtain monotone convergence of the discrete solution. A standard calculation shows that the explicit and implicit scheme are consistent with the PDE. The framework by <cit.> then implies convergence to the viscosity solution of the PDE as k, h ↓ 0, maintaining k d/h^2 ≤ 1 in the case of the explicit scheme. We will focus on the implicit scheme from now on for its unconditional stability, which is here especially useful due to the arbitrarily large control values close to the terminal time, i.e., for convergence we need to choose arbitrarily large d. The system (<ref>), combined with boundary conditions, is a nonlinear finite dimensional system of equations, which can be solved by policy iteration: starting from an initial guess u^(0), define for each i∈, a^(i)_n min{- 1/(A u^(i))_n , d}, and then solve the linear system u_n^(i+1) - k/2 (a^(i)_n (A u^(i+1))_n + log a^(i)_n + 1) = u_n^m+1. This iteration converges super-linearly by standard results (see <cit.>). In practice, 2 or 3 iterations are sufficient for high accuracy. <Ref> shows the second derivative of the value function, ∂_xxe, and the optimal volatility σ^⋆ as function of x for different t, with T=1. The numerical solution was computed with M=N=1000, d=10^6.
http://arxiv.org/abs/2306.04025v1	20230606213809	Designing explainable artificial intelligence with active inference: A framework for transparent introspection and decision-making	[ "Mahault Albarracin", "Inês Hipólito", "Safae Essafi Tremblay", "Jason G. Fox", "Gabriel René", "Karl Friston", "Maxwell J. D. Ramstead" ]	cs.AI	[ "cs.AI" ]	Measurement of ν_μ Charged-Current Inclusive π^0 Production in the NOvA Near Detector R. Zwaska July 31, 2023 ===================================================================================== This paper investigates the prospect of developing human-interpretable, explainable artificial intelligence (AI) systems based on active inference and the free energy principle. We first provide a brief overview of active inference, and in particular, of how it applies to the modeling of decision-making, introspection, as well as the generation of overt and covert actions. We then discuss how active inference can be leveraged to design explainable AI systems, namely, by allowing us to model core features of “introspective” processes and by generating useful, human-interpretable models of the processes involved in decision-making. We propose an architecture for explainable AI systems using active inference. This architecture foregrounds the role of an explicit hierarchical generative model, the operation of which enables the AI system to track and explain the factors that contribute to its own decisions, and whose structure is designed to be interpretable and auditable by human users. We outline how this architecture can integrate diverse sources of information to make informed decisions in an auditable manner, mimicking or reproducing aspects of human-like consciousness and introspection. Finally, we discuss the implications of our findings for future research in AI, and the potential ethical considerations of developing AI systems with (the appearance of) introspective capabilities. 0.5cm §.§ Acknowledgements The authors are grateful to VERSES for supporting the open access publication of this paper. SET is supported in part by funding from the Social Sciences and Humanities Research Council of Canada (Ref: 767-2020-2276). KF is supported by funding for the Wellcome Centre for Human Neuroimaging (Ref: 205103/Z/16/Z) and a Canada-UK Artificial Intelligence Initiative (Ref: ES/T01279X/1). The authors are grateful to Brennan Klein for assistance with typesetting. §.§ Conflict of interest statement The authors disclose that they are contributors to the Institute of Electrical and Electronics Engineers (IEEE) P2874 Spatial Web Working Group. § INTRODUCTION: EXPLAINABLE AI AND ACTIVE INFERENCE Artificial intelligence (AI) systems continue to proliferate and, at the time of writing, have become an integral part of various intellectual and industrial domains, including healthcare, finance, and transportation <cit.>. Traditional AI models, such as deep learning neural networks, have been widely recognized for their ability to achieve high performance and accuracy across various tasks <cit.>. However, it is well known that these models almost invariably function as “black boxes,” with limited transparency and interpretability of their decision-making processes <cit.>. This lack of explainability can lead to skepticism and reluctance to adopt AI systems—and indeed, to harm, particularly in high-stakes situations, where the consequences of a wrong decision can be severe and harmful <cit.>. Indeed, a lack of explainability precludes applications in certain domains, such as fintech. The problem of explainable AI (sometimes referred to as the “black box” problem) is the problem of understanding and interpreting how these models arrive at their decisions or predictions <cit.>. While researchers and users may have knowledge of the inputs provided to the model and the corresponding outputs that it produces, comprehending the internal workings and decision-making processes of AI systems can be complex and challenging. This is in no small part because their intricate architectures and numerous interconnected layers learn to make predictions by analyzing vast amounts of training data and adjusting their internal parameters, without explicit instruction from a programmer <cit.>. The method by which these systems are trained thus, by design, limits their explainability. Moreover, the internal computations that are performed by these models—when they engage in decision-making—can be highly complex and nonlinear, making it difficult to extract meaningful explanations of their behavior, or insights into their decision-making process <cit.>. This problem is compounded by the fact that most machine learning implementations of AI fail to represent or quantify their uncertainty; especially, uncertainty about the parameters and weights that underwrite their accurate performance. This means that AI, in general, cannot evaluate (or report) the confidence in its decisions, choices or recommendations. The lack of interpretability poses several challenges. Firstly, it hampers transparency and makes audits by third parties next to impossible, as the designers, users, and stakeholders of these systems may struggle to understand why a particular decision or prediction was made. This becomes problematic in critical domains such as healthcare or finance, where the ability to explain the reasoning behind a decision is essential for trust, accountability, and compliance with regulations <cit.>. Secondly, the black box nature of machine learning models can hinder the identification and mitigation of biases or discriminatory patterns. Without visibility into the underlying decision-making process, it becomes challenging to detect and address biases that may exist within the model's training data or architecture. This opacity can lead to unfair or biased outcomes, perpetuating social inequalities or discriminatory practices <cit.>. Additionally, the lack of interpretability of the model limits its ability to provide meaningful explanations to end-users. Individuals interacting with machine learning systems often seek explanations for the decisions made by these systems <cit.>. For instance, in medical diagnosis, patients and healthcare professionals may want to understand why a particular diagnosis or treatment recommendation was given <cit.>; or consider automated suggestions in practical industrial settings <cit.>. Without explainability, users may be hesitant to trust the system's recommendations or may feel apprehensive (not without good reason) about relying on the outputs of such models. Accordingly, the need for explainable AI has become increasingly important <cit.>. “Explainable AI” refers to the development of AI systems that can provide human-understandable explanations for their decisions and actions <cit.>. This level of transparency is crucial for fostering trust <cit.>, ensuring accountability <cit.>, and facilitating inclusive collaboration between humans and AI systems <cit.>. Recent efforts to regulate AI may turn explainability into a requirement for the deployment of any AI system at scale. For instance, in the United States, the National Institute of Standards and Technology (NIST) released its Artificial Intelligence Risk Management Framework (RMF) in 2023, which includes explainability and interpretability as crucial characteristics of a trustworthy AI system. The RMF is envisioned as a guide for tech companies to manage the risks of AI and could eventually be adopted as an industry standard. In a similar vein, US Senator Chuck Schumer has led a congressional effort to establish US regulations on AI, with one of the key aspects being the availability of explanations for how AI arrives at its responses <cit.>. In the European Union, a proposed Regulation Laying Down Harmonized Rules on Artificial Intelligence (better known as the “AI Act”) is set to increase the transparency required for the use of so-called “high-risk” AI systems. For instance, groups that deploy automated emotion recognition systems may be obligated to inform those on whom the system is being deployed that they are being exposed to such a system. The AI Act is expected to be finalized and adopted in 2023, with its obligations likely to apply within three years’ time. The Council of Europe is also in the process of developing a draft convention on artificial intelligence, human rights, democracy, and the rule of law, which will be the first legally binding international instrument on AI. This convention seeks to ensure that research, development, and deployment of AI systems are consistent with the values and interests of the EU, and that they remain compatible with the AI Act and the proposed AI Liability Directive, which includes a risk-based approach to AI. In addition, the US-EU Trade and Technology Council published a joint Roadmap for Trustworthy AI and Risk Management in 2022, which aims to advance collaborative approaches in international standards bodies related to AI, among other objectives <cit.>. Therefore, explainability is clearly a major issue in research, development, and deployment of AI systems, and will remain so for the foreseeable future. Explainable AI aims to bridge the gap between the complexity and lack of auditability of contemporary AI systems and the need for human interpretability and auditability <cit.>. It seeks to provide insights into the factors that influence AI decision-making, enabling users to understand the explicit reasoning and other factors driving the output of AI systems. Understanding the performance and potential biases of AI systems is crucial for their ethical and responsible deployment <cit.>. This understanding, however, must extend beyond the performance of AI systems on academic benchmarks and tasks to include a deep understanding of what the models represent or learn, as well as the algorithms that they instantiate <cit.>. Transparency considerations are embedded in the design, development, and deployment of AI systems, from the societal problems that arise worth developing a solution, to the data collection stage, and still at the point where the AI system is deployed in the real world and iteratively improved <cit.>. This transparency may enable the implementation of other ethical AI dimensions like interpretability, accountability, and safety <cit.>. Researchers have been exploring various approaches to develop more explainable AI systems <cit.>. However, these efforts have yet to yield a principled and widely accepted path method for, or path to, explainability. One promising direction is to draw inspiration from research into human introspection and decision-making processes. Furthermore, a two-stage decision-making process, which includes a reflection stage where the network reflects on its feed-forward decision, can enhance the robustness and calibration of AI systems <cit.>. It has been suggested that explainability in AI systems can be further enhanced through techniques such as layer-wise relevance propagation <cit.> and saliency maps <cit.>, which aid in visualizing the model's reasoning process. By translating the internal models of AI systems into human-understandable explanations, we can foster trust and collaboration between AI systems and their human users <cit.>. However, as <cit.> argue, we must also consider the metatheoretical calculus that underpins our understanding and use of these models. This involves not only considering the performance of the model on a task, but also the implications of the performance of the model for our understanding of the mind and brain. In this paper, we investigate the potential of active inference, and the free energy principle (FEP) upon which is based <cit.>, to enhance explainability in AI systems, notably by capturing core aspects of introspective processes, hierarchical decision-making processes, and (cover and overt) forms of action in human beings <cit.>. The FEP is a variational principle of information physics that can be used to model the dynamics of self-organizing systems like the brain. Active inference is an application of the FEP to model the perception-action loops of cognitive systems: it provides us with the basis of a unified theory of the structure and function of the brain (and indeed, of living and self-organizing systems more generally; <cit.>. Active inference allows us to model self-organizing systems like brains as being driven by the imperative to minimize surprising encounters with the environment; where this surprise scores how far a thing or system deviates from its characteristic states (e.g., a fish out of water). By doing so, the brain continually updates and refines its world model, allowing the agent to act adaptively and in situationally appropriate ways. The relevance of using active inference is that the models of cognitive dynamics—and in particular, introspection—that have been developed using its tools can be adapted to enable the design of human interpretable and auditable (and indeed, self-auditable) AI systems. The ethical and epistemological or epistemic gains that this enables are notable. The proposed active inference based AI system architecture would enable artificial agents to access and analyze their own internal states and decision-making processes, leading to a better understanding of their decision-making processes, and the ability to report on themselves. Proof of concept for this kind of “self report” is already at hand <cit.> and, in principle, is supported in any application of active inference. At one level, committing to a generative model—implicit in any active inference scheme—dissolves the explainability problem. This is because one has direct access to the beliefs and belief-updating of the agent in question. Indeed, this is why active inference has been so useful in neuroscience to model and explain behavioral and neuronal responses in terms of underlying belief states: e.g., <cit.>. As demonstrated in <cit.> it is a relatively straightforward matter to augment generative models to self-report their belief states. In this paper, we address a slightly more subtle aspect of explainability that rests upon “self-access”; namely, when an agent infers its own “states of mind”—states of mind that underwrite its sense-making and choices. Crucially, this kind of meta-inference <cit.> may rest on exactly the representations of uncertainty (a.k.a., precision) that are absent in conventional AI. This paper is organized as follows. We first introduce essential aspects of active inference. We then discuss how active inference can be used to design explainable AI systems. In particular, we propose that active inference can be used as the basis for a novel AI architecture—based on explicit generative models—that both endows AI systems with a greater degree of explainability and audibility from the perspective of users and stakeholders, and allows AI systems to track and explain their own decision-making processes in a manner understandable to users and stakeholders. Finally, we discuss the implications of our findings for future research in auditable, human-interpretable AI, as well as the potential ethical considerations of developing AI systems with the appearance of introspective capabilities. § ACTIVE INFERENCE AND INTROSPECTION §.§ A brief introduction to active inference Active inference offers a comprehensive framework for naturalizing, explaining, simulating, and understanding the mechanisms that underwrite decision-making, perception, and action <cit.>. The free energy principle (FEP) is a variational principle of information physics <cit.>. It has gained considerable attention and traction since it was first introduced in the context of computational neuroscience and biology <cit.>. Active inference denotes a family of models premised on the FEP, which are used to understand and predict the behavior of self-organizing systems. The tools of active inference allow us to model self-organizing systems as driven by the imperative to minimize surprise, which quantifies the degree to which a given path or trajectory deviates from its inertial or characteristic path—or its upper bound, variational free energy, which scores the difference between its predictions and the actual sensory inputs it receives <cit.>. Active inference modeling work suggests that decision-making, perception, and action involve the optimization of a world model that represents the causal structure of the system generating outcomes of observations <cit.>. In particular, active inference models the way that latent states or factors in the world cause sensory inputs, and how those factors cause each other, thereby capturing the essential causal structure of the measured or sensed world <cit.>. Minimizing surprise or free energy on average and over time allows the brain to maintain a consistent and coherent internal model of the world—one that maximizes predictive accuracy while minimizing model complexity—which, in turn, enables agents to adapt and survive in their environments <cit.>. (Strictly speaking, this is the other way around. In other words, agents who “survive” can always be read as minimizing variational free energy or maximizing their marginal likelihood (a.k.a., model evidence). This is often called self-evidencing <cit.>.) Active inference has instrumental value in allowing us to model, and thereby hopefully help to understand, core aspects of human consciousness (for a review, see <cit.>Friston, 2010). Of particular interest to us here, it enables us to model the processes involved in introspective self-access (see <cit.>. Active inference modeling deploys the construct of generative models to make sense of the dynamics of self-organizing systems. In this context, a generative model is a joint probability density over the hidden or latent causes of observable outcomes; see <cit.> for a discussion of how to interpret these models philosophically and <cit.> for a gentle introduction to the technical implementation of these models. We depict a simple generative model, apt for perceptual inference, in Figure <ref>, and a more complex generative model, apt for the selection of actions (a.k.a. policy selection) in Figure <ref>. These models specify the way in which observable outcomes are generated by (typically non-observable) states or factors in the world. The main advantage of using generative models over current state of the art black box approaches is interpretability and auditability. Indeed, the factors that figure in the generative model are explicitly labeled, such that their contributions to the operations of the model can be read directly off its structure. This lends the generative model a degree of auditability that other approaches do not have. §.§ Active inference, introspection, and self-modeling Active inference modeling has been deployed in the context of the scientific study of introspection, self-modeling, and self-access, which has led to the development of several leading theories of consciousness (for a review, see <cit.>). Introspection, which is defined as the ability to access and evaluate one's own mental states, thoughts, and experiences, plays a pivotal role in self-awareness, learning, and decision-making and is a pillar of human consciousness <cit.>. Self-modeling and self-access can be defined as interconnected processes that contribute to the development of self-awareness and to the capacity for introspection. Self-modeling involves the creation of internal representations of oneself, while self-access refers to the ability to access and engage with these representations for self-improvement and learning <cit.>. These processes, in conjunction with introspection, form a complex dynamic system that enriches our understanding of consciousness and the self—and indeed, may arguably form the causal basis of our capacity to understand ourselves and others. Introspective self-access has been modeled using active inference by deploying a hierarchically structured generative model <cit.>. The basic idea is that for a system to report or evaluate its own inferences, it must be able to enact some form of self-access, where some parts of the system can take the output of other parts as their own input, for further processing. This has been discussed in computational neuroscience under the rubric of “opacity” and “transparency” <cit.>. The idea is that some cognitive processes are “transparent”: like a (clean, transparent) window, they enable us to access some other thing (say, a tree outside) while not themselves being perceivable. Other cognitive processes are “opaque”: they can be assessed per se, as in introspective self-awareness (i.e., aware that you are looking at a tree as opposed to seeing a tree). The idea, then, is that introspective processes make other cognitive processes accessible to the system as such, rendering them opaque. In the context of self-access, the transparency and opacity of introspective processes has been modeled using a three-level generative model <cit.>. The model is depicted in Figure <ref>. This model provides a framework for understanding how we access and interpret our internal states and experiences. The first level of the model (in blue), which implements the selection of overt actions, can be seen as a transparent process. The second, hierarchically superordinate level (in orange), which implements attention and covert action <cit.>, represents more opaque processes, which make processes in the first layer accessible to the system. This layer models mental actions and shifts in attention that we may not be consciously aware of, or able to report. The second level takes as its input the inferences (posterior state estimations) ongoing at the first level, as data for further inference—about the system’s inferences. Attentional processes are of this sort: they are about cognitive processes and action, and they modulate the activity of the first level. The third, final level (in green) implements the awareness of where one’s attention is deployed. In other words, it both recognizes and instantiates a particular attentional set via bottom-up and top-down messages between levels, respectively. On the whole, this three-level architecture models our self-access and introspective abilities in terms of the processes regulating transparency and opacity at a phenomenal level of description, or attentional selection at a psychological level. Ramstead, Albarracin et al. () <cit.> recently discussed how active inference enables us to model both overt and covert action (also see <cit.>). Overt actions—observable behaviors such as physical movements or verbal responses—are directly influenced by the brain's hierarchical organization and can be modeled using active inference <cit.>. In contrast, covert actions refer to internal mental processes, such as attention and imagination, which involve the manipulation and processing of internal representations in the absence of observable behaviors <cit.>—of the sort discussed as “mental action” <cit.>. These actions are essential for higher cognitive functions, which rely on the brain’s capacity to explore and manipulate abstract concepts and relationships. In Smith et al. () <cit.>, a hierarchical architecture of this type was deployed that was augmented with the capacity to report on its emotional states. Thus, it is possible to use active inference to design systems that can not only access their own states and perform inferences on their basis, but also to report on their introspective processes in a manner that is readily understandable by human users and stakeholders. With this formulation of how active inference enables agents to model their overt and covert action, in the following sections, we argue that we can and ought to research, design, and develop AI systems that mimic these introspective processes, ultimately leading to more human-like artificial intelligence. § USING ACTIVE INFERENCE TO DESIGN SELF-EXPLAINING AI We argue that incorporating the design principles of active inference into AI systems can lead to better explainability. This is for two key reasons. The first is that, by deploying an explicit generative model, AI systems premised on active inference are designed explicitly such that their operations can be interpreted and audited by a user or stakeholder that is fluent in the operation of such models. We believe that the inherent explainability of active inference AI might be scaled up, by deploying the kind of explicit, standardized world modelling techniques that are being developed as open standards within the Institute of Electrical and Electronics Engineers (IEEE) P2874 Spatial Web Working Group <cit.>, to formalize contextual relationships between entities and processes and to create digital twins of environments that are able to update in real time. The second is that, by implementing an architecture inspired by active inference models of introspection, we can build systems that are able to access—and report on—the reasons for their decisions, and their state of mind when reaching these decisions. AI systems designed using active inference can incorporate the kind of hierarchical self-access described by <cit.> and by <cit.>, to enhance their introspection during decision-making. As discussed, in the active inference tradition, introspection can be understood in the context of the (covert and overt) actions that AI systems perform. Covert actions, which are internal computations and decision-making processes that are not directly observable to users and stakeholders, can be recorded or explained to make the system more explainable. Overt actions, which are actions that an AI system takes based on its internal computations, such as making a recommendation or decision, can be explained to help users understand why the AI system acted as it did. This kind of deep inference promotes introspection, adaptability, and responses to environmental changes <cit.>. The proposed AI architecture includes components that continuously update and maintain an internal model of its own states, beliefs, and goals. This capacity for self-access (and implicitly self-report) enables the AI system to optimize (and report on) its decision-making processes, fostering introspection (and enhanced explainability). It incorporates metacognitive processing capabilities, which involve the ability to monitor, control, and evaluate its own cognitive processes. The AI system can thereby better explain the factors that contribute to its decisions, as well as identify potential biases or errors, ultimately leading to improved decision-making and explainability. The proposed AI architecture would include introspection and a self-report interface, which translates the AI system's internal models and decision-making processes into human-understandable (natural) language (using, e.g., large language models). In effect, the agent would be talking to itself, describing its current state of mind and beliefs. This interface bridges the gap between the AI system's internal workings and human users, promoting epistemic trust and collaboration. In this way, the system can effectively mimic human-like consciousness and transparent introspection, leading to a deeper understanding of its decision-making processes and explainability. This advancement may be essential in fostering trust and collaboration between AI systems and their human users, paving the way for more effective and responsible AI applications. Augmenting a generative model with black box systems—like large language models—may be a useful strategy to help AI systems articulate their “understanding” of the world. Using large language models to furnish an introspective interface may be relatively straightforward, leveraging their powerful natural language processing capabilities to create explanations of belief updating. This architecture—with a hierarchical generative model at its core—may contribute to the overall performance and explainability of hybrid AI systems. Attention mechanisms also achieve this purpose by enhancing the explainability of the AI system's decision making, emphasizing important factors in the hierarchical generative model that contribute to its decisions and actions. These ideas are not new. Attentional mechanisms, particularly those at the word-level, have been identified as crucial components in AI architecture, specifically in the context of hierarchical generative models—and in generative AI, in the form of transformers. They function by focusing on relevant aspects during decision-making processes, thereby allowing the system to effectively process and prioritize information <cit.>. In fact, the performance of hierarchical models, which are a type of AI architecture, can be significantly improved by integrating word-level attention mechanisms. These mechanisms are powerful because they can leverage context information more effectively, especially fine-grained information. The AI architecture that we propose employs a soft attention mechanism, which uses a weighted combination of hierarchical generative model components to focus on relevant information. The attention weights are dynamically computed based on the input data and the AI system's internal state, allowing the system to adaptively focus on different aspects of the hierarchical generative model <cit.>. This approach is similar to the use of deep learning models for global coordinate transformations that linearize partial differential equations, where the model is trained to learn a transformation from the physical domain to a computational domain where the governing partial differential equations are simpler, or even linear <cit.>. The AI architecture that we describe here effectively integrates diverse information sources for decision-making, mirroring the complex information processing capabilities observed in the human brain. The hierarchical structure of the generative model facilitates the exchange of information between different levels of abstraction. This exchange allows the AI system to refine and update its internal models based on both high-level abstract knowledge and low-level detailed information. In conclusion, the integration of introspective processes in AI systems may represent a significant step towards achieving more explainable AI. By leveraging explicit generative models, as well as attention and introspection mechanisms, we can design AI systems that are not only more efficient and robust, but also more understandable and trustworthy. This approach allows us to bridge the gap between the complex internal computations of AI systems and the human users who interact with them. Ultimately, the goal is to create AI systems that can effectively communicate the reasons that drive their decision-making processes, adapt to environmental changes, and collaborate seamlessly with human users. As we continue to advance in this field, the importance of introspection in AI will only become more apparent, paving the way for more sophisticated and ethically sound AI systems. § DISCUSSION §.§ Directions for future research The problem of explainable AI is the problem of understanding how AI models arrive at their decisions or predictions. This problem is especially relevant to avoid biases and harm in the design, implementation, and use of AI systems. By incorporating explicit generative models and introspective processing into the proposed AI architecture, we can create a system that is or seems capable of introspection and, thereby, that displays greatly enhanced explainability and auditability. This approach to AI design paves the way for more effective AI deployment across various real-world applications, by shedding light upon the problem of explainability, thereby offering opportunities for fostering trust, fairness, and inclusivity. The development of the AI architecture based on active inference opens several potential avenues for future research. One possible direction is to further investigate the role of attention and introspection mechanisms in both AI systems and human cognition, as well as the development of more efficient attentional models to improve the AI system's ability to focus on salient information during decision-making. The approach that we propose bridges the gap between AI and cognitive neuroscience by incorporating biologically-inspired mechanisms into the design of AI systems. As a result, the proposed architecture promotes a deeper understanding of the nature of cognition and its potential applications in artificial intelligence, thus paving the way for more human-like AI systems capable of introspection and enhanced collaboration with human users. Future work could explore more advanced data fusion techniques, such as deep learning-based fusion or probabilistic fusion, to improve the AI system's ability to combine and process multimodal data effectively. Evaluating the effectiveness of these techniques in diverse application domains will also be a valuable avenue for research <cit.>. Furthermore, the explanation dimension of these AI systems has been a significant topic in recent years, particularly in decision-making scenarios. These systems provide more awareness of how AI works and its outcomes, building a relationship with the system and fostering trust between AI and humans <cit.>. In addition to the aforementioned avenues for future research, another promising direction lies in the realm of computational phenomenology (for a review and discussion, see <cit.>. Beckmann, Köstner, & Hipólito () <cit.> have proposed a framework that deploys phenomenology—the rigorous descriptive study of first-person experience—for the purposes of machine learning training. This approach conceptualizes the mechanisms of artificial neural networks in terms of their capacity to capture the statistical structure of some kinds of lived experience, offering a unique perspective on deep learning, consciousness, and their relation. By grounding AI training in socioculturally situated experience, we can create systems that are more aware of sociocultural biases and capable of mitigating their impact. Ramstead et al. () <cit.> propose a similar methodology based on explicit generative models as they figure in the active inference tradition. This connection to first-person experience, of course, does not guarantee unbiased AI. But by moving away from traditional black box AI systems, we shift towards human-interpretable models that enable the identification and correction of biases in the AI system. This approach aligns with our goal of creating AI systems that are not only efficient and effective, but also ethically sound and socially responsible. The incorporation of computational phenomenology into our proposed AI architecture could further enhance its introspective capabilities and its ability to understand and navigate the complexities of human sociocultural contexts. This could lead to AI systems that are more adaptable, more trustworthy, and more capable of meaningful collaboration with human users. As we continue to explore and integrate such innovative approaches, we move closer to our goal of creating AI systems that truly mirror the richness and complexity of human cognition and consciousness. §.§ Ethical considerations of introspective AI systems Ethical AI starts with the development of AI systems that are ethically designed; AI systems must be designed in such a way as to be transparent, auditable, and explainable, and to minimize harm. But as these systems become increasingly integrated into our daily lives, research on the ethical implications of introspective AI systems, as well as the development of regulatory frameworks and guidelines for responsible AI use, become crucial. The development of introspective AI systems raises several ethical considerations. Even if these systems provide more human-like decision-making capabilities and enhanced explainability, it is and will remain crucial to ensure that their decisions are transparent, fair, and unbiased, and that their designers and users can be held accountable for harm that their use may cause. To address these concerns, future research should focus on developing methods to audit and evaluate the AI system's decision-making processes, as well as identify and mitigate potential biases within the system. Additionally, the development of ethical guidelines and regulatory frameworks for the use of introspective AI systems will be essential to ensure that they are deployed responsibly and transparently. Moreover, as introspective AI systems become more prevalent, issues related to agency, privacy, and data security may arise. Ensuring that these systems protect sensitive information by abiding by data protection regulations, thereby safeguarding agency, will be of paramount importance. In conclusion, the development of AI systems based on active inference has broad implications for both the fields of AI and consciousness studies. As future research explores the potential of this novel approach, ethical considerations and responsible use of introspective AI systems must remain at the forefront of these advancements, ultimately leading to more transparent, effective, and user-friendly AI applications. § CONCLUSION We have argued that active inference has demonstrated significant potential in advancing the field of explainable AI. By incorporating design principles from active inference, the AI system can better tackle complex real-world problems with improved auditability of decision-making, thereby increasing safety and user trust. Throughout our discussions and analysis, we have highlighted the importance of active inference models as a foundation for designing more human-like AI systems, seemingly capable of introspection and finessed (epistemic) collaboration with human users. This novel approach bridges the gap between AI and cognitive neuroscience by incorporating biologically-inspired mechanisms into the design of AI systems, thus promoting a deeper understanding of the nature of consciousness and its potential applications in artificial intelligence. As we move forward in the development of AI systems, the importance of advancing explainable AI becomes increasingly apparent. By designing AI systems that can not only make accurate and efficient decisions, but also provide understandable explanations for their decisions, we foster (epistemic) trust and collaboration between AI systems and human users. This advancement ultimately leads to more transparent, effective, and user-friendly AI applications that can be tailored to a wide range of real-world scenarios. [title=References]
http://arxiv.org/abs/2306.03247v1	20230605210202	Construction d'un système de recommandation basé sur des contraintes via des graphes de connaissances	[ "Ngoc Luyen Le", "Marie-Hélène Abel", "Philippe Gouspillou" ]	cs.IR	[ "cs.IR" ]	Three-dimensional receptivity of hypersonic sharp and blunt cones to free-stream planar waves using hierarchical input-output analysis Joseph W. Nichols July 31, 2023 ====================================================================================================================================== Les graphes de connaissances en RDF modélisent des entités et leurs relations via des ontologies. Leur utilisation a gagné en popularité pour la modélisation de l'information, notamment dans les systèmes de recommandation où les éléments d'information et les utilisateurs sont intégrés dans ces graphes, révélant davantage de liens et de relations. Les systèmes de recommandation basés sur des contraintes exploitent une connaissance approfondie des recommandations pour identifier celles pertinentes. En les combinant avec des graphes de connaissances, nous obtenons plusieurs avantages en termes d'ensembles de contraintes. Cet article explore la construction d'un système de recommandation basé sur des contraintes avec des graphes de connaissances RDF dans le domaine de l'achat/vente de véhicules. Nos expérimentations démontrent que l'approche proposée identifie efficacement des recommandations selon les préférences des utilisateurs. Graphe de connaissances, Système de recommandation basé sur des contraintes, Ontologie Knowledge graphs in RDF model entities and their relations using ontologies, and have gained popularity for information modeling. In recommender systems, knowledge graphs help represent more links and relationships between users and items. Constraint-based recommender systems leverage deep recommendation knowledge to identify relevant suggestions. When combined with knowledge graphs, they offer benefits in constraint sets. This paper explores a constraint-based recommender system using RDF knowledge graphs for the vehicle purchase/sale domain. Our experiments demonstrate that the proposed approach efficiently identifies recommendations based on user preferences. Knowledge graph, Constraint-based Recommender System, Ontology § INTRODUCTION La bonne recommandation d'article au bon moment pour un utilisateur est toujours l'objectif poursuivi par tout système de recommandation. Avec le volume croissant d'informations dans diverses applications, les systèmes de recommandation sont un moyen utile de surmonter la surcharge d'informations et de permettre aux utilisateurs d'explorer de nouvelles opportunités et suggestions de manière personnalisée en correspondance avec leurs préférences. Par conséquent, les recommandations pertinentes d'un système de recommandation influencent de plus en plus les décisions des utilisateurs dans le choix d'un service, d'un produit ou d'un contenu, ainsi que l'amélioration de l'expérience utilisateur sur la plateforme. Dans plusieurs domaines tels que les services financiers, les biens de luxe, l'immobilier ou les automobiles, les achats généralement plus coûteux sont moins fréquents que les achats de commodité. Par conséquent, faire des recommandations de ce type de produit nécessite l'obtention de plus d'informations provenant des utilisateurs tels que leurs préférences ou leurs besoins. En d'autres termes, le système de recommandation (SdR) tente de récupérer des éléments pertinents, provenant des réponses aux questions sur ses besoins et préférences, pour établir les recommandations les plus appropriées. Par conséquent, les SdRs à base de contraintes présentent une approche typique pour répondre à ce type de domaine applicatif. Dans les SdRs à base de contraintes, l'identification des recommandations est considérée comme un processus de satisfaction des contraintes. Certaines contraintes peuvent provenir de la définition et la connaissance du domaine concerné par l'élément, l'item à considérer pour le recommandation. D'autres contraintes peuvent se définir à partir du profil de l'utilisateur comme ses préférences <cit.>. La combinaison de deux types de contraintes provoque une augmentation de l'espace de recherche d'un élément. Par ailleurs, cela peut conduire à la répétition du même type de contraintes pour des groupes d'utilisateurs partageant certaines caractéristiques communes. L'utilisation de graphes de connaissances RDF avec le support d'ontologies peut aider à réduire l'ensemble de contraintes en utilisant des mécanismes de raisonnement pour déduire des informations pertinentes sur les connaissances spécifiques à un domaine. Dans cet article, nous présentons notre approche pour la construction d'un système de recommandation basé sur des contraintes via des graphes de connaissances. Le reste de cet article est organisé comme suit. Dans la section suivante, nous présentons des travaux de la littérature sur les SdRs basés sur des contraintes. La section <ref> présente nos principales contributions à la construction du SdR basé sur des contraintes exploitant les graphes de connaissances RDF. Dans la section <ref>, une expérimentation sur le domaine de l'achat/vente de véhicules de notre approche est présentée et discutée. Pour finir, nous concluons et avançons quelques perspectives. § TRAVAUX DE LA LITTÉRATURE §.§ Représentation des connaissances au moyen d'une ontologie La représentation des connaissances se concentre sur l'étude de la forme de représentation des connaissances et de la manière dont elles sont calculées et utilisées dans les machines. Plus précisément, la représentation des connaissances concerne la capture et la présentation d'informations sous une forme qu'une machine peut comprendre et utiliser pour résoudre des problèmes complexes <cit.>. Dans le contexte du partage des connaissances, l'ontologie est utilisée comme représentation des connaissances pour les bases de connaissances. En général, une ontologie est une description formelle et explicite de connaissances partagées qui consiste en un ensemble de concepts dans un domaine et les relations entre ces concepts <cit.>. Une ontologie joue le rôle de colonne vertébrale de la sémantique formelle d'un graphe de connaissances. Fondamentalement, les ontologies peuvent être exprimées dans le schéma RDF (Resource Description Framework) et le langage d'ontologie Web (OWL) par un ensemble de triplets RDF. Un triplet RDF est défini comme un ensemble de trois composants : un sujet, un prédicat et un objet. Un triplet ⟨ sujet, prédicat, objet ⟩ exprime qu'un sujet donné a une valeur donnée pour une propriété donnée <cit.>. Intuitivement, si le sujet et l'objet sont deux nœuds dans un graphe, le prédicat décrit la relation entre ces deux nœuds. Une ontologie représentée en OWL possède un mécanisme de raisonnement qui permet la déduction de connaissances supplémentaires. La construction d'une ontologie à partir d'un domaine peut être effectuée par plusieurs méthodes, y compris des approches manuelles et automatisées<cit.>. Dans une approche manuelle, les experts du domaine sont généralement impliqués dans le processus de développement de l'ontologie pour s'assurer que l'ontologie est cohérente avec les connaissances du domaine. Cependant, la dépendance d'experts n'est pas toujours nécessaire, car des ontologies peuvent également être développées sur la base de ressources existantes, telles que des taxonomies, des dictionnaires et des bases de données. Les approches automatisées impliquent le traitement du langage naturel, l'apprentissage automatique et d'autres techniques pour extraire des concepts, des relations et des entités à partir de données non structurées ou semi-structurées. L'utilisation d'ontologies en tant que base de connaissances devient de plus en plus populaire pour des tâches telles que la modélisation ou l'inférence de nouvelles connaissances <cit.>. Dans la section suivante, on fournira plus de détails sur les systèmes de recommandation et préciserons le rôle que peut jouer un graphe de connaissances RDF, en particulier dans le contexte des systèmes de recommandation basés sur des contraintes. §.§ Systèmes de recommandation Les SdRs sont une application spéciale qui estime la préférence des utilisateurs pour les éléments/items et tente de recommander les éléments les plus pertinents aux utilisateurs via la récupération d'informations<cit.>. Les recommandations effectuées visent à aider les utilisateurs dans divers processus de prise de décision tels que la musique à écouter ou les produits à acheter. En général, les SdRs sont généralement classés en six catégories principales : les SdRs basés sur le filtrage collaboratif, les SdRs basés sur le contenu, les SdRs basés sur la démographie, les SdRs basés sur les connaissances, les SdRs sensibles au contexte et les SdRs hybrides <cit.>. Si la quantité de données collectées est limitée, les résultats des systèmes tels que les SdRs de filtrage collaboratif, les SdRs basés sur le contenu et les SdRs démographiques peuvent être pauvres ou ne pas couvrir complètement le spectre des combinaisons entre les utilisateurs et les éléments. En effet, ces approches peuvent rencontrer des problèmes tels que le démarrage à froid, la rareté des données, l'analyse limitée du contexte et la spécialisation excessive <cit.>. Les SdRs basés sur la connaissance sont proposés pour résoudre ces problèmes en sollicitant explicitement les préférences des utilisateurs pour de tels éléments et en utilisant une connaissance approfondie du domaine pour calculer des recommandations pertinentes <cit.>. En particulier, ce type de SdR convient bien aux situations où (i) les utilisateurs souhaitent spécifier explicitement leurs exigences ; (ii) il est difficile d'obtenir des commentaires sur les éléments ; et (iii) les commentaires peuvent être obsolètes ou sensibles au temps. Par exemple, si un élément est une voiture d'occasion, les commentaires peuvent ne pas être très utiles pour calculer des recommandations car une voiture d'occasion n'est achetée qu'une seule fois. En considérant la manière dont les utilisateurs interagissent et la base de connaissances correspondante utilisée pour ces interactions, il existe deux types de SdRs basés sur la connaissance : les SdRs basés sur les contraintes <cit.> et les SdRs basés sur les cas <cit.>. Alors que les SdRs basés sur les cas trouvent des éléments similaires en calculant et en adaptant les recommandations en fonction des cas similaires dans le passé, les SdRs basés sur les contraintes définissent un ensemble de règles/contraintes pour faire correspondre les préférences/les exigences des utilisateurs aux propriétés des éléments. Les SdRs basés sur les contraintes ont été appliqués dans différents domaines pour aider les utilisateurs à adopter les meilleures recommandations d'éléments pertinents. Dans <cit.>, les auteurs ont développé des SdRs basés sur les contraintes en se basant sur l'utilisation de bases de connaissances dans le domaine du tourisme. Dans <cit.>, l'auteur a proposé une amélioration de l'utilisation des SdRs basés sur les contraintes en utilisant la similarité des exigences des utilisateurs. L'utilisation de règles/contraintes est devenue de plus en plus populaire pour améliorer les résultats des recommandations, comme dans les applications e-commerce <cit.>, les systèmes de simulation <cit.> ou les services financiers <cit.>. L'achat et la vente de véhicules d'occasion n'est pas aussi fréquent que d'autres produits, et chaque véhicule n'a qu'une seule transaction. En général, les préférences des utilisateurs pour leurs véhicules préférés jouent un rôle important dans la recommandation de véhicules d'occasion pertinents. Afin d'effectuer les recommandations les plus pertinentes pour ce type de transaction, nous avons choisi de construire un SdR à base de contraintes en s'appuyant sur des graphes de connaissances. Dans la section suivante, nous présenterons en détail notre approche pour ce travail. § NOTRE APPROCHE Dans cette section, nous présentons notre approche pour la construction d'un SdR à base de contraintes s'appuyant sur un graphe de connaissances RDF. Pour illustrer notre approche, nous utilisons des ontologies du domaine de l'e-commerce liées à l'achat et à la vente de véhicules pour créer une base de connaissances. §.§ Graphe de connaissances via RDF La construction d'une base de connaissances pour le domaine des véhicules se compose de trois axes principaux : les propriétés des véhicules, les profils des utilisateurs-acheteurs et les interactions entre les utilisateurs-acheteurs et les véhicules. La collecte de ces informations peut être organisée et réécrite sous forme de triplets, définis formellement comme G_V = {a_1^v, a_2^v, ..., a_n^v} où a_i^v représente un triplet RDF complet a_i^v = ⟨ sujet_i, prédicat_i, objet_i⟩. De même, les profils d'utilisateurs qui comprennent des informations sur les utilisateurs et leurs préférences en matière de véhicules peuvent également être définis comme un ensemble de triplets RDF : G_U = {a_1^u, a_2^u, ..., a_m^u} où a_j^v représente un triplet RDF complet. Enfin, lorsqu'un utilisateur ajoute un élément à sa liste d'éléments préférés, cela signifie que cet élément est intéressant pour l'utilisateur. Ces interactions entre les utilisateurs et les éléments sont définies comme : RS : G_U × G_V × G_C ⟶ Interaction où G_U correspond à l'utilisateur, G_V désigne la description du véhicule et G_C exprime des informations contextuelles concernant l'utilisateur et l'élément lorsque l'interaction est effectuée, par exemple, les objectifs de l'utilisateur, la date, le lieu et les informations sur les ressources. Dans notre travail, nous utilisons l'ontologie développée pour la description des véhicules et des profils utilisateurs présentée dans <cit.>. Dans cet article, on organise les profils d'utilisateurs et les descriptions de véhicules sous forme de graphe de connaissances RDF. La Figure <ref> illustre un exemple de graphes de connaissances RDF. Ce graphe est équivalent à un ensemble de triplets. Chaque arête du graphe est représentée comme le prédicat du triplet, le nœud source est représenté comme le sujet du triplet, et le nœud de destination est décrit par l'objet du triplet. §.§ Système de recommandation basé sur les contraintes Après avoir défini les bases d'un graphe de connaissances RDF pour l'achat/la vente de véhicules, nous montrons dans cette section comment définir et construire un SdR basé sur des contraintes à partir de cette source de données. Dans notre travail, nous nous concentrons sur le traitement des exigences des utilisateurs à partir de leurs préférences et de leurs informations contextuelles. Tout d'abord, les préférences des utilisateurs concernant leur véhicule préféré sont considérées comme une partie des informations dans les profils d'utilisateurs. Par conséquent, les utilisateurs doivent fournir leurs préférences relatives aux caractéristiques du véhicule qu'ils aimeraient posséder. Par exemple, plusieurs utilisateurs peuvent avoir une préférence pour la couleur noire ou blanche pour leur véhicule, ou d'autres utilisateurs veulent un véhicule avec 7 places pour la famille. Deuxièmement, les informations contextuelles de l'utilisateur peuvent être les situations externes. Par exemple, l'endroit où les utilisateurs vivent ou travaillent peut être un facteur important dans la sélection des types de véhicules. Par conséquent, les informations sur les préférences des utilisateurs et le contexte de l'utilisateur jouent un rôle de contraintes afin de filtrer les éléments de recommandation pertinents pour les utilisateurs. D'autre part, nous établissons le pont entre les exigences des utilisateurs et les éléments de description des véhicules en utilisant les descriptions de véhicules et la connaissance du domaine. Tout d'abord, la description du véhicule englobe les propriétés d'un élément donné, tandis que la connaissance du domaine fournit des informations plus approfondies sur les éléments. Par exemple, lorsqu'un utilisateur déclare son profil et exprime son intérêt pour un “profil de famille”, la connaissance du domaine pour les éléments de véhicule permet la recommandation de véhicules de grande taille qui ont un nombre de places supérieur à trois sièges. La recommandation basée sur les contraintes repose sur l'exploration des relations entre les exigences de l'utilisateur et les propriétés de l'élément. La base de connaissances dans notre cas peut être considérée comme un ensemble de variables et un ensemble de contraintes. L'utilisation de ces variables et contraintes peut constituer les éléments d'un Problème de Satisfaction de Contraintes (CSP) <cit.>. Les solutions de ce CSP permettent de trouver les recommandations les plus pertinentes dans un SdR. La tâche de calcul et de suggestion des recommandations pour un utilisateur en fonction de ses préférences est appelée une tâche de recommandation. La tâche de recommandation est définie comme un CSP(𝒱_U,𝒱_I,𝒞), où 𝒱_U ={vu_1, vu_2, ..., vu_n} désigne un ensemble de variables qui représentent les préférences de l'utilisateur, 𝒱_I = {vi_1, vi_2, ..., vi_m} est un ensemble de variables qui représentent les propriétés des éléments, 𝒞 = 𝒞_KB∪𝒞_F fait référence à l'ensemble des contraintes représentant les contraintes spécifiques au domaine 𝒞_KB et l'ensemble de contraintes de filtre 𝒞_F qui décrivent le lien entre les préférences de l'utilisateur et les éléments. Dans le cadre d'une application e-commerce d'achats/ventes de véhicules, nous pouvons extraire différentes préférences utilisateur sous la forme d'un ensemble de variables pour 𝒱_U et les propriétés des éléments du véhicule sous la forme de l'ensemble de variables pour 𝒱_I. En particulier, nous illustrons les ensembles de variables par un exemple simple comme suit : * 𝒱_U = { vu_1: typeDeVéhicule(sedan,suv,van),vu_2:couleur(bleu, noir, blanc, rouge),vu_3:profil(utilisateurEtudiant, utilisateurParent, profilProfessionnel),vu_4:nombreDeSièges(entier),vu_5:maxKilométrage(entier), vu_6:marque(texte), vu_7:maxBudget(entier)} * 𝒱_I = { vi_1: nom (texte), vi_2:prix(entier),vi_3:typeDeCarrosserie(texte), vi_4:nombreDeSièges(entier), vi_5:annéeDuModèle(2021,2020, 2019,2018), vi_6:marque(Peugeot, Renault, Citroen), vi_7:kilométrage(entier)} Chaque contrainte peut être classée en 𝒞_KB ou 𝒞_F. Alors que les contraintes 𝒞_KB sont formées à partir de la connaissance du domaine, 𝒞_F définit les exigences particulières de l'utilisateur sur les éléments. Nous montrons plusieurs exemples de contraintes 𝒞_KB et 𝒞_F dans le tableau <ref>. Une recommandation (une solution) pour une tâche de recommandation donnée (𝒱_U,𝒱_I,𝒞) est définie comme une instanciation de 𝒱_I en réalisant une affectation complète aux variables de (𝒱_U,𝒱_I) telle que les contraintes en 𝒞 soient satisfaites. La recommandation est cohérente si les affectations sont cohérentes avec les contraintes. Les SdRs basés sur des contraintes reposent sur une base de connaissances explicite du domaine des utilisateurs et des éléments. Avec deux types de contraintes, nous pouvons calculer des recommandations pertinentes pour un utilisateur. Les contraintes de 𝒞_KB liées à la connaissance spécifique du domaine peuvent être satisfaites en utilisant des règles qui sont intégrées dans des ontologies. Par conséquent, nous explorons cette approche dans la prochaine section en se basant sur le modèle d'ontologie repris de <cit.> et le graphe de connaissances RDF pour les profils d'utilisateurs et les descriptions de véhicules. §.§ Contraintes de connaissance spécifiques au domaine par des règles SWRL Dans le contexte du domaine de l'achat/vente de véhicules, des ontologies sont utilisées pour structurer et organiser les descriptions de véhicules et les profils d'utilisateurs. L'ontologie proposée est construite à l'aide du langage d'ontologie Web (OWL) <cit.>, qui est un langage de représentation des connaissances hautement expressif, flexible et efficace basé sur l'arrière-plan mathématique de la logique de description. OWL peut réaliser le raisonnement sur les informations implicites en traitant des connaissances explicites, ce qui améliore la gestion de l'information. Les règles sont utiles pour implémenter la partie déductive de la base de connaissances. Dans ce travail, nous utilisons le langage de règles du web sémantique (SWRL) pour écrire des règles sur des graphes de connaissances RDF. Formellement, une règle SWRL se compose d'une syntaxe abstraite de haut niveau qui contient une partie condition et une partie conclusion. La constitution des parties condition et conclusion est des conjonctions positives d'atomes. La signification d'une règle SWRL peut être expliquée comme suit : si tous les atomes de la condition sont satisfaits, alors la conclusion doit se produire <cit.>. Dans diverses applications, des règles sont nécessaires pour étendre l'expressivité d'OWL. Par conséquent, l'utilisation de règles en conjonction avec des ontologies dans de tels cas devient un moyen efficace de résoudre des problèmes <cit.>. Les contraintes dans l'ensemble de contraintes 𝒞_KB s'appliquent souvent à une classe, aux propriétés d'une classe ou à un groupe d'individus. En d'autres termes, ces contraintes affectent les informations globales dans le cadre de la base de connaissances. Ces contraintes peuvent être traduites en règles à intégrer dans l'ontologie à l'aide de SWRL. Par exemple, pour la contrainte 𝒞_KB2 qui est utilisée pour tous les utilisateurs ayant une préférence pour la route longue distance, nous pouvons utiliser une règle SWRL pour déduire le type de véhicule préféré par l'utilisateur. Par conséquent, nous proposons de représenter les contraintes de connaissances spécifiques au domaine à l'aide de règles SWRL, en se basant sur les avantages en matière de déduction d'informations. Les règles SWRL offrent de puissantes capacités déductives exploitant une modélisation ontologique. Cependant, SWRL est essentiellement un langage de règles, et il ne fournit pas de support solide pour filtrer et interroger les informations du graphe de connaissances RDF. Par conséquent, nous présenterons une approche pour les contraintes 𝒞_F liées aux préférences de l'utilisateur qui implique le filtrage et la mise en correspondance sur les graphes de connaissances RDF dans la section suivante. §.§ Contraintes de préférence de l'utilisateur par des requêtes SPARQL SPARQL est un langage de requête standard de correspondance de graphe conçu pour récupérer et manipuler les données stockées dans des graphes de connaissances RDF sur des triplestores. Une requête SPARQL se compose généralement de trois parties : (i) la partie de correspondance de motif qui définit les motifs utilisés pour la correspondance de variables tels que des déclarations facultatives, l'union de motif, l'imbrication ou les déclarations de filtrage ; (ii) la partie de modification de solution qui ajuste les sorties en modifiant les valeurs des variables par plusieurs opérateurs tels que distinct, order, limit, ou offset ; et (iii) la sortie de la requête définit un ensemble de variables qui correspondent aux motifs à retourner ou construisent de nouveaux triplets/graphes <cit.>. Supposons que Q est une requête SPARQL et que c est une contrainte. Q FILTER c est appelée une requête de contrainte, où chaque variable dans la contrainte est satisfaite dans la requête Q. Une solution d'une requête SPARQL Q est définie comme une assignation de variables dans Q à des valeurs. Un ensemble de valeurs possibles qui peuvent être assignées à une variable est appelé un domaine. Une recommandation ou solution est cohérente si toutes les variables déclarées dans la requête ont une valeur correspondante garantie. Pour trouver toutes les solutions possibles, nous sélectionnons une valeur dans le graphe de connaissances RDF pour chaque variable et nous assurons qu'elle vérifie les conditions des motifs et des filtres. En tenant compte de ces aspects, trouver des recommandations pour le SdR basé sur des contraintes défini dans les définitions <ref> et <ref> revient à trouver les solutions d'une requête SPARQL Q avec un ensemble de contraintes c. Les expressions équivalentes de celles-ci sont décrites : * Les variables dans 𝒱_U et 𝒱_I sont utilisées comme variables principales dans la requête SPARQL Q sur les graphes de connaissances RDF associés à G_U et G_I. * Les contraintes c ∈𝒞_F doivent être satisfaites en incorporant la clause FILTER dans la requête SPARQL Q. La mise en correspondance de motifs de graphes est essentiellement le mécanisme utilisé par SPARQL pour récupérer des informations à partir de graphes de connaissances RDF. Dans ce contexte, une contrainte est considérée comme une évaluation d'un motif de graphe sur le graphe de connaissances RDF. Pour trouver des solutions, les requêtes SPARQL peuvent utiliser des motifs de triplets et des modificateurs de solutions en tant que contraintes. Les motifs de triplets impliquent trois variables et les modificateurs de solutions tels que ORDER BY, DISTINCT et LIMIT peuvent être utilisés pour trier, éliminer les doublons et limiter des solutions. Cette approche bénéficie de l'expressivité des requêtes SPARQL, qui ont le pouvoir expressif de l'algèbre relationnelle. § EXPÉRIMENTATIONS Afin d'évaluer l'approche proposée, nous utilisons le graphe de connaissances RDF composé de 5537 individus de descriptions de véhicules et de 367 préférences d'utilisateurs, qui contiennent un total de 822 000 triplets RDF basés sur les modèles de l'ontologie présentés dans <cit.>. À partir d'une étude empirique des ensembles de données, nous montrons comment fonctionne notre SdR basé sur des contraintes via le graphe de connaissances RDF. Tout d'abord, nous organisons les préférences des utilisateurs et les descriptions de véhicules en triplets RDF basés sur le modèle de l'ontologie afin de collecter les données de manière formelle. La construction d'un SdR basé sur des contraintes se concentre ensuite sur la résolution de deux ensembles de contraintes : des contraintes de connaissances spécifiques au domaine et des contraintes de préférences utilisateur. En particulier, l'ensemble de contraintes basé sur les connaissances spécifiques au domaine est traduit en règles SWRL et directement implémenté sur le graphe de connaissances RDF via des modules de raisonnement. La déduction d'informations nouvelles et pertinentes sur chaque utilisateur et chaque élément de véhicule est ensuite ajoutée à l'ensemble de données comme illustré dans la figure <ref>. L'ensemble de contraintes repose sur les préférences des utilisateurs liées aux informations sur leurs véhicules préférés, qui jouent un rôle essentiel dans la recherche de recommandations pertinentes. Par conséquent, nous formulons ces contraintes à l'aide de requêtes SPARQL basées sur la mise en correspondance de motifs sur des graphes et des modificateurs de solutions, comme indiqué dans la Figure <ref>. Dans le cas idéal, toutes les variables peuvent être affectées et nous pouvons trouver des solutions vérifiant pour le graphe de connaissances RDF. Au final, les recommandations produites respectent l'ensemble des contraintes et sont donc les plus pertinentes. Cependant, de nombreux cas peuvent ne pas trouver de solution en raison de certaines incohérences entre les contraintes des préférences de l'utilisateur et les descriptions des véhicules. Il y a deux propositions possibles pour ce problème : (1) Enrichir et agrandir la base de connaissances RDF en augmentant le nombre de véhicules échangés sur les portails ; (2) Traiter et identifier un ensemble minimal de contraintes à partir des préférences de l'utilisateur. Au lieu d'enrichir le jeu de données comme dans la première proposition, la seconde proposition repose sur l'élimination ou l'adaptation des contraintes de l'utilisateur en utilisant un ensemble de diagnostic qui est défini comme un ensemble de contraintes Δ extrait de l'ensemble de contraintes 𝒞_F tel que les recommandations à partir du nouvel ensemble de contraintes 𝒞_F-Δ sont cohérentes. Afin d'expérimenter ce type de situation, nous avons construit des contraintes de préférences utilisateur basées sur l'ensemble de variables 𝒱_U = {Seats, VehicleType, Brand, Color, Mileage, Price} extraites des préférences utilisateur dans l'ensemble de données. L'expérience avec toutes les contraintes basées sur les préférences de l'utilisateur a abouti à 88 % des utilisateurs qui ont trouvé au moins une solution dans l'ensemble de données RDF. Avec la deuxième expérience, nous avons cherché à construire des ensembles de diagnostics afin de maximiser le nombre de solutions correspondant aux préférences de l'utilisateur et de réduire le nombre d'utilisateurs qui ne peuvent pas trouver de solution. Les ensembles de diagnostics incluent uniquement les contraintes éliminées de chaque préférence de l'utilisateur, en fonction d'un ordre de préférence défini par l'utilisateur pour ses préférences. Par exemple, Δ_1 = {Places-Seats}, Δ_2 = {TypeVehicule-VehicleType}, Δ_3 = {Marque-Brand}, Δ_4 = {Couleur-Color}, Δ_5 = {Kilométrage-Mileage}, Δ_6 = {Prix-Price}, Δ_7 = {Couleur, Marque}. La figure <ref> montre des histogrammes sur la distribution du nombre de solutions sur le nombre d'utilisateurs en utilisant différents ensembles de diagnostics. Avec toutes les contraintes 𝒱_U, la majorité du nombre de solutions se situe dans une plage de 0 à 5 solutions par utilisateur. En appliquant des ensembles de diagnostics, le nombre de solutions s'étend avec une augmentation du nombre de solutions supérieure à 10 pour les utilisateurs. Ces changements dans le nombre de solutions sont particulièrement illustrés par l'ensemble de contraintes : 𝒱_U - Δ_3 et 𝒱_U - Δ_4. Pour réduire le nombre d'utilisateurs qui ne peuvent pas trouver de solution, l'élimination de plusieurs préférences de l'utilisateur peut devenir nécessaire. Cela signifie qu'il est nécessaire de faire un compromis entre la satisfaction de l'utilisateur et les résultats de recommandations. Nous illustrons le SdR basé sur des contraintes à partir d'un graphe de connaissances RDF dans le domaine des véhicules. Les expérimentations menées confirment l'intérêt de notre approche de séparation des ensembles de contraintes en ensembles de contraintes de connaissances spécifiques au domaine et en ensembles de contraintes de préférences de l'utilisateur. En utilisant des règles SWRL, l'ensemble de connaissances spécifiques au domaine peut être déduit et intégré dans l'ensemble de données RDF. L'ensemble de contraintes construit sur les préférences utilisateur est traduit en requêtes SPARQL. Les recommandations pertinentes pour les utilisateurs sont extraites à partir des solutions obtenues par la recherche de motifs sur les graphes RDF. § CONCLUSION ET PERSPECTIVES Dans cet article, nous avons présenté comment construire un SdR basé sur des contraintes s'appuyant sur un graphe de connaissances. Un tel système permet d'intégrer dans un modèle sémantique uniforme la description des éléments et celle du domaine dans lequel ils évoluent. Nous avons montré comment distinguer contraintes selon qu'elles concernent les connaissances spécifiques au domaine ou les préférences de l'utilisateur. En utilisant des règles SWRL, nous avons traduit les contraintes de connaissances spécifiques au domaine en règles et avons effectué des déductions de nouvelles informations pertinentes sur le graphe de connaissances RDF. Les contraintes de préférences de l'utilisateur peuvent être directement traduites en requêtes SPARQL. Nous avons mené une expérience sur notre approche basée sur le graphe de connaissances RDF de l'achat et de la vente de véhicules. Les résultats de recommandation obtenus à partir du SdR basé sur des contraintes sont prometteurs. Dans nos travaux futurs, nous prévoyons de rechercher l'exploitation d'ensembles de diagnostics, qui devraient être optimisés pour chaque utilisateur et pourraient aider à réduire le temps de performance pour proposer des recommandations pertinentes. § REMERCIEMENTS Cette recherche a été financée par l’Agence National de la Recherche (ANR) et par l’entreprise Vivocaz au titre du projet France Relance – préservation de l’emploi R&D (ANR-21-PRRD-0072-01). plain
http://arxiv.org/abs/2306.05943v1	20230609145858	Interplay of Chiral Transitions in the Standard Model	[ "Holger Gies", "Richard Schmieden", "Luca Zambelli" ]	hep-th	[ "hep-th", "hep-ph" ]	[email protected] Helmholtz-Institut Jena, Fröbelstieg 3, D-07743 Jena, Germany GSI Helmholtzzentrum für Schwerionenforschung, Planckstr. 1, D-64291 Darmstadt, Germany [email protected] [email protected] We investigate nonperturbative aspects of the interplay of chiral transitions in the standard model in the course of the renormalization flow. We focus on the chiral symmetry breaking mechanisms provided by the QCD and the electroweak sectors, the latter of which we model by a Higgs-top-bottom Yukawa theory. The interplay becomes quantitatively accessible by accounting for the fluctuation-induced mixing of the electroweak Higgs field with the mesonic composite fields of QCD. In fact, our approach uses dynamical bosonization and treats these scalar fields on the same footing. Varying the QCD scale relative to the Fermi scale we quantify the mutual impact of the symmetry-breaking mechanisms, specifically the departure from the second order quantum phase transition of the pure Yukawa sector in favor of a crossover upon the inclusion of the gauge interactions. This allows to discuss the “naturalness” of the standard model in terms of a pseudo-critical exponent which we determine as a function of the ratio of the QCD and the Fermi scale. We also estimate the minimum value of the W boson mass in absence of the Higgs mechanism. Interplay of Chiral Transitions in the Standard Model Luca Zambelli ===================================================== arabic § INTRODUCTION In the standard model of particle physics, chiral symmetry breaking generates the masses of fermionic matter in the visible universe <cit.>. Two sectors of the standard model contribute apparently independently to fermion mass generation: at the Fermi scale, electroweak symmetry breaking triggered by the parameters of the Higgs potential induce current quark and charged lepton masses <cit.> through the Yukawa interactions to the Higgs field. Subsequently at the QCD scale, the intricate dynamics of the strong interactions generate the baryon masses that ultimately dominate the visible masses in the universe <cit.>. With the Fermi scale corresponding to the vacuum expectation value of the Higgs field v≃ 246 GeV and the QCD scale Λ_QCD≃𝒪(100) MeV, the two relevant scales are 2-3 orders of magnitude apart. The symmetry-breaking mechanisms are rather different in the two sectors: mass generation in QCD is driven by the gluonic interactions growing strong towards lower energies, thus being an intrinsically nonperturbative phenomenon. Mass generation in the electroweak sector – despite also being a gauge theory – is described by the Yukawa interactions with the Higgs field and appears accessible to perturbation theory. Also, all involved quantities including the two different scales given above can be traced back to different fundamental parameters of the model. Similar comments apply to typical embeddings of the standard model in overarching models, where the two scales are parametrized by the breaking mechanisms towards the standard-model symmetries. The qualitative difference between the two mechanisms of chiral symmetry breaking becomes prominent when studying the symmetry transitions as a function of control parameters within reduced model sectors. For instance, reducing the electroweak sector to a pure Yukawa model involving the Higgs field and the most strongly coupled top and bottom quarks, the reduced model exhibits a chiral quantum phase transition of second order as a function of the mass parameter of the Higgs potential <cit.>. By contrast, the pure QCD sector is essentially governed by the strong coupling constant, and the long-range physics is always in the symmetry broken phase. The combination of the two sectors therefore suggests that the standard model is also always in the symmetry broken phase, but exhibits a rapid crossover as a function of a suitable control parameter. This rapid crossover is also a manifestation of the so-called naturalness problem <cit.>: considering the standard model as a function of microscopic (bare) parameters at some high-energy scale Λ (an ultraviolet (UV) cutoff), one of its parameters serving as a control parameter has to be tuned rather finely to put the model rather close to the rapid crossover. This fine-tuning is necessary to separate the high scale Λ from the Fermi scale and the subsequent QCD scale, Λ v > Λ_QCD. It should be emphasized that the naturalness problem is not a consistency problem of the standard model, but rather a peculiar feature that may or may not find an explanation within an embedding in a more fundamental theory. The present work is devoted to a study of the interplay of the two chiral symmetry breaking sectors of the standard model. This interplay is visible in the details of how the two transitions merge into the expected rapid crossover. Moreover, it becomes apparent by the fact that the relevant degrees of freedom partly share the same quantum numbers: in the electroweak sector, we encounter the presumambly fundamental Higgs field, whereas a composite mesonic scalar field serves as a useful effective degree of freedom for the description of the chiral QCD transition. We show that these scalar fields can be dealt with on the same footing yielding only a single effective field for the description of both chiral transitions. As an advantage, we can study the region near the rapid crossover as a function of the microscopic parameters, allowing to quantify the strength of the crossover in terms of a pseudo-critical exponent. We argue that this exponent is a measure for the amount of fine-tuning needed on the microscopic level, thereby quantifying the naturalness problem. In our approach, we can thus also compute how much the naturalness problem in the electroweak sector is “alleviated” by the presence of the QCD sector. Finally, our approach can be used to estimate the properties of a non-fine-tuned version of the standard model. For the case that chiral-symmetry breaking of QCD would dominate fermion mass generation and condensate formation, QCD would also generate masses for the electroweak gauge bosons <cit.> the value of which we estimate in the present work. A special class of such models are those that would solve the hierarchy problem by requiring an enhanced symmetry, scale invariance, which is then dynamically broken by means of QCD-like dimensional transmutation. Typically, the mass spectrum generated by this Coleman-Weinberg mechanism is sensitive to the details of the bare Lagrangian at the UV scale Λ, that is to say to the marginal couplings such as the quartic Higgs coupling. Extracting an unambiguous prediction for the mass spectrum in these scale invariant Coleman-Weinberg scenarios then requires a UV completion being able to remove the UV cutoff and to reduce the freedom in the choice of these bare couplings. Still, the details of the translation between the marginal couplings and the IR mass spectrum and interactions remain nonperturbative. Thus, the study presented in this article can be conceived as a first step in this direction. Rather than focusing straight ahead on the critical region of approximate scale invariance, whose precise definition at sizable gauge coupling is already a nontrivial problem, we address a more general survey of the phase diagram, aiming to provide an overall picture of how the two extremal scenarios, the pure-Yukawa sharp second-order phase transition and the pure QCD universal chiral symmetry breaking, can be reconciled and connected with an intermediate and less understood regime, featuring the interplay of several sources of symmetry breaking. Our work uses methods of functional renormalization in order to deal with the nonperturbative aspects of the problem. Moreover, these methods give access to treat fields as effective degrees of freedom in a scale-dependent manner which is crucial to focus on the relevant fields and remove redundant field variables. In the following, we introduce the various relevant sectors of the standard model in Sect. <ref> in order to motivate the model subset which we include in our quantitative analysis. Section <ref> briefly summarizes the central renormalization group flow equations including the scale-dependent field transformations that facilitate a study of the interplay of the chiral transitions. The nature of the transitions is quantitatively studied in Sect. <ref>, containing most of our results. We conclude in Sect. <ref>. Technical details and additional quantitative analyses are contained in the appendices. § CHIRAL SYMMETRY BREAKING SECTORS OF THE STANDARD MODEL We are mainly interested in the interplay between the two sectors of the standard model which are responsible for the fermion mass formation through chiral symmetry breaking. For the electroweak sector, the driving mechanism is controlled by the RG-relevant mass parameter of the Higgs potential, whereas the QCD sector is controlled by the marginally relevant non-Abelian gauge coupling. Also, we neglect the long-range effects of the electroweak gauge bosons associated to the U(1)_Y×SU(2)_L symmetry. The latter are subleading with respect to gluons, even though the limit of vanishing weak and hypercharge gauge couplings is presumably not smooth; in the full system, the construction of observables therefore requires a more careful discussion <cit.>. By dropping the electroweak gauge sector, our study differs from those of other deformations of the standard model where the coupling strengths of the weak and strong sectors are shifted relative to each other <cit.>. We also ignore most of the flavor asymmetry of the quarks and leptons, accounting specifically for the third generation of quarks which are most strongly coupled to the Higgs field, and for the split between the top and bottom quarks. Finally, we deal with the strong-coupling IR regime with the help of a somewhat minimalistic description that neverlessless gives us a qualitative and semi-quantitative access to the chiral transition. For this, we start from microscopic QCD and study the renormalization flow towards the quark-meson model <cit.> along the lines familiar from functional RG studies <cit.>. In fact, the quark-meson model can quantitatively be matched to chiral perturbation theory <cit.> as the low-energy limit of QCD. As argued below, the QCD-induced mesonic scalar field can in fact account also for the standard-model Higgs field by means of an appropriate identification of degrees of freedom and couplings. §.§ From QCD to the quark-meson model The QCD sector of the standard model consists of a non-Abelian SU() gauge theory minimally coupled to massless Dirac fermions (quarks) defined by the (Euclidean) action S=∫_x ψ̅^a_i iD_ijψ^a_j +1/4F^z_μνF^μν_z. The fermions are described by ψ^a_i, where a,b=1,..., denote the flavor indices and i,j=1,..., the fundamental color indices. The covariant derivative D^μ_ij in the fundamental representation of the group SU(N_c) couples quarks to the non-Abelian gauge bosons (A^μ)_ij and is given by D^μ_ij=∂^μδ_ij-ig(A^μ)_ij. In general, we work with the physical values of N_c=3 colors and N_f=6 flavors. However, when focusing on the top-bottom family, we use N_f=2 as is appropriate for a single generation. For the approach to the low-energy phase of QCD, we map the microscopic QCD sector defined by eq:SQCD onto the quark-meson model which we consider as a useful effective field theory for our purposes. We emphasize that we do not introduce any new independent parameter but extract the IR values of the quark-meson model parameters from the RG flow. The translation from the high- to the low-energy description proceeds most conveniently by studying the four-fermion interactions which are induced during the RG flow through quark and gluon fluctuations. For the sake of simplicity, we focus solely on the scalar-pseudoscalar channel in a point-like approximation. This is familiar from the Nambu-Jona-Lasinio model which can become critical at strong coupling and mediates chiral symmetry breaking <cit.>. At intermediate scales, we therefore work with the effective action Γ=∫_x +{ψ̅^a_iiD_ijψ^a_j+1/4 F_μν^z F_z^μν ++1/2λ̅_σ[(ψ̅_i^aψ_i^b)^2-(ψ̅_i^aγ_5ψ_i^b)^2]} , amended by a suitable gauge-fixing and ghost sector. Again, the four-fermion interaction λ̅_σ is not used as a model parameter, but computed from the RG flow of the microscopic action. Starting from the asymptotically free high energy domain, the gauge coupling grows towards the low energy regime <cit.>, subsequently also driving the four-fermion coupling λ̅_σ to large values. This is indicative for the approach to chiral symmetry breaking and condensate formation. The corresponding composite scalar degrees of freedom appearing in the effective low-energy theory can be traced by means of a Hubbard-Stratonovich transformation. Introducing the auxiliary complex scalar field, φ^ab=-ih̅/m^2ψ̅^b_iP_Lψ^a _i, φ^∗ ab=-ih̅/m^2ψ̅^a_iP_Rψ^b_i, we can translate the four-fermion interaction into a Yukawa interaction of the fermions with the new scalar degrees of freedom. The resulting effective action includes the quark-meson effective theory, Γ=∫_x ∂_μφ^ab∂^μφ^∗ ab+U(,^†)+ ψ̅^a_iiD_ijψ^a_j+1/4F_μν^z F_z^μν +ih̅ψ̅_i^a[P_Rφ^ab +P_Lφ^∗ ba]ψ_i^b . Again, the Yukawa coupling h̅ as well as the mesonic effective potential U do not contain free parameters, but are determined by the RG flow of QCD and thus governed by the gauge coupling. Clearly, this action still contains massless gluons, and will do so even after an IR massive decoupling of the quarks and mesons. Since we are interested in the chiral transition, the presence of free massless gluons in the deep IR of the model is not relevant. Of course, confinement and the Yang-Mills mass gap removes gluons from the physical IR spectrum. This model is invariant under SU(N_f)_L×SU(N_f)_R transformations, where these transformations act independently on the left- and right-handed spinor ψ_R → U_Rψ_R, ψ_L → U_Lψ_L, as well as on their conjugate transposed as ψ̅_R → ψ̅_RU_R^†, ψ̅_L → ψ̅_LU_L^†. The scalar field transforms as φ → U_RU_L^†, φ^† → U_L^†U_R^†. Additionally the model is invariant under a U(1)_B symmetry, corresponding to baryon number conservation. It acts only on the spinor, since the scalar fields are made up of quark-antiquark pairs (c.f. eq:hubbardstratonoviceom) and thus carry no baryon number ψ → exp(iϑ_B/3)ψ ψ̅ → exp(-iϑ_B/3)ψ̅. The U(1)_A anomaly could be included in the present framework <cit.>, but is not relevant for our purposes. Chiral symmetry breaking in this model induces a non-vanishing vacuum expectation value for the scalar field. The phenomenologically relevant breaking pattern corresponds to the vacuum configuration φ_0= [ σ_0 0 … 0; 0 σ_0 … 0; ⋮ ⋮ ⋱ ⋮; 0 0 … σ_0 ] , which breaks the SU(N_f)_L×SU(N_f)_R symmetry of the model down to the diagonal SU(N_f)_V subgroup. In this case we consider a quartic approximation for the scalar potential, in the symmetric (SYM) and in the spontaneous-symmetry-breaking (SSB) regimes, respectively given by U(,^†) =m^2ϱ+1/2λ_1 ϱ^2+1/4τ, SYM, U(,^†) =1/2λ_1(ϱ-ϱ_0)^2+1/4τ, SSB, where we have introduced the invariants ϱ =(^†), τ = 2 (^†)^2- ϱ^2. Here ϱ_0 denotes the scale-dependent minimum of the scalar potential in the SSB regime. The scalar mass spectrum obtained by spontaneous chiral symmetry breaking with the vacuum configuration given by eq:QMVacuum is given in appendix <ref>, and has been discussed in detail for general in ref. <cit.> §.§ Indentifying the overlap of the Higgs and meson degrees of freedom The auxiliary meson field introduced in the low-energy effective description of strong interactions, and the fundamental Higgs doublet ϕ of the standard model play similar roles, as their vacuum expectation value parametrizes mass generation and chiral symmetry breaking. This similarity poses fundamental questions, which are ultimately connected with the challenge of bridging between effective field theories valid at very different scales. See for instance refs. <cit.> for discussions of the possible interplay of these two fields. The quark meson model is generically conceived as an effective description of the strong interactions below energies of the order of a few GeV, with a characteristic scale of breaking of the approximate chiral symmetry given by the vacuum expectation value v of the σ field, eq:QMVacuum, of the order of f_π≃ 93 MeV. An effective UV cutoff scale – if it exists – of the Higgs model is instead unknown. In the present work, we parametrize it by a high-energy scale Λ which we take as sufficiently large. Towards lower scales, the parameters of the Higgs potential generate the electroweak scale, characterized by the breaking of the global SU(2)_L×SU(2)_R custodial symmetry and of the exact chiral symmetry at the characteristic Fermi scale of Λ_F=246 GeV. The Fermi scale at the same time corresponds to the vacuum expectation value v of the Higgs field. From this point of view there seems to be no reason to aim at the simultaneous description of the two phenomena by means of a single linear sigma model. Following this perspective, a first investigation of the electroweak phase transition in a chiral Higgs-top-bottom model has been studied in Ref. <cit.> and is summarized in appendix <ref>. This study adopts RG methods, along the lines for instance of Ref. <cit.>, and supplements the quark-meson model with an independent elementary Higgs field. As a matter of fact however, the effective descriptions of symmetry breaking by the two sigma models describing the strong and the Higgs sectors are indistinguishable, as the relevant corresponding components of the scalar fields carry the same conserved quantum numbers (also in presence of the full electroweak gauge sectors). Therefore, we focus here on the simplest toy model, where we remove the redundant double-counting of the parity-even scalar symmetry-breaking channel. In the present Higgs-QCD model it is particularly clear that the overlap between the QCD meson field and the Higgs sectors extends even beyond the single degrees of freedom describing the sigma and Higgs particles, and can include the whole Higgs doublet. Of course with doublet here we mean a fundamental representation of the global SU(2)_L group only, which is a subgroup of the QCD chiral symmetry, as the electroweak gauge sector of the standard model is not taken into consideration in the present analysis. In order to make this matching of the scalar degrees of freedom explicit, we focus in the following on the 3rd generation of quarks, the top and bottom family for which we reduce our equations to N_f=2. The identification of the Higgs doublet with some of the components of the collective QCD-meson field becomes transparent from an analysis of the Yukawa interactions. Using a reparametrization of the meson field as Φ^ab =1/√(2)(φ^ab+ϵ^acϵ^bdφ^∗^cd) Φ̃^ab =1/√(2)(φ^∗^ab-ϵ^acϵ^bdφ^cd), we find that each scalar field Φ and Φ̃ contains 4 real degrees of freedom for the present case of =2 , and the various components can be related under complex conjugation through Φ^∗^ab =ϵ^acϵ^bdΦ^cd Φ̃^∗ ab =-ϵ^acϵ^bdΦ̃^cd. These fields transform under the (2,2̅) representation of the SU(2)_L×SU(2)_R symmetry group. Φ → U_LΦ U^†_R Φ̃ → U^†_RΦ̃U_L. The conventional electroweak Higgs field ϕ^a as a complex doublet can be identified by ϕ^a≡Φ^a2 , implying ϕ_𝒞^a=i(σ_2)^abϕ^∗^b. As required, ϕ^a transforms under SU(2)_L. In addition, we can define ϕ̃^a as a complex doublet under SU(2)_R by ϕ̃^a=Φ̃^2a , implying ϕ̃_𝒞^a=-i(σ_2)^abϕ̃^∗ b, respectively. This allows us to rewrite the Yukawa interaction in the quark-meson model as ℒ^QM_Yuk= ih̅/√(2) ([,i]aϕ^a[,i] + [,i]aϕ_𝒞^a[,i] + h.c.. . + [,i]aϕ̃^a[,i]+[,i]aϕ̃_𝒞^a[,i]+h.c.). Here we have used the following standard notation for the flavor components of the fermion field ψ_L/R,i=[ t_L/R,i; b_L/R,i ]. Comparing this Yukawa interaction with the one of the Higgs-top-bottom model for the special case =2, we observe the scalar field ϕ to have the same quantum numbers as the Higgs doublet, while the ϕ̃ field contains the remaining four real degrees of freedom present in the mesonic field of QCD (for =2). The latter has no analogue in the electroweak sector, and here describes a doublet in the fundamental representation of SU(2)_R. As quarks in the standard model have nonvanishing electroweak charges, four-Fermi couplings exist in several channels with a complicated charge assignment. The channels which are related to the Higgs field upon a Hubbard-Stratonovich transformation are well known from top quark condensation models <cit.>. Independently of the details, the corresponding channels always have some overlap with the QCD induced channels. After a Hubbard-Stratonovich transformation, we match those parts of the mesonic field that share the same quantum numbers with the Higgs field. Although meson Yukawa couplings emerge as an effective description of the quark four-fermion couplings induced by QCD, the standard model features also fundamental Yukawa couplings to the Higgs. As a consequence, we introduce new coupling constants for the top and bottom Yukawa interaction and arrive at the final form ℒ_Yuk= +ih̃_b/√(2)( [,i]aϕ^a [,i] + [,i] ϕ^∗ a[,i]a) +ih̃_t/√(2)( [,i]aϕ_𝒞^a[,i] + [,i]ϕ_𝒞^∗ a[,i]a) +ih̅/√(2)([,i]aϕ̃^a[,i]+[,i]aϕ̃_𝒞^a[,i]+ h.c.), where h̃_t/b = h̅_t/b + h̅. Despite the simple new parametrization of eq:linearh, it is important to stress that the flow of the couplings h̅_t/b is primarily driven by the electroweak sector, whereas h̅ is driven by QCD fluctuations. Notice also that the interaction of the SU(2)_R-doublet ϕ̃ with the quarks remains fully parametrized by the QCD-induced coupling h̅. The model inherits the U(1)_B symmetry of eq:baryonsym from the quark meson model, corresponding to baryon number conservation in the theory. (NB: we ignore the U(1)_B violating sphaleron processes of the standard model in our analysis.) While we have focused here on the top/bottom family, the matching of the scalar fields also applies to the lighter quark families as the corresponding sectors in the mesonic field carries the same quantum numbers. In this manner, the current quark masses are generated at the Fermi scale from the corresponding fundamental Yukawa couplings. The main difference, however, is that the lighter quarks do not decouple near the Fermi scale and thus the corresponding mesonic fields are predominantly driven more and more by QCD. In addition, the full mesonic field also contains components that link the different families to one another. These inter-family components do not correspond to any part of the electroweak Higgs field. §.§ From the meson potential to the Higgs phase We now want to construct a scalar potential out of the invariants of the fields ϕ and ϕ̃, ρ =ϕ^†ϕ, ρ̃ =ϕ̃^†ϕ̃. The SU(2)_L×SU(2)_R invariant ϱ defined in eq:rhotaudef then yields ϱ=ρ+ρ̃. A particular quartic potential constructed out of these invariants and inspired by eq:QMScalarPotential is given by U(ρ ,ρ̃)=m^2(ρ +ρ̃)+λ_1/2(ρ +ρ̃)^2+λ_2ρρ̃. This potential, however, cannot be mapped one-to-one to the scalar potential given in (<ref>), since the τ invariant cannot be expressed by ρ and ρ̃ alone. This mismatch between eq:myScalarPotential and eq:QMScalarPotential has a subdominant effect on the scalar spectrum, which slightly differs in the two cases as is discussed in appendix <ref>. In the symmetric case where m^2>0, the minimum of the potential has a vanishing field, ρ=0 and ρ̃=0. In the symmetry-breaking regime, we parametrize the potential by U(ρ, ρ̃)=λ_1/2(ρ+ρ̃ -κ)^2+λ_2ρρ̃. For being able to describe the standard-model-like Higgs phase, we specify our vacuum to be ρ=κ and ρ̃=0. The vacuum expectation value in the ϕ field spontaneously breaks the SU(2)_L×SU(2)_R symmetry of the QCD part of the model down to diagonal SU(2) and induces Dirac masses for the fermions through the Yukawa interaction. Choosing our vacuum to be .ϕ\|_vac= [ i0i; √(κ) ], .ϕ̃\|_vac= [ i0i; 0 ], the induced fermion masses read m^2_top =h̃_t^2/2κ, m^2_bot =h̃_b^2/2κ. The scalar spectrum contains ^2 -1 massless degrees of freedom (Goldstone bosons), ^2 degrees of freedom with mass √(λ_2κ) and one radial mode corresponding to the Higgs particle with mass √(2λ_1κ). For conventional appliations in the quark-meson model with =2 light (first generation) quark flavors, the three Goldstone modes are identified with the pions. In the present setting, where we consider the third generation, the ϕ field corresponds to the Higgs instead. Upon embedding into the full standard model, the gauged SU(2)_L provides mass to the corresponding gauge bosons through the Brout-Englert-Higgs mechanism and the Goldstone bosons disappear. In the present simplified model, these massless Goldstone bosons would naively remain in the spectrum. In order to avoid artifacts caused by them, we decouple them from the flow by giving them a mass of the order of the longitudinal gauge bosons, once the Higgs field develops a vacuum expecation value near the Fermi scale. § RG FLOW EQUATIONS Effective field theories are a perfect tool for the description of phase transitions, as is well established since the early work of Ginzburg and Landau. However, to address issues such as decoupling of degrees of freedom, hierarchy of scales, or even the origin of symmetry breaking, they have to be complemented with additional information. RG methods are often the preferred source of this information. To be able to follow the RG flow of our effective toy model from its weak-coupling standard-model-like UV behavior down to the chiral-symmetry-breaking regime, we need nonperturbative methods. The precise running of the strong gauge coupling and the details of the QCD IR dynamics are not essential for our main case study of the interplay of the chiral transitions. We therefore model the gauge flow with a simple ansatz for the running gauge coupling described in the following. On the other hand, the influence that this strongly coupled gauge sector has on the matter fields and especially on the Higgs-meson sector is of crucial relevance. For the latter, we resort to functional RG methods whose description and implementation is the main body of this section. §.§ Gauge sector In the gauge sector, we use a perturbative two-loop equation for the running of the gauge coupling. We improve this flow such that we obtain an IR fixed point α_∗=g^2_∗/(4π) for that coupling, whose presence e.g. in Landau gauge has been put forward by a number of studies, see for instance refs. <cit.>. In the FRG scheme that we are using, such a fixed point is rather generic as it is compatible with the decoupling of IR modes due to confinement and mass gap generation. This fixed point has to be chosen above the critical gauge coupling needed to induce chiral symmetry breaking <cit.>. The precise choice of α_* is then irrelevant for our analysis, since massive hadronic freeze-out occurs before the fixed-point regime. Although capturing chiral symmetry breaking, this ad hoc modification of the beta function together with the restriction to pointlike fermionic self-interactions is a somewhat crude approximation which can be substantially improved within a systematic propagator and vertex expansion <cit.>. We describe the scheme-dependent intermediate flow between the perturbative weakly coupled regime and the nonperturbative fixed point by means of a smooth exponential function <cit.>. Other parametrizations, for instance using a Heaviside step function as the opposite extreme, would not significantly change our results. The beta function for the gauge coupling then reads ∂_tg^2= g^2 =-2 (c_1g^4/16π^2+c_2g^6/(16π^2)^2) ×(1-exp(1/α_∗-1/g^2/4π)) , where we have introduced the constants c_1 =(11/3-2/3), c_2 =(34/3^2-10/3-2C_2()). At high energies, we use =6 active flavors within the beta function but dynamically account for their decoupling across their mass thresholds for the heavy quarks. After crossing into the broken regime at k=k_trans, we gradually switch off the top and bottom quark in the running of the strong gauge coupling by decreasing the effective number of active flavors to 5 at the top mass threshold, and then to 4 at the bottom threshold. The thresholds of both quarks are determined by their respective Yukawa coupling at the transition scale m^2_t ≈1/2h̃^2_t\|_k=k_trans k^2_trans, m^2_b ≈1/2h̃^2_b\|_k=k_trans k^2_trans. Expressed through RG time, we decouple the quarks from the running of the strong gauge coupling at t_top=ln(h̃_t/√(2)) and t_bottom=ln(h̃_b/√(2)) after we entered the broken regime. §.§ Matter sector We study the matter sector of our model using the functional renormalization group (FRG) as a method that allows us to address strong-coupling regimes as well as the perturbative accessible weak-coupling limit. The starting point is a (bare) microscopic action S defined at an UV cutoff Λ and the RG flow of a scale-dependent effective action Γ_k given by the Wetterich equation <cit.> ∂_tΓ_k=1/2STr(∂_t R_k/Γ_k^(2)+R_k). This scale-dependent effective action interpolates between the bare action Γ_k=Λ=S, and the full quantum effective action Γ_k=0=Γ, where all quantum corrections have been integrated out. In eq:Wetterich R_k denotes the regulator, which is to some extent an arbitrary function of momentum. Its additive insertion in the denominator (i.e. in the exact propagator) serves as an IR cutoff for momenta smaller than k. On the other hand, the derivative ∂_t R_k in the numerator is chosen to provide UV regularisation of the trace integral. Despite its simple closed one-loop form, eq:Wetterich can be proved to be exactly equivalent to the standard functional-integral definition of Γ in presence of a mass-like deformation R_k in the bare action. This exactness, combined with systematic approximation schemes like the derivative expansion or the vertex expansion, turns eq:Wetterich into a useful nonperturbative tool, which has been extensively applied to a wide selection of problems in quantum, statistical, or many body physics. For more details we direct the interested reader to the rich secondary literature <cit.>. For the application of the FRG equation, we project the exact equation (<ref>) onto the ansatz derived in the previous section, specifically eq:QMAction with the field redefinition that leads to the standard-model-like Yukawa interactions of eq:Yukawaaction. This can be understood as a leading order of the derivative expansion for the quantum effective action. Additionally we allow for a scale-dependent kinetic term of the fields by introducing a wave-function-renormalization factor for each field. The gauge coupling, the scalar potential U, the Yukawa couplings, and the wave function renormalizations for the various fields Z_i are all scale dependent; we suppress the index k often used to denote scale-dependent quantities for notational clarity. Using this truncation in the Wetterich equation and projecting onto the respective operators yields the β functions for their couplings. We account for the running of the wave-function renormalizations through the so-called anomalous dimensions of the respective fields, η_i = -∂_t log Z_i . Furthermore it is useful to introduce dimensionless, renormalized quantities as ρ=Z_ϕ k^2-dϕ^†ϕ, ρ̃=Z_ϕ̃k^2-dϕ̃ ^†ϕ̃, =Z_ϕ^-1Z_L^t^-1 Z_R^t^-1, =Z_ϕ^-1Z_L^b^-1Z_R^b^-1, h^2=Z_ϕ̃^-1Z_L^t^-1/2Z_L^b^-1/2 Z_R^t^-1/2Z_R^t^-1/2h̅^2 . For concrete computations, we work in d=4 later on. We also employ the Landau gauge, where the gauge parameter is set to zero. This gauge choice is know to be a fixed point of the RG flow of the gauge-fixing parameter <cit.>. Using standard calculation techniques <cit.>, we extract the flow equations and obtain for the scalar potential ∂_t u = -d u + (d-2+η_ϕ)ρ u_ρ+(d-2+η_ϕ̃)ρ̃u_ρ̃ +v_d{3 d0μ^2_Gη_ϕ+d0μ^2_Hη_ϕ v_d{+3d0μ^2_mη_ϕ̃+d 0μ^2_m,rη_ϕ̃} -2 d_γ v_d {d0μ^2_tη_t+d0μ^2_bη_b} , where subscripts in u denote derivatives with respect to the corresponding variable. The various threshold functions l_0^d, l^(F)d_0 etc. responsible for the decoupling of massive modes can be found in the appendix <ref> for the special choice of the linear regulator <cit.>. In eq:potentialFlow, d_γ is the dimension of the spinor representations of the fermions, and v_d^-1=2^d+1π^d/2Γ(d/2). We have also introduce the abbreviations μ_t^2 =^2/2ρ+h^2/2ρ̃, μ_b^2 =^2/2ρ+h^2/2ρ̃, μ^2_G =u_ρ, μ^2_H =u_ρ+2ρ u_ρ,ρ, μ^2_m =u_ρ̃, μ^2_m,r =u_ρ̃+2ρ̃u_ρ̃,ρ̃. We simplify the task of following the RG evolution of the full effective potential by means of a quartic polynomial truncation, adopting the parametrizations of eq:myScalarPotential and eq:potentialbroken in the SYM and in the standard-model-like SSB regimes respectively. A more general functional analysis of the scalar potential would be able to fully describe all possible SSB regimes <cit.>. The remaining flow equations of the model can be found in the App. <ref>. §.§ Partial Bosonization For our scale-dependent analysis, the Hubbard-Stratonovich transformation (<ref>) which translates our four-fermion interaction into a Yukawa interaction between quarks and mesons needs to be treated dynamically: If we translated the full four-fermion interaction into the scalar sector at a fixed matching scale k_m, gluonic fluctuations would generate a nonzero four-fermion coupling again at scales k<k_m. To fully account for these radiatively generated interactions, we apply the bosonization prescription continuously, i.e. at every scale k. To this end we promote the scalar field to be scale dependent, reabsorbing the four-fermion interaction into the scalar sector for all k. This yields additional contributions to the flow equation of the effective average action <cit.> D_tΓ_k[φ_k]=∂_tΓ_k[φ_k]\|_φ_k-∫_xδΓ_k[φ_k]/δφ_k∂_tφ_k, The first term on the right-hand side accounts for the RG flow of the model of eq:QCDAction, without dynamical re-bosonization. The second term takes the new scale dependence of the fields into account and ensures a vanishing fermionic self-interaction on all scales. In order to keep the concrete computations simple, we use the approximative scheme of <cit.>. See refs. <cit.> for an introduction to this method. We choose the following ansatz for the scale dependence of the scalar field ∂_tφ^ab_k(q) =-i(ψ̅^bP_Lψ^a)(q) ∂_t α_k(q) +φ^ab∂_t β_k(q), ∂_tφ^∗ ab(q) =-i(ψ̅^aP_Rψ^b)(-q)∂_tα_k(q)+φ^∗ ab∂_tβ_k(q), with α_k(q) and β_k(q) being functions to be chosen such that our four fermion coupling stays zero for the full flow <cit.>. The scale dependence of the meson scalar fields, descending from eq:HSfieldflow, entails a corresponding scale dependence of the Higgs (left-charged) and dual-Higgs (right-charged) scalar doublets, which can be straightforwardly computed from the linear field transformation (<ref>). The scale dependence of the scalar field, together with the second term in eq:modifiedflow, yields additional contributions to the flow equations, specifically to the flow of the Yukawa coupling h and the scalar potential u. Recall that our parametrization of the Yukawa couplings shown in eq:Yukawaaction assumes a simple linear superposition of the meson-like and fundamental Higgs-like couplings, see eq:linearh. Correspondingly, we capture the effects of the scale-dependent partial bosonization solely in the meson-like Yukawa coupling h. This is of course a simple modeling of a more intricate structure of higher-dimensional operators mixing the quarks, the Higgs and the mesons. In the symmetric regime, the additional contribution to the (dimensionless) mass parameter in the scalar potential is conveniently expressed in terms of the ratio =m^2/k^2h^2, and given by <cit.> ∂_t \|_d.b. = 2/h^2(1+)(1+(1+)Q_σ)(β_λ_σ^g^4g^4 +β^g^2h^2_λ_σg^2h^2), where #\|_d.b. denotes the additional contibutions stemming from dynamical bosonization (the second term in (<ref>)), while the Yukawa contribution reads ∂_t h^2\|_d.b.=2(1+2+Q_σ(1+)^2)(β_λ_σ^ g^4g^4+β^g^2h^2_λ_σg^2h^2). In the broken regime, we similarly find ∂_t κ\|_d.b. = 2κ/h^2(1-κλ_1)(1+(1-κλ_1)Q_σ) ×(β_λ_σ^g^4g^4+β^ g^2h^2_λ_σg^2h^2) as the additional contribution to the running of the (dimensionless) minimum of the potential, and ∂_t h^2\|_d.b. = 2(1-2κλ_1 + Q_σ (1-κλ_1)^2)(β_λ_σ^g^4g^4+β^g^2h^2_λ_σg^2h^2) for the Yukawa coupling in the SSB regime. Here we have used β_λ_σ^g^4 =-1/49^2-24/v_dd1200η_ψη_F, β^g^2h^2_λ_σ =48/v_d11100η_ψη_ϕ, for brevity. The quantity Q_σ = ∂_t(λ̅_σ (k^2)-λ̅_σ (0))/∂_tλ̅_σ (0) measures the suppression of the four-fermion coupling λ̅_σ for large external momenta and is, in principle, straightforwardly computable. A suppression implies Q_σ < 0. In the SSB regime, where fermions are massive, non-pointlike four-fermion interactions are suppressed by the inverse fermion mass squared coming from the two internal propagators <cit.>. Therefore we choose the ansatz Q_σ=Q_σ^0 /2( d12μ^2_t0η^t+d12μ^2_b0η^b) which has the right decoupling properties but introduces a free parameter Q_σ^0. Tests for various different values of Q_σ^0 ∈ [-0.5,0] show that results are qualitatively independent of the precise choice of this parameter <cit.>. §.§ Evaluation of the RG flows As a check of the reliability of our aproximations, we compare the so-called local potential approximation (LPA), where all anomalous dimensions of the fields are neglected, to the generalization including the running wave function renormalizations of the fields (sometimes called LPA^'). This check confirms the stability of our main results, that we present in the next section. Furthermore and as mentioned above, our reduction of the standard model comes with some artifacts such as unphysical massless modes. As argued above, the massless gluons do not affect the chiral transitions and can therefore safely be ignored. By contrast, the massless would-be Goldstone bosons of the Higgs field in the SSB regime would induce an unphysical logarithmic flow. We cure this artifact by introducing masses in the SSB regime for these modes in order to model the Brout-Englert-Higgs (BEH) mechanism in the full model following the prescription of <cit.>. As studied in more detail in Ref. <cit.> and substantiated for the present work in App. <ref>, this procedure has little to no influence on the IR values of interest in this study. Finally, we comment on a subtlety related to the different parametrizations of the scalar potential elucidated in Sect. <ref>. The parametrization eq:myScalarPotential of the potential differs from that of eq:QMScalarPotential, as the invariant τ cannot be expressed in terms of ρ and ρ̃. This leads to a slightly different scalar mass spectrum in the two cases. Because of the different spectrum, the RG flow equation for the coupling λ_2 in the potential differs from the one found in the quark meson model (see for instance refs. <cit.>). For simplicity, we adopt the beta function of λ_2 stemming from the quark-meson model and the potential parametrization (<ref>), with the correct thresholds corresponding to the scalar mass spectrum arising from eq:myScalarPotential. The consistency of this approach is confirmed by the stability of the results shown below. In fact, implementing the RG equation coming directly from the form of eq:myScalarPotential would just change the IR value of the λ_2 coupling by a small amount, affecting only the masses of the SU(2)_R doublet. By contrast, the effects we are interested in do not depend on λ_2. § NATURE OF THE CHIRAL TRANSITION Let us now investigate the nature of the chiral transitions within our parametrization of the essential standard model sectors. More specifically, we are interested in studying the transitions as a function of the microscopic (bare) parameters. From an RG perspective, the most RG-relevant parameter that gives access to both sides of the transition can serve as a control parameter to explore the near critical regime. Let us start from the limiting case, where we consider only the Higgs-top-bottom Yukawa sector. This sector exhibits a behavior reminiscent to a second-order chiral quantum phase transition with the mass parameter of the Higgs potential serving as a control parameter <cit.>. In the language of critical phenomena <cit.>, the chiral order parameter corresponding to the Higgs expectation value scales in the ordered (broken) phase near criticality according to a power law ⟨ϕ⟩∝t^β, where β denotes a critical exponent, and t corresponds to the reduced temperature in a thermodynamic setting, (for quantum phase transitions, the corresponding control parameter is often called δ). In the present model, the control parameter can be identified as t= -_∗≡δ_Λ, where _∗ denotes the critical value of the dimensionless mass parameter of the Higgs potential at the UV cutoff Λ separating the different phases. The precise value depends on all other bare couplings as well as on the RG scheme, but the deviation δ_Λ is a suitable choice as an analogue for the reduced temperature. By means of so-called scaling and hyperscaling relations <cit.>, the critical exponent β can be related to two other thermodynamic exponents used to describe the power law behaviour of the correlation length, as well as the anomalous dimension exponent η β=ν/2(d-2+η). Here η corresponds to the anomalous dimension coming from the wave function renormalization evaluated at the critical point. Thus, it describes the long-range behavior of the correlation function (⟨ϕ(0)ϕ(r)⟩∝ r^-d+2-η) when the correlation length diverges. In addition, we encounter the correlation length exponent ν. Using the RG approach to the theory of critical phenomena, we can relate this critical exponent ν to the RG scaling exponent Θ of the most relevant perturbation at the critical point by ν=1/Θ. At small interactions, i.e., near the Gaussian fixed point, the mass parameter of the Higgs potential is the most relevant perturbation, with its dimensionless version ϵ scaling as ϵ∼ k^-2 =: k^-Θ, cf. eq:defe, such that Θ=2 characterizes the non-interacting limit. Hence, Θ denotes the power-counting dimension of the scalar mass parameter, and reflects its quadratic running tied to the naturalness problem: in presence of a high energy scale such as a UV cutoff Λ and assuming all bare parameters to be of order 1 at this scale, physical dimensionful long-range observables, like the vacuum expectation value of the scalar field (the Fermi scale), are expected to be of the same order of magnitude of Λ. Much smaller values are possible only at the expense of an exceptional amount of fine-tuning of the bare parameters at the scale Λ such that bare parameters and contributions from quantum fluctuations cancel to a high degree. In the vicinity of the Gaussian fixed point, perturbation theory predicts corrections to the canonical scaling yielding Θ = 2-η, which – upon expansion – leads to at most logarithmic corrections to canonical scaling in accordance with Weinberg's theorem. Upon insertion of eq:Theta into eq:betaExponent, we find β=1/2(1+η+1/2η^2+𝒪(η^3)). for the scaling of the order parameter. Let us illustrate this using the quantum phase transition of the reduced Higgs-top-bottom model. For otherwise fixed couplings, the vacuum expectation value of the Higgs field in this ungauged model is shown in Fig. <ref> as a function of the control parameter δϵ_Λ. For positive values of the control parameter, the model is in the symmetric phase v=0. For negative values, the order parameter v increases rapidly according to the scaling law (<ref>). Since the model is comparatively weakly coupled, we expect the critical exponents to be close to their mean-field values β≃ 1/2 and η≃ 0. (More precisely, the top-Yukawa coupling as the largest coupling introduces sizable quantum corrections such that η≃ 0.07, see below.) Correspondingly, the model needs to be fine-tuned severely in order to achieve a large scale separation. For instance for Fig. <ref>, we have initiated the flow at Λ=10^8 GeV . In order to obtain a vacuum expectation value at the Fermi scale v≃246 GeV, we have to tune the control parameter to about δϵ_Λ≃ -1× 10^-12 in units of the cutoff Λ. A “natural choice” of δϵ_Λ∼ - 𝒪(1) would have lead to a much larger order parameter and thus to unphysically large quark and Higgs masses near the cutoff scale. The required amount of fine tuning is governed by the critical exponent Θ≃2. Therefore, the naturalness problem could be reduced, if Θ received large corrections to power-law scaling through a finite η. The above reasoning is typically also applied to the full standard model. This, however, relies on some assumptions, which might not be realized in nature. A first assumption is that the massless Gaussian fixed point be the relevant fixed point for the understanding of the properties of the system on all relevant scales. In presence of other fixed points with different properties, the sensitivity of the mass spectrum on bare parameters might be completely different. The second assumption is that – even at the Gaussian fixed point – the relevant operator related to a scalar bare mass parameter be the only/most significant deformation determining the mass spectrum of particles and in particular the physical value of the Higgs and W/Z bosons masses. In presence of more than one scale-breaking relevant deformation, this might not be the case. In particular, in asymptotically free non-Abelian gauge theories there is always one marginally-relevant deformation for each gauge coupling, with associated power-counting critical exponent Θ=0. The interplay of the chiral transition driving mechanisms and the understanding of the naturalness problem in presence of such couplings is however much less advanced, and at the heart of our following studies. Upon inclusion of a QCD sector, the nature of the transition changes qualitatively rather independently of the initial conditions: as QCD is always in the chirally broken phase, the symmetric phase of the model disappears completely as does the critical point. The second-order quantum phase transition of the ungauged model is washed out and becomes a smooth crossover. Nevertheless, if the QCD scale is much smaller than the Fermi scale, we expect the comparatively sharp increase of the Yukawa model to remain a prominent feature of v as a function of δ_Λ. If this is the case, we refer to the large-v regime to the left of this sharp increase as the Higgs regime in contradistinction to the QCD regime to the right of the rapid transition where v is much smaller. If this is the case, we can still try to quantify this increase by a power-law scaling similar to eq:orderparameterscaling with a corresponding pseudo-critical exponent β. More precisely, we extract the pseudo-critical exponent of the chiral transition by fitting the vacuum expectation value in the Higgs regime to the power law ansatz (Eq. (<ref>)). This procedure is illustrated in Fig. <ref>, where the chiral order parameter v (in arbitrary units) is plotted doubly-logarithmically as a function of the control parameter for different initializations of the gauge sector; here, Δ g_Λ measures the deviation of the initial conditions for the gauge coupling from the physical point). Each case displays a clear power-law for the order-parameter scaling that can be fitted by eq:orderparameterscaling. In this way, we get an estimate for the pseudo-critical exponent β, even though the transition is actually a crossover. Using Eq. (<ref>), we can re-express this exponent through η. Upon insertion of η into eq:Theta, we obtain a correction to scaling and can thus quantify the impact of the gauge sector on the amount of fine-tuning necessary to separate the Fermi scale from the UV scale Λ. If η is positive and sufficiently large, the naturalness problem of the model could be alleviated. Let us finally point out two aspects that are not fully accounted for here: first, the SU(2)_L gauge group is ignored here but participates also as a potential source for chiral symmetry breaking in its strong-coupling regime. In the Higgs regime, this source is always screened by the finite gauge-boson masses. In the QCD regime, it is potentially active. However, since the QCD sector is much more strongly coupled, it dominates the chiral observables quantitatively. We expect our results to remain essentially unaffected, as long as we preserve the hierarchy of the two non-Abelian gauge sectors of the standard model. Second, the picture of universality developed for the Higgs-top-bottom model is not exact since the model does presumably not feature a UV-complete limit. We therefore have to work with a finite UV cutoff Λ, implying that slight violations of universality can occur, but are generically suppressed by powers of 1/Λ. We find that Λ=10^8 GeV is sufficient for our purposes. We have tested for violations of universality by varying the initital conditions of the marginal couplings on the 𝒪(1) level. The residual non-universal effects in the QCD regime remain below the permille level, see App. <ref>. §.§ The QCD regime In the QCD regime, one expects the induced vacuum expecation value in the IR to be of the order of the scale of strong interactions Λ_QCD. In this work, we use a simple but useful definition of this scale by identifying it with the location of the IR Landau pole of the strong gauge coupling obtained from the one-loop beta function. In the deep QCD regime, the phase transition is triggered by the gauge sector (more specifically via a strongly increasing four-fermion coupling in the effective action eq:QCDAction before performing the partial bosonization), in contrast to quark and Higgs fluctuations in the deep Higgs regime. This corresponds to a choice of initial values where the scalar mass m^2>0 is of the order of the UV scale Λ, making the scalar field non-dynamical and thus reducing our model to a low-energy effective theory of the strong interactions. In other words, a limiting case of our reduced standard model is the pure quark meson model <cit.>, however with =6 quark flavors. The vacuum expectation value induced in the deep QCD regime depends solely on the value of the gauge coupling at the initialization scale g_Λ. Since there is no remnant of the electroweak Higgs mechanism in this regime, all quarks have zero current quark mass. As it should be, the other marginal parameters of the model (scalar self-interactions and Yukawa couplings) have hardly any influence on the resulting vacuum expectation value. More precisely, their influence arises only because of the fact that we work with a finite UV cutoff Λ; this introduces violations of universality which vanish exactly in the limit Λ→∞. For completeness, we quantify these universality violations in App. <ref> for our practical choice Λ=10^8 GeV and find them to be on the sub-permille level for the quantities of interest. This feature is expected since the gauge coupling g is the only parameter present in fundamental massless QCD. Through the scale anomaly encoded in the RG running manifesting in dimensional transmutation, it is linked to the dimensionful quantity Λ_QCD setting the scale for all long-range observables such as the vacuum expectation value v. The chiral condensate v and Λ_QCD are intimately connected; using our simple definition of Λ_QCD mentioned above, we list some quantitative results for varying initial values of the gauge coupling g_Λ in Tab. <ref>. We see that while v and Λ_QCD vary a lot under shifts in g_Λ, the ratio of the two quantities stays approximately constant over ranges of the bare strong gauge coupling considered in this work. We consider the choice g_Λ=0.719 as the physical initial condition at Λ=10^8 GeV, since it corresponds to the experimentally measured value of α_s(m_Z)=g^2(m_Z)/4π≃ 0.117 at the Z boson mass scale. This yields Λ_QCD≃ 33 MeV and v≃ 2.1 MeV for the IR QCD scales. Naively, this appears to be rather small compared to the physical values, e.g. v=f_π≃ 93 MeV. This, however, is a consequence of the fact that our IR flow proceeds with =6 massless quarks down to the scale of symmetry breaking. Since the quarks induce screening, the gauge coupling grows strong at lower scales compared to the standard model case that includes the decoupling of the “heavy” quarks as a consequence of the Higgs mechanism. Notice that the value of the chiral condensate v is consistently smaller than the scale obtained by the one-loop calculation. Both vary exponentially as a function of g_Λ. The results show that the ratio between the QCD scale and the would-be-Fermi scale v, far from being a free parameter, actually features a maximum value of 𝒪(10). Furthermore we observe that the ratio of the two scales varies rather slowly over a wide range of initial conditions g_Λ. §.§ Pseudo-critical exponent Let us now analyze the interplay between the chiral transitions in the full model. For this, we first choose initial values for the marginal couplings at the initialization scale Λ, and then vary the relevant parameter of the scalar potential, i.e. the control parameter δ_Λ. Integrating the flow equations yields the vacuum expectation value v as a function of δ_Λ similar to the chiral Higgs-top-bottom model, c.f. Fig. <ref>. As expected, the second order phase transition of the latter becomes a crossover for any finite value of the initial gauge coupling g_Λ, meaning that the discontinuity at δ_Λ=0 is smoothed in a neighbourhood of the would-be-critical point. The size of this critical region grows for increasing g_Λ, as illustrated in Fig. <ref>. Still, we generically observe a rather sharp transition between a Higgs-like and a QCD-like regime. In this regime, we identify the physical point for the Fermi scale where v=246 GeV. The required choice for the control parameter δ_Λ lies typically at small negative values; we call the deviation from this value δ_Λ^phys. Near the physical point, i.e. for \|δ_Λ^phys\|≪ 1, we fit the results for the vacuum expectation value to the scaling hypothesis coming from the theory of second order phase transitions, that is eq:orderparameterscaling. Example results of such fits have been shown in Fig. <ref>. Deviations from canonical power-counting scaling occurs as departures of the pseudo-critical exponent β from the value β=1/2, which we measure in terms of the pseudo-critical correction-to-scaling exponent η according to eq:betaToeta. As discussed above, finite positive values of η are a direct quantitative measure of how the interplay of the chiral transitions in the standard model alleviates the naturalness problem. Let us investigate how this quantity depends on the microscopic parameters of the Lagrangian at the scale Λ. In general, changing a microscopic parameter changes the physical quantities of the theory. For instance, changing the top-Yukawa coupling in the Higgs regime corresponds to changing the top mass relative to the vacuum expectation value. However, this direct influence on the long-range observables becomes less pronounced – and even vanishes ultimately – in the deep QCD regime where the full model is dominated by the gauge sector. Since the physical point is near the transition from the Higgs to the QCD regime, the precise dependence of the pseudo-critical exponent on the microscopic couplings is a priori unclear. The computational procedure is the same for all parameters of interest: we keep all couplings fixed at the initialization scale Λ while varying the control parameter δ_Λ^phys to extract the behavior of the phase transition and to measure η for a given set of parameters. We repeat this for different values of the coupling of interest at Λ, while keeping all other values fixed. Results are shown in Fig. <ref> for all couplings in the model except for the gauge coupling. We find that the pseudo-critical exponent η remains basically unaffected by the initial value of the Yukawa and scalar couplings in the explored regime. The data in Fig. <ref> shows only some glitches on top of a constant value which reflect the numerical precision. The fine-tuning procedure necessary to arrive at v=246 GeV together with the large integration range starting from Λ=10^8 GeV leaves room for an accumulation of numerical errors. For practical reasons, we have restricted the scalar couplings to relatively small values, since stronger scalar self-interactions would require the flow to already start in the broken regime. This choice is also justified by the observation that the Higgs quartic coupling in the full standard model appears to be nearly vanishing at the Planck scale. By contrast, varying the initial value of the gauge coupling has a strong influence on the transition from the Higgs to the QCD regime. This is visible in Fig. <ref>, where the slope of the order parameter field v as a function of the control parameter flattens for increasing values of the gauge coupling; the latter is expressed in terms of the deviation Δ g_Λ of the initial condition from the physical point. This has a direct impact on the naturalness problem: the flatter the curve is when it crosses the physical point, the less fine-tuning is needed to put the system in the vicinity of the Fermi scale. We emphasize that the physical point Δ g_Λ=0 already exhibits a flatter curve than the pure Higgs-top-bottom model with canonical power-counting. This demonstrates that the QCD sector in the standard model already alleviates the naturalness problem compared to a pure Higgs-Yukawa model which is often used to illustrate the naturalness problem. Quantifying these results analogously to the previous analysis, we again extract the pseudo-critical exponent η for these transitions. The interplay of the chiral transitions and the alleviation of the naturalness problem is visible from the monotonic increase of η as a function of g_Λ. In Fig. <ref>, we plot the corresponding critical exponent against the dimensionless ratio Λ_QCD/Λ_F; here, we have translated g_Λ into Λ_QCD, denoting the QCD scale coming from dimensional transmutation, Λ_F denotes the Fermi scale which is set to 246 GeV for this work. Deep inside the Higgs regime, i.e. for Λ_QCD/Λ_F→ 0, we observe that the pseudo-critical exponent approaches a constant value η≃0.07. This is the value of the pure Higgs-top-bottom model arising from the fluctuations in the Yukawa sector. Surprisingly, already in the limit of negligible QCD corrections, the critical exponent differs from the pure Gaussian value. This is an effect of having fixed the IR observables, such as the Fermi scale v and the top mass m_t^2, a requirement that forces the theory off the Gaussian fixed point. A more explicit argument supporting this interpretation is presented in the next section. For an increasing scale ratio Λ_QCD/Λ_F also η increases, exemplifying a stronger interplay of the chiral transitions. At the physical point which in our definition is characterized by Λ_QCD=33 MeV, we observe that the pseudo-critical exponent takes the value η=0.16. We take this as a manifestation that the QCD sector exerts a non-negligible influence on the chiral transition. Quantitatively, the naturalness problem of the standard model is mildly alleviated by this interplay, even though the reduction of the power-law scaling from the canonical value Θ=2 to Θ≃ 1.84 remains on the 10% level and thus does not make a qualitative difference. A “solution” of the naturalness problem would require a pseudo-critical exponent η∼𝒪(1). For values of Λ_QCD larger than the physical point, we observe the onset of a strong increase of η near Λ_QCD/Λ_F≃ 10^-2. Physically this implies that an increasing part of the chiral order parameter is generated by the QCD sector. Correspondingly, the separation of v from the cutoff scale Λ requires less and less fine-tuning of the bare parameters in the Higgs sector, but is taken care of by chiral symmetry breaking of QCD. The scale of the latter depends only logarithmically on the high scale and a large scale separation thus becomes natural. However recall that the ratio Λ_QCD/Λ_F cannot attain arbitrarily large values, as we argued in the previous section. Furthermore, the simplistic description of Fig. <ref> of chiral-symmetry breaking in terms of a pseudo-critical exponent η breaks down well below that upper bound. This is because the behavior of v across the transition between the symmetric and the SSB regime ceases to be comparable to the power-law ansatz of eq:orderparameterscaling for too large g_Λ; in Fig. <ref> this is indicated by the shaded region. §.§ Scaling behaviour near the QCD-dominated regime As observed in the preceding section, the pseudo-critical exponent exhibits a strong increase beyond Λ_QCD/Λ_F≳ 10^-2. We argue in the following that this can be understood within a simple approximation of the flow equations. Approaching the QCD regime from the side of the Higgs regime, the RG flow transition between the symmetric and SSB regimes starts to occur closer and closer to Λ_QCD. Near the latter, the running of the Yukawa coupling, as well as the scalar self interaction, becomes governed by the flow of the strong gauge coupling g^2. This can be seen by looking at the β functions of these couplings in a specific limit: Right above the scales before the RG flow enters the SSB regime, the dimensionless mass parameter , and thus the scalar masses, are negligible; by contrast, the meson Yukawa coupling h^2 near the QCD regime is much larger than the top and bottom Yukawa couplings, which therefore can be set to zero for the present analysis. Looking at the flow equations in this limit reveals that there are quasi fixed points in the composite couplings h^2/g^2 and λ_1/h^2, implying that the evolution of h^2 and λ_1 are directly connected to the flow of g^2. This kind of partial fixed point behavior is well know both as a feature of IR flows, in which case it is called a Pendelton-Ross kind of fixed point <cit.>, as well as a UV signature of total asymptotic freedom or safety, in which case it has been referred to with a variety of names: eigenvalue condition <cit.>, reduction of couplings <cit.>, nullcline <cit.>, fixed flow <cit.> or quasi fixed point <cit.>. In the present model, the quasi fixed point as a solution of the RG equations has been first described by Cheng, Eichten and Li (CEL) <cit.>, and we therefore call it a CEL solution. In this specific limit and considering for simplicity the one-loop approximation for all beta functions of interest here, we have ∂_t g^2 = -7/8π^2g^4, ∂_t h^2 =h^2/16π^2(19/2h^2-16g^2-12g^4/h^2), ∂_t λ_1 = λ_1/4π^2(3h^2+4λ_1-3/2h^4/λ_1). Note that the last terms of the flow of h and λ_1 arise from dynamical bosonization. In eq:oneloopapprox, we have already set d=4, =2 in the Higgs-top-bottom sector beta functions, =6 for the gauge coupling, and =3. It is useful to introduce rescaled couplings ĥ=h/g, as well as λ̂_1=λ_1/h^2. Their flow equations read ∂_tĥ^2 = 1/32π^2g^2(19 ĥ^4-4ĥ^2-24), ∂_tλ̂_1 = 1/32π^2g^2/ĥ^2[24 λ̂_1+32ĥ^2λ̂_1 +ĥ^4(32λ̂ _1^2+5λ̂_1-12)], each of which exhibit a fixed point. These fixed points imply that we have h^2 ∼ g^2 and λ_1∼ h^2 ∼ g^2 within the validity regime of these one-loop equations. Correspondingly, the scalar anomalous dimension takes the form η_ϕ = 3/8π^2h^2. As a consequence, in an intermediate interval of values of g_Λ, where the latter grows but the system is not yet fully dominated by QCD fluctuations, the scalar anomalous dimension scales as g^2 close to the transition. This can be seen in Figure <ref>, where the flattening of the three upper trajectories near t=0 (the RG time at which the flows enter into the SSB regime) signals an effective scaling η_ϕ∼ g^2. When this happens, the quasi-fixed point value of the field anomalous dimension at the transition in turn becomes a good approximation of the pseudo-critical exponent, as we now argue. This phenomenon can be qualitatively understood as a manifestation of the fact that a strongly growing scalar anomalous dimension has has a sizable impact on the running of the (dimensionless) mass parameter of the scalar potential: ∂_t = -(2-η_ϕ)-5/8π^2λ_1+3/8π^2h^2. An increasing and large value of η_ϕ modifies the canonical quadratic running of ϵ substantially and eventually removes the fine-tuning problem, as is expected in a QCD-dominated model. At the transition from the unbroken to the broken phase, the scalar anomalous dimension can therefore be expected to be related to the critical exponent η. This is highlighted and quantitatively confirmed by a comparison of the value of the scalar anomalous dimension η_ϕ (computed within the full set of flow equations) at the SYM-SSB transition scale, and the pseudo-critical exponent η obtained from the power law behavior of the vacuum expectation value v close to the critical point (c.f. Eq. (<ref>)), which is shown in Fig. <ref>. Starting from the deep Higgs regime for very low ratio Λ_QCD/Λ_F, one can see in this figure that the anomalus dimension at the transition scale is positive η_ϕ>0 already in the pure Higgs-top-bottom model, since a nonvanishing top Yukawa coupling is required by the IR conditions imposed on the RG trajectories. In this limit, we observe that η is bigger than η_ϕ at the transition by about an order of magnitude. We attribute this to a built-up of fluctuations at the onset of the SSB regime from the transition scale to the freeze out scale. This is a nontrivial result stemming from the threshold and strong coupling effects along the RG flows. On the other hand, moving towards the intermediate region, both quantities exhibit a strong increase and approach each other towards values of η∼𝒪(1) near Λ_QCD/Λ_F≃ 10^-1; the latter correspond to g_Λ values that trigger the onset of the quasi-fixed-point behavior at the transition. As a final remark on this intermediate scaling behavior, let us mention another line of reasoning that can be used to qualitatively expect and understand the results presented above. Since the region between the deep Higgs and the deep QCD regimes corresponds to intermediate values of the mass parameter δϵ, it can be expected to include an almost-critical point of minimal breaking of scale invariance. The latter is in fact explicitely and severly broken in the two opposite extrema of a deep Mexican-hat standard-model-like Higgs potential (δϵ≪-1) and of a very massive quasi-decoupled QCD-like meson (δϵ≫ 1). Scale invariance is a defining property of RG fixed points. In the present model the only complete fixed point featured by our RG equations is the Gaussian one. The CEL solution in turn describes the UV critical surface of this fixed point in its vicinity, that is, the weak-coupling parameterization of the locus of points corresponding to a minimal breaking of scale invariance. In fact, the relevant, i.e. mass-like, deformation from the fixed point is zero on this surface. Hence, in the weakly coupled perturbative regime, the CEL solution describes a technically natural theory, where the Higgs mass needs no fine tuning and stays small due to the approximate scale symmetry, which is broken only dynamically by QCD through a Coleman-Weinberg mechanism. This expectation must be confronted with the necessity to exit the mere perturbative regime and follow the theory at strong coupling in the IR. The results of this section therefore can be interpreted as a first quantitative test of this perturbative understanding, beyond the weakly coupled regime. Surprisingly, the CEL solution appears to provide a fair first approximation of the location of the “natural” theory in the phase space of the model, even if for Λ=10^8 GeV the latter is close to g_Λ^2=𝒪(1). Let us stress that the precise value of η at the physical point in Fig. <ref> is not only determined by the IR value of measured quantities, but also depends on theoretical assumptions, such as the precise RG flow of the standard model. Shifting the η curve along the Λ_QCD/Λ_F≃ 10^-2 axis is possible by changing the RG evolution, thus effectively changing g_Λ, while keeping the IR parameters fixed. Determining the RG flow is not only a matter of improving the approximations over the nonperturbative domain of the theory, but also and primarily a question of defining the quantum field theory beyond perturbation theory. As a possible embodyment of this fact we can refer to the scenario of Ref. <cit.> where new solutions of the RG equations were constructed by appropriately parametrizing the boundary conditions on the scale-dependent effective action. These generalized solutions and the new parameters that they involve allow to vary the RG flow between the UV scale Λ and the IR, while preserving the observables at the latter scale. §.§ Electroweak Gauge Bosons So far, we have ignored the electroweak gauge sector, as it contributes only subdominantly to the interplay of the chiral transitions. In turn, however, the chiral transition, of course, affects the electroweak gauge sector strongly. This is well known and fully standard in the Higgs regime, where the chiral transition at the same time features the BEH mechanism, rendering part of the electroweak gauge bosons massive. But analogous results also hold in the QCD regime. In other words, the BEH mechanism does not need to be triggered by a carefully designed or even fine-tuned scalar potential, but is also operative if the vacuum expectation value of a composite effective scalar field is generated by other interactions, such as the QCD sector. As an illustration, let us include ingredients of the electroweak gauge sector on an elementary level in order to estimate the mass of the electroweak gauge bosons as a consequence of the chiral transition in the QCD regime. For this, we use the flow equations extracted for the model (c.f. Sect. <ref>), and amend them with the one-loop flow equation obtained for the SU(2) gauge coupling g_EW. ∂_t g_EW= -g_EW^3/(4π)^2(22/3-4/3n_g -1/6). The first term in the parenthesis comes from gauge boson loops, the second one from fermionic loops and the last contribution stems from scalar loops. Since in our analysis we focus on flows which start in the symmetric regime and end up in the broken one, no threshold functions accounting for the masses of the degrees of freedom are necessary for the gauge and fermionic loops in the symmetric regime. The scalar field however is massive in the SYM regime, and in this regime we will account for this effect by introducing the mass threshold corresponding to two internal scalar propagators of the Higgs field for this contribution, -1/6→ -1/61-η_ϕ/6/(1+)^2. This coincides with the standard perturbative contribution in the deep euclidean region ϵ→0. In the following, we ignore the hypercharge sector and thus also the mass splitting of the W and Z bosons. As soon as the flow enters the broken regime, the gauge bosons and fermions obtain masses, leading to a freeze-out of the flow in this regime. As a simple approximation, we use the value of the electroweak gauge coupling at the transition scale as the relevant IR value for an estimate of the W-boson mass. The W mass can then be read off straightforwardly, since it is fully determined by the vacuum expectation value v and the freeze-out value of its gauge coupling g_EW,IR through m_W=1/2g_EW,IRv. The initial conditions for the flow of the electroweak gauge coupling are chosen such that they coincide with the running in the standard model, namely its value at the Z boson mass scale, g_EW^2/4π(M_Z) ≃ 0.034, where M_Z=90.117 GeV. In Fig. <ref>, we depict the resulting mass values for the W boson across the chiral transition region for various initial values of the QCD gauge coupling. In the Higgs regime, we observe the conventional strong dependence of the gauge boson mass on the control parameter which needs to be fine-tuned to obtain the Fermi scale and – as a consequence – the physical value of the W boson mass. For any nonvanishing value of the QCD gauge coupling, the transition is actually a crossover, such that the vacuum expectation value as well as the W boson mass never vanish. In fact, in the deep QCD regime, both dimensionful quantities approach a non-zero value which is dominated by the QCD sector. In this regime, the scale is set purely by the gauge coupling, or (after dimensional transmutation) by Λ_QCD. In order to illustrate this dependence, we plot the resulting plateau value for the W boson mass as a function of the QCD induced chiral condensate v=v_QCD, see Fig. <ref>. We observe an essentially linear dependence. This plateau value can be interpreted as the minimum possible value of the W boson mass for the case that the BEH mechanism is not driven by a scalar Higgs potential but fully by the chiral QCD transition. This minimum W boson mass value has, for instance, been estimated in <cit.>. However, a comparison of different results is inflicted by the fact that it involves not only a comparison of approximations within a theory, but rather a comparison of different theories that arise from fixing quantum field theories differently at different scales. Taking our approach at face value, the scale in the QCD regime is set by fixing the gauge coupling to its physical value at a high scale, before evolving it into the IR. As discussed above, this leads to a rather small value of the chiral condensate v≃ 2.1 MeV in the QCD regime as a consequence of the fact that the QCD sector runs with =6 (screening) massless flavors all the way down to the SSB regime. As a consequence, our straightforward estimate of the minimum W boson mass value is m_W= 0.74 MeV, which is a rather small value compared to other estimates. However, instead of matching our parameters to those of the physical standard model at the high scale, we could also perform a low scale matching: one possible choice (among many others) is to fix the couplings such that the chiral condensate acquires its physical value v=f_π≃ 93 MeV also in the deep QCD regime. As a consequence, our prediction for the W boson mass would be m_W= 33 MeV which is similar to that of <cit.>. § CONCLUSIONS The naturalness puzzles of the standard model, e.g. the gauge or the flavor hierarchy problems or the strong CP problem, are typically addressed within pure model-building arenas. In this sense, a common attitude is the expectation that "solving" these problems amounts to creatively devising new models able to draw a simple straightforward prediction of parameters that would remain otherwise free and mysterious within the standard model. It is fair to say that this goal often remains unattained, unfortunately. Several popular and largely appreciated proposals for beyond-the-standard-model physics, such as for instance technicolor or axions, actually require complex nonperturbative computations to extract quantitative predictions. Even within the standard model itself, it is difficult to quantitatively assess how unnatural the measured value of some key parameter is; in general, this requires quite nontrivial computations which go beyond the weakly-coupled perturbative regime. This problem is intrinsic in the way in which naturalness questions are often posed, that relies on the ability to connect the input values at some microscopic UV scale to the output values extracted from experiments. The larger the gap between these two scales, the harder the computations. In the standard model, the main responsible building block for this difficulty is the QCD subsector: the IR fluctuations of gluons are not tamed by any BEH mechanism, contrary to the electroweak W/Z bosons, and their interactions grow stronger at lower energies. The task of properly defining and quantifying unnaturalness is further aggravated by the ambiguity in the choice of the UV scale at which the microscopic parameters ultimately determining the measured observables are fixed. This second problem is caused by the fact that the standard model – as we understand it – is not a UV complete theory. The main troublemaker in this case is the electroweak sector, and specifically the U(1)_Y gauge coupling. Finally, there is a priori no preferred probability distribution for the microscopic parameters with respect to which naturalness can be quantified; also in this work, we implicitly use a flat distribution as is standard for the discussion of tuning a control parameter to a (quantum) phase transition. In the present work, we have focused on the gauge-hierarchy problem as a prototypical naturalness case study. We have explored the possibility to quantitatively describe this feature of the standard model, by adopting modern techniques inspired by effective field theories and the renormalization group, while pushing them into the nonperturbative territory. In this manner, we have been able to study the interplay of the two main sources of chiral symmetry breaking of the standard model: the electroweak Higgs interactions and the QCD sector. Whereas the breaking scales, i.e., the Fermi and the QCD scale, are several orders of magnitude apart, we observe a qualitative and quantitative interplay: the second-order transition of a pure Higgs-top-bottom sector is turned into a crossover by the presence of the QCD sector, see Fig. <ref>. We suggest to quantitatively characterize the deviation from Gaussianity of the Higgs-mass fine-tuning problem by means of a pseudo-critical exponent η. A result of this study is that the QCD sector alleviates the naturalness problem naively quantified by the quadratic running of the Higgs mass parameter by a pseudo-critical exponent η on the order of ∼10% , see Fig. <ref>. Remarkably, we have observed that η is nonvanishing even in case of negligible QCD corrections. These conclusions have been drawn within the usual understanding of the standard model as an effective theory below a suitable UV cutoff, which in our study was set at Λ∼10^8 GeV, and with bare couplings at this scale fully in the perturbative regime. The only non-standard ingredient we used in our investigation is a non-perturbative improvement of the RG equations to capture threshold effects in the matter sector and the expected strong-coupling regime of the QCD gauge coupling. As a useful ingredient of our analysis, we have managed to describe the fundamental Higgs field and a mesonic composite scalar field on the same footing. This is particularly insightful for the study of deformations of the standard model in which the Fermi and the QCD scale are shifted relative to each other. Specifically, an increase of the QCD scale demonstrates that the standard model can be continuosly connected to a deformed model where all scales are set by the QCD sector and the pseudo-critical exponent renders the connection between microscopic and macroscopic parameters natural. In the latter case, the theory appears to enter into an almost scale invariant regime which lies in a narrow intermediate window between the deep Higgs and the deep QCD regimes. This pseudo-critical region, where mass is expected to be generated by a Coleman-Weinberg mechanism, has been shown to be well approximated by a quasi-fixed point condition of the Cheng-Eichten-Li type <cit.>, despite the fact that for standard-model-like IR observables this happens to require values of the bare gauge coupling g_Λ of order one. This observation motivates interest in applying similar methods to investigate the naturalness problem of extensions of the standard model which are able to render the Coleman-Weinberg scenario compatible with the measured values of IR observables. Among these, of particular interest are UV complete extensions, since in these models the quasi-fixed-point behavior is expected to be continuously connected with the controlled UV asymptotics for increasing values of Λ. Of course, our treatment of the nonperturbative QCD sector is rather rudimental and relies on some model input in the pure gauge sector. Nevertheless, it is capable of connecting the microscopic description in terms of quarks and gluons to a long-range description on terms of a quark-meson model that can be matched quantitatively to chiral perturbation theory. Still, there is, of course, room for substantial improvement required for claiming a full quantitative control of the nonperturbative domain. For instance, in the deep QCD regime we have estimated the radiatively generated mass of the W boson. We expect this estimate to be inflicted by the approximations and assumptions made in this nonperturbative sector. Another subtle issue that we have not investigated in this work, is the possible gauge and parametrization dependence of our results, which we leave for future developments. Nevertheless, we believe that our approach offers a useful framework for addressing the interplay of the chiral transitions in the standard model. As the transitions are considered to root in rather different sectors, such a treatment in a unified framework is valuable and has been missing so far. We are grateful to Axel Maas, Daniel Litim, Roberto Percacci, Simon Schreyer, René Sondenheimer, Jan Pawlowski, Gian Paolo Vacca, and Christof Wetterich for helpful discussions. This work has been funded by the Deutsche Forschungsgemeinschaft (DFG) under Grant Nos. 398579334 (Gi328/9-1) and 406116891 within the Research Training Group RTG 2522/1. This project has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754496. § FLOW EQUATIONS OF THE MODEL The flow equations of the model are derived using the functional renormalization group flow equation for the effective action <ref>. Here all results are expressed in terms of dimensionless quantities, c.f. eq:DimlessQuantities. For the Yukawa couplings we obtain ∂_t h^2= (d-4+η_b+η_t+η_ϕ̃)h^2+v_d h^4{d11μ^2_mη_tη_ϕ̃+d11μ^2_mη_bη_ϕ̃+d11μ^2_m,rη_tη_ϕ̃. .+d11μ^2_m,rη_bη_ϕ̃+d11μ^2_mη_tη_ϕ̃+d11μ^2_mη_bη_ϕ̃+d11μ^2_mη_tη_ϕ̃. .+d11μ^2_mη_bη_ϕ̃+d11μ^2_Gη_tη_ϕ+d11μ^2_Hη_tη_ϕ+d11μ^2_Gη_tη_ϕ. .+d11μ^2_Gη_tη_ϕ+d11μ^2_Gη_bη_ϕ+d11μ^2_Hη_bη_ϕ+d11μ^2_Gη_bη_ϕ. .+d11μ^2_Gη_bη_ϕ}-4(3+ξ)N_c^2-1/2N_cg^2h^2{d110η_tη_F+d110η_bη_F}, ∂_t h_t^2= (d-4+2η_t+η_ϕ)h_t^2 -v_d h_t^4 {d11μ^2_Gη_tη_ϕ. .-d11μ^2_Hη_tη_ϕ} -2v_d h_t^2h_b^2 d11μ^2_Gη_bη_ϕ -4(3+ξ)N_c^2-1/2N_cg^2h_t^2 d110η_tη_F, ∂_t h_b^2= (d-4+2η_b+η_ϕ)h_b^2 -v_d h_b^4{d11μ^2_Gη_bη_ϕ. .-d11μ^2_Hη_bη_ϕ} -2v_d h_b^2h_t^2 d11μ^2_Gη_tη_ϕ -4(3+ξ)N_c^2-1/2N_cg^2h_b^2 d110η_bη_F, where κ denotes the minimum of the scalar potential. Here, we have assumed h̃_t=+h and treat and h separately, accounting for the rebosonization procedure described above. Finally, the anomalous dimensions of the bosonic and fermionic fields read η_ϕ= 2N_cd_γ/dv_d ( ^2[dη_t- ^2/2κdη_t]. . +^2[dη_b- ^2/2κdη_b]) , η_ϕ̃= 2N_cd_γ/dv_d h^2(dη_t+dη_b. .-h^2/2κ(dη_t +dη_b)), η^t_R= 2v_d/d^2{ 2d12μ^2_Gη_bη_ϕ. + .d12μ^2_Gη_tη_ϕ +d12μ^2_Hη_tη_ϕ} + v_d h^2 { 2d12μ^2_mη_bη_ϕ̃. + .d12μ^2_mη_tη_ϕ̃+d12μ^2_m,rη_tη_ϕ̃}, η^b_R= 2v_d/d^2 { 2d12μ^2_Gη_tη_ϕ. + .d12μ^2_Gη_bη_ϕ+d12μ^2_Hη_bη_ϕ} + v_d h^2 { 2d12μ^2_mη_tη_ϕ̃. + .d12μ^2_mη_bη_ϕ̃+d12μ^2_m,rη_bη_ϕ̃}, η^t_L= 2v_d/d^2 ( d12μ^2_Gη_tη_ϕ. + .d12μ^2_Hη_tη_ϕ) + 2v_d ^2 d12μ^2_Gη_bη_ϕ + v_d h^2(d12μ^2_mη_tη_ϕ̃. + .d12μ^2_m,rη_tη_ϕ̃ +2d12μ^2_mη_bη_ϕ̃), η^b_L= 2v_d/d^2 ( d12μ^2_Gη_bη_ϕ. + .d12μ^2_Hη_bη_ϕ) + 2v_d ^2 d12μ^2_Gη_tη_ϕ + v_d h^2(d12μ^2_mη_bη_ϕ̃. + .d12μ^2_m,rη_bη_ϕ̃. + .2d12μ^2_mη_tη_ϕ̃). Here, it is useful to define anomalous dimensions of the top and bottom quark as η^t=1/2(η_L^t+η_R ^t), η^b=1/2(η_L^b+η_R ^b). § SCALAR SPECTRUM In our quartic approximation, the scalar potential for the different regimes are parametrized as U(ρ ,ρ̃) =m^2(ρ+ρ̃)+λ_1/2(ρ+ρ̃)^2+λ_2ρρ̃, SYM U(ρ ,ρ̃) =λ_1/2(ρ+ρ̃ -κ)^2+λ_2ρρ̃, SSB where we have used ρ = ϕ^∗ aϕ^a and ϕ=1/√(2)[ ϕ_1 + iϕ_2; ϕ_4 + iϕ_3 ], ρ̃ =ϕ̃^∗ aϕ̃^a and ϕ̃=1/√(2)[ ϕ̃_1 + iϕ̃_2; ϕ̃_4 + iϕ̃_3 ], and the vacuum configuration of the fields are chosen as ϕ\|_vac= [ 0; √(κ) ], ϕ̃\|_vac= [ 0; 0 ]. In the symmetric regime we have κ=0, wheras in the broken regime κ is non-zero. The mass spectrum of the various components of the two scalar fields (abbreviated by f_i) is given by M^2_f_i=∂^2 U(ρ,ρ̃)/∂f_i^2\|_vac. In the symmetric regime, we find all components of the fields to have the same mass, given by M^2_f_i=m^2. In the broken regime, the components obtain different masses. The components of the ϕ̃ field acquire a mass M^2_ϕ̃_i=λ_2κ. For the ϕ field we find M^2_ϕ_4 =2λ_1κ M^2_ϕ_i =0 for i≠ 4. In comparison to the standard model, these massless Goldstone modes are an artifact of not having included the electroweak gauge sector. The BEH mechanism renders these modes together with the W and Z bosons massive. For our purposes, it suffices to model the BEH mechanism by giving a mass to these modes M^2_ϕ_i=λ_Goldstoneκ fori≠ 4 proportional to the vacuum expectation value. In this way, they are unaffected in the symmetric regime, but decouple in the broken regime. This modeling of the BEH mechanism comes at the expense of a new parameter λ_Goldstone. We study the dependence of the phase transition on this parameter, but find no significant influence on the quantities of interest such as the pseudo-critical exponent, see Fig. <ref>. For the computational purposes, we simply set this parameter to λ_Goldstone=1 in this work. It is instructive to compare the scalar spectrum found here for the parametrization (<ref>) of the potential with that derived from the complete quartic form (<ref>), as discussed in the literature <cit.>. While the spectrum in the symmetric regime is the same for both potentials, exhibiting 8 degrees of freedom with squared mass m^2, the masses in the broken regime differ for the two parametrizations. While we have one radial mode with mass 2λ_1κ for the SSB potentials in both cases, the full quartic form (<ref>) gives rise to four massless Goldstone modes, and three modes with squared mass λ_2κ, whereas there are only three Goldstone modes and four λ_2κ modes for our potential (<ref>). The reason for this difference lies in the fact, that the structure of the additional trace invariant τ of eq:rhotaudef is not properly taken into account by our parametrization in terms of ρ and ρ̃. Comparing the resulting flow equations for the couplings in the scalar potential shows no difference in the mass parameter m^2 and quartic coupling λ_1 beta functions. The difference in the scalar spectrum, however, yields a slightly different flow equation for λ_2 as a consequence. To correct for this different parametrization, we use the beta function for the λ_2 coupling as it follows from the complete quartic parametrization (<ref>). Nevertheless, we have checked that the use of the beta function that would follow from eq:B1 has no significant influence on the results of this work. § COMPARISON TO AN APPROACH WITH SEPARATE SCALAR FIELDS In a previous study <cit.>, we have studied the interplay of the chiral transitions using a description where the mesonic degrees of freedom are not combined with the Higgs field into one collective field, but both the meson and Higgs potential are kept separate and disentangled. Whereas two distinct scalar potentials, V for the mesons and U for the Higgs field, offer the advantage of straightforwardly identifying the degrees of freedom, it is not as easy to indentify the correct vacuum. In the disentangled description, it naively seems possible to have a Higgs potential in the broken regime while the meson potential is still symmetric, or vice versa. This is, however, modified by the fluctiations, since a non-vanishing vacuum expectation value in one of the potentials induces a linear term in the other potential through the Yukawa interactions, shifting the minimum away from vanishing field amplitude also in the other potential. In the study <cit.>, we have for simplicity assumed that the true vacuum state is given by a linear superposition of the two minima. Subsequently, an analysis analogous to the one in this work is performed. Concentrating on the chiral transitions and the pseudo-critical exponent, we find qualitatively similar results, i.e. the fine-tuning problem gets alleviated for growing gauge couplings in the UV, as is shown is Fig. <ref>. For more details and computational subtleties, we refer the reader to <cit.>. § THRESHOLD FUNCTIONS The various quantities l^d_n(·), m^d_n(·), etc., denote threshold functions. These quantities correspond to loop integrals of the functional renormalization group and parametrize the decoupling of massive modes from the flow equations. These quantities are numerically of order 1, their precise form depends on the regulator. Even though the have been frequently discussed in the literature <cit.>, we list the expressions for the threshold functions used in this work explicitly for completeness. We define the regularized kinetic terms in momentum space for bosons and fermions as P(q) =q^2(1+r_k,B(q)), P_F(q) =q^2(1+r_k,F(q))^2 = q^2(1+r_k,L(q))(1+r_k,R(q)), where the last line is used for chiral fermions where regulator shape functions are introduced for the left- and right-handed part, respectively. The general definitions of the threshold functions can be found in the literature <cit.>. For the present work, we use the piecewise linear regulator <cit.> for the bosonic regulator shape function r_B=(k^2/q^2-1)Θ(k^2-q^2), and define the fermionic one implicitly by (1+r_B)=(1+r_L)(1+r_R), r_L=r_R. This regulator allows to compute the threshold functions analytically which is advantageous for the subsequent numerical integration of the flow equations. The explicit form reads dnωη_ϕ= 2(δ_n,0+n)/d1-η_ϕ/d+2/(1+ω)^n+1, dnωη_ψ=2(δ_n,0+n)/d1-η_ψ/d+1/(1+ω)^n+1, dn_1n_2ω_1ω_2η_ψη_ϕ= 2/d1/(1+ω_1)^n_1(1+ω_2)^n_2 [n_1/1+ω_1(1-η_ψ/d+1)+n_2/1+ω_2(1-η_ϕ/d+2)], n_1n_2n_3ω_1ω_2ω_3η_ψη_ϕ_1η_ϕ_2= 2/d1/(1+ω_1)^n_1(1+ω_2)^n_2(1+ω_3)^n_3 [n_1/1+ω_1(1-η_ψ/d+1)+n_2/1+ω_2(1-η_ϕ_1/d+2)+n_3/1+ω_3(1-η_ϕ_2/d+2)], dn_1n_2ω_1ω_2η_ϕ= 1/(1+ω_1)^n_1(1+ω_2)^n_2, dωη_ψ=1/(1+ω)^4, dωη_ψ= 1/(1+ω)^4+1-η_ψ/d-21/(1+ω)^3-(1-η_ψ/2d-4+1/4)1/(1+ω)^2, dn_1n_2ω_1ω_2η_ψη_ϕ= (1-η_ϕ/d+1)1/(1+ω_1)^n_1(1+ω_2)^n_2, d11ω_1ω_2η_ψη_ϕ= 2/d-11/(1+ω_1)(1+ω_2)(1-η_ϕ/d+1/1+ω_2+1-η_ψ/d/1+ω_1-1/2+η_ψ/2d). § CHECK OF UNIVERSALITY VIOLATIONS Since the ungauged limit of our model, the Higgs-top-bottom model, does not exhibit a UV complete limit, we have to define it with an explicit UV cutoff Λ. This introduces a scheme dependence of our results which can be mapped onto a dependence of the choice of the bare couplings. Still, as long as we study flows which spend a sufficiently long “RG time” near the Gaussian weak-coupling fixed point, the dependence of IR observables on the initial conditions (or on the scheme) becomes suppressed by inverse powers of the cutoff scale Λ. In the case that the limit Λ→∞ can be taken, universality violations vanish exactly. In practice, we need find a compromise between a sufficiently large Λ such that universality violations remain quantitatively irrelevant, and a conveniently small Λ in order to keep the numerical effort manageable. The latter is dominated by the need to “solve the fine-tuning problem” in practice simply by fine-tuning the initial control parameter in order to arrive at a Fermi scale vΛ. For our purposes, the choice Λ=10^8 GeV has turned out to represent such a suitable compromise. As an example of these universality violations, we show the influence of the marginal Yukawa and scalar self-interaction couplings on the vacuum expectation value v in the deep QCD regime in Fig. <ref>. Varying the initial conditions of these couplings at 𝒪(1), we observe that the vacuum expectation value v varies merely on the sub-permille level at most. This illustrates the fact that the IR and the scale of all physical of physical observables is set only by the gauge coupling. dimtest

Subsets and Splits

No community queries yet

The top public SQL queries from the community will appear here once available.