اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMachine learning algorithms for predicting the amplitude of chaotic laser pulses
33
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Forecasting the dynamics of chaotic systems from the analysis of their output signals is a challenging problem with applications in most fields of modern science. In this work, we use a laser model to compare the performance of several machine learning algorithms for forecasting the amplitude of upcoming emitted chaotic pulses. We simulate the dynamics of an optically injected semiconductor laser that presents a rich variety of dynamical regimes when changing the parameters. We focus on a particular dynamical regime that can show ultra-high intensity pulses, reminiscent of rogue waves. We compare the goodness of the forecast for several popular methods in machine learning, namely deep learning, support vector machine, nearest neighbors and reservoir computing. Finally, we analyze how their performance for predicting the height of the next optical pulse depends on the amount of noise and the length of the time-series used for training.
قيم البحث
اقرأ أيضاً
Effect of multipath amplification is found in ultrawideband wireless communication systems with chaotic carrier, whereas information is transmitted with chaotic radio pulses. This effect is observed in multipath environment (residence, office, indust
rial or other indoor space). It exhibits itself through an increase of signal power at the receiver input with respect to the case of free space. Multipath amplification effect gives 5-15 dB energy gain (depending on the environment), which allows to have 2-6 times longer distance range for the same transmitter power.
This research focuses on predicting the demand for air taxi urban air mobility (UAM) services during different times of the day in various geographic regions of New York City using machine learning algorithms (MLAs). Several ride-related factors (suc
h as month of the year, day of the week and time of the day) and weather-related variables (such as temperature, weather conditions and visibility) are used as predictors for four popular MLAs, namely, logistic regression, artificial neural networks, random forests, and gradient boosting. Experimental results suggest gradient boosting to consistently provide higher prediction performance. Specific locations, certain time periods and weekdays consistently emerged as critical predictors.
The performance of modern machine learning methods highly depends on their hyperparameter configurations. One simple way of selecting a configuration is to use default settings, often proposed along with the publication and implementation of a new al
gorithm. Those default values are usually chosen in an ad-hoc manner to work good enough on a wide variety of datasets. To address this problem, different automatic hyperparameter configuration algorithms have been proposed, which select an optimal configuration per dataset. This principled approach usually improves performance but adds additional algorithmic complexity and computational costs to the training procedure. As an alternative to this, we propose learning a set of complementary default values from a large database of prior empirical results. Selecting an appropriate configuration on a new dataset then requires only a simple, efficient and embarrassingly parallel search over this set. We demonstrate the effectiveness and efficiency of the approach we propose in comparison to random search and Bayesian Optimization.
Quantitative descriptions of the structure-thermal property correlation have been a bottleneck in designing materials with superb thermal properties. In the past decade, the first-principles phonon calculations using density functional theory and the
Boltzmann transport equation have become a common practice for predicting the thermal conductivity of new materials. However, first-principles calculations are too costly for high-throughput material screening and multi-scale structural design. First-principles calculations also face several fundamental challenges in modeling thermal transport properties, e.g., of crystalline materials with defects, of amorphous materials, and for materials at high temperatures. In the past five years, machine learning started to play a role in solving these challenges. This review provides a comprehensive summary and discussion on the state-of-the-art, future opportunities, and the remaining challenges in implementing machine learning for studying thermal conductivity. After an introduction to the working principles of machine learning and descriptors of material structures, recent research using machine learning to study thermal transport is discussed. Three major applications of machine learning for predicting thermal properties are discussed. First, machine learning is applied to solve the challenges in modeling phonon transport of crystals with defects, in amorphous materials, and at high temperatures. Machine learning is used to build high-fidelity interatomic potentials to bridge the gap between first-principles calculations and molecular dynamics simulations. Second, machine learning can be used to study the correlation between thermal conductivity and other properties for high-throughput materials screening. Finally, machine learning is a powerful tool for structural design to achieve target thermal conductance or thermal conductivity.
In this paper, we study efficient differentially private alternating direction methods of multipliers (ADMM) via gradient perturbation for many machine learning problems. For smooth convex loss functions with (non)-smooth regularization, we propose t
he first differentially private ADMM (DP-ADMM) algorithm with performance guarantee of $(epsilon,delta)$-differential privacy ($(epsilon,delta)$-DP). From the viewpoint of theoretical analysis, we use the Gaussian mechanism and the conversion relationship between Renyi Differential Privacy (RDP) and DP to perform a comprehensive privacy analysis for our algorithm. Then we establish a new criterion to prove the convergence of the proposed algorithms including DP-ADMM. We also give the utility analysis of our DP-ADMM. Moreover, we propose an accelerated DP-ADMM (DP-AccADMM) with the Nesterovs acceleration technique. Finally, we conduct numerical experiments on many real-world datasets to show the privacy-utility tradeoff of the two proposed algorithms, and all the comparative analysis shows that DP-AccADMM converges faster and has a better utility than DP-ADMM, when the privacy budget $epsilon$ is larger than a threshold.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
