2-TLP: Contexts and Applications
- 2-TLP is a polysemous term used in dynamic traffic assignment, DeFi pricing, temporal link prediction, and tensor program tuning with distinct definitions in each domain.
- In dynamic traffic assignment, 2-TLP formulates a constrained optimization of toll rates that reduces local travel time by 21.6% while maintaining network density near a critical threshold.
- In finance and network prediction, 2-TLP quantifies liquidity premiums and forecasts multi-step graph links, and in tensor tuning it integrates paired cost models to enhance latency prediction.
Searching arXiv for 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 (Gu et al., 2019), the two-period Liquidity-of-Time Premium in intertemporal pricing of time-bound stablecoins (Borjigin et al., 7 Oct 2025), 2-step Temporal Link Prediction in temporal networks (Xiong et al., 28 Feb 2025), and a shorthand for the paired use of TLP and MTL-TLP in tensor program tuning (Zhai et al., 2022). 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 | (Gu et al., 2019) |
| DeFi and asset pricing | Two-period Liquidity-of-Time Premium | (Borjigin et al., 7 Oct 2025) |
| Temporal networks | 2-step Temporal Link Prediction | (Xiong et al., 28 Feb 2025) |
| Tensor program tuning | Combination of TLP and MTL-TLP | (Zhai et al., 2022) |
Among these, the traffic paper uses â2-TLPâ as a formally posed optimization problem with explicit constraints and solution machinery (Gu et al., 2019). The stablecoin paper uses â2-TLPâ as a closed-form, two-period specialization of a term-structure model for the Liquidity-of-Time Premium (Borjigin et al., 7 Oct 2025). The temporal-network survey uses â2-step TLPâ as a forecasting horizon within the broader Temporal Link Prediction taxonomy (Xiong et al., 28 Feb 2025). 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 (Zhai et al., 2022).
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 (Prova et al., 17 Jun 2025, Yin et al., 14 Apr 2025, Hu et al., 2022, Jamet et al., 2024, Hakobyan et al., 2019, Prieto et al., 2013, AF, 2013).
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 with successive tolling intervals and decision vector
where is the distance toll rate and is the delay toll rate in interval (Gu et al., 2019). 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 in near the critical density vpkmpl. Its loss is
The second criterion is built from the âspatial spread of densityâ
0
its lower-envelope cubic 1, and the âdeviation from spreadâ
2
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 3 vpkmpl (Gu et al., 2019).
The reformulated 2-TLP is
4
This formulation makes 2-TLP a constrained control problem over time-varying joint distance and delay tolls rather than a static toll-design exercise (Gu et al., 2019).
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 (Gu et al., 2019). The design of experiments stratifies each of the 5 decision variables into 6 intervals and draws an initial Maximin Latin Hypercube of size 7. The expensive outputs are the objective 8 and the constraint 9, both evaluated by the traffic simulator.
For the scalar objective, the RK metamodel is
0
with Gaussian correlation
1
and nugget regularization through 2. Infill points are chosen by maximizing constrained expected improvement,
3
with 4 (Gu et al., 2019).
The reported numerical outcome for the second problem is that 2-TLP reduces the average travel time in the cordoned zone 5 by 21.6 % and in the entire network by 2.5 %. By comparison, the first TLP achieves 29.5 % in 6 and 1.4 % in the entire network, so 2-TLP exchanges part of the within-zone gain for a larger whole-network benefit (Gu et al., 2019). The same report states that the average deviation 7 under the single-objective solution was 8 vpkmpl, whereas 2-TLP drives it down to the allowable bound 9, 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 0 hours saved on a typical workstation (Gu et al., 2019). 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
1
where 2 is the underlying assetâs official closing price and 3 is the time-bound stablecoinâs market value during the closed period (Borjigin et al., 7 Oct 2025). 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 4-period horizon, with risk-neutral drift zero and lognormal overnight return, the supplied derivation writes
5
Setting 6 yields the two-period specialization called 2-TLP: 7 and
8
In this formulation, higher volatility 9 increases 2-TLP, and a lower loan-to-value ratio reduces both default probability and TLP (Borjigin et al., 7 Oct 2025).
The same work proposes a dynamic risk-control policy that adjusts 0 to keep TLP within a target band: 1 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 2 and high-vol assets having 2-day 3 (Borjigin et al., 7 Oct 2025). 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 4 and 5 from a history of graph snapshots (Xiong et al., 28 Feb 2025). In the discrete-time setting,
6
with adjacency matrices 7. The two-step forecasting problem is defined over a representation function
8
and an inference function
9
for 0, followed by
1
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 (Xiong et al., 28 Feb 2025). 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 (Xiong et al., 28 Feb 2025).
The survey also emphasizes under-explored combinations, including continuous-time latent representations with matrix-factorisation inference for 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 (Xiong et al., 28 Feb 2025).
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 (Zhai et al., 2022). 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
3
with training by mean squared error over 4 pairs, or on normalized latency 5 (Zhai et al., 2022).
The input is a padded or cropped schedule-primitive sequence 6, where each primitive yields an embedding by concatenating primitive-type encoding, learned name-token embeddings, and scaled numerical features. The resulting matrix 7 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 (Zhai et al., 2022). MTL-TLP introduces one task per hardware target, shares the embedding and backbone, and assigns a task-specific final head 8.
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 (Zhai et al., 2022). 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 (Gu et al., 2019); in another, a two-period liquidity premium (Borjigin et al., 7 Oct 2025); in another, a two-horizon graph-forecasting task (Xiong et al., 28 Feb 2025); and in another, a composite tensor-program tuning framework (Zhai et al., 2022). 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.