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.
HC test measures word-frequency similarity for authorship attribution.
PCA whitening weighted by Zipfian word frequencies improves task performance.
We present algorithms for topic modeling based on the geometry of cross-document word-frequency patterns. This perspective gains significance under the so called separability condition. This is a condition on existence of novel-words that are unique to each topic. We present a suite of highly efficient algorithms based…
A method for authorship attribution based on function word adjacency networks (WANs) is introduced. Function words are parts of speech that express grammatical relationships between other words but do not carry lexical meaning on their own. In the WANs in this paper, nodes are function words and directed edges stand in…
Revisit Fenn's table theorem from a differential-topological perspective.
Study detects synthetic tabular data across different tables.
Proves a generalized table theorem for odd Euler characteristic surfaces.
CTSyn generates high-quality synthetic tabular data.
Concerns about interpretability, computational resources, and principled inductive priors have motivated efforts to engineer sparse neural models for NLP tasks. If sparsity is important for NLP, might well-trained neural models naturally become roughly sparse? Using the Taxi-Euclidean norm to measure sparsity, we find …
Upper bounds for surface-links in the Yoshikawa table are estimated.
This paper compiles and calculates triple point numbers for surface-links in Yoshikawa's table.
The paper proves geometric properties of square tables and saddle surfaces.
Machine learning speeds up search procedures for sorted tables.
Machine learning recreates the periodic table from element properties.
A new geometrically-motivated algorithm for nonnegative matrix factorization is developed and applied to the discovery of latent "topics" for text and image "document" corpora. The algorithm is based on robustly finding and clustering extreme points of empirical cross-document word-frequencies that correspond to novel …
Method finds differential equations for integrable billiard tables.
Billiard trajectories and geodesics are closely related geometrically.
This document contains tables with the classification of prehomogeneous modules for reductive algebraic groups with up to two simple factors due to Sato, Kimura and many others, as well as corresponding tables of the étale modules appearing in this list, determined by the author. It is intended as a convenient referenc…
BiN normalizes financial time-series for better forecasting.
Descriptive titles provide crucial context for interpreting tables that are extracted from web pages and are a key component of table-based web applications. Prior approaches have attempted to produce titles by selecting existing text snippets associated with the table. These approaches, however, are limited by their d…
This note corrects errors in Hatcher and Oertel's table of boundary slopes of Montesinos knots which have projections with 10 or fewer crossings.
Compactness proven for isospectral Birkhoff billiard tables.
Method combines clustering and matrix completion for missing data in I/O tables.
TableQnA answers web queries about lists and superlatives from HTML tables.
Proposes -table for statistical SHAP explanations in regression models.
An explicit solution found for maximizing/minimizing agreement in a 2x2 table.
We give a complete characterization of the relationship between the shape of a Euclidean polygon and the symbolic dynamics of its billiard flow. We prove that the only pairs of tables that can have the same bounce spectrum are right-angled tables that differ by an affine map. The main tool is a new theorem that establi…
To study embeddings of tangles in knots, we use quandle cocycle invariants. Computations are carried out for the tables of knots and tangles, to investigate which tangles may or may not embed in knots in the tables.
Robotic table tennis learns efficient policies to return balls at 100Hz.
Open problem: Establishing bounds for Cayley-table completion to discover discrete algorithmic axioms.
Improved method for encoding contingency tables reduces mutual information bias.
We present in this paper experiments on Table Recognition in hand-written registry books. We first explain how the problem of row and column detection is modeled, and then compare two Machine Learning approaches (Conditional Random Field and Graph Convolutional Network) for detecting these table elements. Evaluation wa…
We present a novel approach for estimating conditional probability tables, based on a joint, rather than independent, estimate of the conditional distributions belonging to the same table. We derive exact analytical expressions for the estimators and we analyse their properties both analytically and via simulation. We …
Enumerated all genus two handlebody-knots with seven crossings.
Paper develops a model for verifying facts in tables without pre-retrieved evidence.
Taxicab correspondence analysis visualizes sparse text data sets.
E. Gutkin found a remarkable class of convex billiard tables in the plane which have a constant angle invariant curve. In this paper we prove that in dimension 3 only round sphere has such a property. For dimension greater than 3 it must be either a sphere or to have a very special geometric properties. In 2-dimensiona…
The paper studies billiards in symmetric tables and finds a measure bound for maximizing orbits.
Minimum braids are a complete invariant of knots and links. This paper defines minimum braids, describes how they can be generated, presents tables for knots up to ten crossings and oriented links up to nine crossings, and uses minimum braids to study graph trees, amphicheirality, unknotting numbers, and periodic table…
We consider a natural model of random knotting- choose a knot diagram at random from the finite set of diagrams with n crossings. We tabulate diagrams with 10 and fewer crossings and classify the diagrams by knot type, allowing us to compute exact probabilities for knots in this model. As expected, most diagrams with 1…
A new method reduces embedding size for efficient recommendation systems.
We introduce a notion of natural orderings of elements of finite connected quandles of order . When the elements of such a quandle are already ordered naturally, any automophism on is a natural ordering. Although there are many natural orderings, the operation tables for such orderings coincide when the perm…
Table of symmetric diagrams for knots up to 10 crossings.
This paper, to be regularly updated, lists those prime knots with the fewest possible number of crossings for which values of basic knot invariants, such as the unknotting number or the smooth 4-genus, are unknown. This list is being developed in conjunction with "KnotInfo" (www.indiana.edu/~knotinfo), a web-based tabl…
SAVeD detects dataset versions without metadata, improving accuracy and separation.
In this work, we propose to quantize all parts of standard classification networks and replace the activation-weight--multiply step with a simple table-based lookup. This approach results in networks that are free of floating-point operations and free of multiplications, suitable for direct FPGA and ASIC implementation…
Bounds derived for contract values in life insurance with financial market interaction.
This is a facsimile of the circa 1990 unpublished manuscript with the same title. All the original text, figures and tables are included; although text has been reset in \TeX, the original hand-drawn figures have been redrawn digitally, and the parameter in the original table of lens spaces has been replaced with t…