The best lattice reduction algorithm known in theory for approximating the Shortest Vector Problem (SVP) over lattices is slide (STOC '08 & CRYPTO '20). In this paper, we first improve running time analysis of computing slide-reduced bases based on potential functions. This applies to a generic that includes (natural variants of) and block-Rankin (ANTS '14). We then present rigorous dynamic usi...

We consider a sequential assortment selection problem where the user choice is given by multinomial logit (MNL) model whose parameters are unknown. In each period, learning agent observes d-dimensional contextual information about and N available items, offers an of size K to user, bandit feedback item chosen from assortment. propose upper confidence bound based algorithms for this MNL bandit. ...

In the changing financial market, price of products fluctuates continuously over time. The study static term structure interest rate on market can no longer satisfy actual needs, and dynamic model is imperative. Compared with structure, introduces a stochastic differential basis rate. This paper shows some relevant models including Vasicek Model, Single-Factor Dynamic Multi-Factor Kalman Filter...