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

Trend · papers per month

275481108 · May 202619922001200920172026
48 results for quantile aggregation

New bounds for quantile aggregation unify and clarify existing methods.

problem Analytical bounds for quantile aggregation with dependence uncertainty.
method Using inf-convolution of quantile-based risk measures, establish new analytical bounds called convolution bounds.
result Convolution bounds are the best available and provide sharp results in many cases.

The paper examines risk aggregation under mixtures of marginals, finding that more homogeneous distributions lead to larger uncertainty.

problem Investigating the impact of mixing on risk aggregation uncertainty.
method Analyzes ordering relations and inequalities for aggregation sets under distribution and quantile mixtures.
result More homogeneous marginals result in larger aggregation sets, indicating greater model uncertainty.

Researchers improve deep ensemble forecast aggregation methods.

problem Aggregating forecast distributions from deep ensembles for better predictive performance.
method Comprehensive analysis of twelve benchmark data sets, comparing probability- and quantile-based aggregation methods for three neural network-based approaches.
result A general quantile aggregation framework for deep ensembles improves predictive performance in various settings.

Paper finds robust ΛΛ-quantiles equal to extremal distributions.

problem Investigating robust models for ΛΛ-quantiles with partial loss information.
method Extending classical quantiles using ΛΛ-quantiles and applying results from robust quantiles.
result Robust ΛΛ-quantiles equal to ΛΛ-quantiles of extremal distributions.

New method improves forecast accuracy using CRPS for probabilistic predictions.

problem Improving forecast accuracy for probabilistic predictions, especially in the tails of distributions.
method Introduces a new weighting method for pointwise CRPS learning, optimizing across quantiles.
result Proposed fully adaptive Bernstein online aggregation (BOA) method for pointwise CRPS online learning has optimal convergence properties.

TQF models multivariate uncertainty by learning conditional quantiles.

problem Challenges in fully nonparametric estimation of multivariate conditional distributions.
method Tomographic Quantile Forests (TQF) learns conditional quantiles of directional projections.
result TQF reconstructs multivariate conditional distribution efficiently without convexity restrictions.

Study finds significant premium for low-beta stocks in firm-level idiosyncratic return distributions.

problem Understanding the role of common idiosyncratic quantile factors in asset pricing.
method Quantile factor analysis to extract common idiosyncratic quantile factors with asymmetric pricing effects.
result Significant premium for innovations to the lower-tail factor: high-beta stocks outperform low-beta stocks by around 7-8% per year.

Paper provides new bounds for risk aggregation and sharing.

problem Quantitative risk management and robust risk aggregation with dependence uncertainty.
method Established new inequality for RVaR, derived extended convolution bounds, and analyzed risk sharing for averaged quantiles.
result Extended convolution bounds for robust risk aggregation and risk sharing, providing sharpness conditions and explicit expressions.

This paper studies the inference problem in quantile regression (QR) for a large sample size nn but under a limited memory constraint, where the memory can only store a small batch of data of size mm. A natural method is the naïve divide-and-conquer approach, which splits data into batches of size mm, computes the l…

2018-10-18abs ↗pdf ↗

A motif-based framework identifies local spillover structures in financial markets.

problem Aggregate risk spillovers obscure local interaction patterns in systemic risk.
method Develops a motif-based framework using multiscale backbones and colored motifs.
result Motif-based portfolios outperform traditional benchmarks on risk-adjusted returns.

Using Monte Carlo simulation to calculate the Value at Risk (VaR) as a possible risk measure requires adequate techniques. One of these techniques is the application of a compound distribution for the aggregates in a portfolio. In this paper, we consider the aggregated loss of Gamma distributed severities and estimate …

2017-02-14abs ↗pdf ↗

We propose strategies to estimate and make inference on key features of heterogeneous effects in randomized experiments. These key features include best linear predictors of the effects using machine learning proxies, average effects sorted by impact groups, and average characteristics of most and least impacted units.…

2017-12-13abs ↗pdf ↗

We aim to design strategies for sequential decision making that adjust to the difficulty of the learning problem. We study this question both in the setting of prediction with expert advice, and for more general combinatorial decision tasks. We are not satisfied with just guaranteeing minimax regret rates, but we want …

2015-02-27abs ↗pdf ↗

Conformal prediction is a popular tool for providing valid prediction sets for classification and regression problems, without relying on any distributional assumptions on the data. While the traditional description of conformal prediction starts with a nonconformity score, we provide an alternate (but equivalent) view…

2019-10-23abs ↗pdf ↗

New method for robustly estimating treatment effects across different risk levels.

problem Missing risks and tail events in CATE, especially in aggregate analyses.
method Constructing a pseudo-outcome and regressing it on covariates using any regression learner.
result Robust and model-agnostic learning of conditional distributional treatment effects (CDTE).

