From High-Level Communication Requirements to KPIs via Conformal Signal Temporal Logic Learning
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: Electrical Engineering. The day in electrical engineering: signals, systems and the hardware that carries them.
Rosa: We're looking at the paper: "From High-Level Communication Requirements to KPIs via Conformal Signal Temporal Logic Learning".
Paper summary: Rosa: So we're looking at this paper today called "From High-Level Communication Requirements to KPIs via Conformal Signal Temporal Logic Learning." The main idea is that softwarized radio access networks create tons of key performance indicators or KPIs, and this paper shows how you can use those streams to get useful information for optimizing the network.
Dev: Right. It's about taking those low-level KPI measurements and connecting them to high-level requirements, like quality of experience or QoE, which is what operators really care about. But bridging that gap needs methods that are relevant and interpretable, so operators can actually use what they learn to make changes.
Taro: I'm curious how they plan on making those connections relevant without just getting lost in the data noise.
Rosa: They introduce this framework called Conformal Signal Temporal Logic Learning, or C-STLL. Essentially, it uses signal temporal logic, which is a formal language for defining temporal properties of time series data, to learn formulas that can distinguish KPI traces that meet high-level requirements from those that don't.
Dev: So they are using this formal language to find these interpretable formulas. But the abstract says the key thing is ensuring reliability, so they wrap around existing STL learning algorithms with a conformal calibration procedure based on the Learn Then Test framework.
Taro: Wrapping an existing algorithm sounds like adding a safety net because those standard learning methods don't provide formal guarantees on how good their learned specifications are.
Rosa: Exactly. Existing STL learning methods, while they can pull out candidate formulas from labeled data, they don't give any formal guarantees on the reliability of those learned specifications ten eleven <ref:2602.20018#pg2,formal guarantees on the reliability of>. A formula that looks good on training data might just fail when you deploy it in the real world.
Dev: That's a big concern because in wireless communications, if network decisions are based on unreliable predictions, you could end up degrading user experience or breaking service level agreements.
Taro: So what they're trying to do is make sure that these learned formulas actually work consistently under uncertainty.
Rosa: The training part of C-STLL is set up as a supervised learning task. The goal there is to infer an STL formula, let's call it phi, that can effectively separate time series traces with positive and negative labels.
Dev: How do they define those labels for the learning task? What's the actual mathematical setup for that classification decision?
Paper summary: Rosa: The classification decision Y hat associated with an STL property phi is given by something like one plus or minus one based on whether the robustness of the input trace X and formula phi at zero is positive or negative fourteen <ref:2602.20018#pg2>.
Taro: So they are looking for a formula phi that, when applied to a KPI time series X, gives a certain sign based on whether it satisfies the requirement.
Dev: And their training loss function for finding this formula phi is defined as the average of shifted hinge loss over the dataset D of labeled KPI traces.
Rosa: That means they are training an algorithm to find a formula that minimizes this specific loss function across all their labeled data. It's a supervised learning problem where they want to infer an STL formula that relates KPI behavior to user experience outcomes.
Taro: I wonder if minimizing that hinge loss is enough, or if the resulting formula will actually be useful when we test it on new data.
Dev: That’s where the conformal calibration comes in and it’s the real innovation here. The key gain for C-STLL is its calibration methodology which wraps around any STL algorithm to produce a set of STL formulas with formal reliability guarantees.
Rosa: So, they take whatever STL algorithm you have, run it, and then sequentially apply this process where each newly learned formula is either accepted or rejected based on calibrated threshold procedures.
Taro: So if a new formula comes out but it's too complicated or too similar to one already in the set, they reject it?
Dev: Right. In their example, they said a formula phi two was rejected because of its high complexity, and phi three was rejected because it was too similar to phi one which was already accepted.
Rosa: The reliability condition they are aiming for is making sure that the fraction of correctly classified samples is larger than some user-defined threshold, say alpha.
Dev: That sounds like they are controlling the risk of false classifications based on a measurable fraction of correct predictions. That links directly to their use of the Learn Then Test framework to identify a subset lambda valid that guarantees this reliability condition with high probability twenty-five.
Taro: So they are not just finding *a* good formula; they are building a guaranteed set of formulas that works reliably across the distribution, even if we don't know all the data beforehand.
Rosa: They do. The theoretical guarantee, Theorem one says that by setting the hyperparameter vector lambda star as described in Algorithm two the risk of the set C lambda star over data D satisfies this inequality twenty-five.
Paper summary: Dev: So they are using this Learn Then Test procedure—which involves Pareto testing followed by fixed-sequence testing—to find a subset of formulas that meets that reliability condition. The final selection, lambda star, minimizes the size of that set among those formulas that satisfy the reliability condition.
Taro: That sounds like a smart way to balance getting enough diverse rules without creating an unmanageable number of them.
Rosa: It's about finding the most compact set of diverse, low-complexity formulas that still achieve high accuracy on validation data when compared against standard STL and its variants. Experiments on the ns-three network simulator in a mobile gaming scenario show they do this effectively, controlling risk below target levels while returning these compact specifications <ref:2602.20018#pg3>.
Dev: So it seems like the practical implication is that instead of just getting one formula that might break under real load, you get a collection of formulas that are formally vetted for reliability.
Taro: What about what this means for deployment? If we have this set of formulas, how do operators actually use them to make changes in the network?
Rosa: The implication is that these formulas give operators interpretable conditions on the KPI time series. It’s not just a black box; it’s a formal specification you can look at and validate against your high-level requirements.
Dev: It moves us from just having a learning model to having a verifiable set of rules that directly relate network performance to user experience outcomes.
Taro: If this works outside the lab, how long does that coverage last when the world misbehaves? That’s my question about real-world failure modes.
Rosa: The paper itself states they are investigating extending C-STLL to an online setting where KPI traces arrive sequentially and the formula set has to be updated incrementally. That's a future direction they're looking at.
Dev: I agree, that's where the engineering challenge gets tougher because you can't just re-run everything every time something new happens in the network environment.
Taro: And incorporating multitask learning across different network conditions and application types could probably help with that generalization issue you mentioned earlier.
Rosa: They also look at using large language models to generate natural language explanations of those learned STL formulas, which should help bridge the gap between formal specifications and what an operator actually understands.
Dev: So the overall message of this paper, "From High-Level Communication Requirements to KPIs via Conformal Signal Temporal Logic Learning," is that they've taken a powerful learning tool and added a rigorous testing framework to ensure the rules it generates are trustworthy enough for real network optimization.
Conclusion: Rosa: So we're wrapping up this look at "From High-Level Communication Requirements to KPIs via Conformal Signal Temporal Logic Learning." Basically, this paper shows how you can take those raw measurements from radio networks and turn them into formal rules that match what operators actually care about, like the quality of experience.
Dev: Yeah, they use something called signal temporal logic to learn these formulas that distinguish good performance traces from bad ones. It’s about making sure the network behavior actually lines up with the high-level requirements you set upfront.
Taro: So it's not just a black box learning model; they're trying to get interpretable specifications. That means we can actually look at the formula and say, "Ah, this rule is why our latency spiked."
Rosa: Exactly. And the big part is the conformal calibration procedure they added on top of the learning algorithm. It gives them formal reliability guarantees for those rules, which is super important when you're putting this into a real network.
Dev: That's where it gets interesting from an engineering standpoint. They use a framework called Learn Then Test to pick a set of formulas that they know will work reliably in the real world under uncertainty.
Taro: I wonder how long that reliability lasts if the network environment changes unexpectedly? Like, what happens when the data distribution shifts away from what they trained on?
Rosa: That’s a good question. They did look at extending this to an online setting where new data comes in constantly and they have to update those rules incrementally. They're also exploring using large language models to explain those formulas in plain English for the operators who actually run the systems.
Dev: It sounds like the goal is to give operators a set of vetted, low-complexity rules that directly link network performance metrics to user experience outcomes with a formal safety check built in.
Taro: So it moves from just predicting what might happen to having a set of verifiable conditions for how the network *should* behave. That's something I think is really valuable when dealing with complex autonomous systems.
King’s College London · Northeastern University
eess.SP
Submitted: 2026-02-23
Updated: 2026-11-17
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 90/100
The gist: Softwarized radio access networks generate rich streams of key performance indicators (KPIs) that can be leveraged to extract actionable intelligence for network optimization This paper introduces…
Key concepts
- Signal Temporal Logic (STL)
- STL is a formal language used to precisely specify temporal properties of time series data, like KPI traces. It allows researchers to define complex rules about how signals must behave over time, making it possible to learn formulas that capture specific temporal patterns relevant to network performance.
- Conformal Calibration
- This is the core innovation where C-STLL wraps existing STL learning algorithms. It uses a calibration procedure based on the Learn Then Test (LTT) framework to sequentially select and refine learned formulas, ensuring that the resulting set of formulas has formal reliability guarantees regarding its ability to correctly classify samples.
- Learn Then Test (LTT) Framework
- The LTT methodology is used for calibration. It involves testing candidate STL formulas to determine their reliability. By applying this framework, C-STLL can identify a subset of formulas that guarantees a certain level of accuracy (reliability condition) with high probability, minimizing the size of the required formula set.
Terminology
Summary
Softwarized radio access networks generate rich streams of key performance indicators (KPIs) that can be leveraged to extract actionable intelligence for network optimization This paper introduces conformal signal temporal logic learning (C-STLL), a framework that addresses both requirements C-STLL leverages signal temporal logic (STL), a formal language for specifying temporal properties of time series, to learn interpretable formulas that distinguish KPI traces satisfying high-level requirements from those that do not To ensure reliability, C-STLL wraps around existing STL learning algorithms with a conformal calibration procedure based on the Learn Then Test (LTT) framework. p. 0
Pruning redundant reasoning tokens
The core problem addressed is bridging the gap between low-level KPI measurements and high-level requirements, which necessitates methods that are relevant, capturing temporal patterns predictive of user-level outcomes, and interpretable The paper introduces C-STLL to achieve this by using STL to learn interpretable formulas that relate KPI behavior to QoE outcomes.
How the training signal is built
The STL learning problem is formulated as a supervised learning task where the goal is to infer an STL formula ϕ that can effectively distinguish between traces with positive and negative labels The classification decision Yˆ associated with an STL property ϕ is given by (14) or equivalently in terms of robustness Yˆ = (1, if ρ(X, ϕ, 0) > 0, -1, if ρ(X, ϕ, 0) < 0 The training loss LD(ϕ) is defined as the average of the shifted hinge loss l(ϕ, X, Y) over the dataset D.
Where the gains come from
The key innovation lies in C-STLL's calibration methodology which wraps around any STLL algorithm to produce a set of STL formulas with formal reliability guarantees This procedure involves sequential application of the STL algorithm, where each newly learned formula is either accepted for inclusion or rejected based on calibrated threshold-based procedures. The reliability condition is formalized as ensuring that the fraction of correctly classified samples is larger than a user-defined threshold φ. p. 5
Experimental validation
Experiments using the ns-3 network simulator on a mobile gaming scenario demonstrate that C-STLL effectively controls risk below target levels while returning compact, diverse sets of interpretable temporal specifications that relate KPI behavior to QoE outcomes The paper compares C-STLL against standard STLL and its variants, showing that C-STLL produces a compact set of diverse, low-complexity formulas that achieved high accuracy on validation data.
Benchmarking the framework
The calibration procedure is grounded in the Learn Then Test (LTT) framework and implemented via Pareto testing followed by fixed-sequence testing The LTT methodology allows for the identification of a subset Λvalid that guarantees the reliability condition (25) with high probability. The final selection λ∗ in C-STLL minimizes the empirical set size among those satisfying the reliability condition. p. 6
Theoretical guarantees
Theorem 1 guarantees that by setting the hyperparameter vector λ∗ as described in Algorithm 2, the risk of the set Cλ∗ (D) constructed via C-STLL satisfies the inequality (25). This proof relies on the validity of the p-value in (36) combined with the FWER control of fixed-sequence testing. p. 7 The LTT procedure ensures that no true null hypothesis is rejected with probability at most δ. p. 6
Conclusion
C-STLL is a novel framework for extracting interpretable temporal specifications from wireless network KPI traces with formal reliability guarantees It successfully combines the expressiveness of STL with distribution-free coverage guarantees to address relevance and interpretability concerns. The framework produces compact sets of diverse, low-complexity formulas that achieve high accuracy on validation data. p. 1
Future directions
Several directions merit further investigation, including extending C-STLL to an online setting where KPI traces arrive sequentially and the formula set must be updated incrementally. Incorporating multitask learning across heterogeneous network conditions and application types could improve generalization. p. 1 Validating C-STLL with real QoE measurements, as well as on a real O-RAN architecture, would support practical deployment. p. 0 Investigating the use of large language models to generate natural-language explanations of learned STL formulas could further bridge the gap between formal specifications and operator understanding.
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Conformal STL Learning (C-STLL) can extract interpretable temporal specifications from KPI traces with formal reliability guarantees, ensuring that
with high probability, the set contains at least one formula achieving a user-specified accuracy level.
-
The system can bridge the semantic gap between low-level KPI measurements and high-level requirements by learning formulas that are both relevant and interpretable, allowing operators to
understand why a decision was made either to validate decisions against domain expertise or to satisfy regulatory requirements.
-
The AI system can control risk below target levels through a calibrated process that jointly optimizes for
reliability, formula complexity, and diversity
using acceptance rules based on complexity thresholds (H(phi) lambda2). -
The system can produce compact and diverse sets of interpretable temporal specifications by employing an early stopping mechanism based on a set-based quality function F(Cλ,l(D)) and a quality threshold lambda3.
-
C-STLL can be calibrated using the Learn Then Test (LTT) framework with Pareto testing followed by fixed-sequence testing to select hyperparameters that guarantee the reliability condition by controlling the risk R(lambda).
Sources
- TLINet: Differentiable Neural Network Temporal Logic Inference
- XAI-on-RAN: Explainable, AI-native, and GPU-Accelerated RAN Towards 6G
- Conformal Calibration: Ensuring the Reliability of Black-Box AI in Wireless Systems
- Efficiently Controlling Multiple Risks with Pareto Testing
- Conformal Language Modeling
- LLMs-as-Judges: A Comprehensive Survey on LLM-based Evaluation Methods
Related papers
- Open-H-RF: A Large-Scale Ultrasound Raw Channel Dataset Initiative
- Scalable Attention for 5G NR Channel Estimation
- Low-Altitude Wireless Networks: A Comprehensive Survey
- Sensing-Assisted OFDM with Index Modulation: A Waveform for Optical Wireless Integrated Communication and Localisation
- Iteration-Free Candidate Pruning and an Index-Domain VLSI Architecture for Sort-Free MIMO Box Decoding up to 1024-QAM
- A Foundation Model for Large-Scale Wireless Network Planning, Operation and Optimization