How overlapping chunk boundaries are reconciled in Streaming mode.

Overview

StreamingLowess processes data in fixed-size chunks with a configurable overlap. Points inside the overlap zone are fitted twice — once by the left chunk and once by the right chunk. MergeStrategy decides how those two estimates are combined into a single output value.

Chunk A:   [=========|=====]
Chunk B:            [=====|=========]
Overlap:            [=====]
                      ^
                MergeStrategy
                applied here
StrategyMethodRobustnessSpeed
"average"Simple mean of both estimatesLowFastest
"take_first"Left-chunk estimate onlyLowFastest
"take_last"Right-chunk estimate onlyLowFastest
"weighted_average"Distance-weighted meanHighModerate

Merge Strategies


Average

Takes the arithmetic mean of the left-chunk and right-chunk estimates in the overlap region. Fast and sufficient when both chunks have similar smoothing quality.

Use when: Chunks are large and the overlap region has uniform data density.

package main

import (
 "fmt"
 "log"
 "math"

 "github.com/thisisamirv/lowess-project/bindings/go/fastlowess/v5"
)

func main() {
 n := 100
 x := make([]float64, n)
 y := make([]float64, n)
 for i := 0; i < n; i++ {
  x[i] = float64(i) * 2 * math.Pi / float64(n-1)
  y[i] = math.Sin(x[i]) + 0.1
 }

 opts := fastlowess.DefaultStreamingOptions()
 opts.MergeStrategy = "average"

 model, err := fastlowess.NewStreamingLowess(opts)
 if err != nil {
  log.Fatal(err)
 }
 defer model.Close()

 if _, err := model.ProcessChunk(x[:50], y[:50]); err != nil {
  log.Fatal(err)
 }
 if _, err := model.ProcessChunk(x[50:], y[50:]); err != nil {
  log.Fatal(err)
 }
 result, err := model.Finalize()
 if err != nil {
  log.Fatal(err)
 }
 fmt.Println("First smoothed value (average merge):", result.Y[0])
}
First smoothed value (average merge): 0.38088390025381585

Take First

Keeps only the left-chunk estimate in the overlap zone and discards the right-chunk estimate. Produces a definitive, non-revised output as soon as the right boundary of each chunk is reached.

Use when: You need final output values immediately after each chunk (no look-ahead revision); left-chunk data quality is higher.

package main

import (
 "fmt"
 "log"
 "math"

 "github.com/thisisamirv/lowess-project/bindings/go/fastlowess/v5"
)

func main() {
 n := 100
 x := make([]float64, n)
 y := make([]float64, n)
 for i := 0; i < n; i++ {
  x[i] = float64(i) * 2 * math.Pi / float64(n-1)
  y[i] = math.Sin(x[i]) + 0.1
 }

 opts := fastlowess.DefaultStreamingOptions()
 opts.MergeStrategy = "take_first"

 model, err := fastlowess.NewStreamingLowess(opts)
 if err != nil {
  log.Fatal(err)
 }
 defer model.Close()

 if _, err := model.ProcessChunk(x[:50], y[:50]); err != nil {
  log.Fatal(err)
 }
 if _, err := model.ProcessChunk(x[50:], y[50:]); err != nil {
  log.Fatal(err)
 }
 result, err := model.Finalize()
 if err != nil {
  log.Fatal(err)
 }
 fmt.Println("First smoothed value (take_first merge):", result.Y[0])
}
First smoothed value (take_first merge): 0.38088390025381585

Take Last

Keeps only the right-chunk estimate in the overlap zone. The right chunk sees more of the surrounding data, so its fit can be more accurate near the left boundary of the new chunk.

Use when: Right-chunk context improves overlap quality; you are post-processing complete data rather than streaming live.

package main

import (
 "fmt"
 "log"
 "math"

 "github.com/thisisamirv/lowess-project/bindings/go/fastlowess/v5"
)

func main() {
 n := 100
 x := make([]float64, n)
 y := make([]float64, n)
 for i := 0; i < n; i++ {
  x[i] = float64(i) * 2 * math.Pi / float64(n-1)
  y[i] = math.Sin(x[i]) + 0.1
 }

 opts := fastlowess.DefaultStreamingOptions()
 opts.MergeStrategy = "take_last"

 model, err := fastlowess.NewStreamingLowess(opts)
 if err != nil {
  log.Fatal(err)
 }
 defer model.Close()

 if _, err := model.ProcessChunk(x[:50], y[:50]); err != nil {
  log.Fatal(err)
 }
 if _, err := model.ProcessChunk(x[50:], y[50:]); err != nil {
  log.Fatal(err)
 }
 result, err := model.Finalize()
 if err != nil {
  log.Fatal(err)
 }
 fmt.Println("First smoothed value (take_last merge):", result.Y[0])
}
First smoothed value (take_last merge): 0.38088390025381585

Weighted Average

Assigns each overlap point a weight proportional to its proximity to the centre of its respective chunk: points near the left-chunk centre get higher left weight; points near the right-chunk centre get higher right weight. This produces the smoothest transition across chunk boundaries.

$$\hat{y} = \frac{w_L \hat{y}_L + w_R \hat{y}_R}{w_L + w_R}$$

where $w_L$ and $w_R$ are linear distance weights from the chunk centres.

Use when: Minimising boundary artefacts is more important than speed; moderate overlap (10–20% of chunk size).

package main

import (
 "fmt"
 "log"
 "math"

 "github.com/thisisamirv/lowess-project/bindings/go/fastlowess/v5"
)

func main() {
 n := 100
 x := make([]float64, n)
 y := make([]float64, n)
 for i := 0; i < n; i++ {
  x[i] = float64(i) * 2 * math.Pi / float64(n-1)
  y[i] = math.Sin(x[i]) + 0.1
 }

 opts := fastlowess.DefaultStreamingOptions()
 opts.MergeStrategy = "weighted_average" // Default

 model, err := fastlowess.NewStreamingLowess(opts)
 if err != nil {
  log.Fatal(err)
 }
 defer model.Close()

 if _, err := model.ProcessChunk(x[:50], y[:50]); err != nil {
  log.Fatal(err)
 }
 if _, err := model.ProcessChunk(x[50:], y[50:]); err != nil {
  log.Fatal(err)
 }
 result, err := model.Finalize()
 if err != nil {
  log.Fatal(err)
 }
 fmt.Println("First smoothed value (weighted_average merge):", result.Y[0])
}
First smoothed value (weighted_average merge): 0.38088390025381585

Choosing a Strategy

SituationRecommended Strategy
General purpose"weighted_average"
Maximum throughput"average"
Immediate finalised output"take_first"
Post-processing, right context better"take_last"
Minimising boundary artefacts"weighted_average"

Overlap size matters: A larger overlap gives the merge strategy more room to blend, reducing boundary artefacts regardless of the strategy chosen. A good starting point is 10% of ChunkSize.