Goto

Collaborating Authors

 aggregate regret


Liquidity-Based Audit of Algorithmic Trading Strategies

arXiv.org Machine Learning

Market microstructure has long classified trading activity by its informational role: an informed trader demands liquidity by trading in the direction of private information, while a market maker supplies liquidity by absorbing that order flow and earning the spread in compensation Kyle (1985); Glosten and Milgrom (1985). This classification is typically recovered from the data the classifier requires: signed order flow, quote revisions, or the sequential-trade structure of the market. The classification is harder to apply to an algorithmic strategy whose internal logic is unobservable. However, the signals or optimization problems generating the decisions of a typical quantitative fund are not visible, even though the trades and reported positions may be available. This paper shows that the liquidity role of such a strategy (consumer or provider) can be recovered from realized portfolio costs and trade decisions alone, without observing quotes, order flow, or any other microstructure-specific signal.



Thresholding Bandit with Optimal Aggregate Regret

Neural Information Processing Systems

We introduce LSA, a new, simple and anytime algorithm that aims to minimize the aggregate regret (or the expected number of mis-classified arms). We prove that our algorithm is instance-wise asymptotically optimal.


Thresholding Bandit with Optimal Aggregate Regret

arXiv.org Machine Learning

We consider the thresholding bandit problem, whose goal is to find arms of mean rewards above a given threshold $\theta$, with a fixed budget of $T$ trials. We introduce LSA, a new, simple and anytime algorithm that aims to minimize the aggregate regret (or the expected number of mis-classified arms). We prove that our algorithm is instance-wise asymptotically optimal. We also provide comprehensive empirical results to demonstrate the algorithm's superior performance over existing algorithms under a variety of different scenarios.