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

170340510680 · May 202619922001200920172026
48 results for dependence structure

We propose a dynamic model of dependence structure between financial institutions within a financial system and we construct measures for dependence and financial instability. Employing Markov structures of joint credit migrations, our model allows for contagious simultaneous jumps in credit ratings and provides flexib…

2018-09-10abs ↗pdf ↗

The paper extends Marsden-Weinstein reduction to mechanical presymplectic structures for time-dependent Hamiltonian systems.

problem Limitations of Marsden-Weinstein reduction for cosymplectic structures in time-dependent Hamiltonian systems.
method Developed Marsden-Weinstein reduction for mechanical presymplectic structures.
result Mechanical presymplectic structures provide a more suitable framework for time-dependent Hamiltonian systems than cosymplectic structures.

Unified framework for clustering and learning causal graphs across subjects.

problem Bias and obscured subpopulation-specific dependencies in multivariate systems.
method Directed Acyclic Graph-based Dependency Clustering via Alternating Direction Method of Multipliers (DAG-DC-ADMM) integrated with Structural Equation Modeling (SEM).
result Unified framework recovers cluster-specific causal dependency structures with high true positive rate and low false discovery rate.

The paper explores the relationship between joint mixability and negative dependence structures.

problem Understanding the connection between joint mixability and various negative dependence concepts.
method Analyzes the properties of joint mixes and their relation to negative dependence structures.
result Derives necessary and sufficient conditions for a joint mix to be negatively dependent.

We introduce a class of dependence structures, that we call the Multiple Risk Factor (MRF) dependence structures. On the one hand, the new constructions extend the popular CreditRisk+ approach, and as such they formally describe default risk portfolios exposed to an arbitrary number of fatal risk factors with condition…

2016-07-16abs ↗pdf ↗

dGAP learns feature dependencies and predicts targets simultaneously.

problem Learning task-agnostic statistical dependencies and missing explicit feature dependencies.
method Jointly optimizes a neural dependency graph and target prediction loss.
result dGAP can recover correct feature dependencies and improve prediction accuracy.

Structured Nonparametric Variational Inference for Dependent Latent Modeling

problem Approximating posterior distributions with complex dependencies among latent variables
method Structured Nonparametric Variational Inference (SN-VI)
result Flexible and accurate posterior approximation with arbitrary shapes

BAM model learns graph structure from data with robustness across linear and non-linear dependencies.

problem Detecting dependencies in datasets for graph structure learning.
method Proposes BAM, a neural network model using structural equation models and Chebyshev polynomials for training, with bilinear attention mechanism.
result Demonstrates robust generalizability and superior performance in graph estimation.

Flexible Cox model for time-dependent covariates with complex sparsity patterns.

problem Lack of flexibility in enforcing specific sparsity patterns in time-dependent Cox models.
method Proposes a flexible framework for variable selection in time-dependent Cox models, accommodating complex selection rules.
result Achieves accurate estimation with low false alarm rates for complex covariate structures.

This paper proposes a new method to improve domain adaptation by distinguishing between marginal and dependence structure differences.

problem Existing domain adaptation methods fail to differentiate between marginal and dependence structure differences, leading to suboptimal transferability.
method The paper introduces a new approach that measures and optimizes the differences in internal dependence structure separately from marginals.
result The new method significantly improves transferability and robustness compared to existing benchmarks on real-world datasets.

Optimal reinsurance contracts for multiple dependent risks are derived without specific dependency assumptions.

problem Finding optimal reinsurance contracts for multiple dependent risks without assuming their dependency structure.
method Assumes maximal expected utility criterion and independent negotiation of reinsurance for each risk. Derives optimality conditions and shows that under mild assumptions, optimal contracts are classical (non-randomized) type.
result Optimal reinsurance contracts exist and can be classical (non-randomized) type under mild assumptions.

Bayesian networks, and especially their structures, are powerful tools for representing conditional independencies and dependencies between random variables. In applications where related variables form a priori known groups, chosen to represent different "views" to or aspects of the same entities, one may be more inte…

2015-08-31abs ↗pdf ↗

New concept of partial comonotonicity connects riskmetrics and dependence.

problem Understanding and quantifying risk metrics under partial comonotonicity.
method Developed a new notion of partial comonotonicity and established its connection to distortion riskmetrics.
result Partial comonotonicity uniquely characterizes a class of distortion riskmetrics through additivity.

Classical causal and statistical inference methods typically assume the observed data consists of independent realizations. However, in many applications this assumption is inappropriate due to a network of dependences between units in the data. Methods for estimating causal effects have been developed in the setting w…

2019-06-29abs ↗pdf ↗

New method optimizes portfolios with options, addressing asymmetry, dimensionality, and dependence.

problem Optimizing portfolios with options, especially when distributions are asymmetric, dimensions are high, and payoffs are dependent.
method Developed a new dependency matrix based on conditional probabilities of options' payoffs, computed using copula structures.
result Empirical evidence shows the approach is efficient, fast, and scalable to large portfolios of options.

Study on pairwise counter-monotonicity, a type of negative dependence.

problem Understanding and quantifying extremal negative dependence structures.
method Established stochastic representation and invariance property; showed implications and connections.
result Pairwise counter-monotonicity implies negative association and joint mix dependence.

Paper presents a framework for learning generative models with structured latent factors.

