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

55110165220 · Jun 202019922001200920172026
48 results for global encoding

GAMLA learns manifold structures with auto-encoding for global insights.

problem Limited global insight and lack of interpretable analytical descriptions in manifold learning.
method Two-round auto-encoding process to derive character and complementary representations.
result GAMLA provides global and analytical descriptions of smooth manifolds.

When doing representation learning on data that lives on a known non-trivial manifold embedded in high dimensional space, it is natural to desire the encoder to be homeomorphic when restricted to the manifold, so that it is bijective and continuous with a continuous inverse. Using topological arguments, we show that wh…

2018-12-27abs ↗pdf ↗

We consider the problem of learning high-level controls over the global structure of generated sequences, particularly in the context of symbolic music generation with complex language models. In this work, we present the Transformer autoencoder, which aggregates encodings of the input data across time to obtain a glob…

2019-12-10abs ↗pdf ↗

iREPA shows spatial structure, not global semantic, drives generation performance in REPA.

problem Understanding what aspect of the target representation matters for generation.
method Empirical analysis of 27 vision encoders, two modifications to REPA.
result Spatial structure, not global semantic, drives generation performance.

Paper proposes LCP for structural encodings, outperforming existing methods.

problem Improving Graph Neural Networks performance through effective structural encodings.
method Geometric perspective, Local Curvature Profiles (LCP) for structural encodings, combining with global positional encodings, comparing with rewiring techniques.
result LCP significantly outperforms existing structural encodings and combining LCP with global positional encodings improves performance.

Improved OOD detection across various shifts using multi-encoder fusion of RDMs.

problem Out-of-distribution detection across multiple types of distribution shifts.
method Statistical identification of encoder sensitivity, EncMin2L fusion, and Tippett minimum combination.
result Achieves AUROC ≥ 0.94 across four shift types, outperforming state-of-the-art detectors.

QuantNet learns global market trends to improve trading strategies.

problem Developing global trading strategies from multiple markets' data.
method QuantNet integrates transfer and meta-learning to learn market-agnostic trends and market-specific strategies.
result QuantNet outperformed top baseline strategies by 51% Sharpe and 69% Calmar ratios.

A new model decouples global and local image representations without supervision.

problem Learning decoupled global and local image representations without supervision.
method Variational auto-encoding framework with invertible generative flow.
result The model effectively learns decoupled representations of images.

Conformer encoder reverses sequence in time dimension, affecting decoder training.

problem Reversal of sequence in Conformer encoder impacts decoder training.
method Analyzed initial behavior of decoder cross-attention and proposed methods to avoid flipping.
result Self-attention module of Conformer starts dominating, allowing only reversed information to pass.

Randomized positional encodings boost transformer performance on longer sequences.

problem Transformers struggle with generalizing to sequences of arbitrary length.
method Introduced randomized positional encodings that simulate longer sequences and randomly select positions.
result Randomized positional encodings increase test accuracy by 12.0% on average for sequences of unseen length.

We give a topological model for a polynomial map from $\C^n$ to $\C$ in the neighborhood of a fiber with isolated singularities. This is motivated out of the ``unfolding of links'' described earlier by the first author and Lee Rudolph. The topological model gives a useful encoding of the local and global monodromy for …

1999-10-11abs ↗pdf ↗

Paper proposes a new Autoencoder for robustly encoding white matter streamlines.

problem Limited Autoencoder architectures ignore global streamline geometry and lack interpretability.
method Introduces Differentiable Vector Quantized Variational Autoencoder (D-VQ-VAE) for entire streamline bundles.
result Demonstrates superior performance in encoding and synthesis compared to state-of-the-art Autoencoders.

We introduce a simple recurrent variational auto-encoder architecture that significantly improves image modeling. The system represents the state-of-the-art in latent variable models for both the ImageNet and Omniglot datasets. We show that it naturally separates global conceptual information from lower level details, …

2016-04-29abs ↗pdf ↗

An essential aspect of texture analysis is the extraction of features that describe the distribution of values in local, spatial regions. We present a localized histogram layer for artificial neural networks. Instead of computing global histograms as done previously, the proposed histogram layer directly computes the l…

2020-01-01abs ↗pdf ↗

Automatic summarisation is a popular approach to reduce a document to its main arguments. Recent research in the area has focused on neural approaches to summarisation, which can be very data-hungry. However, few large datasets exist and none for the traditionally popular domain of scientific publications, which opens …

2017-06-13abs ↗pdf ↗

In an ego-network, an individual (ego) organizes its friends (alters) in different groups (social circles). This social network can be efficiently analyzed after learning representations of the ego and its alters in a low-dimensional, real vector space. These representations are then easily exploited via statistical mo…

2020-02-16abs ↗pdf ↗

In many important machine learning applications, the training distribution used to learn a probabilistic classifier differs from the testing distribution on which the classifier will be used to make predictions. Traditional methods correct the distribution shift by reweighting the training data with the ratio of the de…

2018-06-16abs ↗pdf ↗

Prove a global shadow lemma for Patterson-Sullivan measures associated with relatively Morse subgroups in higher-rank semisimple Lie groups.

