scholarly journals Discriminative Codebook Hashing for Supervised Video Retrieval

2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Xiaoman Bian ◽  
Rushi Lan ◽  
Xiaoqin Wang ◽  
Chen Chen ◽  
Zhenbing Liu ◽  
...  
Keyword(s):  
Gradient Descent ◽  
Large Scale ◽  
Video Retrieval ◽  
Dimensional Space ◽  
Code Word ◽  
Neighborhood Structures ◽  
Gradient Descent Algorithm ◽  
Hamming Space ◽  
Bernoulli Distributions ◽  
Better Than

In recent years, hashing learning has received increasing attention in supervised video retrieval. However, most existing supervised video hashing approaches design hash functions based on pairwise similarity or triple relationships and focus on local information, which results in low retrieval accuracy. In this work, we propose a novel supervised framework called discriminative codebook hashing (DCH) for large-scale video retrieval. The proposed DCH encourages samples within the same category to converge to the same code word and maximizes the mutual distances among different categories. Specifically, we first propose the discriminative codebook via a predefined distance among intercode words and Bernoulli distributions to handle each hash bit. Then, we use the composite Kullback–Leibler (KL) divergence to align the neighborhood structures between the high-dimensional space and the Hamming space. The proposed DCH is optimized via the gradient descent algorithm. Experimental results on three widely used video datasets verify that our proposed DCH performs better than several state-of-the-art methods.

scholarly journals Stochastic Subgradient for Large-Scale Support Vector Machine Using the Generalized Pinball Loss Function

Symmetry ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 1652
Author(s):  
Wanida Panup ◽  
Rabian Wangkeeree
Keyword(s):  
Support Vector Machine ◽  
Loss Function ◽  
Gradient Descent ◽  
Large Scale ◽  
Stochastic Gradient ◽  
Stochastic Gradient Descent ◽  
Support Vector ◽  
Hinge Loss ◽  
Gradient Descent Algorithm ◽  
Pinball Loss

In this paper, we propose a stochastic gradient descent algorithm, called stochastic gradient descent method-based generalized pinball support vector machine (SG-GPSVM), to solve data classification problems. This approach was developed by replacing the hinge loss function in the conventional support vector machine (SVM) with a generalized pinball loss function. We show that SG-GPSVM is convergent and that it approximates the conventional generalized pinball support vector machine (GPSVM). Further, the symmetric kernel method was adopted to evaluate the performance of SG-GPSVM as a nonlinear classifier. Our suggested algorithm surpasses existing methods in terms of noise insensitivity, resampling stability, and accuracy for large-scale data scenarios, according to the experimental results.

scholarly journals On the Convergence Properties of a K-step Averaging Stochastic Gradient Descent Algorithm for Nonconvex Optimization

2018 ◽  
Author(s):  
Fan Zhou ◽  
Guojing Cong
Keyword(s):  
Gradient Descent ◽  
Large Scale ◽  
Stochastic Gradient ◽  
Learning Problems ◽  
Stochastic Gradient Descent ◽  
Convergence Properties ◽  
Descent Algorithm ◽  
Convergence Results ◽  
Gradient Descent Algorithm ◽  
Parallel Stochastic Gradient Descent

We adopt and analyze a synchronous K-step averaging stochastic gradient descent algorithm which we call K-AVG  for solving large scale machine learning problems. We establish the convergence results of K-AVG for nonconvex objectives. Our analysis of K-AVG applies to many existing variants of synchronous SGD.  We explain why the K-step delay is necessary and leads to better performance than traditional parallel stochastic gradient descent which is equivalent to K-AVG with $K=1$. We also show that K-AVG scales better with the number of learners than asynchronous stochastic gradient descent (ASGD). Another advantage of K-AVG over ASGD is that it allows larger stepsizes and facilitates faster convergence. On a cluster of $128$ GPUs, K-AVG is faster than ASGD implementations and achieves better accuracies and faster convergence for training with the CIFAR-10 dataset.

scholarly journals Development of a local scour prediction model clustered by soil class

2021 ◽  
Author(s):  
M. Annad ◽  
A. Lefkir ◽  
M. Mammar-kouadri ◽  
I. Bettahar
Keyword(s):  
Linear Regression ◽  
Gradient Descent ◽  
Local Scour ◽  
Large Field ◽  
Complex Phenomenon ◽  
Empirical Formulas ◽  
Gradient Descent Algorithm ◽  
Field Database ◽  
New Equation ◽  
Better Than

