qoa 0.0.1

checksums.yaml

@@ -0,0 +1,7 @@
+---
+SHA256:
+  metadata.gz: e77f61af824088258ddbbe792ff87b1b068f1a98018aa8f1e8632a566c988b00
+  data.tar.gz: '0749da84fe9312c2f34ea00a56b3e0a58dd12af41ccb5abd9db13d144c1799ca'
+SHA512:
+  metadata.gz: 7c3bed59d35246abcd4ae32b4f4ecad352bc3834d01ef2d08e07fb2e60686c2cf906211e0bcee9741413e17ad8164d9b6e2bbb28c2a9d987e61d9b92afc40881
+  data.tar.gz: 01f25c01f8bfee1ade459953983bfc2425ca544288ac400870b5a0820f61dfc54620c36f504d909499485efab68c12028e0137c3e6cacd3654b774c8f2384a76

data/LICENSE

@@ -0,0 +1,201 @@
+                                 Apache License
+                           Version 2.0, January 2004
+                        http://www.apache.org/licenses/
+
+   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
+
+   1. Definitions.
+
+      "License" shall mean the terms and conditions for use, reproduction,
+      and distribution as defined by Sections 1 through 9 of this document.
+
+      "Licensor" shall mean the copyright owner or entity authorized by
+      the copyright owner that is granting the License.
+
+      "Legal Entity" shall mean the union of the acting entity and all
+      other entities that control, are controlled by, or are under common
+      control with that entity. For the purposes of this definition,
+      "control" means (i) the power, direct or indirect, to cause the
+      direction or management of such entity, whether by contract or
+      otherwise, or (ii) ownership of fifty percent (50%) or more of the
+      outstanding shares, or (iii) beneficial ownership of such entity.
+
+      "You" (or "Your") shall mean an individual or Legal Entity
+      exercising permissions granted by this License.
+
+      "Source" form shall mean the preferred form for making modifications,
+      including but not limited to software source code, documentation
+      source, and configuration files.
+
+      "Object" form shall mean any form resulting from mechanical
+      transformation or translation of a Source form, including but
+      not limited to compiled object code, generated documentation,
+      and conversions to other media types.
+
+      "Work" shall mean the work of authorship, whether in Source or
+      Object form, made available under the License, as indicated by a
+      copyright notice that is included in or attached to the work
+      (an example is provided in the Appendix below).
+
+      "Derivative Works" shall mean any work, whether in Source or Object
+      form, that is based on (or derived from) the Work and for which the
+      editorial revisions, annotations, elaborations, or other modifications
+      represent, as a whole, an original work of authorship. For the purposes
+      of this License, Derivative Works shall not include works that remain
+      separable from, or merely link (or bind by name) to the interfaces of,
+      the Work and Derivative Works thereof.
+
+      "Contribution" shall mean any work of authorship, including
+      the original version of the Work and any modifications or additions
+      to that Work or Derivative Works thereof, that is intentionally
+      submitted to Licensor for inclusion in the Work by the copyright owner
+      or by an individual or Legal Entity authorized to submit on behalf of
+      the copyright owner. For the purposes of this definition, "submitted"
+      means any form of electronic, verbal, or written communication sent
+      to the Licensor or its representatives, including but not limited to
+      communication on electronic mailing lists, source code control systems,
+      and issue tracking systems that are managed by, or on behalf of, the
+      Licensor for the purpose of discussing and improving the Work, but
+      excluding communication that is conspicuously marked or otherwise
+      designated in writing by the copyright owner as "Not a Contribution."
+
+      "Contributor" shall mean Licensor and any individual or Legal Entity
+      on behalf of whom a Contribution has been received by Licensor and
+      subsequently incorporated within the Work.
+
+   2. Grant of Copyright License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      copyright license to reproduce, prepare Derivative Works of,
+      publicly display, publicly perform, sublicense, and distribute the
+      Work and such Derivative Works in Source or Object form.
+
+   3. Grant of Patent License. Subject to the terms and conditions of
+      this License, each Contributor hereby grants to You a perpetual,
+      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
+      (except as stated in this section) patent license to make, have made,
+      use, offer to sell, sell, import, and otherwise transfer the Work,
+      where such license applies only to those patent claims licensable
+      by such Contributor that are necessarily infringed by their
+      Contribution(s) alone or by combination of their Contribution(s)
+      with the Work to which such Contribution(s) was submitted. If You
+      institute patent litigation against any entity (including a
+      cross-claim or counterclaim in a lawsuit) alleging that the Work
+      or a Contribution incorporated within the Work constitutes direct
+      or contributory patent infringement, then any patent licenses
+      granted to You under this License for that Work shall terminate
+      as of the date such litigation is filed.
+
+   4. Redistribution. You may reproduce and distribute copies of the
+      Work or Derivative Works thereof in any medium, with or without
+      modifications, and in Source or Object form, provided that You
+      meet the following conditions:
+
+      (a) You must give any other recipients of the Work or
+          Derivative Works a copy of this License; and
+
+      (b) You must cause any modified files to carry prominent notices
+          stating that You changed the files; and
+
+      (c) You must retain, in the Source form of any Derivative Works
+          that You distribute, all copyright, patent, trademark, and
+          attribution notices from the Source form of the Work,
+          excluding those notices that do not pertain to any part of
+          the Derivative Works; and
+
+      (d) If the Work includes a "NOTICE" text file as part of its
+          distribution, then any Derivative Works that You distribute must
+          include a readable copy of the attribution notices contained
+          within such NOTICE file, excluding those notices that do not
+          pertain to any part of the Derivative Works, in at least one
+          of the following places: within a NOTICE text file distributed
+          as part of the Derivative Works; within the Source form or
+          documentation, if provided along with the Derivative Works; or,
+          within a display generated by the Derivative Works, if and
+          wherever such third-party notices normally appear. The contents
+          of the NOTICE file are for informational purposes only and
+          do not modify the License. You may add Your own attribution
+          notices within Derivative Works that You distribute, alongside
+          or as an addendum to the NOTICE text from the Work, provided
+          that such additional attribution notices cannot be construed
+          as modifying the License.
+
+      You may add Your own copyright statement to Your modifications and
+      may provide additional or different license terms and conditions
+      for use, reproduction, or distribution of Your modifications, or
+      for any such Derivative Works as a whole, provided Your use,
+      reproduction, and distribution of the Work otherwise complies with
+      the conditions stated in this License.
+
+   5. Submission of Contributions. Unless You explicitly state otherwise,
+      any Contribution intentionally submitted for inclusion in the Work
+      by You to the Licensor shall be under the terms and conditions of
+      this License, without any additional terms or conditions.
+      Notwithstanding the above, nothing herein shall supersede or modify
+      the terms of any separate license agreement you may have executed
+      with Licensor regarding such Contributions.
+
+   6. Trademarks. This License does not grant permission to use the trade
+      names, trademarks, service marks, or product names of the Licensor,
+      except as required for reasonable and customary use in describing the
+      origin of the Work and reproducing the content of the NOTICE file.
+
+   7. Disclaimer of Warranty. Unless required by applicable law or
+      agreed to in writing, Licensor provides the Work (and each
+      Contributor provides its Contributions) on an "AS IS" BASIS,
+      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
+      implied, including, without limitation, any warranties or conditions
+      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
+      PARTICULAR PURPOSE. You are solely responsible for determining the
+      appropriateness of using or redistributing the Work and assume any
+      risks associated with Your exercise of permissions under this License.
+
+   8. Limitation of Liability. In no event and under no legal theory,
+      whether in tort (including negligence), contract, or otherwise,
+      unless required by applicable law (such as deliberate and grossly
+      negligent acts) or agreed to in writing, shall any Contributor be
+      liable to You for damages, including any direct, indirect, special,
+      incidental, or consequential damages of any character arising as a
+      result of this License or out of the use or inability to use the
+      Work (including but not limited to damages for loss of goodwill,
+      work stoppage, computer failure or malfunction, or any and all
+      other commercial damages or losses), even if such Contributor
+      has been advised of the possibility of such damages.
+
+   9. Accepting Warranty or Additional Liability. While redistributing
+      the Work or Derivative Works thereof, You may choose to offer,
+      and charge a fee for, acceptance of support, warranty, indemnity,
+      or other liability obligations and/or rights consistent with this
+      License. However, in accepting such obligations, You may act only
+      on Your own behalf and on Your sole responsibility, not on behalf
+      of any other Contributor, and only if You agree to indemnify,
+      defend, and hold each Contributor harmless for any liability
+      incurred by, or claims asserted against, such Contributor by reason
+      of your accepting any such warranty or additional liability.
+
+   END OF TERMS AND CONDITIONS
+
+   APPENDIX: How to apply the Apache License to your work.
+
+      To apply the Apache License to your work, attach the following
+      boilerplate notice, with the fields enclosed by brackets "[]"
+      replaced with your own identifying information. (Don't include
+      the brackets!)  The text should be enclosed in the appropriate
+      comment syntax for the file format. We also recommend that a
+      file or class name and description of purpose be included on the
+      same "printed page" as the copyright notice for easier
+      identification within third-party archives.
+
+   Copyright [yyyy] [name of copyright owner]
+
+   Licensed under the Apache License, Version 2.0 (the "License");
+   you may not use this file except in compliance with the License.
+   You may obtain a copy of the License at
+
+       http://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.

