Budgeted Task-Aware Acquisition of Dynamic Networks
This story is from 2026-09-09. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2609.05862v1 Announce Type: new Abstract: Learning on dynamic graphs is difficult when changes in the underlying network are only partially observed. Acquiring current graph information incurs observation and computational costs, making complete updates impractical under limited resources. Th…
Read the full story at arXiv cs.LG ↗
Timeline · 1 report
- 2026-09-09 04:00 · arXiv cs.LG
Budgeted Task-Aware Acquisition of Dynamic Networks