Measurements are never quite the truth
Any real detector distorts what it measures: limited resolution, acceptance, and noise turn a true distribution into a measured one. Recovering the former is a deconvolution problem.
An animated walkthrough of my bachelor’s thesis on combining ordinal neural-network classification with iterative deconvolution.
Any real detector distorts what it measures: limited resolution, acceptance, and noise turn a true distribution into a measured one. Recovering the former is a deconvolution problem.
Rather than invert an often unstable matrix directly, DSEA+ iterates: train a classifier, estimate the spectrum from its confidences, reweight the training data, and repeat until convergence.
DSEA+ accepts probabilistic classifiers, but its target bins are ordered. Unlike unrelated color categories, bin 5 is closer to bin 6 than to bin 9 — a distance that common softmax classifiers do not encode.
CORN casts ordinal classification as chained binary questions: does an event exceed rank k? Its probabilities are linked so predictions remain rank-consistent by construction.
CORN natively returns one predicted rank per event. DSEA+ needs complete per-class confidence distributions and weighted training samples, so both extensions bridge the methods.
Bayesian hyperparameter search, cross-validation, and bootstrapped uncertainties test whether respecting ordinality improves the unfolded result over a non-ordinal baseline.
The central task is to infer an underlying spectrum from detector-distorted observations while managing limited data and numerical instability.
DSEA+ turns deconvolution into a data-reweighting loop driven by calibrated class-confidence estimates.
CORN encodes rank order directly, providing a principled alternative to treating every target bin as unrelated.
Contact me to get access to the full thesis PDF and to discuss the methods and results in more detail.