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

238477715953 · Jun 202019922001200920172026
48 results for neural net regression

Deep neural nets can estimate regression with dependent data without the curse of dimensionality.

problem Regression with dependent data and structural assumptions on the regression function.
method Deep recurrent neural network estimate under suitable structural assumptions.
result Deep neural nets can circumvent the curse of dimensionality for regression with dependent data.

Oracle inequality for sparse neural nets adapts to unknown structure.

problem Sparse deep neural nets in nonparametric regression.
method Gibbs posterior distribution with Metropolis-adjusted Langevin algorithms and mixture of uniform priors.
result Oracle inequality showing adaptation to unknown regularity and structure, achieving minimax-optimal rate of convergence.

Metrics assess uncertainty structure and distribution for regression models.

problem Quantifying uncertainty in high-dimensional and nonlinear regression tasks.
method Two bounded comparison metrics for uncertainty structure and distribution.
result DNNs and DNOs provide encouraging uncertainty metric values in high dimensions.

Study assesses neural nets for optimization problems, highlighting SiLU's effectiveness.

problem Using neural nets for optimization problems, especially for accurate approximations.
method Determined best activation function (SiLU) for nonlinear optimization problems. Analyzed function approximations using neural networks and interpolation/regression models.
result Neural nets can deliver competitive zero- and first-order approximations but underperform on second-order approximations.

Automatic debiasing for causal and policy effects using Neural Nets and Random Forests.

problem Estimating causal and policy effects from high-dimensional or non-parametric regression functions.
method Automatic learning of Riesz representation using Neural Nets and Random Forests.
result Automatic debiasing method performs well compared to state-of-the-art algorithms.

Recent research shows that the following two models are equivalent: (a) infinitely wide neural networks (NNs) trained under l2 loss by gradient descent with infinitesimally small learning rate (b) kernel regression with respect to so-called Neural Tangent Kernels (NTKs) (Jacot et al., 2018). An efficient algorithm to c…

2019-10-03abs ↗pdf ↗

Proposes EE-Net for neural exploration in contextual bandits.

problem Exploitation-Exploration tradeoff in contextual bandits.
method Uses two neural networks: Exploitation and Exploration, to learn reward function and adaptively explore.
result Achieves O(TlogT)\mathcal{O}(\sqrt{T\log T}) regret and outperforms existing methods.

PIVEN predicts both specific values and prediction intervals.

problem Improving robustness of neural nets in regression tasks.
method PIVEN is a deep neural network that produces both a prediction interval and a specific value prediction.
result PIVEN produces tighter uncertainty bounds than state-of-the-art approaches for prediction intervals.

In this paper we present a new framework for time-series modeling that combines the best of traditional statistical models and neural networks. We focus on time-series with long-range dependencies, needed for monitoring fine granularity data (e.g. minutes, seconds, milliseconds), prevalent in operational use-cases. Tra…

2019-11-27abs ↗pdf ↗

Neural Additive Models combine neural nets with interpretable models for high stakes tasks.

problem Inability to understand how neural networks make decisions.
method Combines neural nets with generalized additive models to create Neural Additive Models (NAMs).
result NAMs are more accurate than intelligible models and as accurate as state-of-the-art generalized additive models.

A new deep neural network tackles nonlinear functional regression with improved dimensionality reduction.

problem Nonlinear functional regression in infinite-dimensional functional data analysis.
method Functional deep neural network with adaptive kernel embedding and projection steps.
result Explicit rates of approximating nonlinear smooth functionals are derived, and the network is shown to be effective in both simulated and real datasets.

DFIV uses deep neural nets to learn nonlinear features in IV regression.

problem Learning causal relationships from observational data with nonlinear interactions.
method DFIV trains deep neural nets to define nonlinear features on instruments and treatments, alternating training to compose stages 1 and 2.
result DFIV outperforms state-of-the-art methods on IV benchmarks and off-policy policy evaluation.

LALR adapts learning rate for faster convergence in regression and neural nets.

problem Finding optimal learning rates for faster convergence in regression and neural networks.
method Lipschitz continuity theory applied to Mean Absolute Error and Quantile loss functions.
result Adaptive learning rate policy enables up to 20x faster convergence.

Paper proposes robust estimators for heavy-tailed data with infinite variance.

problem Developing robust estimators for heavy-tailed data with infinite variance.
method Proposes two robust estimators: ridge log-truncated M-estimator and elastic net log-truncated M-estimator.
result Demonstrates robustness of log-truncated estimations over standard estimations through simulations and real data analysis.

The paper develops a new simulation technique for estimating conditional expectations in financial models.

problem Estimating conditional expectations in financial models with expensive simulation of endogenous variables.
method Introduces a hierarchical simulation scheme with oversimplified defaults to address variance issues.
result The hierarchical simulation technique significantly improves the success of neural net regression for conditional expectation estimation.

Neural Ordinary Differential Equations (N-ODEs) are a powerful building block for learning systems, which extend residual networks to a continuous-time dynamical system. We propose a Bayesian version of N-ODEs that enables well-calibrated quantification of prediction uncertainty, while maintaining the expressive power …

2019-12-02abs ↗pdf ↗

How well does a classic deep net architecture like AlexNet or VGG19 classify on a standard dataset such as CIFAR-10 when its width --- namely, number of channels in convolutional layers, and number of nodes in fully-connected internal layers --- is allowed to increase to infinity? Such questions have come to the forefr…

2019-04-26abs ↗pdf ↗

New algorithm optimizes tessellated kernels for larger datasets and improved performance.

