Continuity Properties of Law-Invariant (Quasi-)Convex Risk Functions on L∞
Graph Chatbot
Chattez avec Graph Search
Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.
AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.
Image recovery in optical interferometry is an ill-posed nonlinear inverse problem arising from incomplete power spectrum and bi-spectrum measurements. We formulate a linear version of the problem for the order-3 tensor formed by the tensor product of the ...
We have studied a camera with a very large number of binary pixels referred to as the gigavision camera or the gigapixel digital film camera. Potential advantages of this new camera design include improved dynamic range, thanks to its logarithmic sensor re ...
Transformation invariance is an important property in pattern recognition, where different observations of the same object typically receive the same label. This paper focuses on a transformation invariant distance measure that represents the minimum dista ...
Any finite, separately convex, positively homogeneous function on R2 is convex. This was first established by the first author ["Direct methods in calculus of variations", Springer-Verlag (1989)]. Here we give a new and concise proof of this re ...
We present and compare two different approaches to conditional risk measures. One approach draws from convex analysis in vector spaces and presents risk measures as functions on Lp spaces, while the other approach utilizes module-based convex analysis wher ...
Machine learning is most often cast as an optimization problem. Ideally, one expects a convex objective function to rely on efficient convex optimizers with nice guarantees such as no local optima. Yet, non-convexity is very frequent in practice and it may ...
We consider minimization problems that are compositions of convex functions of a vector \x∈RN with submodular set functions of its support (i.e., indices of the non-zero coefficients of \x). Such problems are in general difficult for large N ...
Motivated by financial applications, we study convex analysis for modules over the ordered ring L0 of random variables. We establish a module analogue of locally convex vector spaces, namely locally L0-convex modules. In this context, we prove hyperplane s ...
This paper provides some useful results for convex risk measures. In fact, we consider convex functions on a locally convex vector space E which are monotone with respect to the preference relation implied by some convex cone and invariant with respect to ...
We define ``random trip", a generic mobility model for independent mobiles that contains as special cases: the random waypoint on convex or non convex domains, random walk with reflection or wrapping, city section, space graph and other models. We use Palm ...
