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

70140209279 · Jun 202019922001200920172026
48 results for measure disintegration

New tools for constructing disintegrations and studying their modes.

problem Difficulty in constructing disintegrations and understanding their modes.
method Developed comprehensive mathematical tools for constructing disintegrations and analyzing their modes.
result Disagreement between restricted density and disintegration density in certain cases.

The paper extends localisation technique to multiple constraints in Euclidean spaces.

problem Proving log-concavity of conditional measures in decomposed convex sets.
method Defining partitions of maximal closed convex sets and proving log-concavity of conditional measures.
result Existence of a partition and log-concavity of conditional measures for almost every set of the partition.

We consider the question of learning in general topological vector spaces. By exploiting known (or parametrized) covariance structures, our Main Theorem demonstrates that any continuous linear map corresponds to a certain isomorphism of embedded Hilbert spaces. By inverting this isomorphism and extending continuously, …

2014-05-01abs ↗pdf ↗

The study proves curvature bounds for quotient spaces of isometric actions.

problem Proving curvature bounds for quotient spaces of isometric actions.
method Disintegrate absolutely continuous measures and define a functional to prove curvature bounds.
result Necessary and sufficient conditions for Ricci curvature to be bounded below.

Paper develops a new generalization bound using PAC-Bayes theory and Gibbs distributions.

problem Limits of traditional generalization bounds due to complexity measures.
method Leverages PAC-Bayes bounds with Gibbs distributions to derive a flexible generalization bound.
result Derives a generalization bound that can adapt to both hypothesis class and task complexity.

New bounds improve neural network generalization through slicing.

problem Difficulty in evaluating mutual information in high dimensions for neural networks.
method Slicing the parameter space and using disintegrated mutual information and k-sliced mutual information.
result Slicing improves generalization and offers significant computational and statistical advantages.

Study approximates operators on labelled conditional distributions for non-exchangeable systems.

problem Approximating operators on constrained probability measures for non-exchangeable systems.
method Combines cylindrical approximations and DeepONet-type neural architecture for finite-dimensional representations.
result Establishes a universal approximation theorem for continuous operators on Mλ\cal M_λ.

Improved bounds on learning algorithms' performance using conditional mutual information.

problem Bounding the generalization error of learning algorithms.
method Introducing conditional mutual information and disintegrated mutual information to tighten bounds.
result New bounds are tighter than previous ones, especially for noisy, iterative algorithms.

Given a pair of second order diffusion operators, one on the total space of a principle bundle NN and the other on the base space MM, intertwined by the projection π:NMπ:N\to M, if the operator A{\mathcal A} on the base manifold has constant rank, we define a semi-connection on the principal bundle which allows to spl…

2019-11-19abs ↗pdf ↗

New bounds using samplewise evaluated CMI for deep neural networks.

problem Improving generalization bounds for deep neural networks.
method Introduced a new family of information-theoretic generalization bounds using samplewise evaluated conditional mutual information (CMI).
result The new bounds can be tighter than previous ones for deep neural networks.

The curve graph and related graphs are hyperbolic and have quasi-tree fibers.

problem Understanding the structure of the curve graph and related graphs.
method Analyzing a sequence of graphs with Lipschitz maps and proving hyperbolicity and quasi-tree properties.
result The graphs in the sequence are hyperbolic and have quasi-tree fibers, leading to bounds on asymptotic dimension and acylindrical actions.

New method reduces memory usage for Bayesian inverse problems on large grids.

problem Solving large-scale linear inverse problems with Gaussian process priors.
method Implicit representation of posterior covariance matrices, sequential disintegrations of Gaussian measures.
result Significant reduction in uncertainty for high-density regions estimation.

Paper addresses the disparity between sampled and mean representations in disentangled learning.

problem Disparity between sampled and mean representations in disentangled learning.
method Proposes a method to eliminate the disparity by proving and utilizing the relationship between total correlation of sampled and mean representations for multivariate normal distributions.
result Demonstrates that a factorized mean representation can have lower total correlation than the sampled representation.

Study invariant measures on measured laminations for subgroups of mapping class group.

problem Classify invariant Radon measures on space of measured laminations for subgroups of mapping class group.
method Geometric approach, focusing on recurrent measured laminations, explicitly constructing ergodic measures.
result Show uniquely ergodic for divergence-type subgroups, generalize results for full mapping class group.

New set-valued star-shaped risk measures introduced for better risk assessment.

problem Improving risk assessment in financial contexts.
method Developed new set-valued star-shaped risk measures and proved their representation theorems.
result Set-valued star-shaped risk measures can be represented as unions of set-valued convex risk measures.

Bayesian approach to robust risk measures under model uncertainty.

problem Representing robust risk measures as a single probability measure.
method Introducing two types of risk measures and analyzing their relation to robust risk measures.
result Robust risk measures can be represented by a mixture probability measure, a Bayesian approach.

The paper studies dynamic star-shaped risk measures and their representation.

problem Representing dynamic star-shaped risk measures and their properties.
method Representation theorems for dynamic monetary and star-shaped risk measures.
result Dynamic star-shaped risk measures can be represented as the lower envelope of a family of dynamic convex risk measures.

Transformers can interpolate between arbitrary measures.

problem Understanding the expressive power of Transformers as measure-to-measure maps.
method Provided an explicit choice of parameters for a single Transformer to match N arbitrary input measures to N arbitrary target measures.
result A single Transformer can interpolate between arbitrary measures.

Submodularity is studied for convex risk measures, including Expected Shortfall.

problem Characterizing submodularity in convex risk measures.
method Analyzing submodularity properties of law-invariant coherent risk measures, including Expected Shortfall and Value-at-Risk.
result AES is submodular only when it reduces to ES, and empirical analysis shows AES violations are less frequent than VaR and ES violations.

The paper explores non-convex risk measures and their characterizations.

problem Characterizing non-convex risk measures without convexity or weak convexity.
method Characterizes monetary risk measures as lower envelopes of families of convex or coherent risk measures, considering law-invariance and SSD-consistency.
result Unified representation theorems for law-invariant risk measures, including VaR.

One often finds in the literature connections between measures of fairness and measures of feature importance employed to interpret trained classifiers. However, there seems to be no study that compares fairness measures and feature importance measures. In this paper we propose ways to evaluate and compare such measure…

2019-10-12abs ↗pdf ↗

Dual representations for robust risk measures and uncertainty sets.

problem Characterizing continuity of robust risk measures and their uncertainty sets.
method Develop dual representations for robust risk measures and uncertainty sets based on distinct geometric assumptions.
result Two dual frameworks for consolidated uncertainty sets are complementary, not interchangeable.

A scalable approach to learning from probability measures using quantization.

problem Efficiently comparing and manipulating large sets of probability measures.
method Quantization of probability measures to a fixed support, followed by optimal transport computations.
result Consistency and convergence guarantees for quantized measures in various OT-based tasks.

Risk measures for multivariate financial positions are studied in a utility-based framework. Under a certain incomplete preference relation, shortfall and divergence risk measures are defined as the optimal values of specific set minimization problems. The dual relationship between these two classes of multivariate ris…

2014-05-19abs ↗pdf ↗

The Cannon-Thurston map's pushed measures on the circle are singular with respect to sphere measures.

problem Understanding the behavior of geodesics and measures on fibered hyperbolic 3-manifolds.
method Properties of geodesics and measures on the circle and sphere are analyzed to prove singularity.
result Natural measures on the circle become singular with respect to measures on the sphere.