Related papers: Universal performance bounds of restart
How long does a trajectory take to reach a stable equilibrium point in the basin of attraction of a dynamical system? This is a question of quite general interest, and has stimulated a lot of activities in dynamical and stochastic systems…
First Passage (FP) processes are utilized widely to model phenomena in many areas of mathematical applications, from biology to computer science. Introducing a mechanism to restart the parent process can alter the first passage…
Methods for the reduction of the complexity of computational problems are presented, as well as their connections to renormalization, scaling, and irreversible statistical mechanics. Several statistically stationary cases are analyzed; for…
Stochastic restarting is a strategy of starting anew. Incorporation of the resetting to the random walks can result in the decrease of the mean first passage time, due to the ability to limit unfavorably meandering, sub-optimal…
Performance modeling is a key issue in queuing theory and operation research. It is well-known that the length of a queue that awaits service or the time spent by a job in a queue depends not only on the service rate, but also crucially on…
We consider a combined restarting and adaptive backtracking strategy for the popular Fast Iterative Shrinking-Thresholding Algorithm frequently employed for accelerating the convergence speed of large-scale structured convex optimization…
Estimation of individual treatment effects is commonly used as the basis for contextual decision making in fields such as healthcare, education, and economics. However, it is often sufficient for the decision maker to have estimates of…
In reinforcement learning, a decision needs to be made at some point as to whether it is worthwhile to carry on with the learning process or to terminate it. In many such situations, stochastic elements are often present which govern the…
We study the statistics of infima, stopping times and passage probabilities of entropy production in nonequilibrium steady states, and show that they are universal. We consider two examples of stopping times: first-passage times of entropy…
Stochastic resetting has emerged as a useful strategy to reduce the completion time for a broad class of first passage processes. In the canonical setup, one intermittently resets a given system to its initial configuration only to start…
We revisit the classical problem of universal prediction of stochastic sequences with a finite time horizon $T$ known to the learner. The question we investigate is whether it is possible to derive vanishing regret bounds that hold with…
We consider the paradigm of an overdamped Brownian particle in a potential well, which is modulated through an external protocol, in the presence of stochastic resetting. Thus, in addition to the short range diffusive motion, the particle…
Resetting a stochastic process has been shown to expedite the completion time of some complex tasks, such as finding a target for the first time. Here we consider the cost of resetting by associating to each reset a cost, which is a…
We consider the motion of a randomly accelerated particle in one dimension under stochastic resetting mechanism. Denoting the position and velocity by $x$ and $v$ respectively, we consider two different resetting protocols - (i) complete…
We derive the statistics of the efficiency under the assumption that thermodynamic fluxes fluctuate with normal law, parametrizing it in terms of time, macroscopic efficiency, and a coupling parameter $\zeta$. It has a peculiar behavior: No…
Time estimation is a fundamental task that underpins precision measurement, global navigation systems, financial markets, and the organisation of everyday life. Many biological processes also depend on time estimation by nanoscale clocks,…
Stochastic resetting, the procedure of stopping and re-initializing random processes, has recently emerged as a powerful tool for accelerating processes ranging from queuing systems to molecular simulations. However, its usefulness is…
We provide a novel characterization of semiparametric efficiency in a generic supervised learning setting where the outcome mean function -- defined as the conditional expectation of the outcome of interest given the other observed…
Randomized algorithms sometimes employ a restart strategy. After a certain number of steps, the current computation is aborted and restarted with a new, independent random seed. In some cases, this results in an improved overall expected…
This paper provides a bound for the supremum of sample averages over a class of functions for a general class of mixing stochastic processes with arbitrary mixing rates. Regardless of the speed of mixing, the bound is comprised of a…