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

4590135180 · Jun 202019922001200920172026
48 results for Cremona transformations

Study Cremona transformations in weighted projective planes to find rational cuspidal curves and Zariski pairs.

problem Finding rational cuspidal curves and Zariski pairs in weighted projective planes.
method Construct families of curves using Cremona transformations, compute fundamental groups, and use blow-up-down decompositions.
result Discover new examples of rational cuspidal curves and Zariski pairs in weighted projective planes.

We show that the action of Cremona transformations on the real points of quadrics exhibits the full complexity of the diffeomorphisms of the sphere, the torus, and of all non-orientable surfaces. The main result says that if X is rational, then Aut(X), the group of algebraic automorphisms, is dense in Diff(X), the grou…

2008-09-22abs ↗pdf ↗

A new method studies symplectic configurations in rational 4-manifolds using computer-aided techniques.

problem Understanding symplectic configurations in rational 4-manifolds.
method Computer-aided approach combining Cremona transformations and pseudoholomorphic curves.
result Nonexistence of Fano planes in the symplectic category.

We study random walks on groups of isometries of non-proper delta-hyperbolic spaces under the assumption that at least one element in the group satisfies Bestvina-Fujiwara's WPD condition. We show that in this case typical elements are WPD, and the Poisson boundary coincides with the Gromov boundary. Moreover, we show …

2018-07-26abs ↗pdf ↗

Generalizing a classical theorem of Carlson and Toledo, we prove that any Zariski dense isometric action of a Kähler group on the real hyperbolic space of dimension at least 3 factors through a homomorphism onto a cocompact discrete subgroup of PSL(2,R). We also study actions of Kähler groups on infinite dimensional re…

2010-12-07abs ↗pdf ↗

I show that every rectifiable simple closed curve in the plane can be continuously deformed into a convex curve in a motion which preserves arc length and does not decrease the Euclidean distance between any pair of points on the curve. This result is obtained by approximating the curve with polygons and invoking the r…

2008-09-08abs ↗pdf ↗

Study extends geodesic ray transform results to orientable surfaces.

problem Characterize and stabilize mixed and transverse ray transforms on surfaces.
method Algebraic arguments applied to various geometries and ray transforms.
result Characterization of kernel and stability for mixed and transverse ray transforms on orientable surfaces.

This paper investigates efficient Transformers and finds they scale with problem size.

problem Finding suitable replacements for standard Transformers in large-scale tasks.
method Modeling efficient Transformers (Sparse and Linear) as Dynamic Programming problems and analyzing their reasoning capabilities.
result Efficient Transformers scale with problem size, but can be more efficient for certain DP problems.

Data is said to follow the transform (or analysis) sparsity model if it becomes sparse when acted on by a linear operator called a sparsifying transform. Several algorithms have been designed to learn such a transform directly from data, and data-adaptive sparsifying transforms have demonstrated excellent performance i…

2018-03-06abs ↗pdf ↗

Study normal operators of double fibration transforms with conjugate points.

problem Normal operators of double fibration transforms with conjugate points.
method Stable conditions on the distribution of conjugate points, splitting into elliptic and Fourier integral operators.
result Normal operator splits into an elliptic pseudodifferential operator and Fourier integral operators.

Transformer-MGK replaces redundant heads with Gaussian key mixtures, improving efficiency and performance.

problem Redundant attention heads in transformers degrade performance and efficiency.
method Transformer-MGK replaces redundant heads with a mixture of Gaussian keys.
result Transformer-MGK accelerates training and inference, reduces parameters and FLOPs, and achieves comparable or better accuracy.

We study the dynamics of the discrete bicycle (Darboux, Backlund) transformation of polygons in n-dimensional Euclidean space. This transformation is a discretization of the continuous bicycle transformation, recently studied by Foote, Levi, and Tabachnikov. We prove that the respective monodromy is a Moebius transform…

2012-11-10abs ↗pdf ↗

Data augmentation (DA) is fundamental against overfitting in large convolutional neural networks, especially with a limited training dataset. In images, DA is usually based on heuristic transformations, like geometric or color transformations. Instead of using predefined transformations, our work learns data augmentati…

