WWW'24, Mirror Gradient (MG) makes multimodal recommendation models approach flat local minima easier compared to models with normal training.

Optimisation and algorithm project. I) L1, L2, and L2^2 regularisers in optimal trajectory synthesis; II) Logistic data classification; III) Gradient methods.

This repository contains Python codes for various optimization and modeling tasks, including inheritance partitioning, surface and contour plotting, warehouse location optimization, root-finding using Bisection and Golden Section methods, gradient descent with different step-size strategies, inertial gradient methods, and image inpainting

Gradient method, Newton method, Euler and Heun method, discrete Fourier transform and Monte Carlo simulation in C++

Implementation of unconstrained and constrained convex optimization algorithms in Python, focusing on solving data science problems such as semi-supervised learning and Support Vector Machines.

AutoSGM

This repository contains lecture notes for the Optimization Theory course. The course covers fundamental concepts of optimization, classification of optimization problems, graphical methods, classical optimization techniques, constrained and unconstrained optimization, linear and nonlinear programming, and gradient methods.

An easy implementation of the Stochastic / Batch gradient descent and comparison with the standard Gradient Descent Method

Unofficial implementation of the Accelerated ExtraGradient method from the 2022 paper "Optimal Gradient Sliding and its Application to Distributed Optimization Under Similarity" by Kovalev D. et al.