Diffusion Maps framework is a kernel based method for manifold learning and data analysis that defines diffusion similarities by imposing a Markovian process on the given dataset. Analysis by this process uncovers the intrinsic geometric structures in the data. Recently, it was suggested to replace the standard kernel …
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.
Trend · papers per month
We establish dual representations for systemic risk measures based on acceptance sets in a general setting. We deal with systemic risk measures of both "first allocate, then aggregate" and "first aggregate, then allocate" type. In both cases, we provide a detailed analysis of the corresponding systemic acceptance sets …
In this paper we introduce a new multivariate dependence measure based on comonotonicity by means of product moment which motivated by the recent papers of Koch and Schepper (ASTIN Bulletin 41 (2011) 191-213) and Dhaene et al. (Journal of Computational and Applied Mathematics 263 (2014) 78-87). Some differences and rel…
Paper presents a new VMBQC model with fewer parameters for better generative modeling.
A liquidity measure based on consideration and price range is proposed. Initially defined for daily data, Liquidity Index (LIX) can also be estimated via intraday data by using a time scaling mechanism. The link between LIX and the liquidity measure based on weighted average bid-ask spread is established. Using this li…
New algorithm reduces dynamic regret for MDPs with unknown transition and adversarial rewards.
New MBQC algorithm uses randomness for generative modeling.
Adjusted for chance measures are widely used to compare partitions/clusterings of the same data set. In particular, the Adjusted Rand Index (ARI) based on pair-counting, and the Adjusted Mutual Information (AMI) based on Shannon information theory are very popular in the clustering community. Nonetheless it is an open …
A method improves Cryo-EM 3D map refinement by regularizing rotation estimation.
A new kernel for probability measures based on optimal transport.
MBQC linked to CQCA, yielding efficient Ansätze.
In this paper, the dual Orlicz curvature measure is proposed and its basic properties are provided. A variational formula for the dual Orlicz-quermassintegral is established in order to give a geometric interpretation of the dual Orlicz curvature measure. Based on the established variational formula, a solution to the …
We derive formulas for F measures' standard error and confidence intervals.
Different approaches to defining dynamic market risk measures are available in the literature. Most are focused or derived from probability theory, economic behavior or dynamic programming. Here, we propose an approach to define and implement dynamic market risk measures based on recursion and state economy representat…
Hybrid clustering combines partitional and hierarchical clustering for computational effectiveness and versatility in cluster shape. In such clustering, a dissimilarity measure plays a crucial role in the hierarchical merging. The dissimilarity measure has great impact on the final clustering, and data-independent prop…
New study shows how model complexity affects test risk, challenging classical theory.
We characterize when a convex risk measure associated to a law-invariant acceptance set in can be extended to , , preserving finiteness and continuity. This problem is strongly connected to the statistical robustness of the corresponding risk measures. Special attention is paid to concre…
Introduces new performance measures using scaled utility functions.
Recently, Deep Neural Networks (DNNs) have been achieving impressive results on wide range of tasks. However, they suffer from being well-calibrated. In decision-making applications, such as autonomous driving or medical diagnosing, the confidence of deep networks plays an important role to bring the trust and reliabil…
We study the minimax optimal rate for estimating the Wasserstein- metric between two unknown probability measures based on i.i.d. empirical samples from them. We show that estimating the Wasserstein metric itself between probability measures, is not significantly easier than estimating the probability measures u…
The economy globalization measure problem is discussed. Four macroeconomic indices of twenty among the "richest" countries are examined. Four types of "distances" are calculated.Two types of networks are next constructed for each distance measure definition. It is shown that the globalization process can be best charac…
We study the minimax optimal rates for estimating a range of Integral Probability Metrics (IPMs) between two unknown probability measures, based on independent samples from them. Curiously, we show that estimating the IPM itself between probability measures, is not significantly easier than estimating the probabili…
This is an introduction to Wiener measure and the Feynman-Kac formula on general Riemannian manifolds for Riemannian geometers with little or no background in stochastics. We explain the construction of Wiener measure based on the heat kernel in full detail and we prove the Feynman-Kac formula for Schrödinger operators…
Paper develops a fractal dimension-based generalization measure.
Unified framework for studying softmax attention under large prompts.
New risk measure considers horizon risk and interest rate uncertainty.
New formula for instantaneous frequency in unbalanced systems.
Spectral risk measures are attractive risk measures as they allow the user to obtain risk measures that reflect their subjective risk-aversion. This paper examines spectral risk measures based on an exponential utility function, and finds that these risk measures have nice intuitive properties. It also discusses how th…
This paper proposes to perform authorship analysis using the Fast Compression Distance (FCD), a similarity measure based on compression with dictionaries directly extracted from the written texts. The FCD computes a similarity between two documents through an effective binary search on the intersection set between the …
The inversion formula for conservative multifractal measures was unveiled mathematically a decade ago, which is however not well tested in real complex systems. In this Letter, we propose to verify the inversion formula using high-frequency turbulent financial data. We construct conservative volatility measure based on…
Proposes a new tail risk measure based on the most probable maximum risk event size.
Using Vovk's outer measure, which corresponds to a minimal superhedging price, the existence of quadratic variation is shown for "typical price paths" in the space of càdlàg functions possessing a mild restriction on the jumps directed downwards. In particular, this result includes the existence of quadratic variation …
We propose a novel method for clustering data which is grounded in information-theoretic principles and requires no parametric assumptions. Previous attempts to use information theory to define clusters in an assumption-free way are based on maximizing mutual information between data and cluster labels. We demonstrate …
We present a general construction for dependent random measures based on thinning Poisson processes on an augmented space. The framework is not restricted to dependent versions of a specific nonparametric model, but can be applied to all models that can be represented using completely random measures. Several existing …
Given a sample of an abstract manifold immersed in some Euclidean space, we describe a way to recover the singular homology of the original manifold. It consists in estimating its tangent bundle -- seen as subset of another Euclidean space -- in a measure theoretic point of view, and in applying measure-based filtratio…
In this paper we present a theoretical framework for studying coherent acceptability indices in a dynamic setup. We study dynamic coherent acceptability indices and dynamic coherent risk measures, and we establish a duality between them. We derive a representation theorem for dynamic coherent risk measures in terms of …
We propose a generalization of the classical notion of the that takes into account not only the probability of the losses, but the balance between such probability and the amount of the loss. This is obtained by defining a new class of law invariant risk measures based on an appropriate family of acceptance set…
We present the Procrustes measure, a novel measure based on Procrustes rotation that enables quantitative comparison of the output of manifold-based embedding algorithms (such as LLE (Roweis and Saul, 2000) and Isomap (Tenenbaum et al, 2000)). The measure also serves as a natural tool when choosing dimension-reduction …
Improved deep neural network generalization through noise resilience.
This paper studies graphical model selection, i.e., the problem of estimating a graph of statistical relationships among a collection of random variables. Conventional graphical model selection algorithms are passive, i.e., they require all the measurements to have been collected before processing begins. We propose an…
Producing overlapping schemes is a major issue in clustering. Recent proposed overlapping methods relies on the search of an optimal covering and are based on different metrics, such as Euclidean distance and I-Divergence, used to measure closeness between observations. In this paper, we propose the use of another meas…
Measuring conditional dependence is an important topic in statistics with broad applications including graphical models. Under a factor model setting, a new conditional dependence measure based on projection is proposed. The corresponding conditional independence test is developed with the asymptotic null distribution …
Paper studies convex risk measures linked to optimization.
Practical application of Reinforcement Learning (RL) often involves risk considerations. We study a generalized approximation scheme for risk measures, based on Monte-Carlo simulations, where the risk measures need not necessarily be \emph{coherent}. We demonstrate that, even in simple problems, measures such as the va…
Despite existing work on ensuring generalization of neural networks in terms of scale sensitive complexity measures, such as norms, margin and sharpness, these complexity measures do not offer an explanation of why neural networks generalize better with over-parametrization. In this work we suggest a novel complexity m…
The paper proposes a new approach to model risk measurement based on the Wasserstein distance between two probability measures. It formulates the theoretical motivation resulting from the interpretation of fictitious adversary of robust risk management. The proposed approach accounts for equivalent and non-equivalent p…
Post-hoc model-agnostic interpretation methods such as partial dependence plots can be employed to interpret complex machine learning models. While these interpretation methods can be applied regardless of model complexity, they can produce misleading and verbose results if the model is too complex, especially w.r.t. f…
We propose a new multivariate dependency measure. It is obtained by considering a Gaussian kernel based distance between the copula transform of the given d-dimensional distribution and the uniform copula and then appropriately normalizing it. The resulting measure is shown to satisfy a number of desirable properties. …