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.

169,051 papers · 148 categories

Trend · papers per month

78156234312 · Jun 202019922001200920172026
48 results for locally encodable

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.

The contractive auto-encoder learns a representation of the input data that captures the local manifold structure around each data point, through the leading singular vectors of the Jacobian of the transformation from input to representation. The corresponding singular values specify how much local variation is plausib…

2012-06-27abs ↗pdf ↗

Improved VAE models avoid posterior collapse in text modeling.

problem Posterior collapse in VAEs leads to poor data manifold parameterization.
method Coupled-VAE couples a VAE with a deterministic autoencoder to improve encoder and decoder parameterizations.
result Coupled-VAE consistently improves results in probability estimation and latent space richness.

Encoding a sequence of observations is an essential task with many applications. The encoding can become highly efficient when the observations are generated by a dynamical system. A dynamical system imposes regularities on the observations that can be leveraged to achieve a more efficient code. We propose a method to …

2018-05-27abs ↗pdf ↗

A new triad decoder improves graph auto-encoders' performance.

problem Graph auto-encoders ignore edge interactions, leading to suboptimal predictions.
method Integrates triadic closure property to predict three edges in a local triad.
result Triad decoder leads to more accurate predictions, clustering, and graph characteristics preservation.

Brain networks in fMRI are typically identified using spatial independent component analysis (ICA), yet mathematical constraints such as sparse coding and positivity both provide alternate biologically-plausible frameworks for generating brain networks. Non-negative Matrix Factorization (NMF) would suppress negative BO…

2016-07-01abs ↗pdf ↗

Two graph auto-encoders decouple feature propagation from graph convolution layers.

problem Designing efficient graph auto-encoders with fixed receptive fields.
method L-GAE and L-VGAE using linear matrix computation before auto-encoder input.
result Comparable performance to VGAEs with smaller, simpler networks.

We explain the meaning of local symmetries in physics.

problem Understanding the meaning of local symmetries in physics.
method We argue that general covariance and gauge principles are principles of epistemic access to physical laws, leading to ontological insights.
result Relationality is a core notion in gauge field theory, encoded by local symmetries.

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.

Spectral analysis of neighborhood graphs is one of the most widely used techniques for exploratory data analysis, with applications ranging from machine learning to social sciences. In such applications, it is typical to first encode relationships between the data samples using an appropriate similarity function. Popul…

2016-12-14abs ↗pdf ↗

Enhances graph neural networks with structural message-passing for better generalization.

problem Limited representation power and inability to learn basic graph topological properties.
method Proposes a framework that includes a one-hot encoding of nodes and parametrized message and update functions ensuring permutation equivariance.
result Achieves state-of-the-art results on molecular graph regression on the ZINC dataset.

Non-linear manifold learning enables high-dimensional data analysis, but requires out-of-sample-extension methods to process new data points. In this paper, we propose a manifold learning algorithm based on deep learning to create an encoder, which maps a high-dimensional dataset and its low-dimensional embedding, and …

2015-06-25abs ↗pdf ↗

A new classifier encodes local neighborhoods for each class using Fly Bloom Filters.

problem Efficiently classify data with single-pass learning.
method Proposes a new classifier that encodes local neighborhoods for each class with per-class Fly Bloom Filters.
result The proposed classifier's performance is competitive with nearest-neighbor classifiers and other single-pass classifiers.

Unified MTL framework for heterogeneous data integrates shared and task-specific encoders.

problem Efficiently sharing information across multiple tasks with heterogeneous data.
method Dual-encoder framework with task-shared and task-specific encoders.
result Unified algorithm alternates learning task-specific and shared encoders and coefficients.

We introduce a novel encoder-decoder architecture to embed functional processes into latent vector spaces. This embedding can then be decoded to sample the encoded functions over any arbitrary domain. This autoencoder generalizes the recently introduced Conditional Neural Process (CNP) model of random processes. Our ar…

2018-12-13abs ↗pdf ↗

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.

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 ↗

Co-PLNet combines point and line predictions to improve wireframe parsing accuracy and efficiency.

