ترغب بنشر مسار تعليمي؟ اضغط هنا

Decompositions of stochastic processes based on irreductible group representations

100   0   0.0 ( 0 )
 نشر من قبل Giovanni Peccati
 تاريخ النشر 2005
  مجال البحث
والبحث باللغة English
 تأليف Giovanni Peccati




اسأل ChatGPT حول البحث

Let G be a topological compact group acting on some space Y. We study a decomposition of Y-indexed stochastic processes, based on the orthogonality relations between the characters of the irreducible representations of G. In the particular case of a Gaussian process with a G-invariant law, such a decomposition gives a very general explanation of a classic identity in law - between quadratic functionals of a Brownian bridge - due to Watson (1961). Several relations with Karhunen-Lo`{e}ve expansions are discussed, and some applications and extensions are given - in particular related to Gaussian processes indexed by a torus.



قيم البحث

اقرأ أيضاً

Learning representations of stochastic processes is an emerging problem in machine learning with applications from meta-learning to physical object models to time series. Typical methods rely on exact reconstruction of observations, but this approach breaks down as observations become high-dimensional or noise distributions become complex. To address this, we propose a unifying framework for learning contrastive representations of stochastic processes (CRESP) that does away with exact reconstruction. We dissect potential use cases for stochastic process representations, and propose methods that accommodate each. Empirically, we show that our methods are effective for learning representations of periodic functions, 3D objects and dynamical processes. Our methods tolerate noisy high-dimensional observations better than traditional approaches, and the learned representations transfer to a range of downstream tasks.
We present a performant and rigorous algorithm for certifying that a matrix is close to being a projection onto an irreducible subspace of a given group representation. This addresses a problem arising when one seeks solutions to semi-definite progra ms (SDPs) with a group symmetry. Indeed, in this context, the dimension of the SDP can be significantly reduced if the irreducible representations of the group action are explicitly known. Rigorous numerical algorithms for decomposing a given group representation into irreps are known, but fairly expensive. To avoid this performance problem, existing software packages -- e.g. RepLAB, which motivated the present work -- use randomized heuristics. While these seem to work well in practice, the problem of to which extent the results can be trusted arises. Here, we provide rigorous guarantees applicable to finite and compact groups, as well as a software implementation that can interface with RepLAB. Under natural assumptions, a commonly used previous method due to Babai and Friedl runs in time O(n^5) for n-dimensional representations. In our approach, the complexity of running both the heuristic decomposition and the certification step is O(max{n^3 log n, D d^2 log d}), where d is the maximum dimension of an irreducible subrepresentation, and D is the time required to multiply elements of the group. A reference implementation interfacing with RepLAB is provided.
235 - Nicolas Privault 2018
These notes survey some aspects of discrete-time chaotic calculus and its applications, based on the chaos representation property for i.i.d. sequences of random variables. The topics covered include the Clark formula and predictable representation, anticipating calculus, covariance identities and functional inequalities (such as deviation and logarithmic Sobolev inequalities), and an application to option hedging in discrete time.
142 - Gechun Liang 2013
This paper shows that penalized backward stochastic differential equation (BSDE), which is often used to approximate and solve the corresponding reflected BSDE, admits both optimal stopping representation and optimal control representation. The new f eature of the optimal stopping representation is that the player is allowed to stop at exogenous Poisson arrival times. The convergence rate of the penalized BSDE then follows from the optimal stopping representation. The paper then applies to two classes of equations, namely multidimensional reflected BSDE and reflected BSDE with a constraint on the hedging part, and gives stochastic control representations for their corresponding penalized equations.
Using time-reversal, we introduce a stochastic integral for zero-energy additive functionals of symmetric Markov processes, extending earlier work of S. Nakao. Various properties of such stochastic integrals are discussed and an It^{o} formula for Dirichlet processes is obtained.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا