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

146293439585 · Jun 202019922001200920172026
48 results for deep splitting

Paper analyzes and proves convergence of a new method for solving complex PDEs.

problem Solving high-dimensional nonlinear PDEs and PIDEs with random neural networks.
method Random deep splitting method using random neural networks.
result The method converges to the unique viscosity solution of nonlinear PDEs and PIDEs.

Combining Bayesian deep learning and split conformal prediction affects out-of-distribution coverage.

problem Improving out-of-distribution coverage in multiclass image classification.
method Combining Bayesian deep learning with split conformal prediction methods.
result Combining methods can reduce out-of-distribution coverage in some cases.

TSSM splits neural networks for parallel training with minimal accuracy loss.

problem Accuracy degradation in parallel training of deep neural networks.
method TSSM reformulates alternating minimization to achieve parallelism with minimal accuracy loss.
result TSSM achieves significant speedup without accuracy loss on multiple datasets.

Unified predictive uncertainty disentangled using deep split ensembles.

problem Understanding and quantifying uncertainty in NNs for real-world applications.
method Deep split ensemble approach using multivariate Gaussian mixture model.
result Inherently well-calibrated models with high flexibility to group features.

In this paper we develop a statistical theory and an implementation of deep learning models. We show that an elegant variable splitting scheme for the alternating direction method of multipliers optimises a deep learning objective. We allow for non-smooth non-convex regularisation penalties to induce sparsity in parame…

2015-09-20abs ↗pdf ↗

Memory split advantage: thinner networks outperform a single wide network.

problem Optimizing deep learning models with limited memory.
method Investigated training a single wide network vs. an ensemble of thinner networks with the same total number of parameters.
result An ensemble of several thinner networks outperforms a single wide network for large memory budgets.

This work investigates power laws in deep neural network ensembles and predicts their performance.

problem Understanding the performance of deep neural network ensembles and their optimal structure.
method Investigated the behavior of negative log-likelihood (CNLL) of a deep ensemble as a function of ensemble size and member network size, identifying power law dependencies.
result One large network may perform worse than an ensemble of several medium-size networks, known as a memory split.

Split learning preserves privacy in 1D CNN models for detecting heart abnormalities.

problem Privacy leakage in 1D CNN models under split learning.
method Implemented and validated an 1D CNN model under split learning, applied privacy leakage mitigation techniques.
result Split learning alone is insufficient to maintain raw data privacy in 1D CNN models.

A new method for causal inference in high-dimensional data using machine learning.

problem Causal inference in high-dimensional observational data.
method Support Points Sample Splitting (SPSS) for efficient double machine learning (DML) in causal inference.
result Deep learning with SPSS and hybrid methods outperform SVM with SPSS in computational efficiency and estimation quality.

Shortage of labeled data has been holding the surge of deep learning in healthcare back, as sample sizes are often small, patient information cannot be shared openly, and multi-center collaborative studies are a burden to set up. Distributed machine learning methods promise to mitigate these problems. We argue for a sp…

2019-12-27abs ↗pdf ↗

In this paper we introduce a numerical method for nonlinear parabolic PDEs that combines operator splitting with deep learning. It divides the PDE approximation problem into a sequence of separate learning problems. Since the computational graph for each of the subproblems is comparatively small, the approach can handl…

2019-07-08abs ↗pdf ↗

The paper presents a method for generating well-calibrated prediction intervals using quality-driven deep ensembles.

problem Generating reliable prediction intervals for regression analysis.
method A multi-objective loss function combining quality measures for prediction intervals and point estimates, with a penalty function to ensure semantic integrity and stability.
result The method produces well-calibrated prediction intervals and point estimates, capturing both aleatoric and epistemic uncertainty.

This paper introduces a generic method which enables to use conventional deep neural networks as end-to-end one-class classifiers. The method is based on splitting given data from one class into two subsets. In one-class classification, only samples of one normal class are available for training. During inference, a cl…

2019-02-04abs ↗pdf ↗

A new numerical scheme approximates nonlinear filtering densities for noisy and partial measurements.

problem Approximating nonlinear filtering densities for noisy and partial measurements.
method Deep splitting scheme applied to the Fokker--Planck equation followed by Bayes' formula.
result Convergence rate established for the numerical scheme under parabolic Hörmander condition.

Deep neural networks have been proven powerful at processing perceptual data, such as images and audio. However for tabular data, tree-based models are more popular. A nice property of tree-based models is their natural interpretability. In this work, we present Deep Neural Decision Trees (DNDT) -- tree models realised…

2018-06-19abs ↗pdf ↗

Study numerical methods for singular FBSDEs with degenerate forward component.

problem Numerical approximation of singular fully coupled FBSDEs with degenerate forward component and non-smooth terminal condition.
method Splitting approach to treat diffusion and transport parts separately.
result The splitting method converges with rate 1/2 under structural condition.

Develops significance tests for neural networks without strong assumptions or excessive computation.

problem Addressing the black-box nature of deep neural networks for feature relevance testing.
method Derives one-split and two-split tests relaxing assumptions and computational complexity.
result Establishes asymptotic null distributions and consistency in Type II error.

Improves DPGMM sampler by better initializing subclusters for more effective clustering.

problem Poor initialization of subclusters leads to ineffective sampling and clustering.
method Proposed heuristic and deep learning-based methods to improve subcluster initialization.
result Better splits lead to improved performance, results, and stability.

SplitEasy trains ML models on mobile devices without server data transfer.

problem Training complex DL models on resource-limited mobile devices.
method Split learning approach where sensitive layers are trained locally, computationally intensive layers on server.
result SplitEasy trains models on mobile devices with minimal data transfer, near-constant time per sample.

