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

200400600800 · Jun 202019922001200920172026
48 results for differentiable quantile function

Quantum algorithm samples from SDEs using DQCs and quantile mechanics.

problem Sampling from solutions of stochastic differential equations.
method Differentiable quantum circuits (DQCs) encoding latent variables, quantile mechanics.
result Quantum algorithm generates time-series from SDEs.

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.

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.

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.

Paper proposes a federated learning method for quantile inference with local differential privacy.

problem Federated learning of quantile inference under local differential privacy constraints.
method Local stochastic gradient descent with randomized mechanism for privacy and efficiency.
result Asymptotic normality and functional central limit theorem for the proposed estimator.

Sorting an array is a fundamental routine in machine learning, one that is used to compute rank-based statistics, cumulative distribution functions (CDFs), quantiles, or to select closest neighbors and labels. The sorting function is however piece-wise constant (the sorting permutation of a vector does not change if th…

2019-05-28abs ↗pdf ↗

We develop a method for quantile-based sensitivity analysis in models with discontinuities.

problem Uncertainty in interpreting discontinuous models using traditional derivatives.
method Quantile-based derivatives for discontinuous models with discrete inputs.
result Derivatives of quantile-based outputs are well-defined and provide meaningful insights.

Efficiently estimates quantiles and maximum in unbounded datasets with differential privacy.

problem Efficiently estimating quantiles and maximum in unbounded datasets with differential privacy.
method Simple invocation of a subroutine called AboveThreshold, iteratively called in Sparse Vector Technique.
result Improved estimates on highest quantiles with robustness and accuracy.

New analysis improves SGD for robust and quantile regression with sub-quadratic convergence.

problem Improving SGD for robust and quantile regression with sub-quadratic convergence.
method Piecewise Lyapunov function for first-order differentiable functions.
result First geometrical convergence result for sub-quadratic SGD.

This paper analyzes convergence of DP-SGD with adaptive quantile clipping.

problem Empirical success of adaptive clipping methods lacks theoretical understanding.
method Comprehensive convergence analysis of SGD with quantile clipping (QC-SGD).
result Establishes theoretical guarantees for DP-QC-SGD, revealing relationships between quantile selection, step size, and convergence.

Study quantile multi-armed bandits for identifying the best arm with a specified quantile level.

problem Identifying the arm with the highest quantile in multi-armed bandits with private rewards.
method Proposed a (non-private) and differentially private successive elimination algorithms for best-arm identification.
result The proposed algorithms are essentially optimal for quantile bandit problems, with finite sample complexity even for distributions with infinite support-size.

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 ↗

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.

Study on risk contributions of portfolios using lambda quantile risk measures.

problem No known allocation rule for non-positively homogeneous risk measures.
method Defined lambda quantiles on portfolio compositions, derived derivatives, and introduced generalized Euler contributions.
result Explicit formulae for the derivatives of lambda quantiles, showing their homogeneity properties.

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.

We introduce a new category of multivariate conditional generative models and demonstrate its performance and versatility in probabilistic time series forecasting and simulation. Specifically, the output of quantile regression networks is expanded from a set of fixed quantiles to the whole Quantile Function by a univar…

2019-07-24abs ↗pdf ↗

The risk premium of a policy is the sum of the pure premium and the risk loading. In the classification ratemaking process, generalized linear models are usually used to calculate pure premiums, and various premium principles are applied to derive the risk loadings. No matter which premium principle is used, some risk …

2020-02-05abs ↗pdf ↗

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.

Paper introduces a new robust loss function for RL.

problem Heuristic selection of threshold parameters in quantile Huber loss.
method Derived from Wasserstein distance, captures noise in quantile values.
result Enhances robustness against outliers and enables parameter adjustment.

Paper introduces P-FGD for online quantile regression models.

problem Training nonparametric additive quantile regression models in online settings.
method Projected functional gradient descent algorithm (P-FGD) for pinball loss.
result P-FGD achieves minimax optimal consistency rate O(t2s2s+1)O(t^{-\frac{2s}{2s+1}}).

Locally private online quantile regression method addresses privacy constraints.

problem Estimating and inferring quantile regression under local differential privacy constraints.
method Developed a finite-alphabet channel where users compute local contributions, apply randomized response, and send reports. A public decoder corrects distortion and reconstructs inputs for averaging.
result Established local privacy, decoder unbiasedness, consistency, asymptotic normality, and inference for scalar contrasts.

Paper converts quantiles to cumulative distribution functions to simplify risk measures.

problem Technical assumptions in risk measure calculations.
method Invention of converting integrated quantiles to integrated cumulative distribution functions.
result Avoids the need for probability density function existence.

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 ↗

New method for risk quantification using quantile processes and measure distortions.

problem Risk quantification and valuation in financial markets.
method Develops a novel stochastic valuation principle based on probability measure distortions induced by quantile processes.
result Introduces a system of subjective probability measures that indexes a stochastic valuation principle susceptible to probability measure distortions.

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 ↗

A new method for modeling insurance claim frequencies using random proportions.

problem Inaccurate fitting of classical distributions to insurance claim frequency data.
method Modeling claim frequencies using random proportions of insurance contracts and applying goodness-of-fit tests.
result A new statistical approach for better modeling insurance claim frequencies.

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.

Paper analyzes statistical properties of log-cosh loss function.

problem No statistical analysis of log-cosh loss function in literature.
method Presented statistical properties of log-cosh loss function, compared to Cauchy distribution, and examined various statistical procedures.
result Characterized statistical properties of log-cosh loss function, including distribution, likelihood function, and Fisher information.

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.

The study improves VaR forecast accuracy by modeling conditional quantile dynamics.

problem Improving the accuracy of Value-at-Risk (VaR) forecasts for time-varying quantiles.
method Time-varying modeling of VaR, evaluation via simulation, asymmetric Mean Absolute Deviation loss function.
result Substantial improvements in forecasting conditional quantiles by maintaining predicted quantile unchanged.