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

174348522696 · Jun 202019922001200920172026
48 results for statistical distribution

A method uses neural networks to approximate sampling distributions of test statistics.

problem Accurate modeling of p-value functions or cdfs for correct confidence set coverage.
method Uses neural networks to model the cdf of test statistics, approximating sampling distributions.
result Neural network approximations of sampling distributions are effective and simple.

We define and study the statistical models in exponential family form whose sufficient statistics are the degree distributions and the bi-degree distributions of undirected labelled simple graphs. Graphs that are constrained by the joint degree distributions are called dKdK-graphs in the computer science literature and…

2014-11-14abs ↗pdf ↗

A new test statistic measures discrepancy between conditional distributions.

problem Measuring the discrepancy between two conditional distributions.
method Proposes a Bregman matrix divergence-based statistic that avoids explicit distribution estimation.
result The new statistic inherits high-order statistics and demonstrates utility in multi-task learning, concept drift detection, and feature selection.

Paper develops online statistical inference methods for stochastic optimization using Kiefer-Wolfowitz algorithms.

problem Online statistical inference of model parameters in stochastic optimization problems.
method Kiefer-Wolfowitz algorithm with random search directions, asymptotic distribution analysis.
result Developed valid confidence intervals for online statistical inference.

Simple methods combine statistical tests for out-of-distribution detection.

