Title: Detectabilty and Related Hypotheses Testing, Asymptotic Theorems, and Computational Complexity
- Speaker: Dr. Xiaoming Huo, Georgia Institute of Technology and NSF, Program Director Statistics Program (MPS/DMS)
- Date & Time: Friday, April 4, 3:30-4:30 pm
- Location: Duques Hall, Room 152 (2201 G Street NW, Washington, DC 20052)
- Directions: Foggy Bottom-GWU Metro Stop on the Orange and Blue Lines. The campus map is at http://www.gwu.edu/explore/visitingcampus/campusmaps.
- Sponsor: The George Washington University, Department of Statistics. See http://statistics.columbian.gwu.edu/ for a list of seminars.
Abstract:
The Detectability problem determines when certain type of underlying structures is detectable from noisy images. The methodology will base on analyzing the pattern of a collection of local tests. The aggregation of these testing results needs to ensure both statistical efficiency and low computational complexity. In particular, certain testing methods will depend on the distribution of the length of the longest chains that connect locally significant hypotheses tests. The asymptotic distribution of these largest lengths will reveal properties of the test. I will describe some optimality guarantee of proposed detection methods. Statistical aspect of the problem will be focused. Audience only needs to have knowledge on hypotheses testing and asymptotic theory. The strategy of testing locally and deciding globally may have applications in other statistical problems, in which the alternative hypotheses are complicated or overwhelming. In the last part of this presentation, I will give an overview of NSF programs that are related to statistics.
