A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
The paper explores dynamic regret with switching cost in online decision making.
problem The relation between dynamic regret and switching cost in online decision making.
method Investigates two classic online settings: Online Algorithms (OA) and Online Convex Optimization (OCO). Provides a new theoretical analysis framework.
result The switching cost impacts dynamic regret differently in OA and has no impact in OCO.
In this paper, we prove a limit set intersection theorem in relatively hyperbolic groups. Our approach is based on a study of dynamical quasiconvexity of relatively quasiconvex subgroups. Using dynamical quasiconvexity, many well-known results on limit sets of geometrically finite Kleinian groups are derived in general…
This paper gives an overview of the theory of dynamic convex risk measures for random variables in discrete time setting. We summarize robust representation results of conditional convex risk measures, and we characterize various time consistency properties of dynamic risk measures in terms of acceptance sets, penalty …
In this paper we propose the notion of dynamic deviation measure, as a dynamic time-consistent extension of the (static) notion of deviation measure. To achieve time-consistency we require that a dynamic deviation measures satisfies a generalised conditional variance formula. We show that, under a domination condition,…
We investigate the random dynamics of polynomial maps on the Riemann sphere and the dynamics of semigroups of polynomial maps on the Riemann sphere. In particular, the dynamics of a semigroup G of polynomials whose planar postcritical set is bounded and the associated random dynamics are studied. In general, the Juli…
This paper demonstrates dynamic hyper-parameter setting, for deep neural network training, using Mutual Information (MI). The specific hyper-parameter studied in this paper is the learning rate. MI between the output layer and true outcomes is used to dynamically set the learning rate of the network through the trainin…
In this paper we present a theoretical framework for studying coherent acceptability indices in a dynamic setup. We study dynamic coherent acceptability indices and dynamic coherent risk measures, and we establish a duality between them. We derive a representation theorem for dynamic coherent risk measures in terms of …
Many complex dynamical phenomena can be effectively modeled by a system that switches among a set of conditionally linear dynamical modes. We consider two such models: the switching linear dynamical system (SLDS) and the switching vector autoregressive (VAR) process. Our Bayesian nonparametric approach utilizes a hiera…
This paper introduces a linear state-space model with time-varying dynamics. The time dependency is obtained by forming the state dynamics matrix as a time-varying linear combination of a set of matrices. The time dependency of the weights in the linear combination is modelled by another linear Gaussian dynamical model…
Different approaches to defining dynamic market risk measures are available in the literature. Most are focused or derived from probability theory, economic behavior or dynamic programming. Here, we propose an approach to define and implement dynamic market risk measures based on recursion and state economy representat…
Pairs (Hamiltonian system, Lagrangian distribution), called dynamical Lagrangian distributions, appear naturally in Differential Geometry, Calculus of Variations and Rational Mechanics. The basic differential invariants of a dynamical Lagrangian distribution w.r.t. the action of the group of symplectomorphisms of the a…
Study connects bank default models using dynamic contagion.
problem Understanding default contagion in heterogeneous interbank systems.
method Proposes a dynamic default contagion model with endogenous early defaults for a finite set of banks, reformulating as a stochastic particle system.
result Existence of clearing systems and continuity of the system response for the mean-field problem.
In this paper, we study online convex optimization in dynamic environments, and aim to bound the dynamic regret with respect to any sequence of comparators. Existing work have shown that online gradient descent enjoys an O(T(1+PT)) dynamic regret, where T is the number of iterations and PT is the path-le…