In a multi-armed bandit problem, an online algorithm chooses from a set of strategies in a sequence of trials so as to maximize the total payoff of the chosen strategies. While the performance of bandit algorithms with a small finite strategy set is quite well understood, bandit problems with large strategy sets are still a topic of very active investigation, motivated by practical applications...

In this work channel is modelled with synchronization errors due to the mismatches between the transmitter and receiver clocks using bit drop-outs (deletions).[3] Each bit is received independently in the binary symmetric channel with error probability P where each bit is erased, Shannon invented the fundamental results through the development as well as analysis of low density parity check cod...

We discuss, in varying degrees of detail, three contemporary themes in prime number theory. Topic 1: the work of Goldston, Pintz and Yıldırım on short gaps between primes. Topic 2: the work of Mauduit and Rivat, establishing that 50% of the primes have odd digit sum in base 2. Topic 3: work of Tao and the author on linear equations in primes. Introduction. These notes are to accompany two lectu...

We develop tight lower bounds for the regret achievable by the widely used Multiplicative Weights Algorithm (MWA) on the fundamental problem of prediction with expert advice. It is well known that with k experts and T steps, MWA suffers a (minimax) regret of at most √ T ln k 2 [7]. In this work, we show that as T → ∞, MWA suffers a regret of at least √ T ln k 2 for every even k, thereby precise...

A stereo analogue of the Comsweet tuminance illusion was discovered. and measured by a null method. Two flat vertical textured surfaces in the frontoparallel plane met at a vertical boundary, at which the left-hand surface curved slightly forward and the right-hand surface curved back by an equal amount. The protruding left edge was jointed to the receding right edge by a step. Result: although...