{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/binarized-knowledge-graph-embeddings","title":"Binarized Knowledge Graph Embeddings","arxiv_id":"1902.02970","date":"2019-02-08","proceeding":null,"authors":["Koki Kishimoto","Katsuhiko Hayashi","Genki Akai","Masashi Shimbo","Kazunori Komatani"],"abstract":"Tensor factorization has become an increasingly popular approach to knowledge\ngraph completion(KGC), which is the task of automatically predicting missing\nfacts in a knowledge graph. However, even with a simple model like\nCANDECOMP/PARAFAC(CP) tensor decomposition, KGC on existing knowledge graphs is\nimpractical in resource-limited environments, as a large amount of memory is\nrequired to store parameters represented as 32-bit or 64-bit floating point\nnumbers. This limitation is expected to become more stringent as existing\nknowledge graphs, which are already huge, keep steadily growing in scale. To\nreduce the memory requirement, we present a method for binarizing the\nparameters of the CP tensor decomposition by introducing a quantization\nfunction to the optimization problem. This method replaces floating\npoint-valued parameters with binary ones after training, which drastically\nreduces the model size at run time. We investigate the trade-off between the\nquality and size of tensor factorization models for several KGC benchmark\ndatasets. In our experiments, the proposed method successfully reduced the\nmodel size by more than an order of magnitude while maintaining the task\nperformance. Moreover, a fast score computation technique can be developed with\nbitwise operations.","url_abs":"http://arxiv.org/abs/1902.02970v1","url_pdf":"http://arxiv.org/pdf/1902.02970v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"binarized-knowledge-graph-embeddings","repo_url":"https://github.com/KokiKishimoto/cp_decomposition","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"binarized-knowledge-graph-embeddings","repo_url":"https://github.com/KokiKishimoto/cp_decomposition_alpha","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"knowledge-graph-completion","task_name":"Knowledge Graph Completion"},{"task_slug":"knowledge-graph-embeddings","task_name":"Knowledge Graph Embeddings"},{"task_slug":"knowledge-graphs","task_name":"Knowledge Graphs"},{"task_slug":"quantization","task_name":"Quantization"},{"task_slug":"tensor-decomposition","task_name":"Tensor Decomposition"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"KokiKishimoto/cp_decomposition","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"KokiKishimoto/cp_decomposition_alpha","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"d6711389a3a104266df40e5f193b0f61d25cd7efd7b34864317129be0aeff1e2","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}