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

Trend · papers per month

55109164218 · Jun 202019922001200920172026
48 results for basis transformation

In this paper we study a symmetry group of vector space. Basis manifold is a homogeneous space of a symmetry group. This concept leads us to the definition of active and passive transformations on basis manifold. Active transformation can be expressed as a transformation of vector space. Passive transformation gives ab…

2004-12-20abs ↗pdf ↗

Finsler space is differentiable manifold for which Minkowski space is the fiber of the tangent bundle. To understand structure of the reference frame in Finsler space, we need to understand the structure of orthonormal basis in Minkowski space. In this paper, I considered the definition of orthonormal basis in Minkowsk…

2011-07-24abs ↗pdf ↗

Finsler space is differentiable manifold for which Minkowski space is the fiber of the tangent bundle. To understand structure of the reference frame in Finsler space, we need to understand the structure of orthonormal basis in Minkowski space. In this paper, we considered the definition of orthonormal basis in Minkows…

2012-01-19abs ↗pdf ↗

Graph Neural Networks (GNNs) have become a topic of intense research recently due to their powerful capability in high-dimensional classification and regression tasks for graph-structured data. However, as GNNs typically define the graph convolution by the orthonormal basis for the graph Laplacian, they suffer from hig…

2019-07-10abs ↗pdf ↗

A new method integrates Fourier basis expansion and mapping for improved time series forecasting.

problem Inconsistent starting cycles and series length issues in Fourier-based methods.
method Fourier Basis Mapping (FBM) method that integrates time-frequency features through Fourier basis expansion and mapping.
result FBM addresses inconsistencies and preserves temporal characteristics, achieving SOTA performance.

A new method for learning manifolds efficiently using canonical basis functions.

problem Learning manifolds in high-dimensional data with efficient and distinct latent dimensions.
method Proposes a novel optimization objective to enforce a transformation matrix with a few prominent and non-degenerate basis functions.
result Demonstrates that minimizing the off-diagonal manifold metric elements 1\ell_1-norm results in a more efficient latent space representation.

New Hermite approximations accelerate convergence with adaptive coordinate transformations.

problem Accelerating convergence of spectral approximations for Hermite expansions.
method Using normalizing flows for adaptive coordinate transformations and deriving error estimates.
result Error estimates for Hermite expansions under adaptive coordinate transformations.

Optimizes basis for density-based atomic representations to enhance compactness and accuracy.

problem Improving the efficiency and accuracy of machine learning models for atomic properties.
method An unsupervised approach to determine the optimal basis set for atom density representations using splines.
result Optimal basis sets that encode structural information more compactly and accurately.

This paper investigates how transformers can learn to generalize to unseen examples in context.

problem Understanding how transformers can generalize to unseen examples in a prompt.
method Gradient descent analysis of one-layer multi-head transformers for in-context learning.
result The training loss for a one-layer multi-head transformer converges linearly to a global minimum, effectively learning ridge regression over basis functions.

A machine learning method selects optimal orthonormal bases for functional data analysis.

problem Lack of formal criteria for choosing initial orthonormal bases in functional data methods.
method Proposes a machine learning algorithm to learn and place knots for efficient orthogonal spline bases (splinets).
result Demonstrates efficiency, especially for sparse functional data and complex physical systems.

Recent work (Cohen & Welling, 2016) has shown that generalizations of convolutions, based on group theory, provide powerful inductive biases for learning. In these generalizations, filters are not only translated but can also be rotated, flipped, etc. However, coming up with exact models of how to rotate a 3 x 3 filter…

2019-05-12abs ↗pdf ↗

Transformers can efficiently approximate nonparametric regression with minimal parameters and sequences.

problem Efficiently approximating nonparametric regression functions with transformers.
method Kernel-weighted polynomial basis and gradient descent.
result Achieves minimax optimal rate of convergence with fewer parameters and sequences.

In the two papers of this series, we initiate the development of a new approach to implementing the concept of symmetry in classical field theory, based on replacing Lie groups/algebras by Lie groupoids/algebroids, which are the appropriate mathematical tools to describe local symmetries when gauge transformations are …

2015-08-19abs ↗pdf ↗

Enhances Fourier estimator performance for asynchronous event-data.

problem Improving correlation and covariance estimation on event-data.
method Implement and test NUFFT methods with different averaging kernels.
result Demonstrates improved performance and relationship between averaging scales.

New model explains how concepts grow based on experience.

problem Existing models assume fixed representation; new model allows for growth.
method Geometric framework with MDL criterion for basis extension.
result Conceptual growth is selective and conservative, exposing or amplifying residual error.

