Trending Research
Transducing paths in graph classes with unbounded shrubdepth
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
Differentiating through Log-Log Convex Programs
We use the adjoint of the derivative to implement differentiable log-log convex optimization layers in PyTorch and TensorFlow.
Optimization and Control
Universal Average-Case Optimality of Polyak Momentum
d2l-ai/d2l-en
•
•
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
Solving N-player dynamic routing games with congestion: a mean field approach
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
Embedded Code Generation with CVXPY
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
Simple Iterative Incompressible Smoothed Particle Hydrodynamics
A novel approach is used to ensure homogeneous particle distributions and improved boundary conditions.
Numerical Analysis Numerical Analysis Computational Physics
Gromov-Wasserstein Distances between Gaussian Distributions
MaximeVandegar/Papers-in-100-Lines-of-Code
•
•
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.
Probability
Hybrid scheme for Brownian semistationary processes
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
Convex optimization
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
Introducing the quadratically-constrained quadratic programming framework in HPIPM
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
