A Pattern Language for Machine Learning Tasks
<|reference_start|>A Pattern Language for Machine Learning Tasks: Idealised as universal approximators, learners such as neural networks can be viewed as "variable functions" that may become one of a range of concrete functions after training. In the same way that equations constrain the possible values of variables in algebra, we may view objective functions as constraints on the behaviour of learners. We extract the equivalences perfectly optimised objective functions impose, calling them "tasks". For these tasks, we develop a formal graphical language that allows us to: (1) separate the core tasks of a behaviour from its implementation details; (2) reason about and design behaviours model-agnostically; and (3) simply describe and unify approaches in machine learning across domains.   As proof-of-concept, we design a novel task that enables converting classifiers into generative models we call "manipulators", which we implement by directly translating task specifications into code. The resulting models exhibit capabilities such as style transfer and interpretable latent-space editing, without the need for custom architectures, adversarial training or random sampling. We formally relate the behaviour of manipulators to GANs, and empirically demonstrate their competitive performance with VAEs. We report on experiments across vision and language domains aiming to characterise manipulators as approximate Bayesian inversions of discriminative classifiers.<|reference_end|>
@article{rodatz2024a,
    title={A Pattern Language for Machine Learning Tasks},
    author={Benjamin Rodatz, Ian Fan, Tuomas Laakkonen, Neil John Ortega, Thomas
  Hoffman, Vincent Wang-Mascianica},
    journal={arXiv preprint arXiv:2407.02424},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.02424},
    primaryClass={cs.LG math.CT}
}