Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Thomas Wiatowski

dblp:161/9880 · DBLP profile ↗
← Back
6ranked-venue papers
4as first author
0since 2021 · last 2018
0000-0002-1848-6593ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 3 · 1 first-authorTheory of computation · 2 · 2 first-authorArtificial intelligence and machine learning · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Deep learning architectures and training · 50% Representation and self-supervised learning · 36% Learning theory · 4%

Topics — the 8 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Deep learning architectures and training
convolutional neural network
0.722018
Energy Propagation in Deep Convolutional Neural Networks · IEEE Trans. Inf. Theory 2018
A Mathematical Theory of Deep Convolutional Neural Networks for Feature Extraction · IEEE Trans. Inf. Theory 2018
Machine learning › Representation and self-supervised learning
scattering network
0.722018
Energy Propagation in Deep Convolutional Neural Networks · IEEE Trans. Inf. Theory 2018
A Mathematical Theory of Deep Convolutional Neural Networks for Feature Extraction · IEEE Trans. Inf. Theory 2018
Machine learning › Deep learning architectures and training › convolutional neural network
translation invariance
0.312018
A Mathematical Theory of Deep Convolutional Neural Networks for Feature Extraction · IEEE Trans. Inf. Theory 2018
Machine learning › Representation and self-supervised learning › representation learning
feature extraction
0.212016
Discrete Deep Feature Extraction: A Theory and New Architectures · ICML 2016
Machine learning › Learning theory
generalization bounds
0.112018
A Mathematical Theory of Deep Convolutional Neural Networks for Feature Extraction · IEEE Trans. Inf. Theory 2018
Robotics › Motion planning and robot control
stability analysis
0.112018
Energy Propagation in Deep Convolutional Neural Networks · IEEE Trans. Inf. Theory 2018
Computer vision › Face, body and person analysis
face alignment
0.112016
Discrete Deep Feature Extraction: A Theory and New Architectures · ICML 2016
Computer vision › Image recognition and object detection › character recognition
handwritten digit recognition
0.112016
Discrete Deep Feature Extraction: A Theory and New Architectures · ICML 2016

Methods — techniques the papers use, named apart from their topics