New approach makes survival analysis fairer without specifying sensitive features.

problem Ensuring fairness in survival analysis models across different subpopulations.
method Distributionally robust optimization (DRO) with sample splitting strategy.
result Converted existing survival analysis models into fair versions without specifying sensitive features.

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 ↗

Batch-splitting (data-parallelism) is the dominant distributed Deep Neural Network (DNN) training strategy, due to its universal applicability and its amenability to Single-Program-Multiple-Data (SPMD) programming. However, batch-splitting suffers from problems including the inability to train very large models (due to…

2018-11-05abs ↗pdf ↗

DeepDPM clusters images without knowing the number of clusters.

problem Clustering images with an unknown number of clusters.
method Deep learning with a split/merge framework, dynamic architecture, and a novel loss function.
result DeepDPM outperforms existing methods in clustering images without knowing the number of clusters.

New method uses symmetric splitting for efficient HMC inference in large neural networks.

problem Efficient inference for Bayesian neural networks with large datasets.
method Introduces a symmetric integration scheme for Hamiltonian Monte Carlo (HMC) that does not rely on stochastic gradients.
result Symmetric splitting leads to more efficient HMC inference over large data sets.

This work approximates full conformal prediction for neural networks without sample splitting.

problem Uncertainty quantification for neural network regression models.
method Approximating full conformal prediction using Gauss-Newton influence for post-hoc uncertainty estimation.
result Locally-adaptive and often tighter prediction intervals compared to split-CP.

This paper proposes a method to use deep neural networks as end-to-end open-set classifiers. It is based on intra-class data splitting. In open-set recognition, only samples from a limited number of known classes are available for training. During inference, an open-set classifier must reject samples from unknown class…

2019-03-12abs ↗pdf ↗

Wide neural networks' last hidden layers split into groups of redundant neurons.

problem Understanding why wide neural networks generalize well despite overfitting.
method Analyzed the last hidden layer representations of various convolutional neural networks.
result Wide hidden layers split into groups of redundant neurons, which help generalize.

The paper uses deep neural networks to estimate and infer ATE without needing to know the dimension of the data.

problem Estimating and inferring the average treatment effect (ATE) in complex data settings.
method The paper uses deep neural networks to estimate the mean regression function and then calculates the ATE. It establishes consistency and asymptotic normality of the estimators.
result The deep neural network estimates of ATE are consistent and asymptotically normal, providing dimension-free rates.

Adaptive Multilevel Splitting improves rare event pricing for financial derivatives.

problem Efficient pricing of binary options in rare event regimes with discontinuous payoffs.
method Adaptive Multilevel Splitting (AMS) reformulates rare-event problem as conditional events.
result AMS achieves up to 200-fold improvements over standard Monte Carlo, preserving unbiasedness.

SVHN dataset's split affects generative models but not digit classification.

problem Distribution mismatch between SVHN training and test sets impacts generative models.
method Empirically showed distribution mismatch affects generative models; proposed mixing and re-splitting.
result Distribution mismatch in SVHN dataset significantly impacts probabilistic generative models.

We survey distributed deep learning models for training or inference without accessing raw data from clients. These methods aim to protect confidential patterns in data while still allowing servers to train models. The distributed deep learning methods of federated learning, split learning and large batch stochastic gr…

2018-12-08abs ↗pdf ↗

Backpropagation-free trunk training improves model performance on various benchmarks.

problem Memory inefficiency and noisy gradient estimates in deep network training.
method Split Forward Gradient (Split-FG) method that splits network into trunk and head, estimating only trunk gradient.
result Split-FG achieves better performance than pure forward-gradient training and backpropagation on various benchmarks.

Handel and Mosher have proved that the free splitting complex FS for the free group is Gromov hyperbolic. This is a deep and much sought-after result, since it establishes FS as a good analogue of the curve complex for surfaces. We give a shorter alternative proof of this theorem, using surgery paths in Hatcher's spher…

2012-10-23abs ↗pdf ↗

SPlit optimizes dataset splitting for better model performance.

problem Improving model performance through optimal dataset splitting.
method Adapting Support Points (SP) algorithm for subsampling and categorical variables in a sequential nearest neighbor approach.
result SPlit significantly improves worst-case testing performance compared to random splitting.

Despite recent advances in architectures for mobile devices, deep learning computational requirements remains prohibitive for most embedded devices. To address that issue, we envision sharing the computational costs of inference between local devices and the cloud, taking advantage of the compression performed by the f…

2019-11-23abs ↗pdf ↗

This paper proposes a novel model for the rating prediction task in recommender systems which significantly outperforms previous state-of-the art models on a time-split Netflix data set. Our model is based on deep autoencoder with 6 layers and is trained end-to-end without any layer-wise pre-training. We empirically de…

2017-08-05abs ↗pdf ↗

A new MMD-based test combines kernels for two-sample testing without splitting data.

problem Efficiently testing if two datasets come from the same distribution without splitting data.
method Proposes a novel statistic based on Maximum Mean Discrepancy (MMD) that combines kernels, proving concentration bounds and showing data-dependent kernel selection.
result Exponential concentration bounds and improved test power compared to existing methods.

The paper extends keenness concept to bridge splittings and finds conditions for existence.

problem Extending keenness concept to bridge splittings and finding conditions for existence.
method Extending the concept of keenness to bridge splittings and proving existence conditions.
result Existence of strongly keen (g,b)(g,b)-splitting of a link with distance nn for certain integers gg, bb, and nn.