INFO1010 Coursework 3 - Feedback

A summary document providing generic feedback on student performance encompassing the group presentation and the peer markin

Engineering Foundation Year Lecture 4 Handout - feedback on previous portfolios

Handout: Lecture 4 Feedback and reflection on previous portfolios provides generic feedback to students on portfolio task, used as example in subsequent year

Stochastic models and numerical algorithms for a class of regulatory gene networks

Regulatory gene networks contain generic modules like those involving feedback loops, which are essential for the regulation of many biological functions. We consider a class of self-regulated genes which are the building blocks of many regulatory gene networks, and study the steady state distributions of the associated Gillespie algorithm by providing efficient numerical algorithms. We also study a regulatory gene network of interest in synthetic biology and in gene therapy, using mean-field models with time delays. Convergence of the related time-nonhomogeneous Markov chain is established for a class of linear catalytic networks with feedback loop

Delayed feedback control of unstable steady states with high-frequency modulation of the delay

We analyze the stabilization of unstable steady states by delayed feedback control with a periodic time-varying delay in the regime of a high-frequency modulation of the delay. The average effect of the delayed feedback term in the control force is equivalent to a distributed delay in the interval of the modulation, and the obtained distribution depends on the type of the modulation. In our analysis we use a simple generic normal form of an unstable focus, and investigate the effects of phase-dependent coupling and the influence of the control loop latency on the controllability. In addition, we have explored the influence of the modulation of the delays in multiple delay feedback schemes consisting of two independent delay lines of Pyragas type. A main advantage of the variable delay is the considerably larger domain of stabilization in parameter space.Comment: 17 pages, 16 figures, RevTeX, additional section on multiple delay feedback control adde

Reducing Dueling Bandits to Cardinal Bandits

We present algorithms for reducing the Dueling Bandits problem to the conventional (stochastic) Multi-Armed Bandits problem. The Dueling Bandits problem is an online model of learning with ordinal feedback of the form "A is preferred to B" (as opposed to cardinal feedback like "A has value 2.5"), giving it wide applicability in learning from implicit user feedback and revealed and stated preferences. In contrast to existing algorithms for the Dueling Bandits problem, our reductions -- named \Doubler, \MultiSbm and \DoubleSbm -- provide a generic schema for translating the extensive body of known results about conventional Multi-Armed Bandit algorithms to the Dueling Bandits setting. For \Doubler and \MultiSbm we prove regret upper bounds in both finite and infinite settings, and conjecture about the performance of \DoubleSbm which empirically outperforms the other two as well as previous algorithms in our experiments. In addition, we provide the first almost optimal regret bound in terms of second order terms, such as the differences between the values of the arms