Kohei Miyamoto

A Quantum Algorithm for Finding $k$-Minima

2019 · arXiv (Cornell University)

We propose a new finding $k$-minima algorithm and prove that its query complexity is $\mathcal{O}(\sqrt{kN})$, where $N$ is the number of data indices. Though the complexity is equivalent to that of an existing method, the …

Improved MDL Estimators Using Local Exponential Family Bundles Applied to Mixture Families

2019

The MDL estimators for density estimation, which are defined by two-part codes for universal coding, are analyzed. We give a two-part code for mixture families whose regret is close to the minimax regret, where regret …