Reinforcement Learning Based Quantization Strategy Optimal Assignment Algorithm for Mixed Precision

The quantization algorithm compresses the original network by reducing the numerical bit width of the model,which improves the computation speed. Because different layers have different redundancy and sensitivity to databit width. Reducing the data bit width will result in a loss of accuracy. Therefore, it is difficult to determinethe optimal bit width for different parts of the network with guaranteed accuracy. Mixed precision quantizationcan effectively reduce the amount of computation while keeping the model accuracy basically unchanged. In thispaper, a hardware-aware mixed precision quantization strategy optimal assignment algorithm adapted to low bitwidth is proposed, and reinforcement learning is used to automatically predict the mixed precision that meets theconstraints of hardware resources. In the state-space design, the standard deviation of weights is used to measurethe distribution difference of data, the execution speed feedback of simulated neural network accelerator inferenceis used as the environment to limit the action space of the agent, and the accuracy of the quantization model afterretraining is used as the reward function to guide the agent to carry out deep reinforcement learning training. Theexperimental results show that the proposed method obtains a suitable model layer-by-layer quantization strategyunder the condition that the computational resources are satisfied, and themodel accuracy is effectively improved.The proposed method has strong intelligence and certain universality and has strong application potential in thefield of mixed precision quantization and embedded neural network model deployment.

Activation Redistribution Based Hybrid Asymmetric Quantization Method of Neural Networks

The demand for adopting neural networks in resource-constrained embedded devices is continuously increasing.Quantization is one of the most promising solutions to reduce computational cost and memory storage on embedded devices.In order to reduce the complexity and overhead of deploying neural networks on Integeronly hardware,most current quantization methods use a symmetric quantization mapping strategy to quantize a floating-point neural network into an integer network.However,although symmetric quantization has the advantage of easier implementation,it is sub-optimal for cases where the range could be skewed and not symmetric.This often comes at the cost of lower accuracy.This paper proposed an activation redistribution-based hybrid asymmetric quantizationmethod for neural networks.The proposedmethod takes data distribution into consideration and can resolve the contradiction between the quantization accuracy and the ease of implementation,balance the trade-off between clipping range and quantization resolution,and thus improve the accuracy of the quantized neural network.The experimental results indicate that the accuracy of the proposed method is 2.02%and 5.52%higher than the traditional symmetric quantization method for classification and detection tasks,respectively.The proposed method paves the way for computationally intensive neural network models to be deployed on devices with limited computing resources.Codes will be available on https://github.com/ycjcy/Hybrid-Asymmetric-Quantization.

In situ calibrated angle between the quantization axis and the propagating direction of the light field for trapping neutral atoms

The recently developed magic-intensity trapping technique of neutral atoms efficiently mitigates the detrimental effect of light shifts on atomic qubits and substantially enhances the coherence time. This technique relies on applying a bias magnetic field precisely parallel to the wave vector of a circularly polarized trapping laser field. However, due to the presence of the vector light shift experienced by the trapped atoms, it is challenging to precisely define a parallel magnetic field, especially at a low bias magnetic field strength, for the magic-intensity trapping of85Rb qubits. In this work, we present a method to calibrate the angle between the bias magnetic field and the trapping laser field with the compensating magnetic fields in the other two directions orthogonal to the bias magnetic field direction. Experimentally, with a constantdepth trap and a fixed bias magnetic field, we measure the respective resonant frequencies of the atomic qubits in a linearly polarized trap and a circularly polarized one via the conventional microwave Rabi spectra with different compensating magnetic fields and obtain the corresponding total magnetic fields via the respective resonant frequencies using the Breit–Rabi formula. With known total magnetic fields, the angle is a function of the other two compensating magnetic fields.Finally, the projection value of the angle on either of the directions orthogonal to the bias magnetic field direction can be reduced to 0(4)° by applying specific compensating magnetic fields. The measurement error is mainly attributed to the fluctuation of atomic temperature. Moreover, it also demonstrates that, even for a small angle, the effect is strong enough to cause large decoherence of Rabi oscillation in a magic-intensity trap. Although the compensation method demonstrated here is explored for the magic-intensity trapping technique, it can be applied to a variety of similar precision measurements with trapped neutral atoms.

