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

Trend · papers per month

149297446594 · Jun 202019922001200920172026
48 results for universal distribution

MPE framework proves universal approximation for quantum data distribution.

problem Challenges in generating quantum data from underlying distributions.
method Many-body Projected Ensemble (MPE) framework for quantum state design.
result MPE can approximate any quantum distribution within 1-Wasserstein distance error.

Exact distribution of split conformal prediction coverage found.

problem Determining the reliability of prediction sets in batch mode.
method Analysis of exchangeable data to find universal distribution of empirical coverage.
result Exact distribution of empirical coverage is universal and determined by nominal miscoverage level and calibration sample size.

Universal tester-learner for halfspaces over structured distributions.

problem Learning halfspaces over a wide class of structured distributions.
method Uses a fully polynomial tester-learner based on hypercontractivity and sum-of-squares (SOS) programs.
result Achieves error O(opt)+εO(\mathrm{opt}) + ε on any labeled distribution that the tester accepts.

New method for reducing dimensions of distributional data.

problem Nonlinear sufficient dimension reduction for distribution-on-distribution regression.
method Building universal kernels on metric spaces to characterize conditional independence.
result Method outperforms competing methods in synthetic and real data applications.

Stochastic gradient descent converges to universal limits in high dimensions.

problem Statistical tasks in high dimensions with specific data projections.
method Stochastic gradient descent applied to mixture distributions, proving universality of limits.
result The ODE limits are universal for mixtures of arbitrary product distributions.

New findings show Gaussian universality breaks down in high-dimensional linear factor mixtures.

problem The limitations of Gaussian universality in high-dimensional classification.
method Characterization of empirical risk minimization for classification under linear factor mixture models.
result Gaussian universality breaks down under high-dimensional linear factor mixtures.

This paper studies universal rates of ERM for binary classification under agnostic learning.

problem The challenge of achieving universal rates of ERM for binary classification under agnostic learning.
method The paper explores the agnostic universal rates of ERM for binary classification, revealing three possible rates: ene^{-n}, o(n1/2)o(n^{-1/2}), or arbitrarily slow.
result The paper provides a complete characterization of which concept classes fall into each of the three categories of agnostic universal rates.

New framework explains normalizing flows' power and limitations.

problem Understanding the expressive power and limitations of normalizing flows.
method Theoretical framework for well-conditioned coupling-based normalizing flows and volume-preserving flows.
result RealNVP is distributionally universal, but volume-preserving flows are not.

We study the spherical cap packing problem with a probabilistic approach. Such probabilistic considerations result in an asymptotic sharp universal uniform bound on the maximal inner product between any set of unit vectors and a stochastically independent uniformly distributed unit vector. When the set of unit vectors …

2015-11-19abs ↗pdf ↗

The K-sample testing problem involves determining whether K groups of data points are each drawn from the same distribution. Analysis of variance is arguably the most classical method to test mean differences, along with several recent methods to test distributional differences. In this paper, we demonstrate the existe…

2019-10-20abs ↗pdf ↗

Deep learning models converge to Gaussian dynamics with mixed structured inputs.

problem Understanding neural network dynamics with complex input distributions.
method Extended hidden manifold model to Gaussian mixtures, analyzed via SGD.
result Learning dynamics with mixed inputs converge to Gaussian behavior.

A grand challenge of the 21st century cosmology is to accurately estimate the cosmological parameters of our Universe. A major approach to estimating the cosmological parameters is to use the large-scale matter distribution of the Universe. Galaxy surveys provide the means to map out cosmic large-scale structure in thr…

2017-11-06abs ↗pdf ↗

WWe define the notion of a random metric space and prove that with probability one such a space is isometricto the Urysohn universal metric space. The main technique is the study of universal and random distance matrices; we relate the properties of metric (in particulary universal) space to the properties of distance …

2004-02-16abs ↗pdf ↗

Unified plug-in approach for estimating symmetric properties of distributions efficiently.

problem Estimating symmetric properties of distributions with high accuracy and efficiency.
method Profile-maximum-likelihood (PML) based estimator.
result Achieves theoretical limit for universal symmetric property estimation.

We present a relatively detailed analysis of the persistence probability distributions in financial dynamics. Compared with the auto-correlation function, the persistence probability distributions describe dynamic correlations non-local in time. Universal and non-universal behaviors of the German DAX and Shanghai Index…

2005-11-23abs ↗pdf ↗

