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

Trend · papers per month

183365548730 · Jun 202019922001200920172026
48 results for functional encoding

Despite the superior performance of deep learning in many applications, challenges remain in the area of regression on function spaces. In particular, neural networks are unable to encode function inputs compactly as each node encodes just a real value. We propose a novel idea to address this shortcoming: to encode an …

2018-04-13abs ↗pdf ↗

Quantum models can approximate any function if data encoding allows for a rich enough frequency spectrum.

problem Theoretical properties of quantum machine learning models, particularly their expressive power.
method Investigated how data encoding affects the expressive power of parametrized quantum circuits.
result Quantum models can access increasingly rich frequency spectra by repeating data encoding gates, potentially making them universal function approximators.

We present a framework to learn privacy-preserving encodings of images that inhibit inference of chosen private attributes, while allowing recovery of other desirable information. Rather than simply inhibiting a given fixed pre-trained estimator, our goal is that an estimator be unable to learn to accurately predict th…

2018-02-14abs ↗pdf ↗

Improves energy efficiency of neuromorphic hardware by optimizing memory organization and encoding schemes.

problem Energy inefficiency in neuromorphic hardware, especially in digital accelerators.
method Synthesized controller and memory for different encoding schemes, introduced functional encoding for structured connectivity.
result Functional encoding offers a 58% reduction in energy for weight updates in convolutional layers.

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 simple encoder and complex decoder for secure image encryption and decryption.

problem Secure and efficient image encryption and decryption.
method Uses a shallow encoder neural network for encryption and a deep decoder for decryption, trained independently.
result Decrypted images are nearly identical to the original, demonstrating the effectiveness of the framework.

Study efficient neural operator learning using variation spaces.

problem Operator learning using encoder-decoder neural networks.
method Introduce variation space for nonlinear operators, establish approximation bounds.
result Algebraic approximation and learning rates for polynomially decaying input and output encoding errors.

Hybrid Bayesian neural networks use function uncertainty for probabilistic inference.

problem Uncertainty in neural network weights is hard to specify and interpret.
method Integrates probabilistic layers with standard deterministic layers for function uncertainty.
result Improves probabilistic inference by encoding function uncertainty.

Stochastic encoding improves gender classification of brain networks from UK Biobank data.

problem Complexity and bias in interpreting deep learning models of brain connectivity.
method Stochastic encoding in ensemble of CNNs, multivariate balancing algorithm.
result AUROC of 0.8459, with resting-state data more accurate than task data.

New method for scalable set encoding with unbiased gradient approximation.

problem Limited expressive power and large set training issues in set functions.
method Universally MBC (UMBC) class of set functions and efficient MBC training algorithm.
result Unbiased approximation of full set gradient with constant memory overhead.

We describe a method of encoding various types of link diagrams, including those with classical, flat, rigid, welded, and virtual crossings. We show that this method may be used to encode link diagrams, up to equivalence, in a notation whose length is a cubic function of the number of 'riser marks'. For classical knots…

2012-08-01abs ↗pdf ↗

MCSAE improves speaker embedding by focusing on both high- and low-level features.

problem Reduced effect of low-level features in speaker embedding encoding.
method Masked cross self-attentive encoding using ResNet with multi-layer aggregation and random masking regularization.
result Improved speaker embedding with equal error rate of 2.63% and minimum detection cost function of 0.1453.

Despite its nonconvex nature, 0\ell_0 sparse approximation is desirable in many theoretical and application cases. We study the 0\ell_0 sparse approximation problem with the tool of deep learning, by proposing Deep 0\ell_0 Encoders. Two typical forms, the 0\ell_0 regularized problem and the MM-sparse problem, are …

2015-09-01abs ↗pdf ↗

New insights into encoder-decoder structures using information measures.

problem Understanding the role of encoder-decoder design in machine learning.
method Using information sufficiency and mutual information loss concepts.
result Characterizes the expressiveness loss in encoder-decoder designs.

New bounds for quantum circuits depend on how data is encoded.

problem Lack of explicit dependence on data encoding in generalization bounds for PQCs.
method Derived generalization bounds that depend on data encoding strategies using Rademacher complexity and metric entropy.
result Optimal data-encoding strategies can be selected via structural risk minimization.

Traditional set prediction models can struggle with simple datasets due to an issue we call the responsibility problem. We introduce a pooling method for sets of feature vectors based on sorting features across elements of the set. This can be used to construct a permutation-equivariant auto-encoder that avoids this re…

2019-06-06abs ↗pdf ↗

