- Rating
- 2(+1)
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
RaMA, a foundation model for relational databases. RaMA builds on RelGNN's atomic-route formulation and uses a GNN to encode entities and their relational paths. It also introduces an external memory bank that stores entity attributes and relational records spanning one or two hops. The model selects Top-k records using learnable query projections, similarity scoring, and metadata MLPs. It then aggregates the retrieved records through attention and fuses them with local graph representations using a gating network.
Training consists of three stages. First, the model constructs relational graphs from source databases and initializes the external memory. Second, it performs pre-training through masked attribute reconstruction and foreign-key recovery, while jointly training the GNN, retrieval scoring, and fusion modules. The memory bank is updated using heuristic utility scoring. The model then attributes the gain to retrieved records based on retrieval attention and the weight assigned to the retrieval branch by the gating network. Finally, the pre-trained parameters and memory bank are used for downstream tasks, with supervised fine-tuning or few-shot inference.
The experiments cover multiple downstream tasks. The authors report that RaMA outperforms all listed baselines on the six tasks in Table 1 and achieves better results in leave-one-database-out zero-shot transfer. The ablation study evaluates the method by replacing the backbone and comparing static and dynamic memory, providing evidence of its effectiveness.
Critical strengths
S1: The problem is meaningful. Extending retrieval-augmented learning from text and graphs to route-level retrieval in relational databases is a reasonable research direction.
S2: Temporal leakage is explicitly addressed. The memory uses only temporally valid records from the training splits of source databases. During pre-training, retrieved records that reveal masked attributes or foreign keys are excluded.
S3: The experimental evaluation is comprehensive. It covers three task types (classification, regression, and relation prediction), leave-one-database-out zero-shot transfer, few-shot learning and in-context learning, seven ablation variants, sensitivity analysis, and efficiency analysis. Standard deviations over three random seeds are reported for the main results.
Critical weaknesses
W1: The source of the memory gains is unclear. The reported gains appear to come entirely from records dynamically admitted during training. The paper does not specify the provenance of these records or whether they include data from the target database. The update rule is heuristic, and credit assignment is not performed at the individual-record level.
W2: The method is incompletely specified. The paper does not clearly explain how retrieval is integrated into the GNN. Several components are described only through function symbols. “Local retrieval” is mentioned only in the hyperparameter table, and the prediction procedures for zero-shot and in-context learning are not defined.
W3: Key baselines are missing, making it difficult to attribute the gains. The paper does not compare RaMA with RelGNN or with simple memory-update strategies. The zero-shot evaluation compares RaMA with only two baselines. The claim of consistent superiority in few-shot settings holds only for the fine-tuned version.
W4: TabICL v1.1 does not support regression, yet regression results are reported for it.
Questions for authors
Q1. What is the source of the performance gains from the memory module? Static Memory performs similarly to the model without memory. For the supervised experiments in Table 1, please report which databases the records added to memory originate from, whether records from the target database's training split can enter the memory, and how the model performs when all memory records originating from the target database are excluded.
Q2. How are zero-shot and in-context learning (ICL) predictions implemented? For each task type in Tables 2 and 3, please provide the complete inference procedure, including how a prediction head for a new task is obtained without access to target-task labels; how classification probabilities, regression predictions, and relation-ranking results are derived from the model outputs; and how ICL uses labels from the support set to make predictions without updating model parameters.
Q3. How is the retrieval module integrated with the GNN? Does retrieval occur at every message-passing layer? When synchronizing the retrieval indices, are memory-record embeddings recomputed using the current model parameters? What exactly does “local retrieval” in Table 6 refer to, and how does model performance change when this mechanism is removed?
Q4. What additional value does the proposed memory mechanism provide over simpler alternatives? Please compare RaMA with RelGNN under matched model width, pre-training data, and downstream adaptation budgets. Also, compare the proposed memory module with capacity-matched alternatives that use random admission or frequency-based admission. In addition, please explain why the heterogeneous GNN variant with memory performs worse than the memory-free RDL-GNN baseline.
6 comments
Follow-up on Our Rebuttal
Thank you again for your time and thoughtful feedback on our work. We sincerely appreciate your comments and have provided detailed responses in our rebuttal.
We would be very grateful to know whether our responses have adequately addressed your concerns and helped clarify the contributions of our work. We genuinely hope that our explanations will help strengthen your confidence in the paper, and that you might take these clarifications into account when reconsidering your overall assessment.
If any concerns remain or if you have further questions, we would be more than happy to provide additional explanations or evidence. We highly value your feedback and would welcome any further discussion.
Thank you very much for your time and consideration.
Thanks for your response, which has helped clarify the issues and deepen my understanding of the paper. I have a few further questions that I would appreciate your help in clarifying.
Inconsistent Numbers and Unspecified Source Corpus (W1/Q1):
- Could you clarify the significant numerical discrepancies between Table 1 of the paper and your rebuttal (RaMA's AUROC against Studies-has-dmc)?
Unclear Memory-Embedding Refresh and Index Synchronization (W2/Q3):
- If the query embeddings are updated as the model parameters change, while the memory embeddings remain encoded using outdated parameters, how can the authors ensure that both embeddings remain in a consistent representation space?
- Does SynchronizeIndices recompute the embeddings of the memory records?
Rebuttal to Reviewer rf7Y by Authors
W1/Q1·Short answer. Memory contains only temporally eligible training records; excluding target-database records retains most performance.
Thank you for raising the issue. For Table 1, memory records come from rel-f1, rel-trial, rel-amazon, and rel-event. Only temporally eligible target-database training records may enter memory. Memory construction, updates, and retrieval exclude test labels and future outcomes.
Excluding target-database records. We exclude target-database records from memory initialization and updates, keeping other settings unchanged.
Target-database records provide useful evidence, but RaMA retains much of its performance without them in external memory.
W2/Q3·Short answer. Retrieval follows the final GNN layer and reuses stored embeddings. We clarified the role of Local Retrieval.
We appreciate these specific questions. Retrieval is performed after all message-passing layers, and the previously stored embeddings are reused, even after parameters have been updated.
Local Retrieval. For each query, RaMA constructs a temporary pool of relational records from the target database under temporal constraints and selects task-relevant evidence. Source retrieval selects evidence from the cross-database memory. Both representations are then integrated through relation-aware fusion, making local retrieval an integral core part of RaMA's pipeline.
W2/Q2·Short answer. Zero-shot uses source-trained heads. ICL uses labeled support examples with fixed parameters and memory.
We appreciate your comments on the inference protocol.
Zero-shot inference. RaMA uses prediction-time query information and a head trained on source tasks of the same type without target-task labels. We compute AUROC from the positive-class logit, MAE on the original target scale, and MAP from the top K candidate target nodes ranked by predicted score.
In-context learning. A frozen encoder produces the query representation zq and support representations zi. Query-to-support attention aggregates values that include the support label embedding e(yi). The classification head maps the concatenated query representation and support summary to the positive-class probability pq.
αi=softmaxi(d(WQzq)⊤(WKzi))
cq=∑iαiWV[zi;e(yi)]
pq=σ(Dcls([zq;cq]))
W3/Q4·Short answer. RaMA outperforms the added RelGNN baseline and simpler memory policies. We clarify the heterogeneous GNN ablation setting and ICL results.
Thank you for pointing out our omission of the RelGNN results. We excluded RelGNN because it does not establish a unified cross-database pre-training and transfer framework. The table below reports the supervised RelGNN results under same settings.
Memory admission. RaMA achieves the highest MAP compared with simpler update policies.
Heterogeneous GNN. The heterogeneous GNN ablation uses GraphSAGE without memory. GraphSAGE does not explicitly construct atomic routes, which serve as the basic units in our memory mechanism, so the memory cannot be added.
Few-shot performance. Although RaMA-ICL underperforms some fine-tuned baselines, RaMA achieves the best performance within both the ICL and fine-tuning groups under comparable evaluation settings.
W4·Short answer. We fitted a linear median regression head using frozen TabICL v1.1 embeddings.
Thank you for pointing out that TabICL v1.1 is a classification model. To support regression, we use its pretrained encoder to extract row embeddings before classification. For each task, we fit a separate linear median-regression head using only the corresponding training embeddings and regression labels. Thus, the adaptation preserves TabICL's learned representations without modifying its pretrained parameters.
Overall Response
We sincerely thank the reviewer and the AC again. We appreciate the reviewer's recognition. The main concerns regarding memory provenance, retrieval implementation, experimental protocols, and memory update effectiveness have been addressed through implementation clarifications and additional experiments.