(Some aspects of) the future of AI Tuomas Sandholm.

Slides:



Advertisements
Similar presentations
Approaches, Tools, and Applications Islam A. El-Shaarawy Shoubra Faculty of Eng.
Advertisements

Tetris – Genetic Algorithm Presented by, Jeethan & Jun.
Data Mining Methodology 1. Why have a Methodology  Don’t want to learn things that aren’t true May not represent any underlying reality ○ Spurious correlation.
A Lite Introduction to (Bioinformatics and) Comparative Genomics Chris Mueller August 10, 2004.
Workshop on HPC in India Grid Middleware for High Performance Computing Sathish Vadhiyar Grid Applications Research Lab (GARL) Supercomputer Education.
Will Androids Dream of Electric Sheep? A Glimpse of Current and Future Developments in Artificial Intelligence Henry Kautz Computer Science & Engineering.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
CPS Topics in Computational Economics Instructor: Vincent Conitzer Assistant Professor of Computer Science Assistant Professor of Economics
. Class 1: Introduction. The Tree of Life Source: Alberts et al.
EvoNet Flying Circus Introduction to Evolutionary Computation Brought to you by (insert your name) The EvoNet Training Committee The EvoNet Flying Circus.
Automated Changes of Problem Representation Eugene Fink LTI Retreat 2007.
Natural Computation: computational models inspired by nature Dr. Daniel Tauritz Department of Computer Science University of Missouri-Rolla CS347 Lecture.
Simulation Models as a Research Method Professor Alexander Settles.
Better automated abstraction techniques for imperfect information games, with application to Texas Hold’em poker * Andrew Gilpin and Tuomas Sandholm, CMU,
1. Familiar facts: Everyone knows that developments in hardware and software technology have had and will have tremendous impacts on all our lives, in.
Evolutionary Computation Application Peter Andras peter.andras/lectures.
Multi-item auctions & exchanges (multiple distinguishable items for sale) Tuomas Sandholm Carnegie Mellon University.
WECWIS, June 27, 2002 On the Sensitivity of Incremental Algorithms for Combinatorial Auctions Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, Majid Sarrafzadeh.
Computational Thinking Related Efforts. CS Principles – Big Ideas  Computing is a creative human activity that engenders innovation and promotes exploration.
CS 6190 Finding a Research Topic. The Thesis Equation Topic + Advisor = Dissertation.
Biosafety and recombinant DNA technology. Involves.... Experiments involving the construction or use of GMOs should be conducted after performing a biosafety.
Image Registration of Very Large Images via Genetic Programming Sarit Chicotay Omid E. David Nathan S. Netanyahu CVPR ‘14 Workshop on Registration of Very.
Christoph F. Eick: Applying EC to TSP(n) Example: Applying EC to the TSP Problem  Given: n cities including the cost of getting from on city to the other.
Genetic Algorithms: A Tutorial
Ch1 AI: History and Applications Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
Artificial Intelligence Introduction (2). What is Artificial Intelligence ?  making computers that think?  the automation of activities we associate.
Introduction to Machine Learning MSE 2400 EaLiCaRA Spring 2015 Dr. Tom Way Based in part on notes from Gavin Brown, University of Manchester.
Genetic Regulatory Network Inference Russell Schwartz Department of Biological Sciences Carnegie Mellon University.
Battling bacterial evolution: The work of Carl Bergstrom
Objectives  Summarize Darwin’s theory of natural selection  Describe the evidence for evolution  SCS: B-5.
Artificial Intelligence
Biomedical Research.
Large-scale Hybrid Parallel SAT Solving Nishant Totla, Aditya Devarakonda, Sanjit Seshia.
Design of an Evolutionary Algorithm M&F, ch. 7 why I like this textbook and what I don’t like about it!
Evolving Virtual Creatures & Evolving 3D Morphology and Behavior by Competition Papers by Karl Sims Presented by Sarah Waziruddin.
I Robot.
Artificial Intelligence Chapter 4. Machine Evolution.
Biological Signal Detection for Protein Function Prediction Investigators: Yang Dai Prime Grant Support: NSF Problem Statement and Motivation Technical.
Distributed Information Systems. Motivation ● To understand the problems that Web services try to solve it is helpful to understand how distributed information.
WMU CS 6260 Parallel Computations II Spring 2013 Presentation #1 about Semester Project Feb/18/2013 Professor: Dr. de Doncker Name: Sandino Vargas Xuanyu.
Computing and Approximating Equilibria: How… …and What’s the Point? Yevgeniy Vorobeychik Sandia National Laboratories.
Artificial intelligence
Artificial Intelligence and Searching CPSC 315 – Programming Studio Spring 2013 Project 2, Lecture 1 Adapted from slides of Yoonsuck Choe.
Intelligent Database Systems Lab 國立雲林科技大學 National Yunlin University of Science and Technology 1 Evolving Reactive NPCs for the Real-Time Simulation Game.
KEY CONCEPT Biotechnology relies on cutting DNA at specific places.
Cooperation, Power and Conspiracies Yoram Bachrach.
Algorithmic, Game-theoretic and Logical Foundations
Steering Evolution and Biological Adaptation Strategically: Computational Game Theory and Opponent Exploitation for Treatment Planning, Drug Design, and.
 What I Already Knew. What I Already Knew.  My Search Results. My Search Results.  What I Learned. What I Learned.
