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

Trend · papers per month

1122 · Nov 201819922001200920172026
41 results for order-dependence

Paper tackles order-dependence in structure learning of multivariate regression chain graphs.

problem Order-dependence in structure learning of multivariate regression chain graphs.
method Proposes modifications to the PC-like algorithm to remove order-dependence.
result Improved performance in high-dimensional settings with modifications to the PC-like algorithm.

Representation learning on networks offers a powerful alternative to the oft painstaking process of manual feature engineering, and as a result, has enjoyed considerable success in recent years. However, all the existing representation learning methods are based on the first-order network (FON), that is, the network th…

2019-08-15abs ↗pdf ↗

The paper analyzes cryptocurrency trading networks using pairwise and high-order dependencies.

problem Understanding information flows and dependencies in cryptocurrency markets.
method Defined a cryptocurrency trading network using weekly log returns, analyzed using Granger causality and O-information.
result High-order dependencies reveal that stable coins play a major role in high-order effects.

We consider constraint-based methods for causal structure learning, such as the PC-, FCI-, RFCI- and CCD- algorithms (Spirtes et al. (2000, 1993), Richardson (1996), Colombo et al. (2012), Claassen et al. (2013)). The first step of all these algorithms consists of the PC-algorithm. This algorithm is known to be order-d…

2012-11-14abs ↗pdf ↗

CSD improves goodness-of-fit testing for higher-order dependence.

problem Insensitivity of standard KSDs to higher-order dependence features like tail dependence.
method Introduces Copula-Stein Discrepancy (CSD) that targets dependence geometry directly on copula density.
result CSD is sensitive to differences in tail dependence coefficients and metrizes weak convergence of copula distributions.

Networks are a natural representation of complex systems across the sciences, and higher-order dependencies are central to the understanding and modeling of these systems. However, in many practical applications such as online social networks, networks are massive, dynamic, and naturally streaming, where pairwise inter…

2019-08-02abs ↗pdf ↗

In this paper we consider rough differential equations on a smooth manifold (M).\left( M\right) . The main result of this paper gives sufficient conditions on the driving vector-fields so that the rough ODE's have global (in time) solutions. The sufficient conditions involve the existence of a complete Riemannian metric …

2018-10-08abs ↗pdf ↗

Most of the successful deep neural network architectures are structured, often consisting of elements like convolutional neural networks and gated recurrent neural networks. Recently, graph neural networks have been successfully applied to graph structured data such as point cloud and molecular data. These networks oft…

2019-06-03abs ↗pdf ↗

The paper shows how different geodesic flows on surfaces can be mapped to each other.

problem Comparing pseudo-Anosov maps from various Birkhoff sections of a geodesic flow.
method Identifying canonical surfaces and expressing first-return maps as compositions of Dehn twists.
result First-return maps from different Birkhoff sections are equivalent and can be expressed using a fixed set of Dehn twists.

We solve minimal separator problems in AMP chain graphs and improve structure learning algorithms.

problem Finding minimal separators in AMP chain graphs and learning their structure from data.
method We analyze and solve several versions of the minimal separator problem. We propose modifications to the PC-like algorithm and extend a decomposition-based method for AMP CGs.
result Our modifications of the PC-like algorithm and the LCD-AMP method improve structure learning and are more accurate and stable, especially in high-dimensional settings.

Statistical shape models enhance machine learning algorithms providing prior information about deformation. A Point Distribution Model (PDM) is a popular landmark-based statistical shape model for segmentation. It requires choosing a model order, which determines how much of the variation seen in the training data is a…

2018-08-01abs ↗pdf ↗

We identify and analyze statistical regularities and irregularities in the recent order flow of different NASDAQ stocks, focusing on the positions where orders are placed in the orderbook. This includes limit orders being placed outside of the spread, inside the spread and (effective) market orders. We find that limit …

2017-02-14abs ↗pdf ↗

Study of recurrences in earthquakes, climate, financial time-series, etc. is crucial to better forecast disasters and limit their consequences. However, almost all the previous phenomenological studies involved only a long-ranged autocorrelation function, or disregarded the multi-scaling properties induced by potential…

2013-02-15abs ↗pdf ↗

The functions of proteins and RNAs are determined by a myriad of interactions between their constituent residues, but most quantitative models of how molecular phenotype depends on genotype must approximate this by simple additive effects. While recent models have relaxed this constraint to also account for pairwise in…

2017-12-18abs ↗pdf ↗

SDREM models complex network data with deep learning, improving link prediction.

