Search Results for "algorithms"
Sort By:
Showing 58 open source projects for "algorithms"
View related business solutions-
Custom VMs From 1 to 96 vCPUs With 99.95% UptimeLive migration and automatic failover keep workloads online through maintenance. One free e2-micro VM every month.
-
$300 in Free Credit Towards Top Cloud ServicesStart your project in minutes. After credits run out, 20+ products include free monthly usage. Only pay when you're ready to scale.
-
1
Manopt.jl
Optimization on Manifolds in Julia
Optimization Algorithm on Riemannian Manifolds. A framework to implement arbitrary optimization algorithms on Riemannian Manifolds. Library of optimization algorithms on Riemannian manifolds. Easy-to-use interface for (debug) output and recording values during an algorithm run. Several tools to investigate the algorithms, gradients, and optimality criteria. -
2
OnlineStats.jl
Single-pass algorithms for statistics
OnlineStats does statistics and data visualization for big/streaming data via online algorithms. High-performance single-pass algorithms for statistics and data viz. Updated one observation at a time. Algorithms use O(1) memory. Algorithms use O(1) memory. -
3
ReinforcementLearning.jl
A reinforcement learning package for Julia
A collection of tools for doing reinforcement learning research in Julia. Provide elaborately designed components and interfaces to help users implement new algorithms. Make it easy for new users to run benchmark experiments, compare different algorithms, and evaluate and diagnose agents. Facilitate reproducibility from traditional tabular methods to modern deep reinforcement learning algorithms. Make it easy for new users to run benchmark experiments, compare different algorithms, and evaluate and diagnose agents. ... -
4
ProximalAlgorithms.jl
Proximal algorithms for nonsmooth optimization in Julia
A Julia package for non-smooth optimization algorithms. This package provides algorithms for the minimization of objective functions that include non-smooth terms, such as constraints or non-differentiable penalties. -
Earn up to 16% annual interest with Nexo.Generate interest, access liquidity without selling, and execute trades seamlessly. All in one platform. Geographic restrictions, eligibility, and terms apply.
-
5
ForwardDiff.jl
Forward Mode Automatic Differentiation for Julia
ForwardDiff implements methods to take derivatives, gradients, Jacobians, Hessians, and higher-order derivatives of native Julia functions (or any callable object, really) using forward mode automatic differentiation (AD). While performance can vary depending on the functions you evaluate, the algorithms implemented by ForwardDiff generally outperform non-AD algorithms (such as finite-differencing) in both speed and accuracy. Functions like f which map a vector to a scalar are the best case for reverse-mode automatic differentiation, but ForwardDiff may still be a good choice if x is not too large, as it is much simpler. The best case for forward-mode differentiation is a function that maps a scalar to a vector. -
6
Roots.jl
Root finding functions for Julia
...The basic call is find_zero(f, x0, [M], [p]; kws...) where, typically, f is a function, x0 a starting point or bracketing interval, M is used to adjust the default algorithms used, and p can be used to pass in parameters. Bisection-like algorithms. For functions where a bracketing interval is known (one where f(a) and f(b) have alternate signs), a bracketing method, like Bisection, can be specified. The default is Bisection, for most floating point number types, employed in a manner exploiting floating point storage conventions. ... -
7
OptimalTransport.jl
Optimal transport algorithms for Julia
This package provides some Julia implementations of algorithms for computational optimal transport, including the Earth-Mover's (Wasserstein) distance, Sinkhorn algorithm for entropically regularized optimal transport as well as some variants or extensions. Notably, OptimalTransport.jl provides GPU acceleration through CUDA.jl and NNlibCUDA.jl. -
8
InferOpt.jl
Combinatorial optimization layers for machine learning pipelines
InferOpt.jl is a toolbox for using combinatorial optimization algorithms within machine learning pipelines. It allows you to create differentiable layers from optimization oracles that do not have meaningful derivatives. Typical examples include mixed integer linear programs or graph algorithms. -
9
BAT.jl
A Bayesian Analysis Toolkit in Julia
Welcome to BAT, a Bayesian analysis toolkit in Julia. BAT.jl offers a variety of posterior sampling, mode estimation and integration algorithms, supplemented by plotting recipes and I/O functionality. BAT.jl originated as a rewrite/redesign of BAT, the Bayesian Analysis Toolkit in C++. BAT.jl now offer a different set of functionality and a wider variety of algorithms than its C++ predecessor. -
AI-powered service management for IT and enterprise teamsGive your IT, operations, and business teams the ability to deliver exceptional services—without the complexity. Maximize operational efficiency with refreshingly simple, AI-powered Freshservice.
-
10
The NLopt module for Julia
Package to call the NLopt nonlinear-optimization library from Julia
This module provides a Julia-language interface to the free/open-source NLopt library for nonlinear optimization. NLopt provides a common interface for many different optimization algorithms. -
11
FrankWolfe.jl
Julia implementation for various Frank-Wolfe and Conditional Gradient
This package is a toolbox for Frank-Wolfe and conditional gradient algorithms. Frank-Wolfe algorithms were designed to solve optimization problems where f is a differentiable convex function and C is a convex and compact set. They are especially useful when we know how to optimize a linear function over C in an efficient way. -
12
Gen.jl
A general-purpose probabilistic programming system
An open-source stack for generative modeling and probabilistic inference. Gen’s inference library gives users building blocks for writing efficient probabilistic inference algorithms that are tailored to their models, while automating the tricky math and the low-level implementation details. Gen helps users write hybrid algorithms that combine neural networks, variational inference, sequential Monte Carlo samplers, and Markov chain Monte Carlo. Gen features an easy-to-use modeling language for writing down generative models, inference models, variational families, and proposal distributions using ordinary code. ... -
13
LineSearches.jl
Line search methods for optimization and root-finding
Line search methods for optimization and root-finding. This package provides an interface to line search algorithms implemented in Julia. The code was originally written as part of Optim, but has now been separated out to its own package. -
14
MLJ.jl
A Julia machine learning framework
MLJ (Machine Learning in Julia) is a toolbox written in Julia providing a common interface and meta-algorithms for selecting, tuning, evaluating, composing, and comparing about 200 machine learning models written in Julia and other languages. The functionality of MLJ is distributed over several repositories illustrated in the dependency chart below. These repositories live at the JuliaAI umbrella organization. -
15
Computational Thinking
Introduction to computational thinking with Julia
...The course integrates mathematics, computing, and real-world applications into a unified curriculum, making it suitable for students across science, engineering, and data-driven fields. It emphasizes learning how to translate problems into computational terms and developing algorithms and models to analyze them effectively. Using Julia, the course highlights both mathematical reasoning and practical coding, bridging the gap between theory and application. The materials include lectures, notebooks, exercises, and projects that encourage experimentation and discovery. By combining programming with conceptual depth, the repository aims to build skills that are transferable across disciplines and essential for modern scientific inquiry. -
16
JUDI.jl
Julia Devito inversion
...JUDI's modeling operators can also be used as layers in (convolutional) neural networks to implement physics-augmented deep learning algorithms thanks to its implementation of ChainRules's rrule for the linear operators representing the discre wave equation. -
17
CounterfactualExplanations.jl
A package for Counterfactual Explanations and Algorithmic Recourse
CounterfactualExplanations.jl is a package for generating Counterfactual Explanations (CE) and Algorithmic Recourse (AR) for black-box algorithms. Both CE and AR are related tools for explainable artificial intelligence (XAI). While the package is written purely in Julia, it can be used to explain machine learning algorithms developed and trained in other popular programming languages like Python and R. See below for a short introduction and other resources or dive straight into the docs. -
18
Graphs.jl
An optimized graphs package for the Julia programming language
...Offers a set of simple, concrete graph implementations – SimpleGraph (for undirected graphs) and SimpleDiGraph (for directed graphs), an API for the development of more sophisticated graph implementations under the AbstractGraph type, and a large collection of graph algorithms with the same requirements as this API. -
19
AlphaZero.jl
A generic, simple and fast implementation of Deepmind's AlphaZero
Beyond its much publicized success in attaining superhuman level at games such as Chess and Go, DeepMind's AlphaZero algorithm illustrates a more general methodology of combining learning and search to explore large combinatorial spaces effectively. We believe that this methodology can have exciting applications in many different research areas. Because AlphaZero is resource-hungry, successful open-source implementations (such as Leela Zero) are written in low-level languages (such as C++)... -
20
MultivariatePolynomials.jl
Multivariate polynomials interface
...It defines abstract types and an API for multivariate monomials, terms, and polynomials and gives default implementation for common operations on them using the API. On the one hand, This packages allows you to implement algorithms on multivariate polynomials that will be independant on the representation of the polynomial that will be chosen by the user. On the other hand, it allows the user to easily switch between different representations of polynomials to see which one is faster for the algorithm that he is using. -
21
ITensors.jl
A Julia library for efficient tensor computations and tensor network
ITensors.jl is a high-performance Julia library for tensor network calculations, primarily used in quantum physics and computational science. It enables efficient manipulation of large, structured tensors with named indices and provides an intuitive interface for implementing algorithms like DMRG (Density Matrix Renormalization Group), TEBD (Time-Evolving Block Decimation), and more. ITensors.jl leverages Julia’s multiple dispatch and performance features to simplify the development of scalable and complex simulations involving quantum many-body systems. -
22
ReverseDiff
Reverse Mode Automatic Differentiation for Julia
ReverseDiff is a fast and compile-able tape-based reverse mode automatic differentiation (AD) that implements methods to take gradients, Jacobians, Hessians, and higher-order derivatives of native Julia functions (or any callable object, really). While performance can vary depending on the functions you evaluate, the algorithms implemented by ReverseDiff generally outperform non-AD algorithms in both speed and accuracy. -
23
Interpolations.jl
Fast, continuous interpolation of discrete datasets in Julia
This package implements a variety of interpolation schemes for the Julia language. It has the goals of ease of use, broad algorithmic support, and exceptional performance. Currently, this package supports B-splines and irregular grids. The API has been designed with the intent to support more options. Initial support for Lanczos interpolation was recently added. Pull requests are more than welcome! It should be noted that the API may continue to evolve over time. -
24
MLJ
A Julia machine learning framework
MLJ (Machine Learning in Julia) is a toolbox written in Julia providing a common interface and meta-algorithms for selecting, tuning, evaluating, composing and comparing about 200 machine learning models written in Julia and other languages. The functionality of MLJ is distributed over several repositories illustrated in the dependency chart below. These repositories live at the JuliaAI umbrella organization. -
25
BetaML.jl
Beta Machine Learning Toolkit
The Beta Machine Learning Toolkit is a package including many algorithms and utilities to implement machine learning workflows in Julia, Python, R and any other language with a Julia binding. All models are implemented entirely in Julia and are hosted in the repository itself (i.e. they are not wrapper to third-party models). If your favorite option or model is missing, you can try to implement it yourself and open a pull request to share it (see the section Contribute below) or request its implementation. ...
