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

Trend · papers per month

24487195 · Jun 202019922001200920172026
48 results for quantile regret

Optimizes quantile and semi-adversarial regret with novel root-logarithmic regularizers.

problem Minimizes regret in adversarial and semi-adversarial online learning.
method FTRL with root-logarithmic regularizers for quantile and semi-adversarial settings.
result Achieves minimax optimal regret bounds in both paradigms.

We show how to reduce the process of predicting general order statistics (and the median in particular) to solving classification. The accompanying theoretical statement shows that the regret of the classifier bounds the regret of the quantile regression under a quantile loss. We also test this reduction empirically ag…

2012-06-27abs ↗pdf ↗

ACP-UCB1 ranks arms based on upper-tail performance, improving stochastic bandit algorithms.

problem Stochastic bandit algorithms often favor arms with strong upper-tail performance, which is not well-addressed by classical mean-reward criteria.
method ACP-UCB1 combines an adaptive conformal estimate of the upper endpoint with a UCB-type optimism bonus.
result ACP-UCB1 achieves logarithmic upper-quantile regret with per-arm contribution \(O( icefrac{\log n}{Δ_j^{\mathrm{ACP}}})\).

AIHT improves online high-dimensional quantile regression by separating support discovery and refinement.

problem Online high-dimensional quantile regression with structural sparsity.
method Adaptive Iterative Hard Thresholding (AIHT) alternates stochastic updates with adaptive hard-thresholding steps.
result AIHT achieves logarithmic regret for the sliding-window objective in high-dimensional settings.

The paper tackles a bandit problem with infinitely many arms per group, aiming to identify the group with the highest quantile reward.

problem Max-quantile group bandit problem with infinitely many arms per group.
method Two-step algorithm: first request arms from each group, then apply a finite-arm max-quantile bandit algorithm.
result Characterization of instance-dependent and worst-case regret, with matching lower bounds.

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.

Improved prediction algorithm for 'easy' sequences with reduced regret.

problem Prediction with expert advice for 'easy' sequences.
method Variant of NormalHedge algorithm using second-order εε-quantile regret bound.
result Second-order εε-quantile regret bound of O(VTlog(VT/ε))O\big(\sqrt{V_T \log(V_T/ε)}\big) for VT>logNV_T > \log N.

We propose and analyze StoROO, an algorithm for risk optimization on stochastic black-box functions derived from StoOO. Motivated by risk-averse decision making fields like agriculture, medicine, biology or finance, we do not focus on the mean payoff but on generic functionals of the return distribution. We provide a g…

2019-04-17abs ↗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 ↗

Novel method for efficient optimization of noisy, expensive hybrid models.

problem Efficient optimization of hybrid models with noisy observations and constraints.
method Constrained Upper Quantile Bound (CUQB) method exploiting composite structure.
result Significantly improved sampling efficiency and theoretical guarantees.

The paper proposes a new policy for optimal treatment allocation based on quantile treatment effects.

problem Optimal treatment allocation policies that target distributional welfare, especially when individuals are heterogeneous.
method The approach involves allocating treatments based on the conditional quantile of individual treatment effects (QoTE), considering both prudent and negligent policymakers.
result The proposed minimax policies are robust to model uncertainty and can be generalized to various settings.

Bayesian approach improves online prediction accuracy without distributional assumptions.

problem Online construction of confidence sets for black-box models.
method Combines empirical distribution with Bayesian regularization to predict quantiles.
result Adaptive algorithm with low regret and correct coverage probability for iid data.

A robust bandit algorithm uses Dirichlet sampling to minimize regret under various distributional assumptions.

problem Robustness of bandit algorithms to model misspecification.
method Dirichlet Sampling (DS) algorithm based on pairwise comparisons and re-sampling of arm observations.
result Different DS variants achieve optimal regret guarantees for bounded distributions and logarithmic regret for semi-bounded distributions.

We consider a multi-armed bandit problem with covariates. Given a realization of the covariate vector, instead of targeting the treatment with highest conditional expectation, the decision maker targets the treatment which maximizes a general functional of the conditional potential outcome distribution, e.g., a conditi…

2020-01-29abs ↗pdf ↗

New algorithms ensure fair selection in combinatorial semi-bandit with unrestricted delays.

problem Fair selection in stochastic combinatorial semi-bandit with delayed feedback.
method Introduced merit-based fairness constraints and new bandit algorithms for reward and fairness.
result Achieved sublinear expected reward and fairness regrets with dependence on delay distribution quantiles.

Proposes methods for online conformal prediction with nested prediction sets across multiple confidence levels.

problem Need for uncertainty quantification with multiple confidence levels in diverse applications.
method Online optimization perspective to enforce nestedness of prediction sets while controlling quantile estimation error.
result Achieves stable coverage across all levels, strictly nested prediction sets, and improved efficiency.

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.

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.

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.

Universal algorithm learns unknown distribution for various decision-making problems.

problem Various statistical measures in contextual sequential decision-making.
method Infinite-dimensional functional regression oracle for cumulative distribution functions.
result Utility regret rate bounded by polynomial decay of eigenvalue sequence.

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.

New quantile methods improve uncertainty quantification across various models.

problem Improper quantile loss limits model flexibility and accuracy.
method Developed new quantile methods that optimize for calibration, sharpness, and centered intervals.
result Improved conditional quantiles and better uncertainty quantification across diverse models.

This paper analyzes quantiles of heavy-tailed distributions, separating projection direction and quantile threshold effects.

problem Analyzing quantiles of heavy-tailed distributions with estimated parameters.
method Introduces a Q-Q orthogonality formulation to separate projection-direction and quantile-threshold effects.
result Decomposes the difference between empirical and population quantiles into three terms.

We develop a novel approach for the construction of quantile processes governing the stochastic dynamics of quantiles in continuous time. Two classes of quantile diffusions are identified: the first, which we largely focus on, features a dynamic random quantile level and allows for direct interpretation of the resultin…

2019-12-23abs ↗pdf ↗

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.

This paper is about index policies for minimizing (frequentist) regret in a stochastic multi-armed bandit model, inspired by a Bayesian view on the problem. Our main contribution is to prove that the Bayes-UCB algorithm, which relies on quantiles of posterior distributions, is asymptotically optimal when the reward dis…

2016-01-06abs ↗pdf ↗

IQ-BART models conditional quantiles using a non-parametric Bayesian approach.

problem Capturing multimodal predictive distributions in time series forecasting.
method Implicit Quantile BART (IQ-BART) augments data with quantile values for non-parametric quantile function estimation.
result IQ-BART provides flexible distribution-free regression with theoretical guarantees.

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.