MARLINE: Transfer Learning in Non-Stationary Streams

• MARLINE is a transfer-learning framework that projects target examples into multiple source concept spaces without requiring similar source models.
• It dynamically weights ensemble predictions through geometric mapping and performance evaluation to adapt to evolving, non-stationary environments.
• Empirical evaluations demonstrate that MARLINE achieves faster adaptation and higher accuracy in both synthetic and real-world data streams compared to traditional methods.

MARLINE, short for Multi-source mApping with tRansfer LearnIng for Non-stationary Environments, is a transfer-learning method for online data streams affected by concept drift. It is designed for settings in which the joint data distribution $p(x, y)$ evolves over time and labeled target examples may be scarce immediately after drift or at stream onset. Its defining feature is that it does not require any source model to represent a concept similar to the current target concept. Instead, MARLINE projects the target concept into the space of each source concept and combines the resulting source sub-classifiers in a dynamically weighted ensemble, allowing knowledge transfer even when source and target concepts do not match (Du et al., 9 Sep 2025).

1. Problem setting and motivation

Non-stationary environments in data stream learning are characterized by concept drift, meaning that the predictive relationship between features and labels changes over time. In such settings, model performance can degrade rapidly, especially when only a small number of target-labeled examples are available after a drift. MARLINE addresses this regime directly by coupling online adaptation with multi-source transfer (Du et al., 9 Sep 2025).

A central motivation for MARLINE is the limitation of earlier multi-source transfer approaches in streaming contexts. Prior methods such as MSCRDR, COMC, and Melanie assume that at least one source domain is similar to the target. According to the paper, this assumption may fail in many real-world scenarios. These methods are therefore limited when $\mathcal{D}_{S_i} \neq \mathcal{D}_T$ or $\mathcal{T}_{S_i} \neq \mathcal{T}_T$, and many were designed for fixed, off-line datasets rather than real-time streams in which new concepts can arise at any time (Du et al., 9 Sep 2025).

Within that context, MARLINE is presented as the first method to effectively leverage multiple, arbitrarily different source domains and streams—even without source-target concept similarity. This suggests a reframing of transfer in data streams: instead of searching for a matching source concept, the method constructs transformations that allow disparate source concepts to remain useful.

2. Concept representation, stream structure, and drift handling

MARLINE organizes learning around streams, concepts, and ensembles. Let $S_n$ denote the $n$-th source stream and $T$ the target stream. Each concept is represented by an independently trained online ensemble $H_i^j$, where $i$ indexes the stream and $j$ the detected concept within that stream. Each ensemble contains $K$ sub-classifiers $\mathcal{D}_{S_i} \neq \mathcal{D}_T$0, and $\mathcal{D}_{S_i} \neq \mathcal{D}_T$1 denotes the number of concepts detected for stream $\mathcal{D}_{S_i} \neq \mathcal{D}_T$2 (Du et al., 9 Sep 2025).

This representation makes MARLINE continually adaptive. Each source or target concept is maintained as its own ensemble, and concept drift detection is used to decide when a new concept should be instantiated. The paper states that standard drift detectors such as DDM and HDDM$\mathcal{D}_{S_i} \neq \mathcal{D}_T$3 can be used. When drift is detected in stream $\mathcal{D}_{S_i} \neq \mathcal{D}_T$4, a new ensemble $\mathcal{D}_{S_i} \neq \mathcal{D}_T$5 is created and centroids for the new concept are updated (Du et al., 9 Sep 2025).

The consequence is that MARLINE retains structured memory over previously observed concepts without storing all past data. The paper explicitly notes that capacity scales linearly with the number of concept ensembles and remains manageable because the method relies on centroids rather than full historical storage. A plausible implication is that MARLINE is aimed at long-running stream settings in which concept recurrence and partial re-use of prior structure are important.

3. Target-to-source mapping by geometric projection

The core innovation of MARLINE is its target-to-source mapping. For a target instance $\mathcal{D}_{S_i} \neq \mathcal{D}_T$6, the method projects the current target concept into the space of each source concept $\mathcal{D}_{S_i} \neq \mathcal{D}_T$7, allowing each source ensemble to make a prediction in a concept-aligned representation (Du et al., 9 Sep 2025).

For each concept $\mathcal{D}_{S_i} \neq \mathcal{D}_T$8, class centroids $\mathcal{D}_{S_i} \neq \mathcal{D}_T$9 are computed for $\mathcal{T}_{S_i} \neq \mathcal{T}_T$0: $\mathcal{T}_{S_i} \neq \mathcal{T}_T$1 The method then defines connecting vectors between class centroids: $\mathcal{T}_{S_i} \neq \mathcal{T}_T$2

These vectors induce a geometric alignment between the target concept and a source concept. The paper defines unit vectors

$\mathcal{T}_{S_i} \neq \mathcal{T}_T$3

and then computes a transformation matrix $\mathcal{T}_{S_i} \neq \mathcal{T}_T$4, described as a reflection/rotation transform in Eqs. 3–7 of the paper. Using this transform, the target example is projected as

$\mathcal{T}_{S_i} \neq \mathcal{T}_T$5

$\mathcal{T}_{S_i} \neq \mathcal{T}_T$6

