We consider a node-monitor pair, where updates are generated stochastically (according to a known distribution) at the node that it wishes to send to the monitor.
This will be a tweaked version of my Qualifier talk. I will mostly focus on:
1. The notion of interventional distributions (as defined by Judea Pearl) and how they can be used to identify causal linkages.
Over the past few decades, asymptotic study of financial systems has become an integral part of practical decision making and analytics. Realistic financial systems are complex, and undesirable events in them are often rare.
Query algorithms are everywhere. Gradient Descent is a well-known algorithm that queries the gradient of a hidden function and moves towards the minimum of the function.
Abstract-In a coordination problem, users in a network observing correlated inputs collaborate to evaluate possibly randomized functions of the inputs. Problems of this kind have been widely studied in the information theory literature.
Abstract: In modern applications of graph algorithms, where the graphs of interest are large and dynamic, it is unrealistic to assume that an input representation contains the full information of a graph being studied.
Abstract: We present a general framework, applicable to both truthful and non-truthful auctions, for designing approximately revenue-optimal mechanisms for multi-item additive auctions.
Abstract: We study the sum of squares (*SOS*) representation of polynomials, i.e. f = \sum_{i\in s} c_i f_i^2 , where c_i are field elements and f_i(x_1,\ldots,x_n) are polynomials.
The paper, "Improved Bounds for Perfect Sampling of k-Colorings in Graphs," jointly authored by Siddharth Bhandari and Sayantan Chakraborty, received the Best Student