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

120239359478 · Jun 202019922001200920172026
48 results for representation transformation

New Feedback Transformer architecture improves model performance by exposing past representations to future.

problem Limitations of Transformers in fully exploiting sequential input.
method Proposes Feedback Transformer exposing all past representations to future.
result Demonstrates improved performance with smaller, shallower models.

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 ↗

Relational data representations have become an increasingly important topic due to the recent proliferation of network datasets (e.g., social, biological, information networks) and a corresponding increase in the application of statistical relational learning (SRL) algorithms to these domains. In this article, we exami…

2012-03-30abs ↗pdf ↗

PatchGT uses non-trainable graph patches to improve graph representation learning.

problem Learning high-level information in graph tasks with direct Transformer models.
method PatchGT segments graphs into non-trainable patches, uses GNN for patch-level learning, and Transformer for graph-level learning.
result PatchGT achieves higher expressiveness and competitive performance on benchmark datasets.

We present a signal representation framework called the sparse manifold transform that combines key ideas from sparse coding, manifold learning, and slow feature analysis. It turns non-linear transformations in the primary sensory signal space into linear interpolations in a representational embedding space while maint…

2018-06-23abs ↗pdf ↗

Improves contrastive learning invariance with novel training objectives and feature averaging.

problem Contrastive learning's implicit invariance is insufficient for robust performance.
method Introduces a novel training objective and feature averaging approach to enforce invariance.
result Improved performance and robustness to transformations on downstream tasks.

Transformer learns representations from time series data for money laundering detection.

problem Detecting money laundering using structured time series data.
method Contrastive learning for representation learning, followed by scoring and thresholding.
result Transformer outperforms rule-based and LSTM methods in detecting money laundering with controlled false positives.

Researchers analyze the geometric and statistical properties of transformer model representations.

problem Understanding the semantic structure of large transformer models across various data types.
method Characterization of geometric and statistical properties through analysis of intrinsic dimension and neighbor composition.
result The semantic information of the dataset is better expressed at the end of the first peak in transformer models.

A neural scene representation framework enforcing 3D transformations.

problem Learning 3D scene representations from images without 3D supervision.
method Introducing a loss enforcing equivariance of the scene representation with 3D transformations.
result Real-time neural rendering with comparable results to models requiring minutes for inference.

Researchers present and compare different representations of dissipative Hamiltonian DAE systems.

problem Understanding and transforming dissipative Hamiltonian DAE systems.
method Global geometric and algebraic points of view, translations between representations, characterizations, and numerical methods for computing structural information.
result A general DAE system can be transformed into a dissipative Hamiltonian or port-Hamiltonian DAE system.

Representations in the auditory cortex might be based on mechanisms similar to the visual ventral stream; modules for building invariance to transformations and multiple layers for compositionality and selectivity. In this paper we propose the use of such computational modules for extracting invariant and discriminativ…

2014-04-01abs ↗pdf ↗

The key to success in machine learning (ML) is the use of effective data representations. Traditionally, data representations were hand-crafted. Recently it has been demonstrated that, given sufficient data, deep neural networks can learn effective implicit representations from simple input representations. However, fo…

2018-11-08abs ↗pdf ↗

This study investigates abrupt learning dynamics in Transformers, revealing plateau formation and internal representation collapse.

problem Abrupt learning in Transformers, particularly during the loss plateau.
method Investigates mechanisms of abrupt learning in shallow Transformers, focusing on attention maps and hidden states.
result Reveals plateau formation, internal representation collapse, and strong repetition bias in outputs.

How can intelligent agents solve a diverse set of tasks in a data-efficient manner? The disentangled representation learning approach posits that such an agent would benefit from separating out (disentangling) the underlying structure of the world into disjoint parts of its representation. However, there is no generall…

2018-12-05abs ↗pdf ↗

Learning invariant representations is an important problem in machine learning and pattern recognition. In this paper, we present a novel framework of transformation-invariant feature learning by incorporating linear transformations into the feature learning algorithms. For example, we present the transformation-invari…

2012-06-27abs ↗pdf ↗

The paper reinterprets knot group invariants using affine transformations.

