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.
BiN normalizes financial time-series for better forecasting.
CTSyn generates high-quality synthetic tabular data.
A method for reducing neural network size using look-up tables.
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 …
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…
One approach to designing decision making logic for an aircraft collision avoidance system frames the problem as a Markov decision process and optimizes the system using dynamic programming. The resulting collision avoidance strategy can be represented as a numeric table. This methodology has been used in the developme…
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…
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…
Revisit Fenn's table theorem from a differential-topological perspective.
Method combines clustering and matrix completion for missing data in I/O tables.
Modern information technology services largely depend on cloud infrastructures to provide their services. These cloud infrastructures are built on top of datacenter networks (DCNs) constructed with high-speed links, fast switching gear, and redundancy to offer better flexibility and resiliency. In this environment, net…
A major problem for the learning of Bayesian networks (BNs) is the exponential number of parameters needed for conditional probability tables. Recent research reduces this complexity by modeling local structure in the probability tables. We examine the use of log-linear local models. While log-linear models in this con…
TableQnA answers web queries about lists and superlatives from HTML tables.
Study detects synthetic tabular data across different tables.
NeuraLUT maps neural networks to lookup tables, reducing latency and improving expressivity.
Proves a generalized table theorem for odd Euler characteristic surfaces.
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.
In this paper, we provide a method to learn the directed structure of a Bayesian network using data. The data is accessed by making conditional probability queries to a black-box model. We introduce a notion of simplicity of representation of conditional probability tables for the nodes in the Bayesian network, that we…
Machine learning speeds up search procedures for sorted tables.
Operating deep neural networks on devices with limited resources requires the reduction of their memory footprints and computational requirements. In this paper we introduce a training method, called look-up table quantization, LUT-Q, which learns a dictionary and assigns each weight to one of the dictionary's values. …
Machine learning recreates the periodic table from element properties.
Method finds differential equations for integrable billiard tables.
Constrained sequence codes have been widely used in modern communication and data storage systems. Sequences encoded with constrained sequence codes satisfy constraints imposed by the physical channel, hence enabling efficient and reliable transmission of coded symbols. Traditional encoding and decoding of constrained …
Billiard trajectories and geodesics are closely related geometrically.
We present a novel framework for augmenting data sets for machine learning based on counterexamples. Counterexamples are misclassified examples that have important properties for retraining and improving the model. Key components of our framework include a counterexample generator, which produces data items that are mi…
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…
New method ranks sectors and countries using local and aggregate I-O data.
BiQGEMM efficiently multiplies quantized DNN weights using lookup tables.
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.
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.
Enumerated all genus two handlebody-knots with seven crossings.
Improved neural network model for predicting latent budgets in compositional data.
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…
Generative adversarial networks (GANs) implicitly learn the probability distribution of a dataset and can draw samples from the distribution. This paper presents, Tabular GAN (TGAN), a generative adversarial network which can generate tabular data like medical or educational records. Using the power of deep neural netw…
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 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…