HW-FlowQ: A Multi-Abstraction Level HW-CNN Co-design Quantization Methodology

2021 ◽  
Vol 20 (5s) ◽  
pp. 1-25
Author(s):  
Nael Fasfous ◽  
Manoj Rohit Vemparala ◽  
Alexander Frickenstein ◽  
Emanuele Valpreda ◽  
Driton Salihu ◽  
...  

Model compression through quantization is commonly applied to convolutional neural networks (CNNs) deployed on compute and memory-constrained embedded platforms. Different layers of the CNN can have varying degrees of numerical precision for both weights and activations, resulting in a large search space. Together with the hardware (HW) design space, the challenge of finding the globally optimal HW-CNN combination for a given application becomes daunting. To this end, we propose HW-FlowQ, a systematic approach that enables the co-design of the target hardware platform and the compressed CNN model through quantization. The search space is viewed at three levels of abstraction, allowing for an iterative approach for narrowing down the solution space before reaching a high-fidelity CNN hardware modeling tool, capable of capturing the effects of mixed-precision quantization strategies on different hardware architectures (processing unit counts, memory levels, cost models, dataflows) and two types of computation engines (bit-parallel vectorized, bit-serial). To combine both worlds, a multi-objective non-dominated sorting genetic algorithm (NSGA-II) is leveraged to establish a Pareto-optimal set of quantization strategies for the target HW-metrics at each abstraction level. HW-FlowQ detects optima in a discrete search space and maximizes the task-related accuracy of the underlying CNN while minimizing hardware-related costs. The Pareto-front approach keeps the design space open to a range of non-dominated solutions before refining the design to a more detailed level of abstraction. With equivalent prediction accuracy, we improve the energy and latency by 20% and 45% respectively for ResNet56 compared to existing mixed-precision search methods.

Author(s):  
Giacomo Kolks ◽  
Jürgen Weber

In contrast to rotational hydraulic displacement units, such as pumps or motors, conventional hydraulic cylinder actuators do not allow a continuous variation of their displacement quantity: the piston area is regarded constant. In order to adapt to varying load and velocity requirements in a load cycle under torque restrictions of the driving motor, cylinder drives often implement pumps with variable displacement. In this paper, cylinders with discretely variable effective piston area by means of variable circuitry of multi-chamber cylinders are discussed. Hydraulic symmetry or constant asymmetry of the hydraulic cylinder are traits of the cylinder that are required to fit the cylinder to pump structures for closed-circuit displacement control, as given in electro-hydrostatic compact drives (ECD). A methodology to generate all possible solutions of variable area cylinders under the constraint of ECD requirements is proposed. A comprehensive description of the solution space is given, based on combinatorics and solution of equation systems. The methodology dealing with abstract cylinder areas is backed up by a general approach to describe the mechanical cylinder design space to combine multiple cylinder areas in one structural unit. Examples for design of three and four area cylinders are given and results are discussed. The paper concludes with the development of a demonstrator design to allow experimental validation in a subsequent step.


2022 ◽  
Vol 12 ◽  
Author(s):  
Sarah Susanna Hoppler ◽  
Robin Segerer ◽  
Jana Nikitin

Social interactions are essential aspects of social relationships. Despite their centrality, there is a lack of a standardized approach to systematize social interactions. The present research developed (Study 1) and tested (Study 2) a taxonomy of social interactions. In Study 1 (5,676 descriptions of social interactions from N = 708 participants, age range 18–83 years), we combined a bottom-up approach based on the grounded theory with a top-down approach integrating existing empirical and theoretical literature to develop the taxonomy. The resulting taxonomy (APRACE) comprises the components Actor, Partner, Relation, Activities, Context, and Evaluation, each specified by features on three levels of abstraction. A social situation can be described by a combination of the components and their features on the respective abstraction level. Study 2 tested the APRACE using another dataset (N = 303, age range 18–88 years) with 1,899 descriptions of social interactions. The index scores of the six components, the frequencies of the features on the most abstract level, and their correlations were largely consistent across both studies, which supports the generalizability of the APRACE. The APRACE offers a generalizable tool for the comprehensive, parsimonious, and systematic description of social interactions and, thus, enables networked research on social interactions and application in a number of practical fields.


2016 ◽  
Vol 19 (1) ◽  
pp. 115-122 ◽  
Author(s):  
Milan Cisty ◽  
Zbynek Bajtek ◽  
Lubomir Celar

