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

166331497662 · Jun 202019922001200920172026
48 results for additive conditional independence

Constraint-based structure learning algorithms infer the causal structure of multivariate systems from observational data by determining an equivalent class of causal structures compatible with the conditional independencies in the data. Methods based on additive-noise (AN) models have been proposed to further discrimi…

2019-05-20abs ↗pdf ↗

Paper introduces a nonparametric functional graphical model for random functions.

problem Estimating probabilistic conditional independence in functional graphical models.
method Functional sufficient dimension reduction to relax Gaussian or copula Gaussian assumptions.
result Enhances estimation accuracy and retains probabilistic conditional independence.

This work identifies redundant tests in conditional-independence-based discovery that can improve graphical model accuracy.

problem Reliability and sensitivity of conditional-independence-based discovery algorithms.
method Analysis of redundant tests and their impact on error detection and correction.
result Redundant tests can improve graphical model accuracy but not all are beneficial.

Simple conditions for comonotonic additive risk measures from acceptance sets.

problem Conditions for comonotonic additive risk measures from acceptance sets.
method Conditions on acceptance sets for induced comonotonic additive risk measures.
result Acceptance sets induce comonotonic additive risk measures if and only if the acceptance sets and their complements are stable under convex combinations of comonotonic random variables.

New algorithm reduces conditional independence tests needed for causal discovery.

problem Efficiently infer causal relations from observational data.
method Established an algorithm with complexity pO(s)p^{\mathcal{O}(s)} tests.
result Achieves exponent-optimality up to a logarithmic factor in terms of conditional independence tests.

Thompson Sampling with bilateral uncertainty improves performance in Bayesian Optimization.

problem Twin difficulties of modeling and searching complex functions in high dimensions.
method Exploiting conditional independence, Thompson Sampling respecting bilateral uncertainty (BU).
result Thompson Sampling with BU is more effective than the additive approximation in small budgets.

New method tests conditional independence using spectral representations.

problem Untestable conditional independence in many settings.
method Spectral representations of partial covariance operators, bi-level contrastive learning.
result Asymptotic validity and power guarantees for CI testing.

Much recent work has concerned sparse approximations to speed up the Gaussian process regression from the unfavorable O(n3) scaling in computational time to O(nm2). Thus far, work has concentrated on models with one covariance function. However, in many practical situations additive models with multiple covariance func…

2012-06-13abs ↗pdf ↗

Develops a test for conditional local independence of counting processes.

problem Testing the hypothesis of conditional local independence among continuous time stochastic processes.
method Introduces a new functional parameter, the Local Covariance Measure (LCM), and proposes a test called (X)-LCT using nonparametric estimators and sample splitting or cross-fitting.
result The (X)-LCT test can be controlled uniformly with modest rates, and it works well without restrictive parametric assumptions.

Let SS be any closed hyperbolic surface and let λλ be a maximal geodesic lamination on SS. The amount of bending of an abstract pleated surface (homeomorphic to SS) with the pleating locus λλ is completely determined by an (R/2πZ)(\mathbb{R}/2π\mathbb{Z})-valued finitely additive transverse cocycle ββ to the geodesic …

2011-12-05abs ↗pdf ↗

FMCIT accelerates CI tests for causal discovery, maintaining power and efficiency.

problem High computational complexity in CI tests limits practical applicability of causal discovery methods.
method Flow Matching-based Conditional Independence Test (FMCIT) that leverages flow matching for fast CI tests.
result FMCIT effectively controls type-I error and maintains high testing power under the alternative hypothesis.

We propose a method for inferring the existence of a latent common cause ('confounder') of two observed random variables. The method assumes that the two effects of the confounder are (possibly nonlinear) functions of the confounder plus independent, additive noise. We discuss under which conditions the model is identi…

2012-05-09abs ↗pdf ↗

In this paper, we prove that if an asymptotically Euclidean manifold (Mn,g)(M^n,g) under the condition that R0R \ge 0 has long time existence of Ricci flow, the mass of (Mn,g)(M^n,g) is nonnegative. In addition, we give an independent proof of positive mass theorem in dimension 33.

2016-03-17abs ↗pdf ↗

New model captures time and mark inter-dependence in TPPs.

problem Limited predictive performance of conditionally independent TPP models on entangled time and mark interactions.
method Developed a multivariate TPP that models conditional inter-dependence of time and mark, using both intensity-based and intensity-free models.
result Proposed TPP models outperform conditionally independent and dependent models in standard prediction tasks.

We consider the problem of learning causal directed acyclic graphs from an observational joint distribution. One can use these graphs to predict the outcome of interventional experiments, from which data are often not available. We show that if the observational distribution follows a structural equation model with an …

2013-09-26abs ↗pdf ↗

