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

4284125167 · Jun 202019922001200920172026
48 results for good cover

We discuss construction of coverings of the unit ball of a finite dimensional Banach space. The well known technique of comparing volumes gives upper and lower bounds on covering numbers. This technique does not provide a construction of good coverings. Here we apply incoherent dictionaries for construction of good cov…

2013-01-10abs ↗pdf ↗

A good cover in R^d is a collection of open contractible sets in R^d such that the intersection of any subcollection is either contractible or empty. Motivated by an analogy with convex sets, intersection patterns of good covers were studied intensively. Our main result is that intersection patterns of good covers are …

2012-05-28abs ↗pdf ↗

Paper extends theorem on covering spaces and Jordan curves.

problem Covering and extending theorems for Alexandrov spaces.
method Introduces proximal homotopic cycles to extend the Mitsuishi-Yamaguchi theorem.
result Extensions of the Mitsuishi-Yamaguchi Good Covering Theorem and Jordan curve theorem.

This paper extends the Good Covering Theorem and Jordan Curve Theorem for proximal Alexandrov spaces.

problem Extending the Good Covering Theorem and Jordan Curve Theorem to proximal Alexandrov spaces.
method Introducing path cycles and using them to extend the Good Covering Theorem and Jordan Curve Theorem.
result Extensions of the Mitsuishi-Yamaguchi Good Covering Theorem and Jordan Curve Theorem for proximal Alexandrov spaces.

Study shows shortest geodesic length on certain manifolds is limited by volume, diameter, and cover elements.

problem Bounding the length of shortest closed geodesics on Riemannian manifolds with good covers.
method Generalization of previous results using diameter, volume, and cover elements to bound geodesic length.
result Length of shortest closed geodesic is bounded by a function of volume, diameter, and cover elements.

We introduce the notion of good coverings of metric spaces, and prove that if a metric space admits a good covering, then it has the same locally Lipschitz homotopy type as the nerve complex of the covering. As an application, we obtain a Lipschitz homotopy stability result for a moduli space of compact Alexandrov spac…

2017-04-28abs ↗pdf ↗

JRFs improve semi-supervised learning by balancing generation and classification.

problem Mode missing and mode covering issues in GANs and VAEs, and conflict between good classification and generation.
method Joint-stochastic-approximation random fields (JRFs) for deep undirected generative models.
result JRFs achieve good classification and generation results in SSL.

A canonical branched covering over each sufficiently good simplicial complex is constructed. Its structure depends on the combinatorial type of the complex. In this way, each closed orientable 3-manifold arises as a branched covering over the 3-sphere from some triangulation of S^3. This result is related to a theorem …

2001-08-29abs ↗pdf ↗

The purpose of this paper is to produce restrictions on fundamental groups of manifolds admitting good complexifications by proving the following Cheeger-Gromoll type splitting theorem: Any closed manifold MM admitting a good complexification has a finite-sheeted regular covering M1M_1 such that M1M_1 admits a fiber b…

2015-03-27abs ↗pdf ↗

We give a complete proof of Thurston's Orbifold Theorem for very good 3-orbifolds of cyclic type. An orbifold is said to be very good when it has a finite cover which is a manifold. A 3-orbifold is of cyclic type if the singular set is a non-empty 1-manifold transverse to the boundary.

1998-05-16abs ↗pdf ↗

The notion of covering type was recently introduced by Karoubi and Weibel to measure the complexity of a topological space by means of good coverings. When X has the homotopy type of a finite CW-complex, its covering type coincides with the minimum possible number of vertices of a simplicial complex homotopy equivalent…

2017-12-07abs ↗pdf ↗

Let M be a manifold, possibly with boundary. We show that the deRham differential from k-forms to exact (k+1)-forms has a continuous right inverse when both spaces are given the weak Whitney topology. This antidifferential operator is given a fairly explicit formula depending on the choice of a suitable good cover of M…

2013-11-06abs ↗pdf ↗

We discuss the asymptotic lower bound on the inner radius of nodal domains that arise from Laplacian eigenfunctions φλ φ_λ on a closed Riemannian manifold (M,g) (M,g) . First, in the real-analytic case we present an improvement of the currently best known bounds, due to Mangoubi (\cite{Man1}). Furthermore, using recent re…

2016-07-13abs ↗pdf ↗

This paper, together with Part II, expands the results of math.DG/9803051. In Part I we study the twisted index theory of elliptic operators on orbifold covering spaces of compact good orbifolds, which are invariant under a projective action of the orbifold fundamental group. We apply these results to obtain qualitativ…

1999-11-15abs ↗pdf ↗

Several approximate policy iteration schemes without value functions, which focus on policy representation using classifiers and address policy learning as a supervised learning problem, have been proposed recently. Finding good policies with such methods requires not only an appropriate classifier, but also reliable e…

2008-05-14abs ↗pdf ↗

We extend the concept of orbifold to that of branchfold, in order to allow any cone singularities with rational angles, and show why branchfolds naturally fit in the theory of branched coverings. Then, we obtain a geometric goodness theorem for branchfolds and apply it to prove that a conifold can be endowed with branc…

