# Past Events

# Probabilistic Graphical Models and Phase Transitions

# Possible and Impossible Cells

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

We study the logistics system of eukaryotic cells, whose warehouses are micron-scale "organelles" and whose trucks are 10-nanometer-scale "vesicles". Organelles form the nodes and vesicle fluxes form the edges of a transport graph.

# Quasipolynomial Hitting Sets for Circuits With Restricted Parse Trees

## Organisers:

## Time:

## Venue:

The polynomial identity testing task is to determine whether a given circuit computes the zero polynomial.

# Compactness and Large Deviations

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

In a reasonable topological space, large deviation estimates essentially deal with probabilities of events that are asymptotically (exponentially) small, and in a certain sense, quantify the rate of these decaying probabilities.

# Logical Relations

## Speaker:

## Organisers:

## Time:

## Venue:

Logical relations are proof techniques that can be used to prove properties about languages like normalization, type safety, program equivalence and are closed under elimination.

# Pfaffian Orientations and Conformal Minors

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Valiant (1979) showed that unless $P = NP$, there is no polynomial-time algorithm to compute the number of perfect matchings of a given graph --- even if the input graph is bipartite.

# Accelerating Stochastic Gradient Descent

## Speaker:

## Organisers:

## Time:

## Venue:

There is widespread sentiment that it is not possible to effectively utilize fast gradient methods (e.g.

# On Circuit Depth of Symmetric Boolean Functions

## Organisers:

## Time:

## Venue:

A boolean circuit is a natural model of computation for Boolean functions. Size and Depth of a circuit are two measures of complexity of the circuit.

# Is Submodularity Testable?

## Organisers:

## Time:

## Venue:

We initiate the study of property testing of submodularity on the boolean hypercube. Submodular functions come up in a variety of applications in combinatorial optimization.