Header logo is


2018


Thumb xl stco paper figure11
Probabilistic Solutions To Ordinary Differential Equations As Non-Linear Bayesian Filtering: A New Perspective

Tronarp, F., Kersting, H., Särkkä, S., Hennig, P.

ArXiv preprint 2018, arXiv:1810.03440 [stat.ME], October 2018 (article)

Abstract
We formulate probabilistic numerical approximations to solutions of ordinary differential equations (ODEs) as problems in Gaussian process (GP) regression with non-linear measurement functions. This is achieved by defining the measurement sequence to consists of the observations of the difference between the derivative of the GP and the vector field evaluated at the GP---which are all identically zero at the solution of the ODE. When the GP has a state-space representation, the problem can be reduced to a Bayesian state estimation problem and all widely-used approximations to the Bayesian filtering and smoothing problems become applicable. Furthermore, all previous GP-based ODE solvers, which were formulated in terms of generating synthetic measurements of the vector field, come out as specific approximations. We derive novel solvers, both Gaussian and non-Gaussian, from the Bayesian state estimation problem posed in this paper and compare them with other probabilistic solvers in illustrative experiments.

pn

link (url) Project Page [BibTex]

2018



no image
Discovering and Teaching Optimal Planning Strategies

Lieder, F., Callaway, F., Krueger, P. M., Das, P., Griffiths, T. L., Gul, S.

In The 14th biannual conference of the German Society for Cognitive Science, GK, September 2018 (inproceedings)

re

Project Page [BibTex]

Project Page [BibTex]


no image
Discovering Rational Heuristics for Risky Choice

Gul, S., Krueger, P. M., Callaway, F., Griffiths, T. L., Lieder, F.

The 14th biannual conference of the German Society for Cognitive Science, GK, The 14th biannual conference of the German Society for Cognitive Science, GK, September 2018 (conference)

re

Project Page [BibTex]

Project Page [BibTex]


no image
Kernel Recursive ABC: Point Estimation with Intractable Likelihood

Kajihara, T., Kanagawa, M., Yamazaki, K., Fukumizu, K.

Proceedings of the 35th International Conference on Machine Learning, pages: 2405-2414, PMLR, July 2018 (conference)

Abstract
We propose a novel approach to parameter estimation for simulator-based statistical models with intractable likelihood. Our proposed method involves recursive application of kernel ABC and kernel herding to the same observed data. We provide a theoretical explanation regarding why the approach works, showing (for the population setting) that, under a certain assumption, point estimates obtained with this method converge to the true parameter, as recursion proceeds. We have conducted a variety of numerical experiments, including parameter estimation for a real-world pedestrian flow simulator, and show that in most cases our method outperforms existing approaches.

pn

Paper [BibTex]

Paper [BibTex]


no image
Convergence Rates of Gaussian ODE Filters

Kersting, H., Sullivan, T. J., Hennig, P.

arXiv preprint 2018, arXiv:1807.09737 [math.NA], July 2018 (article)

Abstract
A recently-introduced class of probabilistic (uncertainty-aware) solvers for ordinary differential equations (ODEs) applies Gaussian (Kalman) filtering to initial value problems. These methods model the true solution $x$ and its first $q$ derivatives a priori as a Gauss--Markov process $\boldsymbol{X}$, which is then iteratively conditioned on information about $\dot{x}$. We prove worst-case local convergence rates of order $h^{q+1}$ for a wide range of versions of this Gaussian ODE filter, as well as global convergence rates of order $h^q$ in the case of $q=1$ and an integrated Brownian motion prior, and analyse how inaccurate information on $\dot{x}$ coming from approximate evaluations of $f$ affects these rates. Moreover, we present explicit formulas for the steady states and show that the posterior confidence intervals are well calibrated in all considered cases that exhibit global convergence---in the sense that they globally contract at the same rate as the truncation error.

pn

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


no image
Gaussian Processes and Kernel Methods: A Review on Connections and Equivalences

Kanagawa, M., Hennig, P., Sejdinovic, D., Sriperumbudur, B. K.

