Related papers: Optimal threshold resetting in collective diffusiv…
We are developing a general framework for using learned Bayesian models for decision-theoretic control of search and reasoningalgorithms. We illustrate the approach on the specific task of controlling both general and domain-specific…
There are a large variety of hybrid stochastic systems that couple a continuous process with some form of stochastic switching mechanism. In many cases the system switches between different discrete internal states according to a…
Although resetting has widespread applicability, applying it to the dynamics in the presence of spatial quenched disorder, which is essential in many physical problems, is challenging. In this study, we consider a well-known one-dimensional…
In this work we consider a stochastic movement process with random resets to the origin followed by a random residence time there before the walker restarts its motion. First, we study the transport properties of the walker, we derive an…
Retrieval data structures are data structures that answer key-value queries without paying the space overhead of explicitly storing keys. The problem can be formulated in four settings (static, value-dynamic, incremental, or dynamic), each…
Autonomous robotic systems require advanced control frameworks to achieve complex temporal objectives that extend beyond conventional stability and trajectory tracking. Signal Temporal Logic (STL) provides a formal framework for specifying…
Soft threshold pruning is among the cutting-edge pruning methods with state-of-the-art performance. However, previous methods either perform aimless searching on the threshold scheduler or simply set the threshold trainable, lacking…
Recent experiments have implemented resetting by means of a time-varying external harmonic trap whereby the trap stiffness is changed from an initial to a final value in finite-time and then the system is reset when it relaxes to an…
This article devotes to developing robust but simple correction techniques and efficient algorithms for a class of second-order time stepping methods, namely the shifted fractional trapezoidal rule (SFTR), for subdiffusion problems to…
The inclusion of a macroscopic adaptive threshold is studied for the retrieval dynamics of layered feedforward neural network models with synaptic noise. It is shown that if the threshold is chosen appropriately as a function of the…
Stochastic resetting is a rapidly developing topic in the field of stochastic processes and their applications. It denotes the occasional reset of a diffusing particle to its starting point and effects, inter alia, optimal first-passage…
In terms of the concepts of state and state transition, a new heuristic random search algorithm named state transition algorithm is proposed. For continuous function optimization problems, four special transformation operators called…
We study the counting of level crossings for inertial random processes exposed to stochastic resetting events. We develop the general approach of stochastic resetting for inertial processes with sudden changes in the state characterized by…
This paper considers time-average stochastic optimization, where a time average decision vector, an average of decision vectors chosen in every time step from a time-varying (possibly non-convex) set, minimizes a convex objective function…
We present a novel approach, referred to as the 'threshold shift method' (TSM), for reliability based design optimization (RBDO). The proposed approach is similar in spirit with the sequential optimization and reliability analysis (SORA)…
In recent years, random subspace methods have been actively studied for large-dimensional nonconvex problems. Recent subspace methods have improved theoretical guarantees such as iteration complexity and local convergence rate while…
We address the problem of minimizing the expected first-passage time of a Brownian motion with Poissonian resetting, with respect to the resetting rate $r.$ We consider both the one-boundary and the two-boundary cases.We investigate the…
Thresholding based iterative algorithms have the trade-off between effectiveness and optimality. Some are effective but involving sub-matrix inversions in every step of iterations. For systems of large sizes, such algorithms can be…
We introduce exponential search trees as a novel technique for converting static polynomial space search structures for ordered sets into fully-dynamic linear space data structures. This leads to an optimal bound of O(sqrt(log n/loglog n))…
Efficient search acts as a strong selective force in biological systems ranging from cellular populations to predator-prey systems. The search processes commonly involve finding a stationary or mobile target within a heterogeneously…