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.

169,051 papers · 148 categories

Trend · papers per month

68136204272 · Jun 202019922001200920172026
48 results for two-network architecture

A two-network architecture learns intractable exponential family models.

problem Learning a model itself, not just optimizing parameters of a single distribution.
method Two-network architecture and optimization procedure for exponential family models.
result Accurately learns exponential family models, enabling generic operations.

JoCoR improves deep learning with noisy labels by reducing network diversity.

problem Learning with noisy labels in deep learning.
method JoCoR uses two networks to make predictions, calculates a joint loss with Co-Regularization, and updates both networks simultaneously.
result JoCoR outperforms state-of-the-art approaches in learning with noisy labels.

MSNet uses high frequency residual learning for efficient multi-scale image classification.

problem Efficient multi-scale image classification for mobile and embedded devices.
method Two network architecture: low resolution for low frequency, high resolution for high frequency residuals.
result MSNet achieves significant accuracy improvements over different base networks.

NetOTC compares and aligns directed or undirected networks via random walk transitions.

problem Comparing and aligning networks of different types and sizes.
method NetOTC uses a transport-based approach to find optimal transition couplings of random walks.
result NetOTC quantifies network differences and provides vertex and edge alignments.

We follow the main stocks belonging to the New York Stock Exchange and to Nasdaq from 2003 to 2012, through years of normality and of crisis, and study the dynamics of networks built on two measures expressing relations between those stocks: correlation, which is symmetric and measures how similar two stocks behave, an…

2014-08-07abs ↗pdf ↗

Recurrent neural networks like long short-term memory (LSTM) are important architectures for sequential prediction tasks. LSTMs (and RNNs in general) model sequences along the forward time direction. Bidirectional LSTMs (Bi-LSTMs) on the other hand model sequences along both forward and backward directions and are gene…

2017-11-15abs ↗pdf ↗

IMM generates high-quality samples in few steps with stable training.

problem Slow inference and instability in generating high-quality samples using diffusion models and Flow Matching.
method Inductive Moment Matching (IMM) is a new generative model for one- or few-step sampling with a single-stage training procedure.
result IMM achieves state-of-the-art 2-step FID of 1.98 on CIFAR-10 for a model trained from scratch.

This paper proposes a new algorithmic framework, predictor-verifier training, to train neural networks that are verifiable, i.e., networks that provably satisfy some desired input-output properties. The key idea is to simultaneously train two networks: a predictor network that performs the task at hand,e.g., predicting…

2018-05-25abs ↗pdf ↗

A new test statistic counts tree co-occurrences to detect edge correlation between networks.

problem Detecting edge correlation between networks using latent vertex correspondence.
method The test statistic is based on counting co-occurrences of signed trees for a family of non-isomorphic trees.
result The test runs in n2+o(1)n^{2+o(1)} time and succeeds with high probability for large nn.

Learning with noisy labels is one of the hottest problems in weakly-supervised learning. Based on memorization effects of deep neural networks, training on small-loss instances becomes very promising for handling noisy labels. This fosters the state-of-the-art approach "Co-teaching" that cross-trains two deep neural ne…

2019-01-14abs ↗pdf ↗

The paper tests for association between latent community memberships in multi-view network data.

problem Evaluating the independence of latent community memberships in multi-view network data.
method Extended stochastic block model for two-view network data, developed a new hypothesis test.
result Evidence of weak association between latent community memberships in binary interaction and co-complex association data.

Transforms between neural networks using manifold-learning techniques.

problem Establish equivalence between different neural networks.
method Diffusion maps with a Mahalanobis-like metric to construct transformations between network outputs and internal neuron activations.
result Established equivalence classes between neural networks trained on various data types.

This paper proposes an online knowledge distillation method that transfers feature map information in addition to class probabilities.

problem Previous online knowledge distillation methods only utilized class probabilities, missing feature map information.
method Adversarial training framework to transfer feature map information; multiple networks trained simultaneously with discriminators.
result Our method performs better than direct alignment methods and is more suitable for online distillation.

