A systematic review of algorithm aversion in augmented decision making

Despite abundant literature theorizing societal implications of algorithmic decision making, relatively little is known about the conditions that lead to the acceptance or rejection of algorithmically generated insights by individual users of decision aids. More specifically, recent findings of algorithm aversion—the reluctance of human forecasters to use superior but imperfect algorithms—raise questions about whether joint human-algorithm decision making is feasible in practice. In this paper, we systematically review the topic of algorithm aversion as it appears in 61 peer-reviewed articles between 1950 and 2018 and follow its conceptual trail across disciplines. We categorize and report on the proposed causes and solutions of algorithm aversion in five themes: expectations and expertise, decision autonomy, incentivization, cognitive compatibility, and divergent rationalities. Although each of the presented themes addresses distinct features of an algorithmic decision aid, human users of the decision aid, and/or the decision making environment, apparent interdependencies are highlighted. We conclude that resolving algorithm aversion requires an updated research program with an emphasis on theory integration. We provide a number of empirical questions that can be immediately carried forth by the behavioral decision making community.     

Latent variable models for analyzing children's processing ability

In this paper, we develop a latent processing ability model to analyze the speed of processing ability data. Our approach can not only effectively evaluate the effects of covariates on the latent processing ability, but also estimate the latent trait of each child by calculating its posterior mean. In addition, we derive the correlations structure of latent traits among different age groups. Simulations are conducted to evaluate the performance of our proposed model. The results indicated that the estimation of model parameters is satisfactory overall. The method is evaluated using real data from children aged 4–7 years in Changchun, China.     

道德困境研究的范式沿革及其理论价值

通过评述道德困境研究范式的发展过程, 系统阐释了经典两难法、加工分离法、CNI模型法和CAN算法的优缺点和理论价值。后来的研究范式均在一定程度上克服了之前研究范式的局限。加工分离法克服了经典两难法的加工纯粹性假设等局限, CNI模型法在加工分离法基础上进一步分离了道德困境决策的多种心理过程, CAN算法则修正了CNI模型法的序列加工的不恰当预设。研究范式的沿革启示研究者综合应用新方法来解决研究争议和重新审视以往道德理论, 合理应用新方法来探索其他具有潜在冲突性的研究议题。总之, 本文为道德困境及相关研究提供了方法学参考。     

Gaussian variational estimation for multidimensional item response theory

Multidimensional item response theory (MIRT) is widely used in assessment and evaluation of educational and psychological tests. It models the individual response patterns by specifying a functional relationship between individuals' multiple latent traits and their responses to test items. One major challenge in parameter estimation in MIRT is that the likelihood involves intractable multidimensional integrals due to the latent variable structure. Various methods have been proposed that involve either direct numerical approximations to the integrals or Monte Carlo simulations. However, these methods are known to be computationally demanding in high dimensions and rely on sampling data points from a posterior distribution. We propose a new Gaussian variational expectation--maximization (GVEM) algorithm which adopts variational inference to approximate the intractable marginal likelihood by a computationally feasible lower bound. In addition, the proposed algorithm can be applied to assess the dimensionality of the latent traits in an exploratory analysis. Simulation studies are conducted to demonstrate the computational efficiency and estimation precision of the new GVEM algorithm compared to the popular alternative Metropolis–Hastings Robbins–Monro algorithm. In addition, theoretical results are presented to establish the consistency of the estimator from the new GVEM algorithm.     

Numerical approximation of the observed information matrix with Oakes' identity

An efficient and accurate numerical approximation methodology useful for obtaining the observed information matrix and subsequent asymptotic covariance matrix when fitting models with the EM algorithm is presented. The numerical approximation approach is compared to existing algorithms intended for the same purpose, and the computational benefits and accuracy of this new approach are highlighted. Instructive and real-world examples are included to demonstrate the methodology concretely, properties of the estimator are discussed in detail, and a Monte Carlo simulation study is included to investigate the behaviour of a multi-parameter item response theory model using three competing finite-difference algorithms.     

如何利用开源工具分析fMRI数据：基于多体素模式的有监督机器学习算法介绍

摘要：目前,多体素模式分析（MVPA）日渐普遍地应用于脑影像研究。近些年,机器学习的模式分类等算法在MVPA方法中被广泛应用,因其具有能够抽取高维数据模式,提高数据利用率的优点。其中一种典型的应用是利用解码的思想来解决神经表征问题,本文主要介绍了利用基于Python语言的工具库中有监督学习算法分析数据的过程。除介绍Nilearn结合Scikit-learn分析数据的步骤外,还比较不同算法的效率,为算法的选择及参数设备提供具体参考。     

Association rule learning in neuropsychological data analysis for Alzheimer’s disease

Efficient methods of analysis readily available for clinicians continue to be limited within neuropsychological assessment at the raw data level. Here, a novel approach for generating predictive response patterns and analysing neuropsychological raw data is offered. In order to assess the usefulness of association rule learning as an analysis tool for neuropsychological raw data, Frequent Pattern Growth (FP-Growth) was used to mine patterns from the Consortium to Establish a Registry for Alzheimer’s Disease Neuropsychological Battery (CERAD-NB) database. Complete assessment data for 84 post-mortem confirmed Alzheimer’s disease (AD) cases and 294 age, race, and education matched controls were analysed across baseline and one-year follow-up using FP-Growth, for the purpose of assessing the clinical utility of a finer analysis at the raw data level and the feasibility of predicting response patterns for clinical/control groups. Output from FP-Growth, in terms of the number of frequent itemsets retained across both evaluation timepoints, was discernable between controls, mild, and moderate to severe Alzheimer’s disease cases (p < .001, and η² = .488). Patterns within raw data scores, both in terms of frequent itemsets and predictive association rules, appear to be differentiable across groups within neuropsychological analysis, which indicates that FP-Growth is applicable as a supplementary analysis tool for neuropsychological assessment by means of offering an additional level of data analysis, predictive item response capabilities, and aiding in clinical decision making.     

Trade‐off ranking method for multi‐criteria decision analysis

Multi‐criteria decision analysis presumes trade‐off between different criteria. As a result, the optimal solution is not unique and can be represented by the Pareto frontier in the objective space. Each Pareto solution is a compromise between different objectives. Despite a limited number of Pareto optimal solutions, the decision‐maker eventually has to choose only one option. Such a choice has to be made with the use of additional preferences not included in the original formulation of the optimization problem. The paper represents a new approach to an automatic ranking that can help the decision‐maker. In contrast to the other methodologies, the proposed method is based on the minimization of trade‐off between different Pareto solutions. To be realized, the approach presumes the existence of a well‐distributed Pareto set representing the entire Pareto frontier. In the paper, such a set is generated with the use of the directed search domain algorithm. The method is applied to a number of test cases and compared against two existing alternative approaches.     

Methodology to select solutions for multiobjective optimization problems: Weighted stress function method

The weighted stress function method is proposed here as a new way of identifying the best solution from a set of nondominated solutions according to the decision maker's preferences, expressed in terms of weights. The method was tested using several benchmark problems from the literature, and the results obtained were compared with those of other methods, namely, the reference point evolutionary multiobjective optimization (EMO), the weighted Tchebycheff metric, and a goal programming method. The weighted stress function method can be seen to exhibit a more direct correspondence between the weights set by the decision maker and the final solutions obtained than the other methods tested.