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.
Framework analyzes RL agents' behavior to explain their strengths and weaknesses.
Interestingness measures provide information that can be used to prune or select association rules. A given value of an interestingness measure is often interpreted relative to the overall range of the values that the interestingness measure can take. However, properties of individual association rules restrict the val…
This paper presents a framework for exact discovery of the top-k sequential patterns under Leverage. It combines (1) a novel definition of the expected support for a sequential pattern - a concept on which most interestingness measures directly rely - with (2) SkOPUS: a new branch-and-bound algorithm for the exact disc…
EUREKA builds classifiers that use surprising features.
Mining itemsets that are the most interesting under a statistical model of the underlying data is a commonly used and well-studied technique for exploratory data analysis, with the most recent interestingness models exhibiting state of the art performance. Continuing this highly promising line of work, we propose the f…
In this paper, we propose a new algorithm for exploratory projection pursuit. The basis of the algorithm is the insight that previous approaches used fairly narrow definitions of interestingness / non interestingness. We argue that allowing these definitions to depend on the problem / data at hand is a more natural app…
Method finds interestingly dense subgroup connections in graphs.
Mining discriminative features for graph data has attracted much attention in recent years due to its important role in constructing graph classifiers, generating graph indices, etc. Most measurement of interestingness of discriminative subgraph features are defined on certain graphs, where the structure of graph objec…
The autoencoder is an artificial neural network model that learns hidden representations of unlabeled data. With a linear transfer function it is similar to the principal component analysis (PCA). While both methods use weight vectors for linear transformations, the autoencoder does not come with any indication similar…
Despite their increasing popularity and success in a variety of supervised learning problems, deep neural networks are extremely hard to interpret and debug: Given and already trained Deep Neural Net, and a set of test inputs, how can we gain insight into how those inputs interact with different layers of the neural ne…
Mining association rules is an important technique for discovering meaningful patterns in transaction databases. Many different measures of interestingness have been proposed for association rules. However, these measures fail to take the probabilistic properties of the mined data into account. In this paper, we start …
Recent sequential pattern mining methods have used the minimum description length (MDL) principle to define an encoding scheme which describes an algorithm for mining the most compressing patterns in a database. We present a novel subsequence interleaving model based on a probabilistic model of the sequence database, w…
Deriving insights from high-dimensional data is one of the core problems in data mining. The difficulty mainly stems from the fact that there are exponentially many variable combinations to potentially consider, and there are infinitely many if we consider weighted combinations, even for linear combinations. Hence, an …
One of the most important challenges in the analysis of high-throughput genetic data is the development of efficient computational methods to identify statistically significant Single Nucleotide Polymorphisms (SNPs). Genome-wide association studies (GWAS) use single-locus analysis where each SNP is independently tested…
The paper classifies reversible elements in Seifert-fibered spaces and braid groups.
Most signal processing problems involve the challenging task of multidimensional probability density function (PDF) estimation. In this work, we propose a solution to this problem by using a family of Rotation-based Iterative Gaussianization (RBIG) transforms. The general framework consists of the sequential applicatio…
Classifies reciprocal elements in Hecke groups, generalizing Sarnak's work.
We know that any element A of the group SO(3) can be represented as A = A1 A2 A1', where A1, A1' are elements of SO1(2)={A is an element of SO(3) | Ae1=e1}, and SO2(2)={A is an element of SO(3) | Ae2=e2} . This fact is known as Euler's angle. When this situation, a matrix A is called the generator. In the present paper…
We define a new notion of contracting element of a group and we show that contracting elements coincide with hyperbolic elements in relatively hyperbolic groups, pseudo-Anosovs in mapping class groups, rank one isometries in groups acting properly on proper CAT(0) spaces, elements acting hyperbolically on the Bass-Serr…
In this paper, we establish that, for statistically convex-cocompact actions, contracting elements are exponentially generic in counting measure. Among others, the following exponential genericity results are obtained as corollaries for the set of hyperbolic elements in relatively hyperbolic groups, the set of rank-1 e…
The paper classifies reversible and strongly reversible elements in Hermitian isometry groups.
Characterizes periodic elements in Artin-Tits groups via stability conditions.
A nontrivial element in a group is a generalized torsion element if some nonempty finite product of its conjugates is the identity. We prove that any generalized torsion element in a free product of torsion-free groups is conjugate to a generalized torsion element in some factor group. This implies that the fundamental…
New findings on generating mapping class groups using pseudo-Anosov elements.
This note shows that if two elements of equal trace (e.g., conjugate elements) generate an arithmetic two-bridge knot or link group, then the elements are parabolic. This includes the figure-eight knot and Whitehead link groups. Similarly, if two conjugate elements generate the trefoil knot group, then the elements are…
Classifies reversible and strongly reversible elements in quaternionic groups.
Persistent elements are ubiquitous in knot groups, especially for hyperbolic knots.
New finite element method for complex forms in any dimension.
The paper improves convergence rates of curvature approximations using Regge elements.
New group with non-loxodromic Morse element found.
The paper solves a complex option pricing model using finite elements.
Paper introduces Deep Sets for Symmetric Elements (DSS) layers for learning sets of symmetric elements.
The study calculates the growth rate of reciprocal hyperbolic elements in Hecke groups.
The paper classifies 3-manifold groups with specific torsion elements.
New examples of hyperbolic links with generalized torsion elements found.
Proves mapping class group generated by two torsion elements for certain surfaces.
Study shows Morse elements are common in acylindrically hyperbolic groups.
Paper solves convertible bond valuation using finite elements with penalty method.
Constructs Poisson structures on gauge orbits of Maurer-Cartan elements.
The paper approximates Levi-Civita connection and curvature on 2D manifolds using finite elements.
Loxodromic elements are pseudo-Anosov on specific graphs.
We show that the mapping class group of a closed oriented surface of genus at least three is generated by 3 elements of order 3 and by 4 elements of order 4. Note that the mapping class group cannot be generated by finitely many torsion elements of same order if genus is equal to one or two.
An algorithm is proposed that solves two decision problems for pseudo-Anosov elements in the mapping class group of a surface with at least one marked fixed point. The first problem is the root problem: decide if the element is a power and in this case compute the roots. The second problem is the symmetry problem: deci…
Characterizes stably elliptic elements in Lie groups and their properties.
The paper classifies and decomposes quaternionic projective transformations.
Positive Thompson links are proven for oriented subgroup elements.
Let be the closed oriented surface of genus g and let be the mapping class group. When the genus is at least 3, can be generated by torsion elements. We prove the follow results. For , can be generated by 4 torsion elements. Three generators are invo…
New loxodromic elements found in infinite-type surfaces.