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

183366549732 · Jun 202019922001200920172026
48 results for deep 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.

This paper extends neural collapse to regression problems, revealing key features and structures.

problem Understanding the structure learned by deep neural networks in regression tasks.
method Established Neural Regression Collapse (NRC) across different models, analyzing feature and weight alignments.
result Deep neural regression models exhibit a collapsed feature space, aligning with target dimensions and covariances.

Proposes a method to estimate drug sensitivity uncertainty using deep regression forests.

problem Lack of confidence intervals in deep learning models for critical tasks.
method Uses Deep Regression Forests to estimate variance and uncertainty for drug sensitivity prediction.
result Improves efficiency and coverage of uncertainty estimates for drug sensitivity predictions.

DRE combines DNN with random feature regression for efficient neural network design.

problem Designing and training deep neural networks (DNN) efficiently and effectively.
method DRE architecture with two-layer neural networks, randomly drawn input and output weights trained with linear ridge regression.
result DRE outperforms state-of-the-art DNN in many data sets with lower computational cost.

Deep neural networks estimate regression functions on manifolds.

problem Estimating regression functions on manifolds from data.
method Fully connected deep neural networks with ReLU activation, analyzing convergence rates.
result Estimates achieve a rate of convergence dependent on manifold dimension, not predictor dimension.

Paper tackles uncertainty prediction for deep sequential regression.

problem Challenges in generating accurate uncertainty estimates for deep recurrent networks.
method Flexible method that generates symmetric and asymmetric uncertainty estimates without stationarity assumptions.
result Outperforms competitive baselines on both drift and non-drift scenarios.

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.

Density-Regression improves deep uncertainty estimation with faster inference.

problem Efficient uncertainty estimation under distribution shifts with modern deep models.
method Leverages density function for fast inference and distance-aware feature space.
result Density-Regression achieves competitive uncertainty estimation performance.

Paper proposes deep neural networks for nonparametric regression from dependent data.

problem Nonparametric regression from strongly mixing observations.
method Minimum error entropy principle applied to deep neural networks.
result Deep neural networks achieve minimax optimal convergence rates for Gaussian errors.

Bayes-optimal learning of deep random networks with Gaussian weights is studied.

problem Learning a target function corresponding to a deep, extensive-width, non-linear neural network with random Gaussian weights.
method Closed-form expressions for Bayes-optimal test error, ridge regression, kernel and random features regression are computed.
result Optimally regularized ridge regression and kernel regression achieve Bayes-optimal performances, while logistic loss yields a near-optimal test error for classification.

Proposes a deep ordinal regression framework using optimal transport loss and unimodal output probabilities.

problem Lack of unimodal output probabilities in recent ordinal regression models.
method Introduces a deep learning framework based on optimal transport loss and unimodal output distribution, inspired by the Proportional Odds model.
result Demonstrates improved performance and unimodal output probabilities on real-world datasets compared to existing methods.

Deep P-Spline automates DNN structure selection for complex regression problems.

problem Challenges in selecting optimal network structures for DNNs.
method Linking neuron selection to knot placement in basis expansion techniques, introducing a difference penalty for automated knot selection.
result Deep P-Spline extends model class and forms a latent variable modeling framework with theoretical guarantees.

Deep learning model estimates uncertainty in complex regression tasks.

problem Uncertainty quantification in probabilistic regression predictions.
method Combines statistical and deep learning transformation models using gradient descent.
result State-of-the-art performance on small datasets and complex image data.

Simplifies transfer learning with deep neural networks using ridge regression.

problem High computational cost of finetuning deep models for transfer learning.
method Leverage the low-rank property of deep neural networks' feature vectors in kernel ridge regression.
result Successful on supervised and semi-supervised transfer learning tasks.

Deep neural networks with adversarial training achieve sup-norm convergence for nonparametric regression.

problem Achieving sup-norm convergence for deep neural network estimators in nonparametric regression.
method Developed an adversarial training scheme to address the sup-norm convergence issue.
result Deep neural network estimators achieve optimal sup-norm convergence with the proposed adversarial training.

This paper applies deep learning to ordinal regression, modeling it as a binary search.

problem Ordinal regression with deep learning models.
method Formulated ordinal regression as a binary search problem, using recurrent neural networks.
result Deep learning model shows comparable or better predictive power compared to traditional methods.

Sparse-penalized deep neural networks improve performance in weakly dependent processes.

problem Nonparametric regression and classification under weak dependence.
method Sparse-penalized deep neural networks with oracle inequalities and convergence rates established.
result The proposed estimators outperform non-penalized ones in simulations.

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.

New method estimates covariance in deep heteroscedastic regression without labels.

problem Estimating covariance in deep heteroscedastic models is challenging due to sample-dependent covariance and lack of ground truth.
method Proposes a self-supervised approach using KL Divergence and 2-Wasserstein distance for covariance estimation and a neighborhood-based heuristic for pseudo labels.
result Demonstrates effective pseudo labels and a computationally cheaper yet accurate deep heteroscedastic regression.

Paper introduces DQPOPE for estimating return distributions in reinforcement learning.

problem Estimating the entire return distribution from off-policy data.
method Deep quantile process regression for distributional off-policy evaluation.
result DQPOPE achieves statistical advantages by estimating full return distribution with same sample size.

Neural networks improve nonparametric regression with measurement errors.

problem Nonparametric regression with measurement errors.
method Proposes a neural network design using FNN, normalizing flow, and inference network.
result Neural network approach is more flexible and superior or comparable to classical methods.

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.

Bayesian deep learning accounts for input uncertainty using Errors-in-Variables models.

problem Uncertainty in deep regression models, especially from input data.
method Bayesian treatment with Errors-in-Variables model to decompose predictive uncertainty.
result The approach yields more complete and consistent uncertainty estimates.

Proposes isotonic regression for calibrating Deep Cox models' survival probabilities.

problem Poor calibration of Deep Cox models' survival probabilities.
method Isotonic regression for post hoc calibration of Deep Cox models.
result Establishes favorable theoretical guarantees and demonstrates empirical effectiveness.

Quantile deep learning improves time series prediction accuracy and uncertainty quantification.

problem Uncertainty in multi-step time series prediction.
method Developed a novel quantile regression deep learning framework for multi-step time series prediction.
result Integrating quantile loss function with deep learning provides additional predictions for selected quantiles without loss in accuracy.

We consider the classical sparse regression problem of recovering a sparse signal x0x_0 given a measurement vector y=Φx0+wy = Φx_0+w. We propose a tree search algorithm driven by the deep neural network for sparse regression (TSN). TSN improves the signal reconstruction performance of the deep neural network designed for sp…

2019-04-01abs ↗pdf ↗

New method improves deep neural network performance in regression tasks.

problem Improving generalization, robustness, and explainability of deep neural networks in regression.
method Developed a new Information Bottleneck approach using Cauchy-Schwarz divergence.
result Demonstrated superior performance on six real-world regression tasks.

The paper tightens bounds on covering numbers for deep ReLU networks.

problem Characterizing the capacity and performance of deep ReLU networks.
method Derives tight lower and upper bounds on metric entropy of ReLU networks.
result Establishes optimality in nonparametric regression via deep networks.

The real-world data is often susceptible to label noise, which might constrict the effectiveness of the existing state of the art algorithms for ordinal regression. Existing works on ordinal regression do not take label noise into account. We propose a theoretically grounded approach for class conditional label noise i…

2019-12-07abs ↗pdf ↗