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

91181272362 · Jun 202019922001200920172026
48 results for local independence

Method discovers local independence in systems with continuous variables.

problem Applying Context-Specific Independence (CSI) to continuous variables is impractical.
method Neural contextual decomposition (NCD) learns partition of joint outcome space.
result NCD successfully discovers local independence in synthetic and real-world systems.

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.

New method aggregates Gaussian experts by detecting conditional independence violations.

problem Aggregation of dependent Gaussian experts leads to sub-optimal solutions.
method Uses Gaussian graphical model to detect and correct conditional independence violations.
result Improves aggregation of Gaussian experts, outperforming SOTA DGP approaches.

MixCIT tests conditional independence for mixed data types efficiently and reliably.

problem Testing conditional independence for mixed data types, especially when at least one is continuous.
method Graph-based test statistic comparing kernel similarities, debiased local-polynomial approach for continuous variables.
result Unified, efficient, and statistically guaranteed solution across heterogeneous data types.

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.

Despite its simplicity, the naive Bayes classifier has surprised machine learning researchers by exhibiting good performance on a variety of learning problems. Encouraged by these results, researchers have looked to overcome naive Bayes primary weakness - attribute independence - and improve the performance of the algo…

2012-10-19abs ↗pdf ↗

New method tests independence with single nonstationary time series.

problem Testing independence in nonstationary nonlinear time series.
method Time-varying nonlinear regression, local long-run covariance estimation, strong Gaussian approximation.
result First framework for conditional independence testing with a single realization of a nonstationary nonlinear process.

New SGD covering technique yields dimension-independent generalization bounds.

problem Generalization of stochastic gradient descent in non-convex, non-smooth settings.
method Localized ε-covers for SGD trajectories, showing dimension-independent complexity.
result Generalization error upper bounded by O((lognlog(nP))/n)O(\sqrt{(\log n\log(nP))/n}).

The paper develops a neural network method for estimating drift functions of diffusion processes from discrete observations.

problem Nonparametric estimation of drift function for diffusion processes from high-frequency discrete observations.
method Neural network-based estimator for drift function estimation.
result Derives a non-asymptotic convergence rate for the neural network estimator.

MULTIFIT tests independence between two random vectors using multiscale Fisher's test.

problem Detecting local dependence between two random vectors.
method MULTIFIT uses a resampling-free approach to test independence.
result MULTIFIT can easily handle large sample sizes and interpret dependency nature.

There has been a recent interest in understanding the power of local algorithms for optimization and inference problems on sparse graphs. Gamarnik and Sudan (2014) showed that local algorithms are weaker than global algorithms for finding large independent sets in sparse random regular graphs. Montanari (2015) showed t…

2015-08-10abs ↗pdf ↗

The paper proves local laws for non-separable sample covariance matrices.

problem Analyzing non-separable sample covariance matrices with dependent or nonlinearly transformed data.
method Tensor network framework for analyzing fluctuation averaging in the presence of higher-order cumulant structure.
result Optimal averaged local law and full anisotropic local law for non-separable sample covariance matrices.

We present an algebraic procedure that finds the Lie algebra of the local Killing fields of a smooth metric. In particular, we determine the number of independent local Killing fields about a given point on the manifold. Spaces of constant curvature and locally symmetric spaces are also discussed. Furthermore, we obtai…

2008-08-27abs ↗pdf ↗

Develops model-free methods for event history analysis and efficient covariate adjustment.

problem Estimating treatment effects while accounting for confounding and understanding event history.
method Model-free prediction techniques, Local Covariance Measure (LCM), Debiased Outcome-adapted Propensity Estimator (DOPE), Aalen Covariance Measure (ACM).
result Demonstrates the effectiveness and robustness of the proposed methods in various settings.

A method to select important experts for Gaussian processes to balance computational efficiency and uncertainty quantification.

problem Balancing computational efficiency and uncertainty quantification in Gaussian processes for big data.
method Using graphical models to select important experts and aggregate their predictions while ensuring uncertainty quantification.
result Substantially reduces computational cost of aggregating dependent experts while ensuring calibrated uncertainty quantification.

