Alternatives and similar repositories for OPOT:

Users that are interested in OPOT are comparing it to the libraries listed below

• eylonyogev / Where-s-That-Paper-
  A Chrome extension that automatically adds viewed academic papers to your favorites.
  ☆16Updated 6 years ago
• kexinrong / rehashing
  fast kernel evaluation in high dimensions via hashing
  ☆23Updated 4 years ago
• PrincetonLIPS / randomized_telescopes
  Code for "Efficient optimization of loops and limits with randomized telescoping sums"
  ☆27Updated 5 years ago
• microsoft / statopt
  Statistical adaptive stochastic optimization methods
  ☆33Updated 5 years ago
• twistedcubic / que-outlier-detection
  [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.
  ☆26Updated 5 years ago
• km-git-acc / dbn_upper_bound
  Computational effort to upper bound the de Bruijn-Newman constant as part of a Polymath project
  ☆13Updated last year
• offconvex / offconvex.github.io
  Off the convex path
  ☆67Updated 2 years ago
• ilyaraz / ot_estimators
  Implementations of several fast approximate algorithms for geometric optimal transport (OT)
  ☆118Updated 4 years ago
• nimaanari / theory.report
  Theory of Computing Report
  ☆12Updated 6 months ago
• VieCut / VieCut
  VieCut 1.00 - Shared-memory Minimum Cuts
  ☆44Updated 2 years ago
• isl-org / LMRS
  Source code for ICLR 2020 paper: "Learning to Guide Random Search"
  ☆39Updated 7 months ago
• mrtzh / Tex2Slide
  An easy way to get latex snippets into Keynote
  ☆22Updated 8 years ago
• probsys / optimal-approximate-sampling
  Optimal approximate sampling from discrete probability distributions
  ☆17Updated 4 years ago
• danspielman / Laplacians.jl
  Algorithms inspired by graph Laplacians: linear equation solvers, sparsification, clustering, optimization, etc.
  ☆224Updated 5 months ago
• PrincetonLIPS / reversible-inductive-construction
  Discrete Object Generation with Reversible Inductive Construction (NeurIPS 2019)
  ☆30Updated 4 years ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 4 years ago
• gtagency / graph-reduction
  ☆13Updated 9 years ago
• kedlaya / tetrahedra
  ☆35Updated 3 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆59Updated 2 weeks ago
• KarlsruheGraphGeneration / KaGen
  KaGen: Communication-free Massively Distributed Graph Generators
  ☆37Updated last month
• quasisphere / conv64
  Exact 64-bit convolution algorithm
  ☆15Updated 8 years ago
• fast-algos / graphs-matrices-optimization
  Lecture notes for CSC2421
  ☆10Updated 2 years ago
• lileicc / swift
  A compiler for BLOG probabilistic programming language
  ☆25Updated 7 years ago
• duvenaud / jaxde
  Prototypes of differentiable differential equation solvers in JAX.
  ☆27Updated 5 years ago
• dnbaker / frp
  FRP: Fast Random Projections
  ☆43Updated 4 years ago
• gpeyre / 2017-ot-beginners
  Optimal Transport for Dummies - Code, slides and article
  ☆32Updated 7 years ago
• optml / CoCoA
  ☆19Updated 7 years ago
• ekzhang / ekzhang.sty
  My personal LaTeX template, with sensible formatting and commands
  ☆16Updated 2 years ago
• miskcoo / kscore
  Nonparametric Score Estimators, ICML 2020
  ☆36Updated 3 years ago
• danspielman / YINSlex
  Computes lex minimizers / absolutely minimal Lipschitz extensions in graphs
  ☆17Updated 9 years ago