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.
BERT learns claim descriptions to identify patent novelty.
Support Vector Data Description (SVDD) is a popular outlier detection technique which constructs a flexible description of the input data. SVDD computation time is high for large training datasets which limits its use in big-data process-monitoring applications. We propose a new iterative sampling-based method for SVDD…
Chart descriptions are a graphic method to describe monodromy representations of various topological objects. Here we introduce a chart description for hyperelliptic Lefschetz fibrations, and show that any hyperelliptic Lefschetz fibration can be stabilized by fiber-sum with certain basic Lefschetz fibrations.
Chart descriptions are a graphic method to describe monodromy representations of various topological objects. Here we introduce a chart description for genus-two Lefschetz fibrations, and show that any genus-two Lefschetz fibration can be stabilized by fiber-sum with certain basic Lefschetz fibrations.
Learning visual feature representations for video analysis is a daunting task that requires a large amount of training samples and a proper generalization framework. Many of the current state of the art methods for video captioning and movie description rely on simple encoding mechanisms through recurrent neural networ…
This paper introduces a new method for model selection and more generally hyperparameter selection in machine learning. Minimum description length (MDL) is an established method for model selection, which is however not directly aimed at minimizing generalization error, which is often the primary goal in machine learni…
New categorization of community detection methods to avoid pitfalls.
New method improves bivariate causal discovery by accurately estimating cause variable complexity.
This paper studies fixed sets in ribbon complexes using descriptive proximity spaces.
A new method for one-class classification using ellipsoidal encapsulation.
In this paper, we propose a novel method for projecting data from multiple modalities to a new subspace optimized for one-class classification. The proposed method iteratively transforms the data from the original feature space of each modality to a new common feature space along with finding a joint compact descriptio…
New method compares community detection algorithms without ground truth.
Using Kirby Calculus, we explicitly pass from Berge's R-R descriptions of ten families of knots with lens space surgeries to surgery descriptions on the minimally twisted five chain link (MT5C). Since the MT5C admits a strong involution, we also give the corresponding tangle descriptions.
In low-dimensional topology, many important decision algorithms are based on normal surface enumeration, which is a form of vertex enumeration over a high-dimensional and highly degenerate polytope. Because this enumeration is subject to extra combinatorial constraints, the only practical algorithms to date have been v…
Synthesizing high-quality images from text descriptions is a challenging problem in computer vision and has many practical applications. Samples generated by existing text-to-image approaches can roughly reflect the meaning of the given descriptions, but they fail to contain necessary details and vivid object parts. In…
This paper creates a tagging system for paintings using historical descriptions.
Combinatorial method computes Legendrian knot invariant.
Support Vector Data Description (SVDD) provides a useful approach to construct a description of multivariate data for single-class classification and outlier detection with various practical applications. Gaussian kernel used in SVDD formulation allows flexible data description defined by observations designated as sup…
Minimum Description Length prevents overfitting in noisy data.
The paper shows how sublinearly Morse boundaries can be understood through combinatorial methods.
Tensor approach simplifies Euclidean space descriptions.
Method estimates dataset utility via minimal program length proxy.
New method to untangle knots using null-homologous twists.
With the rapid proliferation and increased sophistication of malicious software (malware), detection methods no longer rely only on manually generated signatures but have also incorporated more general approaches like machine learning detection. Although powerful for conviction of malicious artifacts, these methods do …
We present an asymptotic criterion to determine the optimal number of clusters in k-means. We consider k-means as data compression, and propose to adopt the number of clusters that minimizes the estimated description length after compression. Here we report two types of compression ratio based on two ways to quantify t…
The description of invariants of surfaces with respect to the motion groups is reduced to the description of invariants of parameterized surfaces with respect to the motion groups. Existence of a commuting system of invariant partial differential operators (derivatives) and a finite system of invariants, such that any …
Paper tackles cold-start domain adaptation with language descriptions.
Many key algorithms in 3-manifold topology involve the enumeration of normal surfaces, which is based upon the double description method for finding the vertices of a convex polytope. Typically we are only interested in a small subset of these vertices, thus opening the way for substantial optimization. Here we give an…
By obtaining surgery descriptions of knots which lie on the genus one fiber of the trefoil or figure eight knot, we show that these include hyperbolic knots with arbitrarily large volume. These knots admit lens space surgeries and form two families of Berge knots. By way of tangle descriptions we also obtain surgery de…
Unique surgery descriptions found for knots in 3-manifolds.
The twisted face-pairing construction of our earlier papers gives an efficient way of generating, mechanically and with little effort, myriads of relatively simple face-pairing descriptions of interesting closed 3-manifolds. The corresponding description in terms of surgery, or Dehn-filling, reveals the twist construct…
Probabilistic programming languages represent complex data with intermingled models in a few lines of code. Efficient inference algorithms in probabilistic programming languages make possible to build unified frameworks to compute interesting probabilities of various large, real-world problems. When the structure of mo…
This paper presents a geometric description of Lagrangian and Hamiltonian systems on Lie affgebroids subject to affine nonholonomic constraints. We define the notion of nonholonomically constrained system, and characterize regularity conditions that guarantee that the dynamics of the system can be obtained as a suitabl…
We describe mirror symmetry on higher dimensional tori, paying special attention to the behaviour of D-branes under mirror symmetry. To find the mirror D-branes the description of mirror symmetry on D-branes due to Ooguri, Oz en Yin is used. This method allows us to deal with the coisotropic D-branes recently introduce…
Paper describes a new method for character varieties of surface groups.
Using methods of descriptive theory it is shown that the classification problem for wild knots is strictly harder than that for countable structures.
Generates garden paintings from text descriptions using deep learning.
This article introduces planar shape signatures derived from homology nerves, which are intersecting 1-cycles in a collection of homology groups endowed with a proximal relator (set of nearness relations) that includes a descriptive proximity. A 1-cycle is a closed, connected path with a zero boundary in a simplicial c…
App classification is useful in a number of applications such as adding apps to an app store or building a user model based on the installed apps. Presently there are a number of existing methods to classify apps based on a given taxonomy on the basis of their text metadata. However, text based methods for app classifi…
Meta-data from photo-sharing websites such as Flickr can be used to obtain rich bag-of-words descriptions of geographic locations, which have proven valuable, among others, for modelling and predicting ecological features. One important insight from previous work is that the descriptions obtained from Flickr tend to be…
This article introduces descriptive cellular homology on cell complexes, which is an extension of J.H.C. Whitehead's CW topology. A main result is that a descriptive cellular complex is a topology on fibres in a fibre bundle. An application of two forms of cellular homology is given in terms of the persistence of shape…
New methods evaluate data representations by complexity of low-loss predictor learning.
Anomaly detection has numerous applications and has been studied vastly. We consider a complementary problem that has a much sparser literature: anomaly description. Interpretation of anomalies is crucial for practitioners for sense-making, troubleshooting, and planning actions. To this end, we present a new approach c…
New description of L-space knots leads to non-left-orderable surgeries.
The Goresky-Hingston coproduct was first introduced by D. Sullivan and later extended by M. Goresky and N. Hingston. In this article we give a Morse theoretic description of the coproduct. Using the description we prove homotopy invariance property of the coproduct. We describe a connection between our Morse theoretic …
The study quantifies the information needed for causal queries at different levels of Pearl's hierarchy.
Using the Huynh and Le quantum determinant description of the colored Jones polynomial, we construct a new combinatorial description of the colored Jones polynomial in terms of walks along a braid. We then use this description to show that for a knot which is the closure of a positive braid, the first N coefficients of…
APD method decomposes neural network parameters into simple, faithful components.