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

246492738984 · Jun 202019922001200920172026
48 results for progressive networks

Deep neural networks solve Raven's Progressive Matrices with high accuracy.

problem Testing relational reasoning in machine learning systems.
method Combining Wild Relation Networks with Multi-Layer Relation Networks and introducing Magnitude Encoding.
result Deep neural networks achieve 98.0 percent accuracy, significantly improving over previous methods.

Proposes faster neural network learning by using subsets of training data.

problem Manual design and validation of network topologies is time-consuming.
method Exploits subsets of training data at each incremental training step and performs online hyperparameter selection.
result Significantly reduces overall training time while maintaining performance.

The paper investigates how neural network weights evolve to monitor training progress.

problem Monitoring the training progress of neural networks in a cost-effective manner.
method Investigates the evolution of neural network weights in weight space.
result DNN models evolve on unique, smooth trajectories in weight space that can be used to track training progress.

AL2 progressively penalizes network activations to prevent overfitting.

problem Avoiding overfitting in neural networks with limited training data.
method Progressive Activation Loss (PAL) method to regularize network representations.
result AL2 outperforms traditional regularization methods on benchmark datasets.

A plethora of recent research has focused on improving the memory footprint and inference speed of deep networks by reducing the complexity of (i) numerical representations (for example, by deterministic or stochastic quantization) and (ii) arithmetic operations (for example, by binarization of weights). We propose a s…

2019-04-03abs ↗pdf ↗

We introduce a novel generative autoencoder network model that learns to encode and reconstruct images with high quality and resolution, and supports smooth random sampling from the latent space of the encoder. Generative adversarial networks (GANs) are known for their ability to simulate random high-quality images, bu…

2018-07-09abs ↗pdf ↗

Extracting a curriculum from a teacher network improves distillation efficiency.

problem Efficiently training a small network using a large teacher network's output.
method Random projection of teacher network's hidden representations to progressively train the student network.
result Extracted curriculum significantly outperforms one-shot distillation and achieves similar performance to progressive distillation.

We develop an algorithm for systematic design of a large artificial neural network using a progression property. We find that some non-linear functions, such as the rectifier linear unit and its derivatives, hold the property. The systematic design addresses the choice of network size and regularization of parameters. …

2017-10-23abs ↗pdf ↗

This paper explores the trade-off between spatial and adversarial robustness in neural networks.

problem Understanding the trade-off between spatial and adversarial robustness in neural networks.
method Quantitative analysis and empirical testing with curriculum learning.
result Spatial robustness and adversarial robustness are quantitatively related and can be improved simultaneously.

Graph convolutional neural networks (GCNNs) have been attracting increasing research attention due to its great potential in inference over graph structures. However, insufficient effort has been devoted to the aggregation methods between different convolution graph layers. In this paper, we introduce a graph attribute…

2019-05-14abs ↗pdf ↗

Deep neural network algorithms are difficult to analyze because they lack structure allowing to understand the properties of underlying transforms and invariants. Multiscale hierarchical convolutional networks are structured deep convolutional networks where layers are indexed by progressively higher dimensional attrib…

2017-03-12abs ↗pdf ↗

This paper improves disentanglement in VAEs by progressively learning hierarchical representations.

problem Compromised disentanglement in VAEs due to high-level abstraction extraction.
method Progressive learning of independent hierarchical representations from high to low levels.
result Improved disentanglement demonstrated on two benchmark datasets using new metrics.

AdaptiveNet tackles disease progression prediction in rheumatoid arthritis using deep neural networks.

problem Predicting disease progression in rheumatoid arthritis using clinical data.
method AdaptiveNet, a novel recurrent neural network architecture, that handles multiple lists of different events and missing data.
result AdaptiveNet outperforms classical baselines in disease progression prediction.

PFPN improves salient object detection by progressively polishing multi-level features.

problem Improving salient object detection by refining multi-level features.
method Progressive Feature Polishing Network (PFPN) with Feature Polishing Modules (FPMs).
result PFPN achieves superior performance on five benchmark datasets without post-processing.

Despite the advancement of supervised image recognition algorithms, their dependence on the availability of labeled data and the rapid expansion of image categories raise the significant challenge of zero-shot learning. Zero-shot learning (ZSL) aims to transfer knowledge from labeled classes into unlabeled classes to r…

2018-05-18abs ↗pdf ↗

Health professionals can use natural language processing (NLP) technologies when reviewing electronic health records (EHR). Machine learning free-text classifiers can help them identify problems and make critical decisions. We aim to develop deep learning neural network algorithms that identify EHR progress notes perta…

