Research
On-device research index

arXiv research

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.

168,695 papers · 148 categories

Trend · papers per month

4895143190 · May 202619922001200920172026
48 results for background risk

The paper examines how background risk affects portfolio selection and optimal reinsurance design.

problem Maximizing the probability of reaching a financial goal in the presence of background risk.
method Quantile formulation method to derive optimal solutions explicitly.
result The presence of background risk does not change the solution shape but alters the parameter values.

In the study of investment problem, aside from the investment risk the background risk appears. Both the investment risk and the background risk are probabilistically described by random variables. This paper starts from the hypothesis that the two types of risk can be represented both probabilistically (by random vari…

2018-12-08abs ↗pdf ↗

Investment and insurance decisions are studied in a model with nonlinear portfolio frictions and background risk.

problem Investment and insurance decisions under a model with nonlinear portfolio frictions and background risk.
method Dynamic programming approach to find optimality conditions.
result Agent can choose to assume, partially assume, or purchase total insurance against adverse jumps in wealth.

The work deals with the risk assessment theory. An unitary risk algorithm is elaborated. The algorithm is based on parallel curves. The basic curve of risk is a hyperbolic curve, obtained as a multiplication between the probability of occurrence of certain event and its impact. Section 1 contains the problem formulatio…

2013-03-07abs ↗pdf ↗

Study uses copulas and DCC-GARCH for multivariate risk analysis of VaR and CVaR.

problem Multivariate risk analysis for Value at Risk (VaR) and Conditional Value at Risk (CoVaR).
method Copulas and Dynamic Conditional Correlation (DCC)-GARCH models applied to historical financial data.
result Comparison of different copula families for goodness-of-fit and effectiveness.

We define risk-free portfolios using three gauge invariant differential operators that require such portfolios to be insensitive to price changes, to be self-financing, and to produce a zero real return so there are no risk-free profits. This definition identifies the risk-free rate as the return of an infinitely diver…

2016-05-11abs ↗pdf ↗

The paper introduces a new class of multivariate mixtures for actuarial applications.

problem Developing a new class of multivariate mixtures for actuarial calculations.
method Proposed a class of multivariate matrix-exponential affine mixtures with matrix-exponential marginals.
result Explicit calculations of actuarial quantities are possible due to the proposed class's properties.

The paper calculates MES bounds for systemic risk contributions under uncertain dependence.

problem Measuring systemic risk contributions of financial firms under uncertainty in dependence structure.
method Derives worst-case and best-case bounds for MES under known individual firm risks and partial dependence information.
result Improved MES bounds derived for various types of dependence models.

This paper discusses the role of risk communication in macroprudential oversight and of visualization in risk communication. Beyond the soar in data availability and precision, the transition from firm-centric to system-wide supervision imposes vast data needs. Moreover, except for internal communication as in any orga…

2014-04-17abs ↗pdf ↗

Derives path-integrals for superstrings on curved backgrounds using string geometry theory.

problem Calculating path-integrals for superstrings on curved backgrounds.
method Derives path-integrals from string geometry theory by considering fluctuations around string backgrounds.
result Derives path-integrals for perturbative superstrings on all string backgrounds.

Derives path integrals for perturbative strings on various backgrounds.

problem Calculating path integrals for strings on curved backgrounds.
method Derives path integrals from string geometry theory by considering fluctuations around string backgrounds.
result Derives path integrals of all order perturbative strings on various backgrounds.

This article contains the first published example of a real economic balance sheet where the Solvency II ratio substantially depends on the seed selected for the random number generator (RNG) used. The theoretical background and the main quality criteria for RNGs are explained in detail. To serve as a gauge for RNGs, a…

2018-01-16abs ↗pdf ↗

We describe the construction of a Lie superalgebra associated to an arbitrary supersymmetric M-theory background, and discuss some examples. We prove that for backgrounds with more than 24 supercharges, the bosonic subalgebra acts locally transitively. In particular, we prove that backgrounds with more than 24 supersym…

2004-09-16abs ↗pdf ↗

SRTC model for background/foreground separation with missing pixels.

problem Background/foreground separation with missing pixels in videos.
method Smooth robust tensor completion (SRTC) model with tensor proximal alternating minimization (tenPAM).
result Global convergence guarantee for the proposed algorithm.

Motivated by the search for new gravity duals to M2 branes with N>4N>4 supersymmetry --- equivalently, M-theory backgrounds with Killing superalgebra osp(N4)\mathfrak{osp}(N|4) for N>4N>4 --- we classify homogeneous M-theory backgrounds with symmetry Lie algebra so(n)so(3,2)\mathfrak{so}(n) \oplus \mathfrak{so}(3,2) for n=5,6,7n=5,6,7. We f…

2015-11-11abs ↗pdf ↗

We explore all warped AdS4×wMD4AdS_4\times_w M^{D-4} backgrounds with the most general allowed fluxes that preserve more than 16 supersymmetries in D=10D=10- and 1111-dimensional supergravities. After imposing the assumption that either the internal space MD4M^{D-4} is compact without boundary or the isometry algebra of the back…

2017-11-22abs ↗pdf ↗

Study predicts risk of true-lumen narrowing after ATAAD surgery using CT data.

problem Early post-surgery risk assessment for aortic dissection patients.
method Retrospective study with CT data, derived cross-sectional shapes, form factor (FF) for morphology assessment, linear discriminant analysis (LDA) for risk classification, LOPO-CV for prediction.
result Machine-learning model accurately predicts risk for all high-risk patients and low-risk patients, potentially reducing hospital visits.

In this paper we study homogeneous backgrounds of type IIB supergravity where the underlying geometry is that of a symmetric space. We determine which ten-dimensional lorentzian symmetric spaces (up to local isometry) admit such backgrounds and in about two thirds of the cases we determine fully their moduli space.

2012-09-21abs ↗pdf ↗

Defines Killing spinors and bosonic backgrounds in 5D supergravity.

problem Characterizing backgrounds in 5D supergravity.
method Calculates Spencer cohomology, defines Killing spinors, and imposes constraints on spinor connection curvature.
result Recover field equations of 5D supergravity and find new field equations for sp(1)\mathfrak{sp}(1)-valued one-form.

PCA++ improves robustness to background noise in contrastive learning.

problem Recovering shared signal subspaces from positive pairs in high-dimensional data with structured background noise.
method PCA++ uses hard uniformity-constrained contrastive learning to enforce identity covariance on projected features.
result PCA++ outperforms standard PCA and alignment-only PCA+ in simulations and real-world datasets.

New method simplifies causal inference with tiered background knowledge.

problem Large equivalence classes of DAGs limit causal information.
method Integrates tiered background knowledge to create 'tiered MPDAGs' with simplified structure.
result Tiered MPDAGs are chain graphs with chordal components, simplifying causal effect estimation.

Study evaluates saliency maps on artificial data with different backgrounds.

problem Objective evaluation of saliency methods on artificial data with varying backgrounds.
method Developed a framework to generate artificial data with synthetic lesions and a known ground truth map, evaluated two data sets with different backgrounds (Perlin noise and 2D brain MRI slices).
result Heatmaps vary strongly between saliency methods and backgrounds.

Researchers prove a nonlinear gluing theorem for gravitational fields near static backgrounds.

problem Proving a nonlinear gluing theorem for gravitational fields near static backgrounds.
method Proved a nonlinear characteristic CkC^k-gluing theorem for vacuum gravitational fields in Bondi gauge.
result Generalized the C2C^2-gluing theorem near light cones to a wider class of hypersurfaces.

We construct rigid supersymmetric gauge theories on Riemannian five-manifolds. We follow a holographic approach, realizing the manifold as the conformal boundary of a six-dimensional bulk supergravity solution. This leads to a systematic classification of five-dimensional supersymmetric backgrounds with gravity duals. …

2015-03-31abs ↗pdf ↗

Paper explores using EEG for better speaker identification, even in noisy environments.

problem Speaker identification performance degrades in background noise.
method Uses EEG signals to enhance speaker identification systems, comparing with acoustic features.
result Speaker identification system using only EEG features outperforms one using only acoustic features in high background noise.

We define the Poisson quasi-Nijenhuis structures with background on Lie algebroids and we prove that to any generalized complex structure on a Courant algebroid which is the double of a Lie algebroid is associated such a structure. We prove that any Lie algebroid with a Poisson quasi-Nijenhuis structure with background…

2008-08-29abs ↗pdf ↗

Practitioners sometimes suggest to use a combination of Sobol sequences and orthonormal polynomials when applying an LSMC algorithm for evaluation of option prices or in the context of risk capital calculation under the Solvency II regime. In this paper, we give a theoretical justification why good implementations of a…

2018-11-20abs ↗pdf ↗

Machine learning models predict depression risk based on various factors.

problem Identifying individuals at greatest risk for depression.
method Random Effects/Expectation Maximization (RE-EM) trees and Mixed Effects Random Forest (MERF) algorithms.
result Machine learning models accurately predict depression severity and identify key predictors.

BIND removes background noise from binary matrices, improving detection accuracy and fairness.

problem Real data often violates the i.i.d assumption for binary matrix entries, leading to inaccurate detection.
method BIND optimizes detection by estimating row- and column-wise mixture distributions and eliminating background noise.
result BIND effectively removes background noise and increases detection accuracy and fairness.

A geometric string solution has background fields in overlapping coordinate patches related by diffeomorphisms and gauge transformations, while for a non-geometric background this is generalised to allow transition functions involving duality transformations. Non-geometric string backgrounds arise from T-duals and mirr…

2004-06-11abs ↗pdf ↗

We describe the geometry of generic heterotic backgrounds preserving minimal supersymmetry in four dimensions using the language of generalised geometry. They are characterised by an SU(3)×Spin(6+n)SU(3)\times Spin(6+n) structure within O(6,6+n)×R+O(6,6+n)\times\mathbb{R}^+ generalised geometry. Supersymmetry of the background is encoded in…

2019-12-20abs ↗pdf ↗

Paper characterizes and represents pairwise causal background knowledge for improved causal inference.

problem Improving causal inference by handling pairwise causal constraints.
method Graphical characterization, direct causal clause (DCC), unified representation, MPDAG, polynomial-time algorithms.
result Pairwise causal background knowledge uniquely decomposes into MPDAG and DCCs, improving causal effect identification.

CNNs improve signal-background classification in particle physics experiments.

problem Improving accuracy in classifying signal from background in particle physics experiments.
method Extensive convolutional neural architecture search for 2D and 3D image data.
result Achieved high accuracy for signal/background discrimination with CNNs, less parameters than ResNet.