Related papers: Adversarial ergodic optimization

In the simplest sequential decision problem for an ergodic stochastic process X, at each time n a decision u_n is made as a function of past observations X_0,...,X_{n-1}, and a loss l(u_n,X_n) is incurred. In this setting, it is known that…

The theory of ergodic optimization for distance-expanding maps is extended to Gauss's continued fraction map. Since the set of invariant probability measures is not weak$^*$ closed, we establish a characterisation of the closure of this…

We study the optimization of ergodic averages for multi-valued dynamical systems, i.e. where points may have multiple different forward orbits. Under upper semi-continuity assumptions, we show that the maximum space average with respect to…

Ergodic optimization is the study of problems relating to maximizing orbits, maximizing invariant measures and maximum ergodic averages. An orbit of a dynamical system is called f-maximizing if the time average of the real-valued function f…

If $\pi:(X,T)\to(Z,S)$ is a topological factor map between uniquely ergodic topological dynamical systems, then $(X,T)$ is called an isomorphic extension of $(Z,S)$ if $\pi$ is also a measure-theoretic isomorphism. We consider the case when…

For any 1-lipschitz ergodic map $F:\; \mathbb{Z}^{k}_{p} \mapsto \mathbb{Z}^{k}_{p},\;k>1\in\mathbb{N},$ there are 1-lipschitz ergodic map $G:\; \mathbb{Z}_{p} \mapsto \mathbb{Z}_{p}$ and two bijection $H_k$, $T_{k,\;P}$ that $$G = H_{k}…

In this work, we show the consistency of an approach for solving robust optimization problems using sequences of sub-problems generated by ergodic measure preserving transformations. The main result of this paper is that the minimizers and…

We study the ergodic optimization problem over a real analytic expanding circle map. We show that in both the topological and the measure-theoretical senses, a typical $C^r$ performance function has a unique maximizing measure and the…

One of the fundamental results of ergodic optimization asserts that for any dynamical system on a compact metric space with the specification property and for a generic continuous function $f$ every invariant probability measure that…

In this article, we consider the weighted ergodic optimization problem of a class of dynamical systems $T:X\to X$ where $X$ is a compact metric space and $T$ is Lipschitz continuous. We show that once $T:X\to X$ satisfies both the {\em…

Let $(X,T)$ be a topological dynamical system with metric $d$. We define a new function $\overline{F}(x,y)=\limsup\limits_{n \to +\infty} \inf\limits_{\sigma \in S_n} \frac 1n \sum\limits_{k=1}^n d(T^k x,T^{\sigma(k)} y)$ by using…

A rather general ergodic type scheme is presented on arbitrary sets X, as they are generated by arbitrary mappings T : X \longrightarrow X. The structures considered on X are given by suitable subsets of the set of all of its finite…

We continue our study of the dynamics of mappings with small topological degree on (projective) complex surfaces. Previously, under mild hypotheses, we have constructed an ergodic ``equilibrium'' measure for each such mapping. Here we study…

Topological mapping of a large physical system on a graph, and its decomposition using universal measures is proposed. We find inherent limits to the potential for optimization of a given system and its approximate representations by…

This paper investigates the optimal ergodic sublinear convergence rate of the relaxed proximal point algorithm for solving monotone variational inequality problems. The exact worst case convergence rate is computed using the performance…

We extend the data compression theorem to the case of ergodic quantum information sources. Moreover, we provide an asymptotically optimal compression scheme which is based on the concept of high probability subspaces. The rate of this…

Given an ergodic dynamical system $(X, \mathcal{B}, \mu, T)$, we prove that for each function $f$ belonging to the Orlicz space $L(\log L)^2(\log \log L)(X, \mu)$, the ergodic averages \[ \frac{1}{\pi(N)} \sum_{p \in \mathbb{P}_N} f\big(T^p…

We study certain topological problems that are inspired by applications to autonomous robot manipulation. Consider a continuous map $f\colon X\to Y$, where $f$ can be a kinematic map from the configuration space $X$ to the working space $Y$…

We give an upper bound for the topological entropy of maps on inverse limit spaces in terms of their set-valued components. In a special case of a diagonal map on the inverse limit space $\underleftarrow{\lim}(I,f)$, where every diagonal…

Information Geometry has been used to inspire efficient algorithms for stochastic optimization, both in the combinatorial and the continuous case. We give an overview of the authors' research program and some specific contributions to the…