Learning with Algorithmic Supervision via Continuous Relaxations

Felix Petersen, Christian Borgelt, Hilde Kuehne, Oliver Deussen

Keywords: differentiable algorithms, algorithmic supervision, continuous relaxation, weakly supervised, perturbed, smooth, sorting, differentiable rendering

Abstract: The integration of algorithmic components into neural architectures has gained increased attention recently, as it allows training neural networks with new forms of supervision such as ordering constraints or silhouettes instead of using ground truth labels. Many approaches in the field focus on the continuous relaxation of a specific task and show promising results in this context. But the focus on single tasks also limits the applicability of the proposed concepts to a narrow range of applications. In this work, we build on those ideas to propose an approach that allows to integrate algorithms into end-to-end trainable neural network architectures based on a general approximation of discrete conditions. To this end, we relax these conditions in control structures such as conditional statements, loops, and indexing, so that resulting algorithms are smoothly differentiable. To obtain meaningful gradients, each relevant variable is perturbed via logistic distributions and the expectation value under this perturbation is approximated. We evaluate the proposed continuous relaxation model on four challenging tasks and show that it can keep up with relaxations specifically designed for each individual task.

Code Of Conduct: I certify that all co-authors of this work have read and commit to adhering to the NeurIPS Statement on Ethics, Fairness, Inclusivity, and Code of Conduct.

TL;DR: Integrating classic algorithms into neural networks for training with alternative supervision strategies and making algorithms differentiable.

Code: https://github.com/Felix-Petersen/algovision

Community Implementations: [ 1 code implementation](https://www.catalyzex.com/paper/arxiv:2110.05651/code)