English
Related papers

Related papers: A Faster-Than Relation for Semi-Markov Decision Pr…

200 papers

Semiparametric accelerated failure time (AFT) models directly relate the predicted failure times to covariates and are a useful alternative to models that work on the hazard function or the survival function. For case-cohort data, much less…

Computation · Statistics 2022-12-15 Steven Chiou , Sangwook Kang , Jun Yan

Optimization of decision problems in stochastic environments is usually concerned with maximizing the probability of achieving the goal and minimizing the expected episode length. For interacting agents in time-critical applications,…

Artificial Intelligence · Computer Science 2007-05-23 Balint Takacs , Istvan Szita , Andras Lorincz

It is common, when dealing with quantum processes involving a subsystem of a much larger composite closed system, to treat them as effectively memory-less (Markovian). While open systems theory tells us that non-Markovian processes should…

Quantum Physics · Physics 2019-05-02 Pedro Figueroa-Romero , Kavan Modi , Felix A. Pollock

Correlations between spacelike separated measurements on entangled quantum systems are stronger than any classical correlations and are at the heart of numerous quantum technologies. In practice, however, spacelike separation is often not…

Quantum Physics · Physics 2017-11-28 Martin Ringbauer , Rafael Chaves

In the dynamics of open quantum systems, information may propagate in time through either the system or the environment, giving rise to Markovian and non-Markovian temporal correlations, respectively. However, despite their notable…

Quantum Physics · Physics 2024-06-04 Guilherme Zambon , Diogo O. Soares-Pinto

A Spartan random process (SRP) is used to estimate the correlation structure of time series and to predict (extrapolate) the data values. SRP's are motivated from statistical physics, and they can be viewed as Ginzburg-Landau models. The…

Physics and Society · Physics 2012-12-24 M. Zukovic , D. T. Hristopulos

We propose a simple technique for verifying probabilistic models whose transition probabilities are parametric. The key is to replace parametric transitions by nondeterministic choices of extremal values. Analysing the resulting…

Logic in Computer Science · Computer Science 2016-05-27 Tim Quatmann , Christian Dehnert , Nils Jansen , Sebastian Junges , Joost-Pieter Katoen

We study the Parallel Replica Dynamics in a general setting. We introduce a trajectory fragment framework that can be used to design and prove consistency of Parallel Replica algorithms for generic Markov processes. We use our framework to…

Numerical Analysis · Mathematics 2022-04-22 David Aristoff

This paper proposes an analytical framework for modelling resource contention in multi-robot systems, where the travel times and task durations are uncertain. It uses several approximation methods to quickly and accurately calculate the…

Multiagent Systems · Computer Science 2020-03-17 Andrew W. Palmer , Andrew J. Hill , Steven J. Scheding

Recommender systems are central to modern online platforms, but a popular concern is that they may be pulling society in dangerous directions (e.g., towards filter bubbles). However, a challenge with measuring the effects of recommender…

Computers and Society · Computer Science 2021-10-25 Serina Chang , Johan Ugander

This paper introduces a problem in which the state of a system needs to be determined through costly tests of its components by a limited number of testing units and before a given deadline. We also consider a closely related search problem…

Discrete Mathematics · Computer Science 2021-01-15 Alessandro Agnetis , Ben Hermans , Roel Leus , Salim Rostami

We study the problem of learning Markov decision processes with finite state and action spaces when the transition probability distributions and loss functions are chosen adversarially and are allowed to change with time. We introduce an…

Machine Learning · Computer Science 2013-03-14 Yasin Abbasi-Yadkori , Peter L. Bartlett , Csaba Szepesvari

Current AI systems lack several important human capabilities, such as adaptability, generalizability, self-control, consistency, common sense, and causal reasoning. We believe that existing cognitive theories of human decision making, such…

In competitive parallel computing, the identical copies of a code in a phase of a sequential program are assigned to processor cores and the result of the fastest core is adopted. In the literature, it is reported that a superlinear speedup…

Distributed, Parallel, and Cluster Computing · Computer Science 2019-08-22 Naoki Yonezawa

In this paper, we propose a new framework for designing fast parallel algorithms for fundamental statistical subset selection tasks that include feature selection and experimental design. Such tasks are known to be weakly submodular and are…

Machine Learning · Computer Science 2021-04-02 Sharon Qian , Yaron Singer

For discrete-time stochastic processes, there is a close connection between return/waiting times and entropy. Such a connection cannot be straightforwardly extended to the continuous-time setting. Contrarily to the discrete-time case one…

Probability · Mathematics 2007-05-23 Jean-Rene Chazottes , Cristian Giardina , Frank Redig

Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components, as well as communications between these components. Moreover, to model concurrent and…

Quantum Physics · Physics 2007-05-23 Marie Lalire

This paper establishes the equivalence between systems described by a single first-order hyperbolic partial differential equation and systems described by integral delay equations. System-theoretic results are provided for both classes of…

Optimization and Control · Mathematics 2019-02-20 Iasson Karafyllis , Miroslav Krstic

This paper considers a half-duplex scenario where an interferer behaves according to a parametric model but the values of the model parameters are unknown. We explore the necessary number of sensing steps to gather sufficient knowledge…

Information Theory · Computer Science 2024-10-11 Vincent Corlay , Jean-Christophe Sibel , Nicolas Gresset

Recently, the ParaOpt algorithm was proposed as an extension of the time-parallel Parareal method to optimal control. ParaOpt uses quasi-Newton steps that each require solving a system of matching conditions iteratively. The…

Numerical Analysis · Mathematics 2024-12-04 Corentin Bonte , Arne Bouillon , Giovanni Samaey , Karl Meerbergen