We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. We have no repository linked to it either. That is a statement about our graph, not about the paper.
Sparseness is a useful regularizer for learning in a wide range of applications, in particular in neural networks. This paper proposes a model targeted at classification tasks, where sparse activity and sparse connectivity are used to enhance classification capabilities. The tool for achieving this is a sparseness-enforcing projection operator which finds the closest vector with a pre-defined sparseness for any given vector. In the theoretical part of this paper, a comprehensive theory for such a projection is developed. In conclusion, it is shown that the projection is differentiable almost everywhere and can thus be implemented as a smooth neuronal transfer function. The entire model can hence be tuned end-to-end using gradient-based methods. Experiments on the MNIST database of handwritten digits show that classification performance can be boosted by sparse activity or sparse connectivity. With a combination of both, performance can be significantly better compared to classical non-sparse approaches.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1603.08367")
get_code_for_paper("1603.08367")
have("1603.08367")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1603.08367.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1603.08367)
Connect an agent — have() is free.