Lossy compression of matrices by black-box optimisation of mixed integer nonlinear programming
arXiv:2204.10579 · doi:10.1038/s41598-022-19763-8
Abstract
In edge computing, suppressing data size is a challenge for machine learning models that perform complex tasks such as autonomous driving, in which computational resources (speed, memory size and power) are limited. Efficient lossy compression of matrix data has been introduced by decomposing it into the product of an integer and real matrices. However, its optimisation is difficult as it requires simultaneous optimisation of an integer and real variables. In this paper, we improve this optimisation by utilising recently developed black-box optimisation (BBO) algorithms with an Ising solver for integer variables. In addition, the algorithm can be used to solve mixed-integer programming problems that are linear and non-linear in terms of real and integer variables, respectively. The differences between the choice of Ising solvers (simulated annealing, quantum annealing and simulated quenching) and the strategies of the BBO algorithms (BOCS, FMQA and their variations) are discussed for further development of the BBO techniques.
11 pages, 7 figures
References in corpus (9)
- Very Deep Convolutional Networks for Large-Scale Image Recognition
- Application of QUBO solver using black-box optimization to structural design for resonance avoidance
- Convergence of Quantum Annealing with Real-Time Schrodinger Dynamics
- Benchmark test of Black-box optimization using D-Wave quantum annealer
- Tackling the challenge of a huge materials science search space with quantum-inspired annealing
- Quantum-Classical Computational Molecular Design of Deuterated High-Efficiency OLED Emitters
- Lossy compression of statistical data using quantum annealer
- Bayesian Variational Optimization for Combinatorial Spaces
- Combinatorial Black-box Optimization for Vehicle Design Problem