Amortised Experimental Design and Parameter Estimation for User Models of Pointing

• URL: http://arxiv.org/abs/2307.09878v1
• Date: Wed, 19 Jul 2023 10:17:35 GMT
• Title: Amortised Experimental Design and Parameter Estimation for User Models of Pointing
• Authors: Antti Keurulainen, Isak Westerlund, Oskar Keurulainen, Andrew Howes
• Abstract summary: We show how experiments can be designed so as to gather data and infer parameters as efficiently as possible. We train a policy for choosing experimental designs with simulated participants. Our solution learns which experiments provide the most useful data for parameter estimation by interacting with in-silico agents sampled from the model space.
• Score: 5.076871870091048
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: User models play an important role in interaction design, supporting automation of interaction design choices. In order to do so, model parameters must be estimated from user data. While very large amounts of user data are sometimes required, recent research has shown how experiments can be designed so as to gather data and infer parameters as efficiently as possible, thereby minimising the data requirement. In the current article, we investigate a variant of these methods that amortises the computational cost of designing experiments by training a policy for choosing experimental designs with simulated participants. Our solution learns which experiments provide the most useful data for parameter estimation by interacting with in-silico agents sampled from the model space thereby using synthetic data rather than vast amounts of human data. The approach is demonstrated for three progressively complex models of pointing.

Related papers

• Forewarned is Forearmed: Leveraging LLMs for Data Synthesis through Failure-Inducing Exploration [90.41908331897639]
  Large language models (LLMs) have significantly benefited from training on diverse, high-quality task-specific data. We present a novel approach, ReverseGen, designed to automatically generate effective training samples.
  arXiv  Detail & Related papers  (2024-10-22T06:43:28Z)
• Diffusion posterior sampling for simulation-based inference in tall data settings [53.17563688225137]
  Simulation-based inference ( SBI) is capable of approximating the posterior distribution that relates input parameters to a given observation. In this work, we consider a tall data extension in which multiple observations are available to better infer the parameters of the model. We compare our method to recently proposed competing approaches on various numerical experiments and demonstrate its superiority in terms of numerical stability and computational cost.
  arXiv  Detail & Related papers  (2024-04-11T09:23:36Z)
• Designing Optimal Behavioral Experiments Using Machine Learning [8.759299724881219]
  We provide a tutorial on leveraging recent advances in BOED and machine learning to find optimal experiments for any kind of model. We consider theories of how people balance exploration and exploitation in multi-armed bandit decision-making tasks. As compared to experimental designs commonly used in the literature, we show that our optimal designs more efficiently determine which of a set of models best account for individual human behavior.
  arXiv  Detail & Related papers  (2023-05-12T18:24:30Z)
• Online simulator-based experimental design for cognitive model selection [74.76661199843284]
  We propose BOSMOS: an approach to experimental design that can select between computational models without tractable likelihoods. In simulated experiments, we demonstrate that the proposed BOSMOS technique can accurately select models in up to 2 orders of magnitude less time than existing LFI alternatives.
  arXiv  Detail & Related papers  (2023-03-03T21:41:01Z)
• BeCAPTCHA-Type: Biometric Keystroke Data Generation for Improved Bot Detection [63.447493500066045]
  This work proposes a data driven learning model for the synthesis of keystroke biometric data. The proposed method is compared with two statistical approaches based on Universal and User-dependent models. Our experimental framework considers a dataset with 136 million keystroke events from 168 thousand subjects.
  arXiv  Detail & Related papers  (2022-07-27T09:26:15Z)
• HyperImpute: Generalized Iterative Imputation with Automatic Model Selection [77.86861638371926]
  We propose a generalized iterative imputation framework for adaptively and automatically configuring column-wise models. We provide a concrete implementation with out-of-the-box learners, simulators, and interfaces.
  arXiv  Detail & Related papers  (2022-06-15T19:10:35Z)
• Mixed Effects Neural ODE: A Variational Approximation for Analyzing the Dynamics of Panel Data [50.23363975709122]
  We propose a probabilistic model called ME-NODE to incorporate (fixed + random) mixed effects for analyzing panel data. We show that our model can be derived using smooth approximations of SDEs provided by the Wong-Zakai theorem. We then derive Evidence Based Lower Bounds for ME-NODE, and develop (efficient) training algorithms.
  arXiv  Detail & Related papers  (2022-02-18T22:41:51Z)
• Bayesian Optimal Experimental Design for Simulator Models of Cognition [14.059933880568908]
  We combine recent advances in BOED and approximate inference for intractable models to find optimal experimental designs. Our simulation experiments on multi-armed bandit tasks show that our method results in improved model discrimination and parameter estimation.
  arXiv  Detail & Related papers  (2021-10-29T09:04:01Z)
• Applying Evolutionary Metaheuristics for Parameter Estimation of Individual-Based Models [0.0]
  We introduce EvoPER, an R package for the simplifying the parameter estimation using evolutionary methods. In this work, we introduce EvoPER, an R package for the simplifying the parameter estimation using evolutionary methods.
  arXiv  Detail & Related papers  (2020-05-24T07:48:27Z)
• Bayesian Experimental Design for Implicit Models by Mutual Information Neural Estimation [16.844481439960663]
  Implicit models, where the data-generation distribution is intractable but sampling is possible, are ubiquitous in the natural sciences. A fundamental question is how to design experiments so that the collected data are most useful. For implicit models, however, this approach is severely hampered by the high computational cost of computing posteriors. We show that training a neural network to maximise a lower bound on MI allows us to jointly determine the optimal design and the posterior.
  arXiv  Detail & Related papers  (2020-02-19T12:09:42Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.