summaryrefslogtreecommitdiff
path: root/chapters/background
diff options
context:
space:
mode:
authorericmarin <maarin.eric@gmail.com>2026-06-23 15:26:01 +0200
committerericmarin <maarin.eric@gmail.com>2026-06-26 16:47:32 +0200
commita8bb7736e2e86963bd5761cc05079447abeeaba6 (patch)
tree0071214f224846057380838e3d609790785ea930 /chapters/background
parent11f14a4763533dbc24b0e98d115071036025d4f6 (diff)
downloadvein-a8bb7736e2e86963bd5761cc05079447abeeaba6.tar.gz
vein-a8bb7736e2e86963bd5761cc05079447abeeaba6.zip
using official template + fixing language errorsthesis
Diffstat (limited to 'chapters/background')
-rw-r--r--chapters/background/01-neural-networks.tex4
-rw-r--r--chapters/background/02-interaction-nets.tex12
2 files changed, 8 insertions, 8 deletions
diff --git a/chapters/background/01-neural-networks.tex b/chapters/background/01-neural-networks.tex
index dc3e2d4..5eed7bd 100644
--- a/chapters/background/01-neural-networks.tex
+++ b/chapters/background/01-neural-networks.tex
@@ -3,7 +3,7 @@
A neural network is a computational model inspired by biological neural networks. It consists of
connected nodes called neurons, introduced in its early form by Rosenblatt~\cite{rosenblatt1958perceptron}.
-The \textit{Multi-Layer Perceptrons} is an architecture composed of sequential layers, trained using
+The \textit{Multi-Layer Perceptron} is an architecture composed of sequential layers, trained using
backpropagation as popularized by Rumelhart et al.~\cite{rumelhart1986learning}.
\subsection{Neuron}
@@ -57,7 +57,7 @@ The output $y$ is defined as:
\subsection{Multi-Layer Perceptron}
A \textit{Multi-Layer Perceptron} (MLP), illustrated in \textbf{\Cref{fig:mlp}}, is a type of neural network organized
-in fully connected layers of neurons: an input layer, one or more hidden layers and an output layer.
+in fully connected layers of neurons: an input layer, one or more hidden layers, and an output layer.
An MLP is \textit{feedforward}, meaning that the flow of information is strictly propagated from the input to
the outputs.
\begin{figure}[H]
diff --git a/chapters/background/02-interaction-nets.tex b/chapters/background/02-interaction-nets.tex
index 874110e..41488f1 100644
--- a/chapters/background/02-interaction-nets.tex
+++ b/chapters/background/02-interaction-nets.tex
@@ -5,7 +5,7 @@
graphical model of computation based on graph rewriting.
\subsection{Basic Concepts}
-An IN is an undirected graph with labelled vertices, called \textit{agents}. Each agent
+An IN is an undirected graph with labeled vertices, called \textit{agents}. Each agent
is an instance of a \textit{symbol}, which has a principal port and a fixed number of auxiliary ports:
\begin{figure}[H]
\centering
@@ -21,7 +21,7 @@ is an instance of a \textit{symbol}, which has a principal port and a fixed numb
\end{figure}
Each port can be wired to at most one other port. When two different agents are wired to their
-respective principal ports they are called an \textit{active pair}:
+respective principal ports, they are called an \textit{active pair}:
\begin{figure}[H]
\centering
@@ -34,13 +34,13 @@ respective principal ports they are called an \textit{active pair}:
\node[left] at (A.above pax 2) {$\mathit{y}$};
\node[right] at (S.above pax) {$\mathit{x}$};
\end{tikzpicture}
- \caption{Example of an active pair, where a $\mathit{Add}$ agent and an $\mathit{S}$ agent are connected via their principal ports.}
+ \caption{Example of an active pair, where an $\mathit{Add}$ agent and an $\mathit{S}$ agent are connected via their principal ports.}
\label{fig:active-pair}
\end{figure}
\subsection{Interaction Rules}
Computation in IN proceeds by rewriting the net using local \emph{interaction rules}. A rule
-is defined only for an active pair and for any pair of symbols there is at most one
+is defined only for an active pair, and for any pair of symbols, there is at most one
interaction rule.
\begin{figure}[H]
@@ -62,12 +62,12 @@ interaction rule.
\node[left] at (A.above pax 2) {$\mathit{y}$};
\node[left] at (S.above pal) {$\mathit{z}$};
}
- \caption{Interaction rule for $\mathit{S}$ and $\mathit{Add}$ that emulates Peano addition rule.}
+ \caption{Interaction rule for $\mathit{S}$ and $\mathit{Add}$ that emulates the Peano addition rule.}
\label{fig:rule-concrete-zero}
\end{figure}
\subsection{Properties}
-IN possess the following properties:
+IN possesses the following properties:
\begin{itemize}
\item \textbf{Locality}: only active pairs can be rewritten.
\item \textbf{Linearity}: each interaction rule rewrites a constant-size subgraph, independent of