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 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.
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.
The paper calculates moments and conditional risks for skewed elliptical distributions.
problem Estimating moments and tail conditional risks for skewed elliptical distributions.
method Derives explicit expressions for multivariate doubly truncated moments and conditional risks for generalized skew-elliptical distributions.
result Explicit formulas for multivariate doubly truncated moments and conditional risks are derived for various skewed elliptical distributions.
This paper examines how the choice of prior distribution affects likelihoods of out-of-distribution inputs in deep generative models.
problem Mismatch between prior and data distributions causes deep generative models to assign higher likelihoods to out-of-distribution inputs.
method Proposes using a mixture distribution as a prior to make likelihoods of out-of-distribution inputs more sensitive.
result A mixture prior lowers the out-of-distribution likelihood with respect to real image data sets.
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.
The study develops a quadrature method for the generalized hyperbolic distribution using finite normal-mixture approximation.
problem Efficiently approximating and computing expectations under the generalized hyperbolic distribution.
method Derived a numerical quadrature from Gauss-Hermite quadrature, approximated the distribution as a finite normal variance-mean mixture.
result Accurately computed expectations and sampled generalized hyperbolic random variates using the proposed method.
Survey of κ-generalized models for income and wealth distributions.
problem Analyzing and modeling income and wealth distributions.
method Review of analytical properties, interrelations with other distributions, and empirical applications.
result The κ-generalized models agree well with empirical data. New polynomial convergence guarantees for SGM on general data distributions.
problem Efficient guarantees for multimodal and non-smooth distributions in SGM.
method Polynomial convergence guarantees for denoising diffusion models on general data distributions, with no assumptions on functional inequalities or smoothness.
result Wasserstein distance guarantees for distributions of bounded support or decaying tails, and TV guarantees for further smoothness assumptions.
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.
Study on how kernel regression models generalize to out-of-distribution data.
problem Understanding generalization in machine learning models under distributional shifts.
method Replica method from statistical physics to derive analytical formula for generalization error.
result Identified overlap matrix as key determinant of generalization performance under distribution shift.
Generates samples conditioned on labels using optimal transport.
problem Estimating conditional distributions for specific labels.
method Wasserstein geodesic generator based on optimal transport theory.
result Learned conditional distributions and optimal transport maps.
Generative Distribution Embeddings learn multiscale representations of distributions.
problem Learning representations of entire distributions for multiscale reasoning.
method Introducing GDE framework that lifts autoencoders to the space of distributions, using conditional generative models and distributional invariance.
result GDEs learn predictive sufficient statistics embedded in Wasserstein space, recovering distances and trajectories for Gaussian and Gaussian mixture distributions.
Formula calculates residues for maps near holomorphic distributions.
problem Calculating residues for maps near holomorphic distributions.
method Residues formula for maps generically transversal to regular holomorphic distributions.
result Established a residues formula for maps near holomorphic distributions.
BDSG generates samples on distribution boundaries, improving anomaly detection.
problem Difficulty in capturing multimodal supports and approximating distribution tails.
method Invertible Residual Network (IResNet) and Residual Flow (ResFlow) for density estimation; compound loss function for boundary samples.
result Competitive performance on synthetic and multimodal data compared to existing methods.
Improved likelihood estimation for singular distributions using deep models.
problem Estimating singular distributions using deep generative models.
method Data perturbation to avoid singularity issues in likelihood estimation.
result Consistent estimation of target distribution with desirable rates.
The study examines issues with latent distributions in generative models and proposes using Cauchy distribution.
problem Issues with latent distributions causing mismatch in sampled regions during linear interpolations.
method Proposed using multidimensional Cauchy distribution and two methods for creating non-linear interpolations.
result Linear interpolations may generate unrealistic data due to the Central Limit Theorem, and Cauchy distribution mitigates this issue.
Smooth distributions on subcartesian spaces can be globally finitely generated.
problem Understanding smooth distributions on subcartesian spaces.
method Embedding in Euclidean space, Whitney Embedding Theorem, and distribution theory.
result Smooth generalized distributions and subbundles on connected subcartesian spaces are globally finitely generated.
New autoencoder generates better images by estimating latent distribution.
problem Improving image generation quality.
method Directly estimate latent distribution using latent density estimator.
result Generative model produces higher quality images.
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.
GANs learn distributions by matching low-degree moments.
problem Understanding when GANs learn the target distribution efficiently.
method Theoretical analysis and empirical observation of GAN training process.
result GANs can learn notable distributions by matching polynomially many low-degree moments.
Paper introduces CWDAE for better synthetic data generation.
problem Measuring discrepancy between generative and ground-truth distributions.
method Introduces mixture Cramer-Wold distance for joint and marginal distributional learning.
result CWDAE shows remarkable performance in generating synthetic data.
DCMA uses generative models to analyze treatment effects on entire outcome distributions.
problem Traditional mediation analysis focuses on summary contrasts, missing complex distributional changes.
method DCMA learns conditional generative models for mediators and outcome, reconstructing interventional distributions via Monte Carlo simulation.
result DCMA captures both summary effects and rich distributional contrasts like energy distance and Wasserstein distance.
This note shows how independent elliptical distributions minimize the Wasserstein distance.
problem Minimizing the Wasserstein distance between elliptical distributions.
method Analyzing the Wasserstein distance between independent elliptical distributions with the same density generators.
result Independent elliptical distributions minimize their Wasserstein distance from other elliptical distributions with the same density generators.
DCMA uses generative models to analyze complex treatment effects on outcome distributions.
problem Analyzing complex and nonlinear causal mechanisms through outcome-level summary contrasts.
method Generative learning framework for identifying and estimating treatment effects on entire outcome distributions.
result Reconstructs interventional outcome distributions via Monte Carlo forward simulation, capturing both summary and distributional contrasts.
The paper explores how generative networks can transform noise distributions into other distributions.
problem Transforming noise distributions into desired distributions using generative networks.
method Developed a space-filling function for ReLU networks and provided efficient methods for univariate uniform to normal distribution transformations.
result Optimal construction for ReLU networks to increase noise dimensionality and efficient methods for distribution transformations.
We use Markov chains to sample from a generative autoencoder's learned latent distribution.
problem Generative autoencoders may learn a different latent distribution than the prior, leading to poor sampling.
method Formulate an MCMC sampling process to sample from the learned latent distribution.
result Improved sampling quality from generative autoencoders, especially when the learned latent distribution is far from the prior.
Generative models help make decisions under changing data distributions.
problem Making decisions based on historical data when the actual data distribution changes.
method Flow- and score-based generative models to represent and transform distributions.
result Generative models can learn nominal uncertainty, create stressed distributions, and produce conditional distributions.
The Generalized Beta Prime distribution explains wealth and income distributions.
problem Explaining wealth and income distributions using a stochastic model.
method Using housing sale prices as a proxy, we numerically and analytically explore the properties of the Generalized Beta Prime distribution and its inequality indices.
result The Generalized Beta Prime distribution is a successful model for wealth and income distributions, with Hoover and Theil L being more appropriate for distributions with fat tails.
New wealth distribution model based on κ-deformation of Gamma distribution.
problem Modeling wealth distribution in heterogeneous kinetic exchange models.
method Proposed a new four-parameter statistical distribution based on κ-deformation of the Generalized Gamma distribution. result The new distribution accurately represents wealth distribution in heterogeneous kinetic exchange models.
GRAM enhances deep RL for reliable real-world deployment.
problem Generalizing deep RL across in-distribution and out-of-distribution scenarios.
method Introduces a robust adaptation module and a joint training pipeline.
result GRAM achieves strong generalization performance in simulations and hardware.
Deep neural networks can generate any 2D distribution with high accuracy.
problem Generating accurate high-dimensional distributions from random noise.
method A deep neural network with a space-filling property of sawtooth functions.
result The network can approximate any 2D Lipschitz-continuous distribution arbitrarily closely.
New approach to Generalized Beta family using SDEs.
problem Understanding the Generalized Beta family of distributions.
method Using a mean-reverting SDE for a power of the variable, leading to a modified GB distribution.
result Provides alternative forms and cumulative distribution functions for GB distributions.
Constructs canonical frames for specific distributions, proving maximality and describing germs.
problem Local geometry of rank 2 distributions with specific cube dimensions.
method Uniform construction of canonical absolute parallelism, iterative Cartan deprolongation.
result Automatic maximality condition holds at generic points, covering all cases.
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.
New generalization concept considers distribution of errors, not just average error.
problem Classical generalization fails to capture distributional differences in classifier outputs.
method Formal conjectures about distributional generalization based on model architecture, training procedure, and data distribution.
result Distributional generalization can be expected in specific conditions, as evidenced by empirical results.
Analyzes generalization error in distributed linear regression.
problem Understanding generalization performance in distributed learning.
method Analytical characterization of generalization error in linear regression with distributed learning.
result Generalization error increases dramatically when nodes estimate close to the number of observations.
Paper tackles continual learning in GANs for sequential distributions.
problem Catastrophic forgetting in GANs when learning sequentially.
method Adapting continual learning techniques to GANs for sequential data.
result GANs can now model and learn from a sequence of distinct distributions without forgetting.
New RL algorithm minimizes distributional learning error.
problem Improving distributional reinforcement learning for better error minimization.
method Proposes a new model-based algorithm with theoretical minimax optimality.
result Proves minimax optimality for approximating return distributions.
Random variables of the generalized Pareto distribution, can be transformed to that of the Pareto distribution. Explicit expressions exist for the maximum likelihood estimators of the parameters of the Pareto distribution. The performance of the estimation of the shape parameter of generalized Pareto distributed using …
ADB framework improves OOD generalization by increasing ID bias during training.
problem Machine learning models degrade on new data distributions.
method ADB framework introduces controlled statistical diversity during training.
result Higher in-distribution bias leads to better out-of-distribution generalization.
Paper proposes a new generative model for discrete distributions using flows on submanifolds.
problem Discretization issues and complex statistical dependencies in discrete data.
method Continuous normalizing flows on factorizing discrete measures, geodesic flow matching.
result Efficient training and broad applicability demonstrated through experiments.
Study on energy of smooth and singular distributions on manifolds.
problem Energy calculation for smooth and singular distributions on manifolds.
method Derive lower bounds and find minimizers for energy functionals.
result Lower bounds and minimizers for energy of distributions found.
The paper studies Laplacians on smooth distributions and proves they are multipliers in C∗-algebras.
problem Understanding spectral properties of Laplacians on generalized smooth distributions.
method Survey of generalized smooth distributions, proof of Laplacian as a multiplier in foliation C∗-algebra. result Laplacians on smooth distributions define unbounded multipliers in foliation C∗-algebras. 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. A new autoencoder learns expressive posterior and conditional likelihood distributions.
problem Learning more expressive posterior and conditional likelihood distributions.
method Implicit autoencoder using two generative adversarial networks for reconstruction and regularization.
result Implicit autoencoder can disentangle content and style information.
Introduces generalized reparameterization gradient for complex distributions.
problem Limited applicability of reparameterization gradient to non-Gaussian distributions.
method Extends reparameterization gradient to a wider class of variational distributions using invertible transformations.
result Effective use of single sample from variational distribution to obtain low-variance gradient.
Asynchronous SGD generalizes well with enough data, improving stability and reducing error.
problem Generalization performance of asynchronous distributed SGD systems.
method Algorithm stability framework, adaptive learning rate strategy.
result Distributed asynchronous SGD generalizes well with enough data samples.