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,695 papers · 148 categories

Trend · papers per month

57114170227 · Jun 202019922001200920172026
48 results for semiparametric 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.

The paper proposes a method to construct well-calibrated prediction sets for correlated target variables.

problem Constructing well-calibrated prediction sets for correlated target variables.
method The method uses vine copulas to estimate the joint cumulative distribution function of non-conformity scores and improves the asymptotic efficiency of the quantile estimate.
result The method guarantees asymptotically exact coverage and competitive efficiency on real-world regression problems.

The paper introduces a new method for forecasting financial risk using quantile-based modeling.

problem Forecasting Value-at-Risk (VaR) and Expected Shortfall (ES) for financial returns.
method Semiparametric approach using restricted quantile regression to model the conditional scale of financial returns.
result The method provides robust, distribution-free estimates of extreme losses and captures risk dynamics.

This paper offers a simple method for Bayesian regression with unknown transformations.

problem Joint inference of unknown transformations and model parameters in Bayesian regression is computationally inefficient and cumbersome.
method The paper introduces a Bayesian nonparametric model via the Bayesian bootstrap to directly target the posterior distribution of the transformation.
result The approach delivers joint posterior consistency and efficient Monte Carlo inference for the transformation and all parameters.

This paper improves reinforcement learning by estimating return distributions using quantiles.

problem Improving reinforcement learning by estimating return distributions.
method Quantile-based distributional reinforcement learning, using quantile-projected distributional Bellman equations.
result The quantile-based approach achieves optimal sample efficiency and asymptotic efficiency.

This paper improves reinforcement learning by estimating return distributions using quantiles.

problem Improving reinforcement learning by estimating return distributions.
method The paper uses quantile-based distributional reinforcement learning to characterize return distributions.
result The quantile-based approach achieves optimal sample efficiency and asymptotic efficiency.

We consider concepts and models for measuring inequality in the distribution of resources with a focus on how inequality varies as a function of covariates. Lorenz introduced a device for measuring inequality in the distribution of income that indicates how much the incomes below the uth^{th} quantile fall short of the…

2006-10-27abs ↗pdf ↗

Combines VaR and ES forecasts for cryptocurrency market risk management.

problem Improving tail risk forecasts in financial markets.
method Proposes semiparametric and parametric combination frameworks.
result Combined forecasts outperform individual VaR and ES forecasts.

Parallel gradient boosting speeds up multi-output regression.

problem Efficiently predicting entire conditional distributions.
method Modification of gradient boosting to use a common descent direction.
result Significantly faster and comparable performance to state-of-the-art boosting libraries.

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.

New algorithm identifies best arm in semiparametric bandits with near optimal efficiency.

problem Fixed-confidence Best Arm Identification in semiparametric bandits with unknown baseline shift.
method Phase-elimination algorithm based on orthogonalized regression design.
result Nearly optimal high-probability sample-complexity upper bound established.

New method for semiparametric bandits reduces regret to optimal levels.

problem Complex reward structures in semiparametric bandits.
method Experimental-design approach with sharp regret bound and PAC bound.
result Minimax regret of ildeO(dT) ilde{O}(\sqrt{dT}) and logarithmic regret under positive suboptimality gap.

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.

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.

Semiparametric STAR model improves mental health data analysis.

problem Overdispersed, zero-inflated, bounded count data in self-reported mental health surveys.
method STAR transformation and rounding of latent Gaussian model, nonparametric transformation estimation, EM algorithm for maximum likelihood.
result Substantial improvements in goodness-of-fit compared to existing models.

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.

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…

2020-01-08abs ↗pdf ↗

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.

A new method improves quantile regression for high-dimensional data.

problem Handling heteroscedastic, multimodal, or skewed data in quantile regression.
method Dynamic prototypes-based probability density estimation with conformalized high-density quantile regression.
result Enhanced prediction regions with valid coverage guarantees and scalability to higher dimensions.

Paper proposes differentially private quantile regression for high-dimensional data.

problem Privacy concerns in big data with heterogeneous sensitive personal information.
method Newton-type transformation for reformulating quantile regression into an OLS problem; iterative updates for estimation; debiased estimator for inference; communication-efficient bootstrap.
result Near-optimal statistical accuracy and formal privacy guarantees achieved.