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

Trend · papers per month

80160240320 · Jun 202019922001200920172026
48 results for intrinsic measures

Paper infers intrinsic dimension from quasi-convex measurements.

problem Inferring intrinsic dimension from measurements by quasi-convex functions.
method Developed a method using filtration of Dowker complexes based on discrete data of point orderings.
result Correct intrinsic dimension can be inferred in the limit of large data under generic assumptions.

Monetary risk measures are usually interpreted as the smallest amount of external capital that must be added to a financial position to make it acceptable. We propose a new concept: intrinsic risk measures and argue that this approach provides a direct path from unacceptable positions towards the acceptance set. Intrin…

2016-10-27abs ↗pdf ↗

This paper studies rectifiability in Carnot groups and proves geometric area formulas.

problem The study of rectifiability in Carnot groups and related geometric properties.
method Analysis of rectifiable measures in Carnot groups, geometric area formulas, and rectifiability of geodesic spheres.
result Geometric area formula for the centered Hausdorff measure restricted to intrinsically differentiable graphs in Carnot groups.

We review the nature of some well-known phenomena such as volatility smiles, convexity adjustments and parallel derivative markets. We propose that the market is incomplete and postulate the existence of intrinsic risks in every contingent claim as a basis for understanding these phenomena. In a continuous time framewo…

2014-03-03abs ↗pdf ↗

Study area and coarea formulas for graphs and submanifolds in Carnot groups.

problem Understanding geometric properties of submanifolds in Carnot groups.
method Developed area and coarea formulas for CH1C^1_H intrinsic graphs and submanifolds.
result Deduced density properties for Hausdorff measures and coarea formula for Carnot groups.

New method estimates intrinsic dimensionality using angles, not distances.

problem Estimating local intrinsic dimensionality accurately.
method Introduces a new estimator using the distribution of angles between neighbor points.
result New estimator behaves similarly but complementarily to existing measures of intrinsic dimensionality.

For each submanifold of a stratified group, we find a number and a measure only depending on its tangent bundle, the grading and the fixed Riemannian metric. In two step stratified groups, we show that such number and measure coincide with the Hausdorff dimension and with the spherical Hausdorff measure of the submanif…

2006-08-03abs ↗pdf ↗

Improved estimation of concentration using half-spaces for adversarial vulnerability.

problem Understanding the concentration of measure phenomenon and its impact on adversarial vulnerability.
method Extending Gaussian Isoperimetric Inequality to non-spherical Gaussian measures and arbitrary ℓ_p-norms, using half-spaces to estimate concentration.
result Proposed method finds tighter intrinsic robustness bounds, providing evidence against concentration as a cause of adversarial vulnerability.

This paper proves geodesic curvature measures are bounded for curves near cross cap singularities.

problem Boundedness of geodesic curvature measures near cross cap singularities.
method Analyzes intrinsic cross cap singularities and extends Gauss-Bonnet formula.
result Proves boundedness of geodesic curvature measures for curves near cross cap singularities.

This paper introduces intrinsic time, a new measure of time for complex systems.

problem Traditional time measures fail to capture the dynamic nature of real-world phenomena.
method Intrinsic time uses an event-based, algorithmic framework to analyze time series data.
result Intrinsic time reveals novel structures and regularities in financial markets.

New method for long-term sampling of complex dynamics on curved spaces.

problem Sampling ergodic dynamics on Riemannian manifolds efficiently over long periods.
method Intrinsic geometric operations for sampling invariant measure without embeddings.
result Outperforms previous methods in long-term sampling efficiency.

New RL approach uses future state and action visitation measures for better exploration.

problem Improving exploration in reinforcement learning.
method Intrinsic reward based on future state and action visitation measures, using contraction operators.
result Policies achieve good state-action space coverage and high performance.

A new measure of causal influence quantifies intrinsic contributions in DAGs.

problem Quantifying intrinsic causal contributions in Directed Acyclic Graphs (DAGs).
method Recursive decomposition of node contributions, structure-preserving interventions, Shapley symmetrization.
result A measure of intrinsic causal contribution that is invariant to node relabeling.

We introduce a notion of intrinsic linking and knotting for virtual spatial graphs. Our theory gives two filtrations of the set of all graphs, allowing us to measure, in a sense, how intrinsically linked or knotted a graph is; we show that these filtrations are descending and non-terminating. We also provide several ex…

2006-06-09abs ↗pdf ↗

We introduce an event based framework of directional changes and overshoots to map continuous financial data into the so-called Intrinsic Network - a state based discretisation of intrinsically dissected time series. Defining a method for state contraction of Intrinsic Network, we show that it has a consistent hierarch…

2014-02-10abs ↗pdf ↗

A directed graph GG is intrinsically linked\textit{intrinsically linked} if every embedding of that graph contains a non-split link LL, where each component of LL is a consistently oriented cycle in GG. A tournament\textit{tournament} is a directed graph where each pair of vertices is connected by exactly one directed edge. We consider intr…

2019-01-11abs ↗pdf ↗

We characterise the link of derivatives in measure, which are introduced in [AKR,Card,ORS] respectively by different means, for functions on the space M\mathbb M of finite measures over a Riemannian manifold MM. For a reasonable class of functions ff, the extrinsic derivative DEfD^Ef coincides with the linear functio…

2019-08-10abs ↗pdf ↗

We obtain a blow-up theorem for regular submanifolds in the Heisenberg group, where intrinsic dilations are used. Main consequence of this result is an explicit formula for the density of (p+1)-dimensional spherical Hausdorff measure restricted to a p-dimensional submanifold with respect to the Riemannian surface measu…

2005-06-22abs ↗pdf ↗

