Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Andreas Besginow

dblp:248/9562 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · unresolved

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 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
1 paper
Probabilistic and Bayesian machine learning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.612022
Constraining Gaussian Processes to Systems of Linear Ordinary Differential Equations · NeurIPS 2022
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process
kernel design
0.612022
Constraining Gaussian Processes to Systems of Linear Ordinary Differential Equations · NeurIPS 2022

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

symbolic computation · 0.6smith normal form · 0.6
YearPublicationVenuePosition
2026 Fast Model Selection for Interpretable Gaussian Process Models Using Laplace Approximation
Andreas Besginow, Thomas Pawellek, Jan David Hüwel, Christian Beecks, Markus Lange-Hegermann
IDA1
2022 Constraining Gaussian Processes to Systems of Linear Ordinary Differential Equations
abstract
Data in many applications follows systems of Ordinary Differential Equations (ODEs).This paper presents a novel algorithmic and symbolic construction for covariance functions of Gaussian Processes (GPs) with realizations strictly following a system of linear homogeneous ODEs with constant coefficients, which we call LODE-GPs. Introducing this strong inductive bias into a GP improves modelling of such data. Using smith normal form algorithms, a symbolic technique, we overcome two current restrictions in the state of the art: (1) the need for certain uniqueness conditions in the set of solutions, typically assumed in classical ODE solvers and their probabilistic counterparts, and (2) the restriction to controllable systems, typically assumed when encoding differential equations in covariance functions. We show the effectiveness of LODE-GPs in a number of experiments, for example learning physically interpretable parameters by maximizing the likelihood.
Andreas Besginow, Markus Lange-Hegermann
NeurIPS1