Network-Assisted Full-Duplex Cell-Free mmWave Massive MIMO Systems with DAC Quantization and Fronthaul Compression

In this paper,we investigate networkassisted full-duplex(NAFD)cell-free millimeter-wave(mmWave)massive multiple-input multiple-output(MIMO)systems with digital-to-analog converter(DAC)quantization and fronthaul compression.We propose to maximize the weighted uplink and downlink sum rate by jointly optimizing the power allocation of both the transmitting remote antenna units(T-RAUs)and uplink users and the variances of the downlink and uplink fronthaul compression noises.To deal with this challenging problem,we further apply a successive convex approximation(SCA)method to handle the non-convex bidirectional limited-capacity fronthaul constraints.The simulation results verify the convergence of the proposed SCA-based algorithm and analyze the impact of fronthaul capacity and DAC quantization on the spectral efficiency of the NAFD cell-free mmWave massive MIMO systems.Moreover,some insightful conclusions are obtained through the comparisons of spectral efficiency,which shows that NAFD achieves better performance gains than cotime co-frequency full-duplex cloud radio access network(CCFD C-RAN)in the cases of practical limited-resolution DACs.Specifically,their performance gaps with 8-bit DAC quantization are larger than that with1-bit DAC quantization,which attains a 5.5-fold improvement.

Image Steganography by Pixel-Value Differencing Using General Quantization Ranges

A new steganographic method by pixel-value differencing(PVD)using general quantization ranges of pixel pairs’difference values is proposed.The objective of this method is to provide a data embedding technique with a range table with range widths not limited to powers of 2,extending PVD-based methods to enhance their flexibility and data-embedding rates without changing their capabilities to resist security attacks.Specifically,the conventional PVD technique partitions a grayscale image into 1×2 non-overlapping blocks.The entire range[0,255]of all possible absolute values of the pixel pairs’grayscale differences in the blocks is divided into multiple quantization ranges.The width of each quantization range is a power of two to facilitate the direct embedding of the bit information with high embedding rates.Without using power-of-two range widths,the embedding rates can drop using conventional embedding techniques.In contrast,the proposed method uses general quantization range widths,and a multiple-based number conversion mechanism is employed skillfully to implement the use of nonpower-of-two range widths,with each pixel pair being employed to embed a digit in the multiple-based number.All the message bits are converted into a big multiple-based number whose digits can be embedded into the pixel pairs with a higher embedding rate.Good experimental results showed the feasibility of the proposed method and its resistance to security attacks.In addition,implementation examples are provided,where the proposed method adopts non-power-of-two range widths and employsmultiple-based number conversion to expand the data-hiding and steganalysis-resisting capabilities of other PVD methods.

Learning Vector Quantization-Based Fuzzy Rules Oversampling Method

Imbalanced datasets are common in practical applications,and oversampling methods using fuzzy rules have been shown to enhance the classification performance of imbalanced data by taking into account the relationship between data attributes.However,the creation of fuzzy rules typically depends on expert knowledge,which may not fully leverage the label information in training data and may be subjective.To address this issue,a novel fuzzy rule oversampling approach is developed based on the learning vector quantization(LVQ)algorithm.In this method,the label information of the training data is utilized to determine the antecedent part of If-Then fuzzy rules by dynamically dividing attribute intervals using LVQ.Subsequently,fuzzy rules are generated and adjusted to calculate rule weights.The number of new samples to be synthesized for each rule is then computed,and samples from the minority class are synthesized based on the newly generated fuzzy rules.This results in the establishment of a fuzzy rule oversampling method based on LVQ.To evaluate the effectiveness of this method,comparative experiments are conducted on 12 publicly available imbalance datasets with five other sampling techniques in combination with the support function machine.The experimental results demonstrate that the proposed method can significantly enhance the classification algorithm across seven performance indicators,including a boost of 2.15%to 12.34%in Accuracy,6.11%to 27.06%in G-mean,and 4.69%to 18.78%in AUC.These show that the proposed method is capable of more efficiently improving the classification performance of imbalanced data.

