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

4168331,2491,665 · Jun 202019922001200920172026
48 results for Flexible Representation Learning

This paper explores how representation learning can improve design-based causal inference.

problem Estimating causal effects in design-based studies is challenging due to the need for optimal weights.
method The authors propose an end-to-end estimation procedure that learns a flexible representation to minimize the error in choosing a representation.
result The proposed method is competitive in various causal inference tasks and shows promise for improving design-based weights.

We consider the problem of learning representations that achieve group and subgroup fairness with respect to multiple sensitive attributes. Taking inspiration from the disentangled representation learning literature, we propose an algorithm for learning compact representations of datasets that are useful for reconstruc…

2019-06-06abs ↗pdf ↗

Graph convolutional deep kernel machine learns representations for graph tasks.

problem Limited representation learning in infinite-width neural networks.
method Developed a graph convolutional deep kernel machine as an infinite-width limit.
result Representation learning improves performance for heterophilous node classification tasks.

Proposes a variational autoencoder for long-term customer revenue forecasting.

problem Predicting long-term customer revenue from sparse and irregular transaction data.
method Variational Autoencoder (VAE) with flexible latent representation.
result Improves upon latest benchmarks in multiple real-world datasets.

Graph convolutional networks adapt the architecture of convolutional neural networks to learn rich representations of data supported on arbitrary graphs by replacing the convolution operations of convolutional neural networks with graph-dependent linear operations. However, these graph-dependent linear operations are d…

2017-11-03abs ↗pdf ↗

Deep learning methods capable of handling relational data have proliferated over the last years. In contrast to traditional relational learning methods that leverage first-order logic for representing such data, these deep learning methods aim at re-representing symbolic relational data in Euclidean spaces. They offer …

2019-03-29abs ↗pdf ↗

Proposes a flexible method for learning latent causal representations.

problem Limited applicability of existing causal representation learning methods.
method Imposes constraints on function classes and relaxes identifiability conditions.
result Establishes partial identifiability results under weaker conditions.

Goal-directed manipulation of representations is a key element of human flexible behaviour, while consciousness is often related to several aspects of higher-order cognition and human flexibility. Currently these two phenomena are only partially integrated (e.g., see Neurorepresentationalism) and this (a) limits our un…

2019-12-31abs ↗pdf ↗

Humans and animals show remarkable flexibility in adjusting their behaviour when their goals, or rewards in the environment change. While such flexibility is a hallmark of intelligent behaviour, these multi-task scenarios remain an important challenge for machine learning algorithms and neurobiological models alike. We…

2019-06-18abs ↗pdf ↗

Proposes TCWAE to learn disentangled representations using the Wasserstein Autoencoder.

problem Balancing reconstruction fidelity and disentanglement in learning representations.
method TCWAE (Total Correlation Wasserstein Autoencoder) using different KL estimators.
result Competitive results on data sets with known generative factors, and improved reconstructions on unknown factors.

The paper tackles model collapse in GPLVMs by improving kernel flexibility and projection variance.

problem Model collapse in GPLVMs leading to vague latent representations.
method Theoretical analysis of projection variance, integration of SM and RFF kernels, and variational inference.
result The advisedRFLVM outperforms competing models in informative latent representations and missing data imputation.

We propose a method to learn causal response representations through direct effect analysis.

problem Uncovering direct causal effects in complex, multivariate settings.
method Our method bridges conditional independence testing with causal representation learning, formulating an optimisation problem to maximise evidence against conditional independence.
result The largest eigenvalue distribution can be bounded by an FF-distribution, providing testable conditional independence.

Symile learns joint representations across multiple modalities, outperforming pairwise CLIP.

problem Pairwise contrastive learning fails to capture joint information between multiple modalities.
method Symile uses a flexible, architecture-agnostic objective to learn modality-specific representations by deriving a lower bound on total correlation.
result Symile outperforms pairwise CLIP on cross-modal classification and retrieval across various datasets.

We study the problem of learning permutation invariant representations that can capture "flexible" notions of containment. We formalize this problem via a measure theoretic definition of multisets, and obtain a theoretically-motivated learning model. We propose training this model on a novel task: predicting the size o…

2019-11-19abs ↗pdf ↗

Enhances source domain knowledge with target data for transfer learning.

problem Limited data in target domains and rigid model assumptions in transfer learning.
method Transfer learning through Enhanced Sufficient Representation (TESR).
result TESR enhances source domain knowledge with target data, improving transfer learning performance.

Deep learning methods have recently made notable advances in the tasks of classification and representation learning. These tasks are important for brain imaging and neuroscience discovery, making the methods attractive for porting to a neuroimager's toolbox. Success of these methods is, in part, explained by the flexi…

2013-12-20abs ↗pdf ↗

