---
title: '2-TLP: Contexts and Applications'
url: https://www.emergentmind.com/topics/2-tlp
type: topic
---

# 2-TLP: Contexts and Applications

Searching arXiv for recent papers using the term "2-TLP" and nearby variants to ground the article.
“2-TLP” is a context-dependent abbreviation rather than a single standardized technical term. In the arXiv literature represented here, it appears in at least four distinct senses: the **second toll-level problem** in simulation-based dynamic traffic assignment [1904.11733], the **two-period Liquidity-of-Time Premium** in intertemporal pricing of time-bound stablecoins [2510.05711], **2-step Temporal Link Prediction** in temporal networks [2502.21185], and a shorthand for the paired use of **TLP and MTL-TLP** in tensor program tuning [2211.03578]. This distribution suggests that the expression is intrinsically polysemous and must be interpreted from disciplinary context rather than from the string “2-TLP” alone.

## 1. Terminological scope and disambiguation

The most explicit occurrences of “2-TLP” in the supplied literature are organized below.

| Domain | Meaning of “2-TLP” | Source |
|---|---|---|
| Dynamic traffic assignment | Second toll-level problem | [1904.11733] |
| DeFi and asset pricing | Two-period Liquidity-of-Time Premium | [2510.05711] |
| Temporal networks | 2-step Temporal Link Prediction | [2502.21185] |
| Tensor program tuning | Combination of TLP and MTL-TLP | [2211.03578] |

Among these, the traffic paper uses “2-TLP” as a formally posed optimization problem with explicit constraints and solution machinery [1904.11733]. The stablecoin paper uses “2-TLP” as a closed-form, two-period specialization of a term-structure model for the Liquidity-of-Time Premium [2510.05711]. The temporal-network survey uses “2-step TLP” as a forecasting horizon within the broader Temporal Link Prediction taxonomy [2502.21185]. The tensor-program paper does not define “2-TLP” in the title or abstract, but the supplied integrated description uses it to denote the combined system formed by TLP and MTL-TLP [2211.03578].

A common misconception is to treat “2-TLP” as a universal acronym. The broader literature represented here instead assigns “TLP” to unrelated constructs such as Ticket-Level Prediction, Task-Level Perturbations, Temporal Lift Pooling, Two Level Perceptron, Transboundary Loewner Property, Total Loss of Power, and Transient Lunar Phenomena [2506.14290] [2504.09893] [2207.08734] [2403.15181] [1901.05632] [1301.5475] [1301.1263].

## 2. 2-TLP as the second toll-level problem in dynamic congestion pricing

In dynamic traffic assignment, 2-TLP denotes the **second toll-level problem**, formulated for a cordoned toll subnetwork \(G_p\) with \(m=8\) successive tolling intervals and decision vector
\[
{\boldsymbol\tau}=(\tau^d_1,\dots,\tau^d_m,\;\tau^t_1,\dots,\tau^t_m),
\]
where \(\tau^d_h\) is the distance toll rate and \(\tau^t_h\) is the delay toll rate in interval \(h\) [1904.11733]. The problem extends a first TLP by adding an explicit control on the heterogeneity of congestion distribution in the pricing zone.

The first objective is to maintain the average network density \(K_h\) in \(G_p\) near the critical density \(K_{\rm cr}=25\) vpkmpl. Its loss is
\[
J_1({\boldsymbol\tau})
=
\frac{1}{m}\sum_{h=1}^m
\bigl\lvert\,K_h({\boldsymbol\tau})-K_{\rm cr}\bigr\rvert.
\]
The second criterion is built from the “spatial spread of density”
\[
Y
=
\sqrt{\frac{\sum_{i\in G_p} \ell_i\,n_i\,(k_i-\bar k)^2}{\sum_{i\in G_p}\ell_i\,n_i}},
\]
its lower-envelope cubic \(Y_{\rm env}(\bar k)=a\,\bar k^3+b\,\bar k^2+c\,\bar k\), and the “deviation from spread”
\[
\Delta
=
Y - Y_{\rm env}(\bar k)\ge 0.
\]
The original bi-objective problem is then reformulated as a constrained optimization in which the NFD-control objective is minimized subject to a heterogeneity-limit constraint, with \(A_{\max}=8\) vpkmpl [1904.11733].

The reformulated 2-TLP is
\[
\begin{aligned}
&\min_{\boldsymbol\tau}
&&J_1({\boldsymbol\tau})
=\frac1m\sum_{h=1}^m\lvert K_h-K_{\rm cr}\rvert,\\
&\text{subject to}
&&\frac1m\sum_{h=1}^m\Delta_h \le A_{\max},\\
&&&|\tau^d_h-\tau^d_{h+1}|\le\alpha,\quad
|\tau^t_h-\tau^t_{h+1}|\le\beta,\\
&&&0\le\tau^d_h\le\tau^d_{\max},\quad
0\le\tau^t_h\le\tau^t_{\max}.
\end{aligned}
\]
This formulation makes 2-TLP a constrained control problem over time-varying joint distance and delay tolls rather than a static toll-design exercise [1904.11733].

