In this talk we will discuss the rate distortion theory from the viewpoint of the information-spectrum so that we can treat arbitrary general sources (not necessarily memoryless and stationary)·

In this talk, I'll discuss the pathwise optimization (PO) method for stochastic control problem. We will first see how the method produces upper and lower bounds on the optimal value of a high-dimensional optimal stopping problem.

This talk will be an introduction to pseudorandomness. We will motivate it's study and connect it to 'unpredictability' through a theorem by Yao.

Reference: Computational Complexity, Arora and Barak, chapter 20 (Derandomization)

The main purpose of this talk will be to promote the study of computational aspects, primarily the convergence rate, of non-linear dynamical systems from a combinatorial perspective.

A unate gate is a logical gate computing a unate Boolean function, which is monotone in each variable. Examples of unate gates are AND gates, OR gates, NOT gates, threshold gates etc.