Skip to main content
. 2026 Jun 1;11(6):381. doi: 10.3390/biomimetics11060381
Algorithm 1 Procedure of the SA-BLDA Algorithm
  • Require: Minimum and maximum stimulation rounds Lmin=4, Lmax=8; decision threshold θ0=0.2

  • Ensure: Predicted target umax

  •   1:

    Initialize i=1, Li=1, and Δθ=0

  •   2:

    Obtain the initial feature vector fi and feature matrix Fi

  •   3:

    while Li≤Lmax do

  •   4:

        Update the averaged feature vector fi=1i∑m=1ifi,m and feature matrix Fi

  •   5:

        if Li≥Lmin then

  •   6:

            Apply BLDA to Fi and obtain the regression score vector u

  •   7:

            Identify the maximum score umax and the second-largest score usec

  •   8:

            Compute the confidence difference Δθ=umax−usec

  •   9:

            if Δθ≥θ0 or Li=Lmax then

  • 10:

               Output umax as the predicted target

  • 11:

               break

  • 12:

            end if

  • 13:

        end if

  • 14:

        Update the stimulation round Li+1=Li+1

  • 15:

        Set i=i+1

  • 16:

    end while