Pith. sign in

REVIEW 1 cited by

Deluca -- A Differentiable Control Library: Environments, Methods, and Benchmarking

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2102.09968 v1 pith:BXI2B35D submitted 2021-02-19 cs.RO cs.LG

Deluca -- A Differentiable Control Library: Environments, Methods, and Benchmarking

classification cs.RO cs.LG
keywords controlenvironmentslibrarydifferentiablemethodsdynamicalgradient-basedlinear
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We present an open-source library of natively differentiable physics and robotics environments, accompanied by gradient-based control methods and a benchmark-ing suite. The introduced environments allow auto-differentiation through the simulation dynamics, and thereby permit fast training of controllers. The library features several popular environments, including classical control settings from OpenAI Gym. We also provide a novel differentiable environment, based on deep neural networks, that simulates medical ventilation. We give several use-cases of new scientific results obtained using the library. This includes a medical ventilator simulator and controller, an adaptive control method for time-varying linear dynamical systems, and new gradient-based methods for control of linear dynamical systems with adversarial perturbations.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Differentiable Approximations for Distance Queries

    cs.CG 2026-07 conditional novelty 7.0

    A (1+ε)-approximate Euclidean distance function that is differentiable and returns gradients, using O(n/ε^(d/2)) space and O(log(n/ε)) query time.