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.
Optimizes cover parameter in Mapper algorithm for better visualization.
Algorithms compute invariants of 4-manifolds as branched covers.
Ensemble methods have been shown to be an effective tool for solving multi-label classification tasks. In the RAndom k-labELsets (RAKEL) algorithm, each member of the ensemble is associated with a small randomly-selected subset of k labels. Then, a single label classifier is trained according to each combination of ele…
Survey of universal portfolio techniques for minimizing investment regret.
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 …
A new k-means algorithm using cover trees accelerates clustering.
Two algorithms for interpreting and boosting tree-based models using rule covering.
Invariant Causal Set Covering Machines avoid spurious associations.
We give an algorithm for a surgery description of a -fold cyclic branched cover of branched along a tangle. We generalize constructions of Montesinos and Akbulut-Kirby.
Develops algorithm for finite generating set of liftable mapping class groups of regular abelian covers.
To a rational homology sphere graph manifold one can associate a weighted tree invariant called splice diagram. It was shown earlier that the splice diagram determines the universal abelian cover of the manifold. We will in this article turn the proof of this in to an algorithm to explicitly construct the universal abe…
A new framework uses directed information to efficiently select context chunks.
Partial Wasserstein Covering aims to identify missing patterns in datasets.
Algorithm calculates genus of embedded graphs on surfaces.
In this paper we presented a novel constructive approach for training deep neural networks using geometric approaches. We show that a topological covering can be used to define a class of distributed linear matrix inequalities, which in turn directly specify the shape and depth of a neural network architecture. The key…
In this paper, we introduce a novel method to generate interpretable regression function estimators. The idea is based on called data-dependent coverings. The aim is to extract from the data a covering of the feature space instead of a partition. The estimator predicts the empirical conditional expectation over the cel…
Algorithm decides if pseudo-Anosov flows have perfect fits.
The paper finds new graph covers with exceptionally low degree.
A new risk budgeting scheme derived from universal portfolio theory.
We study the connections among the mapping class group of the twice punctured torus, the cyclic branched coverings of (1,1)-knots and the cyclic presentations of groups. We give the necessary and sufficient conditions for the existence and uniqueness of the n-fold strongly-cyclic branched coverings of (1,1)-knots, thro…
We consider interactive learning and covering problems, in a setting where actions may incur different costs, depending on the response to the action. We propose a natural greedy algorithm for response-dependent costs. We bound the approximation factor of this greedy algorithm in active learning settings as well as in …
Proper regularization is critical for speeding up training, improving generalization performance, and learning compact models that are cost efficient. We propose and analyze regularized gradient descent algorithms for learning shallow neural networks. Our framework is general and covers weight-sharing (convolutional ne…
We use grid diagrams to give a combinatorial algorithm for computing the knot Floer homology of the pullback of a knot K in its m-fold cyclic branched cover Sigma^m(K), and we give computations when m=2 for over fifty three-bridge knots with up to eleven crossings.
We adopt data structure in the form of cover trees and iteratively apply approximate nearest neighbour (ANN) searches for fast compressed sensing reconstruction of signals living on discrete smooth manifolds. Levering on the recent stability results for the inexact Iterative Projected Gradient (IPG) algorithm and by us…
New algorithm for contextual bandits with linear constraints using regression.
The paper studies liftable mapping class groups of cyclic covers of spheres.
Improved Mapper algorithm for datasets with varying density.
We prove that any knot or link in any 3-manifold can be nicely decomposed (splitted) by a filling Dehn sphere. This has interesting consequences in the study of branched coverings over knots and links. We give an algorithm for computing Johansson diagrams of filling Dehn surfaces out from coverings of 3-manifolds branc…
We show that every strongly-cyclic branched covering of a (1,1)-knot is a Dunwoody manifold. This result, together with the converse statement previously obtained by Grasselli and Mulazzani, proves that the class of Dunwoody manifolds coincides with the class of strongly-cyclic branched coverings of (1,1)-knots. As a c…
New SGD covering technique yields dimension-independent generalization bounds.
Kjuchukova's invariant gives a ribbon obstruction for Fox -colored knots. The invariant is derived from dihedral branched covers of 4-manifolds, and is needed to calculate the signatures of these covers, when singularities on the branching sets are present. In this note, we give an algorithm for evaluating $Ξ_…
Study shows offline RL with partial coverage and weak function classes is possible.
New -Coverage objective simplifies exploration in reinforcement learning.
Dihedral linking invariant uses knot colorings to distinguish knots.
This paper proposes a new method for learning covers of geometric datasets to improve topological inference and visualization.
We consider knots equipped with a representation of their knot groups onto a dihedral group D_{2n} (where n is odd). To each such knot there corresponds a closed 3-manifold, the (irregular) dihedral branched covering space, with the branching set over the knot forming a link in it. We report a variety of results relati…
A new method for portfolio allocation in continuous-time markets.
We study the translation surfaces obtained by considering the unfoldings of the surfaces of Platonic solids. We show that they are all lattice surfaces and we compute the topology of the associated Teichmüller curves. Using an algorithm that can be used generally to compute Teichmüller curves of translation covers of p…
Study guarantees convergence of mean shift mode estimation.
Introduces self-regularization for analyzing learning algorithms.
A typical way in which network data is recorded is to measure all the interactions among a specified set of core nodes; this produces a graph containing this core together with a potentially larger set of fringe nodes that have links to the core. Interactions between pairs of nodes in the fringe, however, are not recor…
New algorithm reduces prediction error in online learning without knowing base measure.
New algorithm for online portfolio selection with reduced runtime.
We consider the task of causal structure learning over measurement dependence inducing latent (MeDIL) causal models. We show that this task can be framed in terms of the graph theoretic problem of finding edge clique covers,resulting in an algorithm for returning minimal MeDIL causal models (minMCMs). This algorithm is…
With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral surfaces with non-positive curvature. We show that in the case of such surfaces discr…
Let T be a complex torus, and X the surface CP^1 x T. If T is embedded in CP^{n-1} then X may be embedded in CP^{2n-1}. Let X_Gal be its Galois cover with respect to a generic projection to CP^2. In this paper we compute the fundamental group of X_Gal, using the degeneration and regeneration techniques, the Moishezon-T…
Study covers of surfaces, showing types and properties.
We present a method for the reconstruction of networks, based on the order of nodes visited by a stochastic branching process. Our algorithm reconstructs a network of minimal size that ensures consistency with the data. Crucially, we show that global consistency with the data can be achieved through purely local consid…