We analyze the constituents stocks of the Dow Jones Industrial Average (DJIA30) and the Standard & Poor's 100 index (S&P100) of the NYSE stock exchange market. Surprisingly, we discover the data collapse of the histograms of the DJIA30 price fluctuations and of the S&P100 price fluctuations to the universal non-paramet…

2008-10-14abs ↗pdf ↗

Paper establishes universal lower bounds and optimal rates for clustering sub-exponential mixture models.

problem Achieving optimal error rates in clustering sub-exponential mixture models.
method Establishes universal lower bounds and demonstrates iterative algorithms' optimality in sub-exponential mixture models.
result Iterative algorithms achieve the universal lower bound in sub-exponential mixture models.

The goal of this paper is to characterize function distributions that deep learning can or cannot learn in poly-time. A universality result is proved for SGD-based deep learning and a non-universality result is proved for GD-based deep learning; this also gives a separation between SGD-based deep learning and statistic…

2020-01-07abs ↗pdf ↗

Transformer pretraining yields strong EB performance without explicit adaptation.

problem Empirical Bayes problems with unknown test distributions.
method Indirect analysis of pretrained transformer's performance under universal priors.
result Near-optimal regret bound of O~(1n)\widetilde{O}(\frac{1}{n}) for arbitrary test distributions.

CF-INNs can approximate any invertible function, resolving a long-standing problem.

problem Whether CF-INNs can approximate any invertible function.
method Demonstrated CF-INNs are universal approximators for invertible functions by showing a convenient criterion.
result CF-INNs are universal approximators for invertible functions.

We show that deep narrow Boltzmann machines are universal approximators of probability distributions on the activities of their visible units, provided they have sufficiently many hidden layers, each containing the same number of units as the visible layer. We show that, within certain parameter domains, deep Boltzmann…

2014-11-14abs ↗pdf ↗

We investigate the statistics of records in a random sequence {xB(0)=0,xB(1),,xB(n)=xB(0)=0}\{x_B(0)=0,x_B(1),\cdots, x_B(n)=x_B(0)=0\} of nn time steps. The sequence xB(k)x_B(k)'s represents the position at step kk of a random walk `bridge' of nn steps that starts and ends at the origin. At each step, the increment of the position is a random ju…

2015-05-22abs ↗pdf ↗

New model suggests universe emerges from single particle quantum mechanics.

problem Exploring how the universe might arise from a single particle in quantum mechanics.
method Novel spontaneous symmetry breaking acting on probability distributions of Hamiltonians.
result Evidence supports the hypothesis that nature seeks tensor decompositions.

Data augmentation affects estimates' uncertainty and distribution in complex ways.

problem Understanding how data augmentation impacts the variance and limiting distribution of estimates.
method Developed an adaptation of Lindeberg's technique for block dependence.
result Data augmentation can increase rather than decrease uncertainty, and it may shift the double-descent peak of an empirical risk.

Unified method for CNNs to approximate equivariant maps across various groups.

problem Limited universal approximation theorems for CNNs with specific groups and settings.
method Unified approach to derive universal approximation theorems for equivariant maps by CNNs in diverse settings.
result Ability to handle non-linear equivariant maps between infinite-dimensional spaces for non-compact groups.

Study characterizes learning from heavy-tailed data in high dimensions using superstatistical methods.

problem Characterizing learning from heavy-tailed data in high-dimensional settings.
method Empirical risk minimization with double-stochastic processes and superstatistical analysis.
result Analytical characterization of separability transition and generalization performance.
Physics of Personal Incomecond-mat.stat-mech

We report empirical studies on the personal income distribution, and clarify that the distribution pattern of the lognormal with power law tail is the universal structure. We analyze the temporal change of Pareto index and Gibrat index to investigate the change of the inequality of the income distribution. In addition …

2002-02-22abs ↗pdf ↗

Let G be a connected Lie group with Lie algebra g. The Duflo map is a vector space isomorphism between the symmetric algebra S(g) and the universal enveloping algebra U(g) which, as proved by Duflo, restricts to a ring isomorphism from invariant polynomials onto the center of the universal enveloping algebra. The Duflo…

1999-03-09abs ↗pdf ↗

SURF simplifies distribution estimation with simple, robust, and fast algorithms.

problem Efficient and accurate distribution estimation in statistics and machine learning.
method Piecewise polynomial approximation using empirical probability interpolation and divide-and-conquer merging.
result Surpassing state-of-the-art algorithms in efficiency and accuracy, SURF estimates distributions robustly and quickly.