Proof-of-learning: Definitions and practice

H Jia, M Yaghini, CA Choquette-Choo… - … IEEE Symposium on …, 2021 - ieeexplore.ieee.org
Training machine learning (ML) models typically involves expensive iterative optimization.
Once the model's final parameters are released, there is currently no mechanism for the …

An imbalanced big data mining framework for improving optimization algorithms performance

EM Hassib, AI El-Desouky, ESM El-Kenawy… - IEEE …, 2019 - ieeexplore.ieee.org
Big data is an important factor almost in all nowadays technologies, such as, social media,
smart cities, and internet of things. Most of standard classifiers tends to be trapped in local …

Analysis of drug data mining with clustering technique using K-Means algorithm

AL Hananto, P Assiroj, B Priyatna, A Fauzi… - Journal of Physics …, 2021 - iopscience.iop.org
Data processing is very important in the development of information technology. Almost all
fields of work have information data. Data can be used to help analysis in work. At present …

Laplacian smoothing gradient descent

S Osher, B Wang, P Yin, X Luo, F Barekat… - Research in the …, 2022 - Springer
We propose a class of very simple modifications of gradient descent and stochastic gradient
descent leveraging Laplacian smoothing. We show that when applied to a large variety of …

Selection dynamics for deep neural networks

H Liu, P Markowich - Journal of Differential Equations, 2020 - Elsevier
This paper presents a partial differential equation framework for deep residual neural
networks and for the associated learning problem. This is done by carrying out the …

Implicit stochastic gradient descent method for cross-domain recommendation system

ND Vo, M Hong, JJ Jung - Sensors, 2020 - mdpi.com
The previous recommendation system applied the matrix factorization collaborative filtering
(MFCF) technique to only single domains. Due to data sparsity, this approach has a …

[PDF][PDF] A regularization interpretation of the proximal point method for weakly convex functions

T Hoheisel, M Laborde, A Oberman - J. Dyn. Games, 2020 - ww3.math.ucla.edu
Empirical evidence and theoretical results suggest that the proximal point method can be
computed approximately and still converge faster than the corresponding gradient descent …

An effective partitional crisp clustering method using gradient descent approach

S Shalileh - Mathematics, 2023 - mdpi.com
Enhancing the effectiveness of clustering methods has always been of great interest.
Therefore, inspired by the success story of the gradient descent approach in supervised …

IM-BERT: Enhancing Robustness of BERT through the Implicit Euler Method

M Kim, J Park, Y Kim - Proceedings of the 2024 Conference on …, 2024 - aclanthology.org
Abstract Pre-trained Language Models (PLMs) have achieved remarkable performance on
diverse NLP tasks through pre-training and fine-tuning. However, fine-tuning the model with …

AEGD: adaptive gradient descent with energy

H Liu, X Tian - arXiv preprint arXiv:2010.05109, 2020 - arxiv.org
We propose AEGD, a new algorithm for first-order gradient-based optimization of non-
convex objective functions, based on a dynamically updated energy variable. The method is …