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

4896143191 · Jun 202019922001200920172026
48 results for shared encoders

Improves shared encoder representations for better multi-task learning performance.

problem Improving quality of shared encoder representations in multi-task learning.
method Dummy Gradient norm Regularization (DGR) to decrease gradient norm of dummy task-specific predictors.
result DGR improves multi-task prediction performances and superior performance compared to existing methods.

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.

Different neural networks trained on the same dataset often learn similar input-output mappings with very different weights. Is there some correspondence between these neural network solutions? For linear networks, it has been shown that different instances of the same network architecture encode the same representatio…

2018-11-28abs ↗pdf ↗

We present a memory augmented neural network for natural language understanding: Neural Semantic Encoders. NSE is equipped with a novel memory update rule and has a variable sized encoding memory that evolves over time and maintains the understanding of input sequences through read}, compose and write operations. NSE c…

2016-07-14abs ↗pdf ↗

We introduce a scalable approach for object pose estimation trained on simulated RGB views of multiple 3D models together. We learn an encoding of object views that does not only describe an implicit orientation of all objects seen during training, but can also relate views of untrained objects. Our single-encoder-mult…

2019-08-01abs ↗pdf ↗

We propose the Wasserstein Auto-Encoder (WAE)---a new algorithm for building a generative model of the data distribution. WAE minimizes a penalized form of the Wasserstein distance between the model distribution and the target distribution, which leads to a different regularizer than the one used by the Variational Aut…

2017-11-05abs ↗pdf ↗

Exact optimality achieved in distributed mean estimation with shared randomness.

problem Achieving optimal communication, privacy, and utility tradeoffs in distributed mean estimation.
method Utilization of a rotationally symmetric shared random codebook and a kk-closest encoding mechanism.
result Proposed mechanism achieves exact optimality for randomly rotated simplex codebook.

Learning from multiple sources of information is an important problem in machine-learning research. The key challenges are learning representations and formulating inference methods that take into account the complementarity and redundancy of various information sources. In this paper we formulate a variational autoenc…

2018-11-11abs ↗pdf ↗

This paper introduces a cross adversarial source separation (CASS) framework via autoencoder, a new model that aims at separating an input signal consisting of a mixture of multiple components into individual components defined via adversarial learning and autoencoder fitting. CASS unifies popular generative networks l…

2019-05-23abs ↗pdf ↗

PerPCA separates unique and shared features from heterogeneous data.

problem Extracting shared and unique features from data collected from different sources with varying trends.
method Personalized PCA (PerPCA) uses orthogonal global and local principal components to encode both unique and shared features.
result PerPCA can identify and recover both unique and shared features under mild conditions.

We propose a new architecture called Memory-Augmented Encoder-Solver (MAES) that enables transfer learning to solve complex working memory tasks adapted from cognitive psychology. It uses dual recurrent neural network controllers, inside the encoder and solver, respectively, that interface with a shared memory module a…

2018-09-28abs ↗pdf ↗

Sequence to sequence learning has recently emerged as a new paradigm in supervised learning. To date, most of its applications focused on only one task and not much work explored this framework for multiple tasks. This paper examines three multi-task learning (MTL) settings for sequence to sequence models: (a) the onet…

2015-11-19abs ↗pdf ↗

PIMA autoencoders discover shared features in multimodal scientific data.

problem Discovering shared information in high-throughput scientific datasets.
method Physics-informed multimodal autoencoders (PIMA) with Gaussian mixture prior and product of experts formulation.
result Accurate cross-modal inference between images and mechanical stress-strain response in lattice metamaterials.

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.

We present an encoder-powered generative adversarial network (EncGAN) that is able to learn both the multi-manifold structure and the abstract features of data. Unlike the conventional decoder-based GANs, EncGAN uses an encoder to model the manifold structure and invert the encoder to generate data. This unique scheme …

2019-06-03abs ↗pdf ↗

FedLog reduces communication in federated learning by sharing data summaries.

problem Significant communication overhead in federated learning with large model parameters.
method Shares minimal sufficient statistics via Bayesian inference and differential privacy.
result High learning accuracy with low communication overhead.

A new model detects common patterns in pollination networks.

