<?xml version="1.0" encoding="UTF-8"?>
<?xml-stylesheet type="text/xsl" href="stratmliso.xsl"?>
<StrategicPlan xmlns="urn:ISO:std:iso:17469:tech:xsd:stratml_core" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="urn:ISO:std:iso:17469:tech:xsd:stratml_core http://xml.govwebs.net/stratml/references/StrategicPlanISOVersion20140401.xsd"><Name>Fundamental Limits of Learning (Fun LoL) Request for Information (RFI)</Name><Description>The Defense Advanced Research Projects Agency (DARPA) Defense Sciences Office (DSO) is requesting information on research related to the investigation and characterization of fundamental limits of machine learning with supportive theoretical foundations.  Although the main focus is on machine learning, extensions and implications for human-machine systems are also of interest.  The notion of fundamental limits here means that the conclusion about achievable performance limits should hold independent of specific learning methods or algorithms.</Description><OtherInformation>Current machine learning techniques often rely on huge amounts of training data, take prolonged periods of time for learning, and follow a trial and error methodology. Resulting learned concepts have poor generalization capability. Much of the success of such methods to date has been enabled by the availability of large datasets and platforms that can provide vast amounts of computational resources to be used for training. Less understood is how performance of current methods fares compared to the limits of what could be achieved for a given learning problem or even how such limits might be determined. For example, how efficient is a given learning method and how close is its performance relative to what theoretically might be achieved? Methodologies for answering such questions would enable evaluation of the capabilities of learning system designs and guide practical implementations relative to the capability limit of what is ultimately possible. DARPA seeks to address general problems involving learning systems by asking a central scientific question which is the focus of this RFI:  What are the fundamental limitations inherent in machine learning systems?</OtherInformation><StrategicPlanCore><Organization><Name>Defense Advanced Research Projects Agency</Name><Acronym>DARPA</Acronym><Identifier>_46ad30a4-ad5d-11df-9c96-10167a64ea2a</Identifier><Description/><Stakeholder StakeholderTypeType="Person"><Name>Dr. Reza Ghanadan</Name><Description>Primary Point of Contact --  Program Manager, DARPA/DSO.</Description></Stakeholder><Stakeholder StakeholderTypeType="Generic_Group"><Name>Multi-Disciplinary Teams</Name><Description>DARPA encourages responses from multi-disciplinary teams with expertise that might inform novel approaches to this problem. Areas of expertise that may be relevant include Machine Learning, Information Theory, Computer Science Theory, Statistics, Control Theory, Artificial Intelligence, and Cognitive Science.</Description></Stakeholder></Organization><Vision><Description/><Identifier>_7eb9669c-2c60-11e6-af3a-4288bea16470</Identifier></Vision><Mission><Description>To develop, validate, and apply a theoretical framework for learning</Description><Identifier>_7eb967c8-2c60-11e6-af3a-4288bea16470</Identifier></Mission><Value><Name>Learning</Name><Description>DARPA seeks information regarding mathematical frameworks for learning systems with quantifiable and generalizable measures of learning and limits to achievable performance in machine learning systems, along with architectures and methods to achieve them.</Description></Value><Value><Name>Quantification</Name><Description/></Value><Value><Name>Generalization</Name><Description/></Value><Value><Name>Performance</Name><Description/></Value><Value><Name>Practicality</Name><Description>Of interest is information about frameworks that can ultimately answer a number of questions for a given problem that will be useful in practical applications, such as:</Description></Value><Value><Name>Examples</Name><Description>What are the number of examples necessary for training to achieve a given accuracy performance?</Description></Value><Value><Name>Training</Name><Description/></Value><Value><Name>Trade-Offs</Name><Description>What are important trade-offs and their implications?</Description></Value><Value><Name>Efficiency</Name><Description>How "efficient" is a given learning algorithm for a given problem?</Description></Value><Value><Name>Accuracy</Name><Description>How close is the expected achievable performance of a learning algorithm compared to what can be achieved at the limit?</Description></Value><Value><Name>Resilience</Name><Description>What are the effects of noise and error in the training data?</Description></Value><Value><Name>Statistics</Name><Description>What are the potential gains possible due to the statistical structure of the model generating the data, due to any prior knowledge, or due to the nature of the concept or task that is being learned?</Description></Value><Value><Name>Knowledge</Name><Description/></Value><Goal><Name>Metrics</Name><Description>Provide quantifiable and generalizable measures of learning and fundamental limits across learning settings.</Description><Identifier>_7eb9685e-2c60-11e6-af3a-4288bea16470</Identifier><SequenceIndicator>1</SequenceIndicator><Stakeholder StakeholderTypeType=""><Name/><Description/></Stakeholder><OtherInformation>Foundational general theory: Articulation of a general mathematical framework that, independent of any particular machine learning method, provides quantifiable and generalizable measures of learning and fundamental limits across supervised, unsupervised, and reinforcement learning settings. Such a framework may need to consider a number of factors such as:</OtherInformation><Objective><Name>Signals</Name><Description>Consider the type, quality, and relevance of the signals available from the data (e.g., labels, distance/similarity measures, rewards).</Description><Identifier>_7eb968ea-2c60-11e6-af3a-4288bea16470</Identifier><SequenceIndicator>1.1</SequenceIndicator><Stakeholder StakeholderTypeType=""><Name/><Description/></Stakeholder><OtherInformation/></Objective><Objective><Name>Structure, Complexity &amp; Observability</Name><Description>Consider the structure, complexity, and observability of the target task/concept space.</Description><Identifier>_7eb96976-2c60-11e6-af3a-4288bea16470</Identifier><SequenceIndicator>1.2</SequenceIndicator><Stakeholder StakeholderTypeType=""><Name/><Description/></Stakeholder><OtherInformation/></Objective><Objective><Name>Tasks</Name><Description>Consider task performance metrics (e.g., accuracy, speed, computational complexity, sample complexity) as well as the interactions and trade-offs among such factors.</Description><Identifier>_7eb96a02-2c60-11e6-af3a-4288bea16470</Identifier><SequenceIndicator>1.3</SequenceIndicator><Stakeholder StakeholderTypeType=""><Name/><Description/></Stakeholder><OtherInformation/></Objective></Goal><Goal><Name>Applications</Name><Description>Characterize the capabilities or performance envelopes of current learning techniques.</Description><Identifier>_7eb96a98-2c60-11e6-af3a-4288bea16470</Identifier><SequenceIndicator>2</SequenceIndicator><Stakeholder StakeholderTypeType=""><Name/><Description/></Stakeholder><OtherInformation>Applications of theory: Application of a general framework to existing machine learning methods in order to characterize the capabilities or performance envelopes of current techniques in each of the following categories: * Supervised learning from example input/output pairs (e.g., deep neural networks, decision trees, support vector machines, random forests, etc.); * Unsupervised learning from only input data (e.g., clustering, topic models, principal component analysis, community detection, etc.); and * Reinforcement (policy) learning from reward/penalty signals (e.g., Q-learning, direct policy search, etc.). This Research Area should also address questions, such as: * What are the performance limits of methods/architectures that combine the algorithms from the above categories? * For what classes of problems are these algorithms optimal or near the performance limit?</OtherInformation><Objective><Name>Combination</Name><Description>Combine learning algorithms</Description><Identifier>_7eb96b2e-2c60-11e6-af3a-4288bea16470</Identifier><SequenceIndicator>2.1</SequenceIndicator><Stakeholder StakeholderTypeType=""><Name/><Description/></Stakeholder><OtherInformation/></Objective><Objective><Name>Optimization</Name><Description>Determine for which classes of problems these algorithms are optimal or near the performance limit</Description><Identifier>_7eb96bba-2c60-11e6-af3a-4288bea16470</Identifier><SequenceIndicator>2.2</SequenceIndicator><Stakeholder StakeholderTypeType=""><Name/><Description/></Stakeholder><OtherInformation/></Objective></Goal></StrategicPlanCore><AdministrativeInformation><StartDate>2016-05-12</StartDate><EndDate>2016-06-07</EndDate><PublicationDate>2016-06-07</PublicationDate><Source>https://www.fbo.gov/index?s=opportunity&amp;mode=form&amp;id=f1e29b723a39c00b7f32694e7fc5ac27&amp;tab=core&amp;_cview=0</Source><Submitter><GivenName>Owen</GivenName><Surname>Ambur</Surname><PhoneNumber/><EmailAddress>Owen.Ambur@verizon.net</EmailAddress></Submitter></AdministrativeInformation></StrategicPlan>