Clone of Encoding Facial Behavior in Videos for Identification Purposes- סמינר מחלקה פיסיקלית

סמינר זה יחשב כסמינר שמיעה לתלמידי תואר שני

You are invited to attend a lecture on Tuesday, September 5, 2023 13:00

https://tau-ac-il.zoom.us/j/83680862693?pwd=OFI3SlVWc3hTcW1BVi9rTndHTE1FQT09

Detection and Recovery of Hidden Submatrices

By:

Marom Dadon

MSc. student under the supervision of Dr. Wasim Huleihel and Dr. Tamir Bendory

ABSTRACT

We study the problems of detection and recovery of hidden submatrices with elevated means inside a large Gaussian random matrix. We consider two different structures for the planted submatrices. In the first model, the planted matrices are disjoint, and their row and column indices can be arbitrary. Inspired by scientific applications, the second model restricts the row and column indices to be consecutive. In the detection problem, under the null hypothesis, the observed matrix is a realization of independent and identically distributed standard normal entries. Under the alternative, there exists a set of hidden submatrices with elevated means inside the same standard normal matrix. Recovery refers to the task of locating the hidden submatrices. For both problems, and for both models, we characterize the statistical and computational barriers by deriving information-theoretic lower bounds, designing and analyzing algorithms matching those bounds, and proving computational lower bounds based on the low-degree polynomials conjecture. In particular, we show that the space of the model parameters (i.e., number of planted submatrices, their dimensions, and elevated mean) can be partitioned into three regions: the impossible regime, where all algorithms fail; the hard regime, where while detection or recovery are statistically possible, we give some evidence that polynomial-time algorithm do not exist; and finally the easy regime, where polynomial-time algorithms exist.