Cohen, Paul
Research Directions in Democratizing Innovation through Design Automation, One-Click Manufacturing Services and Intelligent Machines
Starly, Binil, Angrish, Atin, Cohen, Paul
The digitalization of manufacturing has created opportunities for consumers to customize products that fit their individualized needs which in turn would drive demand for manufacturing services. However, this pull-based manufacturing system production of extremely low quantity and limitless variety for products is expensive to implement. New emerging technology in design automation driven by data-driven computational design, manufacturing-as-a-service marketplaces and digitally enabled micro-factories holds promise towards democratization of innovation. In this paper, scientific, technology and infrastructure challenges are identified and if solved, the impact of these emerging technologies on product innovation and future factory organization is discussed.
Probabilistic Relational Agent-based Models
Cohen, Paul
In agent-based models (ABMs, e.g., [4, 3]) agents probabilistically change state. State can be represented as attribute values such as health status, monthly income, age, political orientation, location and so on. A population of agents has a joint state that is typically a joint distribution; for example, a population has a joint distribution over income levels and political beliefs. ABMs are a popular method for exploring the dynamics of joint states, which can be hard to estimate when attribute values depend on each other, and populations are heterogeneous in the sense that not everyone has the same distribution of attribute values, and the principal mechanism for changing attribute values is interactions between agents. For example, suppose all agents have a flu status attribute that changes conditionally - given other attributes such as age, income, and vaccination status - when agents interact. The dynamics of flu - how it moves through heterogeneous populations - can be difficult or impossible to solve, but ABMs can simulate the interactions of agents, and the flu status of these agents can be tracked over time. ABMs are no doubt engines of probabilistic inference, but it is difficult to say anything about the models that underlie the inference. This paper presents pram - Probabilistic Relational Agentbased Models - a new kind of ABM with design influences from compartmental models (e.g., [1]) and probabilistic relational models (PRMs; e.g., [2]).
Harold Cohen and AARON
Cohen, Paul (Arizona State University)
The images of astonishing complexity and breathtaking images were black and white. Cohen colored them by color that Cohen regarded as superior to his own hand. (figure 3). But Cohen's question had always been, For the next two decades, Cohen worked on algorithms "What are the minimum conditions under which a for color and composition. In 1995, he built set of marks functions as an image?" and his work and exhibited a painting machine at the Boston since about 2010 is comparatively minimalist.
Steps Towards Programs that Manage Uncertainty
Cohen, Paul
Reasoning under uncertainty in Al hats come to mean assessing the credibility of hypotheses inferred from evidence. But techniques for assessing credibility do not tell a problem solver what to do when it is uncertain. This is the focus of our current research. We have developed a medical expert system called MUM, for Managing Uncertainty in Medicine, that plans diagnostic sequences of questions, tests, and treatments. This paper describes the kinds of problems that MUM was designed to solve and gives a brief description of its architecture. More recently, we have built an empty version of MUM called MU, and used it to reimplement MUM and a small diagnostic system for plant pathology. The latter part of the paper describes the features of MU that make it appropriate for building expert systems that manage uncertainty.
Modifiable Combining Functions
Cohen, Paul, Shafer, Glenn, Shenoy, Prakash P.
Modifiable combining functions are a synthesis of two common approaches to combining evidence. They offer many of the advantages of these approaches and avoid some disadvantages. Because they facilitate the acquisition, representation, explanation, and modification of knowledge about combinations of evidence, they are proposed as a tool for knowledge engineers who build systems that reason under uncertainty, not as a normative theory of evidence.
A Framework for Teaching and Executing Verb Phrases
Hewlett, Daniel (University of Arizona) | Walsh, Thomas J (University of Arizona) | Cohen, Paul (University of Arizona)
This paper describes a framework for an agent to learn verb-phrase meanings from human teachers and combine these models with environmental dynamics so the agent can enact verb commands from the human teacher. This style of human/agent interaction allows the human teacher to issue natural-language commands and demonstrate ground actions, thereby alleviating the need for advanced teaching interfaces or difficult goal encodings. The framework extends prior work in apprenticeship learning and builds off of recent advancements in learning to recognize activities and modeling domains with multiple objects. In our studies, we show how to both learn a verb model and turn it into reward and heuristic functions that can then be composed with a dynamics model. The resulting "combined model" can then be efficiently searched by a sample-based planner which determines a policy for enacting a verb command in a given environment. Our experiments with a simulated robot domain show this framework can be used to quickly teach verb commands that the agent can then enact in new environments.
Bootstrap Voting Experts
Hewlett, Daniel (University of Arizona) | Cohen, Paul (University of Arizona)
Bootstrap Voting Experts (BVE) is an extension to the Voting Experts algorithm for unsupervised chunking of sequences. BVE generates a series of segmentations, each of which incorporates knowledge gained from the previous segmentation. We show that this method of bootstrapping improves the performance of Voting Experts in a variety of unsupervised word segmentation scenarios, and generally improves both precision and recall of the algorithm. We also show that Minimum Description Length (MDL) can be used to choose nearly optimal parameters for Voting Experts in an unsupervised manner.