A Novel Quantization and Model Compression Approach for Hardware Accelerators in Edge Computing

Massive computational complexity and memory requirement of artificial intelligence models impede their deploy-ability on edge computing devices of the Internet of Things(IoT).While Power-of-Two(PoT)quantization is pro-posed to improve the efficiency for edge inference of Deep Neural Networks(DNNs),existing PoT schemes require a huge amount of bit-wise manipulation and have large memory overhead,and their efficiency is bounded by the bottleneck of computation latency and memory footprint.To tackle this challenge,we present an efficient inference approach on the basis of PoT quantization and model compression.An integer-only scalar PoT quantization(IOS-PoT)is designed jointly with a distribution loss regularizer,wherein the regularizer minimizes quantization errors and training disturbances.Additionally,two-stage model compression is developed to effectively reduce memory requirement,and alleviate bandwidth usage in communications of networked heterogenous learning systems.The product look-up table(P-LUT)inference scheme is leveraged to replace bit-shifting with only indexing and addition operations for achieving low-latency computation and implementing efficient edge accelerators.Finally,comprehensive experiments on Residual Networks(ResNets)and efficient architectures with Canadian Institute for Advanced Research(CIFAR),ImageNet,and Real-world Affective Faces Database(RAF-DB)datasets,indicate that our approach achieves 2×∼10×improvement in the reduction of both weight size and computation cost in comparison to state-of-the-art methods.A P-LUT accelerator prototype is implemented on the Xilinx KV260 Field Programmable Gate Array(FPGA)platform for accelerating convolution operations,with performance results showing that P-LUT reduces memory footprint by 1.45×,achieves more than 3×power efficiency and 2×resource efficiency,compared to the conventional bit-shifting scheme.

Hierarchical Controller Synthesis Under Linear Temporal Logic Specifications Using Dynamic Quantization

Linear temporal logic(LTL)is an intuitive and expressive language to specify complex control tasks,and how to design an efficient control strategy for LTL specification is still a challenge.In this paper,we implement the dynamic quantization technique to propose a novel hierarchical control strategy for nonlinear control systems under LTL specifications.Based on the regions of interest involved in the LTL formula,an accepting path is derived first to provide a high-level solution for the controller synthesis problem.Second,we develop a dynamic quantization based approach to verify the realization of the accepting path.The realization verification results in the necessity of the controller design and a sequence of quantization regions for the controller design.Third,the techniques of dynamic quantization and abstraction-based control are combined together to establish the local-to-global control strategy.Both abstraction construction and controller design are local and dynamic,thereby resulting in the potential reduction of the computational complexity.Since each quantization region can be considered locally and individually,the proposed hierarchical mechanism is more efficient and can solve much larger problems than many existing methods.Finally,the proposed control strategy is illustrated via two examples from the path planning and tracking problems of mobile robots.

Does There Exist the Applicability Limit of PDE to Describe Physical Phenomena?—A Personal Survey of Quantization, QED, Turbulence

What does it mean to study PDE (Partial Differential Equation)? How and what to do “to claim proudly that I’m studying a certain PDE”? Newton mechanic uses mainly ODE (Ordinary Differential Equation) and describes nicely movements of Sun, Moon and Earth etc. Now, so-called quantum phenomenum is described by, say Schrödinger equation, PDE which explains both wave and particle characters after quantization of ODE. The coupled Maxwell-Dirac equation is also “quantized” and QED (Quantum Electro-Dynamics) theory is invented by physicists. Though it is said this QED gives very good coincidence between theoretical1 and experimental observed quantities, but what is the equation corresponding to QED? Or, is it possible to describe QED by “equation” in naive sense?

