Junyan Cheng, Peter Chin
We lifted 11 functions out of this paper's own repositories and ran 9 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| chengjunyan1/TDL | — | 9 of 11 |
| Function | Status | Where it lives |
|---|---|---|
| FocalLossCE | Ran | chengjunyan1/TDL/TAE.py code served (permissive licence) · get_code("15ec9f6c38b4cf37") |
| SoftDiceLoss | Ran | chengjunyan1/TDL/TAE.py code served (permissive licence) · get_code("00bc02f409c5f854") |
| blur | Ran | chengjunyan1/TDL/TAE.py code served (permissive licence) · get_code("8f36bd7abb2340db") |
| focal_loss | Ran | chengjunyan1/TDL/TAE.py code served (permissive licence) · get_code("c1900ff852f0930d") |
| focal_loss_ce | Ran | chengjunyan1/TDL/TAE.py code served (permissive licence) · get_code("78bdc72c574f3ed8") |
| get_params_exclude | Ran | chengjunyan1/TDL/TAE.py code served (permissive licence) · get_code("5b01b7eadd0b285c") |
| masking | Ran | chengjunyan1/TDL/TAE.py code served (permissive licence) · get_code("48798f803f4b61dc") |
| plot_mats | Ran | chengjunyan1/TDL/TAE.py code served (permissive licence) · get_code("a559297709b92cd9") |
| softjump | Ran | chengjunyan1/TDL/TAE.py code served (permissive licence) · get_code("fdb4190d51f089d2") |
| TAE | Not yet run | chengjunyan1/TDL/TAE.py code served (permissive licence) · get_code("b8d8e6f4bf5c427c") |
| spl_contour | Not yet run | chengjunyan1/TDL/TAE.py code served (permissive licence) · get_code("a06c7b5521593b94") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
This paper introduces a novel Transitional Dictionary Learning (TDL) framework that can implicitly learn symbolic knowledge, such as visual parts and relations, by reconstructing the input as a combination of parts with implicit relations. We propose a game-theoretic diffusion model to decompose the input into visual parts using the dictionaries learned by the Expectation Maximization (EM) algorithm, implemented as the online prototype clustering, based on the decomposition results. Additionally, two metrics, clustering information gain, and heuristic shape score are proposed to evaluate the model. Experiments are conducted on three abstract compositional visual object datasets, which require the model to utilize the compositionality of data instead of simply exploiting visual features. Then, three tasks on symbol grounding to predefined classes of parts and relations, as well as transfer learning to unseen classes, followed by a human evaluation, were carried out on these datasets. The results show that the proposed method discovers compositional patterns, which significantly outperforms the state-of-the-art unsupervised part segmentation methods that rely on visual features from pre-trained backbones. Furthermore, the proposed metrics are consistent with human evaluations.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2308.02000")
get_code_for_paper("2308.02000")
have("2308.02000")
Connect an agent — have() is free.