NeuroDiff improves neural network equivalence verification with fine-grained approximations.

problem Verifying the equivalence of compressed neural networks.
method Symbolic and fine-grained approximation technique for differential verification.
result NeuroDiff achieves up to 1000X speedup and 5X accuracy improvement.

Calendar graph neural networks model user behavior with location and time data.

problem Modeling user behavior with location and time information for demographic prediction.
method Graph neural networks with a tripartite network of items, sessions, and locations, and a hierarchical calendar network.
result User embeddings preserve spatial and temporal patterns of various periodicity.

GANs involve training two networks in an adversarial game, where each network's task depends on its adversary. Recently, several works have framed GAN training as an online or continual learning problem. We focus on the discriminator, which must perform classification under an (adversarially) shifting data distribution…

2018-10-27abs ↗pdf ↗

This study presents a new lossy image compression method that utilizes the multi-scale features of natural images. Our model consists of two networks: multi-scale lossy autoencoder and parallel multi-scale lossless coder. The multi-scale lossy autoencoder extracts the multi-scale image features to quantized variables a…

2018-05-16abs ↗pdf ↗

A new method compares synthetic power networks to actual ones using multiscale flat norm.

problem Comparing synthetic power networks to actual ones due to lack of correspondence.
method Proposes a multiscale flat norm approach to compute distance between networks.
result The flat norm distance captures variations more accurately than Hausdorff distance.

We introduce the adversarially learned inference (ALI) model, which jointly learns a generation network and an inference network using an adversarial process. The generation network maps samples from stochastic latent variables to the data space while the inference network maps training examples in data space to the sp…

2016-06-02abs ↗pdf ↗

We applied Generative Adversarial Networks (GANs) to learn a model of DOOM levels from human-designed content. Initially, we analysed the levels and extracted several topological features. Then, for each level, we extracted a set of images identifying the occupied area, the height map, the walls, and the position of ga…

2018-04-24abs ↗pdf ↗

Autonomous driving requires 3D perception of vehicles and other objects in the in environment. Much of the current methods support 2D vehicle detection. This paper proposes a flexible pipeline to adopt any 2D detection network and fuse it with a 3D point cloud to generate 3D information with minimum changes of the 2D d…

2018-02-12abs ↗pdf ↗

We study graph matching with correlated Gaussian features and find thresholds for exact recovery.

problem Graph matching with correlated Gaussian features.
method Information-theoretic thresholds and conditions for exact and almost exact recovery.
result Contextual information introduces a richer structure, with thresholds for exact and almost exact recovery no longer coinciding.

Develops a novel method to estimate non-Gaussian hydraulic conductivities efficiently.

problem Estimation of non-Gaussian hydraulic conductivity fields in subsurface flow models.
method Integrates adversarial autoencoders with residual dense convolutional networks for parameterization and surrogate modeling.
result Significantly reduces computation time for accurate inversion results.

Neural networks can memorize and learn complex functions with minimal parameters.

problem Learning and memorizing complex functions with neural networks using minimal parameters.
method SGD on depth two neural networks with near optimal network size and parameters.
result SGD on depth two network can memorize and learn polynomials with bounded weights and certain kernel spaces.

Extracts controllable models from videos of real-world activities.

problem Creating realistic and controllable character models from video data.
method Two networks: one for pose and control signal to next pose, and another for pose, new pose, and background to output frame.
result High-quality, controllable character models can be generated from arbitrary videos.

Adversarial examples are maliciously tweaked images that can easily fool machine learning techniques, such as neural networks, but they are normally not visually distinguishable for human beings. One of the main approaches to solve this problem is to retrain the networks using those adversarial examples, namely adversa…

2018-07-21abs ↗pdf ↗

Consider two networks on overlapping, non-identical vertex sets. Given vertices of interest in the first network, we seek to identify the corresponding vertices, if any exist, in the second network. While in moderately sized networks graph matching methods can be applied directly to recover the missing correspondences,…

2017-05-01abs ↗pdf ↗