Quantization of Action for Elementary Particles and the Principle of Least Action

The uncertainty principle is a fundamental principle of quantum mechanics, but its exact mathematical expression cannot obtain correct results when used to solve theoretical problems such as the energy levels of hydrogen atoms, one-dimensional deep potential wells, one-dimensional harmonic oscillators, and double-slit experiments. Even after approximate treatment, the results obtained are not completely consistent with those obtained by solving Schrödinger’s equation. This indicates that further research on the uncertainty principle is necessary. Therefore, using the de Broglie matter wave hypothesis, we quantize the action of an elementary particle in natural coordinates and obtain the quantization condition and a new deterministic relation. Using this quantization condition, we obtain the energy level formulas of an elementary particle in different conditions in a classical way that is completely consistent with the results obtained by solving Schrödinger’s equation. A new physical interpretation is given for the particle eigenfunction independence of probability for an elementary particle: an elementary particle is in a particle state at the space-time point where the action is quantized, and in a wave state in the rest of the space-time region. The space-time points of particle nature and the wave regions of particle motion constitute the continuous trajectory of particle motion. When an elementary particle is in a particle state, it is localized, whereas in the wave state region, it is nonlocalized.

Finite-time H_(∞) filtering for Markov jump systems with uniform quantization

This paper is concerned with finite-time H_(∞) filtering for Markov jump systems with uniform quantization. The objective is to design quantized mode-dependent filters to ensure that the filtering error system is not only mean-square finite-time bounded but also has a prescribed finite-time H_(∞) performance. First, the case where the switching modes of the filter align with those of the MJS is considered. A numerically tractable filter design approach is proposed utilizing a mode-dependent Lyapunov function, Schur’s complement, and Dynkin’s formula. Then, the study is extended to a scenario where the switching modes of the filter can differ from those of the MJS. To address this situation, a mode-mismatched filter design approach is developed by leveraging a hidden Markov model to describe the asynchronous mode switching and the double expectation formula. Finally, a spring system model subject to a Markov chain is employed to validate the effectiveness of the quantized filter design approaches.

DNA Computing with Water Strider Based Vector Quantization for Data Storage Systems

The exponential growth of data necessitates an effective data storage scheme,which helps to effectively manage the large quantity of data.To accomplish this,Deoxyribonucleic Acid(DNA)digital data storage process can be employed,which encodes and decodes binary data to and from synthesized strands of DNA.Vector quantization(VQ)is a commonly employed scheme for image compression and the optimal codebook generation is an effective process to reach maximum compression efficiency.This article introduces a newDNAComputingwithWater StriderAlgorithm based Vector Quantization(DNAC-WSAVQ)technique for Data Storage Systems.The proposed DNAC-WSAVQ technique enables encoding data using DNA computing and then compresses it for effective data storage.Besides,the DNAC-WSAVQ model initially performsDNA encoding on the input images to generate a binary encoded form.In addition,aWater Strider algorithm with Linde-Buzo-Gray(WSA-LBG)model is applied for the compression process and thereby storage area can be considerably minimized.In order to generate optimal codebook for LBG,the WSA is applied to it.The performance validation of the DNAC-WSAVQ model is carried out and the results are inspected under several measures.The comparative study highlighted the improved outcomes of the DNAC-WSAVQ model over the existing methods.

A Secure and Effective Energy-Aware Fixed-Point Quantization Scheme for Asynchronous Federated Learning

