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

122245367489 · Jun 202019922001200920172026
48 results for coarse PD(n) spaces

We study discrete group actions on coarse Poincare duality spaces, e.g. acyclic simplicial complexes which admit free cocompact group actions by Poincare duality groups. When G is an (n-1) dimensional duality group and X is a coarse Poincare duality space of formal dimension n, then a free simplicial action of G on X d…

1999-11-02abs ↗pdf ↗

Study groups admitting unbounded quasimorphisms to R with coarsely-connected quasikernel.

problem Understanding PD3\mathrm{PD}^3 groups and their properties.
method Coarse generalization of Shapiro's lemma, homological isoperimetric inequalities, and Margolis's coarse homological algebra.
result Groups admitting unbounded quasimorphisms to R with coarsely-connected quasikernel are either torus or Klein-bottle bundles over S^1, or quasiisometric to Riemannian manifolds.

The paper stabilizes PD term structures under forecast uncertainty using a Kalman filter with an anchored observation model.

problem Stable estimation of lifetime PDs under forecast uncertainty.
method Reformulated in state-space framework, introduced an anchored observation model.
result Asymptotic stochastic stability of error dynamics, leading to smoother projections.

We define partial differential (PD in the following), i.e., field theoretic analogues of Hamiltonian systems on abstract symplectic manifolds and study their main properties, namely, PD Hamilton equations, PD Noether theorem, PD Poisson bracket, etc.. Unlike in standard multisymplectic approach to Hamiltonian field the…

2009-03-26abs ↗pdf ↗

Persistence diagrams (PDs) play a key role in topological data analysis (TDA), in which they are routinely used to describe topological properties of complicated shapes. PDs enjoy strong stability properties and have proven their utility in various learning contexts. They do not, however, live in a space naturally endo…

2017-06-11abs ↗pdf ↗

A closed 4-manifold (or, more generally, a finite PD4PD_4-space) has a finitely dominated infinite regular covering space if and only if either its universal covering space is finitely dominated or it is finitely covered by the mapping torus of a self homotopy equivalence of a PD3PD_3-complex.

2013-01-17abs ↗pdf ↗

We show that if XX is an indecomposable PD3PD_3-complex and π1(X)isthefundamentalgroupofareducedfinitegraphoffinitegroupsbutisnotvirtuallycyclicthenπ_1(X) is the fundamental group of a reduced finite graph of finite groups but is not virtually cyclic then Xisorientable,theunderlyinggraphisatree,alltheedgegroupsare is orientable, the underlying graph is a tree, all the edge groups are Z/2Zandallbutatmostoneofthevertexgroupsisdihedraloforder and all but at most one of the vertex groups is dihedral of order 2m…

2008-08-13abs ↗pdf ↗

Paper solves open question about non-positive kernels by decomposing them into PD kernels.

problem Can non-positive definite kernels be decomposed into the difference of two positive definite kernels?
method Introduced signed measure to transform positive decomposition into measure decomposition, providing a sufficient and necessary condition.
result First random features algorithm for unbiased estimation of non-positive kernels.

Our previous exploration of the $\cE_g^{PD}$-geometry has shown that the field is promising. Namely, the $\cE_g^{PD}$-approach is amenable to development of novel trends in relativistic and metric differential geometry and can particularly be effective in context of the Finslerian or Minkowskian Geometries. The main po…

2003-10-13abs ↗pdf ↗

Study pro-pp completions of orientable PD_n groups, proving best results in three cases.

problem Understanding pro-pp completions of orientable PD_n groups.
method Examined four cases of orientable PD_3-groups and some PD_n groups (n≤5), providing examples and proving best results in three cases.
result Best results in three out of four cases of orientable PD_3-groups.

The paper classifies PD_4-complexes based on their fundamental group properties.

problem Understanding the structure of PD_4-complexes based on their fundamental group properties.
method Analyzing the fundamental group and its modules to classify PD_4-complexes.
result The classification of PD_4-complexes based on their fundamental group properties.

In this article, we introduce the notion of a functor on coarse spaces being coarsely excisive- a coarse analogue of the notion of a functor on topological spaces being excisive. Further, taking cones, a coarsely excisive functor yields a topologically excisive functor, and for coarse topological spaces there is an ass…

2010-02-24abs ↗pdf ↗

A new tree-based estimator, FastPD, efficiently estimates PD functions for machine learning models.

problem Efficiently estimating Partial Dependence functions for machine learning models.
method Proposes a new tree-based estimator, FastPD, to estimate PD functions.
result FastPD consistently estimates the desired population quantity and improves complexity from quadratic to linear.

