Research
On-device research index

arXiv research

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.

168,742 papers · 148 categories

Trend · papers per month

15.0%30.0%45.0%60.0% · Aug 199419922001200920172026
48 results for copy complexity

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.

2019-03-04abs ↗pdf ↗

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…

2001-12-21abs ↗pdf ↗

Study shows a copy of 7D real projective space in the space of almost complex structures on 6-sphere.

problem Understanding the topology of almost complex structures on the 6-sphere.
method Analyzes the fundamental and rational homotopy groups, computes homotopy fiber and groups, and generalizes to 6-manifolds.
result Induces isomorphism on fundamental and rational homotopy groups of the 6-sphere.

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…

2019-03-05abs ↗pdf ↗

We study the set of all closed oriented smooth 4-manifolds experimentally, according to a suitable complexity defined using Turaev's shadows. This complexity roughly measures how complicated the 2-skeleton of the 4-manifold is. We characterise here all the closed oriented 4-manifolds that have complexity at most one. T…

2018-03-18abs ↗pdf ↗

A fibration of Rn{\mathbb R}^n by oriented copies of Rp{\mathbb R}^p is called skew if no two fibers intersect nor contain parallel directions. Conditions on pp and nn for the existence of such a fibration were given by Ovsienko and Tabachnikov. A classification of smooth fibrations of R3{\mathbb R}^3 by skew oriente…

2014-12-29abs ↗pdf ↗

We prove that a closed 4-manifold has shadow-complexity zero if and only if it is a kind of 4-dimensional graph manifold, which decomposes into some particular blocks along embedded copies of S^2 x S^1, plus some complex projective spaces. We deduce a classification of all 4-manifolds with finite fundamental group and …

2009-09-01abs ↗pdf ↗

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

problem Measuring privacy risk of data-copying in tabular generative models.
method Proposes Data Plagiarism Index (DPI) for evaluating data-copying risk.
result DPI identifies data-copying threats to tabular data models, highlighting privacy and fairness issues.

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

problem Editing documents or source code using seq2seq models with explicit token copying.
method Extended seq2seq model capable of copying entire input spans to output in one step, new training and inference methods.
result New model consistently outperforms simpler baselines in editing tasks of natural language and source code.

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

problem Improving generalization in machine learning through data augmentation with noise.
method Gradient descent with on-line noisy copies for linear regression analysis.
result Training with on-line noisy copies is equivalent to ridge regularization with a specific regularization parameter.

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…

2019-03-21abs ↗pdf ↗

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

problem Realizing any finitely presented group as the fundamental group of a non-orientable 4-manifold with exotic structure.
method Performing a Gluck twist to obtain an exotic smooth structure, and using 2-covers to stabilize the structure.
result Any finitely presented group can be realized as the fundamental group of a non-orientable 4-manifold with exotic structure.

Study on estimating signals from shifted and noisy copies in high dimensions, revealing a phase transition.

problem Estimating a signal in high-dimensional space from its circularly-shifted and noisy copies.
method Analysis of sample complexity in the high-dimensional regime, focusing on the parameter α.
result A phase transition phenomenon governed by α, with different sample complexities based on α values.

Shapes can roll downhill following any curve, but often return to initial orientation after crossing multiple copies.

problem How to design shapes that roll downhill along a given curve and its translations.
method Analyzing the geometric properties and motion of shapes on inclined planes.
result Most curves allow shapes to roll downhill following them and their translations, but some require crossing multiple copies.

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

problem Understanding how Transformers develop match-and-copy behavior on natural data.
method Introducing Gaussian Match-and-Copy (GMC) as a minimalist benchmark.
result Gradient descent drives parameters to diverge while aligning with max-margin separator.

We show that closed, connected 4-manifolds up to connected sum with copies of the complex projective plane are classified in terms of the fundamental group, the orientation character and an extension class involving the second homotopy group. For fundamental groups that are torsion free or have one end, we reduce this …

