Transducing paths in graph classes with unbounded shrubdepth

sail-sg/inceptionnext 31 Mar 2022

Transductions are a general formalism for expressing transformations of graphs (and more generally, of relational structures) in logic.

Combinatorics Discrete Mathematics Logic in Computer Science Logic

0.75 stars / hour

Differentiating through Log-Log Convex Programs

cvxgrp/cvxpy 27 Apr 2020

We use the adjoint of the derivative to implement differentiable log-log convex optimization layers in PyTorch and TensorFlow.

Optimization and Control

0.07 stars / hour

Universal Average-Case Optimality of Polyak Momentum

d2l-ai/d2l-en 19 Aug 2020

Polyak momentum (PM), also known as the heavy-ball method, is a widely used optimization method that enjoys an asymptotic optimal worst-case complexity on quadratic objectives.

Optimization and Control

0.06 stars / hour

Solving N-player dynamic routing games with congestion: a mean field approach

deepmind/open_spiel AAMAS 2021

The recent emergence of navigational tools has changed traffic patterns and has now enabled new types of congestion-aware routing control like dynamic road pricing.

Dynamical Systems Systems and Control Systems and Control Optimization and Control

0.03 stars / hour

Embedded Code Generation with CVXPY

cvxgrp/cvxpygen 22 Mar 2022

We introduce CVXPYgen, a tool for generating custom C code, suitable for embedded applications, that solves a parametrized class of convex optimization problems.

Optimization and Control

0.03 stars / hour

Simple Iterative Incompressible Smoothed Particle Hydrodynamics

pypr/pysph 6 Aug 2019

A novel approach is used to ensure homogeneous particle distributions and improved boundary conditions.

Numerical Analysis Numerical Analysis Computational Physics

0.03 stars / hour

Gromov-Wasserstein Distances between Gaussian Distributions

MaximeVandegar/Papers-in-100-Lines-of-Code 16 Apr 2021

We also study the problem without restriction on the optimal plan, and provide lower and upper bounds for the value of the Gromov-Wasserstein distance between Gaussian distributions.


0.02 stars / hour

Hybrid scheme for Brownian semistationary processes

ryanmccrickerd/rough_bergomi 14 May 2017

The novel feature of the scheme is to approximate the kernel function by a power function near zero and by a step function elsewhere.

Probability Pricing of Securities

0.02 stars / hour

Convex optimization

cvxgrp/cvxpylayers 3 Jun 2021

First of all, the authors focused on the program of a two-semester course of lectures on convex optimization, which is given to students of MIPT.

Optimization and Control Numerical Analysis Numerical Analysis 65-01, 90-01, 65K05, 90C30, 90C90 G.1.6

0.02 stars / hour

Introducing the quadratically-constrained quadratic programming framework in HPIPM

giaf/hpipm 22 Dec 2021

This paper introduces the quadratically-constrained quadratic programming (QCQP) framework recently added in HPIPM alongside the original quadratic-programming (QP) framework.

Optimization and Control Systems and Control Systems and Control

0.02 stars / hour