## 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.

Speaker:

Tapan Shah, TIFR

Friday, 16 August 2013, 16:00 to 17:30

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.

Pulkit Grover

Friday, 16 August 2013, 14:00 to 15:00

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

Aditya Gopalan

Wednesday, 7 August 2013, 11:00 to 12:00

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.

Murad Banaji

Tuesday, 6 August 2013, 16:00 to 17:00

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.

Abhishek Bhrushundi

Monday, 5 August 2013, 16:00 to 17:00

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

Speaker:

Naqueeb Ahmad Warsi, TIFR

Friday, 26 July 2013, 14:30 to 16:00

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.

Yashodhan Kanoria

Wednesday, 24 July 2013, 14:30 to 15:30

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.

Doron Puder

Tuesday, 23 July 2013, 11:00 to 12:00

We present a new approach to showing that random graphs are nearly optimal expanders. This approach is based on deep results from combinatorial group theory. It applies both to regular and irregular random graphs.

Speaker:

Mohit Garg, TIFR

Friday, 19 July 2013, 14:30 to 16:00

The permanent of a doubly stochastic matrix is at least that of the matrix with each entry $1/n$ (the matrices are $n x n$).