Paper proposes LCP for structural encodings, outperforming existing methods.
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.
Trend · papers per month
Recent work suggests that some auto-encoder variants do a good job of capturing the local manifold structure of the unknown data generating density. This paper contributes to the mathematical understanding of this phenomenon and helps define better justified sampling algorithms for deep learning based on auto-encoder v…
Study proposes Local Linear Encoding for better feature discretization.
A new histogram layer improves texture analysis performance.
Paper shows semi-supervised clustering is equivalent to a type of source coding.
Study infers tree topology from customer data using contrastive learning.
ETC improves Transformer models for long and structured inputs.
What do auto-encoders learn about the underlying data generating distribution? Recent work suggests that some auto-encoder variants do a good job of capturing the local manifold structure of data. This paper clarifies some of these previous observations by showing that minimizing a particular form of regularized recons…
A new method detects anomalies in images without needing model adjustments.
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…
Improved VAE models avoid posterior collapse in text modeling.
The paper encodes local shapes of polynomial curves using permutations.
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 …
A basic question in the theory of fault-tolerant quantum computation is to understand the fundamental resource costs for performing a universal logical set of gates on encoded qubits to arbitrary accuracy. Here we consider qubits encoded with constant space overhead (i.e. finite encoding rate) in the limit of arbitrari…
A new triad decoder improves graph auto-encoders' performance.
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…
Two graph auto-encoders decouple feature propagation from graph convolution layers.
Proposes MC-AE for better unsupervised clustering of unlabeled data.
We explain the meaning of local symmetries in physics.
A new method tackles Bayesian inverse problems with complex PDEs.
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…
Enhances graph neural networks with structural message-passing for better generalization.
Motivation: Proteins are known to undergo conformational changes in the course of their functions. The changes in conformation are often attributable to a small fraction of residues within the protein. Therefore identification of these variable regions is important for an understanding of protein function. Results: We …
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 …
A new classifier encodes local neighborhoods for each class using Fly Bloom Filters.
Unified MTL framework for heterogeneous data integrates shared and task-specific encoders.
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…
A new model decouples global and local image representations without supervision.
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 …
Sparse neural encoding can store more memories as targets become sparser.
New method encodes knots using clasp diagrams for easier study of invariants.
3D Axial-Attention improves lung nodule classification accuracy.
Co-PLNet combines point and line predictions to improve wireframe parsing accuracy and efficiency.
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…
Enhances GNNs to better capture local graph structures.
The local kinematic formulas on complex space forms induce the structure of a commutative algebra on the space 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…
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…
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…
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…
Paper explores embedding methods for detecting pseudo-cliques in random graphs, showing limitations and potential.
Paper studies Transformer learning theory for Euclidean and Riemannian domains.
A new diffusion model encodes causal structures for better interventional sampling and edge inference.
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…
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…
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…
Minimal triangulations of circle bundles linked to circular permutations.
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 are in one-to-one correspondence with deformations of it…
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…