skip to main content

Title: Optimal finite-time processes in weakly driven overdamped Brownian motion
Abstract

The complete physical understanding of the optimization of the thermodynamic work still is an important open problem in stochastic thermodynamics. We address this issue using the Hamiltonian approach of linear response theory in finite time and weak processes. We derive the Euler–Lagrange equation associated and discuss its main features, illustrating them using the paradigmatic example of driven Brownian motion in overdamped regime. We show that the optimal protocols obtained either coincide, in the appropriate limit, with the exact solutions by stochastic thermodynamics or can be even identical to them, presenting the well-known jumps. However, our approach reveals that jumps at the extremities of the process are a good optimization strategy in the regime of fast but weak processes for any driven system. Additionally, we show that fast-but-weak optimal protocols are time-reversal symmetric, a property that has until now remained hidden in the exact solutions far from equilibrium.

Authors:
; ;
Award ID(s):
2010127
Publication Date:
NSF-PAR ID:
10369700
Journal Name:
Journal of Physics Communications
Volume:
6
Issue:
8
Page Range or eLocation-ID:
Article No. 083001
ISSN:
2399-6528
Publisher:
IOP Publishing
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract

    We analyze the fluctuation-driven escape of particles from a metastable state under the influence of a weak periodic force. We develop an asymptotic method to solve the appropriate Fokker–Planck equation with mixed natural and absorbing boundary conditions. The approach uses two boundary layers flanking an interior region; most of the probability is concentrated within the boundary layer near the metastable point of the potential and particles transit the interior region before exiting the domain through the other boundary layer, which is near the unstable maximal point of the potential. The dominant processes in each region are given by approximate time-dependent solutions matched to construct the approximate composite solution, which gives the rate of escape with weak periodic forcing. Using reflection we extend the method to a double well potential influenced by white noise and weak periodic forcing, and thereby derive a two-state stochastic model—the simplest treatment of stochastic resonance theory—in the nonadiabatic limit.

  2. The Sparsest Cut is a fundamental optimization problem that have been extensively studied. For planar inputs the problem is in P and can be solved in Õ(n 3 ) time if all vertex weights are 1. Despite a significant amount of effort, the best algorithms date back to the early 90’s and can only achieve O(log n)-approximation in Õ(n) time or 3.5-approximation in Õ(n 2 ) time [Rao, STOC92]. Our main result is an Ω(n 2−ε ) lower bound for Sparsest Cut even in planar graphs with unit vertex weights, under the (min, +)-Convolution conjecture, showing that approxima- tions are inevitable in the near-linear time regime. To complement the lower bound, we provide a 3.3-approximation in near-linear time, improving upon the 25-year old result of Rao in both time and accuracy. We also show that our lower bound is not far from optimal by observing an exact algorithm with running time Õ(n 5/2 ) improving upon the Õ(n 3 ) algorithm of Park and Phillips [STOC93]. Our lower bound accomplishes a repeatedly raised challenge by being the first fine-grained lower bound for a natural planar graph problem in P. Building on our construction we prove near-quadratic lower bounds under SETHmore »for variants of the closest pair problem in planar graphs, and use them to show that the popular Average-Linkage procedure for Hierarchical Clustering cannot be simulated in truly subquadratic time. At the core of our constructions is a diamond-like gadget that also settles the complexity of Diameter in distributed planar networks. We prove an Ω(n/ log n) lower bound on the number of communication rounds required to compute the weighted diameter of a network in the CONGET model, even when the underlying graph is planar and all nodes are D = 4 hops away from each other. This is the first poly(n) lower bound in the planar-distributed setting, and it complements the recent poly(D, log n) upper bounds of Li and Parter [STOC 2019] for (exact) unweighted diameter and for (1 + ε) approximate weighted diameter.« less
  3. ABSTRACT

    Upcoming galaxy surveys will allow us to probe the growth of the cosmic large-scale structure with improved sensitivity compared to current missions, and will also map larger areas of the sky. This means that in addition to the increased precision in observations, future surveys will also access the ultralarge-scale regime, where commonly neglected effects such as lensing, redshift-space distortions, and relativistic corrections become important for calculating correlation functions of galaxy positions. At the same time, several approximations usually made in these calculations such as the Limber approximation break down at those scales. The need to abandon these approximations and simplifying assumptions at large scales creates severe issues for parameter estimation methods. On the one hand, exact calculations of theoretical angular power spectra become computationally expensive, and the need to perform them thousands of times to reconstruct posterior probability distributions for cosmological parameters makes the approach unfeasible. On the other hand, neglecting relativistic effects and relying on approximations may significantly bias the estimates of cosmological parameters. In this work, we quantify this bias and investigate how an incomplete modelling of various effects on ultralarge scales could lead to false detections of new physics beyond the standard ΛCDM model. Furthermore, wemore »propose a simple debiasing method that allows us to recover true cosmologies without running the full parameter estimation pipeline with exact theoretical calculations. This method can therefore provide a fast way of obtaining accurate values of cosmological parameters and estimates of exact posterior probability distributions from ultralarge-scale observations.

    « less
  4. We study statistical inference and distributionally robust solution methods for stochastic optimization problems, focusing on confidence intervals for optimal values and solutions that achieve exact coverage asymptotically. We develop a generalized empirical likelihood framework—based on distributional uncertainty sets constructed from nonparametric f-divergence balls—for Hadamard differentiable functionals, and in particular, stochastic optimization problems. As consequences of this theory, we provide a principled method for choosing the size of distributional uncertainty regions to provide one- and two-sided confidence intervals that achieve exact coverage. We also give an asymptotic expansion for our distributionally robust formulation, showing how robustification regularizes problems by their variance. Finally, we show that optimizers of the distributionally robust formulations we study enjoy (essentially) the same consistency properties as those in classical sample average approximations. Our general approach applies to quickly mixing stationary sequences, including geometrically ergodic Harris recurrent Markov chains.
  5. Legged robots with point or small feet are nearly impossible to control instantaneously but are controllable over the time scale of one or more steps, also known as step-to-step control. Previous approaches achieve step-to-step control using optimization by (1) using the exact model obtained by integrating the equations of motion, or (2) using a linear approximation of the step-to-step dynamics. The former provides a large region of stability at the expense of a high computational cost while the latter is computationally cheap but offers limited region of stability. Our method combines the advantages of both. First, we generate input/output data by simulating a single step. Second, the input/output data is curve fitted using a regression model to get a closed-form approximation of the step-to-step dynamics. We do this model identification offline. Next, we use the regression model for online optimal control. Here, using the spring-load inverted pendulum model of hopping, we show that both parametric (polynomial and neural network) and non-parametric (gaussian process regression) approximations can adequately model the step-to-step dynamics. We then show this approach can stabilize a wide range of initial conditions fast enough to enable real-time control. Our results suggest that closed-form approximation of the step-to-step dynamicsmore »provides a simple accurate model for fast optimal control of legged robots.« less