Local Gradient Descent with local steps converges to the centralized model in the interpolation regime.

problem Understanding the implicit bias of Local Gradient Descent in the interpolation regime.
method Analyzing the implicit bias of Local Gradient Descent for classification tasks with linearly separable data.
result The aggregated global model from Local-GD converges exactly to the centralized model in the interpolation regime.

This article considers the quasi-local energy in reference to a general static spacetime. We follow the approach developed by the authors in [19, 20, 7, 9] and define the quasi-local energy as a difference of surface Hamiltonians, which are derived from the Einstein-Hilbert action. The new quasi-local energy provides a…

2016-04-11abs ↗pdf ↗

Coordinate-independent convolutions on manifolds avoid reference frame ambiguity.

problem Applying convolutions on non-Euclidean manifolds without reference frame ambiguity.
method Developed coordinate-independent and gauge-equivariant convolutions on Riemannian manifolds.
result Coordinate-independent convolutions are equivariant under local gauge transformations.

Paper introduces a new test for conditional independence using weighted partial copulas.

problem Testing conditional independence between variables.
method The approach uses a weighted partial copula function and a bootstrap procedure to compute regions of rejection.
result The proposed test has competitive power compared to existing methods.

Local-HDP learns independent topics for each 3D object category in real-time.

problem Learning independent topics for each 3D object category in real-time.
method Local-Hierarchical Dirichlet Process (Local-HDP) with online variational inference.
result Local-HDP outperforms other approaches in accuracy, scalability, and memory efficiency.

Let MM be a pseudo-Riemannian spin manifold of dimension nn and signature ss and denote by NN the rank of the real spinor bundle. We prove that MM is locally homogeneous if it admits more than 3/4N{3/4}N independent Killing spinors with the same Killing number, unless n1(mod4)n\equiv 1 \pmod 4 and s3(mod4)s\equiv 3 \pmod 4. We …

2009-02-26abs ↗pdf ↗

Model estimates lung well-aerated volume from CT images, independent of patient and imaging parameters.

problem Lack of clear connection between quantitative metrics in lung CT images and physiology.
method Patient-independent model using Gaussian fit to lower CT histogram data points.
result Model estimates well-aerated volume (WAVE) independent of CT reconstruction parameters and respiratory cycle.

In this paper, we provide a model-independent extension of the paradigm of dynamic hedging of derivative claims. We relate model-independent replication strategies to local martingales having a closed form which we can characterise via solutions of coupled PDEs. We provide a general framework and then apply it to a mar…

2018-09-01abs ↗pdf ↗

New proof of Alesker's Irreducibility Theorem using localization techniques.

problem Representing polynomial valuations on convex bodies.
method Introducing a localization technique for polynomial valuations and reducing to a representation problem for differential forms.
result Smooth and translation invariant valuations are representable by integration with the normal cycle.

We study the geometry and topology of Riemannian 3-orbifolds which are locally volume collapsed with respect to a curvature scale. We show that a sufficiently collapsed closed 3-orbifold without bad 2-suborbifolds either admits a metric of nonnegative sectional curvature or satisfies Thurston's Geometrization Conjectur…

2011-01-19abs ↗pdf ↗

We generalize the classical Lie results on a basis of differential invariants for a one-parameter group of local transformations to the case of arbitrary number of independent and dependent variables. It is proved that if universal invariant of a one-parameter group is known then a complete set of functionally independ…

2001-12-24abs ↗pdf ↗

Local learning method selects covariates for causal effect estimation in the presence of latent variables.

problem Estimating causal effects from nonexperimental data with latent variables.
method Local learning approach that identifies valid adjustment sets for causal relationships.
result Ensures soundness and completeness of causal effect estimation under standard assumptions.

Arithmetic spaces simplified to simplicial complexes.

problem Understanding the complexity of arithmetic locally symmetric spaces.
method Homotopy equivalence to a simplicial complex with linearly bounded simplices, using a strengthened Margulis collar lemma.
result Arithmetic locally symmetric spaces are homotopy equivalent to simplicial complexes with linearly bounded simplices.