# A-201 (STCS Seminar Room)

# Improved Strong Upper Bounds for Policy Iteration

## Speaker:

## Organisers:

## Time:

## Venue:

**Abstract: **Markov Decision Problems (MDPs) are a well-studied abstraction of sequential decision making. Policy Iteration (PI) is a classical, widely-used family of algorithms to compute an optimal policy for a given MDP.

# Topology, Knowledge, Belief and Their Logics

## Speaker:

## Organisers:

## Time:

## Venue:

Abstract: We shall discuss the logical interpretation of Topology and Topological interpretations of various Logics.

# Spencer's Proof of a Random Greedy Packing

## Organisers:

## Time:

## Venue:

We will prove the following theorem which gives an alternate proof to the Erdős-Hanani conjecture.

# On the Weakness of Linear Decision Lists

## Organisers:

## Time:

## Venue:

Abstract:

We consider functions computable efficiently by "linear decision lists", which are decision lists where the queries are linear threshold functions.

# On Randomization and Combinatorics in Computational Geometry, Discrete Mathematics, and Combinatorial Representation Theory.

## Speaker:

## Organisers:

## Time:

## Venue:

**Abstract:** In this talk we shall see three very different areas of applications of combinatorics in mathematics and computer science, illustrating different flavours of combinatorial reasoning.

# Quadratic Loss Minimization with Portfolio and Intertemporal Wealth Constraints

## Speaker:

## Organisers:

## Time:

## Venue:

We address a problem of stochastic optimal control motivated by portfolio optimization in mathematical finance, the goal of which is to minimize the expected value of a general quadratic loss function of the wealth at close of trade when there is

# Edit Distance Codes via Synchronization Strings

## Speaker:

## Organisers:

## Time:

## Venue:

I will describe a recent approach to designing codes that correct for "editing" errors - i.e., where an adversary is allowed to delete some of the symbols in a string being transmitted and insert new symbols. The classical Hamming model of errors

# Regret Analysis of Multi Armed Bandits

## Organisers:

## Time:

## Venue:

Consider a system with K arms, arm $i$ yielding a payoff $X_{i}$, according to the distribution $P_{i}$.

# Optimisation Using the D-Wave Adiabatic Quantum Computer

## Speaker:

## Organisers:

## Time:

## Venue:

Even though classical computers have evolved immensely in the past decades, there remain problems that we can never imagine solving on a classical computer in reasonable time.