Arno Solin

Arno Solin

Auto-generated profile, based on publicly available information

Arno Solin

Department of Computer Science Aalto University Finland

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 January 2022 in Neural Networks
Verified
Journal Article
Open access
VVVikas Verma
Vikas Verma
KKKenji Kawaguchi
Kenji Kawaguchi
ALAlex Lamb
Alex Lamb
JKJuho Kannala
Juho Kannala
ASArno Solin
Arno Solin
DLDavid Lopez-Paz
David Lopez-Paz
We introduce Interpolation Consistency Training (ICT), a simple and computation efficient algorithm for training Deep Neural Networks in the semi-supervised learning paradigm. ICT encourages the prediction at an interpolation of unlabeled points to be consistent with the interpolation of the predictions at those points. In classification problems, ICT moves the decision boundary to low-density regions of the data distribution. Our experiments show that ICT achieves state-of-the-art performance when applied to standard neural network architectures on the CIFAR-10 and SVHN benchmark datasets. Our theoretical analysis shows that ICT corresponds to a certain type of data-adaptive regularization with unlabeled points which reduces overfitting to labeled points under high confidence values.

12 June 2013 in IEEE Signal Processing Magazine
Verified
Journal Article
Closed access
SSSimo Sarkka
Simo Sarkka
ASArno Solin
Arno Solin
JHJouni Hartikainen
Jouni Hartikainen
Gaussian process-based machine learning is a powerful Bayesian paradigm for nonparametric nonlinear regression and classification. In this article, we discuss connections of Gaussian process regression with Kalman filtering and present methods for converting spatiotemporal Gaussian process regression problems into infinite-dimensional state-space models. This formulation allows for use of computationally efficient infinite-dimensional Kalman filtering and smoothing methods, or more general Bayesian filtering and smoothing methods, which reduces the problematic cubic complexity of Gaussian process regression in the number of time steps into linear time complexity. The implication of this is that the use of machine-learning models in signal processing becomes computationally feasible, and it opens the possibility to combine machine-learning techniques with signal processing methods.

5 August 2019 in Statistics and Computing
Verified
Journal Article
Open access
PDF file
ASArno Solin
Arno Solin
SSSimo Särkkä
Simo Särkkä
This paper proposes a novel scheme for reduced-rank Gaussian process regression. The method is based on an approximate series expansion of the covariance function in terms of an eigenfunction expansion of the Laplace operator in a compact subset of \(\mathbb {R}^d\). On this approximate eigenbasis, the eigenvalues of the covariance function can be expressed as simple functions of the spectral density of the Gaussian process, which allows the GP inference to be solved under a computational cost scaling as \(\mathcal {O}(nm^2)\) (initial) and \(\mathcal {O}(m^3)\) (hyperparameter learning) with m basis functions and n data points. Furthermore, the basis functions are independent of the parameters of the covariance function, which allows for very fast hyperparameter learning. The approach also allows for rigorous error analysis with Hilbert space theory, and we show that the approximation becomes exact when the size of the compact subset and the number of eigenfunctions go to infinity. We also show that the convergence rate of the truncation error is independent of the input dimensionality provided that the differentiability order of the covariance function increases appropriately, and for the squared exponential covariance function it is always bounded by \({\sim }1/m\) regardless of the input dimensionality. The expansion generalizes to Hilbert spaces with an inner product which is defined as an integral over a specified input density. The method is compared to previously proposed methods theoretically and through empirical tests with simulated and real data.

6 June 2018 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
ASArno Solin
Arno Solin
MKManon Kok
Manon Kok
NWNiklas Wahlstrom
Niklas Wahlstrom
TSThomas B. Schon
Thomas B. Schon
SSSimo Sarkka
Simo Sarkka
Anomalies in the ambient magnetic field can be used as features in indoor positioning and navigation. By using Maxwell’s equations, we derive and present a Bayesian nonparametric probabilistic modeling approach for interpolation and extrapolation of the magnetic field. We model the magnetic field components jointly by imposing a Gaussian process (GP) prior to the latent scalar potential of the magnetic field. By rewriting the GP model in terms of a Hilbert space representation, we circumvent the computational pitfalls associated with GP modeling and provide a computationally efficient and physically justified modeling tool for the ambient magnetic field. The model allows for sequential updating of the estimate and time-dependent changes in the magnetic field. The model is shown to work well in practice in different applications. We demonstrate mapping of the magnetic field both with an inexpensive Raspberry Pi powered robot and on foot using a standard smartphone.

1 April 2012 in NeuroImage
Verified
Journal Article
Closed access
SSSimo Särkkä
Simo Särkkä
ASArno Solin
Arno Solin
ANAapo Nummenmaa
Aapo Nummenmaa
AVAki Vehtari
Aki Vehtari
TAToni Auranen
Toni Auranen
FLFa-Hsuan Lin
Fa-Hsuan Lin

6 October 2018
Verified
Book Chapter
Closed access
PDF file
SCSantiago Cortés
Santiago Cortés
ASArno Solin
Arno Solin
EREsa Rahtu
Esa Rahtu
JKJuho Kannala
Juho Kannala