Per Sidén

dblp:198/0132 · DBLP profile ↗
← Back
7ranked-venue papers
1as first author
4since 2021 · last 2024
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 6 · 1 first-author · 4 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
3 papers
Probabilistic and Bayesian machine learning · 84% Graph learning · 16%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › structured models › graphical models
gaussian graphical model
1.022022
Scalable Deep Gaussian Markov Random Fields for General Graphs · ICML 2022
Deep Gaussian Markov Random Fields · ICML 2020
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model
mixture model
0.712023
DINO as a von Mises-Fisher mixture model · ICLR 2023
Machine learning › Probabilistic and Bayesian machine learning › structured models › latent variable model › mixture model
von mises-fisher mixture
0.712023
DINO as a von Mises-Fisher mixture model · ICLR 2023
Machine learning › Graph learning
graph neural network
0.612022
Scalable Deep Gaussian Markov Random Fields for General Graphs · ICML 2022
Machine learning › Probabilistic and Bayesian machine learning › probabilistic inference
scalable inference
0.612022
Scalable Deep Gaussian Markov Random Fields for General Graphs · ICML 2022

Methods — techniques the papers use, named apart from their topics

variational inference · 1.0von mises-fisher distribution · 0.7mixture model · 0.7bayesian inference · 0.6automatic differentiation · 0.4
YearPublicationVenuePosition
2024 On Partial Prototype Collapse in the DINO Family of Self-Supervised Methods
Hariprasath Govindarajan, Per Sidén, Jacob Roll, Fredrik Lindsten
BMVC2
2023 Temporal Graph Neural Networks for Irregular Data
abstract
This paper proposes a temporal graph neural network model for forecasting of graph-structured irregularly observed time series. Our TGNN4I model is designed to handle both irregular time steps and partial observations of the graph. This is achieved by introducing a time-continuous latent state in each node, following a linear Ordinary Differential Equation (ODE) defined by the output of a Gated Recurrent Unit (GRU). The ODE has an explicit solution as a combination of exponential decay and periodic dynamics. Observations in the graph neighborhood are taken into account by integrating graph neural network layers in both the GRU state update and predictive model. The time-continuous dynamics additionally enable the model to make predictions at arbitrary time steps. We propose a loss function that leverages this and allows for training the model for forecasting over different time horizons. Experiments on simulated data and real-world data from traffic and climate modeling validate the usefulness of both the graph structure and time-continuous dynamics in settings with irregular observations.
Joel Oskarsson, Per Sidén, Fredrik Lindsten
AISTATS2
2023 DINO as a von Mises-Fisher mixture model
Hariprasath Govindarajan, Per Sidén, Jacob Roll, Fredrik Lindsten
ICLR2
2022 Scalable Deep Gaussian Markov Random Fields for General Graphs
abstract
Machine learning methods on graphs have proven useful in many applications due to their ability to handle generally structured data. The framework of Gaussian Markov Random Fields (GMRFs) provides a principled way to define Gaussian models on graphs by utilizing their sparsity structure. We propose a flexible GMRF model for general graphs built on the multi-layer structure of Deep GMRFs, originally proposed for lattice graphs only. By designing a new type of layer we enable the model to scale to large graphs. The layer is constructed to allow for efficient training using variational inference and existing software frameworks for Graph Neural Networks. For a Gaussian likelihood, close to exact Bayesian inference is available for the latent field. This allows for making predictions with accompanying uncertainty estimates. The usefulness of the proposed model is verified by experiments on a number of synthetic and real world datasets, where it compares favorably to other both Bayesian and deep learning methods.
Joel Oskarsson, Per Sidén, Fredrik Lindsten
ICML2
2020 Deep Gaussian Markov Random Fields
abstract
Gaussian Markov random fields (GMRFs) are probabilistic graphical models widely used in spatial statistics and related fields to model dependencies over spatial structures. We establish a formal connection between GMRFs and convolutional neural networks (CNNs). Common GMRFs are special cases of a generative model where the inverse mapping from data to latent variables is given by a 1-layer linear CNN. This connection allows us to generalize GMRFs to multi-layer CNN architectures, effectively increasing the order of the corresponding GMRF in a way which has favorable computational scaling. We describe how well-established tools, such as autodiff and variational inference, can be used for simple and efficient inference and learning of the deep GMRF. We demonstrate the flexibility of the proposed model and show that it outperforms the state-of-the-art on a dataset of satellite temperatures, in terms of prediction and predictive uncertainty.
Per Sidén, Fredrik Lindsten
ICML1
2019 Real-Time Robotic Search using Structural Spatial Point Processes
Olov Andersson, Per Sidén, Johan Dahlin, Patrick Doherty 0001, Mattias Villani
UAI2
2017 Bayesian Diffusion Tensor Estimation with Spatial Priors
Xuan Gu, Per Sidén, Bertil Wegmann, Anders Eklund 0002, Mattias Villani, Hans Knutsson
CAIP (1)2