2019-09-21abs ↗pdf ↗

We propose a new class of transforms that we call {\it Lehmer Transform} which is motivated by the {\it Lehmer mean function}. The proposed {\it Lehmer transform} decomposes a function of a sample into their constituting statistical moments. Theoretical properties of the proposed transform are presented. This transform…

2018-05-13abs ↗pdf ↗

Transformers struggle to approximate smooth functions, relying on piecewise constant approximations.

problem Understanding the expressivity of Transformers for function approximation.
method Theoretical analysis and experimental validation of Transformer's ability to approximate smooth functions.
result Transformers cannot reliably approximate smooth functions, relying on piecewise constant approximations.

The Weyl transform is introduced as a rich framework for data representation. Transform coefficients are connected to the Walsh-Hadamard transform of multiscale autocorrelations, and different forms of dyadic periodicity in a signal are shown to appear as different features in its Weyl coefficients. The Weyl transform …

2014-12-18abs ↗pdf ↗

In this paper, we study robust tensor completion by using transformed tensor singular value decomposition (SVD), which employs unitary transform matrices instead of discrete Fourier transform matrix that is used in the traditional tensor SVD. The main motivation is that a lower tubal rank tensor can be obtained by usin…

2019-07-02abs ↗pdf ↗

One of the most challenging problems in the domain of 2-D image or 3-D shape is to handle the non-rigid deformation. From the perspective of transformation groups, the conformal transformation is a key part of the diffeomorphism. According to the Liouville Theorem, an important part of the conformal transformation is t…

2018-08-30abs ↗pdf ↗

Geometric approach uses Bäcklund transformations to create integrable discrete analogs of surface nets.

problem Creating integrable discrete analogs of surface nets and conjugate nets.
method Interpreting classical differential geometry results through Bäcklund transformations and applying permutability properties.
result Integrable discrete analogs of asymptotic and conjugate nets are constructed.

SPTN uses invertible transformations to improve sum-product networks.

problem Improving inference efficiency and tractability in sum-product networks.
method Integrates invertible transformations into sum-product networks (SPNs).
result SPTNs with Gaussian leaves and affine transformations are as tractable as SPNs.

FEDformer combines Transformer with seasonal-trend decomposition for efficient long-term forecasting.

problem Transformer's inefficiency and inability to capture global time series views.
method Combines seasonal-trend decomposition with Transformer, exploiting Fourier basis for frequency enhancement.
result Reduces prediction error by 14.8% and 22.6% for multivariate and univariate time series, respectively.

BoostTransformer uses boosting to improve transformer efficiency and accuracy.

problem Heavy computational resources and hyperparameter tuning in transformer architectures.
method Augments transformers with boosting principles through subgrid token selection and importance-weighted sampling, incorporating a least square boosting objective directly into the pipeline.
result BoostTransformer demonstrates faster convergence and higher accuracy compared to standard transformers.

We study an analogue of the classical Bianchi-Darboux transformation for L-isothermic surfaces in Laguerre geometry, the Bianchi-Darboux transformation. We show how to construct the Bianchi-Darboux transforms of an L-isothermic surface by solving an integrable linear differential system. We then establish a permutabili…

2000-01-11abs ↗pdf ↗

We study the limiting behaviour of Darboux and Calapso transforms of polarized curves in the conformal n-dimensional sphere, when the polarization has a pole of first or second order at some point. We prove that for a pole of first order, as the singularity is approached all Darboux transforms converge to the original …

2018-07-02abs ↗pdf ↗

The notion of a generalized harmonic inverse mean curvature surface in the Euclidean four-space is introduced. A backward Bäcklund transform of a generalized harmonic inverse mean curvature surface is defined. A Darboux transform of a generalized harmonic inverse mean curvature surface is constructed by a backward Bäck…

2012-11-20abs ↗pdf ↗

Paper proves Fourier transform for valuations, simplifying previous work.

problem Existence of isomorphism for translation-invariant smooth valuations.
method Directly describes Alesker's isomorphism in terms of Fourier transform on functions.
result Simple proofs of Alesker's Fourier transform properties, including a previously conjectured result.