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

131262393524 · Jun 202019922001200920172026
48 results for Random Differential Topology

The study of topological properties of random smooth maps, focusing on Kac-Rice formula and Betti numbers.

problem Topological and geometric properties of random smooth maps.
method Developed a general framework for differential geometric and topological issues of smooth Gaussian Random Fields, generalized Kac-Rice formula, applied to Kostlan random polynomials, and proved an original theorem in Differential Topology.
result The Betti numbers of the solution of a system of regular equations cannot decrease under a C0\mathcal{C}^0-small perturbation of the equations.

Recently, based on the idea of randomizing space theory, random convex analysis has been being developed in order to deal with the corresponding problems in random environments such as analysis of conditional convex risk measures and the related variational problems and optimization problems. Random convex analysis is …

2016-03-23abs ↗pdf ↗

Motivated by numerous questions in random geometry, given a smooth manifold MM, we approach a systematic study of the differential topology of Gaussian random fields (GRF) X:MRkX:M\to \mathbb{R}^k, that we interpret as random variables with values in Cr(M,Rk)\mathcal{C}^r(M, \mathbb{R}^k), inducing on it a Gaussian measure. Wh…

2019-02-11abs ↗pdf ↗

New method recovers graph latent positions under edge differential privacy.

problem Recovering latent graph information from privatized graphs.
method Applying geometric insights to adjust statistical inference for privatized graphs.
result Achieves consistent recovery of latent positions under local edge differential privacy constraints.

Lectures on topological field theories and differential cohomology.

problem Exploring topological field theories and their connections to differential cohomology.
method Introduction to topological field theory and generalized Abelian gauge theories.
result Explains the relationship between topological field theories and differential cohomology.

Injectivity of ReLU networks is characterized for generative models and inverse problems.

problem Injectivity in ReLU networks for generative models and inverse problems.
method Layerwise analysis, worst-case Lipschitz constants, differential topology, random projections.
result Global injectivity of ReLU networks requires expansivity between 3.4 and 10.5 for Gaussian matrices.

Study on random surfaces in hyperbolic 3-manifolds, focusing on geometric and topological properties.

problem Distribution of nearly geodesic surfaces in hyperbolic 3-manifolds.
method Invariant measures on the Grassmann bundle G(M) derived from limits of random minimal surfaces.
result Topological limiting measures are totally scarring if M contains a totally geodesic subsurface, while geometrical limiting measures are not.

CMRFs extend PGMs for topological data, capturing both conditional and marginal dependencies.

problem Limited expressiveness of PGMs for topological data.
method Introducing Colored Markov Random Fields (CMRFs) that model Gaussian edge variables on topological spaces.
result CMRFs improve distributed estimation over physical networks compared to baselines.

Paper presents voxel graph operators for vector data models.

problem Efficient conversion and analysis of geometric models.
method Topological voxelization, graph construction, differential operator derivation.
result Discrete differential and integral operators from voxel complexes.

In this note we prove some results in flat and differential KK-theory. The first one is a proof of the compatibility of the differential topological index and the flat topological index by a direct computation. The second one is the explicit isomorphisms between Bunke-Schick differential KK-theory and Freed-Lott diff…

2012-03-24abs ↗pdf ↗

Study shows solutions of differential inclusions are homotopy equivalent in W1,pW^{1,p}-topology.

problem Homotopy properties of solutions in differential inclusions.
method Analyzes differential inclusion with specific assumptions on corank one distribution.
result Solutions are homotopy equivalent to loop spaces in W1,pW^{1,p}-topology.

This paper formalizes the h-principle and sphere eversion in differential topology.

problem Formalizing the h-principle and sphere eversion in differential topology.
method Lean formalization of the local h-principle for first-order partial differential relations, using convex integration.
result Reproves Smale's sphere eversion theorem and formalizes advanced mathematics.

For any pseudo-Anosov diffeomorphism on a closed orientable surface SS of genus greater than one, it is known by the work of Bers and Thurston that the topological entropy agrees with the translation distance on the Teichmüller space with respect to the Teichmüller metric. In this paper, we consider random walks on th…

2016-04-04abs ↗pdf ↗

The paper characterizes the geometry and topology of spin random fields.

problem Understanding the expected geometry and topology of spin random fields.
method Investigating the asymptotic behavior of geometric and topological functionals for spin random fields under scaling assumptions.
result Explicit results for monochromatic fields, showing non-universal asymptotic behavior and new generalized models.

A scalable protocol for federated averaging with privacy and correctness guarantees.

problem Privacy and correctness in federated learning from multiple parties.
method Scalable protocol using correlated and independent Gaussian noise, analyzed for differential privacy and graph topology.
result Nearly matches trusted curator model's utility with minimal communication.

We provide a systematic approach to twisting differential KO-theory leading to a construction of the corresponding twisted differential Atiyah-Hirzebruch spectral sequence (AHSS). We relate and contrast the degree two and the degree one twists, whose description involves appropriate local systems. Along the way, we pro…

2019-05-22abs ↗pdf ↗