Arxiv e-prints, arXiv:1805.08845v1 [stat.ML], 2018 (article)

Abstract
This paper is an attempt to bridge the conceptual gaps between researchers working on the two widely used approaches based on positive definite kernels: Bayesian learning or inference using Gaussian processes on the one side, and frequentist kernel methods based on reproducing kernel Hilbert spaces on the other. It is widely known in machine learning that these two formalisms are closely related; for instance, the estimator of kernel ridge regression is identical to the posterior mean of Gaussian process regression. However, they have been studied and developed almost independently by two essentially separate communities, and this makes it difficult to seamlessly transfer results between them. Our aim is to overcome this potential difficulty. To this end, we review several old and new results and concepts from either side, and juxtapose algorithmic quantities from each framework to highlight close similarities. We also provide discussions on subtle philosophical and theoretical differences between the two approaches.

pn

arXiv [BibTex]

arXiv [BibTex]


no image
Learning to select computations

Callaway, F., Gul, S., Krueger, P., Griffiths, T. L., Lieder, F.

In Uncertainty in Artificial Intelligence: Proceedings of the Thirty-Fourth Conference, 2018 (inproceedings)

re

Project Page [BibTex]

Project Page [BibTex]


no image
Schema-related cognitive load influences performance, speech, and physiology in a dual-task setting: A continuous multi-measure approach

Wirzberger, M., Herms, R., Esmaeili Bijarsari, S., Eibl, M., Rey, G. D.

Cognitive Research: Principles and Implications, 3:46, Springer Nature, 2018 (article)

Abstract
Schema acquisition processes comprise an essential source of cognitive demands in learning situations. To shed light on related mechanisms and influencing factors, this study applied a continuous multi-measure approach for cognitive load assessment. In a dual-task setting, a sample of 123 student participants learned visually presented symbol combinations with one of two levels of complexity while memorizing auditorily presented number sequences. Learners’ cognitive load during the learning task was addressed by secondary task performance, prosodic speech parameters (pauses, articulation rate), and physiological markers (heart rate, skin conductance response). While results revealed increasing primary and secondary task performance over the trials, decreases in speech and physiological parameters indicated a reduction in the overall level of cognitive load with task progression. In addition, the robustness of the acquired schemata was confirmed by a transfer task that required participants to apply the obtained symbol combinations. Taken together, the observed pattern of evidence supports the idea of a logarithmically decreasing progression of cognitive load with increasing schema acquisition, and further hints on robust and stable transfer performance, even under enhanced transfer demands. Finally, theoretical and practical consequences consider evidence on desirable difficulties in learning as well as the potential of multimodal cognitive load detection in learning applications.

re

DOI [BibTex]

DOI [BibTex]


Thumb xl tease pic
Dissecting Adam: The Sign, Magnitude and Variance of Stochastic Gradients

Balles, L., Hennig, P.

In Proceedings of the 35th International Conference on Machine Learning (ICML), 2018 (inproceedings) Accepted

Abstract
The ADAM optimizer is exceedingly popular in the deep learning community. Often it works very well, sometimes it doesn't. Why? We interpret ADAM as a combination of two aspects: for each weight, the update direction is determined by the sign of stochastic gradients, whereas the update magnitude is determined by an estimate of their relative variance. We disentangle these two aspects and analyze them in isolation, gaining insight into the mechanisms underlying ADAM. This analysis also extends recent results on adverse effects of ADAM on generalization, isolating the sign aspect as the problematic one. Transferring the variance adaptation to SGD gives rise to a novel method, completing the practitioner's toolbox for problems where ADAM fails.

pn

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


no image
Counterfactual Mean Embedding: A Kernel Method for Nonparametric Causal Inference

Muandet, K., Kanagawa, M., Saengkyongam, S., Marukata, S.

Arxiv e-prints, arXiv:1805.08845v1 [stat.ML], 2018 (article)

