Skip to Content
NetworkNetwork
  • Article
  • Open Access

15 October 2026

19 Pages

Handover-Aware Conformal Throughput Intervals for Risk-Sensitive Rate Selection in Mobile 5G

Computer Science Department, Faculty of Information Technology, University of Petra, Amman 11196, Jordan

Abstract

Mobile applications that must commit to a data rate—video streaming, guaranteed-rate admission, uplink scheduling—can stall or breach a service-level agreement whenever they promise more than the radio link can deliver. What protects them is not an accurate average-throughput forecast but a trustworthy lower bound on the rate that will actually be available. Conformal prediction (CP) can produce such bounds without distributional assumptions, but mobile 5G throughput is piecewise non-stationary: it jumps at cell handovers and radio-access-technology (RAT) transitions, exactly where a rate decision is most fragile. A natural fix is to condition the CP calibration on the mobility-regime state (RAT and time since the last handover). Using 188,711 s of real commercial 5G traces, we show that whether this conditioning helps is task-dependent. It helps two-sided prediction intervals, whose error scale varies by an order of magnitude across RATs, and it removes the post-handover under-coverage of online adaptive CP at no width cost. But for the one-sided lower bound that actually governs rate selection, a single global CP bound is better: it delivers higher link utilization at the same stall budget, and this advantage is robust to the data’s zero-inflation. The practical lesson for rate-control designers is to match the conditioning to the tail the decision uses, and to judge uncertainty methods by the operational outcome rather than by coverage alone. All results are reproducible from a released pipeline.

1. Introduction

Throughput prediction for 5G is a well-developed topic, with random forests, recurrent and graph neural networks, and Kalman filters all applied to client-side or network-side key performance indicators (KPIs) [1,2,3,4]. Almost all of this work optimizes a symmetric error such as mean absolute error (MAE) or root-mean-square error (RMSE) and returns a single number. That number is the wrong object once a controller has to act on it—selecting an adaptive bitrate (ABR), admitting a guaranteed-rate bearer, or sizing an uplink grant. The reason is that the loss is asymmetric in the two directions: a forecast that overshoots what the link can carry provokes a stall or a service-level-agreement (SLA) breach, while one that undershoots merely wastes radio resources. What such a controller actually needs is therefore not the expected throughput but a calibrated lower bound on it—a rate the link will meet with a stated probability—so that aggressive commitments are made only when they are statistically safe.
Conformal prediction (CP) provides distribution-free, finite-sample prediction sets under exchangeability [5,6,7], and adaptive conformal inference (ACI) restores long-run coverage under slow non-stationarity by adjusting the target miscoverage online [8]. Mobile 5G throughput, however, is not merely slowly drifting: it is piecewise non-stationary. At a cell handover or an Long-Term Evolution (LTE)↔5G (non-standalone) transition, the achievable rate—and, crucially, the residual distribution of any fixed predictor—can change discontinuously. Intuitively, these are exactly the moments at which a rate decision is most likely to be wrong, and at which a globally calibrated (or slowly adapting) interval is least trustworthy.
This motivates a domain-specific hypothesis: condition the conformal calibration on an observable mobility-regime state—the current radio-access technology (RAT) crossed with the time elapsed since the last handover—so that, immediately after a handover, the interval is drawn from the matching residual regime rather than a stale pooled one. We test this hypothesis on real commercial 5G measurements and reach a more nuanced conclusion than “condition on everything.”
  • Contributions.
We do not propose a new estimator; split CP, Mondrian/group-conditional CP [5], and ACI [8] are established. Our contribution is an empirical, task-dependent characterization on real mobility traces, together with the practical rule it implies:
  • We show the base predictor’s residual distribution is strongly regime-dependent—an order-of-magnitude scale difference across RATs and a significant sign flip of the prediction bias in the first seconds after a handover—establishing that the premise for regime conditioning is real (Section 4.1).
  • For two-sided intervals, regime (RAT) conditioning rebalances a severe global over-coverage of slow RATs; for online intervals, regime-conditioned ACI eliminates ACI’s post-handover under-coverage at no width cost (Section 4.2 and Section 4.3).
  • For the one-sided lower bound used by rate selection, we find the opposite: a single global CP bound dominates the regime-conditioned variants on the violation-versus-utilization frontier, and we identify the mechanism—the operative lower tail is near-idle-dominated and regime-invariant (Section 4.4). To our knowledge this “coverage-optimal ≠ decision-optimal” divergence has not been reported for cellular throughput.
  • Against a non-conformal quantile-regression baseline, we show the conformal bound is better calibrated two-sided and, one-sided, avoids a zero-utilization collapse that quantile regression suffers under the target’s heavy zero-inflation (Section 4.5).
The takeaway is a concrete design rule—condition on regime for two-sided and online use, keep the one-sided decision bound global, and evaluate on the operational metric rather than coverage—validated on real data with a fully reproducible pipeline. We stress that reproducibility is a feature, not a weakness, of this contribution: because we reuse only established estimators and vary a single design axis (the calibration grouping), the reported effects are attributable to that axis and can be independently re-derived. The non-obvious finding—that the conditioning which is optimal for coverage is sub-optimal for the one-sided decision, and that this holds even after the zero-inflated samples are removed (Section 4.7)—is not something a practitioner would predict a priori, and getting it wrong directly costs link utilization at a fixed stall budget. All results are reproducible from a released pipeline; every reported number is computed from saved artifacts.
  • Relation to our prior work.
This study builds on our earlier investigation of risk-aware conformal throughput prediction [9], and we are explicit about what is carried over and what is new. Carried over are the general problem stance (a calibrated, distribution-free wrapper around a gradient-boosting point predictor is preferable to a bare point forecast for risk-sensitive control) and the split-conformal foundation of Equations (1) and (2), which are standard. Everything that produces the findings of this paper is new relative to that work: the setting moves from a static, high-density single-cell dataset (L5GHDD) to commercial mobility traces with real handovers and RAT transitions; the mechanism moves from input-adaptive interval width with a deferral rule to conditioning the calibration on the mobility-regime state (RAT × time-since-handover), including its online form (Equation (5) applied per regime); the analysis moves from marginal coverage and deferral behavior to conditional coverage around handovers and a one-sided (Equation (4)) rate-selection frontier; and the central result—that regime conditioning helps two-sided and online coverage but not the one-sided decision bound—has no counterpart in the prior study, which considered neither mobility regimes nor a decision objective. The Methods section below reuse only the canonical conformal machinery and are otherwise written afresh for this setting.