2008-06-18abs ↗pdf ↗

We construct pairs and continuous families of isospectral yet locally non-isometric orbifolds via an equivariant version of Sunada's method. We also observe that if a good orbifold O\mathcal{O} and a smooth manifold MM are isospectral, then they cannot admit non-trivial finite Riemannian covers M1OM_1 \to \mathcal{O}

2006-08-22abs ↗pdf ↗

We establish new strong lower bounds on the (subnormal) subgroup growth of a large class of groups. This includes the fundamental groups of all finite-volume hyperbolic 3-manifolds and all (free non-abelian)-by-cyclic groups. The lower bound is nearly exponential, which should be compared with the fastest possible subg…

2005-12-13abs ↗pdf ↗

It is shown in this paper that given any closed oriented hyperbolic 3-manifold, every closed oriented 3-manifold is mapped onto by a finite cover of that manifold via a map of degree 1, or in other words, virtually 1-dominated by that manifold. This improves a known result of virtual 2-domination. The proof invokes a r…

2016-10-13abs ↗pdf ↗

New insights show coverage conditions are crucial for efficient online reinforcement learning.

problem The role of coverage conditions in determining sample complexity of offline reinforcement learning.
method Established a connection between coverage conditions and sample efficiency in online reinforcement learning.
result Coverability, a structural property of MDPs, enables sample-efficient exploration in online reinforcement learning.

We prove the "End Curve Theorem," which states that a normal surface singularity (X,o)(X,o) with rational homology sphere link ΣΣ is a splice-quotient singularity if and only if it has an end curve function for each leaf of a good resolution tree. An "end-curve function" is an analytic function $(X,o)\to (\C,0)$ whose ze…

2008-04-29abs ↗pdf ↗

Residual connections significantly boost the performance of deep neural networks. However, there are few theoretical results that address the influence of residuals on the hypothesis complexity and the generalization ability of deep neural networks. This paper studies the influence of residual connections on the hypoth…

2019-04-02abs ↗pdf ↗

We present an unsupervised approach for discovering semantic representations of mathematical equations. Equations are challenging to analyze because each is unique, or nearly unique. Our method, which we call equation embeddings, finds good representations of equations by using the representations of their surrounding …

2018-03-24abs ↗pdf ↗

Most machine learning theory and practice is concerned with learning a single task. In this thesis it is argued that in general there is insufficient information in a single task for a learner to generalise well and that what is required for good generalisation is information about many similar learning tasks. Similar …

2019-11-09abs ↗pdf ↗

Among other things, we prove the following two topologcal statements about closed hyperbolic 3-manifolds. First, every rational second homology class of a closed hyperbolic 3-manifold has a positve integral multiple represented by an oriented connected closed π1π_1-injectively immersed quasi-Fuchsian subsurface. Second…

2013-09-28abs ↗pdf ↗

Large corporate credit models may be adapted for small business risk assessment.

problem Limited data and lack of credit analysts for small businesses.
method Adapting large corporate credit risk models for small businesses.
result Adapted models can predict small business credit risk effectively.

New algorithm uses density ratios for efficient online reinforcement learning.

problem Challenges in collecting exploratory data for online reinforcement learning.
method Density ratio modeling for online exploration, combining truncation and optimism.
result Sample-efficient online exploration achieved with GLOW and HyGLOW.

We employ random geometric digraphs to construct semi-parametric classifiers. These data-random digraphs are from parametrized random digraph families called proximity catch digraphs (PCDs). A related geometric digraph family, class cover catch digraph (CCCD), has been used to solve the class cover problem by using its…

2017-05-22abs ↗pdf ↗

This is an introduction to the subject of the differential topology of the space of smooth loops in a finite dimensional manifold. It began as the background notes to a series of seminars given at NTNU and subsequently at Sheffield. I am posting them in the hope that they will be useful to people wishing to know a litt…

2005-10-05abs ↗pdf ↗

LLMs perform well in financial sentiment analysis without fine-tuning.

problem Challenges in financial terminology, emotions, and ambiguous expressions.
method In-context learning methods for financial document-sentiment pairs.
result LLMs can generalize in-context demonstrations to new financial documents.

Tensors or {\em multi-way arrays} are functions of three or more indices (i,j,k,)(i,j,k,\cdots) -- similar to matrices (two-way arrays), which are functions of two indices (r,c)(r,c) for (row,column). Tensors have a rich history, stretching over almost a century, and touching upon numerous disciplines; but they have only recent…

2016-07-06abs ↗pdf ↗

Graph connection Laplacian (GCL) is a modern data analysis technique that is starting to be applied for the analysis of high dimensional and massive datasets. Motivated by this technique, we study matrices that are akin to the ones appearing in the null case of GCL, i.e the case where there is no structure in the datas…

2013-10-01abs ↗pdf ↗

The paper bridges diffeological bundle theory with higher topos theory.

problem Comparing Čech cohomology of diffeological spaces with existing notions.
method Using Čech model structure on simplicial presheaves and diffeological spaces as discrete simplicial presheaves.
result Nerve of diffeological principal GG-bundles is weak homotopy equivalent to GG-principal \infty-bundles.