Navigating Complexity: Advanced Optimization Techniques for Machine Learning

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Computational and Applied Mathematics".

Deadline for manuscript submissions: 1 November 2024 | Viewed by 1083

Special Issue Editors


E-Mail Website
Guest Editor
Department of Applied Mathematics, Ayandegan Institute of Higher Education, Tonekabon, Iran
Interests: computational modelling; deep learning; soft computing; performance analysis; uncertainty and indeterminacy; operations management
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Guest Editor
Section of Mathematics, International Telematic University Uninettuno, Corso Vittorio Emanuele II, Roma, Italy
Interests: fractional calculus; numerical analysis; deep learning; artificial intelligence; fuzzy mathematics

Special Issue Information

Dear Colleagues, 

The rapid advancements in machine learning have brought forth complex challenges that necessitate equally advanced optimization techniques. As machine learning finds applications in diverse sectors such as healthcare, finance, and autonomous systems, the need for optimized algorithms becomes crucial. Traditional optimization methods often fall short in navigating the high-dimensionality, non-convexity, and real-time requirements of modern machine learning problems. This Special Issue aims to explore the frontier of optimization techniques designed to address these complexities in machine learning applications. It will feature contributions that present innovative algorithms, theoretical insights, and real-world applications to accelerate and refine machine learning models. Potential topics include, but are not limited to: advanced gradient descent variants in machine learning, Smith-objective optimization for hyperparameter tuning, meta-learning for algorithmic optimization, Bayesian optimization in machine learning, optimization under uncertainty and indeterminacy in machine learning, soft computing approaches for machine learning optimization, scalability challenges in machine learning optimization, real-world applications of optimized machine learning algorithms, performance analysis of new optimization techniques in machine learning, and convergence rates and acceleration methods in optimization for machine learning.

Dr. Seyyed Ahmad Edalatpanah
Dr. Mohammad Javad Ebadi
Guest Editors

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • machine learning optimization
  • advanced gradient descent
  • multi-objective optimization
  • Bayesian optimization
  • soft computing
  • scalability in optimization
  • convergence and acceleration techniques

Published Papers (1 paper)

Order results
Result details
Select all
Export citation of selected articles as:

Research

15 pages, 1325 KiB  
Article
Approximate Solution of PHI-Four and Allen–Cahn Equations Using Non-Polynomial Spline Technique
by Mehboob Ul Haq, Sirajul Haq, Ihteram Ali and Mohammad Javad Ebadi
Mathematics 2024, 12(6), 798; https://doi.org/10.3390/math12060798 - 08 Mar 2024
Viewed by 500
Abstract
The aim of this work is to use an efficient and accurate numerical technique based on non-polynomial spline for the solution of the PHI-Four and Allen–Cahn equations. A recent discovery suggests that the PHI-Four equation focuses on its implications for particle physics and [...] Read more.
The aim of this work is to use an efficient and accurate numerical technique based on non-polynomial spline for the solution of the PHI-Four and Allen–Cahn equations. A recent discovery suggests that the PHI-Four equation focuses on its implications for particle physics and the behavior of scalar fields in the quantum realm. In materials science, ongoing research involves using the Allen–Cahn equation to understand and predict the evolution of microstructures in various materials as well as in biophysics. It depicts pattern formation in biological systems and the dynamics of spatial organization in tissues. To obtain an approximate solution of both equations, this technique uses forward differences for the time and cubic non-polynomial spline function for spatial descretization. The stability of the suggested technique is addressed using the von Neumann technique. Convergence test is carried out theoretically to show the order of convergence of the scheme. Some numerical tests are carried out to confirm accuracy and efficiency in terms of absolute error LR. Convergence rates for different test problems are also computed numerically. Numerical results and simulations obtained are compared with the existing methods. Full article
Show Figures

Figure 1

Back to TopTop