In this work, an optimal design of a water distribution network is proposed for large irrigation networks. The proposed approach is built upon an existing optimization method (NSGA-II), but the authors are proposing its effective application in a new two-step optimization process. The aim of the paper is to demonstrate that not only is the choice of method important for obtaining good optimization results, but also how that method is applied. The proposed methodology utilizes as its most important feature the ensemble approach, in which more optimization runs cooperate and are used together. The authors assume that the main problem in finding the optimal solution for a water distribution optimization problem is the very large size of the search space in which the optimal solution should be found. In the proposed method, a reduction of the search space is suggested, so the final solution is thus easier to find and offers greater guarantees of accuracy (closeness to the global optimum). The method has been successfully tested on a large benchmark irrigation network.


Author(s):  
M Vasile ◽  
F Zuiani

This article presents an algorithm for multi-objective optimization that blends together a number of heuristics. A population of agents combines heuristics that aim at exploring the search space both globally and in a neighbourhood of each agent. These heuristics are complemented with a combination of a local and global archive. The novel agent-based algorithm is tested at first on a set of standard problems and then on three specific problems in space trajectory design. Its performance is compared against a number of state-of-the-art multi-objective optimization algorithms that use the Pareto dominance as selection criterion: non-dominated sorting genetic algorithm (NSGA-II), Pareto archived evolution strategy (PAES), multiple objective particle swarm optimization (MOPSO), and multiple trajectory search (MTS). The results demonstrate that the agent-based search can identify parts of the Pareto set that the other algorithms were not able to capture. Furthermore, convergence is statistically better although the variance of the results is in some cases higher.


2011 ◽  
Vol 421 ◽  
pp. 559-563
Author(s):  
Yong Chao Gao ◽  
Li Mei Liu ◽  
Heng Qian ◽  
Ding Wang

The scale and complexity of search space are important factors deciding the solving difficulty of an optimization problem. The information of solution space may lead searching to optimal solutions. Based on this, an algorithm for combinatorial optimization is proposed. This algorithm makes use of the good solutions found by intelligent algorithms, contracts the search space and partitions it into one or several optimal regions by backbones of combinatorial optimization solutions. And optimization of small-scale problems is carried out in optimal regions. Statistical analysis is not necessary before or through the solving process in this algorithm, and solution information is used to estimate the landscape of search space, which enhances the speed of solving and solution quality. The algorithm breaks a new path for solving combinatorial optimization problems, and the results of experiments also testify its efficiency.


Author(s):  
Shengtao Zhou ◽  
Frank Lemmer ◽  
Wei Yu ◽  
Po Wen Cheng ◽  
Chao Li ◽  
...  

Abstract The design and manufacturing cost of substructures is a major component of the total expenditure for a floating wind project. Applying optimization techniques to hull shape designs has become an effective way to reduce the life-cycle cost of a floating wind system. The mooring system is regarded as the component with the highest risk, mainly due to the poor accessibility. This paper extends the previous work by investigating the influences of the mooring design on the optimization process of a semisubmersible substructure. Two optimization loops are set up. In the first loop, only the main dimensions of a semi-submersible platform are parameterized without considering mooring lines (keep a constant mooring design). Nevertheless, the second loop introduces additional variables of the mooring lines. The objective is to minimize the tower-top displacement, fairlead fatigue damage, which are calculated by the in-house nonlinear dynamic simulation code SLOW, and the manufacturing cost of platform and mooring lines. The multi-objective optimization algorithm NSGA-II is employed to search for the optimal designs within the defined design space. The design space and the Pareto fronts are compared between the two optimizations. It is found that, although the mooring design does not have a significant impact on the platform design space, one obtains a different optimal set (Pareto front) if the mooring design and mooring loads are introduced into the platform optimization process. The results of this study are expected to give a better understanding in the relationship between platform and mooring design and serve as a basis for the optimization process of semi-submersible floating wind turbines.


Energies ◽  
2018 ◽  
Vol 12 (1) ◽  
pp. 34 ◽  
Author(s):  
Germán Ramos Ruiz ◽  
Eva Lucas Segarra ◽  
Carlos Fernández Bandera

There is growing concern about how to mitigate climate change in which the reduction of CO2 emissions plays an important role. Buildings have gained attention in recent years since they are responsible for around 30% of greenhouse gases. In this context, advance control strategies to optimize HVAC systems are necessary because they can provide significant energy savings whilst maintaining indoor thermal comfort. Simulation-based model predictive control (MPC) procedures allow an increase in building energy performance through the smart control of HVAC systems. The paper presents a methodology that overcomes one of the critical issues in using detailed building energy models in MPC optimizations—computational time. Through a case study, the methodology explains how to resolve this issue. Three main novel approaches are developed: a reduction in the search space for the genetic algorithm (NSGA-II) thanks to the use of the curve of free oscillation; a reduction in convergence time based on a process of two linked stages; and, finally, a methodology to measure, in a combined way, the temporal convergence of the algorithm and the precision of the obtained solution.


Sign in / Sign up

Export Citation Format

Share Document