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.

169,341 papers · 148 categories

Trend · papers per month

35810 · Jun 202019922001200920182026
48 results for regressor

Paper evaluates competence measures for DRS systems.

problem Choosing the best measure to quantify competence in DRS systems is challenging.
method Reviewed and adapted eight competence measures for regression problems, compared them on 15 datasets, and evaluated three DRS systems.
result DRS systems outperform individual regressors and static systems, but competence measure choice depends on the problem.

SPACR trains uncertainty-aware regressors directly within a single pass, improving efficiency and validity.

problem Training uncertainty-aware regressors while maintaining efficiency and validity.
method Joint optimization of efficiency and validity during training.
result SPACR consistently provides tighter intervals and better coverage-efficiency trade-offs compared to standard CP and DOICR.

High-precision machine learning reduces particle physics simulations by orders of magnitude.

problem Reducing computational burden in particle physics simulations.
method Developed optimal training strategies and tuned machine learning regressors, including Deep Neural Networks with skip connections and boosted decision trees.
result Significantly reduced computational time by factors of 10^3 to 10^6 over first-principles simulations.

New TSER algorithms outperform existing methods in time series extrinsic regression.

problem Improving time series extrinsic regression models.
method Extended TSER archive, introduced two new algorithms (FreshPRINCE and DrCIF), compared with rotation forest.
result DrCIF and FreshPRINCE models significantly outperform existing methods.

The study evaluates nine machine learning regressors for predicting NASDAQ stock opening prices.

problem Predicting stock market opening prices for profitable trading strategies.
method Nine different machine learning regressors were applied to NASDAQ stock market data.
result The study found that certain regressors outperform others in predicting stock opening prices.

Paper introduces \ell-DER for regression tasks using morphological operators and convex-concave procedure.

problem Developing a universal approximator for regression tasks.
method Introduces \ell-DER model, trains it using a convex-concave procedure (CCP) to minimize least-squares.
result Outperforms other hybrid morphological models and state-of-the-art approaches.

A new algorithm estimates NARMAX models with L1 regularization using coordinate descent.

problem Estimating NARMAX models with interpretability and error regressors.
method Cyclical coordinate descent for L1-regularized NARMAX models with error regressors.
result The method provides interpretable models with fewer important regressors.

We solve a high-dimensional nonlinear model using Gaussian regressors.

problem Recovering a structured signal from high-dimensional data with a nonlinear link function.
method Proposes and analyzes an alternative convex recovery method that treats certain nonlinear link functions as linear in a lifted space.
result Our method successfully recovers the signal when previous methods fail due to a zero proportionality constant.

Study improves flood loss risk models using historical data and rainfall data.

problem Predicting financial losses from flooding events.
method Used neural networks, decision trees, and kernel-based regressors on NFIP dataset, incorporating rainfall data.
result Extreme Gradient Boosting provided the best results, and bias correction improved model performance.

Proposes an ensemble loss function for robust regression.

problem Improving robustness of simple regression models in noisy environments.
method Ensemble techniques applied to a simple regressor with a half-quadratic learning algorithm.
result Significantly improves performance of simple regressors in noisy environments.

Boosting ridge regression for high-dimensional data classification reduces computational cost and improves learning time.

problem High computational demand of inverting regularised covariance matrix in ridge regression for high-dimensional problems.
method Train an ensemble of ridge regressors in randomly projected subspaces, then combine them using adaptive boosting.
result Effective in terms of learning time and improved predictive performance in some cases.

Paper reduces sample complexity for bilinear systems identification to nearly constant.

problem Identifying discrete-time bilinear systems under bounded disturbances.
method Uses trajectory-dependent regressors and polynomial mean-square state growth analysis.
result Proves sample complexity of O~(1/ε)\widetilde{\mathcal O}(1/ε) for estimation error εε.

Novel algorithm identifies nonlinear Granger causal relationships using kernel ridge regression.

problem Identification of nonlinear Granger causal relationships.
method Flexible plug-in architecture with kernel ridge regression using radial basis function.
result Kernel ridge regression in mlcausality achieves competitive AUC scores and more finely calibrated p-values.

Proposes a new test for validating multivariate dynamic regression models.

problem Inadequate exogeneity conditions for conventional model specification tests in dynamic systems.
method Develops a generalized Durbin estimator for multiple-equation systems with dynamic dependencies, and constructs Wald tests.
result Bootstrap-based Wald tests improve finite-sample size control and validate the null hypothesis in multifactor models.

The paper explores the tradeoff between fairness and accuracy in regression models.

