English
Related papers

Related papers: Comparing Two Approaches to Include Stochasticity …

200 papers

Monotone inclusions have a wide range of applications, including minimization, saddle-point, and equilibria problems. We introduce new stochastic algorithms, with or without variance reduction, to estimate a root of the expectation of…

Optimization and Control · Mathematics 2024-05-24 Abdurakhmon Sadiev , Laurent Condat , Peter Richtárik

Coupled problems with various combinations of multiple physics, scales, and domains can be found in numerous areas of science and engineering. A key challenge in the formulation and implementation of corresponding coupled models is to…

Analysis of PDEs · Mathematics 2012-07-05 Maarten Arnst , Roger Ghanem , Eric Phipps , John Red-Horse

We provide a novel computer-assisted technique for systematically analyzing first-order methods for optimization. In contrast with previous works, the approach is particularly suited for handling sublinear convergence rates and stochastic…

Optimization and Control · Mathematics 2021-12-22 Adrien Taylor , Francis Bach

Stochastic processes find applications in modelling systems in a variety of disciplines. A large number of stochastic models considered are Markovian in nature. It is often observed that higher order Markov processes can model the data…

Probability · Mathematics 2021-04-13 Suryadeepto Nag

We consider particles that are conditioned to initial and final states. The trajectory of these particles is uniquely shaped by the intricate interplay of internal and external sources of randomness. The internal randomness is aptly…

Optimization and Control · Mathematics 2023-09-13 Daniel Owusu Adu , Yongxin Chen

This paper introduces two mechanisms for computing over-approximations of sets of reachable states, with the aim of ensuring termination of state-space exploration. The first mechanism consists in over-approximating the automata…

Formal Languages and Automata Theory · Computer Science 2013-11-27 Alois Dreyfus , Pierre-Cyrille Heam , Olga Kouchnarenko

The application of formal methods to the analysis of stochastic oscillators has been at the focus of several research works in recent times. In this paper we provide insights on the application of an expressive temporal logic formalism,…

Formal Languages and Automata Theory · Computer Science 2014-10-16 Paolo Ballarini

For conventional smoothed particle hydrodynamics (SPH), obtaining the static solution of a problem is time-consuming. To address this drawback, we propose an efficient dynamic relaxation method by adding large artificial-viscosity-based…

Computational Engineering, Finance, and Science · Computer Science 2021-03-17 Yujie Zhu , Chi Zhang , Xiangyu Hu

Decentralized stochastic control refers to the multi-stage optimization of a dynamical system by multiple controllers that have access to different information. Decentralization of information gives rise to new conceptual challenges that…

Optimization and Control · Mathematics 2013-10-18 Aditya Mahajan , Mehnaz Mannan

Spatio-temporal Hawkes point processes are a particularly interesting class of stochastic point processes for modeling self-exciting behavior, in which the occurrence of one event increases the probability of other events occurring. These…

Computation · Statistics 2025-11-19 Alba Bernabeu , Jorge Mateu

We propose deterministic timed automata (DTA) as a model-independent language for specifying performance and dependability measures over continuous-time stochastic processes. Technically, these measures are defined as limit frequencies of…

Systems and Control · Computer Science 2015-03-17 Tomáš Brázdil , Jan Krčál , Jan Křetínský , Antonín Kučera , Vojtěch Řehák

Sampled semantics of timed automata is a finite approximation of their dense time behavior. While the former is closer to the actual software or hardware systems with a fixed granularity of time, the abstract character of the latter makes…

Formal Languages and Automata Theory · Computer Science 2015-07-01 Pavel Krcal , Parosh Aziz Abdulla , Wang Yi

Parametric analysis is a powerful tool for designing modern embedded systems, because it permits to explore the space of design parameters, and to check the robustness of the system with respect to variations of some uncontrollable…

Distributed, Parallel, and Cluster Computing · Computer Science 2013-02-07 Youcheng Sun , Romain Soulat , Giuseppe Lipari , Étienne André , Laurent Fribourg

Sequential decision problems in applications such as manipulation in warehouses, multi-step meal preparation, and routing in autonomous vehicle networks often involve reasoning about uncertainty, planning over discrete modes as well as…

Artificial Intelligence · Computer Science 2019-06-24 Shushman Choudhury , Mykel J. Kochenderfer

We present time-constrained automata (TCA), a model for hard real-time computation in which agents behaviors are modeled by automata and constrained by time intervals. TCA actions can have multiple start time and deadlines, can be…

Logic in Computer Science · Computer Science 2010-10-28 Matthieu Lemerre , Vincent David , Christophe Aussaguès , Guy Vidal-Naquet

Hybrid stochastic differential equations are a useful tool to model continuously varying stochastic systems which are modulated by a random environment that may depend on the system state itself. In this paper, we establish the pathwise…

Probability · Mathematics 2022-11-04 Hansjoerg Albrecher , Oscar Peralta

Stochastic solutions provide new rigorous results for nonlinear PDE's and, through its local non-grid nature, are a natural tool for parallel computation. There are two different approaches for the construction of stochastic solutions:…

Mathematical Physics · Physics 2012-09-17 Rui Vilela Mendes

The asymptotic pseudo-trajectory approach to stochastic approximation of Benaim, Hofbauer and Sorin is extended for asynchronous stochastic approximations with a set-valued mean field. The asynchronicity of the process is incorporated into…

Machine Learning · Statistics 2011-12-13 Steven Perkins , David S. Leslie

Distributed automata are finite-state machines that operate on finite directed graphs. Acting as synchronous distributed algorithms, they use their input graph as a network in which identical processors communicate for a possibly infinite…

Formal Languages and Automata Theory · Computer Science 2018-12-21 Fabian Reiter

Lifted probabilistic inference (Poole, 2003) and symbolic dynamic programming for lifted stochastic planning (Boutilier et al, 2001) were introduced around the same time as algorithmic efforts to use abstraction in stochastic systems. Over…

Artificial Intelligence · Computer Science 2017-01-05 Roni Khardon , Scott Sanner
‹ Prev 1 8 9 10 Next ›