# Past Events

# A Markov Chain Approximation for Choice Modeling

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

# A Statistical View to Boosting

## Organisers:

## Time:

## Venue:

## Webpage:

In machine learning, AdaBoost has been an extremely popular boosting algorithm to improve the performance of ``weak learners". AdaBoost was initially proposed by Schapire and Freund from an algorithmic perspective.

# Fundamental Limits on Communication Energy Via "Information-friction"

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Just as there are frictional losses in moving a weight on a surface, there are also frictional losses in moving information on a substrate.

# Complex Online Decision Making

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Suppose you want to find the least congested route in an ad hoc network. Each link's rate is unknown and stochastic, and each time you get to see the minimum rate (i.e., bottleneck) along any route you pick.

# Some Mathematical Problems Arising in the Study of Chemical Reaction Networks

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

Networks of chemical reactions have natural underlying combinatorial structure, allowing them to be represented as graphs or digraphs, perhaps with additional vertex or edge colourings/labellings.

# On Testing Bent Functions

## Speaker:

## Organisers:

## Time:

## Venue:

A bent function is a Boolean function all of whose Fourier coefficients are equal in absolute value.

# Deterministic Communication Protocol for Functions with Bounded Rank

# Non-asymptotic Bounds for Various Information Theoretic Problems Using Smooth Renyi Quantities

## Organisers:

## Time:

## Venue:

## Webpage:

In this talk we will discuss about the role played by smooth Renyi quantities in non-asymptotic information theory. In particular, we will discuss about various source coding and channel coding problems in the non-asymptotic regime.

# Unbalanced Random Matching Markets

## Speaker:

## Organisers:

## Time:

## Venue:

## Webpage:

We analyze large random matching markets with unequal numbers of men and women. We find that being on the short side of the market confers a large advantage.