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

Trend · papers per month

3386771,0151,353 · Jun 202019922001200920172026
48 results for Unsupervised Neural Network Training

Paper shows pre-training and transfer learning reduce sample complexity for neural networks.

problem Training high-dimensional supervised learning with limited labeled data.
method Study of single-layer neural networks via online stochastic gradient descent, considering concept shift.
result Pre-training and transfer learning reduce sample complexity by polynomial factors under general assumptions.

An unsupervised deep learning method solves PIDEs for option pricing.

problem Solving partial integro-differential equations for financial option pricing.
method Employing unsupervised deep learning to directly solve PIDEs without requiring labeled data.
result An unsupervised neural network accurately solves PIDEs and calculates derivatives and integrals.

This paper introduces GEMINI, a new metric for unsupervised neural network training that avoids the need for regularizations.

problem The mutual information (MI) as a clustering objective does not lead to satisfactory clusters.
method The authors generalised the mutual information by changing its core distance, introducing the Generalised Mutual Information (GEMINI).
result Some GEMINIs do not require regularizations when training and can automatically select the number of clusters.

This paper introduces GEMINI, a new mutual information metric for unsupervised neural network training.

problem The mutual information (MI) as a clustering objective does not lead to satisfactory clusters.
method The authors generalised MI by changing its core distance, introducing GEMINIs that do not require regularizations and can automatically select the number of clusters.
result GEMINIs can automatically select the number of clusters without requiring a priori knowledge of the number of clusters.

We present an unsupervised training approach for a neural network-based mask estimator in an acoustic beamforming application. The network is trained to maximize a likelihood criterion derived from a spatial mixture model of the observations. It is trained from scratch without requiring any parallel data consisting of …

2019-04-02abs ↗pdf ↗

Unified analysis of self-training for deep networks on unlabeled data.

problem Theoretical understanding of self-training for deep networks on unlabeled data.
method Unified theoretical analysis using expansion assumption and input-consistency regularization.
result Proves high accuracy of minimizers of population objectives based on self-training and input-consistency regularization.

The use of unsupervised data in addition to supervised data in training discriminative neural networks has improved the performance of this clas- sification scheme. However, the best results were achieved with a training process that is divided in two parts: first an unsupervised pre-training step is done for initializ…

2016-11-07abs ↗pdf ↗

E2^2CM uses class means for efficient early exits in neural networks.

problem Efficient early exits in neural networks with low computational cost.
method Early Exit Class Means (E2^2CM) based on class means of samples, without gradient-based training.
result E2^2CM achieves higher accuracy with fixed training time budget and boosts existing early exit schemes.

Analyzes unsupervised neural networks using statistical mechanics and Monte Carlo simulations.

problem Understanding computational capabilities of unsupervised neural networks.
method Statistical mechanics approach and Monte Carlo simulations.
result Obtained a phase diagram summarizing network performance.

Deep Learning Accelerators are prone to faults which manifest in the form of errors in Neural Networks. Fault Tolerance in Neural Networks is crucial in real-time safety critical applications requiring computation for long durations. Neural Networks with high regularisation exhibit superior fault tolerance, however, at…

2019-07-06abs ↗pdf ↗

Convolutional networks have marked their place over the last few years as the best performing model for various visual tasks. They are, however, most suited for supervised learning from large amounts of labeled data. Previous attempts have been made to use unlabeled data to improve model performance by applying unsuper…

2016-11-21abs ↗pdf ↗

Convolutional networks have marked their place over the last few years as the best performing model for various visual tasks. They are, however, most suited for supervised learning from large amounts of labeled data. Previous attempts have been made to use unlabeled data to improve model performance by applying unsuper…

2016-10-02abs ↗pdf ↗

In recent years, deep learning methods applying unsupervised learning to train deep layers of neural networks have achieved remarkable results in numerous fields. In the past, many genetic algorithms based methods have been successfully applied to training neural networks. In this paper, we extend previous work and pro…

2017-11-21abs ↗pdf ↗

We propose a new model for unsupervised document embedding. Leading existing approaches either require complex inference or use recurrent neural networks (RNN) that are difficult to parallelize. We take a different route and develop a convolutional neural network (CNN) embedding model. Our CNN architecture is fully par…

2017-11-11abs ↗pdf ↗

This work addresses encoding biases in neural networks by tailoring models with unsupervised losses.

problem Improving neural network representations and reducing the generalization gap.
method Inspired by transductive learning, the authors propose tailoring and meta-tailoring to optimize unsupervised losses during prediction time.
result Models trained with tailoring and meta-tailoring perform better on the task objective after adapting to unsupervised losses.

Proposes an unsupervised graph neural network for entire graph representation.

problem Lack of unsupervised methods for entire graph representation.
method Combines hierarchical graph neural networks and mutual information maximization.
result Improves state-of-the-art performance on multiple graph level tasks.

We combine supervised learning with unsupervised learning in deep neural networks. The proposed model is trained to simultaneously minimize the sum of supervised and unsupervised cost functions by backpropagation, avoiding the need for layer-wise pre-training. Our work builds on the Ladder network proposed by Valpola (…

2015-07-09abs ↗pdf ↗

Study compares different levels of supervision for training graph embeddings in wireless networks.

problem Improving power control in wireless interference networks.
method Training graph neural networks (GNNs) with different levels of supervision (supervised, unsupervised, self-supervised).
result Different levels of supervision impact system-level throughput, convergence, and generalization.

In this paper, we present neuro-robotics models with a deep artificial neural network capable of generating finger counting positions and number estimation. We first train the model in an unsupervised manner where each layer is treated as a Restricted Boltzmann Machine or an autoencoder. Such a model is further trained…

2019-07-09abs ↗pdf ↗

Training neural networks involves solving large-scale non-convex optimization problems. This task has long been believed to be extremely difficult, with fear of local minima and other obstacles motivating a variety of schemes to improve optimization, such as unsupervised pretraining. However, modern neural networks are…

2014-12-19abs ↗pdf ↗

Convolutional neural networks provide visual features that perform remarkably well in many computer vision applications. However, training these networks requires significant amounts of supervision. This paper introduces a generic framework to train deep networks, end-to-end, with no supervision. We propose to fix a se…

2017-04-18abs ↗pdf ↗

Study compares deep feature methods for anomaly detection in limited data scenarios.

problem Handling limited data in industrial inspection applications.
method Three approaches (KNN, Mahalanobis, PaDiM) using pre-trained deep features with data augmentation.
result Data augmentation significantly improves performance in small data regimes.

This paper presents two unsupervised learning layers (UL layers) for label-free video analysis: one for fully connected layers, and the other for convolutional ones. The proposed UL layers can play two roles: they can be the cost function layer for providing global training signal; meanwhile they can be added to any re…

2017-05-24abs ↗pdf ↗

In this paper we take a problem of unsupervised nodes clustering on graphs and show how recent advances in attention models can be applied successfully in a "hard" regime of the problem. We propose an unsupervised algorithm that encodes Bethe Hessian embeddings by optimizing soft modularity loss and argue that our mode…

2019-05-20abs ↗pdf ↗

A major goal of unsupervised learning is to discover data representations that are useful for subsequent tasks, without access to supervised labels during training. Typically, this involves minimizing a surrogate objective, such as the negative log likelihood of a generative model, with the hope that representations us…

2018-03-31abs ↗pdf ↗

Unsupervised pre-training improves model generalization, but lacks theoretical understanding.

problem Lack of theoretical understanding of unsupervised pre-training's impact on model generalization.
method Introduces a novel theoretical framework to analyze and enhance generalization.
result Enhances understanding of unsupervised pre-training and fine-tuning, proposing a new regularization method.

We study the emergence of sparse representations in neural networks. We show that in unsupervised models with regularization, the emergence of sparsity is the result of the input data samples being distributed along highly non-linear or discontinuous manifold. We also derive a similar argument for discriminatively trai…

2019-03-07abs ↗pdf ↗

New method shows supervised learning can mimic unsupervised learning effectively.

problem The fundamental difference between supervised and unsupervised learning.
method A two-stage procedure where unsupervised model selection is followed by adding outputs without changing parameters.
result Asymptotic out-of-sample risk bounds for various models trained without access to labels.

Medical image registration is one of the key processing steps for biomedical image analysis such as cancer diagnosis. Recently, deep learning based supervised and unsupervised image registration methods have been extensively studied due to its excellent performance in spite of ultra-fast computational time compared to …

2019-07-02abs ↗pdf ↗

We introduce Natural Neural Networks, a novel family of algorithms that speed up convergence by adapting their internal representation during training to improve conditioning of the Fisher matrix. In particular, we show a specific example that employs a simple and efficient reparametrization of the neural network weigh…

2015-07-01abs ↗pdf ↗

This work bridges competitive learning with gradient-based learning for faster feature extraction.

problem Lack of powerful feature extractors in competitive learning methods.
method Introduces gradient-based competitive layers for feature extraction.
result Demonstrates theoretical equivalence and faster convergence of gradient-based competitive layers.

The success of deep learning has been due, in no small part, to the availability of large annotated datasets. Thus, a major bottleneck in current learning pipelines is the time-consuming human annotation of data. In scenarios where such input-output pairs cannot be collected, simulation is often used instead, leading t…

2018-05-31abs ↗pdf ↗