Keywords: liquid alloys, microstratification, dispersed particles, spontaneous dispersion, criteria for true (entropic) spontaneous dispersion, mechanisms of quasi-spontaneous dispersion, methods and results for assessing size of dispersed particles.

In this study, we present the concept of interval-valued fuzzy soft point and then introduce the notions of neighborhood and quasi-neighbourhood of it in interval-valued fuzzy soft topological spaces. Separation axioms in interval-valued fuzzy soft topology, so-called $q$-$T_{i}$ for $ i=0,1,2,3,4 ,$ is introduced and some of its basic properties are also studied.

Creating self-learning algorithms, developing deep neural networks and improving other methods that "learn" for various areas of human activity is the main goal of the theory of machine learning. It helps to replace the human with a machine, aiming to increase the quality of production. The theory of artificial neural networks, which already have replaced the humans in problems of detection of moving objects, recognition of images or sounds, time series prediction, big data analysis and numerical methods remains the most dispersed branch of the theory of machine learning. Certainly, for each area of human activity it is necessary to select appropriate neural network architectures, methods of data processing and some novel tools from applied mathematics. But the universal problem for all these neural networks with specific data is the achieving the highest accuracy in short time. Such problem can be resolved by increasing sizes of architectures and improving data preprocessing, where the accuracy rises with the training time. But there is a possibility to increase the accuracy without time growing, applying optimization methods. In this survey we demonstrate existing optimization algorithms of all types, which can be used in neural networks. There are presented modifications of basic optimization algorithms, such as stochastic gradient descent, adaptive moment estimation, Newton and quasi-Newton optimization methods. But the most recent optimization algorithms are related to information geometry, for Fisher-Rao and Bregman metrics. This approach in optimization extended the theory of classic neural networks to quantum and complex-valued neural networks, due to geometric and probabilistic tools. There are provided applications of all introduced optimization algorithms, what delighted many kinds of neural networks, which can be improved by including any advanced approaches in minimization of the loss function. Afterwards, we demonstrated ways of developing optimization algorithms in further researches, engaging neural networks with progressive architectures. Classical gradient based optimizers can be replaced by fractional order, bilevel and, even, gradient free optimization methods. There is a possibility to add such analogues in graph, spiking, complex-valued, quantum and wavelet neural networks. Besides the usual problems of image recognition, time series prediction, object detection, there are many are other tasks for modern theory of machine learning, such as solving problem of quantum computations, partial differential and integro-differential equations, stochastic processes and Brownian motion, making decisions and computer algebra.

Continual learning, a crucial facet of machine learning, involves the perpetual acquisition of valuable insights from incoming data, sans the necessity for full dataset access. Esteemed as a fundamental goal in artificial intelligence, continual learning grapples with an enduring challenge—catastrophic forgetting. A proficient model must exhibit adaptability for new data assimilation and robustness to retain existing knowledge. Class-incremental learning (CIL) aids the gradual integration of knowledge from newly introduced classes, forming a universal classifier. However, directly training the model with fresh class instances triggers a problem—forgetting distinguishing features of prior classes, causing a performance decline. Addressing such issues in machine learning, this survey aims to delineate significant challenges, outcomes, and recent advancements, including our contributions to CIL techniques, especially in image classification.