Affiliation:
1. Pensylvania State University, University Park, USA
2. MIT, Cambridge, MA, USA
Abstract
We present
smooth interpretation
, a method to systematically approximate numerical imperative programs by smooth mathematical functions. This approximation facilitates the use of numerical search techniques like gradient descent for program analysis and synthesis. The method extends to programs the notion of
Gaussian smoothing
, a popular signal-processing technique that filters out noise and discontinuities from a signal by taking its convolution with a Gaussian function.
In our setting, Gaussian smoothing executes a program according to a probabilistic semantics; the execution of program
P
on an input
x
after Gaussian smoothing can be summarized as follows: (1) Apply a Gaussian perturbation to
x
-- the perturbed input is a random variable following a normal distribution with mean
x
. (2) Compute and return the
expected output
of
P
on this perturbed input. Computing the expectation explicitly would require the execution of
P
on all possible inputs, but smooth interpretation bypasses this requirement by using a form of symbolic execution to approximate the effect of Gaussian smoothing on
P
. The result is an efficient but approximate implementation of Gaussian smoothing of programs.
Smooth interpretation has the effect of attenuating features of a program that impede numerical searches of its input space -- for example, discontinuities resulting from conditional branches are replaced by continuous transitions. We apply smooth interpretation to the problem of synthesizing values of numerical control parameters in embedded control applications. This problem is naturally formulated as one of numerical optimization: the goal is to find parameter values that minimize the error between the resulting program and a programmer-provided behavioral specification. Solving this problem by directly applying numerical optimization techniques is often impractical due to the discontinuities in the error function. By eliminating these discontinuities, smooth interpretation makes it possible to search the parameter space efficiently by means of simple gradient descent. Our experiments demonstrate the value of this strategy in synthesizing parameters for several challenging programs, including models of an automated gear shift and a PID controller.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Inference of Probabilistic Programs with Moment-Matching Gaussian Mixtures;Proceedings of the ACM on Programming Languages;2024-01-05
2. Smoothing Methods for Automatic Differentiation Across Conditional Branches;IEEE Access;2023
3. Towards Differentiable Agent-Based Simulation;ACM Transactions on Modeling and Computer Simulation;2022-10-31
4. Programming with neural surrogates of programs;Proceedings of the 2021 ACM SIGPLAN International Symposium on New Ideas, New Paradigms, and Reflections on Programming and Software;2021-10-17
5. Differentiable Agent-Based Simulation for Gradient-Guided Simulation-Based Optimization;Proceedings of the 2021 ACM SIGSIM Conference on Principles of Advanced Discrete Simulation;2021-05-21