mirror of
https://github.com/kuhyx/WUT_Computer_Science.git
synced 2026-11-10 18:47:11 +01:00
kuhy overruled the "do not fix coursework to be better than it was submitted" rule: git history is the archive, so the working tree can be clean. This lands the config and the mechanical half of the cleanup -- 9,281 ruff findings under the fleet config down to 3,686, with no per-file-ignores anywhere. What is in here: - pyproject.toml, the first one in this repo. select = ["ALL"], mypy strict, and the vendored list mirrored into ruff exclude and coverage omit. Five rules are off and each says why; CPY001 is the only judgement call, because stamping a copyright header onto 137 university assignments would assert a licence that was never claimed. No hook is wired up yet -- a gate lands only once its subject is clean. - ruff format + the safe fixes, then a second pass over the docstring rules ruff marks unsafe (they only edit docstring text). 108 files. - TRAK/sightpy is vendored, not coursework: it is rafael-fuente/Python-Raytracer (BSD 3-Clause). Verified against a fresh upstream clone with line endings normalised -- 30 of 32 files byte-identical, ray.py and scene.py carrying a 12- and 13-line local patch that counts rays for the report. 35 files that should never have been linted, now excluded and restored. - WDWR, SPD, MOM and ECRYPT are fully clean, by hand and verified by running them: WDWR's three plot scripts print the same statistics as before, MOM's PuLP model solves to the same cost. WDWR's graph.py had a 342-character CSV header embedded as a string literal, which cannot be wrapped -- the data moved to data/pareto_front.csv. Two 0-byte .py stubs are deleted; an empty file is not a deliverable and git still has it. Three harness bugs found by actually running things: - `run` now forces MPLBACKEND=Agg. TRAK finished its ray trace in 37 seconds and then sat for 45 minutes: plt.show() had opened an image viewer and was waiting for someone to close the window. - TRAK's main.py only pops that viewer with --show now, and its runner writes to a gitignored build/ via the new --entry-args. The default output path is outputs/output.png, which is TRACKED -- a plain run overwrote a submitted deliverable. - course_lib.sh was 357 lines, over this repo's own cap. Split into course_probe.sh and course_run.sh. Verified: ECOTE 26 tests pass, ECRYPT_PROJECT 99 pass, TRAK renders cornell_box in 37s and exits 0, every module compiles, and every import ruff removed was checked to be genuinely unused. Co-Authored-By: Claude Opus 5 (1M context) <noreply@anthropic.com> Claude-Session: https://claude.ai/code/session_0172dj34FDpao6wsix8ZuCzE
124 lines
5.6 KiB
Python
124 lines
5.6 KiB
Python
# numpy for loading dataset
|
|
import numpy as np
|
|
|
|
# pytorch for deep learning models
|
|
import torch
|
|
|
|
# nn like neural network
|
|
from torch import nn, optim
|
|
|
|
# Pima indians describes patient medical data and whether they had diabetes for last 5 years
|
|
# It is binary classification (they could either have diabetes 1 or not 0)
|
|
# load the file as a matrix of numbers,
|
|
dataset = np.loadtxt("pima-indians-diabetes.csv", delimiter=",")
|
|
input_columns = 8
|
|
# split into input (X) -> in this case everything beside info whether patient had diabetes or not is input
|
|
# We are splitting data into two subsets by using NumPy slice operator : and choose first 8 columns using 0:8 slice
|
|
X = dataset[:, 0:input_columns]
|
|
# and output (y) variables -> in this case we are only interested whether patient had diabetes or not as an output
|
|
# you can simplify that y = f(X)
|
|
# We are splitting the data by using slice operator : and choosing last column
|
|
y = dataset[:, input_columns]
|
|
|
|
# we need to convert this data to pytorch tensors
|
|
# Pytorch usually operates on 32-bit floating point and NumPy by default uses 64 bit floating point
|
|
X = torch.tensor(X, dtype=torch.float32)
|
|
# We can also correct the shape to fit what PyTorch would expect (here we are converting n vectors to n x 1 matrix)
|
|
# This simplifies handling matrix multiplication operations (which are the basis of deep learning models)
|
|
# reshape is converting the output variable y from a 1-dimensional NumPy array to a 2-dimensional PyTorch tensor with a shape of (n, 1), where n is the number of samples in the dataset.
|
|
y = torch.tensor(y, dtype=torch.float32).reshape(-1, 1)
|
|
|
|
|
|
# define the model
|
|
# this class is a subclass of nn.Module -> base class provided by PyTorch for building neural network models.
|
|
class PimaClassifier(nn.Module):
|
|
def __init__(self):
|
|
super().__init__()
|
|
# There are 3 (fully connected) layers in class, each with their activation function
|
|
# creates Linear layer, it maps input to a hidden layer of 12 neurons
|
|
# input features have a size of 8 (same number as number of features in pima indians diabetes dataset)
|
|
first_output_neurons = 12
|
|
self.hidden1 = nn.Linear(input_columns, first_output_neurons)
|
|
# This creates ReLU (rectified linear unit) activation function applied after first hidden layer
|
|
self.act1 = nn.ReLU()
|
|
|
|
# This maps the output of first layer (which was 12 neurons) to new hidden layer of 8 neurons
|
|
second_output_neurons = 8
|
|
self.hidden2 = nn.Linear(first_output_neurons, second_output_neurons)
|
|
# ReLU activation function applied after second hidden layer
|
|
self.act2 = nn.ReLU()
|
|
|
|
# We map output of second layer to a single output neuron -> which will represent the predicted
|
|
# probability of a sample having diabetes
|
|
self.output = nn.Linear(second_output_neurons, 1)
|
|
# sigmoid function forces output to be either 0 or 1
|
|
self.act_output = nn.Sigmoid()
|
|
|
|
# forward pass is computation of output based on input 'x'
|
|
def forward(self, x):
|
|
# Applies first hidden layer (and then ReLU activation) to input x
|
|
x = self.act1(self.hidden1(x))
|
|
# Applies second hidden layer (and then ReLU activation) to input x
|
|
x = self.act2(self.hidden2(x))
|
|
# Applies output layer (and then Sigmoid activation) to input x
|
|
x = self.act_output(self.output(x))
|
|
# returns final output (0 or 1)
|
|
return x
|
|
|
|
|
|
# Create object from model class
|
|
model = PimaClassifier()
|
|
print(model)
|
|
|
|
# train the model
|
|
# first we need to specify what is the goal of training
|
|
# we have input X and output y and we want the model to be as close to y as possible
|
|
# Since this is binary classification problem we will use "binary cross entropy" to measure the distance between
|
|
# our prediction and y
|
|
loss_fn = nn.BCELoss() # binary cross entropy
|
|
# Optimizer adjust model weights to produce better output
|
|
# Its described as being able to tune itself to a lot of problems
|
|
# inputs are:
|
|
# parameters which it will optimize (from the model)
|
|
# and lr (learning rate) which is step size of each iteration
|
|
optimizer = optim.Adam(model.parameters(), lr=0.001)
|
|
|
|
|
|
# epoch is the entire training dataset passed to a model once
|
|
n_epochs = 100
|
|
# batch is one or more sample passed to model
|
|
# number of epochs and the size of a batch can be chosen experimentally by trial and error.
|
|
# a lot of epochs and big size of batch means more time and more memory consumption but more accurate results
|
|
batch_size = 10
|
|
|
|
# We split dataset into batches and pass batches one by one into a model to training loop
|
|
# after using all batches we finish one epoch and can start over again to refine the model
|
|
# we use two nested for loops for training, one is for epochs
|
|
for epoch in range(n_epochs):
|
|
# and one for batches
|
|
for i in range(0, len(X), batch_size):
|
|
# Split X data into a batch with the size from batch_size
|
|
Xbatch = X[i : i + batch_size]
|
|
# run the model on the batch and return "batched" output
|
|
y_pred = model(Xbatch)
|
|
# Split y data into a batch with the size from batch_size
|
|
ybatch = y[i : i + batch_size]
|
|
# Compare loss
|
|
loss = loss_fn(y_pred, ybatch)
|
|
# optimize model
|
|
optimizer.zero_grad()
|
|
# calculate the inaccuracy
|
|
loss.backward()
|
|
# optimizer takes next step
|
|
optimizer.step()
|
|
|
|
# compute final accuracy
|
|
y_pred = model(X)
|
|
accuracy = (y_pred.round() == y).float().mean()
|
|
print(f"Accuracy {accuracy}")
|
|
|
|
# make class predictions with the model
|
|
predictions = (model(X) > 0.5).int()
|
|
for i in range(5):
|
|
print("%s => %d (expected %d)" % (X[i].tolist(), predictions[i], y[i]))
|