{"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/rllm-relational-table-learning-with-llms","title":"rLLM: Relational Table Learning with LLMs","arxiv_id":"2407.20157","date":"2024-07-29","proceeding":null,"authors":["Weichen Li","Xiaotong Huang","Jianwu Zheng","Zheng Wang","Chaokun Wang","Li Pan","Jianhua Li"],"abstract":"We introduce rLLM (relationLLM), a PyTorch library designed for Relational Table Learning (RTL) with Large Language Models (LLMs). The core idea is to decompose state-of-the-art Graph Neural Networks, LLMs, and Table Neural Networks into standardized modules, to enable the fast construction of novel RTL-type models in a simple \"combine, align, and co-train\" manner. To illustrate the usage of rLLM, we introduce a simple RTL method named \\textbf{BRIDGE}. Additionally, we present three novel relational tabular datasets (TML1M, TLF2K, and TACM12K) by enhancing classic datasets. We hope rLLM can serve as a useful and easy-to-use development framework for RTL-related tasks. Our code is available at: https://github.com/rllm-project/rllm.","url_abs":"https://arxiv.org/abs/2407.20157v1","url_pdf":"https://arxiv.org/pdf/2407.20157v1.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":"rllm-relational-table-learning-with-llms","repo_url":"https://github.com/rllm-project/rllm_datasets","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null},{"paper_slug":"rllm-relational-table-learning-with-llms","repo_url":"https://github.com/rllm-project/rllm","is_official":0,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"node-classification","task_name":"Node Classification"}],"methods":[{"method_slug":null,"method_name":"Library"}],"datasets_introduced":[{"slug":"tacm12k","name":"TACM12K","full_name":"Table-ACM12K"},{"slug":"tlf2k","name":"TLF2K","full_name":"Table-LastFm2K"},{"slug":"tml1m","name":"TML1M","full_name":"Table-MovieLens1M"}],"methods_introduced":[],"results":[{"leaderboard":"/sota/classification-on-tacm12k","task":"Classification","dataset":"TACM12K","model":"BRIDGE","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"25.6"},"uses_additional_data":false},{"leaderboard":"/sota/classification-on-tlf2k","task":"Classification","dataset":"TLF2K","model":"BRIDGE","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"42.2"},"uses_additional_data":false},{"leaderboard":"/sota/classification-on-tml1m","task":"Classification","dataset":"TML1M","model":"BRIDGE","rank_in_archive_order":1,"of":1,"metrics":{"Accuracy":"36.2"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2407.20157","atlas_url":"https://app.syntology.ai/?focus=2407.20157","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"2407.20157"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2407.20157\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2407.20157"},"call":"get_concepts_for_paper(arxiv_id=\"2407.20157\")"}],"by_repo":[{"repo":"rllm-project/rllm_datasets","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"rllm-project/rllm","kind":"named_in_paper","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":"f5439fd29ba26d3491ee84686c4c2685d1679c47e2716aa0367b3ee4486c1ed6","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}