Recursive stochastic gradient procedures in the presence of dependent noise

2005 ◽  
pp. 522-533
Author(s):  
A. S. Poznyak
Keyword(s):  
Stochastic Gradient

Share Market Data Prediction Strategies using Deep Learning Algorithm

2019 ◽  
Vol 13 ◽  
Author(s):  
A John. ◽  
D. Praveen Dominic ◽  
M. Adimoolam ◽  
N. M. Balamurugan
Keyword(s):  
Neural Network ◽  
Deep Learning ◽  
Stock Market ◽  
Predictive Analytics ◽  
Learning Algorithm ◽  
Market Price ◽  
Stochastic Gradient ◽  
Stochastic Gradient Descent ◽  
Mining Machine ◽  
Gradient Descent Algorithm

Background:: Predictive analytics has a multiplicity of statistical schemes from predictive modelling, data mining, machine learning. It scrutinizes present and chronological data to make predictions about expectations or if not unexplained measures. Most predictive models are used for business analytics to overcome loses and profit gaining. Predictive analytics is used to exploit the pattern in old and historical data. Objective: People used to follow some strategies for predicting stock value to invest in the more profit-gaining stocks and those strategies to search the stock market prices which are incorporated in some intelligent methods and tools. Such strategies will increase the investor’s profits and also minimize their risks. So prediction plays a vital role in stock market gaining and is also a very intricate and challenging process. Method: The proposed optimized strategies are the Deep Neural Network with Stochastic Gradient for stock prediction. The Neural Network is trained using Back-propagation neural networks algorithm and stochastic gradient descent algorithm as optimal strategies. Results: The experiment is conducted for stock market price prediction using python language with the visual package. In this experiment RELIANCE.NS, TATAMOTORS.NS, and TATAGLOBAL.NS dataset are taken as input dataset and it is downloaded from National Stock Exchange site. The artificial neural network component including Deep Learning model is most effective for more than 100,000 data points to train this model. This proposed model is developed on daily prices of stock market price to understand how to build model with better performance than existing national exchange method.

scholarly journals Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems

2021 ◽  
Vol 0 (0) ◽  
Author(s):  
Darina Dvinskikh ◽  
Alexander Gasnikov
Keyword(s):  
Convex Optimization ◽  
Inverse Problems ◽  
Convex Programming ◽  
Data Science ◽  
Optimization Problems ◽  
Stochastic Gradient ◽  
Logarithmic Factor ◽  
Accelerated Methods ◽  
Convex Optimization Problems ◽  
Primal And Dual

Abstract We introduce primal and dual stochastic gradient oracle methods for decentralized convex optimization problems. Both for primal and dual oracles, the proposed methods are optimal in terms of the number of communication steps. However, for all classes of the objective, the optimality in terms of the number of oracle calls per node takes place only up to a logarithmic factor and the notion of smoothness. By using mini-batching technique, we show that the proposed methods with stochastic oracle can be additionally parallelized at each node. The considered algorithms can be applied to many data science problems and inverse problems.

Sign in / Sign up

Export Citation Format

Share Document