Structure in tensor-variate data: a trivial byproduct of simpler phenomena?

Add to your list(s) Download to your calendar using vCal

• John P. Cunningham
• Tuesday 06 March 2018, 11:00-12:00
• CBL Seminar Room.

If you have a question about this talk, please contact Dr R.E. Turner.

As large tensor-variate data become increasingly common across machine learning and statistics, complex analysis methods for these data similarly increase in prevalence. Such a trend offers the opportunity to understand subtler and more meaningful features of the data that, ostensibly, could not be studied with simpler datasets or simpler methodologies. While promising, these advances are also perilous: novel analysis techniques do not always consider the possibility that their results are in fact an expected consequence of some simpler, already-known feature of simpler data. For example, suppose one fits a time series model (e.g. Kalman Filter or multivariate GARCH ) to data indexed by time, measurement dimension, and experimental sample. Was a particular model fit achieved simply because the data was temporally smooth, and/or had correlated dimensions (or samples)? I will present two works that address this growing problem, the first of which uses Kronecker algebra to derive a tensor-variate maximum entropy distribution that has user-specified moments along each mode. This distribution forms the basis of a statistical hypothesis test, and I will use this test to answer two active debates in the neuroscience community over the triviality of certain observed structure in data. In the second part, I will discuss how to extend this maximum entropy formulation to arbitrary constraints using deep neural network architectures in the flavor of implicit generative modeling, and I will use this method in a texture synthesis application.

John P. Cunningham is an associate professor in the Department of Statistics at Columbia University. He received a B.A. in computer science from Dartmouth College, and a M.S. and Ph.D. in electrical engineering from Stanford University, and he completed postdoctoral work in the Machine Learning Group at the University of Cambridge. His research group at Columbia investigates several areas of machine learning and statistical neuroscience. http://stat.columbia.edu/~cunningham/

This talk is part of the Machine Learning @ CUED series.

This talk is included in these lists:

• Seminar
• All Talks (aka the CURE list)
• Biology
• CBL Seminar Room
• CBL important
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge Forum of Science and Humanities
• Cambridge Language Sciences
• Cambridge Neuroscience Seminars
• Cambridge talks
• Chris Davis' list
• Creating transparent intact animal organs for high-resolution 3D deep-tissue imaging
• Featured lists
• Guy Emerson's list
• Hanchen DaDaDash
• Inference Group Summary
• Information Engineering Division seminar list
• Interested Talks
• Joint Machine Learning Seminars
• Life Science
• Life Sciences
• ML
• Machine Learning @ CUED
• Machine Learning Summary
• Neuroscience
• Neuroscience Seminars
• Neuroscience Seminars
• Required lists for MLG
• Simon Baker's List
• Stem Cells & Regenerative Medicine
• Trust & Technology Initiative - interesting events
• bld31
• dh539
• kt532's list
• my List
• ndk22's list
• ob366-ai4er
• rp587
• yk373's list

Note that ex-directory lists are not shown.