Dynamic Programming Subject to Total Variation Distance Ambiguity
نویسندگان
چکیده
منابع مشابه
Optimal Control of Uncertain Stochastic Systems Subject to Total Variation Distance Uncertainty
This paper is concerned with optimization of uncertain stochastic systems, in which uncertainty is described by a total variation distance constraint between the measures induced by the uncertain systems and the measure induced by the nominal system, while the pay-off is a linear functional of the uncertain measure. Robustness at the abstract setting is formulated as a minimax game, in which th...
متن کاملTrends to Equilibrium in Total Variation Distance
This paper presents different approaches, based on functional inequalities, to study the speed of convergence in total variation distance of ergodic diffusion processes with initial law satisfying a given integrability condition. To this end, we give a general upper bound “à la Pinsker” enabling us to study our problem firstly via usual functional inequalities (Poincaré inequality, weak Poincar...
متن کاملExplaining and Controlling Ambiguity in Dynamic Programming
Ambiguity in dynamic programming arises from two independent sources, the non-uniqueness of optimal solutions and the particular recursion scheme by which the search space is evaluated. Ambiguity, unless explicitly considered, leads to unnecessarily complicated, in exible, and sometimes even incorrect dynamic programming algorithms. Building upon the recently developed algebraic approach to dyn...
متن کاملDynamic Programming: Minimum Edit Distance
with 3 edits (delete the C, delete the last A and insert a C). This is the best that can be done so the minimum edit distance is 3. The MED problem is an important problem that has many applications. For example in version control systems such as git or svn when you update a file and commit it, the system does not store the new version but instead only stores the “difference” from the previous ...
متن کاملTotal Variation Distance for Poisson Subset Numbers
Let n be an integer and A0, . . . , Ak random subsets of {1, . . . , n} of fixed sizes a0, . . . , ak, respectively chosen independently and uniformly. We provide an explicit and easily computable total variation bound between the distance from the random variable W = | ∩j=0 A j|, the size of the intersection of the random sets, to a Poisson random variable Z with intensity λ = EW . In particul...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Control and Optimization
سال: 2015
ISSN: 0363-0129,1095-7138
DOI: 10.1137/140955707