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

230460689919 · Jun 202019922001200920172026
48 results for Comparing Distributions

The study optimizes bounds for comparing training and population loss.

problem Optimizing bounds for comparing training and population loss.
method Derives generic information-theoretic and PAC-Bayesian generalization bounds using convex comparator functions.
result The tightest possible bound is obtained with the comparator being the convex conjugate of the CGF of the bounding distribution.

We are interested in comparing probability distributions defined on Riemannian manifold. The traditional approach to study a distribution relies on locating its mean point and finding the dispersion about that point. On a general manifold however, even if two distributions are sufficiently concentrated and have unique …

2008-07-04abs ↗pdf ↗

Paper addresses fault-tolerance in distributed machine learning with stochastic gradient descent.

problem Fault-tolerance in distributed stochastic gradient descent (D-SGD) for machine learning.
method Proposes norm-based comparative gradient elimination (CGE) to robustify D-SGD against Byzantine faulty agents.
result CGE guarantees fault-tolerance against a bounded fraction of Byzantine agents under standard stochastic assumptions.

Shortage of labeled data has been holding the surge of deep learning in healthcare back, as sample sizes are often small, patient information cannot be shared openly, and multi-center collaborative studies are a burden to set up. Distributed machine learning methods promise to mitigate these problems. We argue for a sp…

2019-12-27abs ↗pdf ↗

Omega ratio, defined as the probability-weighted ratio of gains over losses at a given level of expected return, has been advocated as a better performance indicator compared to Sharpe and Sortino ratio as it depends on the full return distribution and hence encapsulates all information about risk and return. We comput…

2019-10-15abs ↗pdf ↗

Study compares synthetic and distributional Ricci curvature bounds.

problem Comparing synthetic and distributional approaches to lower Ricci curvature bounds.
method Analyzes synthetic via weak displacement convexity and distributional via non-negativity of Ricci-tensor.
result Distributional bounds imply entropy bounds for C1C^1 metrics and vice versa for C1,1C^{1,1} under convergence condition.

We propose a new Integral Probability Metric (IPM) between distributions: the Sobolev IPM. The Sobolev IPM compares the mean discrepancy of two distributions for functions (critic) restricted to a Sobolev ball defined with respect to a dominant measure μμ. We show that the Sobolev IPM compares two distributions in hig…

2017-11-14abs ↗pdf ↗

Paper establishes sufficient condition for comparing linear combinations of infinite-mean risks.

problem Comparing linear combinations of infinite-mean risks under stochastic dominance.
method Introduced a new class of distributions and used majorization order to compare weights.
result Linear combinations of random variables are stochastically larger when their weight vectors are smaller in majorization order.

This work bridges outlier and drift detection by comparing inputs to a part of the reference distribution.

problem Monitoring machine learning models to ensure they operate within their validated distribution.
method Comparing a set of inputs to a chosen part of the reference distribution.
result A new approach that bridges outlier detection and drift detection.

UAPCA projects uncertain data to low dimensions using GMMs.

problem Uncertain multidimensional data not well described by normal distributions.
method Model data with Gaussian mixture models, derive UAPCA projection from general formulation.
result Low-dimensional projections better represent multidimensional distributions.

We discuss some basic concepts of semi-Riemannian geometry in low-regularity situations. In particular, we compare the settings of (linear) distributional geometry in the sense of L. Schwartz and nonlinear distributional geometry in the sense of J.F. Colombeau.

2008-11-30abs ↗pdf ↗

Distributed Lion optimizes large model training by reducing communication costs.

problem Training large AI models efficiently with reduced communication costs.
method Adapted Lion optimizer for distributed training, using binary or lower-precision vectors for communication.
result Distributed Lion achieves comparable performance to standard optimizers but with significantly reduced communication bandwidth.

Paper compares generative and discriminative models in uncertainty quantification.

problem Comparing generative and discriminative approaches in uncertainty quantification.
method Analysis of generative and discriminative models, focusing on posterior predictive distribution and prior distributions.
result Discriminative models struggle with imbalanced datasets, while generative models offer a more flexible prior distribution.

We introduce blockchains and distributed ledgers and describe their potential applications to money and banking. The analysis compares public and private ledgers and outlines the suitability of various types of ledgers for different purposes. Furthermore, a few historical prototypes of blockchains and distributed ledge…

2017-03-04abs ↗pdf ↗

The ability to represent and compare machine learning models is crucial in order to quantify subtle model changes, evaluate generative models, and gather insights on neural network architectures. Existing techniques for comparing data distributions focus on global data properties such as mean and covariance; in that se…

