mlsanityData to 14 Oct 2026

Graph Interpolating Activation Improves Both Natural and Robust Accuracies in Data-Efficient Deep Learning

arXiv 1907.06800 ↗First posted 16 Jul 2019cs.LG cs.NA math.NAcited by 3

Not on the map. Why?

Abstract (arXiv)

Improving the accuracy and robustness of deep neural nets (DNNs) and adapting them to small training data are primary tasks in deep learning research. In this paper, we replace the output activation function of DNNs, typically the data-agnostic softmax function, with a graph Laplacian-based high dimensional interpolating function which, in the continuum limit, converges to the solution of a Laplace-Beltrami equation on a high dimensional manifold. Furthermore, we propose end-to-end training and testing algorithms for this new architecture. The proposed DNN with graph interpolating activation integrates the advantages of both deep learning and manifold learning. Compared to the conventional DNNs with the softmax function as output activation, the new framework demonstrates the following major advantages: First, it is better applicable to data-efficient learning in which we train high capacity DNNs without using a large number of training data. Second, it remarkably improves both natural accuracy on the clean images and robust accuracy on the adversarial images crafted by both white-box and black-box adversarial attacks. Third, it is a natural choice for semi-supervised learning. For reproducibility, the code is available at urlhttps://github.com/BaoWangMath/DNN-DataDependentActivation.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 16 Jul 2019.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 0; 2023: 0; 2024: 0; 2025: 1.

3 papers.