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.
End-to-end character-level model for text generation without delexicalization.
Generating logical form equivalents of human language is a fresh way to employ neural architectures where long short-term memory effectively captures dependencies in both encoder and decoder units. The logical form of the sequence usually preserves information from the natural language side in the form of similar token…
Paper proposes a neural network for generating better questions from text.
Paper defines and evaluates attention mechanisms for sequence to sequence tasks.
In many real-world systems, information can be transmitted in two qualitatively different ways: by copying or by transformation. Copying occurs when messages are transmitted without modification, e.g., when an offspring receives an unaltered copy of a gene from its parent. Transformation occurs when messages are modifi…
Bayesian theory explains abrupt emergence of copy subcircuit in attention.
The paper introduces a new method to improve model generalization by routing model copies through permutations.
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…
RBMs learn archetypes when trained on blurred copies of them, revealing a critical sample size.
A mechanical linkage is a mechanism made of rigid rods linked together by flexible joints, in which some vertices are fixed and others may move. The partial configuration space of a linkage is the set of all the possible positions of a subset of the vertices. We characterize the possible partial configuration spaces of…
We study model-agnostic copies of machine learning classifiers. We develop the theory behind the problem of copying, highlighting its differences with that of learning, and propose a framework to copy the functionality of any classifier using no prior knowledge of its parameters or training data distribution. We identi…
Quantum learning complexity reviewed using information theory.
This paper introduces DPI, a new metric to assess data-copying risk in tabular data.
New seq2seq model can copy entire spans, outperforming simpler models in editing tasks.
A mechanical linkage is a mechanism made of rigid rods linked together by flexible joints, in which some vertices are fixed and others may move. The partial configuration space of a linkage is the set of all the possible positions of a subset of the vertices. We characterize the possible partial configuration spaces of…
The paper proposes sampling strategies for classifier copies.
Paper analyzes gradient descent with noisy data copies for linear regression, showing regularization and acceleration effects.
New test detects when generative models memorize training data.
A linkage mechanism consists of rigid bodies assembled by joints which can be used to translate and transfer motion from one form in one place to another. In this paper, we are particularly interested in a family of spacial linkage mechanisms which consist of -copies of a rigid body joined together by hinges to form…
Shapes can roll downhill following any curve, but often return to initial orientation after crossing multiple copies.
Every lens space has a locally flat embedding in a connected sum of 8 copies of the complex projective plane and a smooth embedding in n copies of the complex projective plane for some positive integer n. We show that there is no n such that every lens space smoothly embeds in n copies of the complex projective plane.
New system resists meme coin copy trading bots.
GMC benchmark isolates retrieval in Transformers, revealing max-margin alignment.
A condition for the existence of false gauge field copies in terms of the Lefschetz number of a certain differential operator is presented.
CN-SBM clusters cancer samples and regions based on copy number variants.
Under-parameterized networks can either copy or average teacher weights, leading to universal optimal solutions.
The paper finds small exotic 4-manifolds with free abelian groups.
Recurrent neural networks are a widely used class of neural architectures. They have, however, two shortcomings. First, it is difficult to understand what exactly they learn. Second, they tend to work poorly on sequences requiring long-term memorization, despite having this capacity in principle. We aim to address both…
Bayesian GCNN uses node copying for graph inference.
A simple patch copying method reduces black-box adversarial attack queries by 81%.
A knot K in the 3-sphere is said to have Property nR if, whenever K is a component of an n-component link L and some integral surgery on L produces the connected sum of n copies of S^1 x S^2, there is a sequence of handle slides on L that converts L into a 0-framed unlink. The Generalized Property R Conjecture is that …
Is it possible to generally construct a dynamical system to simulate a black system without recovering the equations of motion of the latter? Here we show that this goal can be approached by a learning machine. Trained by a set of input-output responses or a segment of time series of a black system, a learning machine …
We show that the maximal orbit dimension of a simultaneous Lie group action on n copies of a manifold does not pseudo-stabilize when n increases. We also show that if a Lie group action is (locally) effective on subsets of a manifold, then the induced Cartesian action is locally free on an open subset of a sufficiently…
A free action of the direct product of two copies of the symmetric group on 3 elements on the cartesian product of two copies of the 3-sphere is constructed. This nonlinear action is constructed using surgery. The action provides a counterexample to a conjecture of Lewis made in 1968.
Optimal securities lending mechanism incentivizes truthfulness and privacy.
For a closed 4-manifold X and closed 3-manifold M we investigate the smallest integer n (perhaps infinity) such that M embeds in the connected sum of n copies of X. It is proven that any lens space (or homology lens space) embeds topologically locally flatly in a connected sum of 8 copies of the complex projective plan…
A fibration of by oriented copies of is called skew if no two fibers intersect nor contain parallel directions. Conditions on and for the existence of such a fibration were given by Ovsienko and Tabachnikov. A classification of smooth fibrations of by skew oriente…
We construct branched double coverings by certain direct products of manifolds for connected sums of copies of sphere bundles over the 2-sphere. As an application we answer a question of Kotschick and Loeh up to dimension five. More precisely, we show that: (1) every simply connected, closed four-manifold admits a bran…
New algorithms for fair item allocation with limited copies.
This paper presents a novel end-to-end approach to program repair based on sequence-to-sequence learning. We devise, implement, and evaluate a system, called SequenceR, for fixing bugs based on sequence-to-sequence learning on source code. This approach uses the copy mechanism to overcome the unlimited vocabulary probl…
Proves stability of cone-volume measure with nearly constant density.
We discuss the relationship between the m-th homotopy group of the one-point union of r copies of the two-dimensional sphere and the m-th homotopy group of the one-point union of r+1 copies of the Thom space of the oriented two-dimensional universal vector bundle. Using a suitably choosen isomorphism between them a for…
Proves conditions for odd pretzel knots to be doubly slice.
Characterizes a specific type of Courant algebroid with a Calabi-Yau structure.
We present a novel recurrent neural network (RNN) based model that combines the remembering ability of unitary RNNs with the ability of gated RNNs to effectively forget redundant/irrelevant information in its memory. We achieve this by extending unitary RNNs with a gating mechanism. Our model is able to outperform LSTM…
Special shadow-complexity equals k+1 for k copies of S1×S3.
CORE optimizes molecules by copying or generating substructures, improving accuracy.
A new model for graph sampling that preserves structure without explicit targeting.