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,657 papers · 148 categories

Trend · papers per month

60121181241 · Jun 202019922001200920172026
48 results for variable background

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 ↗

Study of dHYM connections on ruled surfaces with variable background metrics.

problem Finding new dHYM connections on ruled surfaces with variable metrics.
method Using momentum construction and moment map partial differential equations, coupled to scalar curvature of the background.
result Provide many new examples of dHYM connections coupled to a variable background Kähler metric.

Paper presents new algorithms for causal discovery with latent variables and overlapping datasets.

problem Causal discovery with latent variables and overlapping datasets.
method Introduces tiered FCI and tIOD algorithms for constraint-based causal discovery.
result The tIOD algorithm is more efficient and informative than the IOD algorithm.

TPM improves medical image segmentation by separating foreground and background.

problem Few-shot medical image segmentation challenges due to background variability.
method Tied Prototype Model (TPM) focusing on foreground, adapting thresholds, and using class priors.
result TPM leads to improved segmentation accuracy compared to ADNet.

Optimizes signal detection in particle physics by decorrelating classifiers.

problem Systematic errors in background models can mislead signal detection.
method Use optimal transport to decorrelate classifiers from protected variables, then apply semiparametric mixture model.
result Decorrelation and signal enrichment improve the stability, robustness, and power of signal detection tests.

Applications of machine learning tools to problems of physical interest are often criticized for producing sensitivity at the expense of transparency. To address this concern, we explore a data planing procedure for identifying combinations of variables -- aided by physical intuition -- that can discriminate signal fro…

2017-09-28abs ↗pdf ↗

We study an adaptive source seeking problem, in which a mobile robot must identify the strongest emitter(s) of a signal in an environment with background emissions. Background signals may be highly heterogeneous and can mislead algorithms that are based on receding horizon control. We propose AdaSearch, a general algor…

2018-09-27abs ↗pdf ↗

Proposes a method to identify causal relationships using background knowledge.

problem Identifying causal relationships in the presence of background knowledge.
method Learning local structure using all types of causal background knowledge (direct, non-ancestral, ancestral). Criteria for identifying causal relationships based on local structure.
result Effective and efficient method for local structure learning and causal relationship identification.

Matrix H-theory models stock market fluctuations using hierarchical multivariate distributions.

problem Understanding collective behavior in stock market fluctuations.
method Matrix H-theory framework for multivariate stochastic processes with hierarchical structure.
result Matrix H-theory effectively describes stock market fluctuations using Meijer G-functions.

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.

Identifies causal effects in partially directed acyclic graphs with observed variables.

problem Identifying conditional causal effects in graphs with background knowledge and observed variables.
method Three results: identification formula, do calculus generalization, and algorithm completeness.
result Complete algorithm for identifying conditional effects in MPDAGs.

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.

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 ↗

This paper frames causal structure estimation as a machine learning task. The idea is to treat indicators of causal relationships between variables as `labels' and to exploit available data on the variables of interest to provide features for the labelling task. Background scientific knowledge or any available interven…

2016-12-16abs ↗pdf ↗

This paper presents a new open source Python framework for causal discovery from observational data and domain background knowledge, aimed at causal graph and causal mechanism modeling. The 'cdt' package implements the end-to-end approach, recovering the direct dependencies (the skeleton of the causal graph) and the ca…

2019-03-06abs ↗pdf ↗

Better signal detection in undersampled data using joint and cross covariances.

problem Detecting shared signals in high-dimensional data with limited samples.
method Analysis of three covariance matrices: individual, cross, and joint.
result Joint and cross covariance matrices detect signals earlier than individual covariances.

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 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 ↗

This paper provides a tutorial on Boltzmann Machines and Deep Belief Networks.

problem Understanding and applying Boltzmann Machines and Deep Belief Networks.
method Explains the structures, conditional distributions, Gibbs sampling, training methods, and deep belief networks of RBMs.
result Comprehensive overview of RBMs and DBNs, useful in various fields.

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 ↗