Jan. 17, 2022, 2:10 a.m. | Carlo Baldassi

cs.LG updates on arXiv.org arxiv.org

We introduce an evolutionary algorithm called recombinator-$k$-means for
optimizing the highly non-convex kmeans problem. Its defining feature is that
its crossover step involves all the members of the current generation,
stochastically recombining them with a repurposed variant of the $k$-means++
seeding algorithm. The recombination also uses a reweighting mechanism that
realizes a progressively sharper stochastic selection policy and ensures that
the population eventually coalesces into a single solution. We compare this
scheme with state-of-the-art alternative, a more standard genetic algorithm …

algorithm arxiv

Senior Machine Learning Engineer (MLOps)

@ Promaton | Remote, Europe

IT Commercial Data Analyst - ESO

@ National Grid | Warwick, GB, CV34 6DA

Stagiaire Data Analyst – Banque Privée - Juillet 2024

@ Rothschild & Co | Paris (Messine-29)

Operations Research Scientist I - Network Optimization Focus

@ CSX | Jacksonville, FL, United States

Machine Learning Operations Engineer

@ Intellectsoft | Baku, Baku, Azerbaijan - Remote

Data Analyst

@ Health Care Service Corporation | Richardson Texas HQ (1001 E. Lookout Drive)