arXiv research

New system resists meme coin copy trading bots.

We analyze a proprietary dataset of trades by a single asset manager, comparing their price impact with that of the trades of the rest of the market. In the context of a linear propagator model we find no significant difference between the two, suggesting that both the magnitude and time dependence of impact are univer…

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…

This paper introduces DPI, a new metric to assess data-copying risk in tabular data.

Several models of stock trading [P. Bak et al, Physica A {\bf 246}, 430 (1997)] are analyzed in analogy with one-dimensional, two-species reaction-diffusion-branching processes. Using heuristic and scaling arguments, we show that the short-time market price variation is subdiffusive with a Hurst exponent $H=1/4$. Biase…

New seq2seq model can copy entire spans, outperforming simpler models in editing tasks.

Paper analyzes gradient descent with noisy data copies for linear regression, showing regularization and acceleration effects.

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…

New test detects when generative models memorize training data.

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.

GMC benchmark isolates retrieval in Transformers, revealing max-margin alignment.

Bayesian theory explains abrupt emergence of copy subcircuit in attention.

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.

NFTs revolutionize art sales by providing proof of ownership.

Under-parameterized networks can either copy or average teacher weights, leading to universal optimal solutions.

Automatic question generation is an important problem in natural language processing. In this paper we propose a novel adaptive copying recurrent neural network model to tackle the problem of question generation from sentences and paragraphs. The proposed model adds a copying mechanism component onto a bidirectional LS…

The paper introduces a new method to improve model generalization by routing model copies through permutations.

Copies have been proposed as a viable alternative to endow machine learning models with properties and features that adapt them to changing needs. A fundamental step of the copying process is generating an unlabelled set of points to explore the decision behavior of the targeted classifier throughout the input space. I…

We consider a setup in which confidential i.i.d. samples $X_1,\dotsc,X_n$ from an unknown finite-support distribution $\boldsymbol{p}$ are passed through $n$ copies of a discrete privatization channel (a.k.a. mechanism) producing outputs $Y_1,\dotsc,Y_n$. The channel law guarantees a local differential privacy of $ε$. …

We prove that an odd pretzel knot is doubly slice if it has $2n+1$ twist parameters consisting of $n+1$ copies of $a$ and $n$ copies of $-a$ for some odd integer $a$. Combined with the work of Issa and McCoy, it follows that these are the only doubly slice odd pretzel knots.

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.

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 ${\mathbb R}^n$ by oriented copies of ${\mathbb R}^p$ is called skew if no two fibers intersect nor contain parallel directions. Conditions on $p$ and $n$ for the existence of such a fibration were given by Ovsienko and Tabachnikov. A classification of smooth fibrations of ${\mathbb R}^3$ 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.

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…

Characterizes a specific type of Courant algebroid with a Calabi-Yau structure.

DeepTrader learns to mimic a successful trader from market data.

Special shadow-complexity equals k+1 for k copies of S1×S3.

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…

A new model for graph sampling that preserves structure without explicit targeting.

We report successful results from using deep learning neural networks (DLNNs) to learn, purely by observation, the behavior of profitable traders in an electronic market closely modelled on the limit-order-book (LOB) market mechanisms that are commonly found in the real-world global financial markets for equities (stoc…

In the past few years, Convolutional Neural Networks (CNNs) have been achieving state-of-the-art performance on a variety of problems. Many companies employ resources and money to generate these models and provide them as an API, therefore it is in their best interest to protect them, i.e., to avoid that someone else c…

CACTI improves tabular data imputation by leveraging missingness patterns and contextual information.

We show that the smooth $4$-manifold $M$ obtained by attaching a $2$-handle to $B^4$ along a certain knot $K\subset \partial B^4$ admits infinitely many absolutely exotic copies $M_n$, $n=0,1,2..$, such that each copy $M_n$ is obtained by attaching $2$-handle to a fixed compact smooth contractible manifold $W$ along th…

Zero-Copy Architecture Detects Cross-Company Financial Signals Instantly.

In the last few years, many different methods have been focusing on using deep recurrent neural networks for natural language generation. The most widely used sequence-to-sequence neural methods are word-based: as such, they need a pre-processing step called delexicalization (conversely, relexicalization) to deal with …

We consider canonical symplectic structure on the moduli space of flat ${\g}$-connections on a Riemann surface of genus $g$ with $n$ marked points. For ${\g}$ being a semisimple Lie algebra we obtain an explicit efficient formula for this symplectic form and prove that it may be represented as a sum of $n$ copies of Ki…

SmoothLLM defends LLMs from jailbreaking attacks by randomly perturbing inputs.

This is a PhD thesis about low dimensional topology, in particular knot thory in 3-manifolds also different from the 3-sphere, topological applications of quantum invariants, and Turaev's shadows. There is an introduction and a survey for these topics. The thesis uses skein theory and focues on the connected sum of cop…

Molecule optimization is about generating molecule $Y$ with more desirable properties based on an input molecule $X$. The state-of-the-art approaches partition the molecules into a large set of substructures $S$ and grow the new molecule structure by iteratively predicting which substructure from $S$ to add. However, s…

We classify, up to homeomorphism, all closed manifolds having the homotopy type of a connected sum of two copies of real projective n-space.

Study shows how any group can be fundamental of a non-orientable 4-manifold with exotic structure.