Abstract
This paper introduces a novel Hilbert space representation of a counterfactual distribution---called counterfactual mean embedding (CME)---with applications in nonparametric causal inference. Counterfactual prediction has become an ubiquitous tool in machine learning applications, such as online advertisement, recommendation systems, and medical diagnosis, whose performance relies on certain interventions. To infer the outcomes of such interventions, we propose to embed the associated counterfactual distribution into a reproducing kernel Hilbert space (RKHS) endowed with a positive definite kernel. Under appropriate assumptions, the CME allows us to perform causal inference over the entire landscape of the counterfactual distribution. The CME can be estimated consistently from observational data without requiring any parametric assumption about the underlying distributions. We also derive a rate of convergence which depends on the smoothness of the conditional mean and the Radon-Nikodym derivative of the underlying marginal distributions. Our framework can deal with not only real-valued outcome, but potentially also more complex and structured outcomes such as images, sequences, and graphs. Lastly, our experimental results on off-policy evaluation tasks demonstrate the advantages of the proposed estimator.

ei pn

arXiv [BibTex]

arXiv [BibTex]


no image
Model-based Kernel Sum Rule: Kernel Bayesian Inference with Probabilistic Models

Nishiyama, Y., Kanagawa, M., Gretton, A., Fukumizu, K.

Arxiv e-prints, arXiv:1409.5178v2 [stat.ML], 2018 (article)

Abstract
Kernel Bayesian inference is a powerful nonparametric approach to performing Bayesian inference in reproducing kernel Hilbert spaces or feature spaces. In this approach, kernel means are estimated instead of probability distributions, and these estimates can be used for subsequent probabilistic operations (as for inference in graphical models) or in computing the expectations of smooth functions, for instance. Various algorithms for kernel Bayesian inference have been obtained by combining basic rules such as the kernel sum rule (KSR), kernel chain rule, kernel product rule and kernel Bayes' rule. However, the current framework only deals with fully nonparametric inference (i.e., all conditional relations are learned nonparametrically), and it does not allow for flexible combinations of nonparametric and parametric inference, which are practically important. Our contribution is in providing a novel technique to realize such combinations. We introduce a new KSR referred to as the model-based KSR (Mb-KSR), which employs the sum rule in feature spaces under a parametric setting. Incorporating the Mb-KSR into existing kernel Bayesian framework provides a richer framework for hybrid (nonparametric and parametric) kernel Bayesian inference. As a practical application, we propose a novel filtering algorithm for state space models based on the Mb-KSR, which combines the nonparametric learning of an observation process using kernel mean embedding and the additive Gaussian noise model for a state transition process. While we focus on additive Gaussian noise models in this study, the idea can be extended to other noise models, such as the Cauchy and alpha-stable noise models.

pn

arXiv [BibTex]

arXiv [BibTex]


no image
Attention please! Enhanced attention control abilities compensate for instructional impairments in multimedia learning

Wirzberger, M., Rey, G. D.

Journal of Computers in Education, 5(2):243-257, Springer Nature, 2018 (article)

Abstract
Learners exposed to multimedia learning contexts have to deal with a variety of visual stimuli, demanding a conducive design of learning material to maintain limitations in attentional resources. Within the current study, effects and constraints arising from two selected impairing features are investigated in more detail within a computer-based learning task on factor analysis. A sample of 53 students received a combination of textual and pictorial elements that explained the topic, while impaired attention was systematically induced in a 2 × 2 factorial between-subjects design by interrupting system-notifications (with vs. without) and seductive text passages (with vs. without). Learners’ ability for controlled attention was assessed with a standardized psychological attention inventory. Approaching the results, learners receiving seductive text passages spent significantly more time on the learning material. In addition, a moderation effect of attention control abilities on the relationship between interruptions and retention performance resulted. Explanations for the obtained findings are discussed referring to mechanisms of compensation, load, and activation.

re

DOI [BibTex]

DOI [BibTex]


Thumb xl hp teaser
A probabilistic model for the numerical solution of initial value problems

Schober, M., Särkkä, S., Philipp Hennig,

Statistics and Computing, Springer US, 2018 (article)

