All Downloads are FREE. Search and download functionalities are using the official Maven repository.

org.nd4j.linalg.api.ops.impl.layers.recurrent.config.LSTMCellConfiguration Maven / Gradle / Ivy

There is a newer version: 1.0.0-M2.1
Show newest version
/*******************************************************************************
 * Copyright (c) 2015-2018 Skymind, Inc.
 *
 * This program and the accompanying materials are made available under the
 * terms of the Apache License, Version 2.0 which is available at
 * https://www.apache.org/licenses/LICENSE-2.0.
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. See the
 * License for the specific language governing permissions and limitations
 * under the License.
 *
 * SPDX-License-Identifier: Apache-2.0
 ******************************************************************************/

package org.nd4j.linalg.api.ops.impl.layers.recurrent.config;

import lombok.Builder;
import lombok.Data;
import org.nd4j.autodiff.samediff.SDVariable;
import org.nd4j.linalg.util.ArrayUtil;

import java.util.LinkedHashMap;
import java.util.Map;

@Builder
@Data
public class LSTMCellConfiguration {
    /**
     *   NDArray* xt   = INPUT_VARIABLE(0);                   // input [batchSize x inSize]
     NDArray* ht_1 = INPUT_VARIABLE(1);                   // previous cell output [batchSize x numProj],  that is at previous time step t-1, in case of projection=false -> numProj=numUnits!!!
     NDArray* ct_1 = INPUT_VARIABLE(2);                   // previous cell state  [batchSize x numUnits], that is at previous time step t-1

     NDArray* Wx   = INPUT_VARIABLE(3);                   // input-to-hidden  weights, [inSize  x 4*numUnits]
     NDArray* Wh   = INPUT_VARIABLE(4);                   // hidden-to-hidden weights, [numProj x 4*numUnits]
     NDArray* Wc   = INPUT_VARIABLE(5);                   // diagonal weights for peephole connections [1 x 3*numUnits]
     NDArray* Wp   = INPUT_VARIABLE(6);                   // projection weights [numUnits x numProj]
     NDArray* b    = INPUT_VARIABLE(7);                   // biases, [1 x 4*numUnits]

     NDArray* ht   =  OUTPUT_VARIABLE(0);                  // current cell output [batchSize x numProj], that is at current time step t
     NDArray* ct   =  OUTPUT_VARIABLE(1);                  // current cell state  [batchSize x numUnits], that is at current time step t

     const bool peephole   = (bool)INT_ARG(0);               // if true, provide peephole connections
     const bool projection = (bool)INT_ARG(1);               // if true, then projection is performed, if false then numProj==numUnits is mandatory!!!!
     T clippingCellValue   = T_ARG(0);                       // clipping value for ct, if it is not equal to zero, then cell state is clipped
     T clippingProjValue   = T_ARG(1);                       // clipping value for projected ht, if it is not equal to zero, then projected cell output is clipped
     const T forgetBias    = T_ARG(2);

     */

    private boolean peepHole;
    private boolean projection;
    private double clippingCellValue;
    private double clippingProjValue;
    private double forgetBias;
    //input variables
    private SDVariable xt,ht_1,ct_1,Wx,Wh,Wc,Wp,b;

    public Map toProperties()  {
        Map ret = new LinkedHashMap<>();
        ret.put("peepHole",peepHole);
        ret.put("projection",projection);
        ret.put("clippingCellValue",clippingCellValue);
        ret.put("clippingProjValue",clippingProjValue);
        ret.put("forgetBias",forgetBias);
        return ret;
    }


    public SDVariable[] args()  {
        return new SDVariable[] {xt,ht_1,ct_1,Wx,Wh,Wc,Wp,b};
    }


    public int[] iArgs() {
        return new int[] {ArrayUtil.fromBoolean(peepHole),ArrayUtil.fromBoolean(projection)};
    }

    public double[] tArgs() {
        return new double[] {clippingCellValue,clippingProjValue,forgetBias};
    }


}




© 2015 - 2024 Weber Informatics LLC | Privacy Policy