New RESK distributions improve robust clustering of skewed data.
problem Robustly clustering non-symmetric, heavy-tailed data clusters.
method Proposes RESK distributions and an EM algorithm with robust skew-Huber M-estimator.
result Numerical experiments confirm the effectiveness of the proposed methods.
The paper explores solutions to the distributional Bellman equation in reinforcement learning.
problem Distributional reinforcement learning considers complete return distributions, not just expected returns.
method Study existence and uniqueness of solutions to general distributional Bellman equations, linking them to multivariate affine equations.
result Any solution to a distributional Bellman equation can be derived from a multivariate affine distributional equation.
Proposes vMF distribution for skewed elliptical distributions.
problem Skewed distributions not adequately modeled by symmetric distributions.
method Introduces von-Mises-Fisher (vMF) distribution to represent skewed elliptical distributions.
result vMF distribution provides an explicit and simple probability representation of skewed elliptical distributions.
Study calculates tail risk for various mixture distributions.
problem Estimating tail risk for complex distribution mixtures.
method Analyzes tail conditional expectation for location-scale mixtures of elliptical distributions.
result Developed methods for calculating tail risk in various distributions.
We realise the first and second Grushin distributions as symmetry reductions of the 3-dimensional Heisenberg distribution and 4-dimensional Engel distribution respectively. Similarly, we realise the Martinet distribution as an alternative symmetry reduction of the Engel distribution. These reductions allow us to derive…
Recent work has shown that deep generative models assign higher likelihood to out-of-distribution inputs than to training data. We show that a factor underlying this phenomenon is a mismatch between the nature of the prior distribution and that of the data distribution, a problem found in widely used deep generative mo…
Method uses optimal transport to complete distributional matrices.
problem Matrix completion for distributional data.
method Nearest neighbors in Wasserstein space.
result Method recovers distributions in Wasserstein metric.
Income and wealth distribution affect stability of a society to a large extent and high inequality affects it negatively. Moreover, in the case of developed countries, recently has been proven that inequality is closely related to all negative phenomena affecting society. So far, Econophysics papers tried to analyse in…
Study clusters distributions with known or unknown clusters using distribution testing.
problem Cluster distributions that are ε-far in total variation. method Distribution testing approach to establish upper and lower bounds on sample complexity.
result Achieves tight sample complexity bounds for all regimes (up to a logarithmic factor).
Gradually Truncated Log-normal distribution - Size distribution of firms Abstract Many natural and economical phenomena are described through power law or log- normal distributions. In these cases, probability decreases very slowly with step size compared to normal distribution. Thus it is essential to cut-off these di…
A new distribution family extends the α-stable distribution with a degree of freedom parameter.
problem Lack of moments in the α-stable distribution. method Wright function framework to combine and extend distribution families.
result Generalized α-stable distribution with valid moments. Paper develops a new method to improve model calibration under distribution shifts.
problem Challenges in uncertainty quantification with different training and test distributions.
method Develops multi-domain temperature scaling to handle distribution shifts.
result Outperforms existing methods on in-distribution and out-of-distribution test sets.
New class of heavy-tailed distributions shows weighted averages dominate individual variables.
problem Understanding and comparing risks in heavy-tailed distributions.
method Introducing a new class of heavy-tailed distributions and proving stochastic dominance relations.
result Weighted averages of random variables in this class are stochastically larger than individual variables.
Researchers derived formulas for joint moments of elliptical distributions.
problem Calculating joint moments of elliptical distributions.
method Used Stein's lemma and two different methods to derive expressions.
result New formulae for expectations of product of normally distributed random variables and simplified expressions for other distributions.
Paper proposes a new method for designing materials using deep learning.
problem Designing high-performance material distributions from given distributions.
method Iterative process of selecting, generating, and merging material distributions using a deep generative model.
result The method improves material performance through iterative refinement.
One-shot algorithm for feature-distributed kernel PCA reduces communication costs.
problem Efficiently perform kernel PCA in distributed computing environments.
method Inspired by dual relationship between sample-distributed and feature-distributed scenarios, proposes a one-shot algorithm for feature-distributed kernel PCA.
result The algorithm provides high-quality results with low communication costs, especially when eigenvalues decay fast.
Paper finds how many neurons are needed to approximate histogram distributions.
problem How many neurons are needed to approximate a target probability distribution?
method Examined for uniform input distribution and histogram target distributions, using efficient neural net construction.
result Obtained a new upper bound on the number of required neurons, strictly better than previous bounds.
Paper analyzes origami slope gaps and their distribution, finding a unique pattern.
problem Analyzing slope gaps in origami surfaces.
method Derived slope gap distribution of a specific origami by considering return times under the horocycle flow.
result Found a unique distribution of origami slope gaps, not a sum of scaled Hall distributions.
A new distributed clustering framework using distributional kernel.
problem Clustering in distributed networks with arbitrary shapes, sizes, and densities.
method Distributed Clustering based on Distributional Kernel (KDC) using similarity of distributions.
result KDC guarantees equivalent clustering outcomes to centralized methods, reduces runtime, and discovers arbitrary clusters.
Paper introduces a new distributional successor measure for reinforcement learning.
problem Learning the distributional consequences of behavior in reinforcement learning.
method Formulates distributional successor measure as a distribution over distributions, proposes algorithm to learn it from data.
result Demonstrates zero-shot risk-sensitive policy evaluation.
The paper extends distributions by singular curves, revealing structural equivalences.
problem Extending (3,6)-distributions using singular curves. method Using data from singular curves, the paper extends (3,6)-distributions to higher rank distributions. result The equivalence of classification problems for four extended distribution classes.
Random matrix ensembles yield uniform distributions on manifolds.
problem Understanding distributions of vectors in random matrix ensembles.
method Analyzing eigenvalues, singular values, and Autonne-Takagi vectors of various random matrix ensembles.
result Uniform distributions on specific manifolds for different types of random matrix ensembles.
New distributions allow greedy arm selection in sparse bandit problems.
problem Sparse contextual bandit problem with sparse parameters and feature distributions.
method Introduced new distribution classes and demonstrated that mixtures of these distributions are also greedy-applicable.
result Greedy algorithm applicable to a wider range of arm feature distributions, including those with origin-asymmetric support.
Study error bounds in evaluating distributional computational graphs.
problem Error analysis in evaluating graphs with inputs as probability distributions.
method Establish non-asymptotic error bounds using Wasserstein-1 distance.
result Non-asymptotic error bounds for discretization errors in distributional computational graphs.
Study on continuous sequence classification with distribution uncertainty.
problem Classifying continuous sequences with varying distribution uncertainty.
method Proposes distribution-free tests for three test designs: fixed-length, sequential, and two-phase tests.
result Error probabilities decay exponentially fast for all test designs.
Study explores geometric structure and prior for beta-logistic distribution.
problem Understanding the geometric structure and prior distributions of the beta-logistic distribution.
method Exploring dual geometric structure and uncovering α-parallel prior. result The beta-logistic distribution admits an α-parallel prior for any real number α. The paper shows strong correlation between in-distribution and out-of-distribution performance in various machine learning models.
problem Understanding reliability of machine learning systems in unseen environments.
method Empirical analysis of various models and distribution shifts on CIFAR-10, ImageNet, and other datasets.
result Out-of-distribution performance is strongly correlated with in-distribution performance across different models and distribution shifts.
We propose to interpret distribution model risk as sensitivity of expected loss to changes in the risk factor distribution, and to measure the distribution model risk of a portfolio by the maximum expected loss over a set of plausible distributions defined in terms of some divergence from an estimated distribution. The…
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.
Deep networks can approximate high-dimensional distributions from low-dimensional ones.
problem Approximating high-dimensional distributions from low-dimensional ones.
method Proved neural networks can transform low-dimensional distributions to high-dimensional ones with arbitrary closeness measured by Wasserstein distances and maximum mean discrepancy.
result Upper bounds of the approximation error are obtained in terms of the width and depth of neural network.
The paper defines MTCov for skewed elliptical distributions.
problem No specific problem stated, but dealing with skewed elliptical distributions.
method Defined MTCov for generalized skew-elliptical distributions and compared with skewed and non-skewed normal distributions.
result Special formula for MTCov of generalized skew-elliptical distributions.
Paper proposes MMC to avoid high-density bias in clustering.
problem High-density bias in density-based clustering.
method Introduces mass distribution as a better foundation for clustering, proposing mass-maximization clustering (MMC).
result MMC avoids high-density bias and discovers clusters of arbitrary shapes, sizes, and densities.
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)+ε on any labeled distribution that the tester accepts. The paper uses FRFT to fit GTS distribution to asset returns.
problem Modeling asset returns with GTS distribution.
method Fractional Fourier Transform (FRFT) for fitting.
result GTS distribution fits SPY ETF and Bitcoin BTC returns.
Proves Sard conjecture for specific distributions, controlling divergence of vector fields.
problem Proving the Sard conjecture for certain types of distributions.
method Constructs a singular distribution capturing essential abnormal lifts, proving the conjecture for rank 3 distributions in dimension 4 and generic corank 1 distributions.
result Proves the Sard conjecture for generic co-rank one distributions.
The study improves model performance prediction on unseen distributions.
problem Improving model performance prediction on unseen distributions.
method Connecting domain adaptation and predictive uncertainty techniques, investigating distributional distances and DoC.
result Difference of confidences (DoC) successfully estimates classifier performance change over various distribution shifts.
New method relaxes TV distance for two-sample testing without distributional assumptions.
problem Challenges in certifying equality or providing tight bounds on TV distance for two distributions.
method Examined blurred total variation distance, a relaxation of TV distance.
result Provided theoretical guarantees for upper and lower bounds on blurred TV distance.
New theory of distributions on spaces with singular submanifolds.
problem Defining distributions on spaces with singular submanifolds.
method Construction of thick distributions, operations, and special distributions.
result Clarified connection between thick and classical distributions.
Method diagnoses model performance under distribution shifts.
problem Understanding and improving model performance under distribution shifts.
method DIstribution Shift DEcomposition (DISDE) method to attribute performance drop to distribution shifts.
result Shows how model performance can be improved across different distribution shifts.
Concrete distribution properties examined on simplex.
problem Properties of Concrete distribution on simplex.
method Reflection and location-scale transformation of uniform distribution; explicit parameterization to Poincaré half-space.
result Fisher information and information metric are hyperbolic space; Fisher-Rao geodesic distance computed.
Adaptive sampling method improves efficiency in complex target distributions.
problem Efficiency of importance sampling in complex target distributions, especially multimodal distributions in high-dimensional spaces.
method Proposes an adaptive scheme combining global sampling with delayed weighting to promote efficient exploration of target distributions.
result The proposed algorithm is geometrically convergent under mild assumptions and demonstrates improved efficiency in various numerical experiments.
LOT embeds distributions for linear separability and classification.
problem Distribution discrimination in various scientific fields.
method Linear Optimal Transport (LOT) embedding into L2 space. result LOT embeds distributions into linearly separable spaces for certain transformations and perturbations.
During the past decades, the Ising distribution has attracted interest in many applied disciplines, as the maximum entropy distribution associated to any set of correlated binary (`spin') variables with observed means and covariances. However, numerically speaking, the Ising distribution is unpractical, so alternative …
To know the statistical distribution of a variable is an important problem in management of resources. Distributions of the power law type are observed in many real systems. However power law distributions have an infinite variance and thus can not be used as a standard distribution. Normally professionals in the area …
Proves a theorem for normal distributions on manifolds with boundary.
problem Normal distributions on manifolds with boundary require a new approach to integration.
method Introduces neat integral manifolds with boundary and conditions for integrability.
result Conditions for integrability expressed in terms of adapted collars and integrability on interior and boundary.
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.
Extends residue theory to flags of holomorphic distributions.
problem Calculating the residue class of flags of holomorphic distributions.
method Developed an effective method to calculate the class in certain cases.
result Established a relation between degrees, tangency order, Euler characteristic, and curve degree.
Failure of the main argument for the use of heavy tailed distribution in Finance is given. More precisely, one cannot observe so many outliers for Cauchy or for symmetric stable distributions as we have in reality. keywords:outliers; financial indexes; heavy tails; Cauchy distribution; stable distributions