3. Materials and Methods

3.1. Dataset

We use the public 5G production dataset of Raca et al. [2] (commercial Irish operator; client-side KPIs logged with G-NetTrack Pro, Gyokov Solutions, Sofia, Bulgaria). The archive contains 166 raw logs; after parsing, coercing missing markers, and discarding short or incomplete traces, the corpus comprises 83 usable traces and 188,711 one-second samples spanning three applications (Netflix, Amazon Prime, file download) and two mobility patterns (static, driving). Radio access is 5G for 72.3 % of samples, LTE for 18.7 % , and legacy RATs (HSPA+/UMTS/…) for the remainder. We detect 2285 regime events (2111 cell handovers and 1001 RAT changes, some coinciding in the same second) as changes in CellID or NetworkMode. Downlink throughput is converted to Mbps; it is heavily right-skewed and zero-inflated ( 45 % of seconds at ≤0.001 Mbps, reflecting idle/buffering periods), with median 0.002 , mean 10.8 , and maximum 533 Mbps. Fields used include RSRP, RSRQ, SNR, CQI, RSSI, speed, cell identifier and network mode. Table 1 summarizes the corpus by application, mobility, and radio access type.
Table 1. Summary of the 5G production dataset [2] after parsing and filtering (166 raw logs → 83 usable traces). Percentages are of the 188 , 711 one-second samples. Legacy RATs beyond HSPA+ (UMTS, HSUPA, HSDPA, GPRS, EDGE) together account for <0.7% of samples and are grouped with HSPA+ as “other (OTH)” in the analysis.

3.2. Prediction Task and Features

The target is next-second downlink throughput, y t + 1 , predicted from strictly causal features available at time t: current and lagged radio KPIs; throughput lags at 1 , 2 , 3 , 5  s; past-only rolling mean/std/min; speed; RAT one-hot indicators; and time_since_event. No future information enters any feature. The base point predictor is a histogram gradient-boosting regressor, held fixed across all CP variants to ensure a fair comparison.
All experiments were implemented in Python 3.12 (Python Software Foundation, Wilmington, DE, USA) using scikit-learn 1.8.0 for the base regressor, the quantile-regression baseline, and the conformal computations, with NumPy, pandas, and SciPy for data handling and the statistical tests and Matplotlib for the figures.

3.3. Leakage-Safe Evaluation Protocol

Because consecutive seconds within a measurement session are strongly autocorrelated, a row-wise split would let near-duplicate neighbours leak from calibration into test and inflate coverage. We therefore partition at the session level—disjoint sets of traces form train ( 55 % ), calibration ( 20 % ), and test ( 25 % )—rather than by the chronological row split appropriate to the single continuous stream of our prior static study [9]. Median imputation is fit on the training traces only, and all reported metrics are computed on held-out test traces. To keep conclusions from hinging on one partition, we repeat the whole procedure over independent random trace-level splits (30 seeds for the vectorized comparisons, 20 for the online-loop comparisons) and report the mean ± standard deviation together with paired Wilcoxon signed-rank tests across seeds.

3.4. Regime State

The mobility-regime state is regime = RAT × bucket ( τ ) , where RAT ∈ { 5 G , LTE , OTH } and τ is the time since the last regime event, bucketed into { 0 – 2 ,   3 – 5 ,   6 – 10 ,   11 + }  s.

3.5. Problem Formulation

Fix the trained point predictor f ^ (Section 3.2) and write its one-step forecast as y ^ = f ^ ( x ) for a causal feature vector x. Our aim is not a better y ^ but a trustworthy uncertainty wrapper around it: a rule that, for a chosen error rate, returns an interval (or a lower bound) which brackets the realized throughput at the promised frequency, without any parametric assumption on the error law—a requirement that split conformal prediction meets [5,6]. Two properties of mobile 5G shape how we instantiate it. Residual magnitude is wildly heterogeneous across radio regimes (Section 4.1), so a single interval half-width is either wasteful on stable links or too tight on volatile ones; and the operational cost of an error is one-sided, since a promised rate the link cannot sustain stalls the application whereas a conservative promise merely leaves capacity unused. The first property pushes us to a scale-normalized score with a per-regime denominator; the second, to a one-sided bound for the decision layer.
Concretely, let the residuals be graded by a regime-dependent scale rather than pooled globally. For a calibration example i belonging to group g i , define the normalized score
s i   =   | y i − f ^ ( x i ) | σ ^ ( g i ) ,   σ ^ ( g )   =   max median i :   g i = g | y i − f ^ ( x i ) | ,   ϵ ,
where the group g ranges over the whole calibration set, the RAT, or the full regime state depending on the variant (Section 3.6); σ ^ ( g ) is the median absolute residual within that group, robust to the heavy right tail of throughput; and ϵ = 10 − 3  Mbps guards against a zero denominator in near-idle groups. Ranking the calibration scores and taking the order statistic indexed by
k   =   ( m + 1 ) ( 1 − α ) ,   Q α   =   s ( k ) ,
with m = | D cal | and α the target miscoverage ( α = 0.10 throughout), reproduces the standard split-conformal quantile and therefore inherits its finite-sample validity: rescaling Q α by the local σ ^ gives the two-sided band
C ( x )   =   f ^ ( x )   ±   Q α   σ ^ g ( x ) ,   Pr y ∈ C ( x )   ≥   1 − α
under exchangeability within each group. The novelty here is not Equation (2)—which is textbook—but the choice of grouping g ( · ) , which we tie to the mobility-regime state and study as the central design variable.
The rate-selection controller does not consume the band C ( x ) ; it needs only a floor on what the link will deliver. We therefore calibrate a one-sided bound directly on the signed over-prediction s ˜ i = f ^ ( x i ) − y i : taking its ( 1 − β ) conformal quantile Q β (again via Equation (2), now on { s ˜ i } ) and clipping at the physical floor of zero throughput,
L ( x )   =   max f ^ ( x ) − Q β ,   0 ,   Pr y ≥ L ( x )   ≥   1 − β ,
where β is the tolerated stall budget of Section 4.4. Because L depends only on the lower tail of the error distribution, whether it should also be regime-conditioned is an empirical question we answer separately from the two-sided case—and the two answers turn out to differ.
Finally, for streaming (online) deployment the miscoverage level need not stay fixed. Adaptive conformal inference (ACI) [8] treats 1 − α as a control target and nudges the working level after every observation in proportion to whether the last interval missed,
α t + 1   =   α t + γ α − err t ,   err t   =   1   y t ∉ C t ( x t )   ,
so a miss tightens the target (widening subsequent intervals) and a hit relaxes it, holding realized coverage near 1 − α over time; we use step size γ = 0.02 . Our contribution at this layer is to run Equation (5) per regime state rather than globally, so the online correction is not diluted across regimes with different error scales.

