We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. We have no repository linked to it either. That is a statement about our graph, not about the paper.
We address the problem of simultaneously learning a k-means clustering and deep feature representation from unlabelled data, which is of interest due to the potential of deep k-means to outperform traditional two-step feature extraction and shallow-clustering strategies. We achieve this by developing a gradient-estimator for the non-differentiable k-means objective via the Gumbel-Softmax reparameterisation trick. In contrast to previous attempts at deep clustering, our concrete k-means model can be optimised with respect to the canonical k-means objective and is easily trained end-to-end without resorting to alternating optimisation. We demonstrate the efficacy of our method on standard clustering benchmarks.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1910.08031")
get_code_for_paper("1910.08031")
have("1910.08031")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1910.08031.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1910.08031)
Connect an agent — have() is free.