Ability for accurate hospital case cost modelling and prediction is critical for efficient health care financial management and budgetary planning. A variety of regression machine learning algorithms are known to be effective for health care cost predictions. The purpose of this experiment was to build an Azure Machine…
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
48 results for “regression learning”
Huber regression assessed for robustness in statistical learning.
problem Understanding Huber regression in nonparametric statistical learning.
method Assessment from statistical learning perspective, focusing on risk consistency, adaptive tuning, and convergence rates.
result Huber regression can be asymptotically mean regression calibrated under -moment conditions, justifying its robustness.
Paper introduces semi-supervised linear extremile regression for high-dimensional data.
problem Challenges in high-dimensional extremile regression due to data sparsity and overfitting.
method Proposes semi-supervised learning for linear extremile regression, achieving -consistency.
result Demonstrates improved estimation efficiency and performance in high-dimensional settings.
Paper develops a new algorithm for distribution regression with optimal learning rates.
problem Distribution regression with limited second-stage samples.
method Multi-penalty regularization in a reproducing kernel Hilbert space.
result Derives optimal learning rates for distribution regression.
Robust learning mixtures of linear regressions improve robustness.
problem Improving robustness in learning mixtures of linear regressions.
method Connecting mixtures of linear regressions and mixtures of Gaussians with thresholding for a quasi-polynomial time algorithm.
result The algorithm has significantly better robustness than previous results.
Regression learns Mori-Zwanzig operators for dynamical systems.
problem Learning Mori-Zwanzig operators for complex dynamical systems.
method Statistical regression to extract Markov and memory operators.
result Regression models improve learning of memory-dependent corrections.
New insights into correntropy-based regression reveal robustness and unified approaches.
problem Learning robust regression functions under additive noise.
method Minimum distance estimation and conditional mean, mode, median functions.
result Unified approach to conditional mean, mode, and median functions.
Characterizes the sample complexity of list regression tasks.
problem Understanding the sample complexity of list learning tasks in regression.
method Introducing two combinatorial dimensions: k-OIG dimension and k-fat-shattering dimension.
result These dimensions characterize realizable and agnostic k-list regression.
Develops a direct debiased machine learning framework using Bregman divergence.
problem Reduces bias in machine learning estimates of causal effects or structural models.
method Neyman targeted estimation and generalized Riesz regression using Bregman divergence.
result Improves estimation of parameters of interest in causal models.
Paper introduces robust distribution regression using kernel methods.
problem Distribution regression from probability measures to real-valued responses.
method Introduces a robust loss function and a windowing function for two-stage sampling problems.
result Shows improved learning rates and robustness with the robust distribution regression (RDR) scheme.
Kernel regression is a popular non-parametric fitting technique. It aims at learning a function which estimates the targets for test inputs as precise as possible. Generally, the function value for a test input is estimated by a weighted average of the surrounding training examples. The weights are typically computed b…
Survey of SDR methods for high-dimensional regression and embedding.
problem Reducing dimensionality in high-dimensional data.
method Involves both statistical and machine learning approaches, covering inverse and forward regression methods.
result Supervised Kernel Dimension Reduction is equivalent to supervised PCA.
Localized transfer learning improves nonparametric regression performance.
problem Improving nonparametric regression performance on target tasks.
method Localized transfer learning framework that models heterogeneity and partition covariate space into cells.
result Sharp minimax rates show local transfer mitigates the curse of dimensionality.
Simple methods improve regression transferability estimation.
problem Estimating how well regression models transfer between tasks.
method Two simple, computationally efficient approaches based on negative regularized mean squared error.
result Significantly outperform existing methods in accuracy and efficiency.
iRDM selects unlabeled samples for regression without labels, improving model accuracy.
problem Selecting unlabeled samples for regression without label information.
method Iterative representativeness-diversity maximization (iRDM).
result iRDM significantly outperforms supervised ALR, especially with limited labeled samples.
Classification outperforms regression in portfolio construction, yielding higher Sharpe ratios.
problem Determining which machine learning approach (classification vs. regression) is more effective for portfolio construction.
method Used stacking ensemble of gradient boosted tree, random forest, and neural network models.
result Classification yields higher Sharpe ratios and economically significant alphas compared to regression.
Paper proposes methods for transfer learning with random coefficient ridge regression.
problem Estimation and prediction in high-dimensional settings with related models.
method Two estimators using weighted sums of ridge estimates from target and source models.
result Explicit expression of estimation and prediction risks derived using random matrix theory.
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.
BARMPy offers a Python package for Bayesian Additive Regression Models.
problem Making complex Bayesian models accessible to machine learning practitioners.
method Object-oriented design compatible with SciKit-Learn, documentation and tutorial provided.
result Ease of use and compatibility with existing machine learning tools.
Proposes a new algorithm for Sparse Bayesian Learning connected to Stepwise Regression.
problem Sparse Bayesian Learning for probabilistic models.
method Coordinate ascent algorithm (RMP) for SBL, showing connection to Stepwise Regression.
result RMP's noise variance parameter limit connects to Stepwise Regression, with derived guarantees.
Proposes a parametric modal regression method using the implicit function theorem.
problem Finding conditional modes for multi-modal conditional distributions.
method Uses the implicit function theorem to develop an objective function for learning a joint function over inputs and targets.
result Empirically demonstrates scalability and effectiveness in learning multi-valued functions and high-dimensional inputs.
Paper analyzes distributed learning with non-i.i.d. samples.
problem Learning rate analysis for distributed kernel ridge regression with dependent samples.
method Integral operator approach and covariance inequality for strong mixing sequences.
result Derives optimal learning rates for distributed kernel ridge regression.
SGD improves DR by solving two-stage sampling problems.
problem Improving the learning properties of SGD for distribution regression.
method Applying SGD to two-stage sampling problems in distribution regression.
result Theoretical guarantees for SGD's performance in DR, with optimal bounds.
Collider regression improves predictive performance in regression tasks.
problem Discarding prior causal knowledge in regression tasks.
method Collider regression framework incorporating probabilistic causal knowledge from collider structures.
result Proves positive generalization benefit and provides closed-form estimators.
Optimizes binary regression models with gradient ascent-descent methods.
problem Regression problems with binary weights in quantized learning and digital communication.
method Maximin optimization using gradient ascent-descent methods.
result The approach is optimal in linear regression with low noise and robust regression with few outliers.
There are many important regression problems in real-world brain-computer interface (BCI) applications, e.g., driver drowsiness estimation from EEG signals. This paper considers offline analysis: given a pool of unlabeled EEG epochs recorded during driving, how do we optimally select a small number of them to label so …
We comment on the fact that gradient ascent for logistic regression has a connection with the perceptron learning algorithm. Logistic learning is the "soft" variant of perceptron learning.
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.
Active learning improves GP regression on complex, high-dimensional data.
problem Improving Gaussian Process regression in high-dimensional spaces with discontinuous functions.
method Combines manifold learning with active learning to optimize data selection and reduce dimensionality.
result Superior performance over random learning in synthetic data experiments.
Active learning aims to reduce labeling efforts by selectively asking humans to annotate the most important data points from an unlabeled pool and is an example of human-machine interaction. Though active learning has been extensively researched for classification and ranking problems, it is relatively understudied for…
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 mutual information for regression without prior knowledge.
problem Regression tasks without prior model knowledge.
method Mutual information learning formulation, SGD convergence analysis.
result High dimensionality can be beneficial with a threshold.
Locally adaptive interpretable regression improves linear regression's predictability.
problem Linear regression's predictability is limited; it lacks adaptability.
method Locally adaptive interpretable regression (LoAIR) uses neural networks to predict percentile of a Gaussian distribution for regression coefficients.
result LoAIR achieves comparable or better predictive performance than state-of-the-art baselines.
Study proves NN matching is equivalent to Riesz regression for debiased machine learning.
problem Addressing bias in machine learning models.
method Interprets NN matching as Riesz regression and derives it from LSIF.
result NN matching is shown to be equivalent to Riesz regression.
This paper studies the nonparametric modal regression problem systematically from a statistical learning view. Originally motivated by pursuing a theoretical understanding of the maximum correntropy criterion based regression (MCCR), our study reveals that MCCR with a tending-to-zero scale parameter is essentially moda…
Lecture notes on advanced linear regression methods.
problem Understanding the properties of linear regression estimators in high dimensions.
method Proposition-proof exploration of least squares, ridgeless, ridge, and lasso estimators.
result Detailed analysis of the existence, uniqueness, relations, computation, and non-asymptotic properties of these estimators.
Distributed learning is an effective way to analyze big data. In distributed regression, a typical approach is to divide the big data into multiple blocks, apply a base regression algorithm on each of them, and then simply average the output functions learnt from these blocks. Since the average process will decrease th…
Overview of high-dimensional time series regression methods.
problem Estimation and inference with high-dimensional time series data.
method Limit theory for high-dimensional dependent data, asymptotic theory for time series regression, statistical learning methods.
result Main limit theory results and asymptotic theory for high-dimensional time series regression.
Bayesian active learning method improved for censored regression data.
problem Challenges in estimating BALD for censored regression data.
method Derived entropy and mutual information for censored distributions, developed -BALD objective, proposed novel modelling approach.
result Demonstrated -BALD outperforms other methods in censored regression.
DML-IV improves IV regression for learning decision policies by reducing bias.
problem Spurious correlations in offline datasets caused by hidden confounders.
method Double/debiased machine learning (DML) framework to reduce bias in two-stage IV regression.
result DML-IV outperforms state-of-the-art methods and learns high-performing policies.
Unified framework SVAM learns GLMs robustly to adversarial label corruption.
problem Learning GLMs under adversarial label corruption.
method SVAM framework based on variance reduction technique.
result Provable model recovery guarantees superior to state-of-the-art.
This study compares multivariate vs univariate machine learning for multi-output regression.
problem When to use multivariate ensemble techniques over separate univariate models.
method Comparative analysis of different multivariate approaches for multi-output regression.
result Multivariate ensemble techniques outperform separate univariate models in simulations.
Deep Evidence Regression improves credit risk prediction uncertainty.
problem Quantifying uncertainty in credit risk predictions.
method Applying Deep Evidence Regression to credit risk settings.
result Demonstrated improved prediction of Loss Given Default.
The paper reformulates regression in infinite dimensions as an inverse problem, showing it's equivalent to compact inverse problems.
problem Learning a linear operator between Hilbert spaces from empirical observations.
method Reformulates regression as an inverse problem, proving equivalence to compact inverse problems under specific conditions.
result The inverse problem is equivalent to compact inverse problems in terms of spectral properties and regularisation theory.
Improved estimator reduces bias in statistical learning models.
problem Asymptotic bias in classic WDRO estimator.
method Adjusted Wasserstein distributionally robust estimator.
result Asymptotic unbiased estimator with smaller MSE.
Paper develops neural network for distribution regression.
problem Regression with probability measures.
method Develops a novel fully connected neural network (FNN) for distribution inputs.
result Almost optimal learning rates for distribution regression derived.
Fundamentals of Regressionstat.ML
This chapter reviews classic regression methods and their evolution to physics-informed approaches.
problem Finding relationships between variables using regression.
method Introduces traditional and physics-informed regression methods, linking them to computational science.
result Regression methods have evolved from purely statistical to incorporating physical knowledge.
Prototype-based generative replay framework for online continual regression.
problem Addressing the challenge of non-stationary data streams in regression tasks.
method Adaptive output-space discretization model for prototype-based generative replay.
result Reduces forgetting and provides more stable performance.