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.
Neural network-based clustering has recently gained popularity, and in particular a constrained clustering formulation has been proposed to perform transfer learning and image category discovery using deep learning. The core idea is to formulate a clustering objective with pairwise constraints that can be used to train a deep clustering network; therefore the cluster assignments and their underlying feature representations are jointly optimized end-to-end. In this work, we provide a novel clustering formulation to address scalability issues of previous work in terms of optimizing deeper networks and larger amounts of categories. The proposed objective directly minimizes the negative log-likelihood of cluster assignment with respect to the pairwise constraints, has no hyper-parameters, and demonstrates improved scalability and performance on both supervised learning and unsupervised transfer learning.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("1806.11078")
get_code_for_paper("1806.11078")
have("1806.11078")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/1806.11078.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/1806.11078)
Connect an agent — have() is free.