Per kernel Kmeans compression for neural networks

    公开(公告)号:US11055604B2

    公开(公告)日:2021-07-06

    申请号:US15702193

    申请日:2017-09-12

    Abstract: Methods and apparatus relating to techniques for incremental network quantization. In an example, an apparatus comprises logic, at least partially comprising hardware logic to determine a plurality of weights for a layer of a convolutional neural network (CNN) comprising a plurality of kernels; organize the plurality of weights into a plurality of clusters for the plurality of kernels; and apply a K-means compression algorithm to each of the plurality of clusters. Other embodiments are also disclosed and claimed.

    ONLINE ACTIVATION COMPRESSION WITH K-MEANS
    2.
    发明申请

    公开(公告)号:US20190102673A1

    公开(公告)日:2019-04-04

    申请号:US15720298

    申请日:2017-09-29

    Abstract: Methods and apparatus relating to online activation compression with K-means are described. In one embodiment, logic (e.g., in a processor) compresses one or more activation functions for a convolutional network based on non-uniform quantization. The non-uniform quantization for each layer of the convolutional network is performed offline, and an activation function for a specific layer of the convolutional network is quantized during runtime. Other embodiments are also disclosed and claimed.

    TECHNIQUES FOR DETERMINING ARTIFICIAL NEURAL NETWORK TOPOLOGIES

    公开(公告)号:US20190042917A1

    公开(公告)日:2019-02-07

    申请号:US16014495

    申请日:2018-06-21

    Abstract: Various embodiments are generally directed to techniques for determining artificial neural network topologies, such as by utilizing probabilistic graphical models, for instance. Some embodiments are particularly related to determining neural network topologies by bootstrapping a graph, such as a probabilistic graphical model, into a multi-graphical model, or graphical model tree. Various embodiments may include logic to determine a collection of sample sets from a dataset. In various such embodiments, each sample set may be drawn randomly for the dataset with replacement between drawings. In some embodiments, logic may partition a graph into multiple subgraph sets based on each of the sample sets. In several embodiments, the multiple subgraph sets may be scored, such as with Bayesian statistics, and selected amongst as part of determining a topology for a neural network.

Patent Agency Ranking