Abstract Several studies have been conducted to assess local scour formulas in order to select the most appropriate one. Confronted to the limits of the previous formulas, further studies have been performed to propose new local scour formulas. Generalizing a single scour formula, for all soil classes, seems approximate for such a complex phenomenon depending on several parameters and may eventually lead to considerable uncertainties in scour estimation. This study aims to propose several new scour formulas for different granulometric classes of the streambed by exploiting a large field database. The new scour formulas are based on multiple non-linear regression (MNLR) models. Supervised learning is used as an optimization tool to solve the hyper-parameters of each new equation by using the ‘Gradient Descent Algorithm’. The results show that the new formulas proposed in this study perform better than some other empirical formulas chosen for comparison. The results are presented as seven new formulas, as well as abacuses for the calculation of local scour by soil classes.

PENGEMBANGAN MEDIA BIG BOOK UNTUK MENINGKATKAN HASIL BELAJAR PECAHAN SENILAI SISWA SD

2018 ◽  
Vol 16 (1) ◽  
pp. 67-76
Author(s):  
Disyacitta Neolia Firdana ◽  
Trimurtini Trimurtini
Keyword(s):  
Learning Outcomes ◽  
Large Scale ◽  
Fourth Grade ◽  
Learning Activities ◽  
Equivalent Fractions ◽  
Fourth Grade Students ◽  
Teacher Needs ◽  
The Media ◽  
Test Result ◽  
Better Than

This research aimed to determine the properness and effectiveness of the big book media on learning equivalent fractions of fourth grade students. The method of research is Research and Development  (R&D). This study was conducted in fourth grade of SDN Karanganyar 02 Kota Semarang. Data sources from media validation, material validation, learning outcomes, and teacher and students responses on developed media. Pre-experimental research design with one group pretest-posttest design. Big book developed consist of equivalent fractions material, students learning activities sheets with rectangle and circle shape pictures, and questions about equivalent fractions. Big book was developed based on students and teacher needs. This big book fulfill the media validity of 3,75 with very good criteria and scored 3 by material experts with good criteria. In large-scale trial, the result of students posttest have learning outcomes completness 82,14%. The result of N-gain calculation with result 0,55 indicates the criterion “medium”. The t-test result 9,6320 > 2,0484 which means the average of posttest outcomes is better than the average of pretest outcomes. Based on that data, this study has produced big book media which proper and effective as a media of learning equivalent fractions of fourth grade elementary school.

scholarly journals Revisiting the dynamic interactions between economic growth and environmental pollution in Italy: evidence from a gradient descent algorithm

2021 ◽  
Author(s):  
Marco Mele ◽  
Cosimo Magazzino ◽  
Nicolas Schneider ◽  
Floriana Nicolai
Keyword(s):  
Economic Growth ◽  
Gradient Descent ◽  
Statistical Data ◽  
Stochastic Gradient Descent ◽  
Policy Recommendations ◽  
Dynamic Interactions ◽  
Gradient Descent Algorithm ◽  
The Relationship ◽  
Main Strand ◽  
Yearly Data

AbstractAlthough the literature on the relationship between economic growth and CO2 emissions is extensive, the use of machine learning (ML) tools remains seminal. In this paper, we assess this nexus for Italy using innovative algorithms, with yearly data for the 1960–2017 period. We develop three distinct models: the batch gradient descent (BGD), the stochastic gradient descent (SGD), and the multilayer perceptron (MLP). Despite the phase of low Italian economic growth, results reveal that CO2 emissions increased in the predicting model. Compared to the observed statistical data, the algorithm shows a correlation between low growth and higher CO2 increase, which contradicts the main strand of literature. Based on this outcome, adequate policy recommendations are provided.

scholarly journals Assessment of Numerical Methods for Plunging Breaking Wave Predictions

2021 ◽  
Vol 9 (3) ◽  
pp. 264
Author(s):  
Shanti Bhushan ◽  
Oumnia El Fajri ◽  
Graham Hubbard ◽  
Bradley Chambers ◽  
Christopher Kees
Keyword(s):  
Solitary Wave ◽  
Wave Breaking ◽  
Large Scale ◽  
Turbulence Models ◽  
Navier Stokes ◽  
Wave Crest ◽  
Breaking Wave ◽  
Rans Turbulence Models ◽  
Run Up ◽  
Better Than

This study evaluates the capability of Navier–Stokes solvers in predicting forward and backward plunging breaking, including assessment of the effect of grid resolution, turbulence model, and VoF, CLSVoF interface models on predictions. For this purpose, 2D simulations are performed for four test cases: dam break, solitary wave run up on a slope, flow over a submerged bump, and solitary wave over a submerged rectangular obstacle. Plunging wave breaking involves high wave crest, plunger formation, and splash up, followed by second plunger, and chaotic water motions. Coarser grids reasonably predict the wave breaking features, but finer grids are required for accurate prediction of the splash up events. However, instabilities are triggered at the air–water interface (primarily for the air flow) on very fine grids, which induces surface peel-off or kinks and roll-up of the plunger tips. Reynolds averaged Navier–Stokes (RANS) turbulence models result in high eddy-viscosity in the air–water region which decays the fluid momentum and adversely affects the predictions. Both VoF and CLSVoF methods predict the large-scale plunging breaking characteristics well; however, they vary in the prediction of the finer details. The CLSVoF solver predicts the splash-up event and secondary plunger better than the VoF solver; however, the latter predicts the plunger shape better than the former for the solitary wave run-up on a slope case.

