PredictA surrogate produces an answer quickly enough to be useful for policy review.ExpandOn its own the answer carries no interval. A uniform one is honest about nothing.CalibrateFitted against held-out data, the interval widens where the signal is genuinely hard.VerifyObservations are plotted against it. Coverage is measured, not assumed.DeclineBelow a confidence floor the system abstains rather than answering badly.
Eight worlds, in running order. Every one is drawn as its own mechanism rather than as a card, because a graph surrogate and a retrieval benchmark do not resemble each other and should not be presented as though they do. Each opens into a case study carrying its evidence and its limits.
A road network of twenty-five junctions. One junction is intervened on and the effect propagates outward along real hop distance; the network then lifts so that height carries that distance, a prediction appears at each junction, and a band of uncertainty grows around it with distance from the intervention. A reliability inset shows the tracked calibration curve moving from 0.2687 to 0.0479 expected calibration error, and the least confident junctions are finally marked for human review.
A graph network answers in milliseconds what a traffic simulator takes hours to compute. The question is not whether it is fast. It is when it may be believed.
Reliable GNN Surrogates for Transport Policy Analysis
A measure of how unsure a model is becomes the one control that is allowed to be unsure.
A boundary standing between a client and a downstream server. Three lanes of traffic reach it: a declaration passes, an argument set is stopped at the line, a returned document is stripped and continues thinner. Nine control plates stack along the boundary, and the one that has to make a judgement steps off it. Three bars compare no gateway, a keyword filter and the gateway on attacks caught against legitimate traffic refused.
A tool description can be scanned before anyone calls it. The document that tool returns cannot — it does not exist yet. So what is worth putting at the boundary itself, and what does it cost in refused legitimate calls?
A record of what was allowed to cross becomes the captured source everything downstream is checked against.
An immutable core of captured evidence, with three derived representations connected to it by right-angled routes: structured records, a semantic index and a relationship graph. Verification runs from each derived view back to the core; the semantic index drifts out of alignment, the consistency gate fails, the drifted view detaches and is rebuilt from the core, and all four gates return. The core does not move at any point. Everything shown is a public synthetic model.
A derived plate becomes the plate a diagnosis would be derived from.
A synthetic chest radiograph drawn as contours, carrying no pathology of any kind. It gives way to a grid of three training corpora against fourteen findings, where every cell a corpus cannot label goes dark: masked rather than guessed. A grayscale adapter averages three input channels into one, a DenseNet backbone assembles at its real depths of six, twelve, twenty-four and sixteen layers, and a head reduces 1024 features to 512 and then to fourteen outputs. The fourteen output channels end the sequence empty, because the repository publishes no validated numbers.
One plate of pixels becomes one page of text, and both have to be identified before they are used.
Three federal flood-policy forms drawn as three identical blocks of text, distinguishable only by a number. A question arrives, passages lift out of all three and settle into a ranked list, and the top-ranked passage is traced back to the form it came from: the wrong one. Eight of the eighteen held-out questions in the tracked run do this, which is what a top-document accuracy of 0.5556 counts. Provenance is then shown travelling with every passage, an evidence packet forms from the top five, and the generated answer stays tethered to the passages it was built from.
Three policy forms differ by a few words. The nearest passage can be the correct clause taken from the wrong document, and read exactly like the answer.
A packet that has to carry where it came from becomes a bundle that has to earn where it is going.
A single model bundle travelling one track. The 1800/600/600 split is drawn, a candidate bundle is assembled, and it carries to a promotion gate of four plates: accuracy, weighted F1, margin over baseline, and p95 latency, each against its real threshold. The margin check refuses and the candidate is diverted rather than scored anyway; a second candidate is built, all four checks hold at the tracked values, and the bundle moves into staging and then to production, which is reachable only by promotion. The refusal is a staged demonstration of the gate's logic, not a recorded incident.
The line a release travels along becomes the line a measurement is plotted against.
The seminar's fitted stage-discharge rating curve, drawn from its own two blended power laws. Perturbing the precipitation across two thousand series barely moves the objective. The curve resets, and the same experiment is run on the water level instead: an identical fifty-centimetre interval is projected through the curve at base stage and at the peak, and comes out as a discharge band of 8.6 in one place and 338 in the other. Recalibration recovers almost none of it, and the loss from perturbing the measurement is 356 times the loss from perturbing the rain. No forecast, horizon or coverage claim is made anywhere.
One event measured through a curve becomes fifteen years measured every day.
Fifteen years of synthetic daily streamflow drawn as a ribbon, with the two-year chronological holdout marked. A 120-day window is taken out of the test period and magnified; lag and rolling-window features are cut from it, and a one-step-ahead prediction is laid over the observation, matching it closely at an R-squared of 0.9786. The top decile of flow is then marked, and the model is shown coming in under every peak in it. The sequence ends on the feature importances, where lag-1 and lag-2 together carry 94 per cent of the model, against a lag-1 autocorrelation of 0.9941.
A leaderboard invites one reading: rank the rows. These three were not scored on the same task, and the gap between the questions is wider than the gap between the models.
A window over time becomes a grid over space, and both are read a few cells at a time.
The tracked ten-by-ten confusion matrix, every cell a real count over a thousand test images per class. The diagonal lights, then the off-diagonal mass, then the grid separates into vehicles and animals; the cat row lifts clear, showing 335 correct against 291 sent to dog and 145 to frog. Per-class accuracy fans out beneath the grid from 33.5 for cat to 82.0 for automobile, with the headline 64.26 drawn across them as the mean it is, and the sequence closes on the split the model actually learned: 78 per cent on vehicles against 55.1 on animals, with 82 per cent of all errors staying inside their own group.
Nine more repositories, and what each one can prove
Smaller than the flagships and built the same way. Reading all nine READMEs side by side turned up the only fact worth leading with: 2 of them publish tracked numbers, 2 establish a working path without claiming accuracy, and 5 publish no metric at all — each one naming the artifact it would need first. Those five are drawn as the empty charts they are.
01
Flood Prediction with an LSTM
River discharge is well understood physics and expensive computation. This is the deep-learning shortcut, measured on a catchment that can be regenerated anywhere.
Input
Thirty days of precipitation, temperature and soil moisture, produced by a deterministic rainfall-runoff generator written for the repository.
System
An LSTM reads the window and predicts the next day's discharge in a single forward pass, trained with early stopping and a learning-rate schedule.
Limit
The catchment is synthetic. Every score describes the generated benchmark, and none of it is real-catchment performance.
Flood events are the 95th percentile of the generated series. Detection is markedly harder than the fit, and the repository publishes both rather than the flattering one.
02
Water Quality: Four Classifiers, One Axis
Four families of model on the same generated task, compared under cross-validation instead of asserted.
Input
Five thousand samples from a seeded generator whose features are deliberately class-correlated.
System
Logistic regression, random forest, XGBoost and an RBF SVM run through the same pipeline, with cross-validation and hyperparameter tuning.
Limit
The labels are generated, not laboratory measurements. These scores measure how well each model recovers the generator's own distributions and say nothing about whether real water is safe to drink.
Tuning moved XGBoost from 0.896 to 0.898 and left the untuned SVM ahead. The comparison is reported as it came out.
03
Traffic Accident Prediction API
A model behind a typed HTTP contract. What it establishes is that the path works, not that the forecast is right.
Input
A calendar year and month, validated at the boundary before anything reaches the model.
System
A FastAPI service loads a regression model trained on Munich traffic-accident records and returns a rounded predicted count.
Limit
An educational prototype, not a public-safety forecast. The tracked model and CSV come from a historical-data exercise and establish no accuracy for any future decision.
The seasonality the analysis finds is the seasonality the generator was given. That is a check on the pipeline, not a finding about climate.
05
Battery State of Charge
A lithium-ion cell carries no fuel gauge. Six approaches to inferring one, gathered so they can be compared instead of trusted.
Input
Voltage, current, temperature and cycling history, from authorised NASA battery files or a deterministic synthetic generator.
System
SVR, random forest, XGBoost, LightGBM and an LSTM regress state of charge, alongside clustering for operating regimes and a genetic-optimised fuzzy estimator.
Limit
No dataset, trained weights or tracked evaluation are included. It must not be used to operate a battery-management system or make a safety decision.
Earlier score tables and degradation claims were removed on purpose. The repository has no versioned source split, run configuration, model artifact or metric report to substantiate them, and it names exactly what a meaningful benchmark would have to record: cell identifiers, data version, preprocessing parameters, temporal split, seed, dependency versions and evaluation artifacts.
06
Insurance Claims: Calibration and Attribution
Predicting a claim is half the problem. The probabilities also have to mean something, and someone has to explain them.
Input
Policy and vehicle columns from a Kaggle claims dataset, fetched by the user under its own terms and never versioned here.
System
Encoders and scalers fit on training data only, then classifiers, Platt or isotonic calibration, cost-sensitive threshold selection and SHAP attribution.
Limit
The example cost matrix is illustrative and is not a validated business policy. Nothing here may be used to make automated decisions about people or policies.
The repository contains source and notebooks only. It versions no data, no split, no trained model, no calibration output and no evaluation report, so there is nothing to substantiate a number with.
07
Classical Baselines Against DistilBERT
Two tracks on one task, evaluated the same way, so the comparison is worth something when someone runs it.
Input
AG News headlines fetched at run time. If access fails the pipeline stops rather than quietly evaluating template-generated text.
System
TF-IDF with logistic regression, linear SVM or random forest on one side; DistilBERT fine-tuned through the Hugging Face Trainer on the other.
Limit
The offline synthetic fixture exists for development only. Its results are not comparable to AG News or to real news classification.
Data, trained models, checkpoints, metrics, plots and run metadata are all untracked, so the repository declines to state how the two tracks compared.
08
Can Two Networks Hide the Same Function?
Identical weights always behave identically. The interesting question runs the other way, and it is the subject of a TUM mathematics seminar.
Input
Small fully connected networks with tanh, sigmoid or ReLU activations, constructed to be related by hidden-unit permutations and sign flips.
System
Numerical diagnostics look for exact and near-exact clone pairs, sampled non-degeneracy and parameter alignment, then test proposed symmetry-breaking regularisers.
Limit
The activation labels describe the assumptions this prototype considers. The formal statements live in the cited papers, not here.
The checks are finite numerical diagnostics on sampled inputs. They can expose a symmetry; they cannot prove global functional equivalence or satisfy the hypotheses of a published identifiability theorem, and the repository versions no experiment configuration or trained model.
09
Supply Chain KPIs and Inventory Classics
Demand forecasting, supplier dependability and how much stock to hold, in one dashboard, with each proxy named as a proxy.
Input
Order records from the DataCo dataset, downloaded under its own terms and deliberately ignored by version control.
System
Cleaning and KPIs, a comparison of demand-forecasting baselines, and the classical EOQ, safety-stock and reorder-point calculations, served through a Plotly Dash app.
Limit
The inventory values are illustrative outputs whose assumptions must be validated before they touch a real operation, and the proxy must never be read as a supplier-quality assessment.
No dataset, processed data, forecast artifact or verified business metric is versioned. The source carries no supplier identifiers and no defect measurements either, so supplier analysis groups departments as an explicit proxy and derives its quality-like score from late delivery.
The shape of the work I do now, drawn synthetically. It describes a class of problem common to data platforms rather than any particular system, and every figure in it is an illustrative model.
Ingest
Represent
Verify
Observe
PresentIs the captured evidence still there, byte for byte?
CompleteDoes everything that should have been derived actually exist?
ConsistentDo the derived representations still agree with the authoritative record?
CurrentIs the upstream source still saying what we captured?
Illustrative model. Synthetic throughout; it describes a class of problem rather than any particular system.
Each role is written as the class of technical problem it put in front of me, rather than as a job title with a date range attached.
Now
One source, several representations
Records, vectors and a graph all describing the same material. Each is useful, each can drift, and agreement between them has to be demonstrated rather than assumed.
Ingest
Represent
Verify
Observe
Research
A fast approximation of a slow simulation
Learning a surrogate is the easy half. Establishing when its answer may be trusted, and building the machinery that says so, is the work.
Simulate
Approximate
Quantify
Select
Earlier
A reporting process that ran on people
Several spreadsheets, reconciled by hand on a schedule. The interesting part was not the automation; it was making the consolidated figure reproducible.
Collect
Reconcile
Automate
Report
BP-IT Consulting & Solutions GmbH
AI Engineer (Working Student)
Built verification workflows for a multilingual legal knowledge platform using relational, vector, and graph storage.
Technical University of Munich
Student Research Assistant / Programming and Visualization
AUDI AG
Intern, Programming of Workflows and Linking of Databases
Technical University of Munich
Student Research Assistant, Numerical Methods and Scientific Visualization
IISER Bhopal
Summer Research Intern, Machine Learning for Li-ion Battery State Estimation
And, just as importantly, systems that can say where they stop knowing it. If that is the kind of engineering you need, the case studies and the research record are the fastest way to judge whether it is any good.
Open to full-time Machine Learning and Applied AI roles