Stars
A Python repository for finding the densest subgraph in a undirected graph
Further Adaptive Best-of-Both-Worlds Algorithm for Combinatorial Semi-Bandits
apricot implements submodular optimization for the purpose of selecting subsets of massive data sets to train machine learning models quickly. See the documentation page: https://apricot-select.rea…
This package provides an efficient implementation of locality-sensitve hashing (LSH)
Tutorial on amortized optimization for learning to optimize over continuous domains
Foundational Models for State-of-the-Art Speech and Text Translation
Modeling language for Mathematical Optimization (linear, mixed-integer, conic, semidefinite, nonlinear)
A Julia interface to the Coin-OR Branch and Cut solver (CBC)
Minimax Optimal Algorithms for Fixed-Budget Best Arm Identification
Book in preparation: introduction to theoretical computer science
Graphs.jl-formatted graph files taken from the SNAP Datasets collection.
This repo contains C code of some of the algorithms represented on the paper - https://link.springer.com/article/10.1007/s40747-018-0079-7
An optimized graphs package for the Julia programming language
Implementation of multi-armed bandits in Julia
Implementation of several algorithms for combinatorial bandits, a kind of reinforcement learning.
A software library for solving phase retrieval problems, and comparing phase retrieval methods.
randomized SVD with single pass over data matrix
Community detection in undirected graphs with non-negative weights
Top-m arm identification in linear bandit algorithms
Semidefinite programming optimization solver
Sketching-based Distributed Matrix Computations for Machine Learning
Python implementation of randomized SVD
Proof-of-concept implementation of the (dual) simplex algorithm for linear programming in Julia.