A novel fuzzy control scheme with adaptation algorithms is developed for robot manipulators’ system. At the beginning, one adjustable parameter is introduced in the fuzzy logic system, the robot manipulators system with uncertain nonlinear terms as the master device and a reference model dynamic system as the slave robot system. To overcome the limitations such as online learning computation burden and logic structure in conventional fuzzy logic systems, a parameter should be used in fuzzy logic system, which composes fuzzy (...) logic system with updated parameter laws, and can be formed for a new fashioned adaptation algorithms controller. The error closed-loop dynamical system can be stabilized based on Lyapunov analysis, the number of online learning computation burdens can be reduced greatly, and the different kinds of fuzzy logic systems with fuzzy rules or without any fuzzy rules are also suited. Finally, effectiveness of the proposed approach has been shown in simulation example. (shrink)

Work in online learning traditionally considered induction-friendly (e.g. stochastic with a fixed distribution) and induction-hostile (adversarial) settings separately. While algorithms like Exp3 that have been developed for the adversarial setting are applicable to the stochastic setting as well, the guarantees that can be obtained are usually worse than those that are available for algorithms that are specifically designed for stochastic settings. Only recently, there is an increasing interest in algorithms that give (near-)optimal guarantees with respect to the underlying setting, even (...) in case its nature is unknown to the learner. In this paper, we review various online learning algorithms that are able to adapt to the hardness of the underlying problem setting. While our focus lies on the application of adaptive algorithms as meta-inductive methods that combine given base methods, concerning theoretical properties we are also interested in guarantees that go beyond a comparison to the best fixed base learner. (shrink)

This paper firstly designs a five-dimensional model of learners’ characteristics and a three-dimensional model of English reading resources’ characteristics in a fragmented learning environment through literature research. At the same time, to make the learning resources meet the characteristics of fragmented learning time and space, the English Level 4 reading resources are reasonably designed and segmented to adapt to the needs of learners’ mobile fragmented learning. Then, combined with machine learning algorithms, an adaptive recommendation model of learning resources in English (...) fragmented reading is constructed. The algorithm-based adaptive recommendation algorithm for English fragmented reading resources is designed. Based on the generated decision trees, the expression rules are parsed to achieve adaptive pushing of resources. The results of this study show that adaptive recommendation of learning resources in English fragmented reading can help teachers to develop future resource recommendation strategies through effective data collection to adaptively push resources that are close to learners’ individual needs. The use of mobile by English learners to learn to read in a fragmented learning context enables targeted training in weak areas of English reading, thus enhancing different aspects of learners’ reading skills. (shrink)

Business Ethics: A European Review, EarlyView.

This paper proposes an adaptive formation tracking control algorithm optimized by Q-learning scheme for multiple mobile robots. In order to handle the model uncertainties and external disturbances, a desired linear extended state observer is designed to develop an adaptive formation tracking control strategy. Then an adaptive method of sliding mode control parameters optimized by Q-learning scheme is employed, which can avoid the complex parameter tuning process. Furthermore, the stability of the closed-loop control system is rigorously proved by means of (...) matrix properties of graph theory and Lyapunov theory, and the formation tracking errors can be guaranteed to be uniformly ultimately bounded. Finally, simulations are presented to show the proposed algorithm has the advantages of faster convergence rate, higher tracking accuracy, and better steady-state performance. (shrink)

The present paper is devoted to computational aspects of propositional inconsistency-adaptive logics. In particular, we prove (relativized versions of) some principal results on computational complexity of derivability in such logics, namely in cases of CLuN r and CLuN m , i.e., CLuN supplied with the reliability strategy and the minimal abnormality strategy, respectively.

The adaptive object model method is an effective way to develop dynamic and configurable adaptive software. It has the characteristics of metamodel, description drive, and runtime reflection. First, the core idea of the adaptive object model is explained; then, the five modes of establishing the metamodel in the adaptive object model architecture, the model engine, and supporting tools are analyzed; and the basketball tracking algorithm of the adaptive object model is discussed. Secondly, a two-dimensional joint information strategy is proposed (...) to improve the tracking effect. When the basketball is in a very complex environment, there will always be some color information in the background that is the same as the target, which affects the effect of basketball tracking. Therefore, this paper proposes a Camshift tracking method based on the significance of histograms, through real time. The basketball movement is compared with the background histogram to continuously adjust the basketball movement tracking model. These two methods can better establish the tracking model of the basketball adaptive object, reduce the interference of background information, and achieve the effect of stable tracking of the target. The simulation experiment results show that the method proposed in this paper can effectively improve the accuracy of the basketball goal model and achieve stable tracking of the goal. (shrink)