Course Overview  What is AI?  What are the Major Challenges?  What are the Main Techniques?  Where are we failing, and why?  Step back and look at.
Optimization Problems
Organic Evolution and Problem Solving Je-Gun Joung.
Chapter 15. Cognitive Adequacy in Brain- Like Intelligence in Brain-Like Intelligence, Sendhoff et al. Course: Robots Learning from Humans Cinarel, Ceyda.
OPPONENT EXPLOITATION Tuomas Sandholm. Traditionally two approaches to tackling games Game theory approach (abstraction+equilibrium finding) –Safe in.
Resource Optimization for Publisher/Subscriber-based Avionics Systems Institute for Software Integrated Systems Vanderbilt University Nashville, Tennessee.
Bringing Diversity into Impact Evaluation: Towards a Broadened View of Design and Methods for Impact Evaluation Sanjeev Sridharan.
Multi-cellular paradigm The molecular level can support self- replication (and self- repair). But we also need cells that can be designed to fit the specific.
Sub-fields of computer science. Sub-fields of computer science.
Biotechnology.
Evolutionary Technique for Combinatorial Reverse Auctions
Done Done Course Overview What is AI? What are the Major Challenges?
Extensive-form games and how to solve them
Artificial Intelligence introduction(2)
Introduction to AI Tuomas Sandholm Professor
Announcements Homework 3 due today (grace period through Friday)
Example: Applying EC to the TSP Problem
Artificial Intelligence Chapter 4. Machine Evolution
Dr. Unnikrishnan P.C. Professor, EEE
SASS: Self-Adaptation using Stochastic Search
Coevolutionary Automated Software Correction
Presentation transcript:

(Some aspects of) the future of AI Tuomas Sandholm

Some say AI has only been successful in specific applications with highly application-specific techniques I don’t mind too much Not true Reasoning technology Application Narrow waist is desirable

Don’t make the waist too narrow! Use data if it exists (priors / extra inputs) Unlike in some current practice and in competitive analysis of algorithms E.g., revenue-maximizing or cost-minimizing auction/pricing design –Wilson doctrine versus automated mechanism design Combinatorial auctions Sponsored search E.g., sample-trajectory-based online algorithms for kidney exchange