3.6. Conformal Variants

The five variants are obtained by varying two knobs only—the grouping g that sets both the scale σ ^ ( g ) in Equation (1) and the quantile Q in Equation (2), and whether Q is frozen or driven online by Equation (5)—while holding the base predictor f ^ fixed, so any difference is attributable to the conditioning choice and not to the regressor:
  • Global: shared scale σ ^ and shared Q.
  • Mondrian-RAT: σ ^ and Q estimated per RAT [5].
  • HA-CP: σ ^ and Q per regime state (RAT × τ ), with RAT/global fallback for small groups.
  • ACI: online adaptive miscoverage on the plain absolute-residual score [8].
  • HA-CP+ACI: per-regime pools with per-group online adaptation.
Algorithm 1 states the proposed HA-CP+ACI procedure, which maintains one calibration pool and one adaptive level α t per regime state so that, immediately after a handover, the interval is drawn from the matching residual regime; setting a single group recovers plain ACI, and freezing α t = α recovers HA-CP.
Algorithm 1 Handover-Aware Conformal Prediction with online adaptation (HA-CP+ACI)
Require: 
base predictor f ^ ; calibration set D cal ; target α ; step γ ; scales σ ^ ( g ) from Equation (1)
1:
Initialize per-group score pool P g ← {   | y i − f ^ ( x i ) | / σ ^ ( g )   :   g i = g   } and α g ← α for each regime state g
2:
for each test step t = 1 , 2 , …  do
3:
    determine regime state g ← g ( x t ) ▹ RAT × time-since-handover; fall back to RAT / global if | P g | small
4:
     Q ← s ( k ) of P g with k = ⌈ ( | P g | + 1 ) ( 1 − α g ) ⌉                ▹ Equation (2)
5:
    output C t ( x t ) = [ f ^ ( x t ) − Q   σ ^ ( g ) ,   f ^ ( x t ) + Q   σ ^ ( g ) ]
6:
    observe y t ;   err ← 1 [ y t ∉ C t ( x t ) ]
7:
     α g ← α g + γ ( α − err )                ▹ per-group ACI update, Equation (5)
8:
    append | y t − f ^ ( x t ) | / σ ^ ( g ) to P g (bounded sliding window)
9:
end for
A first attempt using conformalized-quantile-regression scores [15] degenerated under the heavy zero-inflation of the target: the base 5th-percentile model collapsed to zero, the raw quantile-model interval already attained ∼ 92 % coverage on its own, and the conformal correction consequently shrank to zero, leaving nothing to calibrate. We report the normalized-residual score of Equation (1) instead, and note this dead-end explicitly rather than omitting it. The one-sided bound of Equation (4) is evaluated under the same global/RAT/regime partitions as the two-sided variants.

3.7. Decision-Layer Emulation

We emulate trace-driven rate selection: at each second the controller commits a rate r t for the next second. If r t > y t + 1 the commitment is a violation (stall/rebuffer risk) and the delivered rate is capped at y t + 1 ; otherwise the committed rate is served. We report the violation rate Pr ( r t > y t + 1 ) and utilization ∑ delivered / ∑ y (fraction of achievable capacity used). Sweeping the lower-bound aggressiveness ( β , or a scalar multiplier) traces a violation-versus-utilization frontier; the fair comparison is utilization at a matched achieved violation budget. This trace-driven emulation follows common practice in the ABR literature [23,25].

4. Results

4.1. The Premise: Residuals Are Regime-Dependent

Figure 1 summarizes two significant effects on the calibration set. First, the scale of the base predictor’s residuals differs by an order of magnitude across RATs: the 90th-percentile absolute residual is ≈ 56 , 8.6 and 3.0  Mbps for 5G, LTE and HSPA+ respectively (Kruskal–Wallis H = 930.6 , p ≈ 8.5 × 10 − 203 ). Second, the signed residual y − y ^ flips sign after a regime event: within 5G it is − 4.28  Mbps in the first 2 s after an event (the model over-predicts, not yet having adjusted to the new regime) versus + 7.80  Mbps in steady state (Mann–Whitney p ≈ 1.3 × 10 − 32 ; rank-biserial 0.26 ). We note that the naïve premise—that throughput is more volatile right after a handover—was not supported (post-event | Δ throughput | was slightly lower, because many handovers occur during idle periods); the tested premise is the residual-distribution shift above.
Figure 1. Base-predictor residuals are regime-dependent (calibration set). (a) 90th-percentile absolute residual by radio access type spans an order of magnitude. (b) Mean signed residual y − y ^ by time since regime event: the predictor over-predicts in the first seconds after a handover and under-predicts in steady state.

4.2. Two-Sided Intervals: Regime Conditioning Rebalances Coverage

Table 2 and Figure 2 report coverage over 30 seeds at a 90 % target. The global interval over-covers slow RATs (LTE 96.2 % , OTH 99.4 % ): a single global scale forces needlessly wide intervals where the link is stable. Regime conditioning rebalances toward nominal on 5G but then slightly under-covers the slow RATs—the classic Mondrian validity/efficiency trade-off [5], here quantified on real 5G data. Adding the time-since-event split (HA-CP) barely changes the two-sided picture beyond RAT conditioning.
Table 2. Two-sided coverage at nominal 90 % (mean over 30 seeds). Global over-covers slow RATs; regime methods rebalance per-RAT coverage.
Figure 2. Per-RAT conditional coverage (30 seeds, mean ± std). The global method over-covers LTE and legacy RATs; regime-conditioned methods move all RATs closer to nominal on 5G at the cost of mild under-coverage on slow RATs.

