---
title: Time-Varying Offset Estimation (TVOE)
url: https://www.emergentmind.com/topics/time-varying-offset-estimation-tvoe
type: topic
---

# Time-Varying Offset Estimation (TVOE)

Searching arXiv for recent and relevant papers on Time-Varying Offset Estimation and related temporal calibration/synchronization problems.
Time-Varying Offset Estimation (TVOE) denotes the estimation of an offset parameter that is allowed, or required, to evolve over time rather than remain constant over an observation window. Across the literature, the term appears in several closely related settings: clock synchronization in wireless sensor and mobile networks, online temporal calibration in visual-inertial and radar-inertial odometry, delay tracking between sensor signals, synchronization for multicarrier communication systems, and continuously varying lag estimation between coupled multivariate time series. In all of these formulations, the common technical premise is that a static-offset model is physically mismatched when oscillator imperfections, mobility, transmission delays, rolling-shutter effects, sensor latency, or changing system dynamics induce gradual or irregular temporal drift. Representative formulations include Gauss-Markov random walks for clock parameters [1201.6685], per-frame random-walk time offsets in visual-inertial optimization [1810.05456], frame-wise online offset evolution models in VIO [2403.12504], and state-space tracking of timing and frequency residuals in bistatic ISAC [2507.09215].

## 1. Definitions and recurring formulations

In the most general relative-measurement setting, each node \(u\) has an unknown scalar variable \(x_u \in \mathbb{R}\), and neighboring nodes obtain noisy relative measurements
\[
\zeta_{u,v}(k) = x_u - x_v + \epsilon_{u,v}(k).
\]
When \(x_u\) is interpreted as a clock offset, TVOE becomes a distributed estimation problem over time-varying graphs [1301.2218].

In clock synchronization, the local clock is often modeled as
\[
\tau_u(t) = \alpha_u t + \beta_u,
\]
where \(\alpha_u\) is clock skew and \(\beta_u\) is clock offset [1301.2218]. A related two-way timing formulation rewrites the problem in terms of
\[
\xi \triangleq d+\theta,\qquad \psi \triangleq d-\theta,
\]
with clock offset recovered as
\[
\theta = \frac{\xi-\psi}{2},
\]
and then models \(\xi_k,\psi_k\) as time-varying hidden states [1201.6685].

In camera–IMU temporal calibration, the actual image capture time is modeled as
\[
\tilde{t}_k = t_k + \Delta t_k^o,
\]
where \(\Delta t_k^o\) is an unknown camera–IMU time offset for frame \(k\) [1810.05456]. In high-dynamic-motion VIO, the temporal relation is written as
\[
t_{cam}(k) = t_{imu}(k) + t_d(k),
\]
with the offset evolving according to
\[
t_{d}(k) = t_d(k-1) + t_{bias} + n_{t_d},
\]
to represent cumulative drift and white Gaussian noise [2403.12504].

In radar–IMU fusion, the relative time offset is defined as
\[
t_d = t_{d,IMU} - t_{d,Radar},
\]
and incorporated directly into the EKF state vector [2502.00661]. In bistatic ISAC, timing and carrier-frequency residuals are grouped into a 2D hidden state,
\[
\boldsymbol{x_t} = \left[ \tau_{\rm off}(t)\;\; f_{\rm off}(t) \right],
\]
and tracked frame to frame [2507.09215].

A broader interpretation appears in multivariate time-series analysis, where TVOE denotes a continuously varying lead-lag offset \(\tau(t)\) between series \(x_i(t)\) and \(y_i(t)\), constrained to a finite search window \(\tau\in\{0,1,\dots,S\}\) [2110.15034]. This suggests that TVOE is best regarded as a modeling class rather than a single algorithmic family.

## 2. Dynamic models of offset evolution

