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.
Proposes a copula-based model for multi-view clustering with directional dependency.
This paper examines quantile dependence between international stock markets and evaluates its use for improving volatility forecasting. First, we analyze quantile dependence and directional predictability between the US stock market and stock markets in the UK, Germany, France and Japan. We use the cross-quantilogram, …
We analyze the information-theoretic limits for the recovery of node labels in several network models. This includes the Stochastic Block Model, the Exponential Random Graph Model, the Latent Space Model, the Directed Preferential Attachment Model, and the Directed Small-world Model. For the Stochastic Block Model, the…
Unified framework for clustering and learning causal graphs across subjects.
New framework detects directional influence in multivariate time series.
Motivation: Algorithms that discover variables which are causally related to a target may inform the design of experiments. With observational gene expression data, many methods discover causal variables by measuring each variable's degree of statistical dependence with the target using dependence measures (DMs). Howev…
Paper introduces MTCM to measure multivariate tail dependence.
This paper investigates the use of multiple directions of stratification as a variance reduction technique for Monte Carlo simulations of path-dependent options driven by Gaussian vectors. The precision of the method depends on the choice of the directions of stratification and the allocation rule within each strata. S…
The paper proposes methods to extract and analyze individual variable information from complex dependencies.
Direct approach for handling contextual bandits with latent state dynamics.
We propose a new variational family for Bayesian neural networks. We decompose the variational posterior into two components, where the radial component captures the strength of each neuron in terms of its magnitude; while the directional component captures the statistical dependencies among the weight parameters. The …
We study the time dependent cross correlations of stock returns, i.e. we measure the correlation as the function of the time shift between pairs of stock return time series using tick-by-tick data. We find a weak but significant effect showing that in many cases the maximum correlation is at nonzero time shift indicati…
We present a case-study demonstrating the usefulness of Bayesian hierarchical mixture modelling for investigating cognitive processes. In sentence comprehension, it is widely assumed that the distance between linguistic co-dependents affects the latency of dependency resolution: the longer the distance, the longer the …
Quantum neural networks need both data-dependent and trainable unitaries for effective geometric deformation.
This note demonstrates how both the concept of distance and the concept of holonomy can be constructed from a suitable network with directed edges (and no lengths). The number of different edge types depends on the signature of the metric and the dimension of the holonomy group. If the holonomy group is of dimension on…
Estimates mean of random vector with near-optimal error in all directions.
Capturing the dependence structure of multivariate extreme events is a major concern in many fields involving the management of risks stemming from multiple sources, e.g. portfolio monitoring, insurance, environmental risk management and anomaly detection. One convenient (non-parametric) characterization of extremal de…
We briefly review some basic concepts of parallel displacement in Finsler geometry. In general relativity, the parallel translation of objects along the congruence of the fundamental observer corresponds to the evolution in time. By dropping the quadratic restriction on the measurement of an infinitesimal distance, the…
A network embedding consists of a vector representation for each node in the network. Its usefulness has been shown in many real-world application domains, such as social networks and web networks. Directed networks with text associated with each node, such as software package dependency networks, are commonplace. Howe…
This paper considers an often forgotten relationship, the time delay between a cause and its effect in economies and finance. We treat the case of Foreign Direct Investment (FDI) and economic growth, - measured through a country Gross Domestic Product (GDP). The pertinent data refers to 43 countries, over 1970-2015, - …
We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p when G is a polytree and p satisfies composition and weak transitivity. We prove that the criterion is sound and complete. We argue that assuming composition and weak transitivity is not too restrictiv…
A new method for predicting uncertainties in stream networks.
New algorithms estimate Hessians using random directions for faster stochastic optimization.
Constructs Lie algebras from labeled directed graphs and identifies properties of these algebras.
In this paper, we introduce a new directed graphical model from Gaussian data: the Gaussian graphical interaction model (GGIM). The development of this model comes from considering stationary Gaussian processes on graphs, and leveraging the equations between the resulting steady-state covariance matrix and the Laplacia…
A new framework enhances binaural audio for moving talkers.
We study the motion of smooth, strictly convex bodies in expanding in the direction of their normal vector field with speed depending on Gauss curvature and support function.
Optimal reinsurance contracts for multiple dependent risks are derived without specific dependency assumptions.
Survey on learning with graph-dependent data, deriving new generalization bounds.
Study reveals how neural network architectures bias their learning based on feature directions.
We prove the differentiability of Lipschitz maps X-->V, where X is a complete metric measure space satisfying a doubling condition and a Poincaré inequality, and V is a Banach space with the Radon Nikodym Property (RNP). The proof depends on a new characterization of the differentiable structure on such metric measure …
We extend manifold capacity to nonlinear neural representations with contextual information.
New algorithms reduce regret in neural logistic bandits.
A Bayesian treatment of latent directed graph structure for non-iid data is provided where each child datum is sampled with a directed conditional dependence on a single unknown parent datum. The latent graph structure is assumed to lie in the family of directed out-tree graphs which leads to efficient Bayesian inferen…
AGCA approximates angular variation on the unit sphere, reducing extremal dependence problems to eigenanalysis.
New approach improves classification guarantees by focusing on direction rather than regression risk.
New IBP formulae for rough stochastic Volterra processes.
The covariance graph (aka bi-directed graph) of a probability distribution is the undirected graph where two nodes are adjacent iff their corresponding random variables are marginally dependent in . In this paper, we present a graphical criterion for reading dependencies from , under the assumption that $…
This paper considers the problem of estimating the structure of multiple related directed acyclic graph (DAG) models. Building on recent developments in exact estimation of DAGs using integer linear programming (ILP), we present an ILP approach for joint estimation over multiple DAGs, that does not require that the ver…
We propose a new partially topological theory in three dimensions which couples Chern-Simons theory to matter. The 3-manifolds needed for this construction admit transverse holomorphic foliation (THF). The theory depends only on the choice of such a structure, but not on a choice of metric and in this sense, it is topo…
We provide a characterization of two types of directed homology for fully-connected, feedforward neural network architectures. These exact characterizations of the directed homology structure of a neural network architecture are the first of their kind. We show that the directed flag homology of deep networks reduces t…
Bayesian nonparametric approach for clustering non-exchangeable groups.
Deep learning has exhibited superior performance for various tasks, especially for high-dimensional datasets, such as images. To understand this property, we investigate the approximation and estimation ability of deep learning on anisotropic Besov spaces. The anisotropic Besov space is characterized by direction-depen…
Proposes a novel approach using vector cross product to preserve directional edges in directed graphs.
We present a distributed (non-Bayesian) learning algorithm for the problem of parameter estimation with Gaussian noise. The algorithm is expressed as explicit updates on the parameters of the Gaussian beliefs (i.e. means and precision). We show a convergence rate of with the constant term depending on the numb…
New model captures time series dependence across and within blocks.
We present a unified derivation of covariant time derivatives, which transform as tensors under a time-dependent coordinate change. Such derivatives are essential for formulating physical laws in a frame-independent manner. Three specific derivatives are described: convective, corotational, and directional. The covaria…
We consider surfaces in Euclidean space parametrized on an annular domain such that the first fundamental form and the principal curvatures are rotationally invariant, and the principal curvature directions only depend on the angle of rotation (but not the radius). Such surfaces generalize the Enneper surface. We show …