Study of four first order Frank Wolfe algorithms to solve constrained non-convex problems in the context of white box adversarial attacks.
-
Updated
Jun 16, 2022 - Jupyter Notebook
Study of four first order Frank Wolfe algorithms to solve constrained non-convex problems in the context of white box adversarial attacks.
Classification-Techniques-For-Fraud-Detection
Contains code for RL and NES scheduling algorithms to optimize a flood control problem in a water dam
A Balanced Teaching Learning Based Optimization Algorithm. This project was developed under supervision of Dr. Keyvan RahimiZadeh and in collabotion with Prof. R. Venkata Rao.
Experiments related to optimization, convergence and network architectures.
A cutting-edge implementation of Particle Swarm Optimization (PSO) tailored for navigating and optimizing complex non-convex functions. This project encapsulates an advanced algorithmic approach, leveraging swarm intelligence to efficiently converge on global minima in multimodal landscapes.
an R package implementing the grid search optimization algorithm with a zoom
Low-dose cryo electron ptychography via non-convex Bayesian optimization
CoCaIn BPG escapes Spurious Stationary Points
Tutorials on optimizers for deep neural networks
This repository contains the work done as part of my B.Tech Project
Adaptive Moving Average as an Unsupervised Learning Algorithm
In compressed decentralized optimization settings, there are benefits to having multiple gossip steps between subsequent gradient iterations, even when the cost of doing so is appropriately accounted for e.g. by means of reducing the precision of compressed information.
Discussion of advantages and disadvantages of AdaHessian, a state-of-the-art Second Order Methods over First Order Methods on a Non-Convex Optimization Problem (digits classification on MNIST database using ResNet18). - @ EPFL
Semi-blind deconvolution for fMRI (BOLD signal)
My undergraduate thesis at THU
Fast Inertial Algorithm for Phase Retrieval
Add a description, image, and links to the non-convex-optimization topic page so that developers can more easily learn about it.
To associate your repository with the non-convex-optimization topic, visit your repo's landing page and select "manage topics."