This construction enables every source ensemble to classify a mapped target instance in its own concept space. The paper’s central claim is that this is what allows MARLINE to benefit from multiple data sources even when source and target concepts do not match. A common misconception is that effective multi-source transfer in streams requires at least one aligned source concept; MARLINE is explicitly proposed to remove that requirement (Du et al., 9 Sep 2025).

4. Dynamic ensemble weighting and online prediction

After projection, MARLINE aggregates predictions from all active sub-classifiers across source and target concept ensembles. The aggregation is not uniform: each sub-classifier is weighted by its recent performance on projected target data (Du et al., 9 Sep 2025).

For each sub-classifier $\mathcal{T}_{S_i} \neq \mathcal{T}_T$7, MARLINE maintains a performance score

$\mathcal{T}_{S_i} \neq \mathcal{T}_T$8

where $\mathcal{T}_{S_i} \neq \mathcal{T}_T$9 and $S_n$0 are soft counts, weighted by classifier confidence on correctly and incorrectly classified target examples. The normalized voting weight is then

$S_n$1

with $S_n$2 a performance threshold.

Prediction is performed by weighted majority voting over all active sub-classifiers, each operating on its own mapped projection $S_n$3. The algorithmic workflow summarized from Algorithm 1 is: update or add ensembles when a stream is new or drifts; update centroids and learn via base ensemble methods such as online bagging or boosting; upon each target example, reweight sub-classifiers using mapped projections; and, at inference time, project the target instance into all relevant concept spaces and combine predictions using the learned weights (Du et al., 9 Sep 2025).

The complexity analysis is given explicitly. For a target example, training time is

$S_n$4

while prediction time is

$S_n$5

Here, $S_n$6 is the drift-detection cost, $S_n$7 the base-ensemble training cost, $S_n$8 the single-classifier prediction cost, and $S_n$9 the number of distinct concepts detected in source stream $n$0. The paper characterizes this as linear scaling in the number of concept ensembles (Du et al., 9 Sep 2025).

5. Empirical evaluation and observed behavior

The empirical study uses both synthetic and real-world datasets. The artificial data consist of simulated streams with similar and non-similar sources, binary Gaussian classes, three concept-drift scenarios—none, abrupt, and incremental—and class sizes of 50, 500, and 5000. The real-world evaluation uses London and Washington D.C. bikesharing datasets with three classification scenarios based on weekend, weekday, and holiday splits, intended to mimic diverse target and source environments and different stream sizes (Du et al., 9 Sep 2025).

The comparative methods include MARLINE (with/without sources), Melanie, Adaptive Random Forest, DWM, Online Bagging/Boosting, and variants with drift detection. All methods use Hoeffding Tree learners and are tuned via grid search (Du et al., 9 Sep 2025).

The reported results distinguish between aligned and non-aligned transfer regimes. In non-similar source settings, MARLINE with sources achieves top or near-top accuracy in nearly all scenarios and robustly outperforms Melanie and non-transfer baselines. In similar source settings, Melanie may perform best in highly aligned cases, but MARLINE remains competitive and sometimes outperforms it. On the real-world bikesharing data, MARLINE with sources maintains the highest accuracy across all evaluated datasets (Du et al., 9 Sep 2025).

The paper further reports that MARLINE demonstrates faster and more accurate adaptation post-drift and at early learning stages, which is described as especially important in rare-label regimes and sudden environment shifts. Source classifier weights, including past-target ensembles, can rise after a drift to account for nearly half of the total ensemble vote. Hyperparameter sensitivity results indicate that performance improves with moderate or large ensemble sizes ($n$1), moderate performance thresholds ($n$2), and a forgetting factor in the range $n$3 in non-stationary settings (Du et al., 9 Sep 2025).

6. Interpretation, scope, and distinction from similarly named systems

MARLINE is most directly applicable when target data are scarce, when concept drift has just occurred, and when available sources are substantially different from the target domain. The paper lists example application classes including fraud detection, event-driven demand prediction, and software effort estimation across organizations. This suggests that the method is intended less for classical batch domain adaptation and more for incremental decision systems that must remain accurate under evolving conditions (Du et al., 9 Sep 2025).

Its principal methodological claim is not that dissimilar sources are intrinsically predictive, but that they can become useful after geometric remapping into source-specific concept spaces. That claim also clarifies a second common misunderstanding: MARLINE is not merely a weighted ensemble over multiple source models. The weighting is downstream of an explicit projection step, and the projections themselves are concept-specific.

The acronym can also be confused with several unrelated systems. MARLIN refers to multi-agent reinforcement learning frameworks for language-based inter-robot negotiation (Godfrey et al., 2024) and reservoir management with murmuration intelligence and LLM guidance (Fu et al., 29 Sep 2025). MARLIM denotes a reinforcement-learning framework for inventory management (Leluc et al., 2023). MARLEY is a Monte Carlo event generator for low-energy neutrino interactions (Gardiner, 2021). EcoFair-CH-MARL concerns constrained hierarchical multi-agent reinforcement learning for maritime logistics (Alqithami, 15 Mar 2026). These systems share overlapping acronymic structure but address different technical problems.

Within online transfer learning for data streams, MARLINE’s main significance lies in shifting the operative assumption from source similarity to source usability after mapping. A plausible implication is that it broadens the feasible operating regime of transfer learning in non-stationary environments, particularly when no source stream is an obvious surrogate for the target.