4.3. Online Adaptive Intervals: HA-CP+ACI Fixes Post-Handover Coverage

Table 3 and Figure 3 compare ACI and HA-CP+ACI over 20 seeds; we also include DtACI [19], a stronger global adaptive baseline that removes ACI’s single step-size by aggregating a set of ACI experts with different adaptation rates. All three hit (or nearly hit) marginal 90 % , but the two global online methods—plain ACI and DtACI—systematically under-cover the post-handover window: ACI reaches 88.8 % within 2 s and DtACI 87.4 % , because a global online quantile reacts only after coverage errors, precisely when a handover has just shifted the residuals. DtACI’s expert aggregation improves marginal width efficiency (narrower intervals, 20.3  Mbps) but does not close the local post-handover gap—if anything it is marginally worse there than plain ACI, since its aggregation is tuned for marginal, not conditional, adaptation. Conditioning the online calibration on regime state (HA-CP+ACI) raises post-event coverage to 91.6 % / 91.5 % , eliminating the under-coverage at essentially equal width. The improvement is significant against both baselines (paired Wilcoxon: vs. ACI + 0.027 , p < 10 − 5 ; vs. DtACI + 0.041 , p < 10 − 5 ; HA-CP+ACI better on 20 / 20 seeds in both cases). The lesson is that a stronger global adaptive scheme does not substitute for regime conditioning at the handover: for safety-oriented use, where under-coverage is the dangerous direction, cheap regime conditioning is what fixes the local failure.
Table 3. Online adaptive CP (mean over 20 seeds), nominal 90 % . Both global adaptive baselines (ACI, DtACI) under-cover the post-handover window; only regime-conditioned HA-CP+ACI removes it, at equal width.
Figure 3. Online adaptive CP (20 seeds). Both methods meet the marginal target; HA-CP+ACI removes ACI’s post-handover under-coverage at equal width.

4.4. Decision Layer: For a One-Sided Bound, Global Wins

Committing to the point forecast is catastrophic—a 71.5 % violation rate—so a calibrated lower bound is essential. Table 4 and Figure 4 and Figure 5 compare one-sided lower bounds on utilization at a matched violation budget (30 seeds). The global bound dominates the regime-conditioned variants at every budget: e.g., + 21 % relative utilization at a 2 % stall budget. Paired Wilcoxon global-vs-HA-CP gives p < 10 − 4 at all three budgets (global better on 20 / 22 , 26 / 28 and 25 / 29 paired seeds; the paired count is below 30 at the tighter budgets because in some seeds neither method’s frontier reaches so low a violation rate, and those seeds are dropped from the test rather than counted for either side). The mechanism is structural. Rate selection is scored against a marginal violation budget, and the global bound calibrates that marginal quantile directly, whereas the regime variants estimate per-group conditional quantiles—several on small calibration groups (Table 5)—and aggregating these to meet a marginal target sacrifices utilization. We verified that this is an objective-mismatch effect rather than merely inflated estimation variance: the seed-to-seed coefficient of variation of the one-sided quantile is comparable for the global and per-regime estimators ( 0.44 versus a per-state median of 0.40 ). The scale heterogeneity that made two-sided Mondrian useful lives in the upper tail (5G bursts), which is irrelevant to a lower bound.
Table 4. One-sided rate selection: utilization at a matched achieved violation budget (mean over 30 seeds; higher is better). The global bound dominates.
Table 5. Median calibration-set sizes per grouping over 15 seeds. Several regime states are small, triggering the RAT/global fallback ( MIN _ GROUP = 50 ); this, together with the marginal-budget objective, explains the one-sided disadvantage of partitioning.
Figure 4. One-sided rate selection (30 seeds): utilization at a matched violation budget. The single global lower bound dominates the regime-conditioned variants.
Figure 5. Violation-versus-utilization frontier for one-sided lower bounds (single split). Up-and-left is better; the global bound is on or above the regime-conditioned frontiers throughout.

4.5. External Baseline: Direct Quantile Regression

The comparisons above are among conformal variants. To place them against a published, non-conformal alternative that also yields intervals and bounds, we add direct quantile regression (QR): gradient-boosting models trained with the pinball loss to predict conditional quantiles of throughput. For fairness the QR models use the same features and hyperparameters as the base predictor and are fit on the train and calibration traces combined—the same total labeled data the conformal method consumes—over the same 30 trace-level splits (Table 6). QR is a natural comparator precisely because it targets quantiles directly, but, unlike conformal calibration, it carries no finite-sample coverage guarantee.
Table 6. External quantile-regression (QR) baseline vs. conformal global (30 seeds). QR over-covers and is wider two-sided, and collapses to zero utilization one-sided under zero-inflation. Lower | cov − 0.90 | and higher utilization are better.
For two-sided intervals, the QR band [ q ^ 0.05 , q ^ 0.95 ] over-covers at every seed (marginal 0.948 vs. the 0.90 target; 30 / 30 seeds above nominal) and is wider than the conformal global interval ( 23.8 vs. 20.8  Mbps), so on marginal calibration and efficiency conformal is the better choice; QR’s one compensating virtue is more uniform per-RAT coverage, since its conditional quantiles adapt to the input without an explicit grouping. For the one-sided decision bound the gap is decisive: QR’s lower bound is degenerate under the heavy zero-inflation. Because roughly 45 % of samples sit at ≤0.001 Mbps, the conditional lower quantiles are essentially zero up to the median, so QR delivers zero utilization at any usable stall budget and only rises above zero at the 0.50 quantile, where the achieved violation rate has already jumped to ≈0.60 (in all 30 seeds). The conformal global bound, whose offset is calibrated on the marginal residual tail rather than a conditional quantile, sidesteps this collapse and dominates QR on utilization at every budget ( 0.33 / 0.47 / 0.57 vs. 0.00 ; paired Wilcoxon p < 10 − 7 , conformal better on all paired seeds). This is the same failure mode that ruled out conformalized quantile regression in Section 3.6, now quantified against a plain-QR baseline. The mechanism is a difference in what is calibrated: quantile regression estimates a conditional quantile of the target, which under this zero-inflation is identically zero for the idle-dominated inputs, so its lower bound is zero until the quantile level is raised so far that the violation rate is unusable (empirically, the first non-zero utilization appears only at the median, where achieved violation ≈   0.60 ). The global conformal bound instead adds a single marginal offset to the point prediction, L ( x ) = f ^ ( x ) − Q β ; since f ^ ( x ) regresses toward the positive conditional mean on active inputs and Q β is one fixed scalar, L ( x ) remains positive and usable exactly where the conditional lower quantile collapses to zero. Global CP avoids the degeneracy not by being conformal per se, but by calibrating an additive marginal offset rather than a conditional quantile. In short, for risk-sensitive rate selection on zero-inflated throughput, a marginally calibrated conformal offset is not merely a refinement of quantile regression but a prerequisite for a usable lower bound.