problem Prove a global shadow lemma for Patterson-Sullivan measures associated with relatively Morse subgroups in higher-rank semisimple Lie groups.
method Prove a global shadow lemma for Patterson-Sullivan measures associated with relatively Morse subgroups in higher-rank semisimple Lie groups.
result Prove a global shadow lemma for Patterson-Sullivan measures associated with relatively Morse subgroups in higher-rank semisimple Lie groups.

New method learns to encode predictions within interpretations, improving evaluation.

problem Need for interpretable machine learning, but existing methods are slow or lack fidelity.
method Amortized explanation methods that learn a global selector model optimizing fidelity of interpretations.
result Predictions can be encoded within interpretations, detected by EVAL-X.

A new method tackles Bayesian inverse problems with complex PDEs.

problem Bayesian inverse problems with expensive forward model evaluations and high-dimensional priors.
method Domain-decomposed variational auto-encoder Markov chain Monte Carlo (DD-VAE-MCMC) method.
result The method efficiently solves Bayesian inverse problems in parallel and low-dimensional latent spaces.

We propose a novel node embedding of directed graphs to statistical manifolds, which is based on a global minimization of pairwise relative entropy and graph geodesics in a non-linear way. Each node is encoded with a probability density function over a measurable space. Furthermore, we analyze the connection between th…

2019-05-24abs ↗pdf ↗

We provide a method to prepare covariance matrices for quantum datasets.

problem No concrete protocol for preparing covariance matrices for quantum datasets.
method Amplitude encoding of data, exploiting global phase symmetry to center the dataset.
result Covariance matrix can be prepared for arbitrary quantum datasets or centered classical datasets.

Paper studies Transformer learning theory for Euclidean and Riemannian domains.

problem Understanding and optimizing Transformer networks for regression tasks.
method Constructive approximation framework using softmax partition of unity and attention mechanism.
result Transformer can achieve uniform ε-approximation error with minimal parameters.

A new method for feature fusion in U-Net decoders using difference-based gating.

problem Precise fusion of high-level semantics and low-level details in U-Net decoder reconstruction.
method Proposes two difference-based gating approaches: Feature-difference gating (FDG) and Entropy-difference gating (EDG).
result Both FDG and EDG methods outperform existing attention-based fusion methods, with EDG showing superior performance.

Develops a flexible deep autoencoding topic model with scalable hybrid Bayesian inference.

problem Flexible and interpretable document analysis models.
method DATM with hybrid Bayesian inference, including topic-layer-adaptive stochastic gradient Riemannian MCMC and Weibull variational encoder.
result Demonstrates scalability and efficacy on big corpora in unsupervised and supervised learning tasks.

Global well-posedness and asymptotic convergence for vacuum Einstein's equations proved.

problem Proving global well-posedness and asymptotic convergence for vacuum Einstein's equations.
method Integrable damping mechanism induced by cosmological constant.
result Future-global solutions converge smoothly to a limiting metric of constant negative scalar curvature.

Let M be an oriented compact 3-manifold and let T be a (loose) triangulation of M, with ideal vertices at the components of the boundary of M and possibly internal vertices. We show that any spin structure s on M can be encoded by extra combinatorial structures on T. We then analyze how to change these extra structures…

2013-04-14abs ↗pdf ↗

EAGLE-Net enhances foundation models by integrating patch-level features for better tissue understanding.

problem Foundation models lack mechanisms for global tissue structure and local context in computational pathology.
method EAGLE-Net combines multi-scale spatial encoding, attention-guided loss functions, and background suppression to aggregate patch-level features into slide-level predictions.
result EAGLE-Net improves classification accuracy and concordance indices across multiple cancer types, producing biologically coherent attention maps.

HGConv uses HRR to efficiently detect malware, outperforming existing methods.

problem Efficiently detecting malware with long sequences.
method Holographic Global Convolutional Networks (HGConv) utilizing Holographic Reduced Representations (HRR).
result Achieved state-of-the-art results on malware benchmarks.

Neural Physicist learns physical dynamics from images.

problem Learning meaningful physical state representations and accurate state transitions from image sequences.
method Neural Physicist uses VAE for state extraction, NP for parameters, and SSM for dynamics.
result Achieves long-term predictions and identifies system degrees of freedom.

We develop a ``canonical Wick rotation-rescaling theory in 3-dimensional gravity''. This includes: (a) A simultaneous classification that shows how generic maximal globally hyperbolic spacetimes of constant curvature, which admit a complete Cauchy surface (in particular a compact one), as well as complex projective str…

2005-08-25abs ↗pdf ↗

A central goal of meta-learning is to find a learning rule that enables fast adaptation across a set of tasks, by learning the appropriate inductive bias for that set. Most meta-learning algorithms try to find a \textit{global} learning rule that encodes this inductive bias. However, a global learning rule represented …

2020-02-09abs ↗pdf ↗

Hybrid QML model improves recovery rate prediction accuracy.

problem Complex nonlinear dependencies, high-dimensional feature spaces, and limited sample sizes in recovery rate forecasting.
method Hybrid Quantum Machine Learning (QML) with Amplitude Encoding, leveraging PQC and qubit data compression.
result Significantly lower RMSE (0.228) compared to classical models.

GNNRank uses neural networks to learn global rankings from competition match data.

problem Learning global rankings from pairwise comparisons in directed graphs.
method Proposes GNNRank, a trainable GNN-based framework with digraph embedding and new objectives.
result GNNRank achieves competitive and superior performance compared to baselines.