Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2023
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917568887914496 |
|---|---|
| author | Modell, Alexander Gallagher, Ian Ceccherini, Emma Whiteley, Nick Rubin-Delanchy, Patrick |
| author_facet | Modell, Alexander Gallagher, Ian Ceccherini, Emma Whiteley, Nick Rubin-Delanchy, Patrick |
| contents | We present a new representation learning framework, Intensity Profile Projection, for continuous-time dynamic network data. Given triples $(i,j,t)$, each representing a time-stamped ($t$) interaction between two entities ($i,j$), our procedure returns a continuous-time trajectory for each node, representing its behaviour over time. The framework consists of three stages: estimating pairwise intensity functions, e.g. via kernel smoothing; learning a projection which minimises a notion of intensity reconstruction error; and constructing evolving node representations via the learned projection. The trajectories satisfy two properties, known as structural and temporal coherence, which we see as fundamental for reliable inference. Moreoever, we develop estimation theory providing tight control on the error of any estimated trajectory, indicating that the representations could even be used in quite noise-sensitive follow-on analyses. The theory also elucidates the role of smoothing as a bias-variance trade-off, and shows how we can reduce the level of smoothing as the signal-to-noise ratio increases on account of the algorithm `borrowing strength' across the network. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2306_06155 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks Modell, Alexander Gallagher, Ian Ceccherini, Emma Whiteley, Nick Rubin-Delanchy, Patrick Machine Learning Methodology 62H12 (primary), 62H30 (secondary) We present a new representation learning framework, Intensity Profile Projection, for continuous-time dynamic network data. Given triples $(i,j,t)$, each representing a time-stamped ($t$) interaction between two entities ($i,j$), our procedure returns a continuous-time trajectory for each node, representing its behaviour over time. The framework consists of three stages: estimating pairwise intensity functions, e.g. via kernel smoothing; learning a projection which minimises a notion of intensity reconstruction error; and constructing evolving node representations via the learned projection. The trajectories satisfy two properties, known as structural and temporal coherence, which we see as fundamental for reliable inference. Moreoever, we develop estimation theory providing tight control on the error of any estimated trajectory, indicating that the representations could even be used in quite noise-sensitive follow-on analyses. The theory also elucidates the role of smoothing as a bias-variance trade-off, and shows how we can reduce the level of smoothing as the signal-to-noise ratio increases on account of the algorithm `borrowing strength' across the network. |
| title | Intensity Profile Projection: A Framework for Continuous-Time Representation Learning for Dynamic Networks |
| topic | Machine Learning Methodology 62H12 (primary), 62H30 (secondary) |
| url | https://arxiv.org/abs/2306.06155 |