Transition Kernel Recovery in Markov Chains

• Transition kernel recovery is a method to estimate the transition matrix of a Markov chain by decomposing the frequency matrix into a low-rank component and a sparse correction.
• It employs a constrained least-squares approach that achieves deterministic error bounds and minimax rate-optimality under arbitrary noise dependencies.
• Alternating minimization algorithms and separation lemmas drive efficient computations and robust theoretical guarantees in structured matrix recovery.

Transition kernel recovery is the problem of estimating the transition probability matrix of a Markov chain from observed data, particularly when the matrix admits a low-rank plus sparse decomposition with inherent incoherence. The recovery is motivated by the need to consistently estimate the structure of Markov kernels—even under arbitrary noise dependence among matrix entries—which is critical in statistical machine learning problems such as structured sequence modeling, multitask regression, covariance estimation, and reinforcement learning. The state-of-the-art theoretical and algorithmic framework proceeds by representing the Markov frequency matrix as the sum of a low-rank incoherent component and a sparse incoherent correction, then recovering both efficiently via a constrained least-squares approach with deterministic optimality guarantees, tight minimax rates, and extension to reinforcement learning conditional mean estimation (Chai et al., 2024).

1. Formal Framework for Structured Transition Kernel Recovery

Consider a discrete-time, time-homogeneous, ergodic, aperiodic Markov chain $(X_0, X_1, ..., X_n)$ over a finite state space of size $p$, with true but unknown transition kernel $P^* \in \mathbb{R}^{p \times p}$, where $P^*_{ij} = \Pr(X_{t+1}=j \mid X_t = i)$, $P^* \mathbf{1}_p = \mathbf{1}_p$, $P^* \geq 0$. The stationary distribution $\pi^*$ satisfies $\pi^* P^* = \pi^*$. The central object is the long-run "frequency matrix" $F^* = \operatorname{diag}(\pi^*) P^*$, which is sufficient for recovering $P^*$ via $p$0.

A structural assumption posits $p$1, where $p$2 is low-rank (rank $p$3) and incoherent, while $p$4 is sparse (at most $p$5 nonzero entries) and incoherent. The model permits arbitrary joint dependence in the observed noise matrix $p$6, which captures deviations between empirical counts $p$7 and $p$8; $p$9.

Essential assumptions for identifiability and estimability include:

• Restricted strong convexity holds trivially for Frobenius loss with identity design.
• The incoherence of $P^* \in \mathbb{R}^{p \times p}$0 as $P^* \in \mathbb{R}^{p \times p}$1, for $P^* \in \mathbb{R}^{p \times p}$2.
• Sparsity $P^* \in \mathbb{R}^{p \times p}$3.
• Markov chain mixing: $P^* \in \mathbb{R}^{p \times p}$4, mixing time $P^* \in \mathbb{R}^{p \times p}$5, and $P^* \in \mathbb{R}^{p \times p}$6.
• No further assumption on $P^* \in \mathbb{R}^{p \times p}$7 beyond arbitrary entrywise dependence (Chai et al., 2024).

2. Incoherent-Constrained Least-Squares Estimator

Transition kernel recovery is formalized as a structured matrix estimation problem via the following optimization: $P^* \in \mathbb{R}^{p \times p}$8 where $P^* \in \mathbb{R}^{p \times p}$9 is the set of $P^*_{ij} = \Pr(X_{t+1}=j \mid X_t = i)$0 semi-orthogonal, $P^*_{ij} = \Pr(X_{t+1}=j \mid X_t = i)$1-incoherent matrices. The regularization parameters $P^*_{ij} = \Pr(X_{t+1}=j \mid X_t = i)$2 (controls incoherence) and $P^*_{ij} = \Pr(X_{t+1}=j \mid X_t = i)$3 (controls sparsity) encode the structural prior.

This estimator is motivated by robustness to arbitrary noise dependence (entrywise) in $P^*_{ij} = \Pr(X_{t+1}=j \mid X_t = i)$4, eschewing typical independence or sub-Gaussian designs. The estimator is tight in both deterministic and minimax senses, with theoretical analysis grounded in a novel separation lemma for low-rank incoherent matrices.

3. Theoretical Guarantees and Rates

Theoretical results establish deterministic error bounds and minimax rate-optimality:

• General Deterministic Bound: For any noise $P^*_{ij} = \Pr(X_{t+1}=j \mid X_t = i)$5, if $P^*_{ij} = \Pr(X_{t+1}=j \mid X_t = i)$6, $P^*_{ij} = \Pr(X_{t+1}=j \mid X_t = i)$7, then

