## Time:

## Venue:

Auto-bidding is a framework of ad auctions where every advertiser can tell their long-term goals, such as budget, target return on spend (RoS), etc., to an auto-bidding agent interface.

Speaker:

Agniv Bandyopadhyay, TIFR

Friday, 24 March 2023, 14:30 to 15:30

Auto-bidding is a framework of ad auctions where every advertiser can tell their long-term goals, such as budget, target return on spend (RoS), etc., to an auto-bidding agent interface.

Speaker:

Santanu Das, TIFR

Friday, 17 March 2023, 16:00 to 17:30

We examine gradient descent on unregularised logistic regression problems, with homogeneous linear predictors on linearly separable datasets. We show the predictor converges to the direction of the max-margin (hard margin SVM) solution.

Speaker:

Varun Ramanathan, TIFR

Friday, 10 March 2023, 16:00 to 17:00

I will complete a couple of proofs from last week's student seminar on determinantal complexity. I will recall the required background for the proofs. On the way, we will learn a cute linear-algebraic fact.

Speaker:

Varun Ramanathan, TIFR

Friday, 3 March 2023, 16:30 to 17:30

We will introduce the notion of determinantal complexity, one of the main characters in the VP vs VNP question, which is the algebraic analogue of the P vs NP question.

Speaker:

Friday, 24 February 2023, 16:00 to 17:00

Fair division of a set of resources among several agents is a commonly occurring problem in many real-world settings.

Speaker:

Eeshan Modak, TIFR

Friday, 17 February 2023, 16:00 to 17:00

In the composite hypothesis testing setting, the detector receives n i.i.d. samples either from a distribution p∈P or from a distribution q∈Q. It then decides the correct set from which the samples were drawn.

Speaker:

Malhar Ajit Managoli, TIFR

Friday, 10 February 2023, 16:00 to 17:00

Fermat's two square theorem states that:

An odd prime p can be written as a sum of two squares if and only if p = 1 (mod 4)

Speaker:

Shanthanu Suresh Rai, TIFR

Friday, 3 February 2023, 16:00 to 17:00

What is the largest number of edges in a graph of order n and girth g? For d-regular graphs, essentially the best known answer is provided by the Moore bound. This result can be extended to cover irregular graphs as well.

Speaker:

Arghya Chakraborty, TIFR

Friday, 20 January 2023, 16:00 to 17:00

In any tournament between several participants, transitivity is sometimes not satisfied (i.e. A may defeat B, B defeats C and C in turn defeats A). In any case, we shall have to define a winner.

Manideep Mamindlapally

Friday, 6 January 2023, 16:00 to 17:00

Quantum computers are in general believed to be more powerful than classical computers, but it is not clear if they are powerful enough to solve problems that a classical computer can’t even verify.