Image-Based Benchmarking and Visualization for Large-Scale Global Optimization

• URL: http://arxiv.org/abs/2007.12332v1
• Date: Fri, 24 Jul 2020 03:39:23 GMT
• Title: Image-Based Benchmarking and Visualization for Large-Scale Global Optimization
• Authors: Kyle Robert Harrison, Azam Asilian Bidgoli, Shahryar Rahnamayan, Kalyanmoy Deb
• Abstract summary: An image-based visualization framework is proposed that visualizes the solutions to large-scale global optimization problems as images are proposed. In the proposed framework, the pixels visualize decision variables while the entire image represents the overall solution quality. The proposed framework is then demonstrated on arbitrary benchmark problems with known optima.
• Score: 6.5447678518952115
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In the context of optimization, visualization techniques can be useful for understanding the behaviour of optimization algorithms and can even provide a means to facilitate human interaction with an optimizer. Towards this goal, an image-based visualization framework, without dimension reduction, that visualizes the solutions to large-scale global optimization problems as images is proposed. In the proposed framework, the pixels visualize decision variables while the entire image represents the overall solution quality. This framework affords a number of benefits over existing visualization techniques including enhanced scalability (in terms of the number of decision variables), facilitation of standard image processing techniques, providing nearly infinite benchmark cases, and explicit alignment with human perception. Furthermore, image-based visualization can be used to visualize the optimization process in real-time, thereby allowing the user to ascertain characteristics of the search process as it is progressing. To the best of the authors' knowledge, this is the first realization of a dimension-preserving, scalable visualization framework that embeds the inherent relationship between decision space and objective space. The proposed framework is utilized with 10 different mapping schemes on an image-reconstruction problem that encompass continuous, discrete, binary, combinatorial, constrained, dynamic, and multi-objective optimization. The proposed framework is then demonstrated on arbitrary benchmark problems with known optima. Experimental results elucidate the flexibility and demonstrate how valuable information about the search process can be gathered via the proposed visualization framework.

Related papers

• Learning Joint Models of Prediction and Optimization [56.04498536842065]
  Predict-Then-Then framework uses machine learning models to predict unknown parameters of an optimization problem from features before solving. This paper proposes an alternative method, in which optimal solutions are learned directly from the observable features by joint predictive models.
  arXiv  Detail & Related papers  (2024-09-07T19:52:14Z)
• Feature-Based Interpretable Surrogates for Optimization [0.8437187555622164]
  In this work, we investigate how we can use more general optimization rules to increase interpretability. The proposed rules do not map to a concrete solution but to a set of solutions characterized by common features. In particular, we demonstrate the improvement in solution quality that our approach offers compared to existing interpretable surrogates for optimization.
  arXiv  Detail & Related papers  (2024-09-03T13:12:49Z)
• Layered Rendering Diffusion Model for Zero-Shot Guided Image Synthesis [60.260724486834164]
  This paper introduces innovative solutions to enhance spatial controllability in diffusion models reliant on text queries. We present two key innovations: Vision Guidance and the Layered Rendering Diffusion framework. We apply our method to three practical applications: bounding box-to-image, semantic mask-to-image and image editing.
  arXiv  Detail & Related papers  (2023-11-30T10:36:19Z)
• Backpropagation of Unrolled Solvers with Folded Optimization [55.04219793298687]
  The integration of constrained optimization models as components in deep networks has led to promising advances on many specialized learning tasks. One typical strategy is algorithm unrolling, which relies on automatic differentiation through the operations of an iterative solver. This paper provides theoretical insights into the backward pass of unrolled optimization, leading to a system for generating efficiently solvable analytical models of backpropagation.
  arXiv  Detail & Related papers  (2023-01-28T01:50:42Z)
• An Interactive Knowledge-based Multi-objective Evolutionary Algorithm Framework for Practical Optimization Problems [5.387300498478744]
  This paper proposes an interactive knowledge-based evolutionary multi-objective optimization (IK-EMO) framework. It extracts hidden variable-wise relationships as knowledge from evolving high-performing solutions, shares them with users to receive feedback, and applies them back to the optimization process to improve its effectiveness. The working of the proposed IK-EMO is demonstrated on three large-scale real-world engineering design problems.
  arXiv  Detail & Related papers  (2022-09-18T16:51:01Z)
• Combinatorial Optimization for Panoptic Segmentation: An End-to-End Trainable Approach [23.281726932718232]
  We propose an end-to-end trainable architecture for simultaneous semantic and instance segmentation. Our approach shows the utility of using optimization in tandem with deep learning in a challenging large scale real-world problem.
  arXiv  Detail & Related papers  (2021-06-06T17:39:13Z)
• Weakly supervised cross-domain alignment with optimal transport [102.8572398001639]
  Cross-domain alignment between image objects and text sequences is key to many visual-language tasks. This paper investigates a novel approach for the identification and optimization of fine-grained semantic similarities between image and text entities.
  arXiv  Detail & Related papers  (2020-08-14T22:48:36Z)
• A Flexible Framework for Designing Trainable Priors with Adaptive Smoothing and Game Encoding [57.1077544780653]
  We introduce a general framework for designing and training neural network layers whose forward passes can be interpreted as solving non-smooth convex optimization problems. We focus on convex games, solved by local agents represented by the nodes of a graph and interacting through regularization functions. This approach is appealing for solving imaging problems, as it allows the use of classical image priors within deep models that are trainable end to end.
  arXiv  Detail & Related papers  (2020-06-26T08:34:54Z)
• Learning Deformable Image Registration from Optimization: Perspective, Modules, Bilevel Training and Beyond [62.730497582218284]
  We develop a new deep learning based framework to optimize a diffeomorphic model via multi-scale propagation. We conduct two groups of image registration experiments on 3D volume datasets including image-to-atlas registration on brain MRI data and image-to-image registration on liver CT data.
  arXiv  Detail & Related papers  (2020-04-30T03:23:45Z)

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.