Subrandom Projections

Subrandom Projections

Performing random sign flips on natural data like images before many types of fast transform such as the FFT or WHT gives Gaussian noise outputs. 

Essentially the sign flips convert the input data to a collection of random variables that then get weighted, summed and differenced by the fast transform giving Gaussian noise by the Central Limit Theorem.

Another way of stating the situation is that random sign flips combined with fast transforms create Random Projections (RPs) of the input data.

While such RPs have many uses there are some disadvantages such as the complete loss of direct rotation, scaling and translation (RST) information about objects in the orignal image. 

It would be nice if some of that RST information was kept along with some of the nice information distribution properties of Random Projections.

One solution to the problem is to use subrandom (low discrepancy) numbers to decide the sign flips.

For example, Additive Recurrence based Subrandom Numbers are a good choice.

Additive Recurrence Wiki

1. An input image. 2. Subrandom sign flips. 3. A random projection of the input image. 4. A subrandom projection of the input image.


Some example code:

https://editor.p5js.org/siobhan.491/sketches/kzJwiLxUD

Use Cases

A possible use case is as cheap alternative to convolution in the first layer of an artificial neural network or for any application where you want to distribute the input information while still preserving location and RST information.

Reference Booklet







Comments

  1. AI462May 2, 2023 at 7:16 PM

    A better example with a bit more sub-randomness: https://editor.p5js.org/siobhan.491/sketches/0_enDef3K

    ReplyDelete
  2. AI462May 11, 2023 at 3:44 PM

    Example with additive recurrence and xor shift: https://editor.p5js.org/siobhan.491/sketches/0_enDef3K

    ReplyDelete

Post a Comment

Popular posts from this blog

Switch Net

Image
 Switch Net Switch Net. Switch Net is a neural network based on using the fast Walsh Hadamard tranform (WHT) as a fixed set of layer weights with a parametric switching based activation function. The cost of the WHT is nlog2(n) add subtracts as opposed to n squared fused multiply adds for a conventional dense neural layer's weight calculations. A fixed random pattern of sign flips is applied to the input data so that the first WHT fairly distributes information with a Gaussian distribution across its outputs. Then a switching decision is applied to each output of the WHT and the output is multiplied by one weight or another.  The section between the red lines is basically a layer and can be repeated a number of times. A final WHT is done to combine the last lot of switched weight outputs. Some example code is here: https://editor.p5js.org/congchuatocmaydangyeu7/sketches/7ekZTwQMF One slight issue is if the switching weights for a particular output have opposite signs then the resul
Read more

Switch Net 4 (Switch Net N) Combine multiple low width neural layers with a fast transform.

Image
 Switch Net 4  Switch Net 4. Random sign flipping before a fast Walsh Hadamard transform results in a Random Projection. For almost any input the result is a Gaussian distributed output vector where each output element contains knowledge of all the input elements. With Switch Net 4 the output elements are 2-way switched using (x<0?) as a switching predicate. Where x is the input to the switch.  The switches are grouped together in units of 4 which together form a small width 4 neural. When a particualr x>=0, the pattern in the selected pattern of weights is forward projected with intensity x. When x<0 a different pattern of forward selected weights is again projected with intensity x (x being negative this time.) If nothing was projected when x<0 then the situation would be identical to using a ReLU. You could view the situation in Switch Net 4 as using 2 ReLUs one with input x and one with input -x.  The reason to 2-way switch (or +- ReLU) is to avoid early information los
Read more

Artificial Neural Networks

Image
Artificial neural networks An artificial neuron. The basic behavior of an artificial neural network is determined by the dot product (weighted sum) operator in each neuron. This also has a geometric interpretation. The dot product of A and B is the magnitude (vector length) of vector A by the magnitude of vector B by the cosine of the angle between them.  Dot product video. To understand information storage in a weighted sum it helps to know the central limit theorem. Statistical properties of the dot product. The central limit theorem. If you store 1 <vector,scalar> association in a weighed sum the weight vector will point in the same direction as the input vector. Store 2 <vector,scalar> associations and both input vectors will point some angle away from the weight vector. As a result the scalar output will be more sensitive to small changes in the input vectors. A reduction in an initial mild error correction capacity. If yo
Read more