{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:H3IAYN4UYW5JMDPGN3ALLXEDMR","short_pith_number":"pith:H3IAYN4U","schema_version":"1.0","canonical_sha256":"3ed00c3794c5ba960de66ec0b5dc83646e7e9db5aaa96898df43fed350115ce2","source":{"kind":"arxiv","id":"2311.07343","version":1},"attestation_state":"computed","paper":{"title":"Fine-Tuning the Retrieval Mechanism for Tabular Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Felix den Breejen, Sangmin Bae, Seoung Hyun Koh, Se-Young Yun, Stephen Cha, Tae-Young Kim","submitted_at":"2023-11-13T13:55:52Z","abstract_excerpt":"While interests in tabular deep learning has significantly grown, conventional tree-based models still outperform deep learning methods. To narrow this performance gap, we explore the innovative retrieval mechanism, a methodology that allows neural networks to refer to other data points while making predictions. Our experiments reveal that retrieval-based training, especially when fine-tuning the pretrained TabPFN model, notably surpasses existing methods. Moreover, the extensive pretraining plays a crucial role to enhance the performance of the model. These insights imply that blending the re"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"2311.07343","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"cs.LG","submitted_at":"2023-11-13T13:55:52Z","cross_cats_sorted":[],"title_canon_sha256":"d665cfc4c4614419bc63a2f06b1b5bce20d7ca0406fd006bc79a6712f00f4374","abstract_canon_sha256":"011f152d09ea7ae47ad0b748e44d5a89c7ed0a132e94cbff37bd6e8cc5f7bfb0"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:12:11.632778Z","signature_b64":"PGGjMrg7h3Qqqp5ofu5YXmPpNGfO4tgKODxzc9397cdgElg4jSqLMabjWRDPG4OlWj6ae0Lm1ugtvH4he2cTBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3ed00c3794c5ba960de66ec0b5dc83646e7e9db5aaa96898df43fed350115ce2","last_reissued_at":"2026-07-05T07:12:11.632333Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:12:11.632333Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Fine-Tuning the Retrieval Mechanism for Tabular Deep Learning","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"cs.LG","authors_text":"Felix den Breejen, Sangmin Bae, Seoung Hyun Koh, Se-Young Yun, Stephen Cha, Tae-Young Kim","submitted_at":"2023-11-13T13:55:52Z","abstract_excerpt":"While interests in tabular deep learning has significantly grown, conventional tree-based models still outperform deep learning methods. To narrow this performance gap, we explore the innovative retrieval mechanism, a methodology that allows neural networks to refer to other data points while making predictions. Our experiments reveal that retrieval-based training, especially when fine-tuning the pretrained TabPFN model, notably surpasses existing methods. Moreover, the extensive pretraining plays a crucial role to enhance the performance of the model. These insights imply that blending the re"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2311.07343","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2311.07343/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"},"aliases":[{"alias_kind":"arxiv","alias_value":"2311.07343","created_at":"2026-07-05T07:12:11.632392+00:00"},{"alias_kind":"arxiv_version","alias_value":"2311.07343v1","created_at":"2026-07-05T07:12:11.632392+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2311.07343","created_at":"2026-07-05T07:12:11.632392+00:00"},{"alias_kind":"pith_short_12","alias_value":"H3IAYN4UYW5J","created_at":"2026-07-05T07:12:11.632392+00:00"},{"alias_kind":"pith_short_16","alias_value":"H3IAYN4UYW5JMDPG","created_at":"2026-07-05T07:12:11.632392+00:00"},{"alias_kind":"pith_short_8","alias_value":"H3IAYN4U","created_at":"2026-07-05T07:12:11.632392+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2505.23947","citing_title":"Position: The Future of Bayesian Prediction Is Prior-Fitted","ref_index":8,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/H3IAYN4UYW5JMDPGN3ALLXEDMR","json":"https://pith.science/pith/H3IAYN4UYW5JMDPGN3ALLXEDMR.json","graph_json":"https://pith.science/api/pith-number/H3IAYN4UYW5JMDPGN3ALLXEDMR/graph.json","events_json":"https://pith.science/api/pith-number/H3IAYN4UYW5JMDPGN3ALLXEDMR/events.json","paper":"https://pith.science/paper/H3IAYN4U"},"agent_actions":{"view_html":"https://pith.science/pith/H3IAYN4UYW5JMDPGN3ALLXEDMR","download_json":"https://pith.science/pith/H3IAYN4UYW5JMDPGN3ALLXEDMR.json","view_paper":"https://pith.science/paper/H3IAYN4U","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2311.07343&json=true","fetch_graph":"https://pith.science/api/pith-number/H3IAYN4UYW5JMDPGN3ALLXEDMR/graph.json","fetch_events":"https://pith.science/api/pith-number/H3IAYN4UYW5JMDPGN3ALLXEDMR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/H3IAYN4UYW5JMDPGN3ALLXEDMR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/H3IAYN4UYW5JMDPGN3ALLXEDMR/action/storage_attestation","attest_author":"https://pith.science/pith/H3IAYN4UYW5JMDPGN3ALLXEDMR/action/author_attestation","sign_citation":"https://pith.science/pith/H3IAYN4UYW5JMDPGN3ALLXEDMR/action/citation_signature","submit_replication":"https://pith.science/pith/H3IAYN4UYW5JMDPGN3ALLXEDMR/action/replication_record"}},"created_at":"2026-07-05T07:12:11.632392+00:00","updated_at":"2026-07-05T07:12:11.632392+00:00"}