Generative Adversarial Networks (GANs) are an elegant mechanism for data generation. However, a key challenge when using GANs is how to best measure their ability to generate realistic data. In this paper, we demonstrate that an intrinsic dimensional characterization of the data space learned by a GAN model leads to an…

2019-05-02abs ↗pdf ↗

We consider non-parametric estimation and inference of conditional moment models in high dimensions. We show that even when the dimension DD of the conditioning variable is larger than the sample size nn, estimation and inference is feasible as long as the distribution of the conditioning variable has small intrinsic…

2019-01-11abs ↗pdf ↗

Any Riemannian manifold has a canonical collection of valuations (finitely additive measures) attached to it, known as the intrinsic volumes or Lipschitz-Killing valuations. They date back to the remarkable discovery of H. Weyl that the coefficients of the tube volume polynomial are intrinsic invariants of the metric. …

2019-12-19abs ↗pdf ↗

New method quantifies intrinsic causal contributions in neural networks.

problem Measuring the causal influence of input features in deep neural networks.
method Proposes an identifiable generative post-hoc framework to quantify intrinsic causal contributions (ICC) as structural causal models.
result ICC generates more intuitive and reliable explanations compared to existing global explanation techniques.

The paper corrects biases in estimating intrinsic dimension and differential entropy.

problem Systematic bias in estimating intrinsic dimension and differential entropy.
method A bias-corrected estimator for both measures is proposed, highlighting shared steps and useful consequences.
result Simultaneous estimation of differential entropy and intrinsic dimension provides complementary perspectives on underlying manifolds.

Many nonparametric regressors were recently shown to converge at rates that depend only on the intrinsic dimension of data. These regressors thus escape the curse of dimension when high-dimensional data has low intrinsic dimension (e.g. a manifold). We show that k-NN regression is also adaptive to intrinsic dimension. …

2011-10-19abs ↗pdf ↗

Horizontal points of smooth submanifolds in stratified groups play the role of singular points with respect to the Carnot-Carathe'odory distance. When we consider hypersurfaces, they coincide with the well known characteristic points. In two step groups, we obtain pointwise estimates for the Riemannian surface measure …

2008-07-28abs ↗pdf ↗

We find all intrinsic measures of C1,1C^{1,1} smooth submanifolds in the Engel group, showing that they are equivalent to the corresponding dd-dimensional spherical Hausdorff measure restricted to the submanifold. The integer dd is the degree of the submanifold. These results follow from a different approach to negligi…

2008-07-28abs ↗pdf ↗

The paper proposes a least squares method for binary compressive sampling with low intrinsic dimension signals.

problem Recovering signals from binary measurements with noise and sign flips.
method Least squares decoder for signals with low generative intrinsic dimension.
result The least squares decoder achieves a sharp estimation error of O(klog(Ln)m)O(\sqrt{\frac{k\log (Ln)}{m}}) under certain conditions.

MSA compares neural representations' intrinsic geometry for better understanding.

problem Existing similarity measures fail to capture subtle distinctions between neural network solutions.
method Metric similarity analysis (MSA) using Riemannian geometry.
result MSA can disentangle features of neural computations and compare nonlinear dynamics.

New estimators for intrinsic dimension and Wasserstein distance improve OT accuracy.

problem Intrinsic dimension estimation and Wasserstein distance estimation in large-scale OT.
method Introduces novel estimators for intrinsic dimension and Wasserstein distance.
result Simple, tuning-free estimator of OT and fast intrinsic dimension estimator.

In this article, we study the geodesic problem in a generalized metric space, in which the distance function satisfies a relaxed triangle inequality d(x,y)σ(d(x,z)+d(z,y))d(x,y)\leq σ(d(x,z)+d(z,y)) for some constant σ1σ\geq 1, rather than the usual triangle inequality. Such a space is called a quasimetric space. We show that many well-kn…

2008-07-22abs ↗pdf ↗

Reasoning based on causality, instead of association has been considered as a key ingredient towards real machine intelligence. However, it is a challenging task to infer causal relationship/structure among variables. In recent years, an Independent Mechanism (IM) principle was proposed, stating that the mechanism gene…

2019-09-02abs ↗pdf ↗

eDCF estimates intrinsic dimension using local connectivity.

problem Challenges in estimating intrinsic dimension due to scale dependence.
method eDCF: a novel, scalable, and parallelizable method based on Connectivity Factor (CF).
result eDCF consistently matches leading estimators with comparable MAE and higher exact intrinsic dimension match rates.

Data living on manifolds commonly appear in many applications. Often this results from an inherently latent low-dimensional system being observed through higher dimensional measurements. We show that under certain conditions, it is possible to construct an intrinsic and isometric data representation, which respects an …

2018-06-01abs ↗pdf ↗

Robustly computes intrinsic coordinates on point clouds using resampling and averaging.

problem Computing intrinsic coordinates on noisy or outlier-prone point clouds.
method Subsample data, vary hyperparameters, cluster candidate embeddings, identify representative embeddings, and average them using Procrustes analysis.
result Robust to noise and outliers, validated on synthetic and real data.

Unified theory of measure-preserving diffusions on manifolds.

problem Deriving a complete recipe for measure-preserving diffusions on manifolds.
method Developed a geometric theory that unifies and generalizes previous constructions, relying on intrinsic geometry of the target measure.
result The completeness result is a direct consequence of manifold topology and target measure geometry.

We consider an agent's uncertainty about its environment and the problem of generalizing this uncertainty across observations. Specifically, we focus on the problem of exploration in non-tabular reinforcement learning. Drawing inspiration from the intrinsic motivation literature, we use density models to measure uncert…

2016-06-06abs ↗pdf ↗