Core AI in core AI E.g., tree search in –Bayesian reasoning (e.g., via #SAT) –Clustering –Task/resource allocation via combinatorial auctions

Tree search ≈ integer programming AI and operations research communities –Didn’t communicate enough Re-invented some things, e.g., A* –Focus on different aspects –Now, cross-fertilization

Current outside-the-box tree search approaches in my lab Motivations –Good branching is hard in practice and theory – so much so that random restarts help –DPLL might be too weak a proof system Search tree restructuring on the fly [Zawadzky & Sandholm 2010] Combining DPLL and resolution in the tree Formula learning Treeless tree search [Dickerson & Sandholm SoCS-13]

What does NP-hardness mean, really? That problem is intractable in practice? No! –Scalable complete SAT solvers since late 90s –Scalable general-purpose integer programming since early 90s Interesting similarity in breakthroughs –Scalable combinatorial auction winner determination since 02 E.g., 2M bids, 85,000 items (multiple units of each) Nothing? No! One important meaning: NP-hardness limits knowledge. There is no concise full characterization of how answer depends on inputs –E.g., manually trying to derive revenue-maximizing multi-item auctions is futile => automated design per setting

Highly parallel / distributed Driving trends –Moore’s law ended 2004 => to continue progress, need highly multi-core –Software-as-a-Service & clouds Access to large-scale resources Affordable due to amortization across bursty users –Big data How should AI algorithms be adapted to best use these resources? –Search Branch parallelism versus Different branching orders / questions versus Complete & incomplete versus Solution improver & optimality prover versus ? –Convex optimization, …

Thoughts about goals of AI AI has many different goals –This is nothing to avoid –E.g., OR has same “problem” and is not shy about it Shouldn’t define AI as that which still cannot be done Human-level intelligence just a milestone along the way Many AI goals include game-theoretic reasoning

Potential new applications with huge positive impact on the world Better electricity markets Combinatorial CO 2 allowance / pollution credit markets Automated market making Campaign market for advertising Security games –Physical, information, malware protection, … –Sequential

AI in medicine (and biology) Machine learning from data –E.g., DNA sequencing data will be driving this –Active learning AI not just for understanding but for control…

One Exciting Future Application of AI Control in Medicine/Biology: Computational Game Theory and Opponent Exploitation to Direct Evolution and Adaptation

Vision [Sandholm, AAAI Conference on Artificial Intelligence, 2015; patent pending 2012] Living organisms evolve/adapt to challenges => key difficulty in developing therapies since challenged organisms develop resistance Idea: harness evolution/adaptation strategically for therapeutic/technological/scientific goals Model this as a 2-player 0-sum incomplete-information game between treater and opponent A strategy (multi-step contingent plan) is computed for the specific game at hand Information set

Game-theoretic approach is safe …but sometimes too conservative…

Opponent modeling & exploitation Start playing game theoretically. Adjust toward exploiting opponent in points of the game where good data about opponent’s play has been amassed [Ganzfried & Sandholm AAMAS-11] Best response (stochastic optimization) -> trajectory-based optimization, policy gradient, algorithms for partially-observable Markov decision problems, … Safe opponent exploitation [Ganzfried & Sandholm EC-12, TEAC-2015] Evolution and biological adaptation are myopic => can trap it –Trap → multiple traps → minimize opponents’ expected utility –Recently started studying complexity and algorithms for this [Kroer & Sandholm IJCAI-15]

Benefits Most medical treatment today is myopic => Puts treater at same disadvantage that opponent has Algorithms can often solve games better than humans Speed & automation => custom plans Potential to guide medical research

CATEGORIES OF APPLICATION OF STEERING EVOLUTION/ADAPTATION

Battling disease within an individual patient (viruses, bacteria, cancer, etc., in animals & plants) E.g., opponent = HIV Opponent’s actions include evolving the virus pool within patient Treater’s actions include treatments (e.g., drug cocktails) and tests –Could even include de novo drugs from large/infinite space A model can be used to predict how well each of the drugs in the cocktails would bind to each mutation at each site Wild potential longer-term directions: –Tattoo sensors that measure state, which affects next action in the plan –Compiling the plan into DNA cages or hybridization-based logic

Battling disease in patient population E.g., opponent = pandemic Actions of disease at any point in the game: –Spread of various strands and mutations to different regions/population segments Actions of treater at any point in the game: –Which drug/cocktail/quaranteening/tests to use in which part of the population

Steering a patient’s own immune system [Kroer & Sandholm IJCAI-16] “Opponent” = one’s own T cell population Tune it to fight autoimmune diabetes, cancer, IBD, infection, allergies, … Actions of treater at any point in the game: –Block cytokine receptor signaling –Add or remove cytokines –Alter transcription factor expression –Reversible antisense translational repression –Can be done in combinations and for different durations Plan 2 59 states [Miskov-Zivanov et al. 2013; Hawse et al. 2015]

Results (in silico) of generating regulatory T cells Expected value of the plan Iterations of our planning algorithm

High-level summary AI planning (UCT in this case) to construct a sequential treatment plan –Calls an off-the-shelf biological simulation tool as the opponent model A leading T cell simulator [Hawse et al. 2015] available in BioNetGen Two alternate goals: –Developing regulatory T cells (prevents autoimmune disease) –Developing effector T cells (helps cancer survival) Conclusions: –Current pathway models and simulators suffice to support beneficial treatment planning –Sequential treatment plans are significantly better

Action choices (in the experiment) whenever we can act Any combination of: –TCR: high/low/none –CD28: high/low/none –TGFβ: activate/inhibit/none –IL-2: activate/inhibit/none

State measurement (abstraction) Values of two proteins: FOXP3 and IL-2 Chosen because they are relevant to the value function for both types of cells that we consider Measuring state of additional proteins may lead to even more interesting results

Utility functions for planning Regulatory cells experiment: Effector cells experiment:

Experimental results

Applications beyond battling diseases Cell population differentiation or even repurposing –Could one evolve a blood cell into a liver cell a cancer cell (e.g., T47D) into an M1 macrophage … –Could one grow a missing organ or limb? Synthetic biology –Evolve bacteria that eat toxins or biofilms without introducing foreign genetic material

Tackling questions in natural science Enables one to formalize and potentially answer fundamental questions in natural science –Can a certain kind of cell be transformed into a certain other kind of cell using evolutionary pressures using a given set of manipulations and measurements? –How much more power do multi-step treatment plans offer? –Does there exist a strategy that will destroy a given diverse cell population (e.g., cancer) in a way that leaves no persistors? What is inherently (im)possible to achieve via adaptation? Via evolution?

Another Exciting Application of AI Control in Medicine: Kidney Exchange

Kidney exchange My algorithms & software run the UNOS nationwide kidney exchange –Selected in 2008; exchange went live 2010; now has 153 transplant centers I have also conducted match runs for private kidney exchanges Our ideas fielded worldwide –E.g., never-ending chains, which lead to ~600 transplants per year in US alone

Some of our current research on organ exchanges Even faster batch optimization algorithms, esp. with chains [AAAI-16, EC-16 submission, …] Dynamic matching [IJCAI-09, AAMAS-12, AAAI-12, AAAI- 15] Failure-aware matching [EC-13, AAAI-15] Learning a better policy [AAAI-15] Better edge testing policies [EC-15, …] Using multiple donors from one recipient International Liver lobe and cross-organ exchanges [AAAI-14, JAIR-16]

Summary AI is an exciting area because we can directly make the world a better place Narrow waist => general-purpose reasoning engines –Lots of people improve the engines But don’t make waist too narrow (e.g., use data) Lots of research to do on search, convex opt, etc. Parallel / distributed New potential applications to change the world