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

138277415553 · Jun 202019922001200920172026
48 results for regression techniques

In many real-world applications of machine learning classifiers, it is essential to predict the probability of an example belonging to a particular class. This paper proposes a simple technique for predicting probabilities based on optimizing a ranking loss, followed by isotonic regression. This semi-parametric techniq…

2012-06-18abs ↗pdf ↗

This paper explores alternative regression techniques in pricing American put options and compares to the least-squares method (LSM) in Monte Carlo implemented by Longstaff-Schwartz, 2001 which uses least squares to estimate the conditional expected payoff to the option holder from continuation. The pricing is done und…

2018-08-08abs ↗pdf ↗

Kernel ridge regression imputation with consistent variance estimation for handling missing data.

problem Handling missing data in statistical analysis.
method Kernel ridge regression imputation combined with entropy method for variance estimation.
result Root-n consistency of the imputation estimator in a Sobolev space setting.

Develops experimental design for discovering missing physics in bioreactors.

problem Discovering missing physics in incomplete model structures of process systems.
method Combines universal differential equations and symbolic regression with sequential experimental design.
result Successfully recovered true model structure of a bioreactor using machine learning techniques.

Improved KernelSHAP via linear regression for ML model interpretation.

problem Efficiently estimating Shapley values in model-agnostic settings.
method Revisiting KernelSHAP via linear regression, developing techniques for convergence and uncertainty.
result Original KernelSHAP incurs negligible bias for significant variance reduction.

Paper proposes a new combined regression strategy for conditional survival prediction.

problem Improving survival prediction accuracy using conditional survival function.
method Uses regression-based weak learners with area-norm proximity measure to create an ensemble technique.
result The proposed model outperforms Random Survival Forest and selects important variables effectively.

Least Angle Regression is a promising technique for variable selection applications, offering a nice alternative to stepwise regression. It provides an explanation for the similar behavior of LASSO (1\ell_1-penalized regression) and forward stagewise regression, and provides a fast implementation of both. The idea has…

2008-02-07abs ↗pdf ↗

New methods for sketching non-PSD matrices improve regression and optimization tasks.

problem Efficiently handling non-PSD matrices in computations.
method Developed novel matrix sketching techniques for non-PSD and complex matrices.
result Improved performance in convex and non-convex optimization, regression, and vector-matrix-vector queries.

The paper compares traditional regression with modern neural network methods for financial hedging and risk compression.

problem Finding optimal hedge ratios and managing portfolio risk using traditional regression methods has limitations.
method The paper introduces regularization techniques and common factor analyses using neural networks to improve upon regression methods.
result Neural network methods provide better performance in hedge ratio estimation and risk compression compared to traditional regression.

A new Gaussian process regression method infers implicit manifold structure from data.

problem Scaling Gaussian process regression to high-dimensional data.
method Proposes a fully differentiable Gaussian process regression technique that infers implicit manifold structure from data.
result Improves predictive performance and calibration of standard Gaussian process regression in high-dimensional settings.

Randomized algorithm solves vector-valued regression problems with low-rank operators.

problem Vector-valued regression problems involving infinite-dimensional spaces.
method Randomized Reduced Rank Regression (R4) using Gaussian sketching for optimization.
result R4 estimators are efficient and accurate, with empirical risk close to optimal.

The article compares neural networks and logistic regression for credit scoring and introduces a new probability calibration technique.

problem Improving credit scoring accuracy using machine learning techniques.
method Comparison of logistic regression and neural networks, feature importance assessment, temporal feature inclusion, and SURE probability calibration.
result Neural networks can slightly improve credit scoring performance, and SURE calibration technique enhances probability calibration.

The study examines robustness auditing for linear regression, improving existing methods and identifying computational challenges.

problem Detecting small subsets of data that can reverse regression coefficients.
method Empirical study of mixed integer quadratically constrained optimization and exact greedy methods, combined with a spectral algorithm.
result Existing methods largely outperform state of the art, but computational bottlenecks remain, especially for higher dimensions.