2018-09-16abs ↗pdf ↗

SCL discovers compositional structures in analogical reasoning tasks.

problem Discovering compositional structures in analogical reasoning tasks like Raven's Progressive Matrices.
method Proposes Scattering Compositional Learner (SCL) that composes neural networks in sequence.
result Achieves state-of-the-art performance on RPM datasets with significant improvements.

Proposes a neural network for dynamic risk prediction of AMD using longitudinal fundus images.

problem Dynamic risk prediction for progressive eye disorders like AMD.
method tdCoxSNN, a time-dependent Cox survival neural network integrating CNN.
result Demonstrates commendable predictive performance in AMD and PBC datasets.

A method for optimal Bayesian filtering using progressive particle flow and optimal transport maps.

problem Optimizing Bayesian filtering with deterministic particles to avoid degeneration.
method Progressive flow of particles through a sequence of sub-steps, each using an optimal transport map to replace non-equally weighted particles with equally weighted ones.
result The method avoids particle degeneration and simplifies the filtering process by not requiring inversions or monotonicity constraints.

We introduce a conceptually simple and scalable framework for continual learning domains where tasks are learned sequentially. Our method is constant in the number of parameters and is designed to preserve performance on previously encountered tasks while accelerating learning progress on subsequent problems. This is a…

2018-05-16abs ↗pdf ↗

Deep neural networks progressively transform their inputs across multiple processing layers. What are the geometrical properties of the representations learned by these networks? Here we study the intrinsic dimensionality (ID) of data-representations, i.e. the minimal number of parameters needed to describe a represent…

2019-05-29abs ↗pdf ↗

SPINN optimizes neural network inference on devices and cloud.

problem Inference on mobile devices is challenging due to high computational demands and dynamic connectivity.
method Synergistic progressive inference with a novel scheduler.
result SPINN achieves up to 2x higher throughput and reduces server cost by up to 6.8x.

Arguably, unsupervised learning plays a crucial role in the majority of algorithms for processing brain imaging. A recently introduced unsupervised approach Deep InfoMax (DIM) is a promising tool for exploring brain structure in a flexible non-linear way. In this paper, we investigate the use of variants of DIM in a se…

2019-04-24abs ↗pdf ↗

HMRNN combines HMMs and neural networks for Alzheimer's disease forecasting.

problem Improving disease progression modeling with hidden states not fully known.
method Developed HMRNN combining HMMs and recurrent neural networks.
result HMRNN improves disease forecasting and offers novel clinical interpretation.

In this article, we investigate when the set of primitive geodesic lengths on a Riemannian manifold have arbitrarily long arithmetic progressions. We prove that in the space of negatively curved metrics, a metric having such arithmetic progressions is quite rare. We introduce almost arithmetic progressions, a coarsific…

2014-01-29abs ↗pdf ↗

Bayesian meta-learning predicts Alzheimer's disease progression.

problem Predicting individual Alzheimer's disease progression from limited data.
method Bayesian meta-learning approach that dynamically predicts disease score distributions.
result Bayesian meta-learner outperforms single-task models and deterministic meta-learners, especially for long-term predictions.

Deep networks achieve linear separability through progressive folding of data in higher dimensions.

problem How feed-forward networks achieve linear separability for classification tasks.
method Progressive folding of the data manifold in unoccupied higher dimensions.
result The folding operation allows efficient solutions by providing access to arbitrary regions in the distribution.

HOPE uses Hilbert space to deconstruct deep network representations.

problem Deconstructing learned representations in deep networks is challenging.
method Introduces Hilbert Operator for Progressive Encoding (HOPE) to deconstruct network weights.
result HOPE provides an unbiased approach to network compression and fine-tuning.

Summarizes key algorithmic trading problems and recent advances.

problem Optimal execution, placement, and price impact in algorithmic trading.
method Discusses recent advances in algorithmic trading using Machine Learning techniques.
result Recent progress in algorithmic trading includes the use of Deep Learning, Reinforcement Learning, and Generative Adversarial Networks.

It is widely believed that the success of deep convolutional networks is based on progressively discarding uninformative variability about the input with respect to the problem at hand. This is supported empirically by the difficulty of recovering images from their hidden representations, in most commonly used network …

2018-02-20abs ↗pdf ↗

Machine learning has made tremendous progress in recent years and received large amounts of public attention. Though we are still far from designing a full artificially intelligent agent, machine learning has brought us many applications in which computers solve human learning tasks remarkably well. Much of this progre…

2019-08-22abs ↗pdf ↗