## 3. Surrogate optimization, heterogeneity control, and reported effects

The 2-TLP in the Melbourne study is solved by a surrogate-based method using **regressing kriging (RK) with expected improvement (EI) sampling** to approximate the expensive simulation input-output mapping [1904.11733]. The design of experiments stratifies each of the \(2m\) decision variables into \(2m+1\) intervals and draws an initial Maximin Latin Hypercube of size \(n_0=2(2m+1)\). The expensive outputs are the objective \(J_1\) and the constraint \(\frac1m\sum \Delta_h\), both evaluated by the traffic simulator.

For the scalar objective, the RK metamodel is
\[
J_1({\boldsymbol\tau})=\mu+Z({\boldsymbol\tau}),
\quad
Z\sim\mathcal{GP}\bigl(0,\sigma^2R({\boldsymbol\tau},{\boldsymbol\tau}')\bigr),
\]
with Gaussian correlation
\[
R({\boldsymbol\tau},{\boldsymbol\tau}')
=
\exp\Bigl(-\sum_{j=1}^{2m}\theta_j (\tau_j-\tau'_j)^2\Bigr),
\]
and nugget regularization through \(R+\lambda I\). Infill points are chosen by maximizing constrained expected improvement,
\[
\mathrm{CEI}(\tau^*)
=
\mathbb{E}[I(\tau^*)]\times
\Pr\bigl\{C(\tau^*)\le A_{\max}\bigr\},
\]
with \(I(\tau^*)=\max\{y_{\min}-J_1(\tau^*),0\}\) [1904.11733].

The reported numerical outcome for the second problem is that 2-TLP reduces the average travel time in the cordoned zone \(G_p\) by **21.6 %** and in the entire network by **2.5 %**. By comparison, the first TLP achieves **29.5 %** in \(G_p\) and **1.4 %** in the entire network, so 2-TLP exchanges part of the within-zone gain for a larger whole-network benefit [1904.11733]. The same report states that the average deviation \(\tfrac1m\sum\Delta_h\) under the single-objective solution was \(\simeq 9.4\) vpkmpl, whereas 2-TLP drives it down to the allowable bound \(A_{\max}=8\), yielding more uniform densities and reducing the size of the hysteresis loop in the NFD.

Operationally, both TLPs were solved in under 100 simulator calls, and the use of regressing kriging plus constrained EI sampling required roughly **30–40 % fewer simulations** than DIRECT, corresponding to \(\simeq 10\) hours saved on a typical workstation [1904.11733]. This suggests that, in this literature, “2-TLP” is not merely a second objective but a specific constrained reformulation whose central function is to regularize congestion heterogeneity while retaining NFD-based density control.

## 4. 2-TLP as the two-period Liquidity-of-Time Premium

In the stablecoin literature, TLP denotes the **Liquidity-of-Time Premium**, defined as
\[
\text{TLP}
=
\frac{S_c - P_c}{S_c},
\]
where \(S_c\) is the underlying asset’s official closing price and \(P_c\) is the time-bound stablecoin’s market value during the closed period [2510.05711]. Economically, TLP measures the compensation for bearing risk and illiquidity when the primary market is closed.

The paper then derives a term structure for TLP using a no-arbitrage model and a Black–Scholes put-price representation. For an \(n\)-period horizon, with risk-neutral drift zero and lognormal overnight return, the supplied derivation writes
\[
\text{TLP}_n
=
\frac{P_n}{S_c}
=
\Phi(-d_{2,n}) - \Phi(-d_{1,n}).
\]
Setting \(n=2\) yields the two-period specialization called **2-TLP**:
\[
d_{1,2}=\tfrac12\sigma\sqrt{2\tau},
\qquad
d_{2,2}=-\tfrac12\sigma\sqrt{2\tau},
\]
and
\[
2\text{-TLP}
=
\frac{P_2}{S_c}
=
2\,\Phi\Bigl(\tfrac12\sigma\sqrt{2\tau}\Bigr)-1.
\]
In this formulation, higher volatility \(\sigma\) increases 2-TLP, and a lower loan-to-value ratio reduces both default probability and TLP [2510.05711].

The same work proposes a dynamic risk-control policy that adjusts \(\ell tv\) to keep TLP within a target band:
\[
\Delta \ell tv
=
-\,k\;\bigl[\text{TLP}_{\obs}-\text{TLP}_0\bigr].
\]
Empirical proxies include ADR premiums, overseas index futures versus cash index divergence, and pre-market versus official close gaps. The reported backtest summary includes a nightly 1-day TLP mean of **0.23%**, median **0.18%**, and 95th/99th percentiles **0.9%/1.8%**, with low-vol assets having **2-day 2-TLP \(\approx 0.9\%\)** and high-vol assets having **2-day \(\approx 1.5\%\)** [2510.05711]. Here “2-TLP” is thus a pricing object in intertemporal liquidity engineering rather than an optimization problem.

## 5. 2-step TLP in temporal networks

In temporal-network research, TLP denotes **Temporal Link Prediction**, and “2-step TLP” refers the task of predicting both \(E_{T+1}\) and \(E_{T+2}\) from a history of graph snapshots [2502.21185]. In the discrete-time setting,
\[
G=(V,\{E_1,E_2,\dots,E_T\}),
\]
with adjacency matrices \(A_t\in\{0,1\}^{|V|\times|V|}\). The two-step forecasting problem is defined over a representation function
\[
Z_t = f_{\mathrm{repr}}(A_{t-\Delta'+1},\dots,A_t)\in\mathbb{R}^{|V|\times d}
\]
and an inference function
\[
S_{t+\delta}(u,v)=f_{\mathrm{inf}}(Z_{t-\Delta+1:t},\delta;\theta),
\]
for \(\delta\in\{1,2\}\), followed by
\[
\hat Y_{T+\delta}(u,v)=\sigma(S_{T+\delta}(u,v)).
\]

The survey organizes the method space through a representation–inference taxonomy. On the representation side, it identifies snapshot-based models, feature-extraction methods such as CN, KI, and AA with temporal weighting, matrix/tensor-factorization models, random-walk embeddings, and discrete- or continuous-time GNNs [2502.21185]. On the inference side, it distinguishes direct matrix/tensor extension, RNN-based forecasting, and attention-based decoders. For 2-step prediction, examples include TSVD plus AR on latent factors, DynNode2Vec plus RNN, and attention-based GNN decoders such as DySAT-style temporal self-attention [2502.21185].

The survey also emphasizes under-explored combinations, including continuous-time latent representations with matrix-factorisation inference for \(\delta=2\), neighbour-sequence representations with direct AR, and hybrid MF plus attention. This suggests that “2-TLP” in this literature denotes a multi-horizon forecasting regime within a general predictive taxonomy rather than a single canonical model [2502.21185].

## 6. 2-TLP as a paired tensor-program tuning framework, and the broader problem of acronym collision

In the tensor-program tuning literature, the supplied integrated description uses “2-TLP” to denote the combination of **TLP** and **MTL-TLP** [2211.03578]. TLP is a deep learning-based cost model that treats schedule primitives as tensor languages and converts latency prediction into an NLP regression task. The regression target is written as
\[
\ell = f(s;\theta)+\epsilon,
\]
with training by mean squared error over \((s,\ell)\) pairs, or on normalized latency \(y=\ell_{\min}/\ell\in(0,1]\) [2211.03578].

The input is a padded or cropped schedule-primitive sequence \(s=[p_1,\dots,p_L]\), where each primitive yields an embedding by concatenating primitive-type encoding, learned name-token embeddings, and scaled numerical features. The resulting matrix \(X\in\mathbb{R}^{L\times E}\) is passed through input embedding, positional encoding, a contextual backbone consisting of a single Transformer block or alternatively an LSTM layer, and a regression head with average pooling and two residual linear layers [2211.03578]. MTL-TLP introduces one task per hardware target, shares the embedding and backbone, and assigns a task-specific final head \(h_t\).

When integrated into the Ansor framework on ResNet-50, MobileNet-V2, ResNext-50, BERT-tiny, and BERT-base, the reported results are: **TLP** achieves **9.1×** average search-time reduction on CPU and **3.0×** on GPU versus TenSet-MLP tuning 2,000 programs, while **MTL-TLP** with only **7 %** of target-device data attains **4.7×** on CPU and **2.9×** on GPU [2211.03578]. In this usage, “2-TLP” is a convenient label for a paired methodology, not a formal mathematical object named in the original title.

Across the represented literature, the principal encyclopedic point is therefore negative but important: “2-TLP” has no stable cross-domain denotation. In one field it is a constrained toll-design problem [1904.11733]; in another, a two-period liquidity premium [2510.05711]; in another, a two-horizon graph-forecasting task [2502.21185]; and in another, a composite tensor-program tuning framework [2211.03578]. A plausible implication is that any technical reading of “2-TLP” should be treated as undefined until the surrounding domain vocabulary—traffic assignment, DeFi pricing, temporal networks, or tensor tuning—has been established explicitly.

Source: https://www.emergentmind.com/topics/2-tlp