We consider a discriminative learning (regression) problem, whereby the regression function is a convex combination of k linear classifiers. Existing approaches are based on the EM algorithm, or similar techniques, without provable guarantees. We develop a simple method based on spectral techniques and a `mirroring' tr…

2013-11-11abs ↗pdf ↗

Paper predicts Indian stocks using news psycholinguistic features.

problem Predicting Indian stock market performance using financial news.
method Hybrid intelligent models using psycholinguistic variables (LIWC and TAALES) from news articles.
result GMDH and GRNN are statistically the best techniques for prediction.

New method extracts aleatoric and epistemic uncertainties from regression-based neural networks.

problem Need for principled uncertainty reasoning in machine learning systems.
method Learning evidential distributions for aleatoric and epistemic uncertainties.
result Allows for the simultaneous extraction of both uncertainties without sampling or out-of-distribution data.

This study evaluates feature scaling across 14 datasets and 12 techniques in ML.

problem Impact of feature scaling on machine learning performance and computational costs.
method Systematic evaluation of 12 scaling techniques across 14 datasets and 16 ML algorithms.
result Wide variation in model performance due to feature scaling, especially for non-ensemble models.

Study improves loan default risk estimation using advanced regression models.

problem Modeling loan default risk over time is challenging and affects financial reserves.
method Comparative study of three multistate regression techniques: Markov chain, beta regression, and multinomial logistic regression.
result Each successive model outperforms the previous, indicating greater sophistication.

Machine learning improves joint default assessment by capturing non-linear dependencies.

problem Capturing non-linear dependencies among covariates for accurate joint default assessment.
method Application of machine learning techniques to credit card dataset, comparing with logistic regression.
result Machine learning outperforms logistic regression in assessing portfolio riskiness.

Study improves distributional regression evaluation with CRPS, finding optimal rates of convergence.

problem Improving probabilistic forecasts in meteorology using distributional regression.
method Extends theoretical properties of CRPS evaluation to include covariates and finite sample sizes, analyzing convergence rates for different methods.
result Optimal minimax rate of convergence for distributional regression methods is achieved by k-nearest neighbor and kernel methods.

Random forest (RF) methodology is one of the most popular machine learning techniques for prediction problems. In this article, we discuss some cases where random forests may suffer and propose a novel generalized RF method, namely regression-enhanced random forests (RERFs), that can improve on RFs by borrowing the str…

2019-04-23abs ↗pdf ↗

Proposes approximating computationally expensive explainability techniques using conformal regression.

problem Computational expense of score-based explainability techniques limits their applicability in time-critical contexts.
method Uses conformal prediction framework to approximate SHAP and TreeSHAP explanations.
result Significantly improves execution time and produces tight validity guarantees.

Modal regression estimates the local modes of the distribution of YY given X=xX=x, instead of the mean, as in the usual regression sense, and can hence reveal important structure missed by usual regression methods. We study a simple nonparametric method for modal regression, based on a kernel density estimate (KDE) of …

2014-12-04abs ↗pdf ↗

Regression is widely used by practioners across many disciplines. We reformulate the underlying optimisation problem as a second-order conic program providing the flexibility often needed in applications. Using examples from portfolio management and quantitative trading we solve regression problems with and without con…

2013-10-12abs ↗pdf ↗

The paper bounds the mean absolute error in DNN vector-to-vector regression.

problem Bounding the mean absolute error in deep neural network based vector-to-vector regression.
method Error decomposition techniques in statistical learning theory and non-convex optimization theory were used to derive upper bounds for approximation, estimation, and optimization errors.
result Theoretical upper bounds for mean absolute error in DNN vector-to-vector regression were derived and validated experimentally.

Transformers learn functionals from distributions without losing information.

problem Lack of rigorous mathematical theory supporting Transformer performance.
method Proposed a Transformer learning framework, attention operator, and distribution regression.
result Transformers can compress distributions into function representations without loss of information.

We improve kernel ridge regression for skewed responses using oversampling and adaptive partitioning.

problem Kernel ridge regression struggles with skewed response variables, leading to poor estimates.
method Combines adaptive partitioning with oversampling to address skewed responses in kernel ridge regression.
result The proposed method yields estimates with smaller risk compared to classical methods under mild conditions.

Proposes a transfer learning method for high-dimensional quantile regression.

problem Inadequate handling of heterogeneity and heavy tails in transfer learning.
method High-dimensional quantile regression framework with double transfer learning estimator.
result Established error bounds and valid confidence intervals for high-dimensional quantile regression coefficients.