Method of modelless online optimization of time calculation of finite IоT devices with provision of critically important delays for all levels of interaction

DOI: 10.31673/2412-9070.2021.023439

Abstract

The problem of managing network resources considered in terms of convex online optimization (COO) based both losses and limitations. A general wording of the COO with long-term time constraints and relevant indicators for evaluating the COO algorithm are also provided. The solution to the optimization problem is based on elements of deep machine learning.
This considers the COO with different time constraints that must be met in the long run. According to this parameter, the learner first performs a certain action, not knowing a priori neither contradictory losses nor time-varying constraints, which later appear naturally. Also, the standard loss-based COO structure was generalized to take into account both competitive losses and constraints. Unlike existing work, the focus is on a setting in which some limitations are detected after action is taken, they are acceptable for instantaneous violations, but on average must be met.
Next, a modified method of dynamic optimization of network resources in intelligent networks (DONR) is introduced in this new COO structure, where the learning element deals with different time losses, as well as different time but long-term constraints. In general, it is proved that the DONR method ensures that dynamic losses and pre-results increase sublinewise, if the accumulated variations of minimizers and constraints known as sublinear increase.
The process of development and characteristics of the developed DONR algorithm are described in detail.

Keywords: Internet of Things; quality of service; convex online optimization; artificial intelligence; deep machine learning; intelligent networks.

References
1. Методы оптимизации в машинном обучении: курс лекций. 2021 [Електронний ресурс]. URL: http://www.machinelearning.ru/wiki/index.php?title=Momo/ (дата звернення: 11.02.2021).
2. Online Convex Optimization [Електронний ресурс]. URL: https://www.cs.ubc.ca/labs/lci/mlrg/slides/online_optimization.pdf/ (дата звернення: 21.01.2021).
3. Степенко І. В. Моделювання систем [Електронний ресурс]. URL: http://web.kpi.kharkov.ua/auts/wp-content/uploads/sites/67/2017/02/MOCS_Kachanov_posobie.pdf/ (дата звернення: 25.02.2021).
4. Вітлінський В. В., Терещенко Т. О., Савіна С. С. Економіко-математичні методи та моделі оптимізації: навч. посібник. Київ: КНЕУ, 2016. 303 с.
5. CORE The world’s largest collection of open access research papers [Електронний ресурс]. URL: https://core.ac.uk/download/pdf/14053513.pdf/ (дата звернення: 15.02.2021).
6. Йоханн ван Тондер. Оптимизация интернет-магазина: Почему 95% посетителей вашего сайта ничего не покупают и как это исправить [Електронний ресурс]. URL:
https://epicentrk.ua/shop/kniga-yokhann-van-tonder-optimizatsiya-internet-magazina-pochemu-95-posetiteley-vashego-sayta-nichego-ne-pokupayut-i-kak-eto-ispr-978-5-9614-7131-1.html/ (дата звернення: 16.02.2021).
7. Besbes O., Gur Y., Zeevi A. Non-stationary stochastic optimization // Operations Research. Sep. 2015. vol. 63, no. 5. Р. 1227–1244.
8. Mahdavi M., Jin R., Yang T. Trading regret for efficiency: Online convex optimization with long term constraints // Journal of Machine Learning Research. Sep. 2012. vol. 13. Р. 2503–2528.