This paper explores GNN functions on random graphs, highlighting the importance of node Positional Encodings.

problem Understanding the expressive power of GNNs on large random graphs.
method General convergence notions, input node features, and Positional Encodings (PEs).
result GNNs can converge to certain functions on large random graphs, emphasizing the role of PEs.

Tensor networks and RNNs are equivalent, improving wave function encoding.

problem Efficiently encoding quantum states in neural networks.
method Generalized RNN architecture for tensor networks, supporting polynomial time wave function evaluation.
result Tensorial RNNs can encode quantum states with lower bond dimensions and higher accuracy.

Study presents a method to induce a generalized neural network from joint group invariant functions.

problem Encoding rule of neural network internal data representation.
method Systematic method using joint group invariant function on data-parameter domain.
result Induces a generalized neural network and its inverse operator (ridgelet transform).

Novel Bayesian prior for neural networks encodes amplitude and lengthscale.

problem Lack of user-friendly priors for specifying basic properties in Bayesian neural networks.
method Introduced Poisson Process Radial Basis Function Networks (PP-RBFN) as a novel prior.
result PP-RBFN allows decoupled specification of amplitude and lengthscale, and estimated function is consistent.

We show that a generative random field model, which we call generative ConvNet, can be derived from the commonly used discriminative ConvNet, by assuming a ConvNet for multi-category classification and assuming one of the categories is a base category generated by a reference distribution. If we further assume that the…

2016-02-10abs ↗pdf ↗

A novel approach stores encoded images as centroids and covariance matrices to improve classification accuracy with less memory.

problem Catastrophic forgetting and memory limitations in continual learning.
method Trains autoencoders with Neural Style Transfer to encode images, replay encoded episodes to avoid forgetting, and use centroids and covariance matrices for pseudo-images when memory is full.
result Increases classification accuracy by 13-17% over state-of-the-art methods on benchmark datasets, while requiring 78% less storage space.

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 ↗

Novel PCA method for high-dimensional inverse problems.

problem Optimizing large-scale random fields with gradient information.
method Gradient-Sensitive Principal Component Analysis (Gradient-SPCA) that modifies PCA using objective function gradients.
result Improvements in encoding quality for objective function minimization and field distribution.

VAEs analyzed using harmonic analysis, showing how variance controls frequency content and robustness.

problem Understanding and optimizing VAEs for robustness and frequency control.
method Viewing VAE latent space as Gaussian space, deriving results on variance and frequency content, and demonstrating soft Lipschitz constraints.
result Increasing encoder variance reduces high frequency content and improves adversarial robustness.

We consider an online decision making setting known as contextual bandit problem, and propose an approach for improving contextual bandit performance by using an adaptive feature extraction (representation learning) based on online clustering. Our approach starts with an off-line pre-training on unlabeled history of co…

2018-02-03abs ↗pdf ↗

Constrained clustering has been well-studied for algorithms such as KK-means and hierarchical clustering. However, how to satisfy many constraints in these algorithmic settings has been shown to be intractable. One alternative to encode many constraints is to use spectral clustering, which remains a developing area. I…

2012-01-25abs ↗pdf ↗

Efficiently accelerates attention calculation for Transformers with relative positional encoding.

problem Quadratic complexity of attention in long sequences.
method Kernelized attention with Fast Fourier Transform (FFT) for RPE.
result Achieves O(n log n) time complexity, mitigates training instability, and outperforms other models.

We construct a deep portfolio theory. By building on Markowitz's classic risk-return trade-off, we develop a self-contained four-step routine of encode, calibrate, validate and verify to formulate an automated and general portfolio selection process. At the heart of our algorithm are deep hierarchical compositions of p…

2016-05-23abs ↗pdf ↗

We present a novel architecture, the "stacked what-where auto-encoders" (SWWAE), which integrates discriminative and generative pathways and provides a unified approach to supervised, semi-supervised and unsupervised learning without relying on sampling during training. An instantiation of SWWAE uses a convolutional ne…

2015-06-08abs ↗pdf ↗

Enhances neural models with simple functions to improve language modeling.

problem Neural models struggle with certain spatial, temporal, or quantitative relationships.
method Integrates simple functions into neural architecture to form a hierarchical NSLM.
result NSLMs significantly reduce perplexity in small-corpus language modeling.

Null distance encodes causal structure in spacetimes.

problem Encoding causal structure in Lorentzian manifolds.
method Using null distance defined by Sormani and Vega, and proving causal structure is encoded by null distance.
result Lorentzian isometry between spacetimes with bijective map preserving null distance and cosmological time function.