Online Program Home
My Program

Abstract Details

Activity Number: 553
Type: Contributed
Date/Time: Wednesday, August 3, 2016 : 10:30 AM to 12:20 PM
Sponsor: Section on Nonparametric Statistics
Abstract #320385 View Presentation
Title: Reduced Sample-Compressed Learning of Big Probability Distributions
Author(s): Subhadeep Mukhopadhyay*
Companies: Temple University Fox School of Business
Keywords: Big probability distribution ; Data-driven sparse representation ; Nonparametric harmonic analysis

An important class of learning problem that attracted attention from various disciplines such as neuroscience, theoretical computer science, information theory, statistical physics, and machine learning can be viewed as samples from a distribution over large domains. To address the practical problem of `big data little time,' one of the key challenges is to design time and storage-efficient algorithms for large-k probability distributions.

In this talk, I will discuss the `Big Data Tringle' challenge, and present a new viewpoint by integrating many fundamental concepts and tools that might give us taxonomy way of thinking about this general research field. Central to our approach is a new functional representation scheme (nonparametric harmonic analysis) to reduce the size of the problem (dimension of the sufficient statistics) with an eye towards understanding and developing efficient algorithms that are fast enough and accurate enough to make a big difference. Our modeling approach works "reasonably well" in practice and often outperforms the recent `breakthrough' algorithms of theoretical computer science.

Authors who are presenting talks have a * after their name.

Back to the full JSM 2016 program

Copyright © American Statistical Association