Flexible evidential deep learning improves uncertainty quantification in machine learning.

problem Overconfident predictions in machine learning models can lead to serious consequences.
method Proposes flexible evidential deep learning (F-EDL) to model uncertainty over class probabilities using a flexible Dirichlet distribution.
result Empirically demonstrates state-of-the-art uncertainty quantification performance across diverse scenarios.

Prediction tasks over nodes and edges in networks require careful effort in engineering features used by learning algorithms. Recent research in the broader field of representation learning has led to significant progress in automating prediction by learning the features themselves. However, present feature learning ap…

2016-07-03abs ↗pdf ↗

Unified approach for interpretable regression with flexible modeling.

problem Combining predictive adaptivity with interpretability in heterogeneous data.
method Combining random Fourier features, spectral feature map, principal component analysis, Gaussian mixture model, and cluster-specific generalized additive models.
result Consistently improves upon classical and black-box models across benchmark datasets.

In practice, there are often explicit constraints on what representations or decisions are acceptable in an application of machine learning. For example it may be a legal requirement that a decision must not favour a particular group. Alternatively it can be that that representation of data must not have identifying in…

2015-11-18abs ↗pdf ↗

Unified framework for learning flexible probabilistic programs using DPP and PAC-Bayes bounds.

problem Learning and generalizing from complex probabilistic models.
method Unified DPP representation and PAC-Bayes bounds for stochastic programs.
result Improved performance and generalization prediction using flexible DPP model representations and learned complexity measures.

Kernel methods have great promise for learning rich statistical representations of large modern datasets. However, compared to neural networks, kernel methods have been perceived as lacking in scalability and flexibility. We introduce a family of fast, flexible, lightly parametrized and general purpose kernel learning …

2014-12-19abs ↗pdf ↗

Contrastive unsupervised representation learning (CURL) is the state-of-the-art technique to learn representations (as a set of features) from unlabelled data. While CURL has collected several empirical successes recently, theoretical understanding of its performance was still missing. In a recent work, Arora et al. (2…

2019-10-10abs ↗pdf ↗

SC-InfoNCE improves InfoNCE for feature clustering in contrastive learning.

problem Lack of theoretical understanding of InfoNCE's feature clustering mechanism.
method Introduced a transition probability matrix to model data augmentation dynamics and optimize feature similarity.
result SC-InfoNCE achieves strong performance across diverse domains, aligning feature similarity with downstream data.

We introduce a new approach to learning in hierarchical latent-variable generative models called the "distributed distributional code Helmholtz machine", which emphasises flexibility and accuracy in the inferential process. In common with the original Helmholtz machine and later variational autoencoder algorithms (but …

2018-05-28abs ↗pdf ↗

DeepCTRL integrates rules into deep learning models, allowing flexible control at inference.

problem Lack of flexibility in incorporating rules into deep learning models.
method Integrates rule representations into deep neural networks, enabling flexible control at inference.
result Improves rule verification ratio and accuracy gains at downstream tasks.

Enhances deep kernel learning with stochastic latent variables for better model regularization.

problem Weak model regularization in deep kernel learning, especially on small datasets.
method Introduces DLVKL model with stochastic latent variables, NSDE for expressive posterior, and hybrid prior.
result DLVKL-NSDE outperforms existing deep GPs on large datasets.

Method enhances anomaly detection using contrastive learning and out-of-distribution data.

problem Improving anomaly detection in datasets with limited out-of-distribution data.
method Proposes a contrastive learning method that incorporates out-of-distribution data to enhance anomaly detection performance.
result The method significantly improves anomaly detection performance, even with limited out-of-distribution data.

We present Deep Generalized Canonical Correlation Analysis (DGCCA) -- a method for learning nonlinear transformations of arbitrarily many views of data, such that the resulting transformations are maximally informative of each other. While methods for nonlinear two-view representation learning (Deep CCA, (Andrew et al.…

2017-02-08abs ↗pdf ↗

Recent character and phoneme-based parametric TTS systems using deep learning have shown strong performance in natural speech generation. However, the choice between character or phoneme input can create serious limitations for practical deployment, as direct control of pronunciation is crucial in certain cases. We dem…

2018-11-17abs ↗pdf ↗

We study how finite Bayesian neural networks adapt their hidden representations.

problem Understanding how finite Bayesian neural networks differ from infinite ones.
method We analyze the asymptotics of learned feature kernels for various network architectures.
result The leading finite-width corrections to feature kernels have a universal form.

Recent deep learning approaches for representation learning on graphs follow a neighborhood aggregation procedure. We analyze some important properties of these models, and propose a strategy to overcome those. In particular, the range of "neighboring" nodes that a node's representation draws from strongly depends on t…

2018-06-09abs ↗pdf ↗