Abstract
We study connections between ordinary differential equation (ODE) solvers and probabilistic regression methods in statistics. We provide a new view of probabilistic ODE solvers as active inference agents operating on stochastic differential equation models that estimate the unknown initial value problem (IVP) solution from approximate observations of the solution derivative, as provided by the ODE dynamics. Adding to this picture, we show that several multistep methods of Nordsieck form can be recast as Kalman filtering on q-times integrated Wiener processes. Doing so provides a family of IVP solvers that return a Gaussian posterior measure, rather than a point estimate. We show that some such methods have low computational overhead, nontrivial convergence order, and that the posterior has a calibrated concentration rate. Additionally, we suggest a step size adaptation algorithm which completes the proposed method to a practically useful implementation, which we experimentally evaluate using a representative set of standard codes in the DETEST benchmark set.

pn

PDF Code DOI Project Page [BibTex]


no image
The Computational Challenges of Pursuing Multiple Goals: Network Structure of Goal Systems Predicts Human Performance

Reichman, D., Lieder, F., Bourgin, D. D., Talmon, N., Griffiths, T. L.

PsyArXiv, 2018 (article)

re

DOI [BibTex]

DOI [BibTex]


no image
The moderating role of arousal on the seductive detail effect in a multimedia learning setting

Schneider, S., Wirzberger, M., Rey, G. D.

Applied Cognitive Psychology, Wiley, 2018 (article)

Abstract
Arousal has been found to increase learners' attentional resources. In contrast, seductive details (interesting but learning‐irrelevant information) are considered to distract attention away from relevant information and, thus, hinder learning. However, a possibly moderating role of arousal on the seductive detail effect has not been examined yet. In this study, arousal variations were induced via audio files of false heartbeats. In consequence, 100 participants were randomly assigned to a 2 (with or without seductive details) × 2 (lower vs. higher false heart rates) between‐subjects design. Data on learning performance, cognitive load, motivation, heartbeat frequency, and electro‐dermal activity were collected. Results show learning‐inhibiting effects for seductive details and learning‐enhancing effects for higher false heart rates. Cognitive processes mediate both effects. However, the detrimental effect of seductive details was not present when heart rate was higher. Results indicate that the seductive detail effect is moderated by a learner's state of arousal.

re

DOI [BibTex]

DOI [BibTex]


no image
Probabilistic Approaches to Stochastic Optimization

Mahsereci, M.

Eberhard Karls Universität Tübingen, Germany, 2018 (phdthesis)

ei pn

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


no image
Probabilistic Ordinary Differential Equation Solvers — Theory and Applications

Schober, M.

Eberhard Karls Universität Tübingen, Germany, 2018 (phdthesis)

ei pn

[BibTex]

[BibTex]


no image
CoLoSS: Cognitive load corpus with speech and performance data from a symbol-digit dual-task

Herms, R., Wirzberger, M., Eibl, M., Rey, G. D.

In Proceedings of the 11th International Language Resources and Evaluation Conference (LREC 2018), pages: 4312-4317, European Language Resource Association (ELRA), Miyazaki, Japan, 2018 (inproceedings)

re

link (url) [BibTex]

link (url) [BibTex]


no image
Rational metareasoning and the plasticity of cognitive control

Lieder, F., Shenhav, A., Musslick, S., Griffiths, T. L.

{PLoS Computational Biology}, 14(4):e1006043, Public Library of Science, 2018 (article)

re

Project Page [BibTex]

Project Page [BibTex]


no image
Beyond bounded rationality: Reverse-engineering and enhancing human intelligence

Lieder, F.

University of California, Berkeley, 2018 (phdthesis)

re

[BibTex]


no image
Influences of system response delay on elderly participants’ performance in a virtual memory training

Wirzberger, M., Schmidt, R., Georgi, M., Hardt, W., Brunnett, G., Rey, G. D.

In Annual Meeting of the Europe Chapter of the Human Factors and Ergonomics Society2018, Technology for an Aging Society, Book of Abstracts, pages: 42, Berlin, 2018 (inproceedings)

re

link (url) [BibTex]

link (url) [BibTex]


no image
Over-representation of extreme events in decision making reflects rational use of cognitive resources

Lieder, F., Griffiths, T. L., Hsu, M.