problem Alexander invariants of knots and their geometric interpretation.
method Representation varieties of knot groups into extrmAGL1(C) extrm{AGL}_1(\mathbb{C}).
result Alexander polynomial as the singular locus of a coherent sheaf.

IGT learns graph representations without supervision.

problem Building deep unsupervised graph representations.
method Generic complex-valued spectral graph architecture from Fourier transform generalization, greedy concave objective for discriminative and invariant features.
result IGT learns both discriminative and invariant features from graph topology.

Vision Transformers show different internal representations compared to CNNs.

problem Understanding how Vision Transformers solve image classification tasks.
method Comparative analysis of ViT and CNN architectures on image classification benchmarks.
result ViT has more uniform representations across all layers, while CNNs have more varied representations.

Subspace clustering assumes that the data is sepa-rable into separate subspaces. Such a simple as-sumption, does not always hold. We assume that, even if the raw data is not separable into subspac-es, one can learn a representation (transform coef-ficients) such that the learnt representation is sep-arable into subspac…

2019-12-10abs ↗pdf ↗

Paper recovers latent causal structure and linear transformation from indirect observations.

problem Recovering latent causal structure and linear transformation from indirect observations.
method Established sufficient conditions for DAG recovery, leveraged score function properties, and used soft/hard interventions.
result Perfect recovery of latent DAG structure and linear transformation up to scaling using soft interventions, hard interventions with additional hypothesis testing.

Transformers reduce redundancy by focusing on invariant relational quantities.

problem Substantial internal redundancy in Transformer models due to coordinate-dependent representations and continuous symmetries.
method Reformulate representations, attention mechanisms, and optimization dynamics in terms of invariant relational quantities, eliminating redundant degrees of freedom by construction.
result Architectures that operate directly on relational structures, providing a principled geometric framework for reducing parameter redundancy and analyzing optimization.

CascadeXML improves multi-resolution learning for XMC with transformer features.

problem Learning subset labels from millions of choices with trade-offs between performance and computation.
method End-to-end multi-resolution learning pipeline using transformer multi-layer architecture.
result Significantly outperforms existing approaches on benchmark datasets.

Study geometric and representation theory of statistical transformation models.

problem Understand relationships between induced structures and actions on measure spaces.
method Investigate geometric properties and symplectic actions on induced structures.
result Show equivariance of action and relationships between tangent bundles and projectivizations.

This paper tackles causal representation learning with linear and general transformations.

problem Identify and recover latent causal variables and graphs under unknown transformations.
method Score-based algorithms that use gradients of log-density functions for identifiability and achievability.
result Two stochastic hard interventions per node are sufficient for identifiability of general transformations.

A new model improves CT image quality from low-dose scans.

problem Improving CT image quality from low-dose scans.
method Multi-layer Residual Sparsifying Transform (MRST) learning model for low-dose CT reconstruction.
result The MRST model outperforms conventional methods in maintaining subtle details.

New unsupervised learning technique learns independent kernels for better machine learning tasks.

problem Improving unsupervised representation learning for machine learning tasks.
method Stacking convolutional transforms using alternating proximal minimization scheme.
result DCTL outperforms shallow version CTL on benchmark datasets.

Weierstrass-type representations have been used extensively in surface theory to create surfaces with special curvature properties. In this paper we give a unified description of these representations in terms of classical transformation theory of ΩΩ-surfaces.

2018-09-01abs ↗pdf ↗

We extend the framework of variational autoencoders to represent transformations explicitly in the latent space. In the family of hierarchical graphical models that emerges, the latent space is populated by higher order objects that are inferred jointly with the latent representations they act on. To explicitly demonst…

2019-12-09abs ↗pdf ↗

This paper compares Transformers and RNNs in various tasks, showing size differences.

problem Comparing representational capabilities of Transformers and RNNs across tasks.
method Analysis of differences in tasks like index lookup, nearest neighbor, and string equality.
result Size differences in Transformers and RNNs for various tasks.

Study of SL(2,R) representations on a once-punctured torus, showing Cantor set spectrum.

problem Characterizing SL(2,R) representations on a once-punctured torus.
method Introduction of spectrum as a subset of projective measured laminations, analysis of dynamics of cocycles.
result Spectrum of a generic representation on a once-punctured torus is a Cantor set.