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,695 papers · 148 categories

Trend · papers per month

15304459 · Jun 202619922001200920172026
48 results for geodesic copies

For positive integers pp and qq let G:=PSO(p,q)G:=\textrm{PSO}(p,q) be the projective indefinite special-orthogonal group of signature (p,q)(p,q). We study counting problems in the Riemannian symmetric space XGX_G of GG and in the pseudo-Riemannian hyperbolic space Hp,q1\mathbb{H}^{p,q-1}. Let SXGS\subset X_G be a totally geodesic …

2018-12-03abs ↗pdf ↗

The study examines growth of quadratic forms under Anosov subgroups.

problem Growth of quadratic forms under Anosov subgroups.
method Analyzes exponential bounds and asymptotic counting functions for distances between geodesic copies of symmetric spaces.
result Shows asymptotic behavior of counting functions for certain choices of quadratic forms.

We show that some hyperbolic 3-manifolds which are tessellated by copies of the regular ideal hyperbolic tetrahedron embed geodesically in a complete, finite volume, hyperbolic 4-manifold. This allows us to prove that the complement of the figure-eight knot geometrically bounds a complete, finite volume hyperbolic 4-ma…

2015-11-27abs ↗pdf ↗

A smooth curve γ:[0,1]S2γ: [0,1] \to S^2 is locally convex if its geodesic curvature is positive at every point. J. A. Little showed that the space of all locally positive curves γγ with γ(0)=γ(1)=e1γ(0) = γ(1) = e_1 and γ(0)=γ(1)=e2γ'(0) = γ'(1) = e_2 has three connected components L1,cL_{-1,c}, L+1L_{+1}, L1,nL_{-1,n}. The space L1,cL_{-1,c} is know…

2009-05-13abs ↗pdf ↗

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 ↗

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 ↗

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.

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 ↗

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.

The paper adapts metrics to anti-de Sitter structures, characterizing their degeneracies.

problem Characterizing degeneracies of metrics on anti-de Sitter structures.
method Adapting Hitchin component metrics to anti-de Sitter structures.
result Characterized degeneracies of the pressure metric and showed the Loftin metric is nowhere degenerate.

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.

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 ↗

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 ↗

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 ↗

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 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 ↗

Anosov representations are linked to specific spacetimes.

problem Understanding representations of groups into Lie groups.
method Holonomy of Anosov representations into O0(2, n) and spatial compactness of spacetimes.
result Anosov representations are the holonomy of CGHM conformally flat spacetimes.

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…

2002-05-28abs ↗pdf ↗

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

problem Understanding specific types of Courant algebroids with Calabi-Yau structures.
method Explains how a homotopy BV algebra with certain properties characterizes these algebroids.
result A Courant algebroid with a Calabi-Yau structure is a homotopy BV algebra with specific properties.

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…

2018-07-19abs ↗pdf ↗

Study shows kk-NN classifier is not universally consistent on (0,1)(0,1) but consistent on discrete and specific measure spaces.

problem Consistency of kk-NN classifier under Wasserstein distance on measure spaces.
method Analysis of kk-NN classifier properties under Wasserstein distance, use of σσ-finite metric dimension, geodesic structures of Wasserstein spaces.
result Consistency of kk-NN classifier on specific measure spaces (discrete, Gaussian, wavelet series) but not on (0,1)(0,1).

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

problem Graphs are often not fully representative of true relationships, leading to biased machine learning models.
method Node copying model: randomly replaces each node's neighbors with those of a randomly sampled similar node.
result The model achieves higher accuracy in node classification and mitigates adversarial attacks.