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

62124185247 · Jun 202019922001200920172026
48 results for penalized quantile regression

The paper proposes a method for predicting equity premium using penalized quantile regression.

problem Heteroscedasticity and heavy-tails in equity premium prediction.
method Penalized quantile regression with consistent variable selection across multiple quantiles.
result The proposed method outperforms benchmark methods and reveals interesting predictor relationships.

Develops a fast algorithm for high-dimensional LASSO penalized quantile regression.

problem Computational challenges in high-dimensional 1\ell_1 penalized quantile regression.
method Pathwise coordinate descent algorithm to solve exact coordinatewise minimum of the nonsmooth loss function.
result Algorithm runs faster than existing alternatives and maintains estimation accuracy.

A new algorithm speeds up sparse-penalized quantile regression solving non-convex penalties.

problem Sparse-penalized quantile regression with non-convex penalties.
method Single-loop smoothing ADMM (SIAD) algorithm for faster convergence.
result SIAD method outperforms existing approaches in solving sparse-penalized quantile regression.

PSQRNN model forecasts electricity consumption in China by integrating neural networks and quantile regression.

problem Electricity forecasting in China due to regional economic, social, and natural conditions.
method PSQRNN combines neural networks and semiparametric quantile regression to model electricity consumption.
result PSQRNN model outperforms traditional methods in forecasting electricity consumption in China.

Proposes a new robust expectile regression method for high-dimensional data.

problem Heterogeneity in high-dimensional data with heteroscedastic variance or inhomogeneous covariate effects.
method Iteratively reweighted ℓ1-penalization for robust expectile regression (retire).
result Oracle convergence rate after log(log d) iterations in high-dimensional settings.

It is well known that quantile regression model minimizes the portfolio extreme risk, whenever the attention is placed on the estimation of the response variable left quantiles. We show that, by considering the entire conditional distribution of the dependent variable, it is possible to optimize different risk and perf…

2015-07-01abs ↗pdf ↗

Paper presents a new probabilistic approach for high-dimensional quantile prediction.

problem High-dimensional quantile prediction challenges in robust statistical methods.
method Pseudo-Bayesian framework with scaled Student-t prior and Langevin Monte Carlo.
result Demonstrates strong theoretical guarantees and competitive performance in simulations and real-world data.

Optimal inference in distributed quantile regression without stringent scaling conditions.

problem Challenges in achieving optimal inference in distributed quantile regression due to the non-smooth nature of the QR loss function.
method Double-smoothing approach applied to local and global objective functions, with a trade-off between communication cost and statistical error.
result Established a finite-sample theoretical framework for distributed QR estimators, showing a trade-off between communication cost and statistical error.

Folded concave penalization methods have been shown to enjoy the strong oracle property for high-dimensional sparse estimation. However, a folded concave penalization problem usually has multiple local solutions and the oracle property is established only for one of the unknown local solutions. A challenging fundamenta…

2012-10-22abs ↗pdf ↗

In spite of the recent surge of interest in quantile regression, joint estimation of linear quantile planes remains a great challenge in statistics and econometrics. We propose a novel parametrization that characterizes any collection of non-crossing quantile planes over arbitrarily shaped convex predictor domains in a…

2015-07-11abs ↗pdf ↗

We relax demographic parity in regression by enforcing parity at quantile levels and score thresholds.

problem Enforcing full distributional fairness in regression can lead to substantial accuracy loss.
method Introduce (\ell, Z)-fair predictor, derive closed-form solutions, and develop post-processing algorithm.
result The risk gap to the continuous optimum vanishes as the grid is refined, and we enable targeted fairness corrections.

The paper develops robust risk measures for uncertain loss positions.

problem Risk assessment for loss positions with uncertain distributions.
method Robust optimized certainty equivalents and generalized quantiles are proposed and analyzed.
result Robust expectiles with specific penalization functions are coherent risk measures.

Investigates methods to regularize quantile regression for accurate predictions.

problem Improving accuracy and fairness in quantile regression predictions.
method Various regularization techniques including expected pinball loss, monotonicity constraints, and rate constraints.
result Deep lattice networks can maintain non-crossing quantiles and improve calibration and fairness.

