LIVIVO - The Search Portal for Life Sciences

zur deutschen Oberfläche wechseln
Advanced search

Search results

Result 1 - 7 of total 7

Search options

  1. Article ; Online: What Is Missing from Contemporary AI? The World

    Michael Wooldridge

    Intelligent Computing, Vol

    2022  Volume 2022

    Abstract: In the past three years, we have witnessed the emergence of a new class of artificial intelligence systems–—so-called foundation models, which are characterised by very large machine learning models (with tens or hundreds of billions of parameters) ... ...

    Abstract In the past three years, we have witnessed the emergence of a new class of artificial intelligence systems–—so-called foundation models, which are characterised by very large machine learning models (with tens or hundreds of billions of parameters) trained using extremely large and broad data sets. Foundation models, it is argued, have competence in a broad range of tasks, which can be specialised for specific applications. Large language models, of which GPT-3 is perhaps the best known, are the most prominent example of current foundation models. While foundation models have demonstrated impressive capabilities in certain tasks—natural language generation being the most obvious example—I argue that because they are inherently disembodied, and they are limited with respect to what they have learned and what they can do. Foundation models are likely to be very useful in many applications: but they are not the end of the road in artificial intelligence.
    Keywords Electronic computers. Computer science ; QA75.5-76.95
    Language English
    Publishing date 2022-01-01T00:00:00Z
    Publisher American Association for the Advancement of Science (AAAS)
    Document type Article ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  2. Article ; Online: Partial Order Games

    Valeria Zahoransky / Julian Gutierrez / Paul Harrenstein / Michael Wooldridge

    Games, Vol 13, Iss 2, p

    2022  Volume 2

    Abstract: We introduce a non-cooperative game model in which players’ decision nodes are partially ordered by a dependence relation, which directly captures informational dependencies in the game. In saying that a decision node v is dependent on decision nodes < ... ...

    Abstract We introduce a non-cooperative game model in which players’ decision nodes are partially ordered by a dependence relation, which directly captures informational dependencies in the game. In saying that a decision node v is dependent on decision nodes <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>v</mi><mn>1</mn></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mi>v</mi><mi>k</mi></msub></mrow></semantics></math> , we mean that the information available to a strategy making a choice at v is precisely the choices that were made at <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><msub><mi>v</mi><mn>1</mn></msub><mo>,</mo><mo>…</mo><mo>,</mo><msub><mi>v</mi><mi>k</mi></msub></mrow></semantics></math> . Although partial order games are no more expressive than extensive form games of imperfect information (we show that any partial order game can be reduced to a strategically equivalent extensive form game of imperfect information, though possibly at the cost of an exponential blowup in the size of the game), they provide a more natural and compact representation for many strategic settings of interest. After introducing the game model, we investigate the relationship to extensive form games of imperfect information, the problem of computing Nash equilibria, and conditions that enable backwards induction in this new model.
    Keywords game theory ; non-cooperative games ; Nash equilibrium ; backwards induction ; computational complexity ; Technology ; T ; Social Sciences ; H
    Subject code 511
    Language English
    Publishing date 2022-12-01T00:00:00Z
    Publisher MDPI AG
    Document type Article ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  3. Article ; Online: Mean-Payoff Games with ω -Regular Specifications

    Julian Gutierrez / Thomas Steeples / Michael Wooldridge

    Games, Vol 13, Iss 19, p

    2022  Volume 19

    Abstract: Multi-player mean-payoff games are a natural formalism for modelling the behaviour of concurrent and multi-agent systems with self-interested players. Players in such a game traverse a graph, while attempting to maximise a (mean-)payoff function that ... ...

    Abstract Multi-player mean-payoff games are a natural formalism for modelling the behaviour of concurrent and multi-agent systems with self-interested players. Players in such a game traverse a graph, while attempting to maximise a (mean-)payoff function that depends on the play generated. As with all games, the equilibria that could arise may have undesirable properties. However, as system designers, we typically wish to ensure that equilibria in such systems correspond to desirable system behaviours, for example, satisfying certain safety or liveness properties. One natural way to do this would be to specify such desirable properties using temporal logic. Unfortunately, the use of temporal logic specifications causes game theoretic verification problems to have very high computational complexity. To address this issue, we consider <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>ω</mi></semantics></math> -regular specifications. These offer a concise and intuitive way of specifying system behaviours with a comparatively low computational overhead. The main results of this work are characterisation and complexity bounds for the problem of determining if there are equilibria that satisfy a given <math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mi>ω</mi></semantics></math> -regular specification in a multi-player mean-payoff game in a number of computationally relevant game-theoretic settings.
    Keywords multi-player games ; mean-payoff games ; automated verification ; temporal logic ; game theory ; equilibria ; Technology ; T ; Social Sciences ; H
    Subject code 511
    Language English
    Publishing date 2022-02-01T00:00:00Z
    Publisher MDPI AG
    Document type Article ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  4. Article ; Online: Interview with the Hon. Dr Michael Wooldridge

    Michael Wooldridge / Paul Grogan

    Public Health Research & Practice, Vol 30, Iss

    tobacco control was the best buy in health then and it’s still the best buy now

    2020  Volume 3

    Abstract: ... sponsorship of international sporting events. The Honourable Dr Michael Wooldridge, Minister for Health ...

    Abstract The late 1990s marked a turning point for tobacco control in Australia. In March 1996, the Liberal-National Coalition won government after 13 years of Labor rule. Prime Minister John Howard had campaigned on cutting expenditure, and had long been a proponent of small government and the private sector. Yet within 2 years of taking office, the Howard Government funded Australia’s first big budget National Tobacco Campaign and commenced a review of the Tobacco Advertising Prohibition Act 1992 to phase out industry sponsorship of international sporting events. The Honourable Dr Michael Wooldridge, Minister for Health from 1996 to his retirement from politics in 2001, reflects on how these reforms to tobacco control were achieved and how the public health community can best engage with policy makers to advocate for reform. He stresses the importance of public health not being defined by ideology, and that politicians must be scientifically well informed and supported in doing what is in the nation’s best interest for public health. He assesses the current state of play and argues more investment in tobacco control is needed today, suggesting it remains the “best buy” in health.
    Keywords tobacco control ; australia ; politics ; Public aspects of medicine ; RA1-1270
    Subject code 340
    Language English
    Publishing date 2020-09-01T00:00:00Z
    Publisher Sax Institute
    Document type Article ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  5. Article ; Online: Nash Equilibrium and Bisimulation Invariance

    Julian Gutierrez / Paul Harrenstein / Giuseppe Perelli / Michael Wooldridge

    Logical Methods in Computer Science, Vol Volume 15, Issue

    2019  Volume 3

    Abstract: Game theory provides a well-established framework for the analysis of concurrent and multi-agent systems. The basic idea is that concurrent processes (agents) can be understood as corresponding to players in a game; plays represent the possible ... ...

    Abstract Game theory provides a well-established framework for the analysis of concurrent and multi-agent systems. The basic idea is that concurrent processes (agents) can be understood as corresponding to players in a game; plays represent the possible computation runs of the system; and strategies define the behaviour of agents. Typically, strategies are modelled as functions from sequences of system states to player actions. Analysing a system in such a setting involves computing the set of (Nash) equilibria in the concurrent game. However, we show that, with respect to the above model of strategies (arguably, the "standard" model in the computer science literature), bisimilarity does not preserve the existence of Nash equilibria. Thus, two concurrent games which are behaviourally equivalent from a semantic perspective, and which from a logical perspective satisfy the same temporal logic formulae, may nevertheless have fundamentally different properties (solutions) from a game theoretic perspective. Our aim in this paper is to explore the issues raised by this discovery. After illustrating the issue by way of a motivating example, we present three models of strategies with respect to which the existence of Nash equilibria is preserved under bisimilarity. We use some of these models of strategies to provide new semantic foundations for logics for strategic reasoning, and investigate restricted scenarios where bisimilarity can be shown to preserve the existence of Nash equilibria with respect to the conventional model of strategies in the computer science literature.
    Keywords computer science - logic in computer science ; Logic ; BC1-199 ; Electronic computers. Computer science ; QA75.5-76.95
    Subject code 303
    Language English
    Publishing date 2019-09-01T00:00:00Z
    Publisher Logical Methods in Computer Science e.V.
    Document type Article ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  6. Article ; Online: Ten years after ImageNet

    Sanjay Chawla / Preslav Nakov / Ahmed Ali / Wendy Hall / Issa Khalil / Xiaosong Ma / Husrev Taha Sencar / Ingmar Weber / Michael Wooldridge / Ting Yu

    Royal Society Open Science, Vol 10, Iss

    a 360° perspective on artificial intelligence

    2023  Volume 3

    Abstract: It is 10 years since neural networks made their spectacular comeback. Prompted by this anniversary, we take a holistic perspective on artificial intelligence (AI). Supervised learning for cognitive tasks is effectively solved—provided we have enough high- ...

    Abstract It is 10 years since neural networks made their spectacular comeback. Prompted by this anniversary, we take a holistic perspective on artificial intelligence (AI). Supervised learning for cognitive tasks is effectively solved—provided we have enough high-quality labelled data. However, deep neural network models are not easily interpretable, and thus the debate between blackbox and whitebox modelling has come to the fore. The rise of attention networks, self-supervised learning, generative modelling and graph neural networks has widened the application space of AI. Deep learning has also propelled the return of reinforcement learning as a core building block of autonomous decision-making systems. The possible harms made possible by new AI technologies have raised socio-technical issues such as transparency, fairness and accountability. The dominance of AI by Big Tech who control talent, computing resources, and most importantly, data may lead to an extreme AI divide. Despite the recent dramatic and unexpected success in AI-driven conversational agents, progress in much-heralded flagship projects like self-driving vehicles remains elusive. Care must be taken to moderate the rhetoric surrounding the field and align engineering progress with scientific principles.
    Keywords ImageNet ; supervised learning ; artificial intelligence winter ; Big Tech ; transformers ; Science ; Q
    Subject code 006
    Language English
    Publishing date 2023-03-01T00:00:00Z
    Publisher The Royal Society
    Document type Article ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

  7. Article ; Online: Anytime Coalition Structure Generation in Multi-Agent Systems With Positive or Negative Externalities

    Talal Rahwan / Tomasz Michalak / Michael Wooldridge / Nicholas R. Jennings

    Zeszyty Naukowe Warszawskiej Wyższej Szkoły Informatyki, Vol 5, Iss 6, Pp 20-

    2011  Volume 59

    Abstract: Much of the literature on multi-agent coalition formation has focused on Characteristic Function Games, where the effectiveness of a coalition is not affected by how the other agents are arranged in the system. In contrast, very little attention has been ...

    Abstract Much of the literature on multi-agent coalition formation has focused on Characteristic Function Games, where the effectiveness of a coalition is not affected by how the other agents are arranged in the system. In contrast, very little attention has been given to the more general class of Partition Function Games, where the emphasis is on how the formation of one coalition could influence the performance of other co-existing coalitions in the system. However, these inter-coalitional dependencies, called externalities from coalition formation, play a crucial role in many real-world multi-agent applications where agents have either conflicting or overlapping goals. Against this background, this paper is the first computational study of coalitional games with externalities in the multi-agent system context. We focus on the Coalition Structure Generation (CSG) problem which involves finding an exhaustive and disjoint division of the agents into coalitions such that the performance of the entire system is optimised. While this problem is already very challenging in the absence of externalities, due to the exponential size of the search space, taking externalities into consideration makes it even more challenging as the size of the input, given n agents, grows from O(2n) to O(nn). Our main contribution is the development of the first CSG algorithm for coalitional games with either positive or negative externalities. Specifically, we prove that it is possible to compute upper and lower bounds on the values of any set of disjoint coalitions. Building upon this, we prove that in order to establish a worst-case guarantee on solution quality it is necessary to search a certain set of coalition structures (which we define). We also show how to progressively improve this guarantee with further search. Since there are no previous CSG algorithms for games with externalities, we benchmark our algorithm against other state-of-the-art approaches in games where no externalities are present. Surprisingly, we find that, as far as worst-case guarantees are concerned, our algorithm outperforms the others by orders of magnitude. For instance, to reach a bound of 3 given 24 agents, the number of coalition structures that need to be searched by our algorithm is only 0.0007% of that needed by Sandholm et al. (1999), and 0.5% of that needed by Dang and Jennings (2004). This is despite the fact that the other algorithms take advantage of the special properties of games with no externalities, while ours does not.
    Keywords Electronic computers. Computer science ; QA75.5-76.95
    Subject code 006
    Language English
    Publishing date 2011-12-01T00:00:00Z
    Publisher Warsaw School of Computer Science
    Document type Article ; Online
    Database BASE - Bielefeld Academic Search Engine (life sciences selection)

    Full text online

    More links

    Kategorien

    Inter-library loan at ZB MED

    Your chosen title can be delivered directly to ZB MED Cologne location if you are registered as a user at ZB MED Cologne.

To top