Gosl is a Go library to develop Artificial Intelligence and High-Performance Scientific Computations. The library tries to be as general and easy as possible. Gosl considers the use of both Go concurrency routines and parallel computing using the message passing interface (MPI). Gosl has several modules (sub-packages) for a variety of tasks in scientific computing, image analysis, and data post-processing.
scientific-computing visualization linear-algebra differential-equations sparse-systems plotting mkl parallel-computations computational-geometry graph-theory tensor-algebra fast-fourier-transform eigenvalues eigenvectors hacktoberfest machine-learning artificial-intelligence optimization optimization-algorithms linear-programmingDistributed Deep Learning with Apache Spark and Keras. Distributed Keras is a distributed deep learning framework built op top of Apache Spark and Keras, with a focus on "state-of-the-art" distributed optimization algorithms. We designed the framework in such a way that a new distributed optimizer could be implemented with ease, thus enabling a person to focus on research. Several distributed methods are supported, such as, but not restricted to, the training of ensembles and models using data parallel methods.
machine-learning deep-learning apache-spark data-parallelism distributed-optimizers keras optimization-algorithms tensorflow data-science hadoopThe library contains a number of interconnected Java packages that implement machine learning and artificial intelligence algorithms. These are artificial intelligence algorithms implemented for the kind of people that like to implement algorithms themselves. See Issues page.
artificial-intelligence-algorithms neural-network machine-learning optimization-algorithmsUnconstrained function minimization in javascript. This package implements some basic numerical optimization algorithms: Nelder-Mead, Gradient Descent, Wolf Line Search and Non-Linear Conjugate Gradient methods are all provided.
numerical-optimization optimization-algorithms visualization fmin optimization nelder-mead conjudate-gradientThe code has been tested on OSX and Linux. The C-OPT library contains a pure Python implementation (using Numba) of the sequential algorithm. Note that because Numba lacks atomic types, a pure Python implementation of the parallel algorithm is not straightforward.
optimization optimization-algorithms machine-learningA library for performing hyperparameter optimization on top of Spark
hyperparameter-optimization spark optimizer optimization-algorithms machine-learning machinelearning hyperparameter-tuning hyperparameters grid-search random-search vowpal-wabbitMy Master Thesis on Distributed Deep Learning (parallelizing gradient descent) and other concepts I did during my research.
machine-learning optimization-algorithms apache-spark distributed-computing master-thesis deep-learningpagmo (C++) or pygmo (Python) is a scientific library for massively parallel optimization. It is built around the idea of providing a unified interface to optimization algorithms and to optimization problems and to make their deployment in massively parallel environments easy. If you are using pagmo/pygmo as part of your research, teaching, or other activities, we would be grateful if you could star the repository and/or cite our work. The DOI of the latest version and other citation resources are available at this link.
optimization optimization-algorithms optimization-methods optimization-tools parallel-computing parallel-processing evolutionary-algorithms multi-objective-optimization stochastic-optimizers genetic-algorithm metaheuristics evolutionary-strategy artificial-intelligenceThe GDLibrary is a pure-Matlab library of a collection of unconstrained optimization algorithms. This solves an unconstrained minimization problem of the form, min f(x). Note that the SGDLibrary internally contains this GDLibrary.
optimization optimization-algorithms machine-learning machine-learning-algorithms big-data gradient-descent gradient logistic-regression newton linear-regression svm lasso matrix-completion rosenbrock-problem softmax-regression multinomial-regression statistical-learning classificationThe NMFLibrary is a pure-Matlab library of a collection of algorithms of non-negative matrix factorization (NMF).
nmf optimization-algorithms machine-learning-algorithms factorization matrix-factorization big-data data-analysis constrained-optimization gradient-descent matlab matlab-toolbox online-learning stochastic-optimizers stochastic-gradient-descent robust-optimization bigdata sparse-representations orthogonal nonnegative-matrix-factorization nonnegativity-constraintsThe SGDLibrary is a pure-MATLAB library of a collection of stochastic optimization algorithms. This solves an unconstrained minimization problem of the form, min f(x) = sum_i f_i(x). The SGDLibrary is also operable on GNU Octave (Free software compatible with many MATLAB scripts). Note that this SGDLibrary internally contains the GDLibrary.
optimization optimization-algorithms machine-learning machine-learning-algorithms stochastic-optimization-algorithms stochastic-gradient-descent big-data gradient-descent-algorithm gradient logistic-regression sgd variance-reduction newtons-method linear-regression classification online-learning quasi-newtonThe SparseGDLibrary is a pure-Matlab library of a collection of unconstrained optimization algorithms for sparse modeling. Run run_me_first for path configurations.
optimization optimization-algorithms machine-learning-algorithms machine-learning big-data gradient-descent sparse-linear-solver sparse-regression lasso-regression lasso elasticnet solver algorithms admm proximal-algorithms proximal-operators logistic-regression matrix-completion coordinate-descent support-vector-machinesStructuredOptimization.jl is a high-level modeling language that utilizes a syntax that is very close to the mathematical formulation of an optimization problem. StructuredOptimization.jl can handle large-scale convex and nonconvex problems with nonsmooth cost functions.
optimization-algorithms large-scale non-smooth convex-optimization non-convexForBES (standing for Forward-Backward Envelope Solver) is a MATLAB solver for nonsmooth optimization problems. It is generic in the sense that the user can customize the problem to solve in an easy and flexible way. It is efficient since it features very efficient algorithms, suited for large scale applications.
matlab matlab-solver optimization optimization-algorithms numerical-optimizationThis project generates animations of pytorch optimizers solving toy problems. Examples Below. Some nice animations were posted a few years ago by Alex Radford but didn't include the Adam optimizer or landscapes with noise. Louis Tiao blogged about how to make the visualizations. The pytorch unit tests show how to run the optimizers on test functions. I pulled these together and shared the result at https://github.com/wassname/viz_torch_optim.
optimization-algorithms vizualisation 3d-graphics pytorch machine-learning deep-learning optimizer learning-rateThis repo provides a Pytorch implementation for the Optimization as a Model for Few-Shot Learning paper.
optimization few-shot pytorch optimization-algorithmsCIlib is a library of various computational intelligence algorithms. The goal of the project is to create a library that can be used and referenced by individuals and researchers alike. CIlib is not a "framework", instead the library is a set of a few very simple abstractions, and allows for a principled manner to define computational intelligence algorithms and uses several typeclasses such as Functor and Monad.
cilib functional-programming computational-intelligence optimization-algorithms machine-learningPackage for large scale convex optimization solvers in julia. This package is intended to allow for easy implementation, testing, and running of solvers through the Convex.jl interface. The package is currently under active development and uses the ProximalOperators.jl package to do the low level projections. These values correspond to the values in the paper Conic Optimization via Operator Splitting and Homogeneous Self-Dual Embedding (O'Donoghue et.al).
convex-optimization optimization-algorithms julia solverPlease contact us if you have any questions, suggestions, requests or bug-reports. This is a package for solving an unconstrained minimization problem of the form, min f(x) = (1/n)*sum_i f_i(x).
stochastic-quasi-newton optimization optimization-algorithmsDataStructure、Algorithm by JavaScript
js-algorithms algorithm datastructures optimization-algorithms algorithms-datastructures algorithm-challenges
We have large collection of open source products. Follow the tags from
Tag Cloud >>
Open source products are scattered around the web. Please provide information
about the open source projects you own / you use.
Add Projects.