4.6. Sensitivity Analysis

The nominal coverage target ( 90 % ) and the ACI step size ( γ   =   0.02 ) were fixed a priori. We verify that the two headline findings do not depend on these choices (Table 7, Figure 6). First, varying the nominal target over { 80 ,   90 ,   95 } % leaves the two-sided pattern intact: the global interval over-covers the legacy (OTH) RATs at every target (empirical coverage + 0.14 , + 0.10 , and + 0.05 above nominal at 80 / 90 / 95 % ), while HA-CP keeps them close to nominal throughout; the over-coverage shrinks at higher targets only because all methods approach 100 % . Second, varying the ACI step size over γ   ∈   { 0.01 , 0.02 , 0.05 } leaves the online finding intact: plain ACI under-covers the post-handover window at every γ (and progressively more as γ grows, 88.0 % at γ   =   0.05 ), whereas HA-CP+ACI restores post-event coverage to near or above nominal, improving on ACI by + 0.026 to + 0.030 and winning on all seeds at every γ . Both main results are therefore robust to the two fixed hyperparameters rather than artifacts of a particular setting. (These sweeps use fewer seeds, 4–6, than the main comparisons because each sweep multiplies the run count by the number of hyperparameter settings; we verified that the reported effects are monotone and consistent across every setting and seed, so additional seeds do not change the qualitative conclusion).
Table 7. Sensitivity analysis. Top: two-sided legacy-RAT (OTH) coverage vs. nominal target (6 seeds). Bottom: post-handover (≤2 s) coverage vs. ACI step size γ at nominal 90 % (4 seeds). Both findings persist across settings.
Figure 6. Sensitivity of the main findings. (a) Across nominal targets ( 80 / 90 / 95 % ), the global interval over-covers legacy RATs while HA-CP stays near nominal. (b) Across ACI step sizes γ , plain ACI under-covers the post-handover window while HA-CP+ACI restores near-nominal coverage. Error bars are ± std across seeds.
The findings are likewise insensitive to the time-since-handover bucket boundaries. Re-running with a finer scheme ( { 0 – 1 ,   2 – 3 ,   4 – 7 ,   8 + }  s) and a coarse scheme ( { 0 – 5 ,   6 + }  s) in place of the default ( { 0 – 2 ,   3 – 5 ,   6 – 10 ,   11 + }  s) leaves per-RAT two-sided coverage essentially unchanged (5G 0.900 , LTE 0.868 , OTH ≈   0.838 in all three) and preserves the one-sided ordering (global utilization 0.450 at a 5 % budget versus 0.413 – 0.417 for HA-CP, 8 seeds). This is expected: the two-sided picture is dominated by the RAT axis, and the one-sided bound is regime-invariant in its operative tail, so the sub-bucketing of time-since-handover is second-order.

4.7. Robustness to Zero-Inflation: Active-Traffic Ablation

A natural concern is that the one-sided result—global beats regime-conditioned—is an artifact of the dataset’s heavy zero-inflation ( ≈ 45 % of seconds at ≤0.001 Mbps). We test this directly by removing the near-idle samples: for a throughput threshold θ we restrict both calibration and test to seconds with y   >   θ , yielding subsets whose zero-inflation is 0 % , and re-run the one-sided frontier. Table 8 and Figure 7 report utilization at a 5 % stall budget over 15 seeds. The global bound continues to dominate at every threshold; the margin over HA-CP does not shrink but widens, from + 0.035 on the full data to + 0.057 – 0.071 on active traffic (paired Wilcoxon p   <   10 − 3 , global better on 15 / 15 seeds on the de-inflated subsets). The finding is therefore not a consequence of the zeros. The mechanism is that rate selection is scored against a marginal violation budget, which the single global quantile calibrates directly, whereas partitioning the calibration set estimates per-group conditional quantiles that are less efficient for a marginal target—an effect that, if anything, strengthens once the regime-invariant near-idle mass is removed and the RAT-heterogeneous active tail dominates.
Table 8. Active-traffic ablation: one-sided utilization at a 5 % violation budget (mean over 15 seeds) on subsets with the near-idle mass removed. Global dominance persists and widens as zero-inflation is eliminated.
Figure 7. One-sided utilization at a 5 % violation budget as near-idle samples are removed (error bars ± std over 15 seeds). The global lower bound stays above the regime-conditioned variants at every active-traffic threshold, so the finding is not driven by the dataset’s zero-inflation.

4.8. Application-Layer Emulation: Rebuffering and Bitrate