wavelet transform · 0.7frame theory · 0.7lipschitz analysis · 0.3analyticity conditions · 0.3translation sensitivity analysis · 0.2deformation sensitivity analysis · 0.2
YearPublicationVenuePosition
2018 A Mathematical Theory of Deep Convolutional Neural Networks for Feature Extraction
abstract
Deep convolutional neural networks (DCNNs) have led to breakthrough results in numerous practical machine learning tasks, such as classification of images in the ImageNet data set, control-policy-learning to play Atari games or the board game Go, and image captioning. Many of these applications first perform feature extraction and then feed the results thereof into a classifier. The mathematical analysis of DCNNs for feature extraction was initiated by Mallat, 2012. Specifically, Mallat considered so-called scattering networks based on a wavelet transform followed by the modulus non-linearity in each network layer, and proved translation invariance (asymptotically in the wavelet scale parameter) and deformation stability of the corresponding feature extractor. This paper complements Mallat's results by developing a theory that encompasses general convolutional transforms, or in more technical parlance, general semi-discrete frames (including Weyl-Heisenberg filters, curvelets, shearlets, ridgelets, wavelets, and learned filters), general Lipschitz-continuous non-linearities (e.g., rectified linear units, shifted logistic sigmoids, hyperbolic tangents, and modulus functions), and general Lipschitz-continuous pooling operators emulating, e.g., sub-sampling and averaging. In addition, all of these elements can be different in different network layers. For the resulting feature extractor, we prove a translation invariance result of vertical nature in the sense of the features becoming progressively more translation-invariant with increasing network depth, and we establish deformation sensitivity bounds that apply to signal classes such as, e.g., band-limited functions, cartoon functions, and Lipschitz functions.
Thomas Wiatowski, Helmut Bölcskei
IEEE Trans. Inf. Theory1
2018 Energy Propagation in Deep Convolutional Neural Networks
abstract
Many practical machine learning tasks employ very deep convolutional neural networks. Such large depths pose formidable computational challenges in training and operating the network. It is therefore important to understand how fast the energy contained in the propagated signals (a.k.a. feature maps) decays across layers. In addition, it is desirable that the feature extractor generated by the network be informative in the sense of the only signal mapping to the all-zeros feature vector being the zero input signal. This “trivial null-set” property can be accomplished by asking for “energy conservation” in the sense of the energy in the feature vector being proportional to that of the corresponding input signal. This paper establishes conditions for energy conservation (and thus for a trivial null-set) for a wide class of deep convolutional neural network-based feature extractors and characterizes corresponding feature map energy decay rates. Specifically, we consider general scattering networks employing the modulus non-linearity and we find that under mild analyticity and high-pass conditions on the filters (which encompass, inter alia, various constructions of Weyl-Heisenberg filters, wavelets, ridgelets, (α)-curvelets, and shearlets) the feature map energy decays at least polynomially fast. For broad families of wavelets and Weyl-Heisenberg filters, the guaranteed decay rate is shown to be exponential. Moreover, we provide handy estimates of the number of layers needed to have at least ((1-ε) 100)% of the input signal energy be contained in the feature vector.
Thomas Wiatowski, Philipp Grohs, Helmut Bölcskei
IEEE Trans. Inf. Theory1
2017 Energy decay and conservation in deep convolutional neural networks
abstract
Many practical machine learning tasks employ very deep convolutional neural networks. Such large depths pose formidable computational challenges in training and operating the network. It is therefore important to understand how many layers are actually needed to have most of the input signal's features be contained in the feature vector generated by the network. This question can be formalized by asking how quickly the energy contained in the feature maps decays across layers. In addition, it is desirable that none of the input signal's features be “lost” in the feature extraction network or, more formally, we want energy conservation in the sense of the energy contained in the feature vector being proportional to that of the corresponding input signal. This paper establishes conditions for energy conservation for a wide class of deep convolutional neural networks and characterizes corresponding feature map energy decay rates. Specifically, we consider general scattering networks, and find that under mild analyticity and high-pass conditions on the filters (which encompass, inter alia, various constructions of Weyl-Heisenberg filters, wavelets, ridgelets,(α)-curvelets, and shearlets) the feature map energy decays at least polynomially. For broad families of wavelets and Weyl-Heisenberg filters, the guaranteed decay rate is shown to be exponential. Our results yield handy estimates of the number of layers needed to have at least ((1 − ε) · 100)% of the input signal energy be contained in the feature vector.
Philipp Grohs, Thomas Wiatowski, Helmut Bölcskei
ISIT2
2016 Discrete Deep Feature Extraction: A Theory and New Architectures
abstract
First steps towards a mathematical theory of deep convolutional neural networks for feature extraction were made—for the continuous-time case—in Mallat, 2012, and Wiatowski and Bölcskei, 2015. This paper considers the discrete case, introduces new convolutional neural network architectures, and proposes a mathematical framework for their analysis. Specifically, we establish deformation and translation sensitivity results of local and global nature, and we investigate how certain structural properties of the input signal are reflected in the corresponding feature vectors. Our theory applies to general filters and general Lipschitz-continuous non-linearities and pooling operators. Experiments on handwritten digit classification and facial landmark detection—including feature importance evaluation—complement the theoretical findings.
Thomas Wiatowski, Michael Tschannen, Aleksandar Stanic, Philipp Grohs, Helmut Bölcskei
ICML1
2016 Deep convolutional neural networks on cartoon functions
abstract
Wiatowski and Bölcskei, 2015, proved that deformation stability and vertical translation invariance of deep convolutional neural network-based feature extractors are guaranteed by the network structure per se rather than the specific convolution kernels and non-linearities. While the translation invariance result applies to square-integrable functions, the deformation stability bound holds for band-limited functions only. Many signals of practical relevance (such as natural images) exhibit, however, sharp and curved discontinuities and are hence not band-limited. The main contribution of this paper is a deformation stability result that takes these structural properties into account. Specifically, we establish deformation stability bounds for the class of cartoon functions introduced by Donoho, 2001.
Philipp Grohs, Thomas Wiatowski, Helmut Bölcskei
ISIT2
2015 Deep convolutional neural networks based on semi-discrete frames
abstract
Deep convolutional neural networks have led to breakthrough results in practical feature extraction applications. The mathematical analysis of these networks was pioneered by Mallat [1]. Specifically, Mallat considered so-called scattering networks based on identical semi-discrete wavelet frames in each network layer, and proved translation-invariance as well as deformation stability of the resulting feature extractor. The purpose of this paper is to develop Mallat's theory further by allowing for different and, most importantly, general semi-discrete frames (such as, e.g., Gabor frames, wavelets, curvelets, shearlets, ridgelets) in distinct network layers. This allows to extract wider classes of features than point singularities resolved by the wavelet transform. Our generalized feature extractor is proven to be translation-invariant, and we develop deformation stability results for a larger class of deformations than those considered by Mallat. For Mallat's wavelet-based feature extractor, we get rid of a number of technical conditions. The mathematical engine behind our results is continuous frame theory, which allows us to completely detach the invariance and deformation stability proofs from the particular algebraic structure of the underlying frames.
Thomas Wiatowski, Helmut Bölcskei
ISIT1