Arguments on PL,(=piecewise linear) topology work over any ordered field in the same way as over the real field, and those on differential topology do over a real closed field R in an o-minimal structure that expands (R,<,0,1,+,cdot). One of the most fundamental properties of definable sets is that a compact definable …

2010-02-08abs ↗pdf ↗

ICLR 2021 challenge in computational geometry and topology attracted 16 teams.

problem Designing and evaluating computational methods in differential geometry and topology.
method Designing and hosting an open-source competition with repositories Geomstats and Giotto-TDA.
result 16 teams participated in the challenge, showcasing innovative contributions to computational geometry and topology.

The paper proves metrizability and dynamics of Weil bundles.

problem Metrizability and dynamics of Weil bundles in differential geometry.
method Investigation of metrizability and dynamics of Weil bundles for smooth compact manifolds and Weil algebras.
result A canonical, complete, weighted metric \(\mathfrak{d}_w\) on \(M^\mathbf{A}\) that encodes geometry and deformations.

Optimizes differentially private kernel learning with random projection.

problem Privacy-preserving learning algorithms with optimal performance.
method Differentially private kernel ERM algorithm based on random projection in reproducing kernel Hilbert space.
result Achieves minimax-optimal excess risk rates for various loss functions.

New study on replicability and stability in machine learning algorithms.

problem Ensuring consistent results in machine learning models without fixing randomness.
method Introduced global stability and list replicability concepts, proving their equivalence and boosting list replicability.
result Global stability can only be achieved weakly, while list replicability can be boosted to achieve high probability of consistent results.

GeoPhy uses geometric gradients to efficiently infer phylogenetic trees from molecular data.

problem Challenges in accurately inferring species relationships from molecular data due to combinatorially vast tree topologies.
method Introduces a novel, fully differentiable formulation of phylogenetic inference using geometric spaces and variational Bayesian methods.
result Significantly outperforms other approximate Bayesian methods in inferring phylogenetic trees.

Proposes using continuum percolation to analyze data manifolds and improve generative models.

problem Disentangling geometric support from probability distributions in high-dimensional data.
method Establishes a correspondence between topological phase transitions of random geometric graphs and data manifolds, using Percolation Shift metric.
result Demonstrates that Percolation Shift metric captures structural pathologies like mode collapse and guides training to prevent manifold shrinkage and improve fidelity.

Graph neural controlled differential equations learn graph dynamics from vertex observations.

problem Predicting future states of dynamical systems on graphs with limited vertex data.
method Incorporates graph topology information into NCDE to predict graph dynamics.
result Informed NCDE requires fewer parameters and lower MAE compared to previous methods.

The purpose of this thesis is to study classical combinatorial objects, such as polytopes, polytopal complexes, and subspace arrangements, using tools that have been developed in combinatorial topology, especially those tools developed in connection with (discrete) differential geometry, geometric group theory and low-…

2014-03-11abs ↗pdf ↗

This paper improves privacy bounds for DP algorithms using ff-DP.

problem Difficulty in analyzing randomness in DP algorithms due to mixture distributions.
method Derives a closed-form expression for trade-off functions and analyzes ff-DP.
result Enhances privacy of DP-GD with random initialization and shuffling models.

We introduce orbifolds from the classical point of view, using charts, and present orbifold versions of elementary objects from Algebraic Topology, such as the fundamental group, coverings and Euler characteristic; Differential Topology/Geometry, including orbibundles, differential forms, integration and (equivariant) …

2019-09-18abs ↗pdf ↗

Paper links set derivatives to its orthogonal projections.

problem Understanding the relationship between set derivatives and projections.
method Derives equations from topological link between Minkowski functional partial derivatives and set boundary.
result System of equations for orthogonal projections derived.

TopoFisher learns topological summaries by maximizing Fisher information, improving parameter efficiency and inference quality.

problem Simulation-based inference misses key information in low-order statistics, especially for non-Gaussian fields.
method TopoFisher uses a differentiable persistent-homology pipeline that learns topological summaries by maximizing local Gaussian Fisher information.
result TopoFisher recovers much of the available information and outperforms fixed topological vectorizations in weak gravitational lensing.

Survey uses Milnor fibrations to classify first integrals of differential systems.

problem Classifying first integrals of differential systems using geometric-topological methods.
method Utilizing Milnor fibrations and connections with harmonic morphisms to provide topological and geometric descriptions.
result Geometric-topological classifications of first integrals for both isolated and non-isolated singularities.

A new method for graph-structured data improves transformer performance by incorporating topology.

problem Improving transformer performance on graph-structured data.
method Parameterizing topological masks as a learnable function of a weighted adjacency matrix, approximated with graph random features.
result Efficient masking algorithms provide strong performance gains for tasks on image and point cloud data.

Differentially private random block coordinate descent improves utility in machine learning.

problem Lack of privacy in classical CD methods when handling sensitive information.
method Proposes a differentially private random block coordinate descent method using sketch matrices and importance sampling.
result Demonstrates improved convergence rates and utility guarantees compared to non-private methods.