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

55110165220 · Jun 202019922001200920172026
48 results for quantile coordinate transform

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.

CurveRL optimizes large model reasoning by reweighting prompts based on their rank and density.

problem Improving large language model reasoning through context reweighting.
method Formulated prompt reweighting as a functional derivative, proposing CurveRL based on quantile coordinate transform.
result CurveRL consistently outperforms existing methods across multiple benchmarks.

Proposes QQE for transforming and embedding data distributions.

problem Transforming and embedding data distributions for better representation or visualization.
method Quantile-Quantile Embedding (QQE) using quantile-quantile plot concept.
result QQE allows for better discrimination of classes in some cases.

New algorithm for estimating multivariate quantiles using stochastic optimal transport.

problem Estimating multivariate quantiles from data.
method Stochastic algorithm for entropic optimal transport in Banach spaces, using Fourier coefficients.
result Almost sure convergence of the stochastic algorithm in infinite-dimensional Banach spaces.

Proposes a new feature preprocessing method using kernel density integral transformation.

problem Feature preprocessing for tabular data in machine learning and statistics.
method Kernel density integral transformation as a drop-in replacement or improved alternative to min-max scaling and quantile transformation.
result Frequently outperforms min-max scaling and quantile transformation with hyperparameter tuning.

condLSTM-Q predicts COVID-19 deaths at county level with quantile forecasts.

problem Predicting COVID-19 mortality at fine geographical scales.
method Conditional Long Short-Term Memory networks with quantile output.
result Fine-scale quantile predictions inform about death toll distribution.

New Hermite approximations accelerate convergence with adaptive coordinate transformations.

problem Accelerating convergence of spectral approximations for Hermite expansions.
method Using normalizing flows for adaptive coordinate transformations and deriving error estimates.
result Error estimates for Hermite expansions under adaptive coordinate transformations.

An approach to the modelling of volatile time series using a class of uniformity-preserving transforms for uniform random variables is proposed. V-transforms describe the relationship between quantiles of the stationary distribution of the time series and quantiles of the distribution of a predictable volatility proxy …

2020-02-24abs ↗pdf ↗

Proposes a neural network method to correct residual distortions in coordinate transformations.

problem Nonlinear and spatially dependent distortions in coordinate transformation models.
method Residual-based neural network approach focusing on systematic distortions.
result The method improves accuracy and stability in challenging conditions.

Develops a new method for sampling from Bayesian credible sets using deep generative quantile learning.

problem Sampling from posterior distributions in high-dimensional spaces with intractable likelihoods.
method Uses deep neural networks to implicitly sample from Bayesian credible sets via a push-forward mapping and Monge-Kantorovich depth.
result Demonstrates improved performance and theoretical consistency of the quantile learning framework.

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.

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 ↗

Solves problem of describing transformations for upper triangular Toeplitz operators.

problem Describing coordinate transformations preserving upper triangular Toeplitz form of operator fields.
method Implicit formulas involving matrix-valued functions for describing transformations and Nijenhuis operators.
result Formulas for coordinate transformations and Nijenhuis operators in upper triangular Toeplitz form.

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.

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.

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.

Constructs bivariate quantiles using vine copulas for multivariate analysis.

problem Need for research in multivariate quantiles, especially for bivariate responses.
method Constructs bivariate (conditional) quantiles using vine copula based bivariate regression model with a novel tree sequence graph structure.
result Avoids typical shortfalls of regression like transformations, interactions, collinearity, and quantile crossings.

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.

Quantile normalisation is a popular normalisation method for data subject to unwanted variations such as images, speech, or genomic data. It applies a monotonic transformation to the feature values of each sample to ensure that after normalisation, they follow the same target distribution for each sample. Choosing a "g…

2017-06-01abs ↗pdf ↗

This paper studies distributed estimation and support recovery for high-dimensional linear regression model with heavy-tailed noise. To deal with heavy-tailed noise whose variance can be infinite, we adopt the quantile regression loss function instead of the commonly used squared loss. However, the non-smooth quantile …

2019-06-13abs ↗pdf ↗

Novel SVM approach for extreme quantile regression with heavy tailed inputs.

problem Learning from extreme values in quantile regression.
method Support Vector Machine framework for handling high-dimensional and nonlinear settings.
result Established finite-sample learning guarantees under mild regularity assumptions.

We discuss results for the Ribaucour transformation of curves or of higher dimensional smooth and discrete submanifolds. In particular, a result for the reduction of the ambient dimension of a submanifold is proved and the notion of Ribaucour coordinates is derived using a Bianchi permutability result. Further, we disc…

2017-11-13abs ↗pdf ↗

Natural coordinates for SL3-webs on surfaces are shown to be consistent under triangulation changes.

problem Natural coordinates for SL3-webs on surfaces.
method Showed natural coordinates are consistent under triangulation changes using cluster transformations.
result Natural coordinates for SL3-webs on surfaces are consistent under triangulation changes.

A generalization of exterior calculus is considered by allowing the partial derivatives in the exterior derivative to assume fractional orders. That is, a fractional exterior derivative is defined. This is found to generate new vector spaces of finite and infinite dimension, fractional differential form spaces. The def…

2003-01-10abs ↗pdf ↗

Discrete conjugate systems are quadrilateral nets with all planar faces. Discrete orthogonal systems are defined by the additional property of all faces being concircular. Their geometric properties allow one to consider them as proper discretization of conjugate, resp. orthogonal coordinate systems of classical differ…

2003-03-26abs ↗pdf ↗

This paper solves robust utility maximization with unknown claim dependencies.

problem Investor optimizes utility in the presence of an intractable contingent claim.
method Quantile optimization approach, transforming dynamic problem into static concave optimization.
result Optimal payoffs depend on ambiguity attitude, market conditions, and claim characteristics.