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.
Venn GAN models multiple distributions, discovering shared and unique aspects.
problem Modeling and understanding multiple data distributions effectively.
method A GAN design with shared and non-shared generator distributions.
result Effective modeling of various datasets (MNIST, Fashion MNIST, CIFAR-10, Omniglot, CelebA).
We provide new results for noise-tolerant and sample-efficient learning algorithms under s-concave distributions. The new class of s-concave distributions is a broad and natural generalization of log-concavity, and includes many important additional distributions, e.g., the Pareto distribution and t-distribution.…
Max-diversity improves distributed learning performance.
problem Improving risk performance in distributed learning.
method Max-diversity distributed learning algorithm (MDD).
result MDD outperforms existing methods with tighter risk bounds.
Optimal convergence rates for distributed learning methods are derived.
problem Generalization properties of distributed algorithms in nonparametric regression.
method Distributed stochastic gradient methods (SGM) and spectral-regularization algorithms (SRA).
result Optimal generalization error bounds for distributed SGM are retained with appropriate partition levels.
Paper tackles distribution matching by partially matching distributions, achieving robust results.
problem Robustly aligning two probability distributions.
method Developed a partial Wasserstein adversarial network (PWAN) to efficiently approximate the partial Wasserstein-1 (PW) discrepancy.
result The PWAN effectively produces highly robust matching results, outperforming state-of-the-art methods.
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.
The paper calculates European option prices under a generalized skew normal distribution.
problem European option pricing under a generalized skew normal distribution.
method Proved existence of martingale measure, derived explicit option pricing formula, applied numerical methods.
result Explicit expressions for European option prices are derived.
Paper introduces a new method for learning with distributions using dissimilarity measures.
problem Learning with probability distributions using dissimilarity measures.
method Introduces embeddings based on dissimilarity of distributions to templates, extending similarity theory to population distributions.
result Proves that dissimilarity theory holds for empirical distributions and shows better performance of Wasserstein distance embedding.
Langevin Dynamics fails to sample from mixture distributions efficiently.
problem Analyzing Langevin Dynamics for sampling from mixture distributions.
method Theoretical analysis of Langevin Dynamics and proposing Chained-Langevin Dynamics.
result Langevin Dynamics fails to sample from mixture distributions efficiently.
Study tackles distribution shift in combinatorial settings using matrix completion techniques.
problem Tackling distribution shift in combinatorial settings with rigorous statistical guarantees.
method Develops novel algorithms and theoretical results for extrapolating to test distributions not covered in training.
result Achieves bilinear combinatorial extrapolation under gradual spectral decay in high-dimensional data.
Paper finds robust Λ-quantiles equal to extremal distributions.
problem Investigating robust models for Λ-quantiles with partial loss information. method Extending classical quantiles using Λ-quantiles and applying results from robust quantiles. result Robust Λ-quantiles equal to Λ-quantiles of extremal distributions. Improved bounds for discrete probability distribution estimation under the ℓ∞ norm.
problem Estimating discrete probability distributions under the ℓ∞ norm with improved bounds.
method Minimax bounds in expectation and high-probability tail bounds.
result Resolved open questions posed in Kontorovich and Painsky (JMLR, 2025), including a fully empirical tightest risk bound and identifying the worst-case extremal distribution.
Characterizes symmetric Bernoulli distributions with minimal convex sums.
problem Understanding minimal dependence among Bernoulli random vectors.
method Geometric and algebraic representations of multivariate symmetric Bernoulli distributions.
result Characterizes extremal negative dependence and builds minimal dependence copulas.
This paper improves reinforcement learning by modeling return distributions explicitly.
problem Traditional reinforcement learning averages over randomness, missing distributional information.
method Develops a distributional reinforcement learning algorithm using quantile regression.
result The new algorithm significantly outperforms existing methods on Atari games.
The paper studies robust risk measures with linear penalties under uncertain distributions.
problem Risk measurement under distributional uncertainty.
method Robust distortion risk measures with linear penalty function under distributional constraints.
result Explicit characterization of optimal quantile distribution and value function.
IHT improves sparse distribution learning.
problem Learning sparse discrete distributions.
method Iterative hard thresholding as a solution, with a greedy approximate projection.
result IHT achieves state of the art results for sparse distribution learning.
We consider random vectors drawn from a multivariate normal distribution and compute the sample statistics in the presence of non-stationary correlations. For this purpose, we construct an ensemble of random correlation matrices and average the normal distribution over this ensemble. The resulting distribution contains…
In this paper the result of real hypersurfaces in non-flat complex space forms, whose structure vector field ξ belongs to the κ-nullity distribution is extended in case of three dimensional real hypersurfaces in non-flat complex space forms. Furthermore, generalization of notion (κ,μ)-nullity distribution defin…
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 …
New results on max-entropy distributions with succinct descriptions and stability.
problem Understanding the complexity and stability of max-entropy distributions.
method Polynomial-time algorithms and bounds on bit complexity.
result Polynomial bit complexity of ε-optimal dual solutions to max-entropy convex programs.
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 …
This paper compares expected and distributional reinforcement learning methods.
problem Understanding why distributional reinforcement learning performs better than expected reinforcement learning.
method Analyzes differences in tabular, linear, and non-linear approximation settings.
result Distributional RL can hurt performance if it does not induce identical behavior.
Paper extends stochastic dominance for compound binomial distributions.
problem Stochastic dominance for infinite-mean random variables.
method Investigates properties and inclusion relationships of distribution classes, extends results to compound binomial distributions.
result Establishes necessary and sufficient conditions for first-order stochastic dominance preservation.
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.
A large consensus now seems to take for granted that the distributions of empirical returns of financial time series are regularly varying, with a tail exponent close to 3. We revisit this results and use standard tests as well as develop a battery of new non-parametric and parametric tests (in particular with stretche…
The paper emphasizes the importance of value distribution in reinforcement learning.
problem The focus on value expectation in reinforcement learning is insufficient.
method Developed a new algorithm based on the distributional perspective of reinforcement learning.
result Demonstrated significant distributional instability in reinforcement learning control.
Paper proves hardness of learning various complex models under local pseudorandom generators.
problem Hardness of learning various complex models.
method Existence of local pseudorandom generators.
result Proves hardness of learning shallow ReLU neural networks and other models.
This paper introduces a noise-robust clustering method using distribution distances.
problem Reducing noise impact on clustering results.
method Introduces expectation distance (ED) for distribution clustering, extending K-means and K-medoids.
result Improved clustering accuracy and reduced computation time.
The paper examines conditions for linearity in a conditional mean estimator under vector Poisson noise.
problem Conditions for linearity of the conditional mean estimator in vector Poisson noise.
method Analyzes prior distributions and their impact on the conditional mean estimator's linearity.
result The only prior distribution that induces linearity is a product gamma distribution, and non-zero dark current parameter prevents linearity.
Sharp error bounds derived for bidirectional GANs without restrictive assumptions.
problem Estimating the error of bidirectional GANs under various conditions.
method Dudley distance, neural network functions, decomposition of IPM.
result Nearly sharp bounds for bidirectional GAN estimation error.
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.
Proves effective slope gaps for lattice surfaces.
problem Proving effective slope gaps for lattice surfaces.
method Proves effective slope gap distribution for square torus and general lattice surfaces.
result Effective slope gap distribution result for lattice surfaces.
In the present work, eigenvalue distributions defined by a random rectangular matrix whose components are neither independently nor identically distributed are analyzed using replica analysis and belief propagation. In particular, we consider the case in which the components are independently but not identically distri…
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.
Efficiently estimates densities of multidimensional shift-invariant distributions.
problem Density estimation for shift-invariant multidimensional distributions.
method Efficient algorithms for learning any distribution in the class from samples, using total variation distance.
result Shift-invariant distributions can be learned efficiently with a number of samples and time proportional to 1/εd+2 and 1/ε2d+2 respectively. ResiliNet improves distributed neural network inference resilience.
problem Physical node failures in distributed neural networks cause performance drops.
method Skip hyperconnection and failout technique.
result ResiliNet provides inference resiliency for distributed neural networks.
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.
WGANs improve probability distribution approximation with depth and width trade-offs.
problem Approximating complex probability distributions accurately.
method Wasserstein GANs with GroupSort discriminators, quantified generalization bound.
result High-capacity discriminators are crucial for WGANs' performance.
Sharp concentration results for sums of heavy-tailed random variables.
problem Analyzing sums of independent heavy-tailed random variables.
method Using concentration inequalities and large deviation principles for distributions satisfying specific tail bounds.
result Sharp concentration inequalities and large deviation results for sums of heavy-tailed random variables.
Proposes BDA for better transfer learning performance.
problem Distribution divergence between source and target domains, especially marginal and conditional.
method Balanced Distribution Adaptation (BDA) and Weighted BDA (W-BDA) algorithms.
result Improves transfer learning performance on both balanced and imbalanced datasets.
We solve ReLU regression with efficient approximations for various distributions.
problem Finding the best fitting ReLU function with square loss from unknown distributions.
method Introduced efficient constant-factor approximation algorithm and polynomial-time approximation scheme.
result First constant-factor approximation algorithm for ReLU regression with weak concentration conditions.
A dynamical model of capital exchange is introduced in which a specified amount of capital is exchanged between two individuals when they meet. The resulting time dependent wealth distributions are determined for a variety of exchange rules. For ``greedy'' exchange, an interaction between a rich and a poor individual r…
A new method solves distributed optimization problems over networks.
problem Solving optimization problems over networks with local cost functions and limited communication.
method Distributed semismooth Newton based augmented Lagrangian method.
result The method efficiently solves distributed optimization problems over networks.
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.
Researchers compute gap distributions for saddle connection directions on specific translation surfaces.
problem Computing gap distributions for saddle connection directions on translation surfaces.
method Translation to dynamical question of return times to a transversal under the horocycle flow.
result Gap distributions have support at 0 and quadratic tail decay.
This paper presents a class of new algorithms for distributed statistical estimation that exploit divide-and-conquer approach. We show that one of the key benefits of the divide-and-conquer strategy is robustness, an important characteristic for large distributed systems. We establish connections between performance of…
A new method uses optimal transport to transform latent space distributions without solving a hard Min-Max problem.
problem Latent space data distribution collapse and loss of manifold structure in generative models.
method Proposes a GAN-like method to solve a minimization problem for optimal transport between a simple distribution and a latent-space data distribution.
result Experimental results show that the proposed method can handle multi-cluster distributions and is effective on MNIST and CelebA datasets.