diagonal_init
ReservoirComputing.diagonal_init — Function
diagonal_init([rng], [T], dims...;
return_sparse=false, weight=randn,
kwargs...)Creates a diagonal reservoir (Fette and Eggert, 2005).
Arguments
rng: Random number generator. Default isUtils.default_rng()from WeightInitializers.T: Type of the elements in the reservoir matrix. Default isFloat32.dims: Dimensions of the reservoir matrix.
Keyword arguments
weight: Weight used for the initial self-loop initialization. Can be a single number, vector, or function to generate an array. Default israndn.return_sparse: flag for returning asparsematrix.truerequiresSparseArraysto be loaded. Default isfalse.return_diag: flag for returning aDiagonalmatrix. If bothreturn_diagandreturn_sparseare set totruepriority is given toreturn_diag. Default isfalse.radius: The desired spectral radius of the reservoir. Ifnothingis passed, no scaling takes place. Defaults tonothing.sampling_type: Sampling that decides the distribution ofweightnegative numbers. If set to:no_samplethe sign is unchanged. If set to:bernoulli_sample!then eachforward_weightcan be positive with a probability set bypositive_prob. If set to:irrational_sample!theweightis negative if the decimal number of the irrational number chosen is odd. If set to:regular_sample!, each weight will be assigned a negative sign after the chosenstrides.stridescan be a single number or an array. Default is:no_sample.positive_prob: probability of theweightbeing positive whensampling_typeis set to:bernoulli_sample!. Default is 0.5.irrational: Irrational number whose decimals decide the sign ofweight. Default ispi.start: Which place after the decimal point the counting starts for theirrationalsign counting. Default is 1.strides: number of strides for assigning negative value to a weight. It can be an integer or an array. Default is 2.
Examples
Default kwargs:
julia> rr = diagonal_init(5, 5)
5×5 Matrix{Float32}:
-0.359729 0.0 0.0 0.0 0.0
0.0 1.08721 0.0 0.0 0.0
0.0 0.0 -0.41959 0.0 0.0
0.0 0.0 0.0 0.71891 0.0
0.0 0.0 0.0 0.0 0.420247Changing the weights magnitudes to a different unique value:
julia> rr = diagonal_init(5, 5; weight=0.1)
5×5 Matrix{Float32}:
0.1 0.0 0.0 0.0 0.0
0.0 0.1 0.0 0.0 0.0
0.0 0.0 0.1 0.0 0.0
0.0 0.0 0.0 0.1 0.0
0.0 0.0 0.0 0.0 0.1Changing the weights signs with different sampling techniques:
Changing the weights to random numbers. Note that the length of the given array must be at least as long as the subdiagonal one wants to fill:
julia> rr = diagonal_init(5, 5; weight=0.1, sampling_type=:bernoulli_sample!)
5×5 Matrix{Float32}:
0.1 0.0 0.0 0.0 0.0
0.0 -0.1 0.0 0.0 0.0
0.0 0.0 0.1 0.0 0.0
0.0 0.0 0.0 -0.1 0.0
0.0 0.0 0.0 0.0 0.1
julia> rr = diagonal_init(5, 5; weight=0.1, sampling_type=:irrational_sample!)
5×5 Matrix{Float32}:
-0.1 0.0 0.0 0.0 0.0
0.0 0.1 0.0 0.0 0.0
0.0 0.0 -0.1 0.0 0.0
0.0 0.0 0.0 -0.1 0.0
0.0 0.0 0.0 0.0 -0.1Returning a sparse matrix:
julia> using SparseArrays
julia> rr = diagonal_init(5, 5; return_sparse=true)
5×5 SparseMatrixCSC{Float32, Int64} with 5 stored entries:
-0.359729 ⋅ ⋅ ⋅ ⋅
⋅ 1.08721 ⋅ ⋅ ⋅
⋅ ⋅ -0.41959 ⋅ ⋅
⋅ ⋅ ⋅ 0.71891 ⋅
⋅ ⋅ ⋅ ⋅ 0.420247Returning a diagonal matrix:
julia> rr = diagonal_init(5, 5; return_diag=true)
5×5 LinearAlgebra.Diagonal{Float32, Vector{Float32}}:
-0.359729 ⋅ ⋅ ⋅ ⋅
⋅ 1.08721 ⋅ ⋅ ⋅
⋅ ⋅ -0.41959 ⋅ ⋅
⋅ ⋅ ⋅ 0.71891 ⋅
⋅ ⋅ ⋅ ⋅ 0.420247References
- Fette, G. and Eggert, J. (2005). Short Term Memory and Pattern Matching with Simple Echo State Networks. In: Artificial Neural Networks: Biological Inspirations – ICANN 2005 (Springer Berlin Heidelberg); pp. 13–18.