Proposes QGC to distinguish between lower and upper tail connectivity in financial networks.

problem Identifying systemically important firms using financial data.
method Quantile Granger Causality (QGC) using Lasso penalized quantile regressions.
result QGC networks detect systemic risk more accurately than mean-based networks.

SCQRNN prevents quantile crossing and improves computational efficiency.

problem Quantile crossing issue in regression models.
method Integrates ad hoc sorting in training to prevent quantile crossing and enhance computational efficiency.
result SCQRNN achieves faster convergence and non-intersecting quantiles.

Quantile regression using random forest proximities improves prediction and uncertainty quantification.

problem Forecasting corporate bond volume with uncertainty quantification.
method Introduced a novel approach to compute quantile regressions from random forests using proximity metrics.
result Superior performance in approximating conditional target distributions and prediction intervals.

Ensemble of regression trees have become popular statistical tools for the estimation of conditional mean given a set of predictors. However, quantile regression trees and their ensembles have not yet garnered much attention despite the increasing popularity of the linear quantile regression model. This work proposes a…

2016-07-10abs ↗pdf ↗

Proposes a method to estimate conditional quantiles using both high-fidelity and low-fidelity data.

problem Difficulty in estimating conditional quantiles with scarce high-fidelity data.
method Two-stage, model-agnostic method using local quantile link and level function estimation.
result The method yields more accurate quantile estimates and tighter prediction intervals.

Random forests are powerful non-parametric regression method but are severely limited in their usage in the presence of randomly censored observations, and naively applied can exhibit poor predictive performance due to the incurred biases. Based on a local adaptive representation of random forests, we develop its regre…

2019-02-08abs ↗pdf ↗

The paper decouples shrinkage and selection in Bayesian Quantile Regression.

problem Improving prediction accuracy in high-dimensional Bayesian Quantile Regression.
method Two-step procedure: shrinkage through continuous priors, sparsification through SAVS.
result The method reduces bias and provides interpretable variable selection.

CQNPs enhance predictive performance and distribution modeling using quantile regression.

problem Limited predictive likelihood of Gaussian models for complex distributions.
method Introducing Conditional Quantile Neural Processes (CQNPs) that focus on estimating informative quantiles.
result Significant improvements in predictive performance and better modeling of multimodal distributions.

Sparse Gaussian process quantile regression tackles computational challenges in Bayesian quantile regression.

problem Nonconjugacy and computational cost in Gaussian process quantile regression.
method Sparse Gaussian process framework with Laplace approximation, adaptive inducing-input placement, and sequential data acquisition.
result Accuracy of Laplace approximation and effectiveness of adaptive mechanisms in reducing predictive uncertainty.

Quantile regression undercovers true uncertainty, revealing a bias in high dimensions.

problem Under-coverage bias in uncertainty estimation by quantile regression.
method Theoretical study on coverage of uncertainty estimation algorithms in learning quantiles.
result Quantile regression undercovers true uncertainty, revealing a bias in high dimensions.

Quantile regression with ReLU networks achieves minimax rates for various function types.

problem Estimating quantiles from covariates with neural networks.
method Quantile regression with rectified linear unit (ReLU) neural networks.
result ReLU networks achieve minimax rates for broad collections of function types.

Bayesian method improves quantile estimation and subset selection.

problem Estimating specific percentiles of the response distribution.
method Bayesian decision analysis perspective, optimal point estimates, interpretable uncertainty quantification, scalable subset selection.
result Substantial gains in quantile estimation accuracy, inference, and variable selection over competitors.

Paper tackles distributed quantile regression with improved efficiency and support recovery.

problem Challenges in distributed estimation and support recovery for high-dimensional linear quantile regression.
method Transformed quantile regression into least-squares optimization, applied double-smoothing approach, developed efficient algorithm.
result Achieved near-oracle convergence rate and high support recovery accuracy.

A scalable PyTorch framework for non-crossing quantile regression.

problem Non-crossing quantile regression to avoid impossible negative probability densities.
method CJQR-ALM combining Augmented Lagrangian Method, differentiable pinball loss, and L-BFGS optimization.
result Achieves near-zero crossing rates on large datasets within minutes.

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.