Arrow Research search

Author name cluster

Gerald DeJong

Possible papers associated with this exact author name in Arrow. This page groups case-insensitive exact name matches and is not a full identity disambiguation profile.

25 papers
2 author rows

Possible papers

25

TIST Journal 2012 Journal Article

An Ensemble Architecture for Learning Complex Problem-Solving Techniques from Demonstration

  • Xiaoqin Shelley Zhang
  • Bhavesh Shrestha
  • Sungwook Yoon
  • Subbarao Kambhampati
  • Phillip DiBona
  • Jinhong K. Guo
  • Daniel McFarlane
  • Martin O. Hofmann

We present a novel ensemble architecture for learning problem-solving techniques from a very small number of expert solutions and demonstrate its effectiveness in a complex real-world domain. The key feature of our “Generalized Integrated Learning Architecture” (GILA) is a set of heterogeneous independent learning and reasoning (ILR) components, coordinated by a central meta-reasoning executive (MRE). The ILRs are weakly coupled in the sense that all coordination during learning and performance happens through the MRE. Each ILR learns independently from a small number of expert demonstrations of a complex task. During performance, each ILR proposes partial solutions to subproblems posed by the MRE, which are then selected from and pieced together by the MRE to produce a complete solution. The heterogeneity of the learner-reasoners allows both learning and problem solving to be more effective because their abilities and biases are complementary and synergistic. We describe the application of this novel learning and problem solving architecture to the domain of airspace management, where multiple requests for the use of airspaces need to be deconflicted, reconciled, and managed automatically. Formal evaluations show that our system performs as well as or better than humans after learning from the same training data. Furthermore, GILA outperforms any individual ILR run in isolation, thus demonstrating the power of the ensemble architecture for learning and problem solving.

IJCAI Conference 2007 Conference Paper

  • Shiau Hong Lim
  • Li-Lun Wang
  • Gerald DeJong

Choosing good features to represent objects can be crucial to the success of supervised machine learning algorithms. Good high-level features are those that concentrate information about the classification task. Such features can often be constructed as non-linear combinations of raw or native input features such as the pixels of an image. Using many nonlinear combinations, as do SVMs, can dilute the classification information necessitating many training examples. On the other hand, searching even a modestly-expressive space of nonlinear functions for high-information ones can be intractable. We describe an approach to feature construction where task-relevant discriminative features are automatically constructed, guided by an explanation-based interaction of training examples and prior domain knowledge. We show that in the challenging task of distinguishing handwritten Chinese characters, our automatic feature-construction approach performs particularly well on the most difficult and complex character pairs.

ICAPS Conference 2006 Conference Paper

Explanation-Based Acquisition of Planning Operators

  • Geoffrey Levine
  • Gerald DeJong

Classical planning algorithms require that their operators be simple in order for planning to be tractable. However, the complexities of real world domains suggest that, in order to be accurate, planning operators must be complex. We demonstrate how, by taking advantage of background knowledge and the distribution of planning problems encountered, it is possible to automatically construct planning operators that are both reliable and succinct. The acquired operator is an encapsulated control loop that is specialized to best fit observed world behavior. Succinctness is achieved by publishing to the planner only those conditions required to succeed over the estimated distribution of problems. We demonstrate the acquisition of a context-appropriate "take-off" operator that can successfully control a complex flight simulator.

ICML Conference 2005 Conference Paper

Explanation-Augmented SVM: an approach to incorporating domain knowledge into SVM learning

  • Qiang Sun
  • Gerald DeJong

We introduce a novel approach to incorporating domain knowledge into Support Vector Machines to improve their example efficiency. Domain knowledge is used in an Explanation Based Learning fashion to build justifications or explanations for why the training examples are assigned their given class labels. Explanations bias the large margin classifier through the interaction of training examples and domain knowledge. We develop a new learning algorithm for this Explanation-Augmented SVM (EA-SVM). It naturally extends to imperfect knowledge, a stumbling block to conventional EBL. Experimental results confirm desirable properties predicted by the analysis and demonstrate the approach on three domains.

AIJ Journal 1996 Journal Article

A statistical approach to adaptive problem solving

  • Jonathan Gratch
  • Gerald DeJong

Domain independent general purpose problem solving techniques are desirable from the standpoints of software engineering and human computer interaction. They employ declarative and modular knowledge representations and present a constant homogeneous interface to the user, untainted by the peculiarities of the specific domain of interest. Unfortunately, this very insulation from domain details often precludes effective problem solving behavior. General approaches have proven successful in complex real-world situations only after a tedious cycle of manual experimentation and modification. Machine learning offers the prospect of automating this adaptation cycle, reducing the burden of domain specific tuning and reconciling the conflicting needs of generality and efficacy. A principal impediment to adaptive techniques is the utility problem: even if the acquired information is accurate and is helpful in isolated cases, it may degrade overall problem solving performance under difficult to predict circumstances. We develop a formal characterization of the utility problem and introduce COMPOSER, a statistically rigorous learning approach which avoids the utility problem. COMPOSER has been successfully applied to learning heuristics for planning and scheduling systems. This article includes theoretical results and an extensive empirical evaluation. The approach is shown to outperform significantly several other leading approaches to the utility problem.

