Proof of Theorem 4.4, p. 8 — ∂f^(2)/∂A^(n) = T̄_(n)·V^{n} and ∂f̄^(2)/∂A^(n) = ∂f^(3)/∂A^(n) = 0
ProvedTensorBTD.Cogradient.cograd_f2_f3khatri-rao-productp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1tensor-unfoldingwirtinger-derivative
Consider the unstructured CPD with factor matrices , a tensor and a mode . Let
Then, for the cogradients with respect to the entries of ,
- , where is the entrywise conjugate of the mode- unfolding;
- ;
- .
Together with and the decomposition this gives (4.5a).
Formalization Note. The inner product is conjugate on the first argument (Definition 2.1), so is holomorphic in and is antiholomorphic. The mode may be any of the modes.
Preamble
import Mathlib import Definitions.Def_TensorBTD_Cogradient_Setting
Formal statement
namespace TensorBTD.Cogradient
open Matrix
/-- Proof of Theorem 4.4, p. 8: for every mode `n` of the unstructured CPD,
`∂f^(2)/∂A^(n) = T̄_(n) · V^{n}` and `∂ conj(f^(2))/∂A^(n) = ∂f^(3)/∂A^(n) = 0`. -/
theorem cograd_f2_f3 {P Q R : ℕ} {I : Fin P ⊕ Fin Q → ℕ} {L : Fin R → ℕ} (T : TensorBTD.Gramian.Tensor I)
(x : TensorBTD.Gramian.GIdx I L → ℂ) (n : Fin P ⊕ Fin Q) :
cogradMatG (fTwo T n) x n = (unfolding T n).map (starRingEnd ℂ) * V {n} (TensorBTD.Gramian.cpdFactor x) ∧
cogradMatG (fun y => starRingEnd ℂ (fTwo T n y)) x n = 0 ∧
cogradMatG (fun _ : TensorBTD.Gramian.GIdx I L → ℂ => fThree T n) x n = 0 := by sorry
end TensorBTD.Cogradient
Source
Sorber, Van Barel & De Lathauwer, Optimization-Based Algorithms for Tensor Decompositions, SIAM J. Optim. 23(2) (2013), doi:10.1137/120868323, authors' manuscript (Lirias), p. 8, proof of Theorem 4.4, sentence after the first display
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.