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

52104155207 · Jun 202019922001200920172026
48 results for supervision bottleneck

Proposes Decodable Information Bottleneck for optimal representation learning.

problem Finding optimal representations for supervised learning.
method Integrates information retention and compression with the desired predictive family.
result Optimal representations lead to better expected test performance and can be estimated with guarantees.

Enhanced financial forecasting using supervised autoencoders with noise augmentation and triple labeling.

problem Improving investment strategy performance on noisy financial data.
method Supervised autoencoders with noise augmentation and triple barrier labeling.
result Supervised autoencoders with balanced noise augmentation and bottleneck size significantly boost strategy effectiveness.

We introduce a new framework for training deep generative models for high-dimensional conditional density estimation. The Bottleneck Conditional Density Estimator (BCDE) is a variant of the conditional variational autoencoder (CVAE) that employs layer(s) of stochastic variables as the bottleneck between the input xx a…

2016-11-25abs ↗pdf ↗

Self-supervised learning helps train deep features without needing lots of labeled data.

problem Annotation bottleneck in deep learning.
method Four main families of self-supervised approaches applied to various data modalities.
result Self-supervised methods can now rival fully supervised pre-training across multiple data types.

We introduce TzK (pronounced "task"), a conditional probability flow-based model that exploits attributes (e.g., style, class membership, or other side information) in order to learn tight conditional prior around manifolds of the target observations. The model is trained via approximated ML, and offers efficient appro…

2018-11-05abs ↗pdf ↗

Enhanced financial forecasting with supervised autoencoders for S&P 500 and cryptocurrencies.

problem Improving investment strategy performance in financial markets.
method Supervised autoencoders with noise augmentation and triple barrier labeling.
result Supervised autoencoders with balanced parameters significantly boost strategy effectiveness.

DAB enriches deep networks with uncertainty estimates using a codebook of training inputs.

problem Lack of uncertainty estimation in deep neural networks.
method Distance Aware Bottleneck (DAB) method that learns a codebook of training inputs.
result DAB achieves better OOD detection and misclassification prediction than prior methods.

This work analyzes how bottleneck layers and skip connections affect linear denoising autoencoders' generalization.

problem Understanding the generalization of linear denoising autoencoders in overparameterized regimes.
method Analyzes two-layer linear denoising autoencoders with a bottleneck layer and skip connection, deriving test risk formulas.
result Bottleneck layers introduce an additional complexity measure, while skip connections can mitigate variance.

Autoencoders and their variations provide unsupervised models for learning low-dimensional representations for downstream tasks. Without proper regularization, autoencoder models are susceptible to the overfitting problem and the so-called posterior collapse phenomenon. In this paper, we introduce a quantization-based …

2019-05-27abs ↗pdf ↗

Unsupervised method detects earthquakes from raw waveforms, generalizing across datasets.

problem Lack of labeled data for earthquake detection.
method Uses deep autoencoders with cross-covariance triggering at bottleneck.
result Performance comparable to supervised methods, with strong cross-dataset generalization.

Proposes a probabilistic approach to semi-supervised learning using normalizing flows.

problem Leveraging unlabelled data for semi-supervised learning with limited labelled data.
method Uses a normalizing flow to learn the posterior distribution over predictions for labelled data, serving as a prior for unlabelled data.
result Demonstrates improved performance on various tasks with varying output complexity.

Simplifies transfer learning with deep neural networks using ridge regression.

problem High computational cost of finetuning deep models for transfer learning.
method Leverage the low-rank property of deep neural networks' feature vectors in kernel ridge regression.
result Successful on supervised and semi-supervised transfer learning tasks.

Novel framework improves graph learning for out-of-distribution generalization.

problem Graph out-of-distribution generalization challenges in neural networks.
method Invariant Graph Learning based on Information bottleneck theory (InfoIGL).
result Achieves state-of-the-art performance in graph classification tasks under OOD generalization.

End-to-end approach for weak supervision improves downstream model performance.

problem Data-labeling bottleneck in machine learning applications.
method Directly learning the downstream model by maximizing its agreement with probabilistic labels generated from weak supervision sources.
result Improved performance over prior work in terms of downstream model performance and robustness.

Information bottleneck (IB) is a method for extracting information from one random variable XX that is relevant for predicting another random variable YY. To do so, IB identifies an intermediate "bottleneck" variable TT that has low mutual information I(X;T)I(X;T) and high mutual information I(Y;T)I(Y;T). The "IB curve" cha…

2018-08-23abs ↗pdf ↗