Psychological Review, 125(1):1-32, 2018 (article)

re

[BibTex]

[BibTex]


no image
Cognitive load influences performance, speech and physiological parameters in a multimodal dual-task setting

Wirzberger, M., Herms, R., Esmaeili Bijarsari, S., Rey, G. D., Eibl, M.

In Abstracts of the 60th Conference of Experimental Psychologists, pages: 296, Pabst Science Publishers, Lengerich, 2018 (inproceedings)

re

[BibTex]

[BibTex]


no image
Guidance or Setting? Exploring the learnability of computer-based instructions in a construction task

Esmaeili Bijarsari, S., Wirzberger, M., Rey, G. D.

In Abstracts of the 60th Conference of Experimental Psychologists, pages: 69, Pabst Science Publishers, Lengerich, 2018 (inproceedings)

re

[BibTex]

[BibTex]


no image
A resource-rational analysis of human planning

Callaway, F., Lieder, F., Das, P., Gul, S., Krueger, P. M., Griffiths, T. L.

In Proceedings of the 40th Annual Conference of the Cognitive Science Society, 2018 (inproceedings)

re

[BibTex]

[BibTex]


no image
Guidance or Setting? Exploring the learnability of computer-based instructions in a construction task

Esmaeili Bijarsari, S., Wirzberger, M., Rey, G. D.

In 51st Conference of the German Psychological Society. Abstracts, pages: 509, Pabst Science Publishers, Lengerich, 2018 (inproceedings)

re

[BibTex]

[BibTex]


Thumb xl screen shot 2018 10 09 at 11.42.49
Active Uncertainty Calibration in Bayesian ODE Solvers

Kersting, H., Hennig, P.

Proceedings of the 32nd Conference on Uncertainty in Artificial Intelligence (UAI), pages: 309-318, (Editors: Ihler, A. and Janzing, D.), AUAI Press, June 2016 (conference)