problem Modeling latent structures in relational data with high-order node dependence.
method Scalable deep generative relational model (SDREM) incorporating high-order neighbourhood structure and novel data augmentation.
result Improved link prediction performance on real-world datasets.

The paper tackles long-context linear system identification with improved sample complexity bounds.

problem Identifying dynamical systems with long dependencies over fixed context windows.
method Established sample complexity bounds for systems with linear dependencies over a context window of length p.
result The learning process is not hindered by slow mixing properties in extended context windows.

Kernel-based tests detect dependencies in multivariate time series, including stationary and non-stationary data.

problem Detecting dependencies in multivariate time series data, especially non-stationary data.
method Kernel-based statistical tests of joint independence, extending dHSIC to handle both stationary and non-stationary processes.
result Robustly uncovers significant higher-order dependencies in synthetic and real-world data.

Relational learning deals with data that are characterized by relational structures. An important task is collective classification, which is to jointly classify networked objects. While it holds a great promise to produce a better accuracy than non-collective classifiers, collective classification is computational cha…

2016-09-15abs ↗pdf ↗

Bayesian context trees capture complex dependencies in categorical sequences.

problem Complex, long-range dependencies in categorical sequences are not well captured by simple models.
method Parsimonious Bayesian context trees with model-based agglomerative clustering for efficient inference.
result The proposed framework outperforms existing models on real-world data.

Machine learning algorithms have been increasingly deployed in critical automated decision-making systems that directly affect human lives. When these algorithms are only trained to minimize the training/test error, they could suffer from systematic discrimination against individuals based on their sensitive attributes…

2019-06-28abs ↗pdf ↗

New algorithm reduces dynamic regret in time-varying movement costs.

problem Dynamic regret in online convex optimization with time-varying movement costs.
method Introduced a novel algorithm for time-varying movement costs, achieving comparator-adaptive dynamic regret bound.
result Established first comparator-adaptive dynamic regret bound of O~((M2+MPT)(T+tλt))\widetilde{\mathcal{O}}(\sqrt{(M^2+MP_T)(T+\sum_t λ_t)}).

The paper provides bounds for LSA with fixed stepsizes under random estimates.

problem Analyzing the performance of LSA algorithms with fixed stepsize.
method Non-asymptotic analysis based on new results about matrix moments and high probability bounds.
result Derives high probability bounds on LSA performance under weaker conditions than previous works.

The paper tackles attributing forecast gaps in complex model suites.

problem Attributing forecast gaps to individual component models in complex model suites.
method Formalized walk analysis, adapted LMDI and Shapley value approaches.
result Developed efficient formulas for gap attribution in practical portfolio-scale examples.

The paper provides bounds for the empirical angular measure and applies them to improve statistical learning in extreme regions.

problem Estimating the angular measure in high-dimensional data with different distributions.
method Established bounds for the maximal deviations of the empirical angular measure from the true measure, using rank transformation and analyzing the most extreme observations.
result The bounds provide performance guarantees for statistical learning procedures in extreme regions, such as binary classification and anomaly detection.

The paper analyzes how machine learning models perform under covariate shift, especially when the feature shift in xx is larger than that in yy.

problem Performance of machine learning models under covariate shift with heterogeneous feature changes.
method Empirical risk minimization (ERM) over functions f+gf+g, fit on a training distribution, evaluated on a test distribution with covariate shift.
result ERM is more resilient to heterogeneous covariate shifts when the class FF is simpler than GG.

Unified normative modeling for neuroimaging phenotypes using denoising diffusion models.

problem Discarding multivariate dependence in neuroimaging pipelines.
method Denoising diffusion probabilistic models (DDPMs) with FiLM and SAINT backbones.
result Unified multivariate normative modeling with better calibration and dependence preservation.

Improved stochastic approximation method reduces residual error.

problem Reducing residual error in stochastic approximation algorithms.
method Fixed-schedule one-quarter barrier and bias-corrected acceleration.
result Achieves T1/2+o(1)T^{-1/2+o(1)} residual reduction with O(1)O(1) primitive samples.

Enhanced Zika spread forecasting using topological data analysis.

problem Challenging prediction of Zika virus spread due to nonlinear spatio-temporal dependency and lack of historical records.
method Integrates topological data analysis, specifically persistent homology, into predictive machine learning models.
result Ensemble forecasting improves Zika spread predictions in Brazil.

Recommender systems, medical diagnosis, network security, etc., require on-going learning and decision-making in real time. These -- and many others -- represent perfect examples of the opportunities and difficulties presented by Big Data: the available information often arrives from a variety of sources and has divers…

2015-02-05abs ↗pdf ↗