problem Limited accuracy and complexity in machine learning algorithms based on kernel optimization.
method 2-step algorithm for optimizing tessellated kernels, scaling to 10,000 data points and extending to regression.
result Significant improvement in performance over Neural Nets and SimpleMKL with similar computation time.

A new method predicts precipitation distributions from ensemble forecasts.

problem Improving accuracy and calibration of precipitation forecasts.
method Distributional regression U-Nets for postprocessing ensemble precipitation forecasts.
result Competitive performance in continuous ranked probability score, especially for heavy precipitation.

Enhances POU-Nets with probabilistic noise model for efficient spatial data clustering.

problem Improving the efficiency and accuracy of deep learning models for spatial data.
method Integrates Gaussian noise model into POU-Nets to enable gradient-based optimization and hierarchical refinement.
result Achieves sharp spatial partitions and higher-order polynomial approximation without regularizers.

We study deep neural networks and their use in semiparametric inference. We establish novel rates of convergence for deep feedforward neural nets. Our new rates are sufficiently fast (in some cases minimax optimal) to allow us to establish valid second-step inference after first-step estimation with deep learning, a re…

2018-09-26abs ↗pdf ↗

Simplifies neural regression by combining two sub-networks for predictions and uncertainties.

problem Neural networks underestimate uncertainty, leading to overly confident predictions.
method Extends IRLS to a two-sub-network approach with shared representations and complementary loss functions.
result Proposed network is simpler to implement and more robust to uncertainty variations.

Paper develops algorithms for sparse linear regression with generalized elastic net penalty.

problem Sparse linear regression with robust penalty for high-dimensional data.
method Iterative Reweighted Framework based on ADMM and PMM with SNN.
result Efficient algorithms provide superior performance in both simulated and real data.

An important class of distance metrics proposed for training generative adversarial networks (GANs) is the integral probability metric (IPM), in which the neural net distance captures the practical GAN training via two neural networks. This paper investigates the minimax estimation problem of the neural net distance ba…

2018-11-02abs ↗pdf ↗

Convolutional nets require fewer samples than fully-connected nets for image classification.

problem Understanding why convolutional nets are more sample-efficient than fully-connected nets.
method Construction of a natural distribution and target function to demonstrate a sample complexity gap.
result Convolutional nets require O(1)O(1) samples for a single target function, while fully-connected nets require Ω(d2)Ω(d^2) samples.

ConquerNet smooths quantile regression for deep learning with minimax guarantees.

problem Optimization challenges in quantile regression for deep models.
method ConquerNet uses convolution-smoothed quantile ReLU neural networks.
result ConquerNet provides minimax guarantees and outperforms standard quantile neural networks.

DER uses neural nets to better handle uncertainty in machine learning.

problem Need for principled uncertainty reasoning in safety-critical domains.
method Uncertainty-aware regression-based neural networks (NNs) with evidential distributions.
result DER shows promise over traditional methods but is a heuristic.

We propose a robust elastic net (REN) model for high-dimensional sparse regression and give its performance guarantees (both the statistical error bound and the optimization bound). A simple idea of trimming the inner product is applied to the elastic net model. Specifically, we robustify the covariance matrix by trimm…

2015-11-15abs ↗pdf ↗

Despite the phenomenal success of deep learning in recent years, there remains a gap in understanding the fundamental mechanics of neural nets. More research is focussed on handcrafting complex and larger networks, and the design decisions are often ad-hoc and based on intuition. Some recent research has aimed to demys…

2019-04-24abs ↗pdf ↗

We develop a fast, tractable technique called Net-Trim for simplifying a trained neural network. The method is a convex post-processing module, which prunes (sparsifies) a trained network layer by layer, while preserving the internal responses. We present a comprehensive analysis of Net-Trim from both the algorithmic a…

2018-06-17abs ↗pdf ↗

In this paper, we introduce transformations of deep rectifier networks, enabling the conversion of deep rectifier networks into shallow rectifier networks. We subsequently prove that any rectifier net of any depth can be represented by a maximum of a number of functions that can be realized by a shallow network with a …

2017-03-30abs ↗pdf ↗

Within the framework of statistical learning theory we analyze in detail the so-called elastic-net regularization scheme proposed by Zou and Hastie for the selection of groups of correlated variables. To investigate on the statistical properties of this scheme and in particular on its consistency properties, we set up …

2008-07-22abs ↗pdf ↗

We study the problem of treatment effect estimation in randomized experiments with high-dimensional covariate information, and show that essentially any risk-consistent regression adjustment can be used to obtain efficient estimates of the average treatment effect. Our results considerably extend the range of settings …

2016-07-22abs ↗pdf ↗

DP-Net uses dynamic programming for efficient deep neural network compression.

problem Efficiently compressing deep neural networks while maintaining accuracy.
method Dynamic Programming for optimal weight quantization and clustering-friendly training.
result Achieves up to 77X compression ratio on Wide ResNet with minimal accuracy loss.

GD with early stopping trains shallow neural nets for nonparametric regression robustly.

problem Learning Lipschitz regression functions with noisy labels.
method Overparameterized shallow neural networks trained by GD with early stopping.
result Optimal rates of convergence for nonparametric regression.

Proposes a new deep learning model for uncertainty quantification and propagation.

problem High-dimensional uncertainty quantification and propagation problems.
method Integrates U-net with Gaussian Gated Linear Network (GGLN) to create GLU-net.
result Less complex architecture with 44% fewer parameters than existing models.