problem Learning controllable and generalizable representations of multivariate data with desired structural properties.
method The paper introduces a novel generative model framework that uses mask variables to model dependency structure and extends the multivariate information bottleneck theory.
result The framework learns semantically meaningful latent factors that reflect various desired structures and can automatically estimate dependency structure from data.

New method identifies nonstationary causal structures in time series data.

problem Identifying causal relationships in time series data that change over time.
method High-order Markov Switching Models for regime-dependent causal discovery.
result Scalable approach for estimating high-order regime-dependent causal structures.

Solar improves variable selection in high-dimensional data with complicated dependence structures.

problem Variable selection in ultrahigh dimensional data with severe multicollinearity and grouping effect issues.
method Subsample-ordered least angle regression (Solar) for ultrahigh dimensional data.
result Solar yields substantial improvements in sparsity, stability, and accuracy of variable selection compared to traditional methods.

Survey of three geometric frameworks for action-dependent field theories.

problem Understanding action-dependent field theories through geometric structures.
method Introduction and analysis of three geometric frameworks: k-contact, k-cocontact, and multicontact.
result Analysis of relationships among these geometric structures and comparison with other definitions.

Study improves KRR for non-i.i.d. data, with applications in denoising.

problem Kernel regression in structured non-i.i.d. settings.
method Developed a blockwise decomposition method for dependent data, deriving excess risk bounds.
result Established generalization guarantees for KRR in non-i.i.d. settings.

Graphical lasso models ASR utterance dependencies for consistent WER estimation.

problem Modeling dependent structure among ASR utterances for accurate significance analysis.
method Graphical lasso for dependency modeling, followed by blockwise bootstrap resampling.
result Statistically consistent variance estimator of WER under mild conditions.

Conventional sequential learning methods such as Recurrent Neural Networks (RNNs) focus on interactions between consecutive inputs, i.e. first-order Markovian dependency. However, most of sequential data, as seen with videos, have complex temporal dependencies that imply variable-length semantic flows and their composi…

2019-07-03abs ↗pdf ↗

Stable topological summary captures evolving dependency structure in dynamic Bayesian networks.

problem Missing larger-scale patterns in evolving dependency structures in dynamic Bayesian networks.
method Topological approach using Dynamic Bayesian Graphs and persistent homology.
result Stable topological summary (barcodes) captures evolving dependency structure in DBNs.

We study the dependence structure of market states by estimating empirical pairwise copulas of daily stock returns. We consider both original returns, which exhibit time-varying trends and volatilities, as well as locally normalized ones, where the non-stationarity has been removed. The empirical pairwise copula for ea…

2015-03-31abs ↗pdf ↗

New framework relaxes independence assumption for graph-mixing dependencies.

problem Tackles limitations of existing generalization results for graph-mixing dependencies.
method Proposes a framework where dependencies decay with graph distance, derives generalization bounds leveraging online-to-PAC framework.
result Derives high-probability generalization guarantees that depend on mixing rate and graph's chromatic number.

Paper improves generalization bounds for structured output prediction problems.

problem Large label sets in structured output prediction problems.
method Developed novel high-probability bounds and generalization bounds in expectation.
result Significantly improved generalization bounds with logarithmic dependency on label set size.

Develops a new causal model for path-dependent link prediction.

problem Existing causal models assume fixed node factors, but real-world links can depend on existing ones.
method Introduces causal lifting and structural pairwise embeddings for path-dependent link prediction.
result Validated on three scenarios, demonstrating improved accuracy for causal link prediction.

TADA detects anomalies in time series using topological data analysis.

problem Detecting global changes in dependency structure between channels in multivariate time series.
method Topological Data Analysis for detecting anomalies in multivariate time series.
result The approach is more suitable for detecting global changes of correlation structures than existing methods.

Estimates change points in Weibull time series with copulas.

problem Change-point estimation for nonlinear Weibull time series with copula-based Markov models.
method Copula-based Markov chain model with Weibull marginal distributions, incorporating asymmetric dependence structures through Clayton and Joe copulas.
result Proposed method performs well in estimating change points and model parameters, demonstrated through extensive numerical studies and empirical application.

Algorithm identifies best arm with prior info in structured bandits.

problem Bayesian fixed-budget best-arm identification in structured bandits.
method Prior-dependent allocations based on structure and prior information.
result Improved theoretical bounds and robust performance across diverse models.

Real world systems typically feature a variety of different dependency types and topologies that complicate model selection for probabilistic graphical models. We introduce the ensemble-of-forests model, a generalization of the ensemble-of-trees model. Our model enables structure learning of Markov random fields (MRF) …

2013-12-17abs ↗pdf ↗

New algorithm detects tensor dependence structure alterations efficiently.

problem Detecting alterations in tensor dependence structures.
method Tensor-normal distributions, decorrelation, centralization, SERA (Sparsity-Exploited Reranking Algorithm).
result The proposed SERA algorithm controls false discovery rates effectively.

HACSurv models dependencies between competing risks and censoring for improved survival analysis.

problem Inaccurate survival predictions due to ignoring dependencies between competing risks and censoring.
method HACSurv uses hierarchical Archimedean copulas to model dependencies and cause-specific survival functions.
result HACSurv improves accuracy in survival predictions and captures complex risk interactions.