In this paper we formalize a combinatorial object for describing link diagrams called a Planar Diagram Code. PD-codes are used by the KnotTheory Mathematica package developed by Bar-Natan, et al. We present the set of PD-codes as a stand alone object and discuss its relationship with link diagrams. We give an explicit …

2013-09-12abs ↗pdf ↗

Extends characterization of PD3PD_3-pairs with aspherical boundaries to those with spherical boundaries.

problem Characterizing fundamental triples of PD3PD_3-pairs with boundary components of different types.
method Extends Turaev and Bleile's work by relaxing the π1π_1-injectivity hypothesis and considering pairs with spherical boundary components.
result Characterization of fundamental triples for PD3PD_3-pairs with spherical boundary components and c.d.π1(P)2c.d.π_1(P)\leq2.

Following Roe and others (see, e.g., [MR1451755]), we (re)develop coarse geometry from the foundations, taking a categorical point of view. In this paper, we concentrate on the discrete case in which topology plays no role. Our theory is particularly suited to the development of the_Roe (C*-)algebras_ C*(X) and their K…

2007-08-29abs ↗pdf ↗

Researchers formalize PD and PFI to relate them to data generating process.

problem Lack of theory linking PD and PFI to data generating process.
method Formalize PD and PFI as estimators of ground truth estimands, account for model variance with learner-PD and learner-PFI.
result PD and PFI estimates deviate from ground truth due to statistical biases, model variance, and Monte Carlo approximation errors.

Paper presents a method for estimating long-term PDs with incomplete data.

problem Estimating long-term PDs with limited and incomplete historical data.
method Single risk factor approach for simultaneous calibration of PDs across sub-portfolios.
result Method yields long-term PDs without requiring complete historical data.

We prove the Tits alternative for an almost coherent PD(3)PD(3) group which is not virtually properly locally cyclic. In particular, we show that an almost coherent PD(3)PD(3) group which cannot be generated by fewer than four elements always contains a rank 2 free group.

2017-10-29abs ↗pdf ↗

A model learns symptom-drug relations for PD patients.

problem Automatic prescription recommendation for Parkinson's Disease patients.
method Builds a dataset of PD symptoms and prescriptions, learns latent symptom space, uses alternating optimization.
result Effective in recommending suitable prescription drugs for new PD patients.

Classifies homeomorphism groups of countable Stone spaces up to coarse equivalence.

problem Classifying non-locally compact topological groups using geometric group theory.
method Classification based on coarsely bounded sets and quasi-isometry.
result Groups in the second class are quasi-isometric to the Hamming cube.

Coarse homotopy theory connects Euclidean cones to shape theory of compact spaces.

problem Establishing connections between coarse homotopy theory and shape theory.
method Using pointed shape invariants and inverse mapping telescopes.
result Proving two compact spaces are strong shape equivalent if their Euclidean cones are coarsely homotopy equivalent.

Study extends Elkalla's work on subnormal subgroups to PD3PD_3-groups, but L2L^2-Betti numbers need verification.

problem Verifying L2L^2-Betti numbers for PD3PD_3-groups and group pairs.
method Algebraic arguments extending Elkalla's work, but reliant on unproven L2L^2-Betti number hypothesis.
result Need further research on L2L^2-Betti numbers for general PD3PD_3-groups.

The coarse category was established by Roe to distill the salient features of the large-scale approach to metric spaces and groups that was started by Gromov. In this paper, we use the language of coarse spaces to define coarse versions of asymptotic property C and decomposition complexity. We prove that coarse propert…

2016-04-08abs ↗pdf ↗

The study explores ends in coarse homotopy of proper geodesic spaces.

problem Understanding ends in coarse homotopy of proper geodesic spaces.
method Recontextualizing ends as a functor and proving properties of coarse path components.
result Existence of a natural surjection from coarse path components to ends, not always an injection.

Paper relates asymptotic dimension to cofinal dimension using coarse proximities.

problem Relating asymptotic dimension to cofinal dimension in metric spaces.
method Introducing coarse proximities and inverse limit constructions.
result Asymptotic dimension is bounded by coarse cofinal dimension and cofinal dimension of Higson corona.

Scaff-PD improves fairness and robustness in federated learning with reduced communication.

problem Improving fairness and robustness in federated learning with limited communication.
method Scaff-PD uses a family of distributionally robust objectives and an accelerated primal dual algorithm with bias-corrected steps.
result Scaff-PD achieves significant gains in communication efficiency and convergence speed while maintaining fairness and robustness.

PD curve calibration refers to the transformation of a set of rating grade level probabilities of default (PDs) to another average PD level that is determined by a change of the underlying portfolio-wide PD. This paper presents a framework that allows to explore a variety of calibration approaches and the conditions un…

2012-12-15abs ↗pdf ↗