Why and when can deep-but not shallow-networks avoid the curse of dimensionality: a review

T Poggio, H Mhaskar, L Rosasco, B Miranda… - International Journal of …, 2017 - Springer
The paper reviews and extends an emerging body of theoretical results on deep learning
including the conditions under which it can be exponentially better than shallow learning. A …

A comprehensive survey of prognostics and health management based on deep learning for autonomous ships

AL Ellefsen, V Æsøy, S Ushakov… - IEEE Transactions on …, 2019 - ieeexplore.ieee.org
The maritime industry widely expects to have autonomous and semiautonomous ships
(autoships) in the near future. In order to operate and maintain complex and integrated …

Automated melanoma recognition in dermoscopy images via very deep residual networks

L Yu, H Chen, Q Dou, J Qin… - IEEE transactions on …, 2016 - ieeexplore.ieee.org
Automated melanoma recognition in dermoscopy images is a very challenging task due to
the low contrast of skin lesions, the huge intraclass variation of melanomas, the high degree …

Deep networks with stochastic depth

G Huang, Y Sun, Z Liu, D Sedra… - Computer Vision–ECCV …, 2016 - Springer
Very deep convolutional networks with hundreds of layers have led to significant reductions
in error on competitive benchmarks. Although the unmatched expressiveness of the many …

Training very deep networks

RK Srivastava, K Greff… - Advances in neural …, 2015 - proceedings.neurips.cc
Theoretical and empirical evidence indicates that the depth of neural networks is crucial for
their success. However, training becomes more difficult as depth increases, and training of …

Highway networks

RK Srivastava, K Greff, J Schmidhuber - arXiv preprint arXiv:1505.00387, 2015 - arxiv.org
There is plenty of theoretical and empirical evidence that depth of neural networks is a
crucial ingredient for their success. However, network training becomes more difficult with …

Benefits of depth in neural networks

M Telgarsky - Conference on learning theory, 2016 - proceedings.mlr.press
For any positive integer k, there exist neural networks with Θ (k^ 3) layers, Θ (1) nodes per
layer, and Θ (1) distinct parameters which can not be approximated by networks with O (k) …

[图书][B] Analysis of boolean functions

R O'Donnell - 2014 - books.google.com
Boolean functions are perhaps the most basic objects of study in theoretical computer
science. They also arise in other areas of mathematics, including combinatorics, statistical …

SV-RCNet: workflow recognition from surgical videos using recurrent convolutional network

Y Jin, Q Dou, H Chen, L Yu, J Qin… - IEEE transactions on …, 2017 - ieeexplore.ieee.org
We propose an analysis of surgical videos that is based on a novel recurrent convolutional
network (SV-RCNet), specifically for automatic workflow recognition from surgical videos …

The computational complexity of linear optics

S Aaronson, A Arkhipov - Proceedings of the forty-third annual ACM …, 2011 - dl.acm.org
We give new evidence that quantum computers--moreover, rudimentary quantum computers
built entirely out of linear-optical elements--cannot be efficiently simulated by classical …