scholarly journals Adaptive Gradient Estimation Stochastic Parallel Gradient Descent Algorithm for Laser Beam Cleanup

Photonics ◽  
2021 ◽  
Vol 8 (5) ◽  
pp. 165
Author(s):  
Shiqing Ma ◽  
Ping Yang ◽  
Boheng Lai ◽  
Chunxuan Su ◽  
Wang Zhao ◽  
...  
Keyword(s):  
Solid State ◽  
Adaptive Optics ◽  
Gradient Descent ◽  
Solid State Laser ◽  
Gradient Estimation ◽  
State Laser ◽  
Gradient Descent Algorithm ◽  
Stochastic Parallel Gradient Descent ◽  
High Output ◽  
Improved Algorithm

For a high-power slab solid-state laser, obtaining high output power and high output beam quality are the most important indicators. Adaptive optics systems can significantly improve beam qualities by compensating for the phase distortions of the laser beams. In this paper, we developed an improved algorithm called Adaptive Gradient Estimation Stochastic Parallel Gradient Descent (AGESPGD) algorithm for beam cleanup of a solid-state laser. A second-order gradient of the search point was introduced to modify the gradient estimation, and it was introduced with the adaptive gain coefficient method into the classical Stochastic Parallel Gradient Descent (SPGD) algorithm. The improved algorithm accelerates the search for convergence and prevents it from falling into a local extremum. Simulation and experimental results show that this method reduces the number of iterations by 40%, and the algorithm stability is also improved compared with the original SPGD method.

scholarly journals Fault diagnosis of industrial robot reducer by an extreme learning machine with a level-based learning swarm optimizer

2021 ◽  
Vol 13 (5) ◽  
pp. 168781402110195
Author(s):  
Jianwen Guo ◽  
Xiaoyan Li ◽  
Zhenpeng Lao ◽  
Yandong Luo ◽  
Jiapeng Wu ◽  
...  
Keyword(s):  
Fault Diagnosis ◽  
Extreme Learning Machine ◽  
Large Scale ◽  
Production Efficiency ◽  
Industrial Robot ◽  
Optimal Solution ◽  
Industrial Robots ◽  
Generalization Performance ◽  
Gradient Descent Algorithm ◽  
Learning Machine

Fault diagnosis is of great significance to improve the production efficiency and accuracy of industrial robots. Compared with the traditional gradient descent algorithm, the extreme learning machine (ELM) has the advantage of fast computing speed, but the input weights and the hidden node biases that are obtained at random affects the accuracy and generalization performance of ELM. However, the level-based learning swarm optimizer algorithm (LLSO) can quickly and effectively find the global optimal solution of large-scale problems, and can be used to solve the optimal combination of large-scale input weights and hidden biases in ELM. This paper proposes an extreme learning machine with a level-based learning swarm optimizer (LLSO-ELM) for fault diagnosis of industrial robot RV reducer. The model is tested by combining the attitude data of reducer gear under different fault modes. Compared with ELM, the experimental results show that this method has good stability and generalization performance.

scholarly journals Large-Scale Video Retrieval via Deep Local Convolutional Features

2020 ◽  
Vol 2020 ◽  
pp. 1-8
Author(s):  
Chen Zhang ◽  
Bin Hu ◽  
Yucong Suo ◽  
Zhiqiang Zou ◽  
Yimu Ji
Keyword(s):  
Large Scale ◽  
Video Retrieval ◽  
Video Data ◽  
Query Image ◽  
Key Frame Extraction ◽  
Key Frame ◽  
Storage Cost ◽  
Extraction Algorithm ◽  
Feature Aggregation ◽  
And Storage

In this paper, we study the challenge of image-to-video retrieval, which uses the query image to search relevant frames from a large collection of videos. A novel framework based on convolutional neural networks (CNNs) is proposed to perform large-scale video retrieval with low storage cost and high search efficiency. Our framework consists of the key-frame extraction algorithm and the feature aggregation strategy. Specifically, the key-frame extraction algorithm takes advantage of the clustering idea so that redundant information is removed in video data and storage cost is greatly reduced. The feature aggregation strategy adopts average pooling to encode deep local convolutional features followed by coarse-to-fine retrieval, which allows rapid retrieval in the large-scale video database. The results from extensive experiments on two publicly available datasets demonstrate that the proposed method achieves superior efficiency as well as accuracy over other state-of-the-art visual search methods.

Sign in / Sign up

Export Citation Format

Share Document