problem Separate line and point predictions lead to inconsistent wireframes.
method Co-PLNet uses a Point-Line Prompt Encoder to convert early point detections into spatial prompts, which guide line refinement.
result Co-PLNet achieves better accuracy and robustness in wireframe parsing compared to existing methods.

We prove that higher moment maps on area measures of a euclidean vector space are injective, while the kernel of the centroid map equals the image of the first variation map. Based on this, we introduce the space of smooth dual area measures on a finite-dimensional euclidean vector space and prove that it admits a natu…

2017-03-23abs ↗pdf ↗

The local kinematic formulas on complex space forms induce the structure of a commutative algebra on the space CurvU(n)\mathrm{Curv}^{\mathrm{U}(n)*} of dual unitarily invariant curvature measures. Building on the recent results from integral geometry in complex space forms, we describe this algebra structure explicitly as a…

2017-02-07abs ↗pdf ↗

Recent machine learning methods make it possible to model potential energy of atomic configurations with chemical-level accuracy (as calculated from ab-initio calculations) and at speeds suitable for molecular dynam- ics simulation. Best performance is achieved when the known physical constraints are encoded in the mac…

2016-12-01abs ↗pdf ↗

The geometry of the target space of an N=(2,2) supersymmetry sigma-model carries a generalized Kahler structure. There always exists a real function, the generalized Kahler potential K, that encodes all the relevant local differential geometry data: the metric, the B-field, etc. Generically this data is given by nonlin…

2007-02-16abs ↗pdf ↗

Deep learning has shown its great promise in various biomedical image segmentation tasks. Existing models are typically based on U-Net and rely on an encoder-decoder architecture with stacked local operators to aggregate long-range information gradually. However, only using the local operators limits the efficiency and…

2018-12-10abs ↗pdf ↗

Paper explores embedding methods for detecting pseudo-cliques in random graphs, showing limitations and potential.

problem Detecting planted pseudo-cliques in random dot product graphs.
method Adjacency Spectral Embedding (ASE) and Graph Encoder Embedding (GEE).
result These methods can localize pseudo-cliques with additional clean network data, but not without it.

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 diffusion model encodes causal structures for better interventional sampling and edge inference.

problem Lack of causal analysis in standard diffusion models.
method Causality-encoded diffusion framework that trains conditional models consistent with a directed acyclic graph.
result The method enables accurate interventional sampling and edge inference, with theoretical guarantees and practical applications.

We develop a method for user-controllable semantic image inpainting: Given an arbitrary set of observed pixels, the unobserved pixels can be imputed in a user-controllable range of possibilities, each of which is semantically coherent and locally consistent with the observed pixels. We achieve this using a deep generat…

2018-06-15abs ↗pdf ↗

We study generalized complex manifolds from the point of view of symplectic and Poisson geometry. We start by showing that every generalized complex manifold admits a canonical Poisson structure. We use this fact, together with Weinstein's classical result on the local normal form of Poisson manifolds, to prove a local…

2004-12-04abs ↗pdf ↗

Sparse coding is a common approach to learning local features for object recognition. Recently, there has been an increasing interest in learning features from spatio-temporal, binocular, or other multi-observation data, where the goal is to encode the relationship between images rather than the content of a single ima…

2012-06-18abs ↗pdf ↗

Minimal triangulations of circle bundles linked to circular permutations.

problem Which circle bundles can be triangulated over a given base triangulation?
method Minimal triangulations encoded by local systems of circular permutations of vertices.
result Classical Huntington transitivity axiom for cyclic orders expressed as a binary Chern cocycle.

We extend the twistor methods developed in our earlier work on linear deformations of hyperkahler manifolds [arXiv:0806.4620] to the case of quaternionic-Kahler manifolds. Via Swann's construction, deformations of a 4d-dimensional quaternionic-Kahler manifold MM are in one-to-one correspondence with deformations of it…

2008-10-09abs ↗pdf ↗

We study local normal forms for completely integrable systems on Poisson manifolds in the presence of additional symmetries. The symmetries that we consider are encoded in actions of compact Lie groups. The existence of Weinstein's splitting theorem for the integrable system is also studied giving some examples in whic…

2013-01-07abs ↗pdf ↗