Past Events

We study the trade-off between delivery delay and energy consumption in a delay tolerant network in which a message (or a file) has to be delivered to each of several destinations by epidemic relaying. In addition to the destinations, there are several other nodes in the network that can assist in relaying the message. We first assume that, at every instant, all the nodes know the number of relays carrying the packet and the number of destinations that have received the packet.

Increasingly, optimization problems in machine learning, especially those arising from high-dimensional statistical estimation tasks, involve a large number of variables. As regards the statistical estimation tasks themselves, methods developed over the past decade have been shown to have *statistical or sample complexity* that depends only weakly on the number of parameters, when there is some structure to the problem, such as sparsity. A central question is whether similar advances can be made in their *computational complexity* as well.

Wireless networks are inherently limited by their own interference. Therefore, a lot of research focuses on interference reduction techniques, such as mutiuser MIMO, interference alignment, interference coordination or multi-cell processing. Although these techniques might lead to considerable performance gains, it is unlikely that they will be able to meet the demand for wireless data traffic in the future. Therefore, a significant network densification, i.e., increasing the number of antennas per unit area, is inevitable.

With the exponential increase in high rate traffic driven by a new generation of wireless devices, data is expected to overwhelm cellular network capacity in the near future. Femtocell networks have been recently proposed as an efficient and cost-effective approach to provide unprecedented levels of network capacity and coverage.

Peer-to-peer networks are networks without a massive central server. Instead, each peer in the network transmits the data it receives to a subset of other peers in the network, thus propagating information in the network.  We will illustrate the application of random graphs to the problem of designing simple distributed algorithms for peer-to-peer streaming applications (such as live video) that can achieve high throughput and low delay, while maintaining a very small neighbor set for each peer. The talk will be based on joint work with Joohwan Kim.

The problem of recovering a sparse signal from an underdetermined set of linear equations is paramount in many applications such as compressed sensing, genomics, and machine learning. While significant advances have been made in this area, providing useful insights and intuitions, many important questions are still open including the fundamental performance limits of the recovery algorithms.

I will discuss deep connections between Statistical Learning, Online Learning and Optimization.  I will show that there is a tight correspondence between the sample size required for learning and the number of local oracle accesses required for optimization, and thesame measures of "complexity" (e.g. the fat-shattering dimension or Rademacher complexity) control both of them.

Climate data presents unique challenges for machine learning due to its spatiotemporal nature and high-dimensionality. In this talk, I will discuss two applications of high-dimensional modeling for climate data analysis. The first application is on abrupt change detection, with emphasis on detecting significant droughts in the past century. The problem is formalized as a graph-structured linear program (GSLP), and solved using KL-ADM, a novel parallel inexact alternating directions method with Bethe entropy based augmentation. KL-ADM is provably guaranteed to solve GSLPs, and is

This talk will deal with the notions of adaptive and non-adaptive information, in the context of statistical learning and inference.  Suppose that we have a collection of models (e.g., signals, systems, representations, etc.) denoted by X and a collection of measurement actions (e.g., samples, probes, queries, experiments, etc.) denoted by Y. A particular model x in X best describes the problem at hand and is measured as follows.  Each measurement action, y in Y, generates an observation y(x) that is a function of the unknown model.

This talk will deal with the notions of adaptive and non-adaptive information, in the context of statistical learning and inference.  Suppose that we have a collection of models (e.g., signals, systems, representations, etc.) denoted by X and a collection of measurement actions (e.g., samples, probes, queries, experiments, etc.) denoted by Y. A particular model x in X best describes the problem at hand and is measured as follows.  Each measurement action, y in Y, generates an observation y(x) that is a function of the unknown model.