Pith. sign in

REVIEW 1 cited by

How far can we go without convolution: Improving fully-connected networks

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1511.02580 v1 pith:WZ25MAV3 submitted 2015-11-09 cs.LG cs.NE

classification cs.LGcs.NE
keywords networkconnectedfullyaccuracyapproachesimprovingnetworksperformance
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose ways to improve the performance of fully connected networks. We found that two approaches in particular have a strong effect on performance: linear bottleneck layers and unsupervised pre-training using autoencoders without hidden unit biases. We show how both approaches can be related to improving gradient flow and reducing sparsity in the network. We show that a fully connected network can yield approximately 70% classification accuracy on the permutation-invariant CIFAR-10 task, which is much higher than the current state-of-the-art. By adding deformations to the training data, the fully connected network achieves 78% accuracy, which is just 10% short of a decent convolutional network.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Simple Baseline for Stable and Plastic Neural Networks

    cs.LG 2025-07 conditional novelty 4.0 of 10

    RDBP combines a new activation (ReLUDown) with decaying backpropagation to achieve strong stability and plasticity on Continual ImageNet with low overhead.

Pith tools