problem Characterizing the tradeoff between fairness and accuracy in regression models.
method Provided a lower bound on the error of any fair regressor and extended the result to joint error using Wasserstein distance.
result Lower bounds on the error of fair regressors and their connection to Wasserstein distance.

This study examines the relationship between PLS and OLS regression using eigenvalue distributions.

problem Analyzing the difference between PLS and OLS regression in terms of eigenvalue distributions.
method Examined the distance between PLS and OLS regression coefficients using the Mahalanobis distance and eigenvalue distributions of the regressor covariance matrix.
result Provided a bound on the distance between PLS and OLS regression coefficients that depends only on the eigenvalue distribution of the regressor covariance matrix.

We introduce a new principle for model selection in regression and classification. Many regression models are controlled by some smoothness or flexibility or complexity parameter c, e.g. the number of neighbors to be averaged over in k nearest neighbor (kNN) regression or the polynomial degree in regression with polyno…

2007-02-27abs ↗pdf ↗

FDN improves probabilistic regressors' adaptability to distribution shifts.

problem Overconfidence in modern probabilistic regressors under distribution shift.
method FDN uses input-conditioned distributions over network weights, trained with a Monte Carlo beta-ELBO objective.
result FDN produces predictive mixtures whose dispersion adapts to the input, providing shift-aware uncertainty.

Method selects valid IVs from a large set using clustering and test of overidentifying restrictions.

problem Selecting valid instrumental variables from a large set of candidates.
method Agglomerative hierarchical clustering combined with a test of overidentifying restrictions.
result Achieves oracle properties when the largest group of IVs is valid.

Overparameterized ensembles don't offer generalization benefits over single large models.

problem Theoretical limitations of ensembles in overparameterized settings.
method Using ensembles of random feature (RF) regressors, the paper clarifies how modern ensembles differ from underparameterized counterparts.
result Infinite ensembles of overparameterized RF regressors become pointwise equivalent to single infinite-width RF regressors, and finite width ensembles converge to single models with the same parameter budget.

This paper proposes a fast and accurate method for sparse regression in the presence of missing data. The underlying statistical model encapsulates the low-dimensional structure of the incomplete data matrix and the sparsity of the regression coefficients, and the proposed algorithm jointly learns the low-dimensional s…

2015-03-28abs ↗pdf ↗

Many nonparametric regressors were recently shown to converge at rates that depend only on the intrinsic dimension of data. These regressors thus escape the curse of dimension when high-dimensional data has low intrinsic dimension (e.g. a manifold). We show that k-NN regression is also adaptive to intrinsic dimension. …

2011-10-19abs ↗pdf ↗

Prediction-powered causal inference achieves smaller asymptotic variance than traditional methods.

problem Estimating causal and structural parameters in a semi-supervised setting.
method Combining efficient influence function with debiased machine learning and semi-supervised Riesz regression.
result Asymptotic variances of estimators match the derived efficiency bound.

Adaptive LASSO improves model selection for functional geostatistical data.

problem Modeling georeferenced data with spatiotemporal dynamics and functional coefficients.
method Penalized maximum likelihood estimator with adaptive LASSO penalty for simultaneous selection of spline basis functions and regressors.
result The penalized estimator outperforms the unpenalized estimator in all scenarios tested.

Markov boundary improves tabular prediction but not as expected.

problem Improving tabular prediction using the Markov boundary.
method Evaluation on a synthetic SCM benchmark with feature counts from 40 to 1000.
result Restricting a regressor to the Markov boundary often improves prediction, but existing discovery and training pipelines do not fully exploit this.

Paper examines LASSO for high-dimensional predictive regression, improving its performance in forecasting unemployment.

problem High-dimensional predictive regression with many predictors and unit roots.
method LASSO with new probabilistic bounds for consistency.
result LASSO maintains its asymptotic guarantee with standardized predictors and improves forecasting of unemployment.

The study improves Bitcoin price prediction using hybrid machine learning and enhances interpretability.

problem Improving Bitcoin price prediction accuracy and interpretability.
method Hybrid machine learning algorithms (OLS, LASSO, LSTM, decision tree regressors) and preprocessing techniques for time-series data.
result Linear regression achieves the best performance in predicting Bitcoin prices.

We demonstrate an equivalence between reproducing kernel Hilbert space (RKHS) embeddings of conditional distributions and vector-valued regressors. This connection introduces a natural regularized loss function which the RKHS embeddings minimise, providing an intuitive understanding of the embeddings and a justificatio…

2012-05-21abs ↗pdf ↗