Additive decoders tackle latent variables and image generation.

problem Latent variables identification and out-of-support image generation in representation learning.
method Additive decoders that can identify latent variables up to permutation and block-wise invertible transformations, and generate novel images by recombining observed factors.
result Additive decoders provide a new setting for nonlinear independent component analysis and can generate novel images by recombining observed factors.

It is natural to ask: what kinds of matrices satisfy the Restricted Eigenvalue (RE) condition? In this paper, we associate the RE condition (Bickel-Ritov-Tsybakov 09) with the complexity of a subset of the sphere in Rp\R^p, where pp is the dimensionality of the data, and show that a class of random matrices with indep…

2009-12-21abs ↗pdf ↗

New method uses sufficient statistics to infer causal relationships from observational data.

problem Inferring causal relationships from observational data with hidden variables.
method Information Bottleneck method applied to find functional sufficient statistics.
result New causal rules not obtainable from standard methods, validated on simulated and real data.

Deep CITs test conditional independence in images, improving brain MRI scan analysis.

problem Testing conditional independence in complex, high-dimensional variables like images.
method Combines embedding maps and nonparametric CITs for feature representations.
result Valid DNCITs for brain MRI scans and behavioral traits, confirming null results.

Efficiently estimates SAGE values using causal structure learning.

problem Computational infeasibility of exact SAGE calculations.
method Uses causal structure learning to identify conditional independencies and accelerate SAGE approximation.
result Empirically demonstrates efficient and accurate estimation of SAGE values.

Estimates marginal independence structure of Bayesian networks from data.

problem Learning the marginal independence structure of Bayesian networks from observational data.
method Using Gröbner basis and MCMC method (GrUES) to connect and recover the true structure.
result GrUES recovers the true marginal independence structure at a higher rate than simple independence tests.

New findings show independent subordination is not relevant for accurate option pricing.

problem Determining if independent subordination improves option pricing accuracy.
method Utilized a class of additive processes (ATS) to demonstrate that independent subordination is incompatible with market data and shows worse calibration performances.
result Independent subordination is not relevant for accurate option pricing, as shown by the ATS class of processes.

New PCstar algorithm discovers causal structure of max-linear Bayesian networks.

problem Discovering causal structure in max-linear Bayesian networks due to non-faithfulness.
method PC algorithm modified with CC^\ast-separation assumptions.
result PCstar algorithm can orient additional edges not possible with standard PC algorithm.

Generalizes Hoeffding's decomposition for dependent inputs under mild conditions.

problem Performing global sensitivity analysis on black-box models with dependent inputs.
method Proposes a novel framework based on probability theory, functional analysis, and combinatorics to handle dependencies.
result Any square-integrable, real-valued function of random elements with mild dependence assumptions can be uniquely additively decomposed.

A RL-based method adds conditional controls to pre-trained diffusion models.

problem Precise control over generated samples in diffusion models.
method Formulates the task as an RL problem, using a classifier and KL divergence as reward functions.
result Produces soft-optimal policies that maximize reward functions, enabling conditional sampling.

We consider the stochastic contextual bandit problem with additional regularization. The motivation comes from problems where the policy of the agent must be close to some baseline policy which is known to perform well on the task. To tackle this problem we use a nonparametric model and propose an algorithm splitting t…

2018-10-11abs ↗pdf ↗

A new method tests conditional independence by transforming it into an unconditional problem using transport maps.

problem Testing conditional independence between two random vectors given a third.
method Constructing transport maps to transform conditional independence into unconditional independence, estimating these maps from data using conditional continuous normalizing flow models.
result The proposed method is validated through simulations and real-data analysis, demonstrating practical effectiveness.

Missing data are ubiquitous in many domains including healthcare. When these data entries are not missing completely at random, the (conditional) independence relations in the observed data may be different from those in the complete data generated by the underlying causal process. Consequently, simply applying existin…

2018-07-11abs ↗pdf ↗

We provide a classification of graphical models according to their representation as subfamilies of exponential families. Undirected graphical models with no hidden variables are linear exponential families (LEFs), directed acyclic graphical models and chain graphs with no hidden variables, including Bayesian networks …

2013-01-30abs ↗pdf ↗

The study examines how including additional call option prices affects model-independent price bounds for exotic derivatives.

problem Improving model-independent price bounds for exotic derivatives using additional call option prices.
method Characterization of market settings that guarantee improved price bounds and exclusion of any improvement.
result The inclusion of additional call option prices can significantly impact model-independent price bounds.

We study 'meta-dependence' in conditional independence tests across different empirical distributions.

problem Understanding the breakdown of conditional independence properties in finite data.
method Geometric intuition and information projections to measure meta-dependence between conditional independences.
result We provide a measure of meta-dependence that consolidates findings across synthetic and real-world data.