Project acronym 2DNanoSpec
Project Nanoscale Vibrational Spectroscopy of Sensitive 2D Molecular Materials
Researcher (PI) Renato ZENOBI
Host Institution (HI) EIDGENOESSISCHE TECHNISCHE HOCHSCHULE ZUERICH
Call Details Advanced Grant (AdG), PE4, ERC-2016-ADG
Summary I propose to investigate the nanometer scale organization of delicate 2-dimensional molecular materials using nanoscale vibrational spectroscopy. 2D structures are of great scientific and technological importance, for example as novel materials (graphene, MoS2, WS2, etc.), and in the form of biological membranes and synthetic 2D-polymers. Powerful methods for their analysis and imaging with molecular selectivity and sufficient spatial resolution, however, are lacking. Tip-enhanced Raman spectroscopy (TERS) allows label-free spectroscopic identification of molecular species, with ≈10 nm spatial resolution, and with single molecule sensitivity for strong Raman scatterers. So far, however, TERS is not being carried out in liquids, which is the natural environment for membranes, and its application to poor Raman scatterers such as components of 2D polymers, lipids, or other membrane compounds (proteins, sugars) is difficult. TERS has the potential to overcome the restrictions of other optical/spectroscopic methods to study 2D materials, namely (i) insufficient spatial resolution of diffraction-limited optical methods; (ii) the need for labelling for all methods relying on fluorescence; and (iii) the inability of some methods to work in liquids. I propose to address a number of scientific questions associated with the spatial organization, and the occurrence of defects in sensitive 2D molecular materials. The success of these studies will also rely critically on technical innovations of TERS that notably address the problem of energy dissipation. This will for the first time allow its application to study of complex, delicate 2D molecular systems without photochemical damage.
Summary
I propose to investigate the nanometer scale organization of delicate 2-dimensional molecular materials using nanoscale vibrational spectroscopy. 2D structures are of great scientific and technological importance, for example as novel materials (graphene, MoS2, WS2, etc.), and in the form of biological membranes and synthetic 2D-polymers. Powerful methods for their analysis and imaging with molecular selectivity and sufficient spatial resolution, however, are lacking. Tip-enhanced Raman spectroscopy (TERS) allows label-free spectroscopic identification of molecular species, with ≈10 nm spatial resolution, and with single molecule sensitivity for strong Raman scatterers. So far, however, TERS is not being carried out in liquids, which is the natural environment for membranes, and its application to poor Raman scatterers such as components of 2D polymers, lipids, or other membrane compounds (proteins, sugars) is difficult. TERS has the potential to overcome the restrictions of other optical/spectroscopic methods to study 2D materials, namely (i) insufficient spatial resolution of diffraction-limited optical methods; (ii) the need for labelling for all methods relying on fluorescence; and (iii) the inability of some methods to work in liquids. I propose to address a number of scientific questions associated with the spatial organization, and the occurrence of defects in sensitive 2D molecular materials. The success of these studies will also rely critically on technical innovations of TERS that notably address the problem of energy dissipation. This will for the first time allow its application to study of complex, delicate 2D molecular systems without photochemical damage.
Max ERC Funding
2 311 696 €
Duration
Start date: 2017-09-01, End date: 2022-08-31
Project acronym 3DIMAGE
Project 3D Imaging Across Lengthscales: From Atoms to Grains
Researcher (PI) Paul Anthony Midgley
Host Institution (HI) THE CHANCELLOR MASTERS AND SCHOLARS OF THE UNIVERSITY OF CAMBRIDGE
Call Details Advanced Grant (AdG), PE4, ERC-2011-ADG_20110209
Summary "Understanding structure-property relationships across lengthscales is key to the design of functional and structural materials and devices. Moreover, the complexity of modern devices extends to three dimensions and as such 3D characterization is required across those lengthscales to provide a complete understanding and enable improvement in the material’s physical and chemical behaviour. 3D imaging and analysis from the atomic scale through to granular microstructure is proposed through the development of electron tomography using (S)TEM, and ‘dual beam’ SEM-FIB, techniques offering complementary approaches to 3D imaging across lengthscales stretching over 5 orders of magnitude.
We propose to extend tomography to include novel methods to determine atom positions in 3D with approaches incorporating new reconstruction algorithms, image processing and complementary nano-diffraction techniques. At the nanoscale, true 3D nano-metrology of morphology and composition is a key objective of the project, minimizing reconstruction and visualization artefacts. Mapping strain and optical properties in 3D are ambitious and exciting challenges that will yield new information at the nanoscale. Using the SEM-FIB, 3D ‘mesoscale’ structures will be revealed: morphology, crystallography and composition can be mapped simultaneously, with ~5nm resolution and over volumes too large to tackle by (S)TEM and too small for most x-ray techniques. In parallel, we will apply 3D imaging to a wide variety of key materials including heterogeneous catalysts, aerospace alloys, biomaterials, photovoltaic materials, and novel semiconductors.
We will collaborate with many departments in Cambridge and institutes worldwide. The personnel on the proposal will cover all aspects of the tomography proposed using high-end TEMs, including an aberration-corrected Titan, and a Helios dual beam. Importantly, a postdoc is dedicated to developing new algorithms for reconstruction, image and spectral processing."
Summary
"Understanding structure-property relationships across lengthscales is key to the design of functional and structural materials and devices. Moreover, the complexity of modern devices extends to three dimensions and as such 3D characterization is required across those lengthscales to provide a complete understanding and enable improvement in the material’s physical and chemical behaviour. 3D imaging and analysis from the atomic scale through to granular microstructure is proposed through the development of electron tomography using (S)TEM, and ‘dual beam’ SEM-FIB, techniques offering complementary approaches to 3D imaging across lengthscales stretching over 5 orders of magnitude.
We propose to extend tomography to include novel methods to determine atom positions in 3D with approaches incorporating new reconstruction algorithms, image processing and complementary nano-diffraction techniques. At the nanoscale, true 3D nano-metrology of morphology and composition is a key objective of the project, minimizing reconstruction and visualization artefacts. Mapping strain and optical properties in 3D are ambitious and exciting challenges that will yield new information at the nanoscale. Using the SEM-FIB, 3D ‘mesoscale’ structures will be revealed: morphology, crystallography and composition can be mapped simultaneously, with ~5nm resolution and over volumes too large to tackle by (S)TEM and too small for most x-ray techniques. In parallel, we will apply 3D imaging to a wide variety of key materials including heterogeneous catalysts, aerospace alloys, biomaterials, photovoltaic materials, and novel semiconductors.
We will collaborate with many departments in Cambridge and institutes worldwide. The personnel on the proposal will cover all aspects of the tomography proposed using high-end TEMs, including an aberration-corrected Titan, and a Helios dual beam. Importantly, a postdoc is dedicated to developing new algorithms for reconstruction, image and spectral processing."
Max ERC Funding
2 337 330 €
Duration
Start date: 2012-01-01, End date: 2017-12-31
Project acronym A-HERO
Project Anthelmintic Research and Optimization
Researcher (PI) Jennifer Irene Keiser
Host Institution (HI) SCHWEIZERISCHES TROPEN- UND PUBLIC HEALTH-INSTITUT
Call Details Consolidator Grant (CoG), LS7, ERC-2013-CoG
Summary "I propose an ambitious, yet feasible 5-year research project that will fill an important gap in global health. Specifically, I will develop and validate novel approaches for anthelmintic drug discovery and development. My proposal pursues the following five research questions: (i) Is a chip calorimeter suitable for high-throughput screening in anthelmintic drug discovery? (ii) Is combination chemotherapy safe and more efficacious than monotherapy against strongyloidiasis and trichuriasis? (iii) What are the key pharmacokinetic parameters of praziquantel in preschool-aged children and school-aged children infected with Schistosoma mansoni and S. haematobium using a novel and validated technology based on dried blood spotting? (iv) What are the metabolic consequences and clearance of praziquantel treatment in S. mansoni-infected mice and S. mansoni- and S. haematobium-infected children? (v) Which is the ideal compartment to study pharmacokinetic parameters for intestinal nematode infections and does age, nutrition, co-infection and infection intensity influence the efficacy of anthelmintic drugs?
My proposed research is of considerable public health relevance since it will ultimately result in improved treatments for soil-transmitted helminthiasis and pediatric schistosomiasis. Additionally, at the end of this project, I have generated comprehensive information on drug disposition of anthelmintics. A comprehensive database of metabolite profiles following praziquantel treatment will be available. Finally, the proof-of-concept of chip calorimetry in anthelmintic drug discovery has been established and broadly validated."
Summary
"I propose an ambitious, yet feasible 5-year research project that will fill an important gap in global health. Specifically, I will develop and validate novel approaches for anthelmintic drug discovery and development. My proposal pursues the following five research questions: (i) Is a chip calorimeter suitable for high-throughput screening in anthelmintic drug discovery? (ii) Is combination chemotherapy safe and more efficacious than monotherapy against strongyloidiasis and trichuriasis? (iii) What are the key pharmacokinetic parameters of praziquantel in preschool-aged children and school-aged children infected with Schistosoma mansoni and S. haematobium using a novel and validated technology based on dried blood spotting? (iv) What are the metabolic consequences and clearance of praziquantel treatment in S. mansoni-infected mice and S. mansoni- and S. haematobium-infected children? (v) Which is the ideal compartment to study pharmacokinetic parameters for intestinal nematode infections and does age, nutrition, co-infection and infection intensity influence the efficacy of anthelmintic drugs?
My proposed research is of considerable public health relevance since it will ultimately result in improved treatments for soil-transmitted helminthiasis and pediatric schistosomiasis. Additionally, at the end of this project, I have generated comprehensive information on drug disposition of anthelmintics. A comprehensive database of metabolite profiles following praziquantel treatment will be available. Finally, the proof-of-concept of chip calorimetry in anthelmintic drug discovery has been established and broadly validated."
Max ERC Funding
1 927 350 €
Duration
Start date: 2014-05-01, End date: 2019-04-30
Project acronym ACCORD
Project Algorithms for Complex Collective Decisions on Structured Domains
Researcher (PI) Edith Elkind
Host Institution (HI) THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD
Call Details Starting Grant (StG), PE6, ERC-2014-STG
Summary Algorithms for Complex Collective Decisions on Structured Domains.
The aim of this proposal is to substantially advance the field of Computational Social Choice, by developing new tools and methodologies that can be used for making complex group decisions in rich and structured environments. We consider settings where each member of a decision-making body has preferences over a finite set of alternatives, and the goal is to synthesise a collective preference over these alternatives, which may take the form of a partial order over the set of alternatives with a predefined structure: examples include selecting a fixed-size set of alternatives, a ranking of the alternatives, a winner and up to two runner-ups, etc. We will formulate desiderata that apply to such preference aggregation procedures, design specific procedures that satisfy as many of these desiderata as possible, and develop efficient algorithms for computing them. As the latter step may be infeasible on general preference domains, we will focus on identifying the least restrictive domains that enable efficient computation, and use real-life preference data to verify whether the associated restrictions are likely to be satisfied in realistic preference aggregation scenarios. Also, we will determine whether our preference aggregation procedures are computationally resistant to malicious behavior. To lower the cognitive burden on the decision-makers, we will extend our procedures to accept partial rankings as inputs. Finally, to further contribute towards bridging the gap between theory and practice of collective decision making, we will provide open-source software implementations of our procedures, and reach out to the potential users to obtain feedback on their practical applicability.
Summary
Algorithms for Complex Collective Decisions on Structured Domains.
The aim of this proposal is to substantially advance the field of Computational Social Choice, by developing new tools and methodologies that can be used for making complex group decisions in rich and structured environments. We consider settings where each member of a decision-making body has preferences over a finite set of alternatives, and the goal is to synthesise a collective preference over these alternatives, which may take the form of a partial order over the set of alternatives with a predefined structure: examples include selecting a fixed-size set of alternatives, a ranking of the alternatives, a winner and up to two runner-ups, etc. We will formulate desiderata that apply to such preference aggregation procedures, design specific procedures that satisfy as many of these desiderata as possible, and develop efficient algorithms for computing them. As the latter step may be infeasible on general preference domains, we will focus on identifying the least restrictive domains that enable efficient computation, and use real-life preference data to verify whether the associated restrictions are likely to be satisfied in realistic preference aggregation scenarios. Also, we will determine whether our preference aggregation procedures are computationally resistant to malicious behavior. To lower the cognitive burden on the decision-makers, we will extend our procedures to accept partial rankings as inputs. Finally, to further contribute towards bridging the gap between theory and practice of collective decision making, we will provide open-source software implementations of our procedures, and reach out to the potential users to obtain feedback on their practical applicability.
Max ERC Funding
1 395 933 €
Duration
Start date: 2015-07-01, End date: 2020-06-30
Project acronym AFTERTHEGOLDRUSH
Project Addressing global sustainability challenges by changing perceptions in catalyst design
Researcher (PI) Graham John Hutchings
Host Institution (HI) CARDIFF UNIVERSITY
Call Details Advanced Grant (AdG), PE4, ERC-2011-ADG_20110209
Summary One of the greatest challenges facing society is the sustainability of resources. At present, a step change in the sustainable use of resources is needed and catalysis lies at the heart of the solution by providing new routes to carbon dioxide mitigation, energy security and water conservation. It is clear that new high efficiency game-changing catalysts are required to meet the challenge. This proposal will focus on excellence in catalyst design by learning from recent step change advances in gold catalysis by challenging perceptions. Intense interest in gold catalysts over the past two decades has accelerated our understanding of gold particle-size effects, gold-support and gold-metal interactions, the interchange between atomic and ionic gold species, and the role of the gold-support interface in creating and maintaining catalytic activity. The field has also driven the development of cutting-edge techniques, particularly in microscopy and transient kinetics, providing detailed structural characterisation on the nano-scale and probing the short-range and often short-lived interactions. By comparison, our understanding of other metal catalysts has remained relatively static.
The proposed programme will engender a step change in the design of supported-metal catalysts, by exploiting the learning and the techniques emerging from gold catalysis. The research will be set out in two themes. In Theme 1 two established key grand challenges will be attacked; namely, energy vectors and greenhouse gas control. Theme 2 will address two new and emerging grand challenges in catalysis namely the effective low temperature activation of primary carbon hydrogen bonds and CO2 utilisation where instead of treating CO2 as a thermodynamic endpoint, the aim will be to re-use it as a feedstock for bulk chemical and fuel production. The legacy of the research will be the development of a new catalyst design approach that will provide a tool box for future catalyst development.
Summary
One of the greatest challenges facing society is the sustainability of resources. At present, a step change in the sustainable use of resources is needed and catalysis lies at the heart of the solution by providing new routes to carbon dioxide mitigation, energy security and water conservation. It is clear that new high efficiency game-changing catalysts are required to meet the challenge. This proposal will focus on excellence in catalyst design by learning from recent step change advances in gold catalysis by challenging perceptions. Intense interest in gold catalysts over the past two decades has accelerated our understanding of gold particle-size effects, gold-support and gold-metal interactions, the interchange between atomic and ionic gold species, and the role of the gold-support interface in creating and maintaining catalytic activity. The field has also driven the development of cutting-edge techniques, particularly in microscopy and transient kinetics, providing detailed structural characterisation on the nano-scale and probing the short-range and often short-lived interactions. By comparison, our understanding of other metal catalysts has remained relatively static.
The proposed programme will engender a step change in the design of supported-metal catalysts, by exploiting the learning and the techniques emerging from gold catalysis. The research will be set out in two themes. In Theme 1 two established key grand challenges will be attacked; namely, energy vectors and greenhouse gas control. Theme 2 will address two new and emerging grand challenges in catalysis namely the effective low temperature activation of primary carbon hydrogen bonds and CO2 utilisation where instead of treating CO2 as a thermodynamic endpoint, the aim will be to re-use it as a feedstock for bulk chemical and fuel production. The legacy of the research will be the development of a new catalyst design approach that will provide a tool box for future catalyst development.
Max ERC Funding
2 279 785 €
Duration
Start date: 2012-04-01, End date: 2017-03-31
Project acronym ALCOHOLLIFECOURSE
Project Alcohol Consumption across the Life-course: Determinants and Consequences
Researcher (PI) Anne Rebecca Britton
Host Institution (HI) UNIVERSITY COLLEGE LONDON
Call Details Starting Grant (StG), LS7, ERC-2012-StG_20111109
Summary The epidemiology of alcohol use and related health consequences plays a vital role by monitoring populations’ alcohol consumption patterns and problems associated with drinking. Such studies seek to explain mechanisms linking consumption to harm and ultimately to reduce the health burden. Research needs to consider changes in drinking behaviour over the life-course. The current evidence base lacks the consideration of the complexity of lifetime consumption patterns, the predictors of change and subsequent health risks.
Aims of the study
1. To describe age-related trajectories of drinking in different settings and to determine the extent to which individual and social contextual factors, including socioeconomic position, social networks and life events influence drinking pattern trajectories.
2. To estimate the impact of drinking trajectories on physical functioning and disease and to disentangle the exposure-outcome associations in terms of a) timing, i.e. health effect of drinking patterns in early, mid and late life; and b) duration, i.e. whether the impact of drinking accumulates over time.
3. To test the bidirectional associations between health and changes in consumption over the life-course in order to estimate the relative importance of these effects and to determine the dominant temporal direction.
4. To explore mechanisms and pathways through which drinking trajectories affect health and functioning in later life and to examine the role played by potential effect modifiers of the association between drinking and poor health.
Several large, longitudinal cohort studies from European countries with repeated measures of alcohol consumption will be combined and analysed to address the aims. A new team will be formed consisting of the PI, a Research Associate and two PhD students. Dissemination will be through journals, conferences, and culminating in a one-day workshop for academics, practitioners and policy makers in the alcohol field.
Summary
The epidemiology of alcohol use and related health consequences plays a vital role by monitoring populations’ alcohol consumption patterns and problems associated with drinking. Such studies seek to explain mechanisms linking consumption to harm and ultimately to reduce the health burden. Research needs to consider changes in drinking behaviour over the life-course. The current evidence base lacks the consideration of the complexity of lifetime consumption patterns, the predictors of change and subsequent health risks.
Aims of the study
1. To describe age-related trajectories of drinking in different settings and to determine the extent to which individual and social contextual factors, including socioeconomic position, social networks and life events influence drinking pattern trajectories.
2. To estimate the impact of drinking trajectories on physical functioning and disease and to disentangle the exposure-outcome associations in terms of a) timing, i.e. health effect of drinking patterns in early, mid and late life; and b) duration, i.e. whether the impact of drinking accumulates over time.
3. To test the bidirectional associations between health and changes in consumption over the life-course in order to estimate the relative importance of these effects and to determine the dominant temporal direction.
4. To explore mechanisms and pathways through which drinking trajectories affect health and functioning in later life and to examine the role played by potential effect modifiers of the association between drinking and poor health.
Several large, longitudinal cohort studies from European countries with repeated measures of alcohol consumption will be combined and analysed to address the aims. A new team will be formed consisting of the PI, a Research Associate and two PhD students. Dissemination will be through journals, conferences, and culminating in a one-day workshop for academics, practitioners and policy makers in the alcohol field.
Max ERC Funding
1 032 815 €
Duration
Start date: 2013-01-01, End date: 2017-12-31
Project acronym ALEXANDRIA
Project Large-Scale Formal Proof for the Working Mathematician
Researcher (PI) Lawrence PAULSON
Host Institution (HI) THE CHANCELLOR MASTERS AND SCHOLARS OF THE UNIVERSITY OF CAMBRIDGE
Call Details Advanced Grant (AdG), PE6, ERC-2016-ADG
Summary Mathematical proofs have always been prone to error. Today, proofs can be hundreds of pages long and combine results from many specialisms, making them almost impossible to check. One solution is to deploy modern verification technology. Interactive theorem provers have demonstrated their potential as vehicles for formalising mathematics through achievements such as the verification of the Kepler Conjecture. Proofs done using such tools reach a high standard of correctness.
However, existing theorem provers are unsuitable for mathematics. Their formal proofs are unreadable. They struggle to do simple tasks, such as evaluating limits. They lack much basic mathematics, and the material they do have is difficult to locate and apply.
ALEXANDRIA will create a proof development environment attractive to working mathematicians, utilising the best technology available across computer science. Its focus will be the management and use of large-scale mathematical knowledge, both theorems and algorithms. The project will employ mathematicians to investigate the formalisation of mathematics in practice. Our already substantial formalised libraries will serve as the starting point. They will be extended and annotated to support sophisticated searches. Techniques will be borrowed from machine learning, information retrieval and natural language processing. Algorithms will be treated similarly: ALEXANDRIA will help users find and invoke the proof methods and algorithms appropriate for the task.
ALEXANDRIA will provide (1) comprehensive formal mathematical libraries; (2) search within libraries, and the mining of libraries for proof patterns; (3) automated support for the construction of large formal proofs; (4) sound and practical computer algebra tools.
ALEXANDRIA will be based on legible structured proofs. Formal proofs should be not mere code, but a machine-checkable form of communication between mathematicians.
Summary
Mathematical proofs have always been prone to error. Today, proofs can be hundreds of pages long and combine results from many specialisms, making them almost impossible to check. One solution is to deploy modern verification technology. Interactive theorem provers have demonstrated their potential as vehicles for formalising mathematics through achievements such as the verification of the Kepler Conjecture. Proofs done using such tools reach a high standard of correctness.
However, existing theorem provers are unsuitable for mathematics. Their formal proofs are unreadable. They struggle to do simple tasks, such as evaluating limits. They lack much basic mathematics, and the material they do have is difficult to locate and apply.
ALEXANDRIA will create a proof development environment attractive to working mathematicians, utilising the best technology available across computer science. Its focus will be the management and use of large-scale mathematical knowledge, both theorems and algorithms. The project will employ mathematicians to investigate the formalisation of mathematics in practice. Our already substantial formalised libraries will serve as the starting point. They will be extended and annotated to support sophisticated searches. Techniques will be borrowed from machine learning, information retrieval and natural language processing. Algorithms will be treated similarly: ALEXANDRIA will help users find and invoke the proof methods and algorithms appropriate for the task.
ALEXANDRIA will provide (1) comprehensive formal mathematical libraries; (2) search within libraries, and the mining of libraries for proof patterns; (3) automated support for the construction of large formal proofs; (4) sound and practical computer algebra tools.
ALEXANDRIA will be based on legible structured proofs. Formal proofs should be not mere code, but a machine-checkable form of communication between mathematicians.
Max ERC Funding
2 430 140 €
Duration
Start date: 2017-09-01, End date: 2022-08-31
Project acronym ALGAME
Project Algorithms, Games, Mechanisms, and the Price of Anarchy
Researcher (PI) Elias Koutsoupias
Host Institution (HI) THE CHANCELLOR, MASTERS AND SCHOLARS OF THE UNIVERSITY OF OXFORD
Call Details Advanced Grant (AdG), PE6, ERC-2012-ADG_20120216
Summary The objective of this proposal is to bring together a local team of young researchers who will work closely with international collaborators to advance the state of the art of Algorithmic Game Theory and open new venues of research at the interface of Computer Science, Game Theory, and Economics. The proposal consists mainly of three intertwined research strands: algorithmic mechanism design, price of anarchy, and online algorithms.
Specifically, we will attempt to resolve some outstanding open problems in algorithmic mechanism design: characterizing the incentive compatible mechanisms for important domains, such as the domain of combinatorial auctions, and resolving the approximation ratio of mechanisms for scheduling unrelated machines. More generally, we will study centralized and distributed algorithms whose inputs are controlled by selfish agents that are interested in the outcome of the computation. We will investigate new notions of mechanisms with strong truthfulness and limited susceptibility to externalities that can facilitate modular design of mechanisms of complex domains.
We will expand the current research on the price of anarchy to time-dependent games where the players can select not only how to act but also when to act. We also plan to resolve outstanding questions on the price of stability and to build a robust approach to these questions, similar to smooth analysis. For repeated games, we will investigate convergence of simple strategies (e.g., fictitious play), online fairness, and strategic considerations (e.g., metagames). More generally, our aim is to find a productive formulation of playing unknown games by drawing on the fields of online algorithms and machine learning.
Summary
The objective of this proposal is to bring together a local team of young researchers who will work closely with international collaborators to advance the state of the art of Algorithmic Game Theory and open new venues of research at the interface of Computer Science, Game Theory, and Economics. The proposal consists mainly of three intertwined research strands: algorithmic mechanism design, price of anarchy, and online algorithms.
Specifically, we will attempt to resolve some outstanding open problems in algorithmic mechanism design: characterizing the incentive compatible mechanisms for important domains, such as the domain of combinatorial auctions, and resolving the approximation ratio of mechanisms for scheduling unrelated machines. More generally, we will study centralized and distributed algorithms whose inputs are controlled by selfish agents that are interested in the outcome of the computation. We will investigate new notions of mechanisms with strong truthfulness and limited susceptibility to externalities that can facilitate modular design of mechanisms of complex domains.
We will expand the current research on the price of anarchy to time-dependent games where the players can select not only how to act but also when to act. We also plan to resolve outstanding questions on the price of stability and to build a robust approach to these questions, similar to smooth analysis. For repeated games, we will investigate convergence of simple strategies (e.g., fictitious play), online fairness, and strategic considerations (e.g., metagames). More generally, our aim is to find a productive formulation of playing unknown games by drawing on the fields of online algorithms and machine learning.
Max ERC Funding
2 461 000 €
Duration
Start date: 2013-04-01, End date: 2019-03-31
Project acronym ALGILE
Project Foundations of Algebraic and Dynamic Data Management Systems
Researcher (PI) Christoph Koch
Host Institution (HI) ECOLE POLYTECHNIQUE FEDERALE DE LAUSANNE
Call Details Starting Grant (StG), PE6, ERC-2011-StG_20101014
Summary "Contemporary database query languages are ultimately founded on logic and feature an additive operation – usually a form of (multi)set union or disjunction – that is asymmetric in that additions or updates do not always have an inverse. This asymmetry puts a greater part of the machinery of abstract algebra for equation solving outside the reach of databases. However, such equation solving would be a key functionality that problems such as query equivalence testing and data integration could be reduced to: In the current scenario of the presence of an asymmetric additive operation they are undecidable. Moreover, query languages with a symmetric additive operation (i.e., which has an inverse and is thus based on ring theory) would open up databases for a large range of new scientific and mathematical applications.
The goal of the proposed project is to reinvent database management systems with a foundation in abstract algebra and specifically in ring theory. The presence of an additive inverse allows to cleanly define differences between queries. This gives rise to a database analog of differential calculus that leads to radically new incremental and adaptive query evaluation algorithms that substantially outperform the state of the art techniques. These algorithms enable a new class of systems which I call Dynamic Data Management Systems. Such systems can maintain continuously fresh query views at extremely high update rates and have important applications in interactive Large-scale Data Analysis. There is a natural connection between differences and updates, motivating the group theoretic study of updates that will lead to better ways of creating out-of-core data processing algorithms for new storage devices. Basing queries on ring theory leads to a new class of systems, Algebraic Data Management Systems, which herald a convergence of database systems and computer algebra systems."
Summary
"Contemporary database query languages are ultimately founded on logic and feature an additive operation – usually a form of (multi)set union or disjunction – that is asymmetric in that additions or updates do not always have an inverse. This asymmetry puts a greater part of the machinery of abstract algebra for equation solving outside the reach of databases. However, such equation solving would be a key functionality that problems such as query equivalence testing and data integration could be reduced to: In the current scenario of the presence of an asymmetric additive operation they are undecidable. Moreover, query languages with a symmetric additive operation (i.e., which has an inverse and is thus based on ring theory) would open up databases for a large range of new scientific and mathematical applications.
The goal of the proposed project is to reinvent database management systems with a foundation in abstract algebra and specifically in ring theory. The presence of an additive inverse allows to cleanly define differences between queries. This gives rise to a database analog of differential calculus that leads to radically new incremental and adaptive query evaluation algorithms that substantially outperform the state of the art techniques. These algorithms enable a new class of systems which I call Dynamic Data Management Systems. Such systems can maintain continuously fresh query views at extremely high update rates and have important applications in interactive Large-scale Data Analysis. There is a natural connection between differences and updates, motivating the group theoretic study of updates that will lead to better ways of creating out-of-core data processing algorithms for new storage devices. Basing queries on ring theory leads to a new class of systems, Algebraic Data Management Systems, which herald a convergence of database systems and computer algebra systems."
Max ERC Funding
1 480 548 €
Duration
Start date: 2012-01-01, End date: 2016-12-31
Project acronym AlgoRNN
Project Recurrent Neural Networks and Related Machines That Learn Algorithms
Researcher (PI) Juergen Schmidhuber
Host Institution (HI) UNIVERSITA DELLA SVIZZERA ITALIANA
Call Details Advanced Grant (AdG), PE6, ERC-2016-ADG
Summary Recurrent neural networks (RNNs) are general parallel-sequential computers. Some learn their programs or weights. Our supervised Long Short-Term Memory (LSTM) RNNs were the first to win pattern recognition contests, and recently enabled best known results in speech and handwriting recognition, machine translation, etc. They are now available to billions of users through the world's most valuable public companies including Google and Apple. Nevertheless, in lots of real-world tasks RNNs do not yet live up to their full potential. Although universal in theory, in practice they fail to learn important types of algorithms. This ERC project will go far beyond today's best RNNs through novel RNN-like systems that address some of the biggest open RNN problems and hottest RNN research topics: (1) How can RNNs learn to control (through internal spotlights of attention) separate large short-memory structures such as sub-networks with fast weights, to improve performance on many natural short-term memory-intensive tasks which are currently hard to learn by RNNs, such as answering detailed questions on recently observed videos? (2) How can such RNN-like systems metalearn entire learning algorithms that outperform the original learning algorithms? (3) How to achieve efficient transfer learning from one RNN-learned set of problem-solving programs to new RNN programs solving new tasks? In other words, how can one RNN-like system actively learn to exploit algorithmic information contained in the programs running on another? We will test our systems existing benchmarks, and create new, more challenging multi-task benchmarks. This will be supported by a rather cheap, GPU-based mini-brain for implementing large RNNs.
Summary
Recurrent neural networks (RNNs) are general parallel-sequential computers. Some learn their programs or weights. Our supervised Long Short-Term Memory (LSTM) RNNs were the first to win pattern recognition contests, and recently enabled best known results in speech and handwriting recognition, machine translation, etc. They are now available to billions of users through the world's most valuable public companies including Google and Apple. Nevertheless, in lots of real-world tasks RNNs do not yet live up to their full potential. Although universal in theory, in practice they fail to learn important types of algorithms. This ERC project will go far beyond today's best RNNs through novel RNN-like systems that address some of the biggest open RNN problems and hottest RNN research topics: (1) How can RNNs learn to control (through internal spotlights of attention) separate large short-memory structures such as sub-networks with fast weights, to improve performance on many natural short-term memory-intensive tasks which are currently hard to learn by RNNs, such as answering detailed questions on recently observed videos? (2) How can such RNN-like systems metalearn entire learning algorithms that outperform the original learning algorithms? (3) How to achieve efficient transfer learning from one RNN-learned set of problem-solving programs to new RNN programs solving new tasks? In other words, how can one RNN-like system actively learn to exploit algorithmic information contained in the programs running on another? We will test our systems existing benchmarks, and create new, more challenging multi-task benchmarks. This will be supported by a rather cheap, GPU-based mini-brain for implementing large RNNs.
Max ERC Funding
2 500 000 €
Duration
Start date: 2017-10-01, End date: 2022-09-30