A central distinction in TVOE research is whether the offset itself is modeled as dynamic, or whether time variation is induced by other latent parameters such as skew or drift. In Bayesian clock-offset estimation for two-way message exchange, the hidden parameters follow a Gauss-Markov random walk,
\[
\xi_k = \xi_{k-1}+w_k,\qquad \psi_k = \psi_{k-1}+v_k,\qquad
w_k, v_k \sim \mathcal N(0,\sigma^2),
\]
with uniform priors on the initial states [1201.6685]. The same random-walk structure is specialized to exponentially distributed delays in a factor-graph treatment of time-varying clock offset [1202.0022].

Optimization-based visual-inertial odometry models the per-frame camera–IMU offset as a slowly varying latent variable with continuous-time prior
\[
\dot{\Delta t}_k^o = n_o,
\]
which discretizes to
\[
\Delta t_{k+1}^o = \Delta t_k^o + n_k^o,
\]
and contributes the regularization term
\[
\| \Delta t_{k+1}^o - \Delta t_k^o \|_{\mathbf{\Sigma}_k^o}^2
\]
to the objective [1810.05456]. The corresponding interpretation is that the offset varies slowly enough to be tracked, but not assumed constant.

TON-VIO uses a related but more explicitly learned formulation. Rather than relying solely on a hand-crafted stochastic prior, it treats the offset sequence across optimization windows as learnable temporal structure via
\[
\text{TPN}:t_d(K) \mapsto t_d(K+1),
\]
with the previous-window estimate normalized to \([0,1]\) and processed by an LSTM [2403.12504]. A plausible implication is that TVOE methods increasingly separate into model-based stochastic filters and data-driven sequence priors.

In radar-inertial odometry, the nominal offset dynamics are
\[
\dot{\hat{t}_d} = 0,
\]
while the error-state model includes random-walk noise \(n_d\), so the practical effect is a constant nominal state with random-walk uncertainty [2502.00661]. Bistatic ISAC adopts the state evolution
\[
\boldsymbol{x_{t + 1}} =  \boldsymbol{x_t} + \boldsymbol{u_t},\qquad
\boldsymbol{u_t}  \sim \mathcal{N}\left( {0, \boldsymbol{Q_x}} \right),
\]
for joint TO/CFO tracking [2507.09215].

By contrast, the UWB synchronization formulation
\[
t'=\alpha t+\gamma=(1+\nu)t+\gamma
\]
keeps \(\gamma\) constant while allowing the effective timing mismatch to evolve linearly because of drift \(\nu\) [1406.6799]. The paper explicitly frames this as a time-varying synchronization error caused by drift rather than an arbitrarily time-varying offset function.

## 3. Observation models and sources of temporal information

TVOE methods differ most sharply in how offset information enters the likelihood or residual model. In two-way timing exchange, measurements are generated from forward and reverse message timestamps:
\[
U_j = d + \theta + X_j,\qquad V_j = d - \theta + Y_j,
\]
or equivalently
\[
U_j = \xi + X_j,\qquad V_j = \psi + Y_j,
\]
with Gaussian, exponential, or log-normal likelihoods in the factor-graph formulation [1201.6685]. In the exponential case, the support constraints
\[
\mathbb{I}(U_j-\xi),\qquad \mathbb{I}(V_j-\psi)
\]
play a crucial role in deriving closed-form max-product recursions [1201.6685, 1202.0022].

In distributed mobile-network synchronization, each edge provides a noisy relative measurement of the offset or log-skew. For offset estimation,
\[
\hat{\beta}_{u,v} = \beta_{u,v} + e^o_{u,v} = \beta_u - \beta_v + \epsilon^o_{u,v},
\]
so the problem reduces to scalar relative-measurement estimation [1301.2218]. The same paper notes an important distinction: offset noise can be biased because
\[
\epsilon_{u,v}^o := \beta_v\left(1-\frac{\alpha_u}{\alpha_v}\right)+e_{u,v}^o.
\]

