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

0.3%0.5%0.8%0.2% · May 201419922001200920172026
26 results for 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 ↗

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.

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.

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 ↗

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.

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.

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.

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.

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_λ.

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.