The violation-versus-utilization frontier is the operational metric this paper optimizes, but a reader may ask how the choice of lower bound plays out at the application layer. We therefore emulate a trace-driven adaptive-bitrate (ABR) controller: each second it commits the highest rate on a bitrate ladder ( { 0.3 ,   0.75 ,   1.2 ,   2.0 ,   3.0 ,   4.5 ,   6.0 }  Mbps) that does not exceed the one-sided bound L t , the link delivers the real trace throughput, and a standard chunk/buffer model accumulates rebuffering time, average committed bitrate, and bitrate-switch rate. This is an emulation, not a full video player. Two findings follow.
First, a QoE simulation over the full traces is not well posed on this dataset: because ≈ 45% of seconds are idle/near-zero throughput, a continuous-playback model spends almost all of its time in apparent rebuffering regardless of the method, and the metric saturates. This is itself a reason we adopt the violation/utilization frontier as the operational objective. We therefore evaluate the emulation on active-playback segments (seconds with y   >   0.5  Mbps), treating them as continuous playback—an approximation we state plainly.
Second, on those active segments the calibrated bound behaves as intended and the global-versus-regime distinction is immaterial at the application layer. Committing to the raw point forecast rebuffers ≈ 1.3% of the time, whereas the global conformal lower bound (at β   =   0.10 ) drives rebuffering to ≈ 0%, trading a lower average bitrate for near-elimination of stalls—the safety behaviour a rate-selection bound is meant to provide. Comparing the global and regime-conditioned bounds along the rebuffer-versus-bitrate frontier (Figure 8), they are statistically indistinguishable: at a matched 1 % rebuffer budget the global bound delivers 3.57  Mbps versus 3.52  Mbps for HA-CP (paired Wilcoxon p   =   0.56 ; 10 seeds), with comparable switch rates. Once the raw utilization gap is mapped through a quantised bitrate ladder and a playout buffer, it does not translate into a meaningful QoE difference—which reinforces, from the application side, the practical recommendation to keep the one-sided bound global: it is simpler and no worse.
Figure 8. Trace-driven ABR emulation on active-playback segments (10 seeds). Average committed bitrate versus rebuffer ratio for global and regime-conditioned lower bounds; the two frontiers nearly coincide, so the choice is immaterial at the application layer.
  • Why the continuous advantage narrows under discrete ABR.
The apparent tension between the two evaluations—a clear global advantage in the continuous violation–utilization analysis (Section 4.4) that all but vanishes here—is not a contradiction; it is itself an instance of this paper’s central message, and we make it explicit. Utilization is a continuous functional of the lower bound: any change in L ( x ) , however small, shifts the delivered throughput and is registered one-for-one. The ABR controller instead applies two smoothing operations on top of L ( x ) before it can affect experience. First, it quantises the bound onto a finite bitrate ladder, so two bounds that differ by a few percent in continuous utilization often select the same ladder rung and yield identical decisions. Second, the playout buffer integrates throughput over time, so the brief shortfalls that a violation metric counts individually are absorbed by buffered video and never surface as stalls. The ABR objective is therefore far less sensitive to the exact lower bound than the raw frontier is: the global bound’s continuous edge is real, but it falls inside the dead-zone created by ladder quantisation and buffering. This does not reverse the recommendation—global remains no worse under ABR and strictly better on the continuous decision—but it sharpens the paper’s thesis. The magnitude of the benefit from a given uncertainty treatment is set by the downstream decision mechanism: a controller that commits to a near-continuous rate (guaranteed-bitrate admission, uplink-grant sizing) will feel the difference between lower bounds, whereas a coarsely quantised, heavily buffered ABR player largely will not. Practitioners should accordingly match the uncertainty treatment to the granularity and memory of the decision it will drive, not merely to the coverage target.

5. Discussion

We separate three levels of claim: (i) what our experiments demonstrate in the evaluated setting, (ii) how we interpret those results, and (iii) the broader recommendations they suggest, whose generality would require further validation.
(i)
What the experiments demonstrate (evaluated setting).
On the dataset and protocol of Section 3, three effects are statistically supported. First, for two-sided intervals a single global scale over-covers the slow RATs, and RAT conditioning rebalances per-RAT coverage toward nominal (Table 2). Second, for online intervals the two global adaptive methods we tested—ACI and the stronger, aggregation-based DtACI [8,19]—meet their marginal target but under-cover the post-handover window, whereas per-regime conditioning (HA-CP+ACI) restores post-event coverage at essentially equal width (Table 3). Third, for the one-sided bound evaluated on the near-continuous violation–utilization frontier, the global bound attains higher utilization than the regime-conditioned variants at matched stall budgets (Table 4); this ordering persists when the near-idle samples are removed (Section 4.7) but is substantially reduced—to statistical indistinguishability—once the same bound drives a discrete, buffered ABR ladder (Section 4.8). These statements are specific to our single-operator, 2019-era NSA-5G data, client-side KPIs, and single base predictor.
(ii)
How we interpret the results (mechanism; hypotheses).
We offer the following reading as interpretation rather than proven law. Reactive online methods adjust only after coverage errors, so they lag the abrupt residual shift at a handover—which is the mechanism we propose for why per-regime pools, pre-indexed by the observable regime state, close the post-handover gap. On the decision side, rate selection is scored against a marginal violation budget that the global quantile targets directly, whereas partitioning spends calibration data on per-group conditional quantiles, several estimated on small groups (Table 5); we attribute the one-sided ordering to this objective mismatch rather than to inflated quantile variance, which we found comparable across granularities. The compressed phrase “coverage-optimal was not decision-optimal” captures this interpretation in our evaluation: the variant with the best conditional coverage was not the one with the best rate-selection frontier. These directions and magnitudes for mobile 5G were, as far as we are aware, previously unquantified; the underlying trade-offs they echo—Mondrian conditioning exchanging marginal efficiency for conditional validity [5], and one-sided bounds depending on a single tail—are consistent with established theory.
(iii)
What we recommend, and with what caveats.
The practitioner-facing takeaways below are hypotheses supported within our evaluated setting, not validated general design rules, and they are contingent on the downstream decision mechanism. With those qualifications, our results suggest conditioning uncertainty on the radio regime where the objective is two-sided coverage or interval width (e.g., interval-based SLA monitoring); and, for a one-sided rate-selection bound consumed as a near-continuous commitment (e.g., guaranteed-bitrate admission, uplink-grant sizing), that in our data a single global bound was at least as good as regime conditioning and operationally simpler. This last point is explicitly conditional: the global advantage we observed shrank to practical irrelevance once the bound drove a coarsely quantised, buffered ABR player, where the two choices were statistically indistinguishable (Section 4.8). The transferable message we hold most confidently is therefore methodological rather than prescriptive: an uncertainty treatment should be chosen against—and evaluated on—the specific downstream decision it will drive (its operative tail, its granularity, and its memory), not on coverage diagnostics alone. The quantile-regression baseline makes the same methodological point from the other side: a method can target the nominal quantile yet be unusable for the decision (here, collapsing to zero utilization under zero-inflation). Whether the specific orderings we observed transfer to other operators, countries, standalone 5G or 6G, RAN-side KPIs, or other base predictors remains open and would require validation beyond the present evidence.