2019-05-27abs ↗pdf ↗

This article reviews and compares various methods for estimating conditional distributions.

problem Inference of conditional distributions in statistics.
method Classical nonparametric methods and modern generative models.
result A systematic numerical comparison of methods using performance metrics.

Paper introduces S3W distance for spherical probability distributions.

problem Comparing spherical probability distributions efficiently and accurately.
method S3W distance using stereographic projection and generalized Radon transform.
result Extensive theoretical analysis and evaluation of S3W performance.

AF improves sampling from high-dimensional, multi-modal distributions.

problem Sampling from high-dimensional, multi-modal distributions is challenging.
method Annealing Flow (AF) using Continuous Normalizing Flow (CNF) with dynamic Optimal Transport (OT) objective and annealing procedures.
result AF significantly improves training efficiency and stability, outperforming state-of-the-art methods.

The study applies spatial density models to mobile node movements using Möbius distributions.

problem Modeling the steady-state density of mobile nodes on a 2D terrain.
method Used mixture density networks with Möbius distributions to describe node density over a disk.
result Möbius distributions are more suitable for capturing radial changes in node density compared to Gaussian distributions.

New distributed clustering algorithms show resilience to initialization issues.

problem Resilience of distributed gradient-based clustering algorithms to center initialization.
method Distributed gradient-based clustering algorithms with novel center initialization.
result The algorithms are more resilient to initialization compared to baseline methods.

Study compares data-driven vs model-based MRS quantification strategies, focusing on resilience to out-of-distribution effects.

problem Resilience to out-of-distribution effects in data-driven MRS quantification.
method Compared three data-driven strategies (supervised regression, self-supervised learning, test-time adaptation) against model-based fitting tools.
result Test-time adaptation proved most resilient to out-of-distribution effects, while self-supervised learning achieved intermediate performance.

A new Wasserstein distance method for comparing incomparable distributions.

problem Comparing distributions that are not supported on the same metric space.
method Distributional slicing, embeddings, and closed-form computation of Wasserstein distance.
result HWD preserves properties like rotation-invariance and can be efficiently learned.

This paper introduces a new method to compare collections of distributions on manifolds and graphs.

problem Comparing collections of probability distributions over diverse domains.
method Intrinsic slicing construction for Wasserstein distances, Hilbert embedding, resampling, p-value combination.
result Powerful and well-calibrated p-values for comparing distributions on manifolds and graphs.

GNNS uses graph neural networks to efficiently estimate subgraph frequency distributions.

problem Efficiently calculating subgraph frequency distributions in large networks.
method Graph Neural Networks (GNNS) for sampling and estimating subgraph frequencies.
result GNNS achieves comparable accuracy with a significant speedup of three orders of magnitude.

This work presents the concept of kernel mean embedding and kernel probabilistic programming in the context of stochastic systems. We propose formulations to represent, compare, and propagate uncertainties for fairly general stochastic dynamics in a distribution-free manner. The new tools enjoy sound theory rooted in f…

2019-11-25abs ↗pdf ↗

Transformer improves parameter estimation without needing closed-form solutions.

problem Parameter estimation in statistics, especially for complex distributions.
method Transformer-based approach for parameter estimation without closed-form solutions or derivations.
result Transformer-based approach achieves similar or better accuracy than maximum likelihood estimation.

Study compares two methods for predicting extreme atmospheric events.

problem Forecasting threshold exceedances of atmospheric variables like temperature and wind speed.
method Direct vs. full distribution probabilistic methods for rare events.
result Full distribution approach outperforms direct method for extreme events.

New method for distributed online learning with communication constraints reduces joint regret.

problem Joint regret minimization in a distributed online learning setting with communication constraints.
method Adaptive graph partitioning and comparator-adaptive online convex optimization with delayed gradient information.
result Optimal graph partition selection for adversarial activations and gradients reduces joint regret.

The Bouncy Particle Sampler is a novel rejection-free non-reversible sampler for differentiable probability distributions over continuous variables. We generalize the algorithm to piecewise differentiable distributions and apply it to generic binary distributions using a piecewise differentiable augmentation. We illust…

2017-11-02abs ↗pdf ↗

A new method predicts precipitation distributions from ensemble forecasts.

problem Improving accuracy and calibration of precipitation forecasts.
method Distributional regression U-Nets for postprocessing ensemble precipitation forecasts.
result Competitive performance in continuous ranked probability score, especially for heavy precipitation.