From the early nineties, when the first Ant colony optimization algorithm was proposed, ACO attracted the attention of increasing numbers of researchers and many successful applications are now available. [...] a sub...
详细信息
From the early nineties, when the first Ant colony optimization algorithm was proposed, ACO attracted the attention of increasing numbers of researchers and many successful applications are now available. [...] a substantial corpus of theoretical results is becoming available that provides useful guidelines to researchers and practitioners in further applications of ACO.
Machine Learning Health Operations (MLHOps) is the combination of processes for reliable, efficient, usable, and ethical deployment and maintenance of machine learning models in healthcare settings. This paper provide...
详细信息
Machine Learning Health Operations (MLHOps) is the combination of processes for reliable, efficient, usable, and ethical deployment and maintenance of machine learning models in healthcare settings. This paper provides both a survey of work in this area and guidelines for developers and clinicians to deploy and maintain their own models in clinical practice. We cover the foundational concepts of general machine learning operations and describe the initial setup of MLHOps pipelines (including data sources, preparation, engineering, and tools). We then describe long-term monitoring and updating (including data distribution shifts and model updating) and ethical considerations (including bias, fairness, interpretability, and privacy). This work therefore provides guidance across the full pipeline of MLHOps from conception to initial and ongoing deployment. We also include a checklist to ensure thorough verification of each step in the process.
A fuzzy mechanism for building a goal-driven, life-purpose perspective for artificialintelligence, robotics or computationalintelligence is presented in this paper. According to a non-traditional epistemological par...
详细信息
A fuzzy mechanism for building a goal-driven, life-purpose perspective for artificialintelligence, robotics or computationalintelligence is presented in this paper. According to a non-traditional epistemological paradigm for understanding the term intelligence this adaptive fuzzy goal-driven approach becomes an alternative both to construct intelligent systems and to understand human intelligence. The fuzzy system as suggested may yet be seen as a useful mechanism for representing the approximate human-being reasoning due the likelihood it presents when compared to the way human beings adapt their reasoning and behavior in order to accommodate small changes caused by the environment or by the context. In this sense the proposed approach may also allow the nature of intelligent machine and intelligent human behavior converge to be the same.
We develop greedy algorithms to approximate the optimal solution to the multi-fidelity sensor selection problem, which is a cost constrained optimization problem prescribing the placement and number of cheap (low sign...
详细信息
We develop greedy algorithms to approximate the optimal solution to the multi-fidelity sensor selection problem, which is a cost constrained optimization problem prescribing the placement and number of cheap (low signal-to-noise) and expensive (high signal-to-noise) sensors in an environment or state space. Specifically, we evaluate the composition of cheap and expensive sensors, along with their placement, required to achieve accurate reconstruction of a high-dimensional state. We use the column-pivoted QR decomposition to obtain preliminary sensor positions. How many of each type of sensor to use is highly dependent upon the sensor noise levels, sensor costs, overall cost budget, and the singular value spectrum of the data measured. Such nuances allow us to provide sensor selection recommendations based on computational results for asymptotic regions of parameter space. We also present a systematic exploration of the effects of the number of modes and sensors on reconstruction error when using one type of sensor. Our extensive exploration of multi-fidelity sensor composition as a function of data characteristics is the first of its kind to provide guidelines towards optimal multi-fidelity sensor selection.
Word sense disambiguation (WSD) is a task of determining a reasonable sense of a word in a particular context. Although recent studies have demonstrated some progress in the advancement of neural language models, the ...
详细信息
Word sense disambiguation (WSD) is a task of determining a reasonable sense of a word in a particular context. Although recent studies have demonstrated some progress in the advancement of neural language models, the scope of research is still such that the senses of several words can only be determined in a few domains. Therefore, it is necessary to move toward developing a highly scalable process that can address a lot of senses occurring in various domains. This paper introduces a new large WSD dataset that is automatically constructed from the Oxford Dictionary, which is widely used as a standard source for the meaning of words. We propose a new WSD model that individually determines the sense of the word in accordance with its part of speech in the context. In addition, we introduce a hybrid sense prediction method that separately classifies the less frequently used senses for achieving a reasonable performance. We have conducted comparative experiments to demonstrate that the proposed method is more reliable compared with the baseline approaches. Also, we investigated the adaptation of the method to a realistic environment with the use of news articles.
It is known that the (1 + 1)-EA with mutation rate c/n optimizes every monotone function efficiently if c = 2.2. We study the same question for a large variety of algorithms, particularly for the (1 + lambda)-EA, (mu ...
详细信息
It is known that the (1 + 1)-EA with mutation rate c/n optimizes every monotone function efficiently if c < 1, and needs exponential time on some monotone functions (HOTTOPIC functions) if c >= 2.2. We study the same question for a large variety of algorithms, particularly for the (1 + lambda)-EA, (mu + 1)-EA, (mu + 1)-GA, their "fast" counterparts, and for the (1 + (lambda, lambda))-GA. We find that all considered mutation-based algorithms show a similar dichotomy for HOTTOPIC functions, or even for all monotone functions. For the (1 + (lambda, lambda))-GA, this dichotomy is in the parameter c gamma, which is the expected number of bit flips in an individual after mutation and crossover, neglecting selection. For the fast algorithms, the dichotomy is in m(2)/m(1), where m(1) and m(2) are the first and second falling moment of the number of bit flips. Surprisingly, the range of efficient parameters is not affected by either population size mu nor by the offspring population size lambda. The picture changes completely if crossover is allowed. The genetic algorithms (mu + 1)-GA and (mu+1)-fGA are efficient for arbitrary mutations strengths if mu is large enough.
Automated game design is the problem of automatically producing games through computational processes. Traditionally, these methods have relied on the authoring of search spaces by a designer, defining the space of al...
详细信息
Automated game design is the problem of automatically producing games through computational processes. Traditionally, these methods have relied on the authoring of search spaces by a designer, defining the space of all possible games for the system to the author. In this article, we instead learn representations of existing games from gameplay video and use these to approximate a search space of novel games. In a human subject study, we demonstrate that these novel games are indistinguishable from human games in terms of challenge and that one of the novel games was equivalent to one of the human games in terms of fun, frustration, and likeability.
暂无评论