6. Conclusions

On the real commercial 5G mobility traces we study, the value of conditioning conformal calibration on the mobility-regime state depended on the task. In our evaluation it helped two-sided intervals (rebalancing a severe global over-coverage of slow RATs) and helped online intervals (removing the post-handover under-coverage of the global adaptive methods at no width cost), but it did not help the one-sided lower bound used for rate selection: on the near-continuous violation–utilization frontier a single global bound reached up to 21 % higher utilization at a fixed stall budget, an advantage that persisted after removing the zero-inflated samples yet became statistically indistinguishable once the bound drove a discrete, buffered ABR player.
We emphasize the scope of these results. They are demonstrated only for the setting we study: a single commercial operator, one country, and 2019-era non-standalone (NSA) 5G, with client-side (not RAN-side) KPIs and a single base predictor. We frame the practitioner-facing implications as hypotheses supported within this setting rather than validated design rules, and as contingent on the downstream decision mechanism. With those qualifications, our results suggest conditioning uncertainty on the radio regime where the objective is two-sided coverage or interval width, and, for a one-sided rate-selection bound consumed as a near-continuous commitment, that a single global bound was at least as good as regime conditioning and simpler to maintain—a recommendation that weakens or disappears for coarsely quantised, buffered decisions such as ABR. The most transferable takeaway is methodological: an uncertainty treatment should be selected and evaluated against the specific downstream decision it drives, not on coverage alone. We do not claim these findings for standalone (SA) 5G or for 6G. Their extension to those regimes is a hypothesis that requires future validation, not a demonstrated result. The hypothesis is motivated—but not established—by two observations internal to our data: the operative lower tail is set by idle/near-idle periods and by the marginal-versus-conditional calibration trade-off, neither of which is intrinsically NSA-specific; and the one-sided finding survives removal of the zero-inflated samples (Section 4.7). Confirming or refuting it will require SA-5G/6G traces that we could not obtain: to our knowledge no public trace set with per-second client-side KPIs, handover/RAT-change labels, and throughput is currently available for those regimes, and we deliberately did not substitute synthetic data. Generalization across operators, countries, RAN-side KPIs, and alternative base predictors likewise remains open. Releasing our pipeline is intended in part to make such replications straightforward once suitable data appear. The two fixed hyperparameters (the 90 % coverage target and the ACI step size γ ), together with the time-since-handover bucket boundaries, were varied in Section 4.6 and left both findings intact.

Funding

This research received no external funding.

Institutional Review Board Statement

Not applicable.

Data Availability Statement

The study uses the publicly available 5G production dataset of Raca et al. [2], hosted at https://github.com/uccmisl/5Gdataset (accessed on August 2026). The complete analysis pipeline and the scripts that regenerate every reported number, table, and figure are archived at Mendeley Data (Sirhan, N. Analysis Pipeline for “Handover-Aware Conformal Throughput Intervals for Risk-Sensitive Rate Selection in Mobile 5G”, Mendeley Data, V1, 2026). https://data.mendeley.com/datasets/ncbdm2c36d/1.

Acknowledgments

The author thanks the maintainers of the public 5G production dataset for making the data openly available.

Conflicts of Interest

The author declares no conflicts of interest.

Use of AI Tools

During the preparation of this work the authors used an AI assistant (a large language model) for copyediting and language refinement, and generation of matplotlib (3.11.0) figures from computed results, Grammarly: https://www.grammarly.com/. All figures are programmatic plots of real, non-fabricated results produced by the released analysis code; no generative-AI imagery is used. The authors reviewed and verified all content and take full responsibility for it.