Abstract
There is resurging interest, in statistics and machine learning, in solvers for ordinary differential equations (ODEs) that return probability measures instead of point estimates. Recently, Conrad et al.~introduced a sampling-based class of methods that are `well-calibrated' in a specific sense. But the computational cost of these methods is significantly above that of classic methods. On the other hand, Schober et al.~pointed out a precise connection between classic Runge-Kutta ODE solvers and Gaussian filters, which gives only a rough probabilistic calibration, but at negligible cost overhead. By formulating the solution of ODEs as approximate inference in linear Gaussian SDEs, we investigate a range of probabilistic ODE solvers, that bridge the trade-off between computational cost and probabilistic calibration, and identify the inaccurate gradient measurement as the crucial source of uncertainty. We propose the novel filtering-based method Bayesian Quadrature filtering (BQF) which uses Bayesian quadrature to actively learn the imprecision in the gradient measurement by collecting multiple gradient evaluations.

ei pn

link (url) Project Page Project Page [BibTex]

link (url) Project Page Project Page [BibTex]


Thumb xl screen shot 2016 01 19 at 14.48.37
Automatic LQR Tuning Based on Gaussian Process Global Optimization

Marco, A., Hennig, P., Bohg, J., Schaal, S., Trimpe, S.

In Proceedings of the IEEE International Conference on Robotics and Automation (ICRA), pages: 270-277, IEEE, IEEE International Conference on Robotics and Automation, May 2016 (inproceedings)

Abstract
This paper proposes an automatic controller tuning framework based on linear optimal control combined with Bayesian optimization. With this framework, an initial set of controller gains is automatically improved according to a pre-defined performance objective evaluated from experimental data. The underlying Bayesian optimization algorithm is Entropy Search, which represents the latent objective as a Gaussian process and constructs an explicit belief over the location of the objective minimum. This is used to maximize the information gain from each experimental evaluation. Thus, this framework shall yield improved controllers with fewer evaluations compared to alternative approaches. A seven-degree- of-freedom robot arm balancing an inverted pole is used as the experimental demonstrator. Results of a two- and four- dimensional tuning problems highlight the method’s potential for automatic controller tuning on robotic platforms.

am ics pn

Video PDF DOI Project Page [BibTex]

Video PDF DOI Project Page [BibTex]


no image
Batch Bayesian Optimization via Local Penalization

González, J., Dai, Z., Hennig, P., Lawrence, N.

Proceedings of the 19th International Conference on Artificial Intelligence and Statistics (AISTATS), 51, pages: 648-657, JMLR Workshop and Conference Proceedings, (Editors: Gretton, A. and Robert, C. C.), May 2016 (conference)

ei pn

link (url) Project Page [BibTex]

link (url) Project Page [BibTex]


Thumb xl untitled
Probabilistic Approximate Least-Squares

Bartels, S., Hennig, P.

Proceedings of the 19th International Conference on Artificial Intelligence and Statistics (AISTATS), 51, pages: 676-684, JMLR Workshop and Conference Proceedings, (Editors: Gretton, A. and Robert, C. C. ), May 2016 (conference)

Abstract
Least-squares and kernel-ridge / Gaussian process regression are among the foundational algorithms of statistics and machine learning. Famously, the worst-case cost of exact nonparametric regression grows cubically with the data-set size; but a growing number of approximations have been developed that estimate good solutions at lower cost. These algorithms typically return point estimators, without measures of uncertainty. Leveraging recent results casting elementary linear algebra operations as probabilistic inference, we propose a new approximate method for nonparametric least-squares that affords a probabilistic uncertainty estimate over the error between the approximate and exact least-squares solution (this is not the same as the posterior variance of the associated Gaussian process regressor). This allows estimating the error of the least-squares solution on a subset of the data relative to the full-data solution. The uncertainty can be used to control the computational effort invested in the approximation. Our algorithm has linear cost in the data-set size, and a simple formal form, so that it can be implemented with a few lines of code in programming languages with linear algebra functionality.

ei pn

link (url) Project Page Project Page [BibTex]

link (url) Project Page Project Page [BibTex]


Thumb xl cloud tracking
Gaussian Process-Based Predictive Control for Periodic Error Correction

Klenske, E. D., Zeilinger, M., Schölkopf, B., Hennig, P.

IEEE Transactions on Control Systems Technology , 24(1):110-121, 2016 (article)

ei pn

PDF DOI [BibTex]

PDF DOI [BibTex]


Thumb xl dual control sampled b
Dual Control for Approximate Bayesian Reinforcement Learning

Klenske, E. D., Hennig, P.

Journal of Machine Learning Research, 17(127):1-30, 2016 (article)

ei pn

PDF link (url) [BibTex]

PDF link (url) [BibTex]


no image
Sustainable effects of simulator-based training on ecological driving

Lüderitz, C., Wirzberger, M., Karrer-Gauß, K.

In Advances in Ergonomic Design of Systems, Products and Processes. Proceedings of the Annual Meeting of the GfA 2015, pages: 463-475, Springer, 2016 (inbook)

Abstract
Simulation-based driver training offers a promising way to teach ecological driving behavior under controlled, comparable conditions. In a study with 23 professional drivers, we tested the effectiveness of such training. The driving behavior of a training group in a simulated drive with and without instructions were compared. Ten weeks later, a repetition drive tested the long-term effect training. Driving data revealed reduced fuel consumption by ecological driving in both the guided and repetition drives. Driving time decreased significantly in the training and did not differ from driving time after 10 weeks. Results did not achieve significance for transfer to test drives in real traffic situations. This may be due to the small sample size and biased data as a result of unusual driving behavior. Finally, recent and promising approaches to support drivers in maintaining eco-driving styles beyond training situations are outlined.

re

DOI [BibTex]

DOI [BibTex]


no image
One for all?! Simultaneous examination of load-inducing factors for advancing media-related instructional research

Wirzberger, M., Beege, M., Schneider, S., Nebel, S., Rey, G. D.

Computers {\&} Education, 100, pages: 18-31, Elsevier BV, 2016 (article)

Abstract
In multimedia learning settings, limitations in learners' mental resource capacities need to be considered to avoid impairing effects on learning performance. Based on the prominent and often quoted Cognitive Load Theory, this study investigates the potential of a single experimental approach to provide simultaneous and separate measures for the postulated load-inducing factors. Applying a basal letter-learning task related to the process of working memory updating, intrinsic cognitive load (by varying task complexity), extraneous cognitive load (via inducing split-attention demands) and germane cognitive load (by varying the presence of schemata) were manipulated within a 3 × 2 × 2-factorial full repeated-measures design. The performance of a student sample (N = 96) was inspected regarding reaction times and errors in updating and recall steps. Approaching the results with linear mixed models, the effect of complexity gained substantial strength, whereas the other factors received at least partial significant support. Additionally, interactions between two or all load-inducing factors occurred. Despite various open questions, the study comprises a promising step for the empirical investigation of existing construction yards in cognitive load research.

re

DOI [BibTex]

DOI [BibTex]


no image
Examining load-inducing factors in instructional design: An ACT-R approach

Wirzberger, M., Rey, G. D.

In Proceedings of the 14th International Conference on Cognitive Modeling (ICCM 2016), pages: 223-224, University Park, PA, Penn State, 2016 (inproceedings)

re

[BibTex]

[BibTex]


no image
Helping people make better decisions using optimal gamification

Lieder, F., Griffiths, T. L.

In Proceedings of the 38th Annual Conference of the Cognitive Science Society, 2016 (inproceedings)

re

Project Page [BibTex]

Project Page [BibTex]


no image
CLT meets ACT-R: Modeling load-inducing factors in instructional design

Wirzberger, M., Rey, G. D.

In Abstracts of the 58th Conference of Experimental Psychologists, pages: 377, Pabst Science Publishers, Lengerich, 2016 (inproceedings)

re

[BibTex]

[BibTex]


no image
Modeling load factors in multimedia learning: An ACT-R approach

Wirzberger, M.

In Dagstuhl 2016. Proceedings of the 10th Joint Workshop of the German Research Training Groups in Computer Science, pages: 98, Universitätsverlag Chemnitz, Chemnitz, 2016 (inproceedings)

re

[BibTex]

[BibTex]


no image
Separating cognitive load facets in a working memory updating task: An experimental approach

Wirzberger, M., Beege, M., Schneider, S., Nebel, S., Rey, G. D.

In International Meeting of the Psychonomic Society, Granada – Spain, May 5-8, 2016, Abstract Book, pages: 211-212, 2016 (inproceedings)

re

[BibTex]

[BibTex]


no image
CLT meets WMU: Simultaneous experimental manipulation of load factors in a basal working memory task

Wirzberger, M., Beege, M., Schneider, S., Nebel, S., Rey, G. D.

In 9th International Cognitive Load Theory Conference, June 22nd to 24th, 2016, Bochum, Germany, Abstracts, pages: 19, 2016 (inproceedings)

re

[BibTex]

[BibTex]


no image
Bedingt räumliche Nähe bessere Lernergebnisse? Die Rolle der Distanz und Integration beim Lernen mit multiplen Informationsquellen

Beege, M., Nebel, S., Schneider, S., Wirzberger, M., Schmidt, N., Rey, G. D.

In 50th Conference of the German Psychological Society. Abstracts, pages: 540, Pabst Science Publishers, Lengerich, 2016 (inproceedings)

re

[BibTex]

[BibTex]

2015


Thumb xl posterior
Automatic LQR Tuning Based on Gaussian Process Optimization: Early Experimental Results

Marco, A., Hennig, P., Bohg, J., Schaal, S., Trimpe, S.

Machine Learning in Planning and Control of Robot Motion Workshop at the IEEE/RSJ International Conference on Intelligent Robots and Systems (iROS), pages: , , Machine Learning in Planning and Control of Robot Motion Workshop, October 2015 (conference)

Abstract
This paper proposes an automatic controller tuning framework based on linear optimal control combined with Bayesian optimization. With this framework, an initial set of controller gains is automatically improved according to a pre-defined performance objective evaluated from experimental data. The underlying Bayesian optimization algorithm is Entropy Search, which represents the latent objective as a Gaussian process and constructs an explicit belief over the location of the objective minimum. This is used to maximize the information gain from each experimental evaluation. Thus, this framework shall yield improved controllers with fewer evaluations compared to alternative approaches. A seven-degree-of-freedom robot arm balancing an inverted pole is used as the experimental demonstrator. Preliminary results of a low-dimensional tuning problem highlight the method’s potential for automatic controller tuning on robotic platforms.

am ei ics pn

PDF DOI Project Page [BibTex]

2015


PDF DOI Project Page [BibTex]


no image
Inference of Cause and Effect with Unsupervised Inverse Regression

Sgouritsa, E., Janzing, D., Hennig, P., Schölkopf, B.

In Proceedings of the 18th International Conference on Artificial Intelligence and Statistics, 38, pages: 847-855, JMLR Workshop and Conference Proceedings, (Editors: Lebanon, G. and Vishwanathan, S.V.N.), JMLR.org, AISTATS, 2015 (inproceedings)

ei pn

Web PDF [BibTex]

Web PDF [BibTex]


no image
Probabilistic Interpretation of Linear Solvers

Hennig, P.

SIAM Journal on Optimization, 25(1):234-260, 2015 (article)

ei pn

Web PDF link (url) DOI [BibTex]

Web PDF link (url) DOI [BibTex]


no image
Modeling interruption and resumption in a smartphone task: An ACT-R approach

Wirzberger, M., Russwinkel, N.

i-com, 14(2), Walter de Gruyter GmbH, 2015 (article)

Abstract
This research aims to inspect human cognition when being interrupted while performing a smartphone task with varying levels of mental demand. Due to its benefits especially in the early stages of interface development, a cognitive modeling approach is used. It applies the cognitive architecture ACT-R to shed light on task-related cognitive processing. The inspected task setting involves a shopping scenario, manipulating interruption via product advertisements and mental demands by the respective number of people shopping is done for. Model predictions are validated through a corresponding experimental setting with 62 human participants. Comparing model and human data in a defined set of performance-related parameters displays mixed results that indicate an acceptable fit – at least in some cases. Potential explanations for the observed differences are discussed at the end.

re

DOI [BibTex]

DOI [BibTex]


Thumb xl maren ls
Probabilistic Line Searches for Stochastic Optimization

Mahsereci, M., Hennig, P.

In Advances in Neural Information Processing Systems 28, pages: 181-189, (Editors: C. Cortes, N.D. Lawrence, D.D. Lee, M. Sugiyama and R. Garnett), Curran Associates, Inc., 29th Annual Conference on Neural Information Processing Systems (NIPS), 2015 (inproceedings)

Abstract
In deterministic optimization, line searches are a standard tool ensuring stability and efficiency. Where only stochastic gradients are available, no direct equivalent has so far been formulated, because uncertain gradients do not allow for a strict sequence of decisions collapsing the search space. We construct a probabilistic line search by combining the structure of existing deterministic methods with notions from Bayesian optimization. Our method retains a Gaussian process surrogate of the univariate optimization objective, and uses a probabilistic belief over the Wolfe conditions to monitor the descent. The algorithm has very low computational cost, and no user-controlled parameters. Experiments show that it effectively removes the need to define a learning rate for stochastic gradient descent. [You can find the matlab research code under `attachments' below. The zip-file contains a minimal working example. The docstring in probLineSearch.m contains additional information. A more polished implementation in C++ will be published here at a later point. For comments and questions about the code please write to mmahsereci@tue.mpg.de.]

ei pn

Matlab research code link (url) [BibTex]

Matlab research code link (url) [BibTex]


no image
A Random Riemannian Metric for Probabilistic Shortest-Path Tractography

Hauberg, S., Schober, M., Liptrot, M., Hennig, P., Feragen, A.

In 18th International Conference on Medical Image Computing and Computer Assisted Intervention, 9349, pages: 597-604, Lecture Notes in Computer Science, MICCAI, 2015 (inproceedings)

ei pn

PDF DOI [BibTex]

PDF DOI [BibTex]