2018-02-27abs ↗pdf ↗

Bayesian theory explains abrupt emergence of copy subcircuit in attention.

problem Understanding the abrupt emergence of the copy subcircuit in attention during training.
method Deriving a closed-form posterior over the attention matrix and reducing it to a low-dimensional order parameter space.
result Derive a phase transition in the amount of training data.

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

problem Approximating a teacher network with an under-parameterized student network.
method Analyzing shallow neural networks with erf activation function and unitary teacher weights, proving copy-average configurations are critical points and finding the optimal solution.
result The optimal solution for under-parameterized networks has a universal structure, whether copying or averaging teacher neurons.

We study manifolds arising as spaces of sections of complex manifolds fibering over the projective line with normal bundle of each section isomorphic to several copies of O(k). Such manifolds provide a natural setting for certain integrable systems, "monopoles", which comprise the Bogomolny hierarchy and the self-dual …

2003-09-18abs ↗pdf ↗

We construct balanced metrics on the family of non-Kähler Calabi-Yau threefolds that are obtained by smoothing after contracting (1,1)(-1,-1)-rational curves on Kähler Calabi-Yau threefold. As an application, we construct balanced metrics on complex manifolds diffeomorphic to connected sum of k2k\geq 2 copies of $S^3\time…

2008-09-27abs ↗pdf ↗

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…

2019-09-17abs ↗pdf ↗

4-manifolds can be broken down into pairs-of-pants and K3 surfaces.

problem Decomposing 4-manifolds diffeomorphic to complex hypersurfaces.
method Pair-of-pants and K3 surfaces decomposition.
result 4-manifolds diffeomorphic to complex hypersurfaces can be decomposed into a specific number of pair-of-pants and K3 surfaces.

For n >2, we shall show that the group Aut(NS(M)) of simplicial automorphisms of the complex NS(M) of non-separating embedded spheres in the manifold M,connected sum of n copies of S^2 X S^1, isomorphic to the group Out(F_n) of outer automorphisms of the free group F_n, where FnF_n is identified with the fundamental gr…

2012-04-02abs ↗pdf ↗

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

problem Improving model generalization in machine learning.
method The method replicates a model \(M\) times and rewire the contexts in which local learning messages are computed using permutations.
result The method improves generalization by structured message sharing rather than coupling parameters.

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…

2019-10-01abs ↗pdf ↗

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

2019-04-29abs ↗pdf ↗

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 …

2017-07-24abs ↗pdf ↗

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.

1998-06-06abs ↗pdf ↗

A family of interpolating graphs $\calC (S, ξ)$ of complexity ξξ is constructed for a surface SS and 2ξξ(S)-2 \leq ξ\leq ξ(S). For ξ=2,1,ξ(S)1ξ= -2, -1, ξ(S) -1 these specialise to graphs quasi-isometric to the marking graph, the pants graph and the curve graph respectively. We generalise Theorems of Brock-Farb and Behrstock-Mins…

2007-06-19abs ↗pdf ↗

We study the structure of Lie groups admitting left invariant abelian complex structures in terms of commutative associative algebras. If, in addition, the Lie group is equipped with a left invariant Hermitian structure, it turns out that such a Hermitian structure is Kähler if and only if the Lie group is the direct p…

2011-06-30abs ↗pdf ↗

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…

2012-10-04abs ↗pdf ↗

We prove that for every natural number k there are simply connected topological four-manifolds which have at leat k distinct smooth structures supporting Einstein metrics, and also have infinitely many distinct smooth structures not supporting Einstein metrics. Moreover, all these smooth structures become diffeomorphic…

2003-06-01abs ↗pdf ↗

In this article, we demonstrate methods for the local removal and modification of complex tangents to embeddings of S3S^3 into C3\mathbb{C}^3. In particular, given any embedding of S3S^3 and a neighborhood of the complex tangents of the embedding, we show that there exists a (C0C^0-close) totally real embedding which a…

2015-06-25abs ↗pdf ↗