data/README.md

@@ -0,0 +1,101 @@
+# Qoa Neural Network
+
+Qoa is a simple and customizable neural network library for Ruby. It allows you to create, train, and evaluate feedforward neural networks with various activation functions, dropout rates, and learning parameters.
+
+## Features
+
+- Supports various activation functions
+- Dropout regularization
+- Mini-batch gradient descent
+- Weight initialization using Xavier initialization
+- Customizable learning parameters
+- Parallelized backward pass for faster training
+
+## Installation
+
+Simply copy the `neural_network.rb`, `activation_functions.rb`, and `matrix_helpers.rb` files into your project and require them.
+
+```ruby
+require_relative 'neural_network'
+require_relative 'activation_functions'
+require_relative 'matrix_helpers'
+```
+
+## Usage
+
+### Creating a Neural Network
+
+To create a new neural network, you can initialize an instance of `Qoa::NeuralNetwork` with the following parameters:
+
+- `input_nodes`: The number of input nodes.
+- `hidden_layers`: An array of the number of nodes in each hidden layer.
+- `output_nodes`: The number of output nodes.
+- `learning_rate`: The learning rate for the gradient descent optimization.
+- `dropout_rate`: The dropout rate for regularization.
+- `activation_func`: The activation function to use (default is `:sigmoid`).
+- `decay_rate`: The decay rate for the RMSProp optimizer (default is `0.9`).
+- `epsilon`: A small value to prevent division by zero in the RMSProp optimizer (default is `1e-8`).
+- `batch_size`: The size of the mini-batches used for training (default is `10`).
+
+Example:
+
+```ruby
+nn = Qoa::NeuralNetwork.new(784, [128, 64], 10, 0.001, 0.5, :relu, 0.9, 1e-8, 32)
+```
+
+### Training the Neural Network
+
+To train the neural network, you can call the `train` method with the following parameters:
+
+- `inputs`: An array of input vectors (each vector should have the same length as the number of input nodes).
+- `targets`: An array of target vectors (each vector should have the same length as the number of output nodes).
+
+Example:
+
+```ruby
+inputs = [[0.1, 0.2, 0.3], [0.4, 0.5, 0.6], [0.7, 0.8, 0.9]]
+targets = [[1, 0, 0], [0, 1, 0], [0, 0, 1]]
+nn.train(inputs, targets)
+```
+
+### Evaluating the Neural Network
+
+To evaluate the neural network, you can call the `query` method with the following parameter:
+
+- `inputs`: An input vector (should have the same length as the number of input nodes).
+
+The method will return an output vector with the same length as the number of output nodes.
+
+Example:
+
+```ruby
+inputs = [0.1, 0.2, 0.3]
+output = nn.query(inputs)
+puts output.inspect
+```
+
+## Activation Functions
+
+The library supports the following activation functions:
+
+- Sigmoid (default)
+- Hyperbolic tangent (tanh)
+- Rectified linear unit (ReLU)
+- Leaky rectified linear unit (Leaky ReLU)
+- Exponential linear unit (ELU)
+- Swish
+- Softmax
+
+To use a different activation function, simply pass its symbol when creating a new neural network. For example:
+
+```ruby
+nn = Qoa::NeuralNetwork.new(784, [128, 64], 10, 0.001, 0.5, :tanh)
+```
+
+## Contributing
+
+Bug reports and pull requests are welcome on GitHub at https://github.com/mmatongo/qoa. This project is intended to be a safe, welcoming space for collaboration, and contributors are expected to adhere to the [Contributor Covenant](http://contributor-covenant.org) code of conduct.
+
+## License
+
+The library is available as open source under the terms of the [MIT License](http://opensource.org/licenses/Apache-2.0).

data/code_of_conduct.md

@@ -0,0 +1,132 @@
+# Contributor Covenant Code of Conduct
+
+## Our Pledge
+
+We as members, contributors, and leaders pledge to make participation in our
+community a harassment-free experience for everyone, regardless of age, body
+size, visible or invisible disability, ethnicity, sex characteristics, gender
+identity and expression, level of experience, education, socio-economic status,
+nationality, personal appearance, race, caste, color, religion, or sexual
+identity and orientation.
+
+We pledge to act and interact in ways that contribute to an open, welcoming,
+diverse, inclusive, and healthy community.
+
+## Our Standards
+
+Examples of behavior that contributes to a positive environment for our
+community include:
+
+- Demonstrating empathy and kindness toward other people
+- Being respectful of differing opinions, viewpoints, and experiences
+- Giving and gracefully accepting constructive feedback
+- Accepting responsibility and apologizing to those affected by our mistakes,
+  and learning from the experience
+- Focusing on what is best not just for us as individuals, but for the overall
+  community
+
+Examples of unacceptable behavior include:
+
+- The use of sexualized language or imagery, and sexual attention or advances of
+  any kind
+- Trolling, insulting or derogatory comments, and personal or political attacks
+- Public or private harassment
+- Publishing others' private information, such as a physical or email address,
+  without their explicit permission
+- Other conduct which could reasonably be considered inappropriate in a
+  professional setting
+
+## Enforcement Responsibilities
+
+Community leaders are responsible for clarifying and enforcing our standards of
+acceptable behavior and will take appropriate and fair corrective action in
+response to any behavior that they deem inappropriate, threatening, offensive,
+or harmful.
+
+Community leaders have the right and responsibility to remove, edit, or reject
+comments, commits, code, wiki edits, issues, and other contributions that are
+not aligned to this Code of Conduct, and will communicate reasons for moderation
+decisions when appropriate.
+
+## Scope
+
+This Code of Conduct applies within all community spaces, and also applies when
+an individual is officially representing the community in public spaces.
+Examples of representing our community include using an official e-mail address,
+posting via an official social media account, or acting as an appointed
+representative at an online or offline event.
+
+## Enforcement
+
+Instances of abusive, harassing, or otherwise unacceptable behavior may be
+reported to the community leaders responsible for enforcement at
+[INSERT CONTACT METHOD].
+All complaints will be reviewed and investigated promptly and fairly.
+
+All community leaders are obligated to respect the privacy and security of the
+reporter of any incident.
+
+## Enforcement Guidelines
+
+Community leaders will follow these Community Impact Guidelines in determining
+the consequences for any action they deem in violation of this Code of Conduct:
+
+### 1. Correction
+
+**Community Impact**: Use of inappropriate language or other behavior deemed
+unprofessional or unwelcome in the community.
+
+**Consequence**: A private, written warning from community leaders, providing
+clarity around the nature of the violation and an explanation of why the
+behavior was inappropriate. A public apology may be requested.
+
+### 2. Warning
+
+**Community Impact**: A violation through a single incident or series of
+actions.
+
+**Consequence**: A warning with consequences for continued behavior. No
+interaction with the people involved, including unsolicited interaction with
+those enforcing the Code of Conduct, for a specified period of time. This
+includes avoiding interactions in community spaces as well as external channels
+like social media. Violating these terms may lead to a temporary or permanent
+ban.
+
+### 3. Temporary Ban
+
+**Community Impact**: A serious violation of community standards, including
+sustained inappropriate behavior.
+
+**Consequence**: A temporary ban from any sort of interaction or public
+communication with the community for a specified period of time. No public or
+private interaction with the people involved, including unsolicited interaction
+with those enforcing the Code of Conduct, is allowed during this period.
+Violating these terms may lead to a permanent ban.
+
+### 4. Permanent Ban
+
+**Community Impact**: Demonstrating a pattern of violation of community
+standards, including sustained inappropriate behavior, harassment of an
+individual, or aggression toward or disparagement of classes of individuals.
+
+**Consequence**: A permanent ban from any sort of public interaction within the
+community.
+
+## Attribution
+
+This Code of Conduct is adapted from the [Contributor Covenant][homepage],
+version 2.1, available at
+[https://www.contributor-covenant.org/version/2/1/code_of_conduct.html][v2.1].
+
+Community Impact Guidelines were inspired by
+[Mozilla's code of conduct enforcement ladder][Mozilla CoC].
+
+For answers to common questions about this code of conduct, see the FAQ at
+[https://www.contributor-covenant.org/faq][FAQ]. Translations are available at
+[https://www.contributor-covenant.org/translations][translations].
+
+[homepage]: https://www.contributor-covenant.org
+[v2.1]: https://www.contributor-covenant.org/version/2/1/code_of_conduct.html
+[Mozilla CoC]: https://github.com/mozilla/diversity
+[FAQ]: https://www.contributor-covenant.org/faq
+[translations]: https://www.contributor-covenant.org/translations

data/lib/qoa/activation_functions.rb

@@ -0,0 +1,63 @@
+module Qoa
+  module ActivationFunctions
+    class << self
+      def sigmoid(x)
+        1.0 / (1.0 + Math.exp(-x))
+      end
+
+      def sigmoid_derivative(x)
+        x * (1.0 - x)
+      end
+
+      def tanh(x)
+        Math.tanh(x)
+      end
+
+      def tanh_derivative(x)
+        1.0 - (tanh(x) ** 2.0)
+      end
+
+      def relu(x)
+        x < 0 ? 0 : x
+      end
+
+      def relu_derivative(x)
+        x < 0 ? 0 : 1.0
+      end
+
+      def leaky_relu(x, alpha = 0.01)
+        x < 0 ? (alpha * x) : x
+      end
+
+      def leaky_relu_derivative(x, alpha = 0.01)
+        x < 0 ? alpha : 1.0
+      end
+
+      def elu(x, alpha = 1.0)
+        x < 0 ? (alpha * (Math.exp(x) - 1)) : x
+      end
+
+      def elu_derivative(x, alpha = 1.0)
+        x < 0 ? (alpha * Math.exp(x)) : 1.0
+      end
+
+      def swish(x, beta = 1.0)
+        x * sigmoid(beta * x)
+      end
+
+      def swish_derivative(x, beta = 1.0)
+        swish(x, beta) + sigmoid(beta * x) * (1 - swish(x, beta))
+      end
+
+      def softmax(x)
+        exps = x.map { |e| Math.exp(e - x.max) }
+        sum = exps.inject(:+)
+        exps.map { |e| e / sum }
+      end
+
+      def softmax_derivative(x)
+        x.map { |e| e * (1 - e) }
+      end
+    end
+  end
+end

data/lib/qoa/matrix_helpers.rb

@@ -0,0 +1,108 @@
+module Qoa
+  module MatrixHelpers
+    def matrix_multiply(a, b)
+      a_rows = a.size
+      a_cols = a[0].size
+      b_rows = b.size
+      b_cols = b[0].size
+      raise ArgumentError, 'incompatible dimensions' if a_cols != b_rows
+
+      result = Array.new(a_rows) { Array.new(b_cols, 0) }
+      a_rows.times do |i|
+        b_cols.times do |j|
+          a_cols.times do |k|
+            # Check for nil values before performing multiplication
+            if a[i].nil? || b[k].nil? || a[i][k].nil? || b[k][j].nil?
+              result[i][j] += 0
+            else
+              result[i][j] += a[i][k] * b[k][j]
+            end
+          end
+        end
+      end
+      result
+    end
+
+    def apply_function(matrix, func)
+      matrix.map { |row| row.map { |x| func.call(x) } }
+    end
+
+    def transpose(matrix)
+      matrix[0].zip(*matrix[1..-1])
+    end
+
+    def matrix_subtract(a, b)
+      a.zip(b).map { |r1, r2| r1.zip(r2).map { |x, y| x - y } }
+    end
+
+    def matrix_multiply_element_wise(a, b)
+      a.zip(b).map do |r1, r2|
+        if r1.nil? || r2.nil?
+          nil
+        else
+          r1.zip(r2).map do |x, y|
+            x.nil? || y.nil? ? nil : x * y
+          end
+        end
+      end
+    end
+
+    def matrix_add(a, b)
+      a.zip(b).map do |r1, r2|
+        if r1.nil? || r2.nil?
+          nil
+        else
+          r1.zip(r2).map do |x, y|
+            (x.nil? || y.nil?) ? nil : x + y
+          end
+        end
+      end
+    end
+
+    def scalar_multiply(scalar, matrix)
+      matrix.map do |row|
+        row.nil? ? nil : row.map { |x| x.nil? ? nil : x * scalar }
+      end
+    end
+
+    def mean(matrix)
+      matrix.map { |row| row.inject(0.0) { |sum, x| sum + x } / row.size }
+    end
+
+    def variance(matrix, mean)
+      matrix.map.with_index { |row, i| row.inject(0.0) { |sum, x| sum + (x - mean[i]) ** 2 } / row.size }
+    end
+
+    def normalize(matrix, mean, variance)
+      matrix.map.with_index { |row, i| row.map { |x| (x - mean[i]) / Math.sqrt(variance[i] + 1e-8) } }
+    end
+
+    def scale_and_shift(matrix, gamma, beta)
+      matrix.map.with_index { |row, i| row.map { |x| gamma[i] * x + beta[i] } }
+    end
+
+    def update_gamma(gamma, normalized, gradients)
+      gamma.each_with_index.map do |g, i|
+        g + normalized[i].zip(gradients[i]).inject(0.0) { |sum, (n, d)| sum + n * d }
+      end
+    end
+
+    def update_beta(beta, gradients)
+      beta.each_with_index.map do |b, i|
+        b + gradients[i].inject(0.0) { |sum, d| sum + (d.nil? ? 0 : d) }
+      end
+    end
+
+    def apply_dropout(matrix, dropout_rate)
+      matrix.map { |row| row.map { |x| rand < dropout_rate ? 0 : x } }
+    end
+
+    def matrix_pow(matrix, power)
+      matrix.map { |row| row.map { |x| x.nil? ? nil : x ** power } }
+    end
+
+    def scalar_add(matrix, scalar)
+      matrix.map { |row| row.map { |x| x.nil? ? nil : x + scalar } }
+    end
+  end
+end

data/lib/qoa/neural_network.rb

@@ -0,0 +1,118 @@
+require 'concurrent'
+require_relative 'activation_functions'
+require_relative 'matrix_helpers'
+
+module Qoa
+  class NeuralNetwork
+    include MatrixHelpers
+    attr_reader :input_nodes, :hidden_layers, :output_nodes, :learning_rate, :activation_func, :dropout_rate, :decay_rate, :epsilon, :batch_size
+
+    def initialize(input_nodes, hidden_layers, output_nodes, learning_rate, dropout_rate, activation_func = :sigmoid, decay_rate = 0.9, epsilon = 1e-8, batch_size = 10)
+      @input_nodes = input_nodes
+      @hidden_layers = hidden_layers
+      @output_nodes = output_nodes
+      @learning_rate = learning_rate
+      @activation_func = activation_func
+      @dropout_rate = dropout_rate
+      @decay_rate = decay_rate
+      @epsilon = epsilon
+      @batch_size = batch_size
+
+      @weights = []
+      @weights << random_matrix(hidden_layers[0], input_nodes)
+      hidden_layers.each_cons(2) do |l1, l2|
+        @weights << random_matrix(l2, l1)
+      end
+      @weights << random_matrix(output_nodes, hidden_layers[-1])
+    end
+
+    def random_matrix(rows, cols)
+      limit = Math.sqrt(6.0 / (rows + cols))
+      Array.new(rows) { Array.new(cols) { rand(-limit..limit) } }
+    end
+
+    def train(inputs, targets)
+      raise ArgumentError, 'inputs and targets must have the same length' if inputs.size != targets.size
+
+      inputs.zip(targets).each_slice(@batch_size) do |batch|
+        train_batch(batch)
+      end
+    end
+
+    def train_batch(batch)
+      derivative_func = "#{@activation_func}_derivative"
+      batch_inputs = batch.map { |x, _| x }
+      batch_targets = batch.map { |_, y| y }
+
+      # Forward pass
+      layer_outputs = batch_inputs.map { |inputs| forward_pass(inputs) }
+
+      # Backward pass
+      # Using thread pool to parallelize the backward pass for each input in the batch
+      pool = Concurrent::FixedThreadPool.new(4)
+      weight_deltas = Array.new(@weights.size) { Array.new(@weights[0].size) { Array.new(@weights[0][0].size, 0) } }
+      mutex = Mutex.new
+
+      batch.zip(layer_outputs).each do |(inputs, targets), outputs|
+        pool.post do
+          deltas = backward_pass(inputs, targets, outputs)
+          mutex.synchronize do
+            @weights.each_with_index do |_, i|
+              weight_deltas[i] = matrix_add(weight_deltas[i], deltas[i])
+            end
+          end
+        end
+      end
+
+      pool.shutdown
+      pool.wait_for_termination
+
+      # Update weights
+      @weights.each_with_index do |w, i|
+        @weights[i] = matrix_add(w, scalar_multiply(@learning_rate / batch.size, weight_deltas[i]))
+      end
+    end
+
+    def forward_pass(inputs)
+      inputs = inputs.map { |x| [x] } # Convert to column vector
+
+      layer_outputs = [inputs]
+      @weights.each_with_index do |w, i|
+        layer_inputs = matrix_multiply(w, layer_outputs[-1])
+        layer_outputs << apply_function(layer_inputs, ActivationFunctions.method(@activation_func))
+
+        # Apply dropout to hidden layers
+        layer_outputs[-1] = apply_dropout(layer_outputs[-1], @dropout_rate) if i < @weights.size - 1
+      end
+
+      layer_outputs
+    end
+
+    def backward_pass(inputs, targets, layer_outputs)
+      derivative_func = "#{@activation_func}_derivative"
+      inputs = inputs.map { |x| [x] } # Convert to column vector
+      targets = targets.map { |x| [x] } # Convert to column vector
+
+      # Compute errors
+      errors = [matrix_subtract(targets, layer_outputs.last)]
+      (@weights.size - 1).downto(1) do |i|
+        errors << matrix_multiply(transpose(@weights[i]), errors.last)
+      end
+
+      # Compute weight deltas
+      weight_deltas = []
+      @weights.each_with_index do |w, i|
+        gradients = matrix_multiply_element_wise(errors[i], apply_function(layer_outputs[i + 1], ActivationFunctions.method(derivative_func)))
+        w_delta = matrix_multiply(gradients, transpose(layer_outputs[i]))
+        weight_deltas << w_delta
+      end
+
+      weight_deltas
+    end
+
+    def query(inputs)
+      layer_outputs = forward_pass(inputs)
+      layer_outputs.last.flatten
+    end
+  end
+end

data/lib/qoa/version.rb

@@ -0,0 +1,3 @@
+module Qoa
+  VERSION = '0.0.1'
+end

data/lib/qoa.rb

@@ -0,0 +1,2 @@
+require_relative 'qoa/neural_network'
+require_relative 'qoa/version'

metadata

@@ -0,0 +1,94 @@
+--- !ruby/object:Gem::Specification
+name: qoa
+version: !ruby/object:Gem::Version
+  version: 0.0.1
+platform: ruby
+authors:
+- Daniel M. Matongo
+autorequire:
+bindir: bin
+cert_chain: []
+date: 2023-04-29 00:00:00.000000000 Z
+dependencies:
+- !ruby/object:Gem::Dependency
+  name: bundler
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '2.0'
+- !ruby/object:Gem::Dependency
+  name: rake
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '13.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '13.0'
+- !ruby/object:Gem::Dependency
+  name: rspec
+  requirement: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+  type: :development
+  prerelease: false
+  version_requirements: !ruby/object:Gem::Requirement
+    requirements:
+    - - "~>"
+      - !ruby/object:Gem::Version
+        version: '3.0'
+description: Qoa is a simple machine learning library for Ruby, including a basic
+  feedforward neural network implementation with backpropagation.
+email:
+- mmatongo_@hotmail.com
+executables: []
+extensions: []
+extra_rdoc_files: []
+files:
+- LICENSE
+- README.md
+- code_of_conduct.md
+- lib/qoa.rb
+- lib/qoa/activation_functions.rb
+- lib/qoa/matrix_helpers.rb
+- lib/qoa/neural_network.rb
+- lib/qoa/version.rb
+homepage: https://github.com/mmatongo/qoa
+licenses:
+- Apache-2.0
+metadata: {}
+post_install_message:
+rdoc_options: []
+require_paths:
+- lib
+required_ruby_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+required_rubygems_version: !ruby/object:Gem::Requirement
+  requirements:
+  - - ">="
+    - !ruby/object:Gem::Version
+      version: '0'
+requirements: []
+rubygems_version: 3.3.7
+signing_key:
+specification_version: 4
+summary: A simple machine learning library
+test_files: []