Carl Jidling

ML
h-index7
7papers
171citations
Novelty44%
AI Score29

7 Papers

3.8MLFeb 3, 2022Code
Incorporating Sum Constraints into Multitask Gaussian Processes

Philipp Pilar, Carl Jidling, Thomas B. Schön et al.

Machine learning models can be improved by adapting them to respect existing background knowledge. In this paper we consider multitask Gaussian processes, with background knowledge in the form of constraints that require a specific sum of the outputs to be constant. This is achieved by conditioning the prior distribution on the constraint fulfillment. The approach allows for both linear and nonlinear constraints. We demonstrate that the constraints are fulfilled with high precision and that the construction can improve the overall prediction accuracy as compared to the standard Gaussian process.

5.5LGFeb 22, 2021
A Probabilistically Motivated Learning Rate Adaptation for Stochastic Optimization

Filip de Roos, Carl Jidling, Adrian Wills et al.

Machine learning practitioners invest significant manual and computational resources in finding suitable learning rates for optimization algorithms. We provide a probabilistic motivation, in terms of Gaussian inference, for popular stochastic first-order methods. As an important special case, it recovers the Polyak step with a general metric. The inference allows us to relate the learning rate to a dimensionless quantity that can be automatically adapted during training by a control algorithm. The resulting meta-algorithm is shown to adapt learning rates in a robust manner across a large range of initial values when applied to deep learning benchmark problems.

15.9MLFeb 5, 2020Code
Linearly Constrained Neural Networks

Johannes Hendriks, Carl Jidling, Adrian Wills et al.

We present a novel approach to modelling and learning vector fields from physical systems using neural networks that explicitly satisfy known linear operator constraints. To achieve this, the target function is modelled as a linear transformation of an underlying potential field, which is in turn modelled by a neural network. This transformation is chosen such that any prediction of the target function is guaranteed to satisfy the constraints. The approach is demonstrated on both simulated and real data examples.

3.2MLSep 4, 2019
Deep kernel learning for integral measurements

Carl Jidling, Johannes Hendriks, Thomas B. Schön et al.

Deep kernel learning refers to a Gaussian process that incorporates neural networks to improve the modelling of complex functions. We present a method that makes this approach feasible for problems where the data consists of line integral measurements of the target function. The performance is illustrated on computed tomography reconstruction examples.

1.2COMP-PHMay 15, 2019Code
Neutron Transmission Strain Tomography for Non-Constant Stress-Free Lattice Spacing

J. N. Hendriks, C. Jidling, T. B. Schön et al.

Recently, several algorithms for strain tomography from energy-resolved neutron transmission measurements have been proposed. These methods assume that the stress-free lattice spacing $d_0$ is a known constant limiting their application to the study of stresses generated by manufacturing and loading methods that do not alter this parameter. In this paper, we consider the more general problem of jointly reconstructing the strain and $d_0$ fields. A method for solving this inherently non-linear problem is presented that ensures the estimated strain field satisfies equilibrium and can include knowledge of boundary conditions. This method is tested on a simulated data set with realistic noise levels, demonstrating that it is possible to jointly reconstruct $d_0$ and the strain field.

4.2MLDec 18, 2018Code
Evaluating the squared-exponential covariance function in Gaussian processes with integral observations

J. N. Hendriks, C. Jidling, A. Wills et al.

This paper deals with the evaluation of double line integrals of the squared exponential covariance function. We propose a new approach in which the double integral is reduced to a single integral using the error function. This single integral is then computed with efficiently implemented numerical techniques. The performance is compared against existing state of the art methods and the results show superior properties in numerical robustness and accuracy per computation time.

19.6MLMar 2, 2017
Linearly constrained Gaussian processes

Carl Jidling, Niklas Wahlström, Adrian Wills et al.

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.