In this paper, we propose an adaptive Gaussian incremental expectation stadium parameter estimation algorithm for sports video analysis and prediction through the study and analysis of sports videos. The features with more discriminative power are selected from the set of positive and negative templates using a feature selection mechanism, and a sparse discriminative model is constructed by combining a confidence value metric strategy. The sparse generative model is constructed by combining L1 regularization and subspace representation, which retains sufficient representational (...) power while dealing with outliers. To overcome the shortcomings of the traditional multiplicative fusion mechanism, this paper proposes an adaptive selection mechanism based on Euclidean distance, which aims to detect deteriorating models in time during the dynamic tracking process and adopt corresponding strategies to construct more reasonable likelihood functions. Based on the Bayesian citation framework, the adaptive selection mechanism is used to combine the sparse discriminative model and the sparse generative model. Also, different online updating strategies are adopted for the template set and Principal Component Analysis subspace to alleviate the drift problem while ensuring that the algorithm can adapt to the changes of target appearance in the dynamic tracking environment. Through quantitative and qualitative evaluation of the experimental results, it is verified that the algorithm proposed in this paper has stronger robustness compared with other classical algorithms. Our proposed visual object tracking algorithm not only outperforms existing visual object tracking algorithms in terms of accuracy, success rate, accuracy, and robustness but also achieve the performance required for real-time tracking in terms of execution speed on the central processing unit. This paper provides an in-depth analysis and discussion of the adaptive Gaussian incremental expectation stadium parameter estimation algorithm for sports video analysis. Using a variety of county-level algorithms for analysis and multiple solutions to improve the accuracy of the results, we obtain a more efficient and accurate algorithm. (shrink)

Deformation of ground during tunnelling projects is one of the complex issues that is required to be monitored carefully to avoid the unexpected damages and human losses. Accurate prediction of ground settlement is a crucial concern for tunnelling problems, and the adequate predictive model can be a vital tool for tunnel designers to simulate the ground settlement accurately. This study proposes relatively new hybrid artificial intelligence models to predict the ground settlement of earth pressure balance shield tunnelling in the Bangkok (...) MRTA project. The predictive models were various nature-inspired frameworks, such as differential evolution, particle swarm optimization, genetic algorithm, and ant colony optimizer to tune the adaptive neuro-fuzzy inference system. To obtain the accurate and reliable results, the modeling procedure is established based on four different dataset scenarios including preprocessed and normalized, preprocessed and nonnormalized, non-preprocessed and normalized, and non-preprocessed and nonnormalized datasets. Results indicated that PPN dataset scenario significantly affected the prediction models in terms of their perdition accuracy. Among all the developed hybrid models, ANOFS-PSO model achieved the best predictability performance. In quantitative terms, PPN-ANFIS-PSO model attained the least root mean square error value of 7.98 and a correlation coefficient value of 0.83. Overall, the attained results confirmed the superiority of the explored hybrid AI models as robust predictive model for ground settlement of earth pressure balance shield tunnelling. (shrink)

Recommender system depends on the thoughts of numerous users to predict the favourites of potential consumers. RS is vulnerable to malicious information. Unsuitable products can be offered to the user by injecting a few unscrupulous “shilling” profiles like push and nuke attacks into the RS. Injection of these attacks results in the wrong recommendation for a product. The aim of this research is to develop a framework that can be widely utilized to make excellent recommendations for sales growth. This study (...) uses the methodology that presents an enhanced clustering algorithm named as modified density peak clustering algorithm on the consumer review dataset to ensure a well-formed cluster. An improved recurrent neural network algorithm is proposed to detect these attacks in hybrid RS, which uses the content-based RS and collaborative filtering RS. The results are compared with other state of the art algorithms. The proposed method is more suitable for E-commerce applications where the number of customers and products grows rapidly. (shrink)

This article starts with the environmental changes in human cognition, analyzes the virtual as the main feature of visual perception under digital technology, and explores the transition from passive to active human cognitive activities. With the diversified understanding of visual information, human contradiction of memory also began to become prominent. Aiming at the problem that the existing multimodal TV media recognition methods have low recognition rate of unknown application layer protocols, an adaptive clustering method for identifying unknown application layer protocols (...) is proposed. This method clusters application layer protocols based on similarity of the load characteristics of network stream application layer protocol data. The method divides the similarity calculation in the clustering algorithm to improve the clustering efficiency of the algorithm. Experimental results show that the proposed method can efficiently and accurately recognize unknown visual communication. This article proposes that, in the interactive multimodal visual information transmission, human visual perception experience has changed, the diversity of visual information content expression makes the aesthetic subject more personalized and stylized. (shrink)

Image restoration is a research hotspot in computer vision and computer graphics. It uses the effective information in the image to fill in the information of the designated damaged area. This has high application value in environmental design, film and television special effects production, old photo restoration, and removal of text or obstacles in images. In traditional sparse representation image restoration algorithms, the size of dictionary atoms is often fixed. When repairing the texture area, the dictionary atom will be too (...) large to cause blurring. When repairing a smooth area, the dictionary atom is too small to cause the extension of the area, which affects the image repair effect. In this paper, the structural sparsity of the block to be repaired is used to adjust the repair priority. By analyzing the structure information of the repair block located in different regions such as texture, edge, and smoothing, the size of the dictionary atom is adaptively determined. This paper proposes a color image restoration method that adaptively determines the size of dictionary atoms and discusses a model based on the partial differential equation restoration method. Through simulation experiments combined with subjective and objective standards, the repair results are evaluated and analyzed. The simulation results show that the algorithm can effectively overcome the shortcomings of blurred details and region extension in fixed dictionary restoration, and the restoration effect has been significantly improved. Compared with the results of several other classic algorithms, it shows the effectiveness of the algorithm in this paper. (shrink)

In this article, a new adaptive fuzzy wavelet neural network model is proposed for nonlinear function approximation problems. The AFWNN model is based on the traditional Takagi-Sugeno-Kang fuzzy system. Specifically, this model replaces the membership functions of fuzzy rules with wavelet basis functions, which are known to have time and frequency localization properties, i.e., they can approximate patterns both in the time and frequency domains. The structure of the AFWNN model is derived from that of the adaptive neuro-fuzzy inference system. (...) However, the AFWNN improves over the ANFIS by replacing Gaussian functions in the hidden layer with wavelet basis functions. The AFWNN model is trained using a gradient-based optimization algorithm. The AFWNN is then tested on three function approximation problems of time series prediction. For certain types of nonlinear time series, for instance fractal processes, the AFWNN is found to be substantially more accurate than alternative methods. (shrink)

Water quality prediction is the basis of water environmental planning, evaluation, and management. In this work, a novel intelligent prediction model based on the fuzzy wavelet neural network including the neural network, the fuzzy logic, the wavelet transform, and the genetic algorithm was proposed to simulate the nonlinearity of water quality parameters and water quality predictions. A self-adapted fuzzy c-means clustering was used to determine the number of fuzzy rules. A hybrid learning algorithm based on a genetic (...) class='Hi'>algorithm and gradient descent algorithm was employed to optimize the network parameters. Comparisons were made between the proposed FWNN model and the fuzzy neural network, the wavelet neural network, and the neural network. The results indicate that the FWNN made effective use of the self-adaptability of NN, the uncertainty capacity of FL, and the partial analysis ability of WT, so it could handle the fluctuation and the nonseasonal time series data of water quality, while exhibiting higher estimation accuracy and better robustness and achieving better performances for predicting water quality with high determination coefficients R2 over 0.90. The FWNN is feasible and reliable for simulating and predicting water quality in river. (shrink)

The paper examines some of the processes of the closely knit relationship between Google’s ideologies of neutrality and objectivity and global market dominance. Neutrality construction comprises an important element sustaining the company’s economic position and is reflected in constant updates, estimates and changes to utility and relevance of search results. Providing a purely technical solution to these issues proves to be increasingly difficult without a human hand in steering algorithmic solutions. Search relevance fluctuates and shifts through continuous tinkering and tweaking (...) of the search algorithm. The company also uses third parties to hire human raters for performing quality assessments of algorithmic updates and adaptations in linguistically and culturally diverse global markets. The adaptation process contradicts the technical foundations of the company and calculations based on the initial Page Rank algorithm. Annual market reports, Google’s Search Quality Rating Guidelines, and reports from media specialising in search engine optimisation business are analysed. The Search Quality Rating Guidelines document provides a rare glimpse into the internal architecture of search algorithms and the notions of utility and relevance which are presented and structured as neutral and objective. Intertwined layers of ideology, hidden labour of human raters, advertising revenues, market dominance and control are discussed throughout the paper. (shrink)

Neural network models have recently made significant achievements in solving vehicle scheduling problems. Adaptive ant colony algorithm provides a new idea for neural networks to solve complex system problems of multiconstrained network intensive vehicle routing models. The pheromone in the path is changed by adjusting the volatile factors in the operation process adaptively. It effectively overcomes the tendency of the traditional ant colony algorithm to fall easily into the local optimal solution and slow convergence speed to search for (...) the global optimal solution. The multiconstrained network intensive vehicle routing algorithm based on adaptive ant colony algorithm in this paper refers to the interaction between groups. Adaptive transfer and pheromone update strategies are introduced based on the traditional ant colony algorithm to optimize the selection, update, and coordination mechanisms of the algorithm further. Thus, the search task of the objective function for a feasible solution is completed by the search ants. Through the division and collaboration of different kinds of ants, pheromone adaptive strategy is combined with polymorphic ant colony algorithm. It can effectively overcome some disadvantages, such as premature stagnation, and has a theoretical significance to the study of large-scale multiconstrained vehicle routing problems in complex traffic network systems. (shrink)

Due to the currently insufficient consideration of task fitness and task coordination for task allocation in collaborative customized product development, this research was conducted based on the analysis of collaborative customized product development process and task allocation strategy. The definitions and calculation formulas of task fitness and task coordination efficiency were derived, and a multiobjective optimization model of product customization task allocation was constructed. A solution based on adaptive genetic algorithm was proposed, and the feasibility and effectiveness of the (...) task allocation algorithm were tested and verified using a 5-MW wind turbine product development project as example. (shrink)

This paper investigates the vehicle platoon control problems with both velocity constraints and input saturation. Firstly, radial basis function neural networks are employed to approximate the unknown driving resistance of a vehicle’s dynamic model. Then, a bidirectional topology, where vehicles can only communicate with their direct preceding and following neighbors, is used to depict the relationship among the vehicles in the platoon. On this basis, a neural adaptive sliding-mode control algorithm with an anti-windup compensation technique is proposed to maintain (...) the vehicle platoon with desired distance. Moreover, the string stability and the strong string stability of the whole vehicle platoon are proven through the stability theorem. Finally, numerical simulations verify the feasibility and effectiveness of the proposed control method. (shrink)

An adaptive fractional-order nonsingular terminal sliding mode controller for a microgyroscope is presented with uncertainties and external disturbances using a fuzzy neural network compensator based on a backstepping technique. First, the dynamic of the microgyroscope is transformed into an analogical cascade system to guarantee the application of a backstepping design. Then, a fractional-order nonsingular terminal sliding mode surface is designed which provides an additional degree of freedom, higher precision, and finite convergence without a singularity problem. The proposed control scheme requires (...) no prior knowledge of the unknown dynamics of the microgyroscope system since the fuzzy neural network is utilized to approximate the upper bound of the lumped uncertainties and adaptive algorithms are derived to allow online adjustment of the unknown system parameters. The chattering phenomenon can be reduced simultaneously by the fuzzy neural network compensator. The stability and finite time convergence of the system can be established by the Lyapunov stability theorem. Finally, simulation results verify the effectiveness of the proposed controller and the comparison of root mean square error between different fractional orders and integer order is given to signify the high precision tracking performance of the proposed control scheme. (shrink)

Recently, decomposition-based multiobjective evolutionary algorithms have good performances in the field of multiobjective optimization problems and have been paid attention by many scholars. Generally, a MOP is decomposed into a number of subproblems through a set of weight vectors with good uniformly and aggregate functions. The main role of weight vectors is to ensure the diversity and convergence of obtained solutions. However, these algorithms with uniformity of weight vectors cannot obtain a set of solutions with good diversity on some MOPs (...) with complex Pareto optimal fronts. To deal with this problem, an improved decomposition-based multiobjective evolutionary algorithm with adaptive weight adjustment is proposed. Firstly, a new method based on uniform design and crowding distance is used to generate a set of weight vectors with good uniformly. Secondly, according to the distances of obtained nondominated solutions, an adaptive weight vector adjustment strategy is proposed to redistribute the weight vectors of subobjective spaces. Thirdly, a selection strategy is used to help each subobjective space to obtain a nondominated solution. Comparing with six efficient state-of-the-art algorithms, for example, NSGAII, MOEA/D, MOEA/D-AWA, EMOSA, RVEA, and KnEA on some benchmark functions, the proposed algorithm is able to find a set of solutions with better diversity and convergence. (shrink)

While organizations today make extensive use of complex algorithms, the notion of algorithmic accountability remains an elusive ideal due to the opacity and fluidity of algorithms. In this article, we develop a framework for managing algorithmic accountability that highlights three interrelated dimensions: reputational concerns, engagement strategies, and discourse principles. The framework clarifies that accountability processes for algorithms are driven by reputational concerns about the epistemic setup, opacity, and outcomes of algorithms; that the way in which organizations practically engage with emergent (...) expectations about algorithms may be manipulative, adaptive, or moral; and that when accountability relationships are heavily burdened by the opacity and fluidity of complex algorithmic systems, the emphasis of engagement should shift to a rational communication process through which a continuous and tentative assessment of the development, workings, and consequences of algorithms can be achieved over time. The degree to which such engagement is, in fact, rational can be assessed based on four discourse-ethical principles of participation, comprehension, multivocality, and responsiveness. We conclude that the framework may help organizations and their environments to jointly work toward greater accountability for complex algorithms. It may further help organizations in reputational positioning surrounding accountability issues. The discourse-ethical principles introduced in this article are meant to elevate these positioning contests to extend beyond mere adaption or compliance and help guide organizations to find moral and forward-looking solutions to accountability issues. (shrink)

This paper proposes a novel adaptive fuzzy super-twisting sliding mode control scheme for microgyroscopes with unknown model uncertainties and external disturbances. Firstly, an adaptive algorithm is used to estimate the unknown parameters and angular velocity of microgyroscopes. Secondly, in order to improve the performance of the system and the superiority of the super-twisting algorithm, this paper utilizes the universal approximation characteristic of the fuzzy system to approach the gain of the super-twisting sliding mode controller and identify the gain (...) of the controller online, realizing the adaptive adjustment of the controller parameters. Simulation results verify the superiority and the effectiveness of the proposed approach, compared with adaptive super-twisting sliding mode control without fuzzy approximation; the proposed method is more effective. (shrink)

In this paper, I argue that accurate indexical representations have been crucial for the survival and reproduction of homo sapiens sapiens. Specifically, I want to suggest that reliable processes have been selected for because of their indirect, but close, connection to true belief during the Pleistocene hunter-gatherer period of our ancestral history. True beliefs are not heritable, reliable processes are heritable. Those reliable processes connected with reasoning take the form of Darwinian Algorithms: a plethora of specialized, domain-specific inference rules designed (...) to solve specific, recurrent, adaptive problems in social exchange contexts. Humans do not reason logically, but adaptively. (shrink)

This paper presents an in-depth analysis of tennis match scene classification using an adaptive Gaussian mixture model parameter estimation simulation algorithm. We divided the main components of semantic analysis into type of motion, distance of motion, speed of motion, and landing area of the tennis ball. Firstly, for the problem that both people and tennis balls in the video frames of tennis matches from the surveillance viewpoint are very small, we propose an adaptive Gaussian mixture model parameter estimation (...) class='Hi'>algorithm, which has good accuracy and speed on small targets. Secondly, in this paper, we design a sports player tracking algorithm based on role division and continuously lock the target player to be tracked and output the player region. At the same time, based on the displacement information of the key points of the player’s body and the system running time, the distance and speed of the player’s movement are obtained. Then, for the problem that tennis balls are small and difficult to capture in high-speed motion, this paper designs a prior knowledge-based algorithm for predicting tennis ball motion and landing area to derive the landing area of tennis balls. Finally, this paper implements a prototype system for semantic analysis of real-time video of tennis matches and tests and analyzes the performance indexes of the system, and the results show that the system has good performance in real-time, accuracy, and stability. (shrink)

Abnormal behavior detection of social security funds is a method to analyze large-scale data and find abnormal behavior. Although many methods based on spectral clustering have achieved many good results in the practical application of clustering, the research on the spectral clustering algorithm is still in the early stage of development. Many existing algorithms are very sensitive to clustering parameters, especially scale parameters, and need to manually input the number of clustering. Therefore, a density-sensitive similarity measure is introduced in (...) this paper, which is obtained by introducing new parameters to transform the Gaussian function. Under this metric, the distance between data points belonging to different classes will be effectively amplified, while the distance between data points belonging to the same class will be reduced, and finally, the distribution of data will be effectively clustered. At the same time, the idea of Eigen gap is introduced into the spectral clustering algorithm, and the verified gap sequence is constructed on the basis of Laplace matrix, so as to solve the problem of the number of initial clustering. The strong global search ability of artificial bee colony algorithm is used to make up for the shortcoming of spectral clustering algorithm that is easy to fall into local optimal. The experimental results show that the adaptive spectral clustering algorithm can better identify the initial clustering center, perform more effective clustering, and detect abnormal behavior more accurately. (shrink)

This study is to explore the optimization of the adaptive genetic algorithm in the backpropagation neural network, so as to expand the application of the BPNN model in nonlinear issues. Traffic flow prediction is undertaken as a research case to analyse the performance of the optimized BPNN. Firstly, the advantages and disadvantages of the BPNN and genetic algorithm are analyzed based on their working principles, and the AGA is improved and optimized. Secondly, the optimized AGA is applied to (...) optimize the standard BPNN, and the optimized algorithm is named as OAGA-BPNN. Finally, three different cases are proposed based on the actual scenario of traffic flow prediction to analyse the optimized algorithm on the matrix laboratory platform by simulation. The results show that the average error distribution of the GA-BPNN algorithm is about 1% with small fluctuation range, better calculation accuracy, and generalization performance in contrast to the BPNN. The average output error of the AGA-BPNN fluctuates around 0 and remains in a relatively stable range as a whole in contrast to that of GA-BPNN; the maximum fitness level keeps increasing during the evolution process but approaches the average value in later process, so the population diversity is hard to be guaranteed. The output error of the OAGA-BPNN fluctuates little compared with that of AGA-BPNN, and its maximum fitness continues to increase in the evolution process with guaranteed population diversity. In short, the OAGA-BPNN algorithm can achieve the best performance in terms of calculation accuracy, generalization performance, and population evolution. (shrink)

The present article reports several applied experiments in the generation of aesthetic forms from algorithms and data. In these experiments algorithms and data are the driving morphogenetic force to such an extent that the role of the human creator must be reexamined case-by-case. Artists that program the graphics or sound generating algorithms may in turn be said to be programmed perceptually by the resulting artworks, in the sense that they must adapt their perception in a conscious or involuntary effort to (...) detect or project meaning in their form. While forms generated by algorithms or data are to a large extent unpredictable, an intimate relationship between programmer, performer/listener/viewer and the piece is created through instinctive, empirical familiarity with the tools and the creative process, which is afforded by the immediate and highly interactive nature of the frameworks employed. A simple iterative algorithm that produces a novel kind of chaotic geometric shapes is presented. Examples of an application of Paul Klee’s principles of visual form in programming interactive audio-visual dance performance are given. These principles are directly derived from the language-based metaphor of active, medial and passive voice. Finally, ongoing experiments in letting language structures emerge from data derived from a sound database are presented. (shrink)

Episodic memory is memory for past events. It’s characteristically associated with an experience of ‘mentally replaying’ one’s experiences in the mind’s eye. This biological phenomenon has inspired the development of several ‘experience replay’ algorithms in AI. In this chapter, I ask whether experience replay algorithms might shed light on a puzzle about episodic memory’s function: what does episodic memory contribute to the cognitive systems in which it is found? I argue that experience replay algorithms can serve as idealized models of (...) episodic memory for the purposes of addressing this question. Taking the DQN algorithm as a case study, I suggest that these algorithms provide some support for mnemonic accounts, on which episodic memory’s function lies in the storage, encoding and retrieval of information. By extending and adapting experience replay algorithms, we might gain further insight into episodic memory’s operations and contributions to cognition. (shrink)

In the complex environment, the suddenly changing structural parameters and abrupt actuator failures are often encountered, and the negligence or unproper handling method may induce undesired or unacceptable results. In this paper, taking the suddenly changing structural parameters and abrupt actuator failures into consideration, we focus on the robust adaptive control design for a class of heterogeneous Takagi–Sugeno fuzzy nonlinear systems subjected to discontinuous multiple uncertainties. The key point is that the switch modes not only vary with the system time (...) but also vary with the system states, and the intrinsic heterogeneous characteristics make it difficult to design stable controllers. Firstly, the concepts of differential inclusion are introduced to describe the heterogeneous fuzzy systems. Meanwhile, a fundamental lemma is provided to demonstrate the criteria of the boundness for a Filippov solution. Then, by using the set-valued Lie derivative of the Lyapunov function and introducing a vector of specific continuous functions, the closed-loop T-S fuzzy differential inclusion systems are proved to be ultimately bounded. The sufficient conditions for system stability are derived in term of linear matrix inequalities, which can be solved directly. Finally, a numerical example is provided to illustrate the effectiveness of the proposed control algorithm. (shrink)

An increasing number of regulations propose the notion of ‘AI audits’ as an enforcement mechanism for achieving transparency and accountability for artificial intelligence (AI) systems. Despite some converging norms around various forms of AI auditing, auditing for the purpose of compliance and assurance currently have little to no agreed upon practices, procedures, taxonomies, and standards. We propose the ‘criterion audit’ as an operationalizable compliance and assurance external audit framework. We model elements of this approach after financial auditing practices, and argue (...) that AI audits should similarly provide assurance to their stakeholders about AI organizations’ ability to govern their algorithms in ways that mitigate harms and uphold human values. We discuss the necessary conditions for the criterion audit, and provide a procedural blueprint for performing an audit engagement in practice. We illustrate how this framework can be adapted to current regulations by deriving the criteria on which ‘bias audits’ for hiring algorithms can be performed, as required by the recently effective New York City Local Law 144 of 2021. We conclude by offering critical discussion on the benefits, inherent limitations, and implementation challenges of applying practices of the more mature financial auditing industry to AI auditing where robust guardrails against quality assurance issues are only starting to emerge. Our discussion as informed by experiences in performing these audits in practice highlights the critical role that an audit ecosystem plays in ensuring the effectiveness of such methodology. (shrink)

Pricing algorithms are computerized procedures a seller may use to adapt instantaneously its price to market conditions, including to prices quoted by its rivals. These algorithms are related to the extensive use of web-collectors which contribute in many industries to identifying the best price. In such settings, price competition operates between algorithms, no longer between executives of brick and mortar companies. In this context, the question is to know how implicit forms of collusion may arise between the sellers. This paper (...) is aimed at discussing this conceptual issue in a price-setting homogeneous product oligopoly with decreasing returns to scale where algorithms implement matching policies. Using fixed point argument, we find a family of equilibrium prices encompassing Cournot and Pareto efficient solutions, if matching is allowed upward and downward. Dynamical stability is studied in the linear demand constant return case. When matching operates only for price undercutting, this family is extended up to a bottom value of the market price, close to the Walrasian price. Pricing algorithms may solve the Bertrand–Edgeworth paradox. (shrink)

Multi-Task Learning tries to improve the learning process of different tasks by solving them simultaneously. A popular Multi-Task Learning formulation for SVM is to combine common and task-specific parts. Other approaches rely on using a Graph Laplacian regularizer. Here we propose a combination of these two approaches that can be applied to L1, L2 and LS-SVMs. We also propose an algorithm to iteratively learn the graph adjacency matrix used in the Laplacian regularization. We test our proposal with synthetic and (...) real problems, both in regression and classification settings. When the task structure is present, we show that our model is able to detect it, which leads to better results, and we also show it to be competitive even when this structure is not present. (shrink)

Objectives: Machine learning (ML) has the potential to facilitate “continual learning” in medicine, in which an ML system continues to evolve in response to exposure to new data over time, even after being deployed in a clinical setting. In this article, we provide a tutorial on the range of ethical issues raised by the use of such “adaptive” ML systems in medicine that have, thus far, been neglected in the literature. -/- Target audience: The target audiences for this tutorial are (...) the developers of ML AI systems, healthcare regulators, the broader medical informatics community, and practicing clinicians. -/- Scope: Discussions of adaptive ML systems to date have overlooked the distinction between 2 sorts of variance that such systems may exhibit—diachronic evolution (change over time) and synchronic variation (difference between cotemporaneous instantiations of the algorithm at different sites)—and underestimated the significance of the latter. We highlight the challenges that diachronic evolution and synchronic variation present for the quality of patient care, informed consent, and equity, and discuss the complex ethical trade-offs involved in the design of such systems. (shrink)

I investigate the relationship between adaptation, as defined in evolutionary theory through natural selection, and the concept of emergence. I argue that there is an essential correlation between the former, and “emergence” defined in the field of algorithmic simulations. I first show that the computational concept of emergence (in terms of incompressible simulation) can be correlated with a causal criterion of emergence (in terms of the specificity of the explanation of global patterns). On this ground, I argue that emergence (...) in general involves some sort of selective processes. Finally, I show that a second criterion, concerning novel explanatory regularities following the emergence of a pattern, captures the robustness of emergence displayed by some cases of emergence (according to the first criterion). Emergent processes fulfilling both criteria are therefore exemplified in evolutionary biology by some so-called “innovations”, and mostly by the new units of fitness or new kinds of adaptations (like sexual reproduction, multicellular organisms, cells, societies) sometimes called “major transitions in evolution”, that recent research programs (Maynard-Smith and Szathmary 1995 ; Michod 1999 ) aims at explaining. (shrink)

This commentary tests a methodology proposed by Munk et al. (2022) for using failed predictions in machine learning as a method to identify ambiguous and rich cases for qualitative analysis. Using a dataset describing actions performed by fictional characters interacting with machine vision technologies in 500 artworks, movies, novels and videogames, I trained a simple machine learning algorithm (using the kNN algorithm in R) to predict whether or not an action was active or passive using only information about (...) the fictional characters. Predictable actions were generally unemotional and unambiguous activities where machine vision technologies were treated as simple tools. Unpredictable actions, that is, actions that the algorithm could not correctly predict, were more ambivalent and emotionally loaded, with more complex power relationships between characters and technologies. The results thus support Munk et al.'s theory that failed predictions can be productively used to identify rich cases for qualitative analysis. This test goes beyond simply replicating Munk et al.'s results by demonstrating that the method can be applied to a broader humanities domain, and that it does not require complex neural networks but can also work with a simpler machine learning algorithm. Further research is needed to develop an understanding of what kinds of data the method is useful for and which kinds of machine learning are most generative. To support this, the R code required to produce the results is included so the test can be replicated. The code can also be reused or adapted to test the method on other datasets. (shrink)

This study aims to develop a hybrid model to represent the human mind from a functionalist point of view that can be adapted to artificial intelligence. The model is not a realistic theory of the neural network of the brain but an instrumentalist AI model, which means that there can be some other representative models too. It had been thought that the provability of an axiomatic system requires the completeness of a formal system. However, Gödel proved that no consistent formal (...) system can prove its own consistency. There is a paradoxical limit to provability. Both consistency and completeness are impossible together. These formal limits form the basis of our model: the hybrid model of the mind consists of a formal axiomatic system and an evolutionary algorithm (EA) of intelligence, which also includes the genetic algorithm (GA) of consciousness. The GA of consciousness operates based on intentions, functioning in conjunction with the principles of EA. This collaboration allows it to transcend the paradoxical formal limits of intelligence. However, GA overcomes the problem of paradoxicality at the cost of producing illusions. Following this collaboration gives us a GA operating system. After all, if the rational optimization task of the GA in question produces illusions, then the rationality must lie elsewhere in the paradox. (shrink)