IJCAI Conference 1995 Conference Paper

Extending Classical Planning to Real-World Execution with Machine Learning

  • Gerald DeJong
  • SiOtt Bennett

In previous work (Bennett 1993 DeJong and Bennetl 1993) we proposed a machine learning approach called permissive planning to extend classical planning into the realm of real world plan execution Our prior results have been favorable but empirical (Bennetl and DeJong 1991) Here we examine the analytic foundations of our empirical success We advance a formal account of realworld planning adequacy We prove that permissive planning does what it claims to do it probabilistically achieves adequate real-world performance or guarantees that no adequate real-world planning behavior is possible within the flexibility allowed We prove thai the approach scales tractably We prove that restrictions are necessary without them permissive planning is impossible We also show how these restrictions can be quite naturally met through schema based planning and explanation-based learning

ICAPS Conference 1994 Conference Paper

Constructing Simplified Plans Via Truth Criteria Approximation

  • Steve A. Chien
  • Gerald DeJong

Thecombination of incremental reasoning andEBL holdsbothintu This paper has presented an approachto dealing theintuitive with the complexityof explanation-basedlearnsumptions and ing plans in complexdomains. This approach uses a simplifiedalgorithmto constructplans, and tractable. Wi employslater refinementsto repair bugsin conterknowledge structed plans. This algorithmhas the theoretical adequatereaso properties of completenessand convergenceupon sistentwithex soundness. This incremental reasoning planning reasoning. Fr and learning algorithmhas been implemented ustalreasoning ing a partial-order constraint postingplannerand certaincondit empiricallycompared to a conventionalexhaustive beshown tored reasoningpartial-order constraint-postingplanner Thispaper and learning algorithm. This comparisonshowed that: 1) incrementalreasoningsignificantly remental reason ducedlearning costs compared to exhaustivereatoreffects (soning; 2) Explanation-basedLearning(EBL) niques descri duced failures from incremental reasoning; and plannerconstr 3) EBLwith incrementalreasoningrequired less tivesubgoal search to solve problemsthan EBLwith exhausnerexpands i tive reaoning. construct a v planisfound.

AAAI Conference 1993 Conference Paper

Permissive Planning: A Machine Learning Approach to Linking Internal and External Worlds

  • Gerald DeJong

Because complex real-world domains defy perfect formalization, real-world planners must be able to cope with incorrect domain knowledge. This paper offers a theoreticalfhmework fmpemissiveplanning, a machine leamingmethodforimprovingthereal-world behaviorofplanners. Permissive planning aims to acquire techniques that tolerate the inevitable mismatch between the planner’ s internal beliefs and the external world. Unlike the reactive approach tothis mismatch, permissive planning embraces projection. The method is both problem-iudependent and domain-independent. Unlike classical planning, permissive planning does not exclude real-world performance from the formal definition of planning.

ICRA Conference 1985 Conference Paper

Explanation-based manipulator learning: Acquisition of planning ability through observation

  • Alberto Maria Segre
  • Gerald DeJong

This paper describes a robot manipulator system currently under development which learns from observation. The system improves its problem-solving capabilities through the acquisition of task-related concepts. The system observes manipulator command sequences that solve problems currently beyond its own panning abilities. General problem-solving schemata are automatically constructed via a knowledge-based analysis of how the observed command sequence achieved the goal. This learning technique is based on explanatory schema acquisition. It is a knowledge-based approach, requiring sufficient background knowledge to understand the observed sequence. The acquired schemata serve two purposes: they allow the system to solve problems that were previously unsolvable, and they aid in the understanding of later observations.

AAAI Conference 1982 Conference Paper

Automatic Schema Acquisition in a Natural Language Environment

  • Gerald DeJong

This paper outlines an approach to schema acquisition. The approach, called explanatory schema acquisition is applicable in problems solving situations and is heavily knowledge-based. Basically, learning is viewed as a fundamental part of the understanding process. Understanding a situation for which there is no existing schema involves generalizing the new event into a nascent schema. The new schema is then available to aid in future processing and can be further refined via that processing. This approach to learning is unique in several respects: it is not inductive and so is capable of one trial learning, it does not depend on failures to drive the learning process, and it is incremental and learns comparatively slowly. The learning procedure is outlined briefly with an example, a taxonomy of situations involving explanatory schema acquisition is given, and there is a brief discussion on the scope of the learning mechanism.

v2026.09.13