arXiv (All)
open access
Do Temporal Link Predictors Need Learned Memory? A Smoothed-Count Baseline with a Handful of Parameters
Many temporal link predictors summarize past interactions through learned node representations. We examine whether simple counts of recurring interaction patterns can provide competitive predictions without learning these representations. We propose a temporal link predictor based on statistical lan
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Walking the Score Manifold: Continuous-time Generative Dynamics on Learned Data Manifolds#1011616
- RAEGL: Risk-Aware Evidence-Gated Learning for Selective Contextual Routing under Temporal Shift#1118052
- EdgeMem: LLM-Free Agent Memory Construction and Retrieval via Evidence-Preserving Multi-Anchor Hypergraph#972612
- To Memories and Beyond: From Remembering to Knowing You across Long-Term Multimodal Personal Archives#1013768
- LayerRecall: A State-Conditioned Memory Router for Long-Horizon Consistency in Video Generation#792464
Record · ID 1129956
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive