Game Theoretic Approach for Applying Artificial Intelligence in the Credit Industry
The law of accelerating returns can be viewed as a concept that describes acceleration of technological progress. The idea is that tools are used for developing more advanced tools that are applied for creating even more advanced tools etc. A similar idea has been implemented in algorithms for advancing artificial intelligence. In this paper, the results of applying these algorithms in games are discussed. Nevertheless, real life tasks seem more complicated. The game theoretic approach can be applied for transition from theoretical and unrealistic games to more complex and practical tasks. Applications of the game theoretic approach to advance artificial intelligence in solving tasks in the credit industry are proposed.
L’ouvrage d’Adrian Mackenzie, professeur au Département de sociologie à l’Université de Lancaster, est d’un genre inédit au sein de la littérature émergente, mais encore peu étendue en sciences humaines et sociales, qui explore le fonctionnement du machine learning (ML). Les avancées spectaculaires de cette branche de l’intelligence artificielle (IA) depuis quelques années ont éclipsé les autres approches en la matière et ont soudainement transformé l’IA en un problème social et politique. Plusieurs auteurs ont déjà insisté sur la nécessité de focaliser le regard sur les outils de l’IA, en pointant les limites des travaux qui ne traitent que des effets sociaux des « algorithmes ». Comme le fait remarquer l’anthropologue des sciences et des techniques Nick Seaver, la plupart des travaux sur le sujet s’agitent au sujet des « algorithmes » ou le « big data », en insistant sur leurs effets néfastes, voire catastrophiques, pour la société sans jamais préciser exactement ce qu’ils sont. Le transfert des connaissances et des perspectives entre les spécialistes en IA et en SHS (d’ailleurs dans les deux sens) est pourtant indispensable pour en proposer une critique informée et efficace.
The paper analyses some legal issues of artificial intelligence. In the first part of the paper authors provide classification and overview of the interdisciplinary research in this field. The next part of the paper illustrates artificial intelligence legal issues and provides approaches to mitigate these challenges. In particular, authors examine artificial intelligence influence on the protection of personal data, intellectual property rights and civil liability. The authors conclude that the development of artificial intelligence requires a change in the legal framework.
The series “Lecture Notes in Networks and Systems” publishes the latest develop- ments in Networks and Systems—quickly, informally and with high quality. Original research reported in proceedings and post-proceedings represents the core of LNNS.
Volumes published in LNNS embrace all aspects and subfields of, as well as new challenges in, Networks and Systems.
The series contains proceedings and edited volumes in systems and networks, spanning the areas of Cyber-Physical Systems, Autonomous Systems, Sensor Networks, Control Systems, Energy Systems, Automotive Systems, Biological Systems, Vehicular Networking and Connected Vehicles, Aerospace Systems, Automation, Manufacturing, Smart Grids, Nonlinear Systems, Power Systems, Robotics, Social Systems, Economic Systems and other. Of particular value to both the contributors and the readership are the short publication timeframe and the world-wide distribution and exposure which enable both a wide and rapid dissemination of research output.
The series covers the theory, applications, and perspectives on the state of the art and future developments relevant to systems and networks, decision making, control, complex processes and related areas, as embedded in the fields of interdisciplinary and applied sciences, engineering, computer science, physics, economics, social, and life sciences, as well as the paradigms and methodologies behind them.
This article describes modern methods of data processing regarding the task of assessing activities of transportation employees. The main purpose was to find dependencies in data and construct an algorithm for predicting the probability of transport safety violation by employee. The research was conducted for locomotive drivers. The following algorithms were used: neural networks, gradient boosting over decision trees and random forest. Based on the obtained results and drawn conclusions one can think of the perspective for the elaboration and introduction this work for practical use in railway industry, e.g. in “Russian Railways”.
In November 2014, Team DESCARTES led by Newton Lee and sponsored by the Institute for Education, Research, and Scholarships (IFERS) was among one of the 104 teams registered with the Defense Advanced Research Projects Agency (DARPA) for the first-ever Cyber Grand Challenge (CGC). Only 28 teams, including Team DESCARTES, made it through two DARPA-sponsored dry runs and into the CGC Qualifying Event in June 2015. We proposed a system—Distributed Expert Systems for Cyber Analysis, Reasoning, Testing, Evaluation, and Security (DESCARTES)—that would be a fully autonomous cyber defense system that is capable of autonomous analysis, autonomous patching, autonomous vulnerability scanning, autonomous service resiliency, and autonomous network defense.
Logical frameworks allow the specification of deductive systems using the same logical machinery. Linear logical frameworks have been successfully used for the specification of a number of computational, logics and proof systems. Its success relies on the fact that formulas can be distinguished as linear, which behave intuitively as resources, and unbounded, which behave intuitionistically. Commutative subexponentials enhance the expressiveness of linear logic frameworks by allowing the distinction of multiple contexts. These contexts may behave as multisets of formulas or sets of formulas. Motivated by applications in distributed systems and in type-logical grammar, we propose a linear logical framework containing both commutative and non-commutative subexponentials. Non-commutative subexponentials can be used to specify contexts which behave as lists, not multisets, of formulas. In addition, motivated by our applications in type-logical grammar, where the weakenening rule is disallowed, we investigate the proof theory of formulas that can only contract, but not weaken. In fact, our contraction is non-local. We demonstrate that under some conditions such formulas may be treated as unbounded formulas, which behave intuitionistically.