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

101203304405 · Jun 202019922001200920172026
48 results for flexible dependence

GPDFlow models extreme threshold exceedance with flexible dependence using normalizing flows.

problem Challenges in modeling multivariate threshold exceedance probabilities due to infinite parametrizations.
method GPDFlow uses normalizing flows to flexibly represent dependence without explicit parametric assumptions.
result GPDFlow significantly improves modeling accuracy and flexibility compared to traditional parametric methods.

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.

Flexible Hawkes model with Gaussian process self-effects for time-dependent data.

problem Modeling time-dependent point processes with history dependence and self-effects.
method Extended Hawkes process with Gaussian process self-effects for both excitatory and inhibitory types, using Bayesian inference and mean-field variational approximation.
result Efficient approximate Bayesian inference achieved via data augmentation and mean-field variational approach.

Flexible XVAE model for efficient spatial extremes simulation.

problem Complex tail dependence structures in spatial extremes processes.
method Variational autoencoder (XVAE) for modeling flexible and non-stationary dependence.
result XVAE provides fast inference and outperforms traditional models in high dimensions.

The authors characterize flexibility in power and energy markets considering time, spatiality, resource, and risk.

problem Evaluating and maximizing flexibility in power systems and markets.
method Characterization of flexibility dimensions (time, spatiality, resource, risk) and their interrelations with flexibility assets, products, and services.
result Flexibility should be evaluated based on multiple dimensions for efficient power systems and markets.

Introduces a new geometric method for optimal experimental design.

problem Restrictive invariance properties of traditional OED approaches based on probability densities.
method Mutual transport dependence (MTD) using optimal transport theory.
result Demonstrates high-quality designs and flexibility compared to standard methods.

We introduce a copula mixture model to perform dependency-seeking clustering when co-occurring samples from different data sources are available. The model takes advantage of the great flexibility offered by the copulas framework to extend mixtures of Canonical Correlation Analysis to multivariate data with arbitrary c…

2012-06-27abs ↗pdf ↗

Proposes logistic-beta process for modeling dependent probabilities with beta marginals.

problem Limited work on flexible and computationally convenient stochastic process extensions for dependent random probabilities.
method Introduces logistic-beta process with logistic transformation and beta marginals, capable of modeling dependence in discrete and continuous domains.
result Logistic-beta processes enable effective posterior inference and design of computationally tractable dependent Bayesian nonparametric models.

Unsupervised two-view learning, or detection of dependencies between two paired data sets, is typically done by some variant of canonical correlation analysis (CCA). CCA searches for a linear projection for each view, such that the correlations between the projections are maximized. The solution is invariant to any lin…

2011-01-31abs ↗pdf ↗

New Shapley values reveal non-linear feature dependencies.

problem Understanding non-linear dependencies in machine learning models.
method Model-independent Shapley values using non-parametric measures of dependence.
result Model-independent Shapley values can uncover non-linear dependencies.

GBMixed boosts mixed models for clustered data, estimating mean and variance flexibly.

problem Flexible estimation of mean and variance components in clustered data.
method Gradient Boosting framework for linear mixed models with likelihood-based gradients.
result GBMixed accurately recovers complex nonlinear fixed effects and covariances.

New method for robust financial portfolio analysis.

problem Challenges in modeling financial portfolio dependence structure.
method Nonparametric Angles-based Correlation (NAbC) method.
result Valid inferences and flexible scenarios for portfolio analysis.

Graph convolutional networks adapt the architecture of convolutional neural networks to learn rich representations of data supported on arbitrary graphs by replacing the convolution operations of convolutional neural networks with graph-dependent linear operations. However, these graph-dependent linear operations are d…

2017-11-03abs ↗pdf ↗

Semi-implicit graph variational auto-encoder (SIG-VAE) is proposed to expand the flexibility of variational graph auto-encoders (VGAE) to model graph data. SIG-VAE employs a hierarchical variational framework to enable neighboring node sharing for better generative modeling of graph dependency structure, together with …

2019-08-19abs ↗pdf ↗

We propose a novel probabilistic model to facilitate the learning of multivariate tail dependence of multiple financial assets. Our method allows one to construct from known random vectors, e.g., standard normal, sophisticated joint heavy-tailed random vectors featuring not only distinct marginal tail heaviness, but al…

2019-05-31abs ↗pdf ↗

Flexible copula model using implicit generative neural networks.

problem Limited flexibility of parametric copulas and curse of dimensionality in non-parametric methods.
method Implicit generative neural networks to model high-dimensional copula distributions with unspecified marginals.
result Demonstrated flexibility and performance on various datasets.

CDST improves ensemble prediction by adjusting model weights based on covariates.

problem Improving ensemble prediction accuracy in complex scenarios.
method Covariate-dependent stacking (CDST) with flexible model weights estimated via cross-validation.
result CDST consistently outperforms conventional model averaging methods in complex datasets.

Flexible GP model improves wind power prediction accuracy.

problem Accurate probabilistic prediction of wind power for grid stability.
method Heteroscedastic non-stationary Gaussian process with generalised spectral mixture kernel.
result The proposed model outperforms conventional GP models in wind power prediction.

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 ↗

Neural Bayes methods simplify fitting complex bivariate extremal models.