Asynchronous federated learning(AsynFL)can effectivelymitigate the impact of heterogeneity of edge nodes on joint training while satisfying participant user privacy protection and data security.However,the frequent exchange of massive data can lead to excess communication overhead between edge and central nodes regardless of whether the federated learning(FL)algorithm uses synchronous or asynchronous aggregation.Therefore,there is an urgent need for a method that can simultaneously take into account device heterogeneity and edge node energy consumption reduction.This paper proposes a novel Fixed-point Asynchronous Federated Learning(FixedAsynFL)algorithm,which could mitigate the resource consumption caused by frequent data communication while alleviating the effect of device heterogeneity.FixedAsynFL uses fixed-point quantization to compress the local and global models in AsynFL.In order to balance energy consumption and learning accuracy,this paper proposed a quantization scale selection mechanism.This paper examines the mathematical relationship between the quantization scale and energy consumption of the computation/communication process in the FixedAsynFL.Based on considering the upper bound of quantization noise,this paper optimizes the quantization scale by minimizing communication and computation consumption.This paper performs pertinent experiments on the MNIST dataset with several edge nodes of different computing efficiency.The results show that the FixedAsynFL algorithm with an 8-bit quantization can significantly reduce the communication data size by 81.3%and save the computation energy in the training phase by 74.9%without significant loss of accuracy.According to the experimental results,we can see that the proposed AsynFixedFL algorithm can effectively solve the problem of device heterogeneity and energy consumption limitation of edge nodes.

Metaheuristics with Vector Quantization Enabled Codebook Compression Model for Secure Industrial Embedded Environment

At the present time,the Industrial Internet of Things(IIoT)has swiftly evolved and emerged,and picture data that is collected by terminal devices or IoT nodes are tied to the user's private data.The use of image sensors as an automa-tion tool for the IIoT is increasingly becoming more common.Due to the fact that this organisation transfers an enormous number of photographs at any one time,one of the most significant issues that it has is reducing the total quantity of data that is sent and,as a result,the available bandwidth,without compromising the image quality.Image compression in the sensor,on the other hand,expedites the transfer of data while simultaneously reducing bandwidth use.The traditional method of protecting sensitive data is rendered less effective in an environment dominated by IoT owing to the involvement of third parties.The image encryp-tion model provides a safe and adaptable method to protect the confidentiality of picture transformation and storage inside an IIoT system.This helps to ensure that image datasets are kept safe.The Linde–Buzo–Gray(LBG)methodology is an example of a vector quantization algorithm that is extensively used and a rela-tively new form of picture reduction known as vector quantization(VQ).As a result,the purpose of this research is to create an artificial humming bird optimi-zation approach that combines LBG-enabled codebook creation and encryption(AHBO-LBGCCE)for use in an IIoT setting.In the beginning,the AHBO-LBGCCE method used the LBG model in conjunction with the AHBO algorithm in order to construct the VQ.The Burrows-Wheeler Transform(BWT)model is used in order to accomplish codebook compression.In addition,the Blowfish algorithm is used in order to carry out the encryption procedure so that security may be attained.A comprehensive experimental investigation is carried out in order to verify the effectiveness of the proposed algorithm in comparison to other algorithms.The experimental values ensure that the suggested approach and the outcomes are examined in a variety of different perspectives in order to further enhance them.

Path Integral Quantization of Non-Natural Lagrangian

Path integral technique is discussed using Hamilton Jacobi method. The Hamilton Jacobi function of non-natural Lagrangian is obtained using separation of variables method. This function makes an important role in path integral quantization. The path integral is obtained as integration over the canonical phase space coordinates, which contains the generalized coordinate q and the generalized momentum p. One illustrative example is considered to explain the application of our formalism.

Quantization of Time Independent Damping Systems Using WKB Approximation

In this work time independent damping systems are studied using Lagrangian and Hamiltonian for time independent damping, which are present through the factor eλq. The Hamilton Jacobi equation is formulated to find the Hamilton Jacobi function S using separation of variables technique. We can form this function in compact form of two parts the first part as a function of coordinate q, and the second part as a function of time t. Finally, we find the ability of these systems to quantize through an illustrative example.

