DOCSLIB.ORG

DRAW: a Recurrent Neural Network for Image Generation

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
DRAW: a Recurrent Neural Network for Image Generation DRAW: A Recurrent Neural Network For Image Generation Karol Gregor [email protected] Ivo Danihelka [email protected] Alex Graves [email protected] Danilo Jimenez Rezende [email protected] Daan Wierstra [email protected] Google DeepMind Abstract This paper introduces the Deep Recurrent Atten- tive Writer (DRAW) neural network architecture for image generation. DRAW networks combine a novel spatial attention mechanism that mimics the foveation of the human eye, with a sequential variational auto-encoding framework that allows for the iterative construction of complex images. The system substantially improves on the state of the art for generative models on MNIST, and, when trained on the Street View House Numbers dataset, it generates images that cannot be distin- guished from real data with the naked eye. 1. Introduction Time A person asked to draw, paint or otherwise recreate a visual scene will naturally do so in a sequential, iterative fashion, Figure 1. A trained DRAW network generating MNIST dig- reassessing their handiwork after each modification. Rough its. Each row shows successive stages in the generation of a sin- outlines are gradually replaced by precise forms, lines are gle digit. Note how the lines composing the digits appear to be sharpened, darkened or erased, shapes are altered, and the “drawn” by the network. The red rectangle delimits the area at- final picture emerges. Most approaches to automatic im- tended to by the network at each time-step, with the focal preci- sion indicated by the width of the rectangle border. age generation, however, aim to generate entire scenes at once. In the context of generative neural networks, this typ- ically means that all the pixels are conditioned on a single latent distribution (Dayan et al., 1995; Hinton & Salakhut- The core of the DRAW architecture is a pair of recurrent dinov, 2006; Larochelle & Murray, 2011). As well as pre- neural networks: an encoder network that compresses the cluding the possibility of iterative self-correction, the “one real images presented during training, and a decoder that shot” approach is fundamentally difficult to scale to large reconstitutes images after receiving codes. The combined images. The Deep Recurrent Attentive Writer (DRAW) ar- system is trained end-to-end with stochastic gradient de- chitecture represents a shift towards a more natural form of scent, where the loss function is a variational upper bound image construction, in which parts of a scene are created on the log-likelihood of the data. It therefore belongs to the independently from others, and approximate sketches are family of variational auto-encoders, a recently emerged successively refined. hybrid of deep learning and variational inference that has led to significant advances in generative modelling (Gre- Proceedings of the 32 nd International Conference on Machine gor et al., 2014; Kingma & Welling, 2014; Rezende et al., Learning, Lille, France, 2015. JMLR: W&CP volume 37. Copy- 2014; Mnih & Gregor, 2014; Salimans et al., 2014). Where right 2015 by the author(s). DRAW differs from its siblings is that, rather than generat- DRAW: A Recurrent Neural Network For Image Generation ing images in a single pass, it iteratively constructs scenes P (x z) ct 1 write ct write ... cT σ P (x z1:T ) | − | through an accumulation of modifications emitted by the decoder dec decoder decoder FNN ht 1 RNN RNN decoder, each of which is observed by the encoder. − z zt zt+1 An obvious correlate of generating images step by step is decoding sample sample sample (generative model) the ability to selectively attend to parts of the scene while encoding Q(z x) Q(zt x, z1:t 1) Q(zt+1 x, z1:t) (inference) ignoring others. A wealth of results in the past few years | | − | enc encoder encoder suggest that visual structure can be better captured by a se- ht 1 encoder − RNN RNN quence of partial glimpses, or foveations, than by a sin- FNN gle sweep through the entire image (Larochelle & Hinton, read read 2010; Denil et al., 2012; Tang et al., 2013; Ranzato, 2014; x x x Zheng et al., 2014; Mnih et al., 2014; Ba et al., 2014; Ser- manet et al., 2014). The main challenge faced by sequential Figure 2. Left: Conventional Variational Auto-Encoder. Dur- attention models is learning where to look, which can be ing generation, a sample z is drawn from a prior P (z) and passed addressed with reinforcement learning techniques such as through the feedforward decoder network to compute the proba- policy gradients (Mnih et al., 2014). The attention model in bility of the input P (xjz) given the sample. During inference the DRAW, however, is fully differentiable, making it possible input x is passed to the encoder network, producing an approx- to train with standard backpropagation. In this sense it re- imate posterior Q(zjx) over latent variables. During training, z is sampled from Q(zjx) and then used to compute the total de- sembles the selective read and write operations developed scription length KLQ(Zjx)jjP (Z) − log(P (xjz)), which is for the Neural Turing Machine (Graves et al., 2014). minimised with stochastic gradient descent. Right: DRAW Net- The following section defines the DRAW architecture, work. At each time-step a sample zt from the prior P (zt) is along with the loss function used for training and the pro- passed to the recurrent decoder network, which then modifies part cedure for image generation. Section3 presents the selec- of the canvas matrix. The final canvas matrix cT is used to com- pute P (xjz ). During inference the input is read at every time- tive attention model and shows how it is applied to read- 1:T step and the result is passed to the encoder RNN. The RNNs at ing and modifying images. Section4 provides experi- the previous time-step specify where to read. The output of the mental results on the MNIST, Street View House Num- encoder RNN is used to compute the approximate posterior over bers and CIFAR-10 datasets, with examples of generated the latent variables at that time-step. images; and concluding remarks are given in Section5. Lastly, we would like to direct the reader to the video accompanying this paper (https://www.youtube. as “what to write”. The architecture is sketched in Fig.2, com/watch?v=Zt-7MI9eKEo) which contains exam- alongside a feedforward variational auto-encoder. ples of DRAW networks reading and generating images. 2.1. Network Architecture 2. The DRAW Network Let RNN enc be the function enacted by the encoder net- enc The basic structure of a DRAW network is similar to that of work at a single time-step. The output of RNN at time enc other variational auto-encoders: an encoder network deter- t is the encoder hidden vector ht . Similarly the output of dec dec mines a distribution over latent codes that capture salient the decoder RNN at t is the hidden vector ht . In gen- information about the input data; a decoder network re- eral the encoder and decoder may be implemented by any ceives samples from the code distribuion and uses them to recurrent neural network. In our experiments we use the condition its own distribution over images. However there Long Short-Term Memory architecture (LSTM; Hochreiter are three key differences. Firstly, both the encoder and de- & Schmidhuber(1997)) for both, in the extended form with coder are recurrent networks in DRAW, so that a sequence forget gates (Gers et al., 2000). We favour LSTM due of code samples is exchanged between them; moreover the to its proven track record for handling long-range depen- encoder is privy to the decoder’s previous outputs, allow- dencies in real sequential data (Graves, 2013; Sutskever ing it to tailor the codes it sends according to the decoder’s et al., 2014). Throughout the paper, we use the notation behaviour so far. Secondly, the decoder’s outputs are suc- b = W (a) to denote a linear weight matrix with bias from cessively added to the distribution that will ultimately gen- the vector a to the vector b. erate the data, as opposed to emitting this distribution in At each time-step t, the encoder receives input from both a single step. And thirdly, a dynamically updated atten- the image x and from the previous decoder hidden vector tion mechanism is used to restrict both the input region dec ht 1. The precise form of the encoder input depends on a observed by the encoder, and the output region modified read− operation, which will be defined in the next section. by the decoder. In simple terms, the network decides at enc The output ht of the encoder is used to parameterise a each time-step “where to read” and “where to write” as well distribution Q(Z henc) over the latent vector z . In our tj t t DRAW: A Recurrent Neural Network For Image Generation experiments the latent distribution is a diagonal Gaussian negative log probability of x under D: (Zt µt; σt): x N j = log D(x cT ) (9) enc L − j µt = W (ht ) (1) The latent loss z for a sequence of latent distributions enc enc L σt = exp (W (ht )) (2) Q(Zt ht ) is defined as the summed Kullback-Leibler di- j enc vergence of some latent prior P (Zt) from Q(Zt ht ): Bernoulli distributions are more common than Gaussians j T for latent variables in auto-encoders (Dayan et al., 1995; X z = KLQ(Z henc) P (Z ) (10) Gregor et al., 2014); however a great advantage of Gaus- L tj t jj t sian latents is that the gradient of a function of the sam- t=1 ples with respect to the distribution parameters can be eas- Note that this loss depends upon the latent samples zt ily obtained using the so-called reparameterization trick drawn from Q(Z henc), which depend in turn on the input tj t (Kingma & Welling, 2014; Rezende et al., 2014).
Load more

Recommended publications
  • Artificial Intelligence and Big Data – Innovation Landscape Brief
    ARTIFICIAL INTELLIGENCE AND BIG DATA INNOVATION LANDSCAPE BRIEF © IRENA 2019 Unless otherwise stated, material in this publication may be freely used, shared, copied, reproduced, printed and/or stored, provided that appropriate acknowledgement is given of IRENA as the source and copyright holder. Material in this publication that is attributed to third parties may be subject to separate terms of use and restrictions, and appropriate permissions from these third parties may need to be secured before any use of such material. ISBN 978-92-9260-143-0 Citation: IRENA (2019), Innovation landscape brief: Artificial intelligence and big data, International Renewable Energy Agency, Abu Dhabi. ACKNOWLEDGEMENTS This report was prepared by the Innovation team at IRENA’s Innovation and Technology Centre (IITC) with text authored by Sean Ratka, Arina Anisie, Francisco Boshell and Elena Ocenic. This report benefited from the input and review of experts: Marc Peters (IBM), Neil Hughes (EPRI), Stephen Marland (National Grid), Stephen Woodhouse (Pöyry), Luiz Barroso (PSR) and Dongxia Zhang (SGCC), along with Emanuele Taibi, Nadeem Goussous, Javier Sesma and Paul Komor (IRENA). Report available online: www.irena.org/publications For questions or to provide feedback: [email protected] DISCLAIMER This publication and the material herein are provided “as is”. All reasonable precautions have been taken by IRENA to verify the reliability of the material in this publication. However, neither IRENA nor any of its officials, agents, data or other third- party content providers provides a warranty of any kind, either expressed or implied, and they accept no responsibility or liability for any consequence of use of the publication or material herein.
    [Show full text]
  • Machine Theory of Mind
    Machine Theory of Mind Neil C. Rabinowitz∗ Frank Perbet H. Francis Song DeepMind DeepMind DeepMind [email protected] [email protected] [email protected] Chiyuan Zhang S. M. Ali Eslami Matthew Botvinick Google Brain DeepMind DeepMind [email protected] [email protected] [email protected] Abstract 1. Introduction Theory of mind (ToM; Premack & Woodruff, For all the excitement surrounding deep learning and deep 1978) broadly refers to humans’ ability to rep- reinforcement learning at present, there is a concern from resent the mental states of others, including their some quarters that our understanding of these systems is desires, beliefs, and intentions. We propose to lagging behind. Neural networks are regularly described train a machine to build such models too. We de- as opaque, uninterpretable black-boxes. Even if we have sign a Theory of Mind neural network – a ToM- a complete description of their weights, it’s hard to get a net – which uses meta-learning to build models handle on what patterns they’re exploiting, and where they of the agents it encounters, from observations might go wrong. As artificial agents enter the human world, of their behaviour alone. Through this process, the demand that we be able to understand them is growing it acquires a strong prior model for agents’ be- louder. haviour, as well as the ability to bootstrap to Let us stop and ask: what does it actually mean to “un- richer predictions about agents’ characteristics derstand” another agent? As humans, we face this chal- and mental states using only a small number of lenge every day, as we engage with other humans whose behavioural observations.
    [Show full text]
  • Efficiently Mastering the Game of Nogo with Deep Reinforcement
    electronics Article Efficiently Mastering the Game of NoGo with Deep Reinforcement Learning Supported by Domain Knowledge Yifan Gao 1,*,† and Lezhou Wu 2,† 1 College of Medicine and Biological Information Engineering, Northeastern University, Liaoning 110819, China 2 College of Information Science and Engineering, Northeastern University, Liaoning 110819, China; [email protected] * Correspondence: [email protected] † These authors contributed equally to this work. Abstract: Computer games have been regarded as an important field of artificial intelligence (AI) for a long time. The AlphaZero structure has been successful in the game of Go, beating the top professional human players and becoming the baseline method in computer games. However, the AlphaZero training process requires tremendous computing resources, imposing additional difficulties for the AlphaZero-based AI. In this paper, we propose NoGoZero+ to improve the AlphaZero process and apply it to a game similar to Go, NoGo. NoGoZero+ employs several innovative features to improve training speed and performance, and most improvement strategies can be transferred to other nonspecific areas. This paper compares it with the original AlphaZero process, and results show that NoGoZero+ increases the training speed to about six times that of the original AlphaZero process. Moreover, in the experiment, our agent beat the original AlphaZero agent with a score of 81:19 after only being trained by 20,000 self-play games’ data (small in quantity compared with Citation: Gao, Y.; Wu, L. Efficiently 120,000 self-play games’ data consumed by the original AlphaZero). The NoGo game program based Mastering the Game of NoGo with on NoGoZero+ was the runner-up in the 2020 China Computer Game Championship (CCGC) with Deep Reinforcement Learning limited resources, defeating many AlphaZero-based programs.
    [Show full text]
  • MUSTAFA SULEYMAN, DEEPMIND INTRO Thank You Mr. President and Your Excellencies for the Invitation to Speak to You About What Ar
    MUSTAFA SULEYMAN, DEEPMIND INTRO Thank you Mr. President and your excellencies for the invitation to speak to you about what artificial intelligence can do to help achieve the Sustainable Development Goals. As a global community, we’ve made significant strides over the last few decades, taking on some of the world’s greatest tragedies like child mortality. Every single day 17,000 new lives get to be lived, by children who would have died just 25 years ago. Peaceful cooperation and relentless innovation has been the driving force of this truly spectacular progress. And, yet, in many ways inequality hasn’t improved—it’s become worse. Malnutrition and preventable disease continue to kill millions, impacting both developed and developing world healthcare systems, and the devastating threat of climate change looms, with the effects set to hit the poorest the hardest. If we are to decrease this level of suffering, then we’ll have to make sure humanity is doing everything possible to come up with bold, new solutions. But to have any chance of truly solving these problems - one of the great goals of human civilisation and I would argue ​ core to the founding purpose of this great institution - then what’s possible won’t be ​ enough. We must take on what is currently impossible, and do all we can to push back the ​ ​ limits of what humanity can achieve. These limits are real, and they cap all of our aspirations for change. Our efforts to tackle disease are capped by a desperate shortage of trained nurses and doctors — in the rich West as well as in developing nations.
    [Show full text]
  • AI in Focus - Fundamental Artificial Intelligence and Video Games
    AI in Focus - Fundamental Artificial Intelligence and Video Games April 5, 2019 By Isi Caulder and Lawrence Yu Patent filings for fundamental artificial intelligence (AI) technologies continue to rise. Led by a number of high profile technology companies, including IBM, Google, Amazon, Microsoft, Samsung, and AT&T, patent applications directed to fundamental AI technologies, such as machine learning, neural networks, natural language processing, speech processing, expert systems, robotic and machine vision, are being filed and issued in ever-increasing numbers.[1] In turn, these fundamental AI technologies are being applied to address problems in industries such as healthcare, manufacturing, and transportation. A somewhat unexpected source of fundamental AI technology development has been occurring in the field of video games. Traditional board games have long been a subject of study for AI research. In the 1990’s, IBM created an AI for playing chess, Deep Blue, which was able to defeat top-caliber human players using brute force algorithms.[2] More recently, machine learning algorithms have been developed for more complex board games, which include a larger breadth of possible moves. For example, DeepMind (since acquired by Google), recently developed the first AI capable of defeating professional Go players, AlphaGo.[3] Video games have recently garnered the interest of researchers, due to their closer similarity to the “messiness” and “continuousness” of the real world. In contrast to board games, video games typically include a greater
    [Show full text]
  • Benchmarking Safe Exploration in Deep Reinforcement Learning
    Benchmarking Safe Exploration in Deep Reinforcement Learning Alex Ray∗ Joshua Achiam∗ Dario Amodei OpenAI OpenAI OpenAI Abstract Reinforcement learning (RL) agents need to explore their environments in order to learn optimal policies by trial and error. In many environments, safety is a critical concern and certain errors are unacceptable: for example, robotics systems that interact with humans should never cause injury to the humans while exploring. While it is currently typical to train RL agents mostly or entirely in simulation, where safety concerns are minimal, we anticipate that challenges in simulating the complexities of the real world (such as human-AI interactions) will cause a shift towards training RL agents directly in the real world, where safety concerns are paramount. Consequently we take the position that safe exploration should be viewed as a critical focus area for RL research, and in this work we make three contributions to advance the study of safe exploration. First, building on a wide range of prior work on safe reinforcement learning, we propose to standardize constrained RL as the main formalism for safe exploration. Second, we present the Safety Gym benchmark suite, a new slate of high-dimensional continuous control environments for measuring research progress on constrained RL. Finally, we benchmark several constrained deep RL algorithms on Safety Gym environments to establish baselines that future work can build on. 1 Introduction Reinforcement learning is an increasingly important technology for developing highly-capable AI systems. While RL is not yet fully mature or ready to serve as an “off-the-shelf” solution, it appears to offer a viable path to solving hard sequential decision-making problems that cannot currently be solved by any other approach.
    [Show full text]
  • Arxiv:1911.05531V1 [Q-Bio.BM] 9 Nov 2019 1 Introduction
    Accurate Protein Structure Prediction by Embeddings and Deep Learning Representations Iddo Drori1;2, Darshan Thaker1, Arjun Srivatsa1, Daniel Jeong1, Yueqi Wang1, Linyong Nan1, Fan Wu1, Dimitri Leggas1, Jinhao Lei1, Weiyi Lu1, Weilong Fu1, Yuan Gao1, Sashank Karri1, Anand Kannan1, Antonio Moretti1, Mohammed AlQuraishi3, Chen Keasar4, and Itsik Pe’er1 1 Columbia University, Department of Computer Science, New York, NY, 10027 2 Cornell University, School of Operations Research and Information Engineering, Ithaca, NY 14853 3 Harvard University, Department of Systems Biology, Harvard Medical School, Boston, MA 02115 4 Ben-Gurion University, Department of Computer Science, Israel, 8410501 Abstract. Proteins are the major building blocks of life, and actuators of almost all chemical and biophysical events in living organisms. Their native structures in turn enable their biological functions which have a fun- damental role in drug design. This motivates predicting the structure of a protein from its sequence of amino acids, a fundamental problem in com- putational biology. In this work, we demonstrate state-of-the-art protein structure prediction (PSP) results using embeddings and deep learning models for prediction of backbone atom distance matrices and torsion angles. We recover 3D coordinates of backbone atoms and reconstruct full atom protein by optimization. We create a new gold standard dataset of proteins which is comprehensive and easy to use. Our dataset consists of amino acid sequences, Q8 secondary structures, position specific scoring matrices, multiple sequence alignment co-evolutionary features, backbone atom distance matrices, torsion angles, and 3D coordinates. We evaluate the quality of our structure prediction by RMSD on the latest Critical Assessment of Techniques for Protein Structure Prediction (CASP) test data and demonstrate competitive results with the winning teams and AlphaFold in CASP13 and supersede the results of the winning teams in CASP12.
    [Show full text]
  • Memory-Based Control with Recurrent Neural Networks
    Memory-based control with recurrent neural networks Nicolas Heess* Jonathan J Hunt* Timothy P Lillicrap David Silver Google Deepmind * These authors contributed equally. heess, jjhunt, countzero, davidsilver @ google.com Abstract Partially observed control problems are a challenging aspect of reinforcement learning. We extend two related, model-free algorithms for continuous control – deterministic policy gradient and stochastic value gradient – to solve partially observed domains using recurrent neural networks trained with backpropagation through time. We demonstrate that this approach, coupled with long-short term memory is able to solve a variety of physical control problems exhibiting an as- sortment of memory requirements. These include the short-term integration of in- formation from noisy sensors and the identification of system parameters, as well as long-term memory problems that require preserving information over many time steps. We also demonstrate success on a combined exploration and mem- ory problem in the form of a simplified version of the well-known Morris water maze task. Finally, we show that our approach can deal with high-dimensional observations by learning directly from pixels. We find that recurrent deterministic and stochastic policies are able to learn similarly good solutions to these tasks, including the water maze where the agent must learn effective search strategies. 1 Introduction The use of neural networks for solving continuous control problems has a long tradition. Several recent papers successfully apply model-free, direct policy search methods to the problem of learning neural network control policies for challenging continuous domains with many degrees of freedoms [2, 6, 14, 21, 22, 12]. However, all of this work assumes fully observed state.
    [Show full text]
  • Neurips 2020 Workshop Book
    NeurIPS 2020 Workshop book Schedule Highlights Generated Fri Dec 18, 2020 Workshop organizers make last-minute changes to their schedule. Download this document again to get the lastest changes, or use the NeurIPS mobile application. Dec. 10, 2020 None Topological Data Analysis and Beyond Rieck, Chazal, Krishnaswamy, Kwitt, Natesan Ramamurthy, Umeda, Wolf Dec. 11, 2020 None Privacy Preserving Machine Learning - PriML and PPML Joint Edition Balle, Bell, Bellet, Chaudhuri, Gascon, Honkela, Koskela, Meehan, Ohrimenko, Park, Raykova, Smart, Wang, Weller None Tackling Climate Change with ML Dao, Sherwin, Donti, Kuntz, Kaack, Yusuf, Rolnick, Nakalembe, Monteleoni, Bengio None Meta-Learning Wang, Vanschoren, Grant, Schwarz, Visin, Clune, Calandra None OPT2020: Optimization for Machine Learning Paquette, Schmidt, Stich, Gu, Takac None Advances and Opportunities: Machine Learning for Education Garg, Heffernan, Meyers None Differential Geometry meets Deep Learning (DiffGeo4DL) Bose, Mathieu, Le Lan, Chami, Sala, De Sa, Nickel, Ré, Hamilton None Workshop on Dataset Curation and Security Baracaldo Angel, Bisk, Blum, Curry, Dickerson, Goldblum, Goldstein, Li, Schwarzschild None Machine Learning for Health (ML4H): Advancing Healthcare for All Hyland, Schmaltz, Onu, Nosakhare, Alsentzer, Chen, McDermott, Roy, Akera, Kiyasseh, Falck, Adams, Bica, Bear Don't Walk IV, Sarkar, Pfohl, Beam, Beaulieu-Jones, Belgrave, Naumann None Learning Meaningful Representations of Life (LMRL.org) Wood, Marks, Jones, Dieng, Aspuru-Guzik, Kundaje, Engelhardt, Liu, Boyden, Lindorff-Larsen,
    [Show full text]
  • 2021 Tech Trends Report Is De- It, Produced Two Factions: Those Signed to Help You Confront Deep Who Wanted to Reverse Time and Uncertainty, Adapt and Thrive
    Volume 1 of 12 14th Annual Edition 2021 Tech Trends Report Artificial Strategic trends that will influence business, Intelligence government, education, media and society in the coming year. 00 01 02 03 04 05 06 07 08 09 10 11 12 Artificial Intelligence 03 Overview 19 Algorithm Marketplaces 32 Machine Image Completion 43 Nation-based Guardrails 04 Macro Forces and Emerging Trends 19 100-Year Software 32 Predictive Models Using and Regulations 06 Summary 20 Scenario: Rage Against the Machine Single Images 43 Regulating Deepfakes 08 Artificial Intelligence 22 Health, Medicine, and Science 33 Model-free Approaches to RL 43 Making AI Explain Itself 09 An Executive’s Guide to AI 22 AI Speeds Scientific Discovery 33 Real-time Machine Learning 43 New Strategic Technical Alliances 09 Machine Learning 22 AI-First Drug Discovery 33 Automated Machine Learning 43 The New Mil-Tech (AutoML) Industrial Complex 09 Deep Learning 23 AI Improves Patient Outcomes 33 Hybrid Human-Computer Vision 44 Algorithmic Warfighting 10 Weak and Strong AI 23 Deep Learning Applied to 33 Neuro-Symbolic AI 12 Enterprise Medical Imaging 33 General Reinforcement 12 The Rise of MLOps 23 NLP Algorithms Detect Virus Mutations Learning Algorithms 12 Low-Code or No-Code 23 Diagnostics Without Tests 34 Continuous Learning Machine Learning 45 China’s AI Rules 34 Proliferation of 12 Web-Scale Content Analysis 23 Protein Folding Franken-Algorithms 48 Society 12 Simulating Empathy and Emotion 23 Dream Communication 34 Proprietary, Homegrown 48 Ethics Clash 24 Thought Detection 13 Artificial
    [Show full text]
  • The Dawn of Artificial Intelligence”
    Statement of Greg Brockman Co-Founder and Chief Technology Officer OpenAI before the Subcommittee on Space, Science, and Competitiveness Committee on Commerce, Science, and Transportation United States Senate Hearing on “The Dawn of Artificial Intelligence” Thank you Chairman Cruz, Ranking Member Peters, distinguished members of the Subcommittee. Today’s hearing presents an important first opportunity for the members of the Senate to understand and analyze the potential impacts of artificial intelligence on our Nation and the world, and to refine thinking on the best ways in which the U.S. Government might approach AI. I'm honored to have been invited to give this testimony today. By way of introduction, I'm Greg Brockman, co-founder and Chief Technology Officer of OpenAI. OpenAI is a non-profit AI research company. Our mission is to build safe, advanced AI technology and ensure that its benefits are distributed to everyone. OpenAI is chaired by technology executives Sam Altman and Elon Musk. The US has led the way in almost all technological breakthroughs of the last hundred years, and we've reaped enormous economic rewards as a result. Currently, we have a lead, but hardly a monopoly, in AI. For instance, this year Chinese teams won the top categories in a Stanford University-led image recognition competition. South Korea has declared a billion dollar AI fund. Canada produced some technologies enabling the current boom, and recently announced an investment into key areas of AI. I'd like to share 3 key points for how we can best succeed in AI and what the U.S.
    [Show full text]
  • Deep Reinforcement Learning from Human Preferences
    Deep Reinforcement Learning from Human Preferences Paul F Christiano Jan Leike Tom B Brown OpenAI DeepMind Google Brain⇤ [email protected] [email protected] [email protected] Miljan Martic Shane Legg Dario Amodei DeepMind DeepMind OpenAI [email protected] [email protected] [email protected] Abstract For sophisticated reinforcement learning (RL) systems to interact usefully with real-world environments, we need to communicate complex goals to these systems. In this work, we explore goals defined in terms of (non-expert) human preferences between pairs of trajectory segments. We show that this approach can effectively solve complex RL tasks without access to the reward function, including Atari games and simulated robot locomotion, while providing feedback on less than 1% of our agent’s interactions with the environment. This reduces the cost of human oversight far enough that it can be practically applied to state-of-the-art RL systems. To demonstrate the flexibility of our approach, we show that we can successfully train complex novel behaviors with about an hour of human time. These behaviors and environments are considerably more complex than any which have been previously learned from human feedback. 1 Introduction Recent success in scaling reinforcement learning (RL) to large problems has been driven in domains that have a well-specified reward function (Mnih et al., 2015, 2016; Silver et al., 2016). Unfortunately, many tasks involve goals that are complex, poorly-defined, or hard to specify. Overcoming this limitation would greatly expand the possible impact of deep RL and could increase the reach of machine learning more broadly. For example, suppose that we wanted to use reinforcement learning to train a robot to clean a table or scramble an egg.
    [Show full text]