problem Comparing organization of bipartite networks to understand community structure.
method colBiSBM, a family of probabilistic models for collections of bipartite networks.
result The method uncovers shared ecological roles and partitions networks.

The use of automatic methods, often referred to as Neural Architecture Search (NAS), in designing neural network architectures has recently drawn considerable attention. In this work, we present an efficient NAS approach, named HM- NAS, that generalizes existing weight sharing based NAS approaches. Existing weight shar…

2019-08-31abs ↗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 ↗

Decentralized learning achieves centralized performance via Gibbs measures.

problem Achieving centralized performance in decentralized machine learning.
method ERM-RER learning framework with Gibbs measures and relative-entropy regularization.
result Achieving centralized performance with Gibbs measures and specific scaling of regularization factors.

Multiple clustering aims at exploring alternative clusterings to organize the data into meaningful groups from different perspectives. Existing multiple clustering algorithms are designed for single-view data. We assume that the individuality and commonality of multi-view data can be leveraged to generate high-quality …

2019-05-13abs ↗pdf ↗

DAGR improves navigation by refining goal representations conditioned on the current state.

problem Goal-conditioned reinforcement learning lacks state awareness, leading to inefficient policy recovery.
method DAGR refines static goal embeddings into state-conditioned ones using gated cross-attention with a state-goal discrepancy map.
result DAGR improves navigation tasks on OGBench, matching or outperforming base methods.

Future video prediction is an ill-posed Computer Vision problem that recently received much attention. Its main challenges are the high variability in video content, the propagation of errors through time, and the non-specificity of the future frames: given a sequence of past frames there is a continuous distribution o…

2017-12-01abs ↗pdf ↗

FLUID uses flows to unify filtering and smoothing for complex systems.

problem Bayesian filtering and smoothing for high-dimensional nonlinear systems.
method FLUID encodes observation histories into a fixed summary statistic, using flows for filtering and smoothing.
result FLUID provides accurate approximations of filtering and smoothing distributions.

We present a method for translating music across musical instruments, genres, and styles. This method is based on a multi-domain wavenet autoencoder, with a shared encoder and a disentangled latent space that is trained end-to-end on waveforms. Employing a diverse training dataset and large net capacity, the domain-ind…

2018-05-21abs ↗pdf ↗

Despite significant progress, deep reinforcement learning (RL) suffers from data-inefficiency and limited generalization. Recent efforts apply meta-learning to learn a meta-learner from a set of RL tasks such that a novel but related task could be solved quickly. Though specific in some ways, different tasks in meta-RL…

2019-05-16abs ↗pdf ↗

Semi-implicit graph variational auto-encoder (SIG-VAE) is proposed to expand the flexibility of variational graph auto-encoders (VGAE) to model graph data. SIG-VAE employs a hierarchical variational framework to enable neighboring node sharing for better generative modeling of graph dependency structure, together with …

2019-08-19abs ↗pdf ↗

Sparse modeling is a powerful framework for data analysis and processing. Traditionally, encoding in this framework is performed by solving an L1-regularized linear regression problem, commonly referred to as Lasso or Basis Pursuit. In this work we combine the sparsity-inducing property of the Lasso model at the indivi…

2010-06-07abs ↗pdf ↗

A federated model learns shared archetypes from heterogeneous clients in continual learning.

problem Federated learning struggles with client heterogeneity and streaming distribution shifts.
method Clients encode their data as low-rank Hebbian operators, which are sent to a central server for aggregation and factorization into global archetypes.
result Improved global archetype reconstruction and associative retrieval in heterogeneous clients, drift, and novelty settings.

Many dynamical systems exhibit similar structure, as often captured by hand-designed simplified models that can be used for analysis and control. We develop a method for learning to correspond pairs of dynamical systems via a learned latent dynamical system. Given trajectory data from two dynamical systems, we learn a …

2019-12-06abs ↗pdf ↗

Modern discriminative predictors have been shown to match natural intelligences in specific perceptual tasks in image classification, object and part detection, boundary extraction, etc. However, a major advantage that natural intelligences still have is that they work well for "all" perceptual problems together, solvi…

2016-06-06abs ↗pdf ↗