New method estimates SW distance using CDFs for scalable data parallelism.

problem Estimating SW distance efficiently for large datasets.
method Estimators based on CDFs of projected measures, avoiding sorting.
result Efficient estimation for large datasets and federated learning.

UTOPIA aggregates multiple prediction intervals efficiently.

problem Constructing optimal prediction intervals for various real-world data problems.
method UTOPIA is a universally trainable strategy using linear or convex programming.
result UTOPIA constructs prediction intervals with small average width and high coverage probability.

Existing approaches for training neural networks with user-level differential privacy (e.g., DP Federated Averaging) in federated learning (FL) settings involve bounding the contribution of each user's model update by clipping it to some constant value. However there is no good a priori setting of the clipping norm acr…

2019-05-09abs ↗pdf ↗

Efficient tests for various statistical problems using incomplete U-statistics.

problem Nonparametric tests for two-sample, independence, and goodness-of-fit problems.
method Proposes MMDAggInc, HSICAggInc, and KSDAggInc tests aggregating over multiple kernel bandwidths.
result Aggregated tests provide a solution to the kernel selection problem and achieve optimal rates.

The paper presents a machine learning framework to combine weather forecasts from multiple models.

problem Combining forecasts from different NWP models with varying biases and limitations.
method Three-stage framework using Quantile Regression Forests and quantile averaging.
result The framework generates well-calibrated probabilistic weather forecasts suitable for decision support.

CDP reduces point cloud dimensions by preserving detour-induced local non-convexity.

problem Preserving local non-convexity in point cloud dimensionality reduction.
method CDP builds a k-NN graph, identifies admissible pairs, aggregates normalized directions, and uses top-k eigenvectors for projection.
result CDP provides verifiable guarantees on post-projection distortion and direction energy.

Adaptive probabilistic load forecasting improves performance in power systems.

problem Complexity of electricity load forecasting due to changing drivers and local generation.
method Adaptive probabilistic approach using Kalman filter and online gradient descent.
result Adaptive probabilistic forecasts improve performance in both point and probabilistic forecasting.

New vine copula method forecasts portfolio risk measures robust to market downturns.

problem Inaccurate risk measure estimation for financial portfolios due to lack of cross-dependency capture.
method Combines vine copulas with ARMA-GARCH models for marginal risk estimation.
result Portfolio is robust to American market downturns but not European market.

Basel II and Solvency 2 both use the Value-at-Risk (VaR) as the risk measure to compute the Capital Requirements. In practice, to calibrate the VaR, a normal approximation is often chosen for the unknown distribution of the yearly log returns of financial assets. This is usually justified by the use of the Central Limi…

2013-11-01abs ↗pdf ↗

New method learns interaction-aware orderbook representation for better intraday electricity price forecasting.

problem Challenges in probabilistic intraday electricity price forecasting due to dynamic orderbook microstructure.
method OrderFusion: an end-to-end and parameter-efficient probabilistic forecasting model that learns interaction-aware representation of buy-sell dynamics.
result Consistent improvements over conventional baselines in probabilistic forecasting of CID price indices.

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.

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.

Develops a method to ensure accurate quantile forecasts across multiple levels.

problem Ensuring accurate quantile forecasts at multiple levels, even under distribution shifts.
method Multi-level quantile tracker (MultiQT) wraps around any forecaster to produce calibrated forecasts.
result Guaranteed calibration of quantile forecasts at multiple levels, even against adversarial shifts.

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.

Sequential quantile estimation refers to incorporating observations into quantile estimates in an incremental fashion thus furnishing an online estimate of one or more quantiles at any given point in time. Sequential quantile estimation is also known as online quantile estimation. This area is relevant to the analysis …

2015-07-17abs ↗pdf ↗

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.

Supervised learning is an active research area, with numerous applications in diverse fields such as data analytics, computer vision, speech and audio processing, and image understanding. In most cases, the loss functions used in machine learning assume symmetric noise models, and seek to estimate the unknown function …

2015-11-12abs ↗pdf ↗

Smoothed SGD improves quantile estimation without crossing curves.

problem Estimating quantiles without crossing estimated curves.
method Smoothed SGD algorithm with Bahadur representation and Gaussian approximation.
result Smoothed SGD provides non-asymptotic tail probability bounds and a Gaussian approximation for quantile estimates.

Private estimation of many quantiles using differential privacy.

problem Estimating quantiles of a distribution privately.
method Two approaches: 1) Private estimation of empirical quantiles, 2) Uniform density estimation.
result There is a tradeoff between estimating quantiles at specific points and uniformly estimating the quantile function.

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.