YINS 9/17 Applied DS Seminar, Andrew Barron: Deep Learning

“Accuracy of High-Dimensional Deep Learning Networks”

Speaker: Andrew Barron
Professor of Statistics and Data Science at Yale University

Monday, September 17, 4:15-5:30pm

Location: Yale Institute for Network Science, 17 Hillhouse Ave, Room 328

Talk summary: It has been experimentally observed in recent years that multi-layer artificial neural networks have a surprising ability to generalize, even when trained with far more parameters than observations. Is there a theoretical basis for this? The best available bounds on their metric entropy and associated complexity measures are essentially linear in the number of parameters, which is inadequate to explain this phenomenon. Here we examine the statistical risk (mean squared predictive error) of multi-layer networks with L1 controls on their parameters and with ramp activation functions (also called lower-rectified linear units). In this setting, the risk is shown to be upper-bounded by [(L^3 log d)/n]^{1/2}, where d is the input dimension to each layer, L is the number of layers, and n is the sample size. In this way, the input dimension can be much larger than the sample size and the estimator can still be accurate, provided the target function has such L1 controls and that the sample size is at least moderately large compared to L^3 log d. The heart of the analysis is the development of a sampling strategy that demonstrates the accuracy of a sparse covering of deep ramp networks. Lower bounds show that the identified risk is minimax optimal, this being so already in the subclass of functions with L = 2. This is joint work with Jason Klusowski.

Statseminars Fwd: YINS 9/12 YINS Seminar, Constantinos Daskalakis: Adversarial Networks

“Improving Generative Adversarial Networks using Game Theory and Statistics”

Speaker: Constantinos Daskalakis
Professor of Computer Science and Electrical Engineering at MIT

Wednesday, September 12, 12:00-1:00pm

Location: Yale Institute for Network Science, 17 Hillhouse Ave, Room 328

Talk summary: Generative Adversarial Networks (aka GANs) are a recently proposed approach for learning samplers of high-dimensional distributions with intricate structure, such as distributions over natural images, given samples from these distributions. They are obtained by setting up a two-player zero-sum game between two neural networks, which learn statistics of a target distribution by adapting their strategies in the game using gradient descent. Despite their intriguing performance in practice, GANs pose great challenges to both optimization and statistics. Their training suffers from oscillations, and they are difficult to scale to high-dimensional settings. We study how game-theoretic and statistical techniques can be brought to bear on these important challenges. We use Game Theory towards improving GAN training, and Statistics towards scaling up the dimensionality of the generated distributions.

Updated invitation: jclub, MTG =NEXT-in-list TIME:exact,Bass434 – jc00 (nor… @ Thu Aug 30, 2018 11:30am – 1pm (EDT) (all)

Dear all,

I’ll present "Multi-scale deep tensor factorization learns a latent representation of the human epigenome" for tomorrow’s journal club.

This paper from Noble’s lab presents a method to impute human epigenome, and demonstrated its usage in broad context.

This work was preceded by their previous work known as PREDICTD, which I will also discuss briefly tomorrow.

You can find the bioRxiv preprint here.

Thanks,

Mengting

Journal Club by TXL

Hi all,

Here is the paper I will present tomorrow:

Dynamic interplay between enhancer–promoter topology and gene activity

https://www.nature.com/articles/s41588-018-0175-z

Best,
Tianxiao

Journal Club by JG

Hi all,

Here is the paper I present this week:

A transcriptome-wide association study of 229,000 women identifies new candidate susceptibility genes for breast cancer

https://www.nature.com/articles/s41588-018-0132-x

Best,
Jiahao