$P^*_{ij} = \Pr(X_{t+1}=j \mid X_t = i)$8

For identity measurement ($P^*_{ij} = \Pr(X_{t+1}=j \mid X_t = i)$9), $P^* \mathbf{1}_p = \mathbf{1}_p$0.

• Stochastic Error under Markov Noise: For $P^* \mathbf{1}_p = \mathbf{1}_p$1, $P^* \mathbf{1}_p = \mathbf{1}_p$2, and mixing time $P^* \mathbf{1}_p = \mathbf{1}_p$3, with probability $P^* \mathbf{1}_p = \mathbf{1}_p$4:
  • $P^* \mathbf{1}_p = \mathbf{1}_p$5
  • $P^* \mathbf{1}_p = \mathbf{1}_p$6,

for absolute constant $P^* \mathbf{1}_p = \mathbf{1}_p$7.

• Main Estimation Error Bounds: Provided $P^* \mathbf{1}_p = \mathbf{1}_p$8, and $P^* \mathbf{1}_p = \mathbf{1}_p$9, with high probability,

$P^* \geq 0$0

and after row-normalizing,

$P^* \geq 0$1

In the setting $P^* \geq 0$2, $P^* \geq 0$3, $P^* \geq 0$4, these specialize to

$P^* \geq 0$5

matching the minimax lower bounds attained by spectral estimators in the standard low-rank setting (Chai et al., 2024).

4. Separation Lemma for Incoherent Low-Rank Matrices

A central structural insight is encoded in the key separation lemma: For any two $P^* \geq 0$6-incoherent rank-$P^* \geq 0$7 matrices $P^* \geq 0$8,

$P^* \geq 0$9

for universal constant $\pi^*$0. This asserts that the difference between two incoherent low-rank matrices cannot be "spiky," i.e., it cannot concentrate too much energy in a few entries. This lemma is instrumental in controlling cross-terms such as $\pi^*$1 in the theoretical analysis, thus enabling restricted strong convexity-type lower bounds. The proof proceeds by reduction to equal singular value and orthonormality cases, bounding factor inner products, and small linear programming over the singular spectrum.

5. Algorithmic Solution: Alternating Minimization

A practical approach to solving the structured recovery problem is an alternating minimization algorithm:

1. Sparse Update:

$\pi^*$2

where $\pi^*$3 applies a hard-threshold retaining only the $\pi^*$4 largest entries.

2. Singular Value Update:

$\pi^*$5

3. Low-Rank Factors Update:

$\pi^*$6

(similarly for $\pi^*$7).

Termination occurs when $\pi^*$8 falls below a specified threshold or after 500 iterations. The per-step computational cost is $\pi^*$9. Empirically, convergence is typically achieved in fewer than 10 rounds in both noiseless and noisy cases, for i.i.d. Gaussian as well as empirical-probability noise (Chai et al., 2024).

6. Extension to Reinforcement Learning Conditional Mean Estimation

The framework admits extension to estimate the conditional mean operator, a key quantity in reinforcement learning. For any random feature vector $\pi^* P^* = \pi^*$0 independent of chain data, $\pi^* P^* = \pi^*$1, the estimator $\pi^* P^* = \pi^*$2 obeys: $\pi^* P^* = \pi^*$3 This $\pi^* P^* = \pi^*$4 rate improves dramatically over the worst-case $\pi^* P^* = \pi^*$5 for fixed $\pi^* P^* = \pi^*$6, underscoring the statistical benefits of random features and structured estimation in this domain.

7. Empirical Performance and Comparative Evaluation

Numerical experiments demonstrate:

• Rapid Convergence: The alternating minimization algorithm converges to zero (noiseless) or noise floor (noisy) error in approximately 5–10 steps.
• Error Scaling: The estimation error $\pi^* P^* = \pi^*$7 decays as $\pi^* P^* = \pi^*$8 and $\pi^* P^* = \pi^*$9, aligned with theoretical predictions.
• Practical Insensitivity to Incoherence Constraint: Empirical results show that imposing the incoherence constraint in every iteration alters performance minimally.
• Comparative Accuracy: Against spectral estimators (e.g., from Zhang–Wang 2019), the constrained method yields substantially improved accuracy when the frequency matrix is low-rank plus sparse (Chai et al., 2024).

A plausible implication is that these improvements are prescriptive for high-dimensional Markov chain estimation tasks where real-world data exhibits both low-rank global structure and sparse, incoherent perturbations.