Related papers: Adversarial ergodic optimization
We construct exponential maps for which the singular value tends to infinity under iterates while the maps are ergodic. This is in contrast with a result of Lyubich from 1987 which tells that $e^z$ is not ergodic.
In this work a method for statistical analysis of time series is proposed, which is used to obtain solutions to some classical problems of mathematical statistics under the only assumption that the process generating the data is stationary…
We study the problem of detecting zeros of continuous functions that are known only up to an error bound, extending the earlier theoretical work with explicit algorithms and experiments with an implementation. More formally, the robustness…
For optimal control problems on finite graphs in continuous time, the dynamic programming principle leads to value functions characterized by systems of nonlinear ordinary differential equations. In this paper, we consider the case of…
This work presents the multiharmonic analysis and derivation of functional type a posteriori estimates of a distributed eddy current optimal control problem and its state equation in a time-periodic setting. The existence and uniqueness of…
Extremal Optimization, a recently introduced meta-heuristic for hard optimization problems, is analyzed on a simple model of jamming. The model is motivated first by the problem of finding lowest energy configurations for a disordered spin…
We study the adversarial satisfiability problem, where the adversary can choose whether variables are negated in clauses or not in order to make the resulting formula unsatisfiable. This is one case of a general class of adversarial…
In computational PDE-based inverse problems, a finite amount of data is collected to infer unknown parameters in the PDE. In order to obtain accurate inferences, the collected data must be informative about the unknown parameters. How to…
Ergodic Optimization is the process of finding invariant probability measures that maximize the integral of a given function. It has been conjectured that "most" functions are optimized by measures supported on a periodic orbit, and it has…
Risk-sensitive control balances performance with resilience to unlikely events in uncertain systems. This paper introduces ergodic-risk criteria, which capture long-term cumulative risks through probabilistic limit theorems. By ensuring the…
The objective of this paper is to characterize the structure of the set $\Theta$ for a continuous ergodic upper probability $\mathbb{V}=\sup_{P\in\Theta}P$ (Theorem \ref {main result}): . $\Theta$ contains a finite number of ergodic…
We study a dynamical system with time dependent Hamiltonian by numerical experiments so as to find a relation between thermodynamics and chaotic nature of the system. Excess information loss, defined newly based on Lyapunov analysis, is…
The main theme of this thesis is the development of computational methods for classes of infinite-dimensional optimization problems arising in optimal control and information theory. The first part of the thesis is concerned with the…
We consider the problem of decision-making with side information and unbounded loss functions. Inspired by probably approximately correct learning model, we use a slightly different model that incorporates the notion of side information in…
We propose a formal expansion of the transfer entropy to put in evidence irreducible sets of variables which provide information for the future state of each assigned target. Multiplets characterized by a large contribution to the expansion…
We prove a model theorem for factor maps between ergodic, infinite measure-preserving systems.
The goal of this paper is to explore the basic Approximate Bayesian Computation (ABC) algorithm via the lens of information theory. ABC is a widely used algorithm in cases where the likelihood of the data is hard to work with or…
Ergodic theory includes several notions of entropy for probability-preserving actions of countable groups. These include Kolmogorov--Sinai entropy based on F\o lner sequences for amenable groups, entropy defined using a random ordering of…
In this article, we continue the structural study of factor maps betweeen symbolic dynamical systems and the relative thermodynamic formalism. Here, one is studying a factor map from a shift of finite type $X$ (equipped with a potential…
In this paper we describe a triple correspondence between graph limits, information theory and group theory. We put forward a new graph limit concept called log-convergence that is closely connected to dense graph limits but its main…