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

2815628421,123 · Jun 202019922001200920172026
48 results for dual deep networks

GPs with neural network dual kernels improve reinforcement learning performance.

problem Combining the strengths of DNNs and GPs for reinforcement learning.
method Apply GPs with neural network dual kernels to solve reinforcement learning tasks.
result GPs with neural network dual kernels perform at least as well as conventional methods on the mountain-car problem.

In this paper, we present a reverberation removal approach for speaker verification, utilizing dual-label deep neural networks (DNNs). The networks perform feature mapping between the spectral features of reverberant and clean speech. Long short term memory recurrent neural networks (LSTMs) are trained to map corrupted…

2018-09-08abs ↗pdf ↗

DS2CF-Net learns hierarchical representations with deep coupled factorization and enriched prior.

problem Learning deep hierarchical representations from data.
method Dual-constrained Deep Semi-Supervised Coupled Factorization Network (DS2CF-Net) with enriched prior.
result DS2CF-Net achieves state-of-the-art performance in representation learning and clustering.

Proposes TgNN-LD to improve neural network effectiveness and efficiency.

problem Limits in maintaining tradeoff between data and domain knowledge.
method Converts loss function to constrained form with PDEs, ECs, and EK as constraints, incorporating Lagrangian variables for equitable tradeoff.
result Improves prediction accuracy and conserves resources.

Method converts neural networks to function space for better uncertainty quantification.

problem Lack of uncertainty estimates and difficulty in incorporating new data in deep neural networks.
method Dual parameterization to convert from weight space to function space, enabling sparse representation.
result Compact and principled way to capture uncertainty and incorporate new data.

In this work, we propose a deep neural network architecture motivated by primal-dual splitting methods from convex optimization. We show theoretically that there exists a close relation between the derived architecture and residual networks, and further investigate this connection in numerical experiments. Moreover, we…

2018-06-15abs ↗pdf ↗

In recent years, there has been a surge of interest in developing deep learning methods for non-Euclidean structured data such as graphs. In this paper, we propose Dual-Primal Graph CNN, a graph convolutional architecture that alternates convolution-like operations on the graph and its dual. Our approach allows to lear…

2018-06-03abs ↗pdf ↗

We present, for the first time, a novel deep neural network architecture called \dcn with a dual-path connection between the input image and output class label for mammogram image processing. This architecture is built upon U-Net, which non-linearly maps the input data into a deep latent space. One path of the \dcnn, t…

2019-03-01abs ↗pdf ↗

The clustering methods have recently absorbed even-increasing attention in learning and vision. Deep clustering combines embedding and clustering together to obtain optimal embedding subspace for clustering, which can be more effective compared with conventional clustering methods. In this paper, we propose a joint lea…

2019-04-30abs ↗pdf ↗

Magnetic resonance imaging (MRI) is known to be a slow imaging modality and undersampling in k-space has been used to increase the imaging speed. However, image reconstruction from undersampled k-space data is an ill-posed inverse problem. Iterative algorithms based on compressed sensing have been used to address the i…

2019-08-07abs ↗pdf ↗

A new deep learning framework selects representative samples for unsupervised learning.

problem Selecting representative samples for unsupervised learning in non-linear data.
method DUAL framework using an encoder-decoder architecture to learn nonlinear embeddings and a selection block to choose representative samples.
result DUAL outperforms state-of-the-art methods in selecting representative samples for unsupervised learning.

Deep learning methods have predominantly been applied to large artificial neural networks. Despite their state-of-the-art performance, these large networks typically do not generalize well to datasets with limited sample sizes. In this paper, we take a different approach by learning multiple layers of kernels. We combi…

2013-10-11abs ↗pdf ↗

This paper proposes an embedding-based neural network for more accurate investment return prediction.

problem Accurately predicting investment returns requires understanding industry knowledge and news, as well as leveraging relevant theories.
method The approach uses embedding to encode investment IDs into low-dimensional vectors, leveraging dual branches to separate different information, and employs the swish activation function.
result The proposed embedding-based dual branch model outperforms traditional machine learning models like Xgboost, Lightgbm, and Catboost on the Ubiquant Market Prediction dataset.

DeepMartingale uses deep learning to solve complex optimal stopping problems efficiently.