References

  1. Narayanan, A.; Ramadan, E.; Mehta, R.; Hu, X.; Liu, Q.; Fezeu, R.A.K.; Dayalan, U.K.; Verma, S.; Ji, P.; Li, T.; et al. Lumos5G: Mapping and Predicting Commercial mmWave 5G Throughput. In Proceedings of the ACM Internet Measurement Conference (IMC), Virtual, 27–29 October 2020; pp. 176–193. [Google Scholar]
  2. Raca, D.; Leahy, D.; Sreenan, C.J.; Quinlan, J.J. Beyond Throughput, the Next Generation: A 5G Dataset with Channel and Context Metrics. In Proceedings of the 11th ACM Multimedia Systems Conference (MMSys), Istanbul, Turkey, 8–11 June 2020; pp. 303–308. [Google Scholar]
  3. Raca, D.; Zahran, A.H.; Sreenan, C.J.; Sinha, R.K.; Halepovic, E.; Jana, R.; Gopalakrishnan, V. On Leveraging Machine and Deep Learning for Throughput Prediction in Cellular Networks: Design, Performance, and Challenges. IEEE Commun. Mag. 2020, 58, 11–17. [Google Scholar] [CrossRef] [Scilit]
  4. Biswas, M.; Chakraborty, A.; Palit, B. A Kalman Filter Based Low Complexity Throughput Prediction Algorithm for 5G Cellular Networks. IEEE Trans. Veh. Technol. 2024, 73, 7089–7101. [Google Scholar] [CrossRef] [Scilit]
  5. Vovk, V.; Gammerman, A.; Shafer, G. Algorithmic Learning in a Random World; Springer: New York, NY, USA, 2005. [Google Scholar]
  6. Lei, J.; G’Sell, M.; Rinaldo, A.; Tibshirani, R.J.; Wasserman, L. Distribution-Free Predictive Inference for Regression. J. Am. Stat. Assoc. 2018, 113, 1094–1111. [Google Scholar] [CrossRef] [Scilit]
  7. Angelopoulos, A.N.; Bates, S. A Gentle Introduction to Conformal Prediction and Distribution-Free Uncertainty Quantification. Found. Trends Mach. Learn. 2023, 16, 494–591. [Google Scholar]
  8. Gibbs, I.; Candès, E. Adaptive Conformal Inference Under Distribution Shift. In Advances in Neural Information Processing Systems (NeurIPS); Curran Associates Inc.: Red Hook, NY, USA, 2021; Volume 34, pp. 1660–1672. [Google Scholar]
  9. Sirhan, N.N.; Alrousan, R.; Al-Saqqa, S.; Hamad, F.; Khrisat, Z. Risk-Aware Downlink Throughput Prediction in High-Density 5G Networks. Computation 2026, 14, 105. [Google Scholar] [CrossRef] [Scilit]
  10. Samba, A.; Busnel, Y.; Blanc, A.; Dooze, P.; Simon, G. Instantaneous Throughput Prediction in Cellular Networks: Which Information Is Needed? In Proceedings of the IFIP/IEEE Symposium on Integrated Network and Service Management (IM), Lisbon, Portugal, 8–12 May 2017; pp. 624–627. [Google Scholar]
  11. Yue, C.; Jin, R.; Suh, K.; Qin, Y.; Wang, B.; Wei, W. LinkForecast: Cellular Link Bandwidth Prediction in LTE Networks. IEEE Trans. Mob. Comput. 2018, 17, 1582–1594. [Google Scholar] [CrossRef] [Scilit]
  12. Raca, D.; Zahran, A.H.; Sreenan, C.J.; Sinha, R.K.; Halepovic, E.; Jana, R.; Gopalakrishnan, V.; Bathula, B.; Varvello, M. Empowering Video Players in Cellular: Throughput Prediction from Radio Network Measurements. In Proceedings of the 10th ACM Multimedia Systems Conference (MMSys), Amherst, MA, USA, 18–21 June 2019; pp. 201–212. [Google Scholar]
  13. Narayanan, A.; Zhang, X.; Zhu, R.; Hassan, A.; Jin, S.; Zhu, X.; Zhang, X.; Rybkin, D.; Yang, Z.; Mao, Z.M.; et al. A Variegated Look at 5G in the Wild: Performance, Power, and QoE Implications. In Proceedings of the ACM SIGCOMM Conference, Virtual, 23–27 August 2021; pp. 610–625. [Google Scholar]
  14. Minovski, D.; Ögren, N.; Mitra, K.; Åhlund, C. Throughput Prediction Using Machine Learning in LTE and 5G Networks. IEEE Trans. Mob. Comput. 2023, 22, 1825–1840. [Google Scholar]
  15. Romano, Y.; Patterson, E.; Candès, E.J. Conformalized Quantile Regression. In Advances in Neural Information Processing Systems (NeurIPS); Curran Associates Inc.: Red Hook, NY, USA, 2019; Volume 32, pp. 3538–3548. [Google Scholar]
  16. Gibbs, I.; Cherian, J.; Candès, E.J. Conformal Prediction with Conditional Guarantees. J. R. Stat. Soc. Ser. B 2025, 87, 1100–1126. [Google Scholar] [CrossRef] [Scilit]
  17. Xu, C.; Xie, Y. Conformal Prediction Interval for Dynamic Time-Series. In Proceedings of the 38th International Conference on Machine Learning (ICML); PMLR: New York, NY, USA, 2021; Volume 139, pp. 11559–11569. [Google Scholar]
  18. Zaffran, M.; Féron, O.; Goude, Y.; Josse, J.; Dieuleveut, A. Adaptive Conformal Predictions for Time Series. In Proceedings of the 39th International Conference on Machine Learning (ICML); PMLR: New York, NY, USA, 2022; Volume 162, pp. 25834–25866. [Google Scholar]
  19. Gibbs, I.; Candès, E.J. Conformal Inference for Online Prediction with Arbitrary Distribution Shifts. J. Mach. Learn. Res. 2024, 25, 1–36. [Google Scholar]
  20. Tibshirani, R.J.; Foygel Barber, R.; Candès, E.; Ramdas, A. Conformal Prediction Under Covariate Shift. In Advances in Neural Information Processing Systems (NeurIPS); Curran Associates Inc.: Red Hook, NY, USA, 2019; Volume 32, pp. 2530–2540. [Google Scholar]
  21. Barber, R.F.; Candès, E.J.; Ramdas, A.; Tibshirani, R.J. Conformal Prediction Beyond Exchangeability. Ann. Stat. 2023, 51, 816–845. [Google Scholar] [CrossRef] [Scilit]
  22. Spiteri, K.; Urgaonkar, R.; Sitaraman, R.K. BOLA: Near-Optimal Bitrate Adaptation for Online Videos. In Proceedings of the IEEE INFOCOM, San Francisco, CA, USA, 10–15 April 2016; pp. 1–9. [Google Scholar]
  23. Yin, X.; Jindal, A.; Sekar, V.; Sinopoli, B. A Control-Theoretic Approach for Dynamic Adaptive Video Streaming over HTTP. In Proceedings of the ACM SIGCOMM Conference, London, UK, 17–21 August 2015; pp. 325–338. [Google Scholar]
  24. Sun, Y.; Yin, X.; Jiang, J.; Sekar, V.; Lin, F.; Wang, N.; Liu, T.; Sinopoli, B. CS2P: Improving Video Bitrate Selection and Adaptation with Data-Driven Throughput Prediction. In Proceedings of the ACM SIGCOMM Conference, Florianópolis, Brazil, 22–26 August 2016; pp. 272–285. [Google Scholar]
  25. Mao, H.; Netravali, R.; Alizadeh, M. Neural Adaptive Video Streaming with Pensieve. In Proceedings of the ACM SIGCOMM Conference, Los Angeles, CA, USA, 21–25 August 2017; pp. 197–210. [Google Scholar]
  26. Xu, S.; Nikravesh, A.; Mao, Z.M. Leveraging Context-Triggered Measurements to Characterize LTE Handover Performance. In Proceedings of the Passive and Active Measurement Conference (PAM), Puerto Varas, Chile, 27–29 March 2019; pp. 3–17. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Article Metrics

Citations

Article Access Statistics

Multiple requests from the same IP address are counted as one view.