Alternatives and similar repositories for Legendre-decomposition

Users that are interested in Legendre-decomposition are comparing it to the libraries listed below

• Sohl-Dickstein / Minimum-Probability-Flow-Learning
  Matlab code implementing Minimum Probability Flow Learning.
  ☆69Updated 11 years ago
• Bihaqo / TT-MRF
  ☆14Updated 10 years ago
• ermongroup / SPN_Variational_Inference
  PyTorch implementation for "Probabilistic Circuits for Variational Inference in Discrete Graphical Models", NeurIPS 2020
  ☆17Updated 3 years ago
• deep-spin / lp-sparsemap
  LP-SparseMAP: Differentiable sparse structured prediction in coarse factor graphs
  ☆41Updated last year
• anirudh9119 / walkback_nips17
  Variational Walkback, NIPS'17
  ☆28Updated 7 years ago
• wouterkool / estimating-gradients-without-replacement
  Estimating Gradients for Discrete Random Variables by Sampling without Replacement
  ☆40Updated 5 years ago
• Runjing-Liu120 / RaoBlackwellizedSGD
  A public repository for our paper, Rao-Blackwellized Stochastic Gradients for Discrete Distributions
  ☆22Updated 6 years ago
• kd383 / GPML_SLD
  Scalable Log Determinants for Gaussian Process Kernel Learning (https://arxiv.org/abs/1711.03481) (NIPS 2017)
  ☆18Updated 7 years ago
• timvieira / hypergraphs
  Reference implementations of basic and advanced hypergraph algorithms.
  ☆49Updated last year
• andre-martins / AD3
  Alternating Directions Dual Decomposition
  ☆69Updated 5 years ago
• mblondel / projection-losses
  Python implementation of projection losses.
  ☆27Updated 5 years ago
• PrincetonLIPS / randomized_telescopes
  Code for "Efficient optimization of loops and limits with randomized telescoping sums"
  ☆27Updated 6 years ago
• harvardnlp / strux
  ☆18Updated 3 years ago
• changliu00 / FGH-flow
  Codes for "Understanding MCMC Dynamics as Flows on the Wasserstein Space" (ICML-19)
  ☆12Updated 5 years ago
• cmaddis / astar-sampling
  A generic Monte Carlo method based on the Gumbel-Max trick.
  ☆32Updated 9 years ago
• wittawatj / kernel-gof
  NeurIPS 2017 best paper. An interpretable linear-time kernel goodness-of-fit test.
  ☆67Updated 6 years ago
• wittawatj / interpretable-test
  NeurIPS 2016. Linear-time interpretable nonparametric two-sample test.
  ☆64Updated 7 years ago
• ganguli-lab / proxalgs
  Proximal algorithms and operators in python
  ☆26Updated 6 years ago
• mstaib / stochastic-barycenter-code
  Supporting code for "Parallel Streaming Wasserstein Barycenters"
  ☆10Updated 7 years ago
• cchangyou / Santa
  Code for the Santa algorithm for deep learning
  ☆17Updated 7 years ago
• andymiller / ReducedVarianceReparamGradients
  Reducing Reparameterization Gradient Variance code.
  ☆33Updated 8 years ago
• mblondel / smooth-ot
  Python implementation of smooth optimal transport.
  ☆60Updated 4 years ago
• google / gumbel_sinkhorn
  ☆76Updated 8 years ago
• zihangdai / reexamine-srnn
  ☆12Updated 5 years ago
• wittawatj / kernel-mod
  NeurIPS 2018. Linear-time model comparison tests.
  ☆18Updated 5 years ago
• PrincetonLIPS / reversible-inductive-construction
  Discrete Object Generation with Reversible Inductive Construction (NeurIPS 2019)
  ☆30Updated 4 years ago
• karlnapf / kernel_hmc
  Code for NIPS 2015 "Gradient-Free Hamiltonian Monte Carlo via Effecient Kernel Exponential Families"
  ☆25Updated 7 years ago
• jeanfeydy / global-divergences
  MMD, Hausdorff and Sinkhorn divergences scaled up to 1,000,000 samples.
  ☆56Updated 6 years ago
• franrruiz / vcd_divergence
  Code to minimize the Variational Contrastive Divergence (VCD)
  ☆29Updated 6 years ago
• t-vi / candlegp
  Gaussian Processes in Pytorch
  ☆75Updated 5 years ago