problem Detecting data points not following the training distribution.
method Combining classical parametric tests (Rao's score test) and a typicality test.
result Combining Fisher's method of test statistics improves out-of-distribution detection accuracy.

Paper develops efficient algorithms for robust distributed learning with statistical guarantees.

problem Limited communication power and adversarial node behaviors in distributed learning.
method Surrogate likelihood framework and median/trimmed mean operations.
result Provable robustness against Byzantine failures and optimal statistical rates.

Investigates the number of experiments needed for statistical significance in medication testing.

problem Determining the number of experiments needed for a statistically significant result.
method Examines binomial and general probability distributions, considering placebo efficacy and varying distributions.
result The number of experiments needed can be significantly higher when placebo efficacy is considered.

A statistical framework for removing unwanted data domains in machine learning.

problem Removing unwanted data domains in machine learning while preserving desired performance.
method Modeling domains as probability distributions and using hypothesis testing to select samples to remove.
result Characterization of allowable edited data distributions and removal-preservation Pareto frontiers for various distribution families.

Method learns statistics of return distributions via neural networks and maximum mean discrepancy.

problem Learning probability distributions in reinforcement learning.
method Maximum mean discrepancy (MMD) for learning unrestricted statistics of return distributions.
result Method outperforms standard distributional RL baselines on Atari games.

Paper improves statistical efficiency of median-of-means estimator for Byzantine robust distributed inference.

problem Byzantine robustness in distributed learning systems.
method Variance reduced median-of-means (VRMOM) estimator for Byzantine robust distributed inference.
result Achieves a fast convergence rate with only a constant number of rounds of communications.

The paper studies quantile contributions and their relationship with order statistics in heavy-tailed distributions.

problem Challenges of classical statistical models in heavy-tailed distributions.
method Theoretical study of quantile contribution statistic and its relationship with order statistics. Derivation of closed-form expression for joint CDF of order statistics and quantile contributions.
result Established asymptotic normality of quantile contributions and characterized their limiting distribution.

Generative models are reinterpreted in statistical terms, enabling better understanding and inference.

problem Insufficient interpretability of generative models in statistical terms.
method Flow matching and orthogonalization/cross-fitting in double/debiased machine learning.
result Generative models can be used to estimate nuisance components while maintaining inferential validity.

The paper extends Bochner's technique to singular distributions on manifolds.

problem Analyzing the curvature and null space of Hodge Laplacian on singular distributions.
method Defining modified statistical connection, exterior derivative, and Weitzenbock type curvature operator.
result Derivation of Bochner-Weitzenbock type formula leading to vanishing theorems.

We present a unifying framework for designing and analysing distributional reinforcement learning (DRL) algorithms in terms of recursively estimating statistics of the return distribution. Our key insight is that DRL algorithms can be decomposed as the combination of some statistical estimator and a method for imputing…

2019-02-21abs ↗pdf ↗

New algorithms improve distributional TD learning with linear approximations.

problem Estimating return distributions in reinforcement learning.
method Fine-grained analysis of linear-categorical Bellman equation, variance reduction techniques.
result Tight sample complexity bounds for distributional TD learning with linear approximations.

New framework controls statistical dispersion for high-stakes applications.

problem Understanding and controlling the dispersion of loss distributions in high-stakes applications.
method Simple yet flexible framework for distribution-free control of statistical dispersion measures.
result Proposed methods control statistical dispersion measures with societal implications.

Efficiently transforms samples from various statistical models.

problem Approximately transforming samples from one statistical model to another without knowing the source model's parameters.
method Constructs computationally efficient procedures to reduce uniform, Erlang, and Laplace models to general target families.
result Establishes nonasymptotic reductions between canonical high-dimensional problems, such as mixtures of experts, phase retrieval, and signal denoising.

Proposes a new measure to evaluate stability of statistical parameters under distributional shifts.

problem Difficulty in transferring knowledge across data sets due to distributional changes.
method Introduces a measure of instability quantifying sensitivity of statistical parameters to Kullback-Leibler divergence and directional shifts.
result The proposed measure can elucidate the type of shifts a parameter is sensitive to and improve estimation accuracy under shifted distributions.

Paper develops a distributed debiased estimator for sparse statistical inference.

problem High computational costs in debiased estimator construction for high-dimensional models.
method Develops a multi-round distributed debiased estimator using both labeled and unlabelled data.
result Unlabeled data improves statistical rate of each iteration in distributed setup.

Paper explores Elliptical Wishart distributions in signal processing and machine learning.

problem Estimating parameters of Elliptical Wishart distributions.
method Proposes fixed point and Riemannian optimization algorithms for maximum likelihood estimation.
result Characterizes existence, uniqueness, and convergence of the MLE.

Study on distributional TD learning with linear approximations for better return estimation.

problem Estimating the return distribution of a policy in reinforcement learning.
method Finite-sample analysis of distributional TD learning with linear function approximation, using the linear-categorical Bellman equation and exponential stability arguments for products of random matrices.
result Sample complexity of linear distributional TD learning matches that of classic linear TD learning, indicating similar difficulty in estimating return distribution versus its expectation.

New method ensures generated data statistics match real data distributions.

problem Ensuring generated data statistics match real data distributions in GANs.
method Added a new loss term to the generator loss function using f-divergences and kernel density estimation.
result Improved performance on synthetic and real-world datasets.

Investigates statistical properties of perturb-softmax and perturb-argmax distributions.

problem Underexplored statistical properties of Gumbel-Softmax and Gumbel-Argmax distributions.
method Investigates convexity and differentiability to determine completeness and minimality of these distributions.
result Identifies parameters that admit complete and minimal representation of probability distributions.

DRIFT uses neural flows to replace distributional regression models.

problem Lack of neural network representations for distributional regression models.
method Inverse flow transformations (DRIFT) for distributional regression.
result Neural representations in DRIFT match classical statistical methods in performance.

New formulae identify discrete probability laws without needing normalization constants.

problem Characterizing non-normalized discrete probability distributions.
method Derive explicit formulae for mass functions using Stein's method.
result Developed tools for solving statistical problems without normalization constants.

We find a remarkable agreement between the statistics of a randomly divided interval and the observed statistical patterns and distributions found in horse racing betting markets. We compare the distribution of implied winning odds, the average true winning probabilities, the implied odds conditional on a win, and the …

2016-12-08abs ↗pdf ↗

Study on length distribution of random multicurves on large genus surfaces converging to Poisson-Dirichlet distribution.

problem Length statistics of random multicurves on large genus hyperbolic surfaces.
method Analytical proof of convergence to Poisson-Dirichlet distribution as genus tends to infinity.
result Mean lengths of the three longest components converge to specific percentages of total length as genus increases.

We propose a model for price formation in financial markets based on clearing of a standard call auction with random orders, and verify its validity for prediction of the daily closing price distribution statistically. The model considers random buy and sell orders, placed following demand- and supply-side valuation di…

2019-04-16abs ↗pdf ↗

LLMs struggle to generate random numbers from statistical distributions, leading to biased results in applications.

problem LLMs' inability to generate random numbers accurately from specified distributions.
method Dual-protocol design: Batch Generation and Independent Requests, benchmarking 11 models across 15 distributions.
result Sampling fidelity degrades with distributional complexity and horizon, leading to systematic biases in downstream applications.

The Wasserstein metric is an important measure of distance between probability distributions, with applications in machine learning, statistics, probability theory, and data analysis. This paper provides upper and lower bounds on statistical minimax rates for the problem of estimating a probability distribution under W…

2018-02-24abs ↗pdf ↗

Detects which features have shifted in data distributions.

problem Identifying which specific features have caused a distribution shift.
method Formalizes the problem as multiple conditional distribution hypothesis tests, proposes non-parametric and parametric statistical tests, and uses a test statistic based on the density model score function.
result Demonstrates methods for identifying when and where a shift occurs in multivariate time-series data.

AI needs causal inference to avoid being just a correlation machine.

problem AI's inability to distinguish correlation from causation.
method Develops a unified framework connecting various causal statistical estimators and proves a Statistical Necessity Theorem for causal generalization.
result AI systems without causal grounding are brittle and biased, highlighting the need for causal statistics.

The distribution of money is analysed in connection with the Boltzmann distribution of energy in the degenerate states of molecules. Plots of the population density of income distribution for various countries are well reproduced by a Gamma function, confirming the validity of the statistical distribution at equilibriu…

2003-06-12abs ↗pdf ↗

Paper analyzes statistical efficiency of TD learning in Hilbert spaces with Freedman's inequality.

problem Statistical efficiency of distributional TD learning in Hilbert spaces.
method Non-parametric distributional TD (NTD) and variance-reduced variants of NTD and CTD.
result Sharp statistical rates achieved through novel Freedman's inequality in Hilbert spaces.

This paper strengthens the central limit theorem for order statistics using relative entropy.

problem Establishing a stronger mode of convergence for central limit behavior of order statistics.
method Using relative entropy to ensure a stronger mode of convergence for central limit behavior of order statistics.
result An order O(1/n)O(1/\sqrt{n}) rate of convergence is established under mild conditions.

This paper introduces DCE for better counterfactual explanations using optimal transport.

problem Lack of nuanced distributional characteristics in existing counterfactual explanations.
method Formulates a chance-constrained optimization problem using optimal transport to derive counterfactual distributions.
result DCE provides deeper insights into decision-making models by aligning counterfactual distributions with factual ones.