problem Optimal stopping problems in high-dimensional continuous-time models.
method Leverages martingale representation and deep learning to directly optimize over parameterized martingales.
result DeepMartingale can approximate the true value function to any desired accuracy with neural networks of manageable size.

Extends quadratic loss for SVM and deep learning to improve pattern correlation.

problem Improving generalization in supervised binary classification and regression tasks.
method Extends quadratic loss, restarts from problem (8) in [3], proposes new algorithms, uses multiple kernel learning.
result Comparable results with standard losses and parameterized quadratic loss.

Convolutional neural networks outperform other architectures in streaming time series classification.

problem Efficient deep learning models for real-time data streams.
method Asynchronous dual-pipeline deep learning framework for real-time predictions.
result Convolutional architectures achieve higher accuracy and efficiency in streaming time series classification.

Paper explores physics-informed deep learning for system reliability assessment.

problem Limited study on deep learning for system reliability assessment.
method Physics-informed deep learning approach for system reliability assessment.
result Physics-informed deep learning can alleviate computational challenges and combine measurement data and mathematical models.

Study S-shaped utility maximization with VaR constraint and unobservable drift.

problem Maximizing utility with a Value at Risk (VaR) constraint and unknown drift.
method Bayesian filter, concavification principle, change of measure, semi-closed integral representation, algorithms (Lagrange, simulation, deep neural network).
result Critical wealth level determining solution feasibility and optimal solution existence.

New framework enhances neural network robustness against adversarial attacks.

problem Vulnerability of deep neural networks to small perturbations.
method Integrates Lipschitz constraint using optimal transport and hinge regularization.
result Proposes a new loss function that certifies adversarial robustness.

Improved neural network verification using Lagrangian decomposition and parallel algorithms.

problem Formally proving input-output properties of neural networks efficiently.
method Novel bounding and branching algorithms based on Lagrangian Decomposition and activation-based heuristics.
result Significant reduction in verification times, up to 50x faster on adversarial robustness properties.

This paper considers the design of optimal resource allocation policies in wireless communication systems which are generically modeled as a functional optimization problem with stochastic constraints. These optimization problems have the structure of a learning problem in which the statistical loss appears as a constr…

2018-07-21abs ↗pdf ↗

Defines complexity measure for neural networks and feature representations, revealing scaling patterns.

problem Understanding the nonlinearity and dimensionality of neural network computations and feature representations.
method Introduces complexity and effective dimension measures, investigates their dynamics during training, and analyzes their scaling properties.
result Power law scaling of complexity and effective dimension during training, revealing hidden structure of datasets.

Residual networks (ResNets) have recently achieved state-of-the-art on challenging computer vision tasks. We introduce Resnet in Resnet (RiR): a deep dual-stream architecture that generalizes ResNets and standard CNNs and is easily implemented with no computational overhead. RiR consistently improves performance over R…

2016-03-25abs ↗pdf ↗

Dual PC algorithm improves structure learning of Bayesian networks.

problem Learning the structure of Bayesian networks from observational data.
method Dual PC algorithm, leveraging covariance and precision matrices, and partial correlations.
result The dual PC algorithm outperforms the classic PC algorithm in structure recovery, even with non-Gaussian data.

Graph convolutional networks (GCNs) have recently become one of the most powerful tools for graph analytics tasks in numerous applications, ranging from social networks and natural language processing to bioinformatics and chemoinformatics, thanks to their ability to capture the complex relationships between concepts. …

2019-04-04abs ↗pdf ↗

Sum-product networks have recently emerged as an attractive representation due to their dual view as a special type of deep neural network with clear semantics and a special type of probabilistic graphical model for which inference is always tractable. Those properties follow from some conditions (i.e., completeness an…

2017-01-19abs ↗pdf ↗

The cross-domain recommendation technique is an effective way of alleviating the data sparse issue in recommender systems by leveraging the knowledge from relevant domains. Transfer learning is a class of algorithms underlying these techniques. In this paper, we propose a novel transfer learning approach for cross-doma…

2018-04-18abs ↗pdf ↗

Develops scalable Bayesian inference methods for neural networks.

problem Lack of model uncertainty in deep learning leading to overconfident predictions.
method Linearised Laplace approximation, conjugate Gaussian-linear models, stochastic gradient descent, sample-based EM algorithm.
result Equips neural networks with model uncertainty using scalable methods.