Photon Structure and Wave Function from the Vector Potential Quantization

A photon structure is advanced based on the experimental evidence and the vector potential quantization at a single photon level. It is shown that the photon is neither a point particle nor an infinite wave but behaves rather like a local “wave-corpuscle” extended over a wavelength, occupying a minimum quantization volume and guided by a non-local vector potential real wave function. The quantized vector potential oscillates over a wavelength with circular left or right polarization giving birth to orthogonal magnetic and electric fields whose amplitudes are proportional to the square of the frequency. The energy and momentum are carried by the local wave-corpuscle guided by the non-local vector potential wave function suitably normalized.

Quantization of the Kinetic Energy of Deterministic Chaos

In previous works, the theoretical and experimental deterministic scalar kinematic structures, the theoretical and experimental deterministic vector kinematic structures, the theoretical and experimental deterministic scalar dynamic structures, and the theoretical and experimental deterministic vector dynamic structures have been developed to compute the exact solution for deterministic chaos of the exponential pulsons and oscillons that is governed by the nonstationary three-dimensional Navier-Stokes equations. To explore properties of the kinetic energy, rectangular, diagonal, and triangular summations of a matrix of the kinetic energy and general terms of various sums have been used in the current paper to develop quantization of the kinetic energy of deterministic chaos. Nested structures of a cumulative energy pulson, an energy pulson of propagation, an internal energy oscillon, a diagonal energy oscillon, and an external energy oscillon have been established. In turn, the energy pulsons and oscillons include group pulsons of propagation, internal group oscillons, diagonal group oscillons, and external group oscillons. Sequentially, the group pulsons and oscillons contain wave pulsons of propagation, internal wave oscillons, diagonal wave oscillons, and external wave oscillons. Consecutively, the wave pulsons and oscillons are composed of elementary pulsons of propagation, internal elementary oscillons, diagonal elementary oscillons, and external elementary oscillons. Topology, periodicity, and integral properties of the exponential pulsons and oscillons have been studied using the novel method of the inhomogeneous Fourier expansions via eigenfunctions in coordinates and time. Symbolic computations of the exact expansions have been performed using the experimental and theoretical programming in Maple. Results of the symbolic computations have been justified by probe visualizations.

High-Efficiency Video Coder in Pruned Environment Using Adaptive Quantization Parameter Selection

The high-efficiency video coder(HEVC)is one of the most advanced techniques used in growing real-time multimedia applications today.However,they require large bandwidth for transmission through bandwidth,and bandwidth varies with different video sequences/formats.This paper proposes an adaptive information-based variable quantization matrix(AIVQM)developed for different video formats having variable energy levels.The quantization method is adapted based on video sequence using statistical analysis,improving bit budget,quality and complexity reduction.Further,to have precise control over bit rate and quality,a multi-constraint prune algorithm is proposed in the second stage of the AI-VQM technique for pre-calculating K numbers of paths.The same should be handy to selfadapt and choose one of the K-path automatically in dynamically changing bandwidth availability as per requirement after extensive testing of the proposed algorithm in the multi-constraint environment for multiple paths and evaluating the performance based on peak signal to noise ratio(PSNR),bit-budget and time complexity for different videos a noticeable improvement in rate-distortion(RD)performance is achieved.Using the proposed AIVQM technique,more feasible and efficient video sequences are achieved with less loss in PSNR than the variable quantization method(VQM)algorithm with approximately a rise of 10%–20%based on different video sequences/formats.

An Efficient Information Hiding Scheme Based on Closest Paired Tree Structure Vector Quantization

Information hiding schemes based on vector quantization （VQ） usually require lengthy VQ encoding and decoding processes. In this paper, we propose an efficient information hiding method based on closest paired tree structure vector quantization （CPTSVQ）. The simulation result shows that the execution time of the proposed scheme is much shorter than that attained by previous approaches.