In VIO, the observation side is usually visual. TON-VIO adopts the feature-shift model
\[
\mathbf{z}_l^{k}(t_d)=\mathbf{z}_l^{k}-\mathbf{V}_l^k t_d,
\]
so the offset is inferred through the image-plane displacement required for temporal alignment [2403.12504]. The paper’s critique is that conventional estimates of
\[
\mathbf{V}_l^k=\left(\left[\begin{array}{c} u_l^{k} \\ v_l^{k} \end{array}\right]-\left[\begin{array}{c} u_l^{k-1} \\ v_l^{k-1} \end{array}\right]\right) /\left(t_{k}-t_{k-1}\right)
\]
fail when tracking is unstable, motivating learned feature-velocity models [2403.12504].

Optimization-based monocular VIO propagates pose to the actual capture time \(\tilde t_k\), for example through
\[
\tilde{\mathbf{p}_{b_k}^w} = \mathbf{p}_{b_k}^w + \mathbf{v}_{b_k}^w \Delta t_k^o -\frac{1}{2}\mathbf{g}^w (\Delta t_k^o)^2 + \mathbf{R}_{b_k}^w \hat{\boldsymbol{\alpha}_{c_k}^{b_k},
\]
so the visual reprojection residual becomes directly sensitive to \(\Delta t_k^o\) [1810.05456].

Radar-inertial odometry uses a single-scan radar ego-velocity model,
\[
{}^R\mathbf{v}_R(t) =
{}^R\mathbf{R}_I \left( {}^G\mathbf{R}_I^\top(t) {}^G\mathbf{v}_I(t)
+ \lfloor ({}^I\boldsymbol{\omega}_I^m(t) - \mathbf{b}_g(t)) \times \rfloor {}^I\mathbf{p}_R \right),
\]
and applies the measurement at the aligned time
\[
t' = t + t_d
\]
so that temporal calibration affects both propagation and update scheduling [2502.00661].

In bistatic ISAC, the observation channel is the line-of-sight path. The measured LoS delay and Doppler are compared against geometric predictions,
\[
\tau _{\rm LoS}^{\rm geo} \left( t \right) = \frac{\left\| {\boldsymbol{q_u}\left( t \right) - \boldsymbol{q_b} \right\|}{c},
\qquad
f_{\rm LoS}^{\rm geo}\left( t \right) \approx \frac{1}{\lambda } \cdot \frac{d}{dt}\left\| {\boldsymbol{q_u}\left( t \right) - \boldsymbol{q_b} \right\|,
\]
to form residual observations
\[
\tau _{\rm off}(t)=\hat{\tau}_{\rm LoS}(t)-\tau_{\rm LoS}^{\rm geo}(t),\qquad
f_{\rm off}(t)=\hat f_{\rm LoS}(t)-f_{\rm LoS}^{\rm geo}(t)
\]
[2507.09215].

A different observation mechanism appears in adaptive delay estimation between signals. There the delay is encoded as the phase of an all-pass response
\[
H(\omega)=e^{-j\tau\omega},
\]
and extracted from FIR coefficients by
\[
\hat{\tau} = 2\frac{\sum_k ka_k}{\sum_k a_k}.
\]
The offset is thus not located through cross-correlation peak search but through adaptive filter identification [2101.02406].

## 4. Inference architectures

The literature contains four dominant inference architectures: exact or closed-form Bayesian inference on tree-structured graphs, distributed consensus-like algorithms, recursive filtering, and optimization-based batch or sliding-window estimation.

### Factor graphs and message passing

For two-way timing exchange, the posterior factorizes into two chain-structured factor graphs, one for \(\boldsymbol{\xi}\) and one for \(\boldsymbol{\psi}\), with transition factors \(f(\xi_k\mid \xi_{k-1})\), \(f(\psi_k\mid \psi_{k-1})\) and measurement factors \(f(U_k\mid \xi_k)\), \(f(V_k\mid \psi_k)\) [1201.6685]. Because the graph is a tree, max-product message passing yields the exact MAP estimate. The resulting recursion leads to closed forms such as
\[
\hat\xi_N= \min\left( U_N, G_{\xi,N}^{N}(U_{N-1}), \ldots, G_{\xi,1}^{N}(\hat\xi_0) \right),
\]
and the final estimator
\[
\hat\theta_N=\frac{\hat\xi_N-\hat\psi_N}{2}
\]
[1201.6685]. In the exponential-delay specialization, the estimator simplifies to nested minima of affine-transformed timestamps [1202.0022].

### Distributed averaging and MJLS analysis

In mobile networks, non-reference nodes update according to
\[
\hat{x}_u(k+1)=
\frac{w_{uu}(k)\hat{x}_u(k) + \sum_{v\in N_u(k)}w_{vu}(k)\big(\hat{x}_v(k)+\zeta_{u,v}(k)\big)}
{w_{uu}(k)+\sum_{v\in N_u(k)}w_{vu}(k)},
\]
while reference nodes remain pinned to the true value [1301.2218]. The corresponding error dynamics form a leader-follower consensus-like system under Markovian switching topology, and mean-square behavior is analyzed with Markov jump linear system tools [1301.2218].

### Kalman and extended Kalman filtering

Recursive filtering is prevalent when the offset is treated as a latent state with process noise. In bistatic ISAC, the paper calls the method an EKF, but the written equations are the standard linear Kalman recursion:
\[
\boldsymbol{\hat{x}_{t|t - 1}} = \boldsymbol{\hat{x}_{t-1 |t - 1}},\qquad
\boldsymbol{P_{t|t-1}} = \boldsymbol{P_{t-1|t-1}} + \boldsymbol{Q_x},
\]
followed by the update
\[
\boldsymbol{\hat{x}_{t|t }} =
\boldsymbol{\hat{x}_{t|t - 1} + \boldsymbol{K_t} \left( {\boldsymbol{z_t} - \boldsymbol{\hat{x}_{t|t - 1}} \right)}
\]
for \([\tau_{\rm off}(t),f_{\rm off}(t)]^T\) [2507.09215].

In radar-inertial odometry, the ES-EKF augments the state with \(t_d\) and derives a dedicated measurement Jacobian term
\[
\mathbf{H}_{t_d}
\]
by chain rule through orientation and velocity dependence on the aligned time \(t' = t+t_d\) [2502.00661]. The paper emphasizes that temporal calibration is not just an additive state but changes when the radar update is applied in the IMU time stream.

### Sliding-window nonlinear optimization

Optimization-based VIO estimates time offset jointly with pose, velocity, biases, extrinsics, and feature positions. The state is extended from
\[
\mathbf{x}_{b_k} = [ \mathbf{p}_{b_k}^w,\mathbf{v}_{b_k}^w,\mathbf{q}_{b_k}^w,\mathbf{b}_a^{b_k},\mathbf{b}_\omega^{b_k}]
\]
to
\[
\mathbf{x}_{b_k} = [ \mathbf{p}_{b_k}^w,\mathbf{v}_{b_k}^w,\mathbf{q}_{b_k}^w,\mathbf{b}_a^{b_k},\mathbf{b}_\omega^{b_k},\Delta t_k^o]
\]
and optimized in a MAP objective combining priors, inertial residuals, visual reprojection residuals, and offset smoothness priors [1810.05456]. TON-VIO similarly augments the estimation objective with a learned offset prior term
\[
\|t_d-t_d^{\text{TPN}}\|_{P_{t_d}}^2
\]
and modifies visual residual construction through FVON [2403.12504].

## 5. Domain-specific realizations

The diversity of TVOE applications is not accidental; each domain instantiates the same abstract problem with different latent variables, excitation sources, and performance criteria.

| Domain | Offset quantity | Core mechanism |
|---|---|---|
| Wireless clock synchronization | Clock offset / skew | Two-way timing exchange or relative measurements [1201.6685], [1301.2218] |
| Visual-inertial odometry | Camera–IMU time offset | Visual feature shifting and pose propagation to actual capture time [1810.05456], [2403.12504] |
| Radar-inertial odometry | Radar–IMU time offset | Ego-velocity update aligned to IMU time stream [2502.00661] |
| Bistatic ISAC | TO/CFO residuals | LoS delay/Doppler residual tracking [2507.09215] |
| Signal processing | Time-varying delay | Adaptive all-pass filtering [2101.02406] |
| Multivariate epidemiological series | Continuously varying lag | Profile, affinity, inner-product, and loss-based lag tracking [2110.15034] |

In wireless sensor networks, factor-graph TVOE is motivated by oscillator imperfections that render the offset time-varying [1201.6685, 1202.0022]. In mobile networks, the communication graph itself varies according to a finite-state homogeneous Markov chain, and the union-graph condition determines convergence [1301.2218].

In VIO, the offset is particularly consequential under high dynamic motion. TON-VIO argues that a few milliseconds of temporal misalignment can produce inconsistent visual-inertial constraints and large drift, especially when feature tracking is unstable [2403.12504]. The 2018 optimization-based VIO paper further uses the offset variable to absorb part of the rolling-shutter effect via an effective capture-time approximation [1810.05456].

In communications, synchronization problems often couple timing offset with CFO. AFDM derives joint ML estimators of symbol time offset and CFO from chirp-periodic prefix redundancy, using a correlation metric
\[
\gamma(\theta) = \sum_{k = \theta }^{\theta  + L - 1} r[k]r^*[k + N]e^{j4\pi c_1N(k - \theta  - L)}
\]
and then either joint or stepwise ML recovery [2310.07141]. OTFS similarly decomposes timing offset as
\[
\theta = \theta_d + M\theta_t
\]
and performs a two-stage TO estimate followed by GCE-BEM-based ML CFO refinement over a linear time-varying channel [2301.10080]. These are synchronization problems rather than generic offset-tracking frameworks, but they belong to the same technical family because the unknown temporal misalignment is estimated under explicit channel time variation.

The multivariate time-series formulation in epidemiology is conceptually distinct but methodologically informative. It defines maps such as
\[
f_1(t)=\arg\min_s \| p^X(t)-p^Y(t+s)\|_1
\]
and
\[
g_i(t)=\arg\max_{\tau}\langle \hat{x}_i(t:t+L-\tau),\hat{y}_i(t+\tau:t+L)\rangle_n,
\]
thereby treating TVOE as lag tracking between evolving multivariate structures rather than calibration of sensing hardware [2110.15034].

## 6. Convergence, optimality, and reported empirical behavior

The strongest formal convergence result in the supplied literature is the mobile-network theorem: if \(G(k)\) is governed by an ergodic homogeneous Markov chain with \(p_{ii}>0\), then the estimation error is mean-square convergent if and only if the union graph
\[
\hat G = \bigcup_{i=1}^N G_i
\]
is connected [1301.2218]. Mean-square convergence is defined there as convergence of both
\[
\mu(k)=\mathbb E[e(k)]
\quad\text{and}\quad
Q(k)=\mathbb E[e(k)e(k)^T],
\]
with asymptotic expressions derived using MJLS theory [1301.2218].

For two-way timing-exchange TVOE, the factor-graph estimator is reported to be near-optimal. In the Gaussian likelihood case, the FGE matches the BCRB; in the log-normal case it matches the Bayesian lower bounds; in the exponential case it is close to the BCHRB [1201.6685]. The same work states that as \(\sigma\to 0\), the Bayesian TVOE estimator reduces to the corresponding classical ML estimator [1201.6685]. This establishes a precise connection between dynamic Bayesian estimation and static synchronization estimators.

In adaptive delay estimation, the normalized all-pass algorithm satisfies the convergence condition
\[
0<\mu<\frac{1}{3tr[R]},
\]
and the minimum achievable mean square error is
\[
\xi(\infty)=\sigma_\eta^2
\]
under the stated LMS-type assumptions [2101.02406]. Synthetic experiments show that NAAP tracks both small and large delay changes robustly across all SNRs, while ETDE fails on the largest step in the large-step scenario and Sun can become numerically unstable because of learning-rate sensitivity [2101.02406].

The VIO literature emphasizes empirical rather than closed-form convergence. TON-VIO reports about **19%** TPE reduction for the VINS-Fusion-based variant, about **46%** TPE reduction for the OpenVINS-based variant on EuRoC with injected time-varying offset noise, and an average APE reduction of about **32%** on the SCube dataset [2403.12504]. The 2018 varying-offset VIO paper reports that its uncertainty-aware initialization improves success from 14/20 to 18/20, and that its varying-offset model outperforms the constant-offset version on Samsung Galaxy S8 data [1810.05456].

Radar-inertial odometry reports self-collected-sequence estimates converging to approximately \(-0.114\) s and \(-0.115\) s on example sequences, with average self-collected offset \(-0.113 \pm 0.002\) s, and reductions of **56%** in APE translation, **75%** in APE rotation, **50%** in RPE translation, and **58%** in RPE rotation relative to EKF-RIO [2502.00661].

Bistatic ISAC reports that TVOE keeps TO RMSE below **25 ns** at low SINR, while a static method exceeds **40 ns**, and that at high SINR the proposed method achieves nearly **60% lower TO RMSE** than the static LoS baseline [2507.09215]. This is specifically a TO-estimation result; the downstream significance is correction of NLoS delay-Doppler parameters for sensing [2507.09215].

These results suggest that TVOE is most beneficial when the underlying misalignment is neither negligible nor strictly static, and when the sensing or communication task is strongly nonlinear in timing error.

## 7. Assumptions, limitations, and recurring misconceptions

A recurring misconception is that TVOE always means the offset parameter itself is a free arbitrary function of time. Several papers make a narrower assumption. In the UWB affine-clock model, \(\gamma\) is constant while time-varying mismatch is induced by drift \(\nu\) [1406.6799]. In radar-inertial odometry, the nominal \(t_d\) is constant in the dynamics and only the uncertainty model permits random-walk adaptation [2502.00661]. In two-way timing-exchange factor graphs, the time variation is specifically Gauss-Markov, not unconstrained [1201.6685, 1202.0022].

Another misconception is that improved offset estimation can be isolated from the observation model. Several papers argue the opposite. TON-VIO explicitly states that both the observation side and the prediction side must be modeled: FVON improves feature-velocity estimates for unstable tracking, while TPN learns the temporal evolution of the offset [2403.12504]. Similarly, optimization-based VIO requires repeated IMU integration over variable-length intervals because the offset alters the effective measurement time, making computational structure part of the estimator design [1810.05456].

Identifiability is often motion- or topology-dependent. The radar-inertial work states that if the platform is stationary, the offset cannot be determined, and slow motion makes estimation harder [2502.00661]. The mobile-network result requires connectivity of the union graph to propagate reference information [1301.2218]. In bistatic ISAC, the method assumes a strong and reliable LoS component, known or measurable UAV trajectory, and smooth clock drift [2507.09215]. In temperature-varying synchronization, the neural estimator generalizes well only when test conditions fall within the thermal range seen during training [2212.07138].

The non-Gaussian case also raises a methodological limitation for classical filters. Under temperature variations, the induced skew perturbation \(\omega_{\gamma^T}\) is described as “not Gaussian; it is actually a multi-modal distribution, with significant asymmetry among the peaks,” so regular Kalman filtering becomes suboptimal [2212.07138]. The paper therefore formulates a Bayesian functional optimization problem and approximates the optimal estimator with splines and neural networks [2212.07138]. This suggests a broader point: TVOE is often not only a state-estimation problem, but also a model-mismatch problem.

Across the cited literature, the unifying pattern is that temporal misalignment becomes a state-like quantity once physical conditions invalidate constant-offset assumptions. TVOE methods then differ mainly in three choices: the stochastic model assigned to offset evolution, the sensing modality that provides temporal information, and the inference architecture used to couple dynamic prediction with measurement correction.

Source: https://www.emergentmind.com/topics/time-varying-offset-estimation-tvoe