problem Inference on complex multivariate extremal dependence models with computationally expensive likelihood functions.
method Use neural networks to approximate Bayes estimators and classifiers for model selection.
result Proposed neural Bayes methods enable routine implementation of complex extreme-value dependence models.

Signals coming from multivariate higher order conditional moments as well as the information contained in exogenous covariates, can be effectively exploited by rational investors to allocate their wealth among different risky investment opportunities. This paper proposes a new flexible dynamic copula model being able t…

2016-01-20abs ↗pdf ↗

We develop the distance dependent Chinese restaurant process (CRP), a flexible class of distributions over partitions that allows for non-exchangeability. This class can be used to model many kinds of dependencies between data in infinite clustering models, including dependencies across time or space. We examine the pr…

2009-10-06abs ↗pdf ↗

We present a class of flexible and tractable static factor models for the term structure of joint default probabilities, the factor copula models. These high-dimensional models remain parsimonious with pair-copula constructions, and nest many standard models as special cases. The loss distribution of a portfolio of con…

2016-10-10abs ↗pdf ↗

Gradient Boosted Mixed Models estimate mean and variance components for clustered data.

problem Limited flexibility in linear mixed models for complex settings.
method Gradient Boosting extended to mixed models with likelihood-based gradients and flexible base learners.
result Accurate recovery of variance components and improved predictive accuracy.

LOV model calibrates European and American options with path-dependent volatility.

problem Calibrating European and American options with path-dependent volatility.
method Designing a local volatility model that incorporates path-dependent shocks through an occupation sensitivity function.
result LOV model successfully calibrates options chains with automatic European vanilla option calibration and path-dependent flexibility.

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.

Natural graph networks are a new class of graph neural networks that are more flexible and scalable.

problem Traditional graph neural networks are limited by equivariance to node permutations.
method Introduced natural graph networks, which are more flexible and scalable than conventional graph neural networks.
result Natural graph networks are as scalable as conventional message passing graph neural networks but more flexible.

Develops a kernel-based framework for dynamic trading strategies.

problem Optimizing portfolios with temporal dependencies in asset dynamics.
method Parameterizes trading strategies as functions in RKHS, enabling flexible, non-Markovian approaches.
result Significantly outperforms classical Markovian methods in synthetic and market-data examples.

Levy copulas are the most general concept to capture jump dependence in multivariate Levy processes. They translate the intuition and many features of the copula concept into a time series setting. A challenge faced by both, distributional and Levy copulas, is to find flexible but still applicable models for higher dim…

2012-07-18abs ↗pdf ↗

To construct flexible nonlinear predictive distributions, the paper introduces a family of softplus function based regression models that convolve, stack, or combine both operations by convolving countably infinite stacked gamma distributions, whose scales depend on the covariates. Generalizing logistic regression that…

2016-08-23abs ↗pdf ↗

Developed a flexible Bayesian g-formula for causal survival analysis with time-dependent confounding.

problem Estimating causal survival curves in longitudinal observational studies with time-varying treatments and confounding.
method Incorporated Bayesian Additive Regression Trees (BART) into the g-formula to model time-evolving generative components and mitigate bias due to model misspecification.
result Demonstrated improved empirical performance and practical utility of the proposed method through simulations and real-world data analysis.

PDSketch enables flexible robot planning by learning from domain structures.

problem Building general robots with flexible planning.
method Exploiting locality and sparsity in environmental models, PDSketch defines high-level structures for trainable neural networks.
result PDSketch automatically generates planning heuristics without additional training.

Although there is a rich literature on methods for allowing the variance in a univariate regression model to vary with predictors, time and other factors, relatively little has been done in the multivariate case. Our focus is on developing a class of nonparametric covariance regression models, which allow an unknown p …

2011-01-11abs ↗pdf ↗

A new method for portfolio optimization using signature signatures to incorporate path-dependencies.

problem Traditional portfolio optimization models struggle with path-dependencies and exogenous signals.
method Signature Trading framework using rough path signatures to represent trading strategies.
result Efficient incorporation of exogenous signals and drawdown control in optimal strategies.

Dynamic Vine Copulas detect and quantify time-varying higher-order interactions in multivariate systems.

problem Time-varying dependence in multivariate systems, including tail behavior, asymmetry, and conditional structure.
method Dynamic Vine Copulas (DVC) framework for estimating and diagnosing non-Gaussian dependence, using fixed-root-order C-vines and smooth parameter trajectories.
result DVC detects and quantifies time-varying higher-order interactions, distinguishing between pairwise and conditional dependence.

Deep learning for missing data with flexible modelling.

problem Missing data with missingness dependent on the missing values.
method Deep latent variable models with a neural network for missingness pattern modeling, importance-weighted variational inference, and stochastic gradients.
result Explicitly modelling missingness improves inference on various data sets.

New algorithm improves inference for flexible models with infinite latent features.

problem Inference for models with infinite latent features is computationally challenging and limiting.
method Adaptive slice sampling for posterior inference with general completely random measures.
result Higher effective sample size and predictive performance compared to existing methods.

The Probably Approximately Correct (PAC) Bayes framework (McAllester, 1999) can incorporate knowledge about the learning algorithm and (data) distribution through the use of distribution-dependent priors, yielding tighter generalization bounds on data-dependent posteriors. Using this flexibility, however, is difficult,…

2018-02-26abs ↗pdf ↗