A self-supervised debiasing method using rank regularization mitigates spurious correlations in neural networks.

problem Spurious correlations cause biases in deep neural networks, affecting generalization.
method Spectral analysis of latent representations, rank regularization, self-supervised pretraining, debiasing of downstream tasks.
result The proposed framework significantly improves generalization performance and outperforms supervised debiasing approaches.

Labeling training data is a key bottleneck in the modern machine learning pipeline. Recent weak supervision approaches combine labels from multiple noisy sources by estimating their accuracies without access to ground truth labels; however, estimating the dependencies among these sources is a critical challenge. We foc…

2019-03-14abs ↗pdf ↗

The Information Plane theory predicts autoencoders do not compress input information.

problem Understanding the training dynamics of hidden layers in autoencoders.
method Derive a theoretical convergence for the Information Plane of autoencoders using a Gram-matrix based mutual information estimator.
result Ideal autoencoders with a large bottleneck layer size do not compress input information, while a small size causes compression only in the encoder layers.

Curating labeled training data has become the primary bottleneck in machine learning. Recent frameworks address this bottleneck with generative models to synthesize labels at scale from weak supervision sources. The generative model's dependency structure directly affects the quality of the estimated labels, but select…

2017-03-02abs ↗pdf ↗

Interactive weak supervision learns useful heuristics from user feedback.

problem Creating useful heuristics for large labeled datasets is tedious and subjective.
method Develops an interactive framework for learning heuristics from user feedback.
result Only a few feedback iterations are needed to train models without ground truth labels.

We propose the factorized action variational autoencoder (FAVAE), a state-of-the-art generative model for learning disentangled and interpretable representations from sequential data via the information bottleneck without supervision. The purpose of disentangled representation learning is to obtain interpretable and tr…

2019-02-22abs ↗pdf ↗

New research shows non-bottlenecked autoencoders can outperform bottlenecked ones for anomaly detection.

problem The necessity of a bottleneck in autoencoders for anomaly detection.
method Investigated two ways to remove bottlenecks: overparameterising the latent layer and introducing skip connections. Carried out extensive experiments on various AE types and datasets.
result Non-bottlenecked autoencoders can outperform bottlenecked ones, improving anomaly detection performance.

New framework predicts time series with missing values without imputation.

problem Predicting time series with missing values, especially when there's no ground truth for missing data.
method CRIB framework, combining attention mechanism and consistency regularization.
result CRIB framework predicts accurately even under high missing rates.

Wide neural networks with narrow bottlenecks behave like deep Gaussian processes.

problem Understanding the behavior of neural networks with narrow layers in the wide limit.
method Analyzing the wide limit of BNNs with narrow bottlenecks, showing they behave like a composition of GPs.
result Wide neural networks with narrow bottlenecks form a composition of GPs, termed a bottleneck NNGP.

The paper identifies overfitting as the main bottleneck in efficient deep reinforcement learning.

problem Improving sample efficiency in deep reinforcement learning.
method Empirical analysis on DMC tasks to identify overfitting as the main issue and developing a hill-climbing method targeting validation TD error.
result Overfitting is the primary bottleneck in sample-efficient deep RL, and regularization techniques can control this.

Representations of sets are challenging to learn because operations on sets should be permutation-invariant. To this end, we propose a Permutation-Optimisation module that learns how to permute a set end-to-end. The permuted set can be further processed to learn a permutation-invariant representation of that set, avoid…

2018-12-10abs ↗pdf ↗

Obtaining enough labeled data to robustly train complex discriminative models is a major bottleneck in the machine learning pipeline. A popular solution is combining multiple sources of weak supervision using generative models. The structure of these models affects training label quality, but is difficult to learn with…

2017-09-07abs ↗pdf ↗

We argue that the estimation of mutual information between high dimensional continuous random variables can be achieved by gradient descent over neural networks. We present a Mutual Information Neural Estimator (MINE) that is linearly scalable in dimensionality as well as in sample size, trainable through back-prop, an…

2018-01-12abs ↗pdf ↗

Survey of QML applications on near-term quantum devices.

problem Achieving quantum advantage on real-world applications.
method Analysis of supervised and unsupervised techniques, including encoding, ansatz structure, error mitigation, and gradient methods.
result Current QML implementations on quantum hardware face limitations but show potential for real-world applications.

Softmax is an output activation function for modeling categorical probability distributions in many applications of deep learning. However, a recent study revealed that softmax can be a bottleneck of representational capacity of neural networks in language modeling (the softmax bottleneck). In this paper, we propose an…

2018-05-28abs ↗pdf ↗