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

Carl Jidling

dblp:209/4873 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
0since 2021 · last 2017
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author

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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process
constrained gaussian process
0.312017
Linearly constrained Gaussian processes · NIPS 2017
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes › gaussian process
covariance function
0.312017
Linearly constrained Gaussian processes · NIPS 2017
Machine learning › Probabilistic and Bayesian machine learning › stochastic processes
gaussian process
0.312017
Linearly constrained Gaussian processes · NIPS 2017

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

transformation operator · 0.3covariance modification · 0.3
YearPublicationVenuePosition
2017 Linearly constrained Gaussian processes
abstract
We consider a modification of the covariance function in Gaussian processes to correctly account for known linear constraints. By modelling the target function as a transformation of an underlying function, the constraints are explicitly incorporated in the model such that they are guaranteed to be fulfilled by any sample drawn or prediction made. We also propose a constructive procedure for designing the transformation operator and illustrate the result on both simulated and real-data examples.
Carl Jidling, Niklas Wahlstrom, Adrian Wills, Thomas B. Schön
NIPS1