Design Strategy Network: A deep hierarchical framework to represent generative design strategies in complex action spaces

• URL: http://arxiv.org/abs/2110.03760v1
• Date: Thu, 7 Oct 2021 19:29:40 GMT
• Title: Design Strategy Network: A deep hierarchical framework to represent generative design strategies in complex action spaces
• Authors: Ayush Raina, Jonathan Cagan, Christopher McComb
• Abstract summary: This work introduces Design Strategy Network (DSN), a data-driven deep hierarchical framework that learns strategies over arbitrary complex action spaces. The hierarchical architecture decomposes every action decision into first predicting a preferred spatial region in the design space. Results show that DSNs significantly outperform non-hierarchical methods of policy representation.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Generative design problems often encompass complex action spaces that may be divergent over time, contain state-dependent constraints, or involve hybrid (discrete and continuous) domains. To address those challenges, this work introduces Design Strategy Network (DSN), a data-driven deep hierarchical framework that can learn strategies over these arbitrary complex action spaces. The hierarchical architecture decomposes every action decision into first predicting a preferred spatial region in the design space and then outputting a probability distribution over a set of possible actions from that region. This framework comprises a convolutional encoder to work with image-based design state representations, a multi-layer perceptron to predict a spatial region, and a weight-sharing network to generate a probability distribution over unordered set-based inputs of feasible actions. Applied to a truss design study, the framework learns to predict the actions of human designers in the study, capturing their truss generation strategies in the process. Results show that DSNs significantly outperform non-hierarchical methods of policy representation, demonstrating their superiority in complex action space problems.

Related papers

• Learning Logic Specifications for Policy Guidance in POMDPs: an Inductive Logic Programming Approach [57.788675205519986]
  We learn high-quality traces from POMDP executions generated by any solver. We exploit data- and time-efficient Indu Logic Programming (ILP) to generate interpretable belief-based policy specifications. We show that learneds expressed in Answer Set Programming (ASP) yield performance superior to neural networks and similar to optimal handcrafted task-specifics within lower computational time.
  arXiv  Detail & Related papers  (2024-02-29T15:36:01Z)
• HCVP: Leveraging Hierarchical Contrastive Visual Prompt for Domain Generalization [69.33162366130887]
  Domain Generalization (DG) endeavors to create machine learning models that excel in unseen scenarios by learning invariant features. We introduce a novel method designed to supplement the model with domain-level and task-specific characteristics. This approach aims to guide the model in more effectively separating invariant features from specific characteristics, thereby boosting the generalization.
  arXiv  Detail & Related papers  (2024-01-18T04:23:21Z)
• Semantic Probabilistic Layers for Neuro-Symbolic Learning [83.25785999205932]
  We design a predictive layer for structured-output prediction (SOP) It can be plugged into any neural network guaranteeing its predictions are consistent with a set of predefined symbolic constraints. Our Semantic Probabilistic Layer (SPL) can model intricate correlations, and hard constraints, over a structured output space.
  arXiv  Detail & Related papers  (2022-06-01T12:02:38Z)
• Planning from Pixels in Environments with Combinatorially Hard Search Spaces [14.897437359519456]
  A recent surge of interest in this field brought advances that yield good performance in tasks ranging from arcade games to continuous control. We present a method that learns to represent its environment as a latent graph. We show that our methods achieves strong generalizations or in an offline RL paradigm which only provides low-quality trajectories.
  arXiv  Detail & Related papers  (2021-10-12T16:38:08Z)
• Hierarchical Reinforcement Learning Framework for Stochastic Spaceflight Campaign Design [5.381116150823982]
  This paper develops a hierarchical reinforcement learning architecture for spaceflight campaign design under uncertainty. It is applied to a set of human lunar exploration campaign scenarios with uncertain in-situ resource utilization (ISRU) performance.
  arXiv  Detail & Related papers  (2021-03-16T11:17:02Z)
• Jump Operator Planning: Goal-Conditioned Policy Ensembles and Zero-Shot Transfer [71.44215606325005]
  We propose a novel framework called Jump-Operator Dynamic Programming for quickly computing solutions within a super-exponential space of sequential sub-goal tasks. This approach involves controlling over an ensemble of reusable goal-conditioned polices functioning as temporally extended actions. We then identify classes of objective functions on this subspace whose solutions are invariant to the grounding, resulting in optimal zero-shot transfer.
  arXiv  Detail & Related papers  (2020-07-06T05:13:20Z)
• Deep hierarchical pooling design for cross-granularity action recognition [14.696233190562936]
  We introduce a novel hierarchical aggregation design that captures different levels of temporal granularity in action recognition. Learning the combination of operations in this network -- which best fits a given ground-truth -- is obtained by solving a constrained minimization problem. Besides being principled and well grounded, the proposed hierarchical pooling is also video-length and resilient to misalignments in actions.
  arXiv  Detail & Related papers  (2020-06-08T11:03:54Z)
• Latent Space Roadmap for Visual Action Planning of Deformable and Rigid Object Manipulation [74.88956115580388]
  Planning is performed in a low-dimensional latent state space that embeds images. Our framework consists of two main components: a Visual Foresight Module (VFM) that generates a visual plan as a sequence of images, and an Action Proposal Network (APN) that predicts the actions between them.
  arXiv  Detail & Related papers  (2020-03-19T18:43:26Z)
• Local Propagation in Constraint-based Neural Network [77.37829055999238]
  We study a constraint-based representation of neural network architectures. We investigate a simple optimization procedure that is well suited to fulfil the so-called architectural constraints.
  arXiv  Detail & Related papers  (2020-02-18T16:47:38Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.