The asymptotic lattices and their transformations are studied within the line geometry approach. It is shown that the discrete asymptotic nets are represented by isotropic congruences in the Plucker quadric. On the basis of the Lelieuvre-type representation of asymptotic lattices and of the discrete analog of the Mouta…

1999-09-16abs ↗pdf ↗

New methods reduce computational cost for Gaussian Markov Random Fields with sparse constraints.

problem Inference and simulation of GMRFs are computationally prohibitive with many constraints.
method Proposes a basis transformation into blocks of constrained and non-constrained subspaces.
result Significantly outperforms existing alternatives in computational cost.

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.

Efficiently analyzes multidimensional functional data using separable basis functions.

problem Curse of dimensionality in traditional functional data analysis.
method Marginal product basis systems for multidimensional data, tensor decomposition, differential operator-based penalties.
result Efficient estimation of multidimensional functional data representations.

Transformer model removes noise from light curves efficiently.

problem Challenges in processing astrophysical light curves due to noise.
method Denoising Time Series Transformer (DTST) model trained with masked objective.
result DTST model excels at removing noise and outliers in time series datasets.

We introduce Network Maximal Correlation (NMC) as a multivariate measure of nonlinear association among random variables. NMC is defined via an optimization that infers transformations of variables by maximizing aggregate inner products between transformed variables. For finite discrete and jointly Gaussian random vari…

2016-06-15abs ↗pdf ↗

Density estimation is a versatile technique underlying many data mining tasks and techniques,ranging from exploration and presentation of static data, to probabilistic classification, or identifying changes or irregularities in streaming data. With the pervasiveness of embedded systems and digitisation, this latter typ…

2019-06-03abs ↗pdf ↗

For a one-parameter family of simple metrics of constant curvature (4κ for κ(1,1)κ\in (-1,1)) on the unit disk MM, we first make explicit the Pestov-Uhlmann range characterization of the geodesic X-ray transform, by constructing a basis of functions making up its range and co-kernel. Such a range characterization also t…

2019-06-22abs ↗pdf ↗

Recent deep learning approaches have achieved impressive performance on speech enhancement and separation tasks. However, these approaches have not been investigated for separating mixtures of arbitrary sounds of different types, a task we refer to as universal sound separation, and it is unknown how performance on spe…

2019-05-08abs ↗pdf ↗

Testing two potentially multivariate variables for statistical dependence on the basis finite samples is a fundamental statistical challenge. Here we explore a family of tests that adapt to the complexity of the relationship between the variables, promising robust power across scenarios. Building on the distance correl…

2018-10-06abs ↗pdf ↗

The paper uses transformed ANOVA to identify important fire detection variables.

problem Identifying key variables for forest fire detection.
method Developed a complete orthonormal system for standard normal distribution, applied Z-score transformation, and used ANOVA approximation.
result Attribute ranking reveals important variables for fire detection.

VAEs and GANs use simple distributions and neural networks to implicitly approximate complex data distributions.

problem Approximating high-dimensional complex distributions explicitly is often intractable.
method VAEs and GANs use simple base distributions and neural networks to implicitly approximate complex distributions.
result Implicit approximation of complex distributions is crucial but introduces limitations, especially in VAEs with fixed Gaussian priors.

The paper explores polysymplectic structures and their reductions in field theories.

problem Invariance of Lagrangian and Hamiltonian field theories under symmetry groups.
method Application of polysymplectic reduction theorem for both Lagrangian and Hamiltonian field equations.
result Identification and relation of polysymplectic structures through Routhian function and Legendre transformation.

New linear flows using exponential of linear transformations improve generative models.

problem Improving generative models in machine learning.
method Developed convolution exponentials and generalized Sylvester Flows using the exponential of linear transformations.
result Convolution exponentials and Convolutional Sylvester Flows outperform other models in log-likelihood.

Transformers learn new tasks from few examples via optimal approximation.

problem Learning new tasks from limited examples using large language models.
method Developed approximation and generalization error bounds for transformers trained on nonparametric regression tasks.
result Transformers achieve minimax optimal estimation risk in context.

In this paper, we study the structure of homogeneous subgroups of the homeomorphism group of the sphere, which are defined as closed groups of homeomorphisms of the sphere that contain the rotation group. We prove two structure theorems about the behaviour and properties of such groups and present a diagram of the stru…

2013-09-01abs ↗pdf ↗

We generalize the classical Lie results on a basis of differential invariants for a one-parameter group of local transformations to the case of arbitrary number of independent and dependent variables. It is proved that if universal invariant of a one-parameter group is known then a complete set of functionally independ…

2001-12-24abs ↗pdf ↗