A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Paper solves NP-hard haplotyping problem using matrix completion.
The perennial problem of "how many clusters?" remains an issue of substantial interest in data mining and machine learning communities, and becomes particularly salient in large data sets such as populational genomic data where the number of clusters needs to be relatively large and open-ended. This problem gets furthe…
This paper is concerned with jointly recovering node-variables from a collection of pairwise difference measurements. Imagine we acquire a few observations taking the form of ; the observation pattern is represented by a measurement graph with an ed…