In this paper, we propose a data collaboration analysis method for distributed datasets. The proposed method is a centralized machine learning while training datasets and models remain distributed over some institutions. Recently, data became large and distributed with decreasing costs of data collection. If we can cen…
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,742 papers · 148 categories
Trend · papers per month
48 results for “distributed datasets”
In this paper, we propose a novel method for generating a synthetic dataset obeying Gaussian distribution. Compared to the commonly used benchmark datasets with unknown distribution, the synthetic dataset has an explicit distribution, i.e., Gaussian distribution. Meanwhile, it has the same characteristics as the benchm…
Gradient flows on distributions of distributions for machine learning tasks.
problem Designing gradient flows for datasets of probability distributions.
method Representing classes as conditional distributions, modeling datasets as mixture distributions, using Wasserstein over Wasserstein (WoW) distance and gradients.
result Demonstrated gradient flows for dataset transfer and distillation tasks.
Improves joint distribution learning for high-dimensional datasets with complex correlations.
problem Conditional independence assumption limitations in VAE decoders for high-dimensional datasets.
method Cramer-Wold distance regularization and two-step learning method for flexible prior modeling.
result Effective joint distributional learning for high-dimensional datasets with multiple categorical variables.
DSLOB creates synthetic LOB data for benchmarking forecasting algorithms under distributional shifts.
problem Challenges in dealing with out-of-distribution limit order book data.
method Multi-agent market simulator to create labeled synthetic LOB dataset with and without market stress.
result Demonstrates the need for robust forecasting algorithms to handle distributional shifts.
BGANs enable multi-agent learning with distributed private datasets.
problem Learning from distributed private datasets in multi-agent scenarios.
method Brainstorming GAN architecture for fully distributed learning.
result BGANs generate high-quality data samples with lower JSD and FID.
New method corrects bias in datasets using cumulative distribution functions.
problem Varying domains and biased datasets lead to differences between training and target distributions.
method Empirical cumulative distribution function estimates of the target distribution, rigorously generalized.
result Method is more robust, not reliant on parameter tuning, and performs similarly to state-of-the-art techniques.
Paper proposes a framework to detect distribution shifts using embedding space geometry.
problem Detecting distribution shifts in candidate datasets to improve model generalizability.
method Non-parametric framework using embedding space geometry for two tests: robustness boundary and in-distribution/out-of-distribution classification.
result Both tests successfully detect distribution shifts in various scenarios for both synthetic and real-world datasets.
We evaluate the distribution learning capabilities of generative adversarial networks by testing them on synthetic datasets. The datasets include common distributions of points in space and images containing polygons of various shapes and sizes. We find that by and large GANs fail to faithfully recreate point dat…
Shifts dataset evaluates uncertainty in real-world tasks across modalities.
problem Lack of standard datasets for evaluating uncertainty estimation and robustness to distributional shift.
method Proposes Shifts Dataset for evaluation of uncertainty estimates and robustness to distributional shift across tabular, audio, text, and sensor data.
result Baseline results for tabular weather prediction, machine translation, and SDC vehicle motion prediction.
The SVHN Dataset Is Deceptive for Probabilistic Generative Models Due to a Distribution Mismatchcs.CV
SVHN dataset's split affects generative models but not digit classification.
problem Distribution mismatch between SVHN training and test sets impacts generative models.
method Empirically showed distribution mismatch affects generative models; proposed mixing and re-splitting.
result Distribution mismatch in SVHN dataset significantly impacts probabilistic generative models.
We propose an unsupervised object matching method for relational data, which finds matchings between objects in different relational datasets without correspondence information. For example, the proposed method matches documents in different languages in multi-lingual document-word networks without dictionaries nor ali…
Understanding normalization in contrastive representation learning and out-of-distribution detectioncs.CV
Method enhances anomaly detection using contrastive learning and out-of-distribution data.
problem Improving anomaly detection in datasets with limited out-of-distribution data.
method Proposes a contrastive learning method that incorporates out-of-distribution data to enhance anomaly detection performance.
result The method significantly improves anomaly detection performance, even with limited out-of-distribution data.
We introduce two challenging datasets that reliably cause machine learning model performance to substantially degrade. The datasets are collected with a simple adversarial filtration technique to create datasets with limited spurious cues. Our datasets' real-world, unmodified examples transfer to various unseen models …
Improves out-of-distribution detection in neural networks.
problem Detecting out-of-distribution examples in neural networks.
method Normalizing flows and residual flow architecture for expressive density modeling.
result Significantly improved true negative rate (77.5%) compared to state-of-the-art (56.7%).
Meta-learning reformulated as Bayesian risk minimization.
problem Learning models to quickly adapt to new tasks from small datasets.
method Formalized meta-learning as Bayesian risk minimization, using a probabilistic framework to compute predictive distributions from posterior distributions of latent variables conditioned on contextual datasets.
result A novel Gaussian approximation for the posterior distribution that converges to maximum likelihood estimates and outperforms Neural Process on benchmark datasets.
Metric evaluates symmetry-breaking in datasets, revealing severe biases.
problem Symmetry-breaking in datasets can hinder the performance of symmetry-aware methods.
method Developed a metric to quantify symmetry-breaking using a two-sample classifier test.
result Symmetry-breaking can prevent optimal performance of invariant methods, even when labels are invariant.
Two derivations of PCA for distributional data.
problem PCA for datasets of distributions.
method Two derivations: variance maximization and reconstruction error minimization.
result Closed-form solution for distributional PCA.
Data-driven topology design using a deep generative modelphysics.comp-ph
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.
AFLite filters dataset biases to improve model generalization.
problem Overfitting to dataset biases degrades model performance on out-of-distribution samples.
method AFLite adversarially filters dataset biases, reducing their impact on model performance.
result Filtered datasets yield better generalization to out-of-distribution tasks.
A recent technical breakthrough in the domain of machine learning is the discovery and the multiple applications of Generative Adversarial Networks (GANs). Those generative models are computationally demanding, as a GAN is composed of two deep neural networks, and because it trains on large datasets. A GAN is generally…
Variational Auto-Encoders enforce their learned intermediate latent-space data distribution to be a simple distribution, such as an isotropic Gaussian. However, this causes the posterior collapse problem and loses manifold structure which can be important for datasets such as facial images. A GAN can transform a simple…
State-constrained offline RL expands RL's learning scope.
problem Batch-constrained offline RL limits policies to seen actions.
method Introduces state-constrained offline RL focusing on state distribution.
result Policy can take high-quality out-of-distribution actions.
Dida learns meta-features invariant to feature permutations.
problem Learning invariant meta-features from dataset samples.
method Distribution-based deep architecture inheriting universal approximation and robustness.
result Dida outperforms state-of-the-art methods on dataset-level tasks.
BDC compresses both sample size and dimensionality of large datasets.
problem Large datasets in both sample size and dimensionality.
method Two-stage framework using Decoded MMD, Reconstruction MMD, and Encoded MMD.
result BDC achieves comparable or superior performance with lower cost and higher compression rates.
New distributed EnKF method for non-sequential assimilation of large datasets.
problem Computational intensity and order dependencies in traditional EnKF.
method Distributed computing for full model error covariance matrix.
result Non-sequential assimilation outperforms sequential in performance.
The Wallenius distribution is a generalisation of the Hypergeometric distribution where weights are assigned to balls of different colours. This naturally defines a model for ranking categories which can be used for classification purposes. Since, in general, the resulting likelihood is not analytically available, we a…
s-OTDD compares datasets efficiently without training, robust to class variations.
problem Efficiently compare datasets without training or class variations.
method Moment Transform Projection (MTP) and sliced optimal transport.
result s-OTDD correlates with optimal transport and transfer learning performance.
In today's era of big data, robust least-squares regression becomes a more challenging problem when considering the adversarial corruption along with explosive growth of datasets. Traditional robust methods can handle the noise but suffer from several challenges when applied in huge dataset including 1) computational i…
Proposes a framework to assess model robustness to dataset shifts.
problem Evaluating model robustness to changes in setting or population.
method Derives a debiased estimator for analyzing performance on worst-case distributions.
result Demonstrates the estimator can account for realistic shifts in complex distributions.
Fuses posterior distributions from different datasets using KL divergence.
problem Combining information from multiple datasets with uncertainty.
method Mean field assumption, KL divergence, assign-and-average approach.
result Efficient non-parametric algorithm for fused model computation.
A new method aligns source and target distributions by tuning their weights.
problem Domain adaptation on unlabeled target datasets using labeled source datasets.
method Weighted Joint Distribution Optimal Transport (WJDOT) method that finds alignment between source and target distributions and re-weighting of source distributions.
result Achieves state-of-the-art performance on simulated and real-life datasets.
Study shows different trajectory prediction models generalize better under OoD conditions.
problem Comparing trajectory prediction models' robustness across different datasets.
method Training models on Argoverse 2 and testing on Waymo Open Motion, and vice versa, with various augmentation strategies.
result Smallest model with highest inductive bias performs best in OoD generalization.
Mix and Match: An Optimistic Tree-Search Approach for Learning Models from Mixture Distributionsstat.ML
We consider a covariate shift problem where one has access to several different training datasets for the same learning problem and a small validation set which possibly differs from all the individual training distributions. This covariate shift is caused, in part, due to unobserved features in the datasets. The objec…
In real-world classification problems, the class balance in the training dataset does not necessarily reflect that of the test dataset, which can cause significant estimation bias. If the class ratio of the test dataset is known, instance re-weighting or resampling allows systematical bias correction. However, learning…
Bayesian models provide a framework for probabilistic modelling of complex datasets. However, many of such models are computationally demanding especially in the presence of large datasets. On the other hand, in sensor network applications, statistical (Bayesian) parameter estimation usually needs distributed algorithm…
Study shows current image classification models lack robustness to real-world dataset shifts.
problem Robustness of current image classification models to natural distribution shifts in real datasets.
method Evaluation of 204 ImageNet models in 213 different test conditions.
result Little to no transfer of robustness from synthetic to natural distribution shifts.
MixMOOD improves SSDL by selecting unlabelled data based on deep feature similarity.
problem Class distribution mismatch in semi-supervised learning.
method MixMOOD uses deep dataset dissimilarity measures to select unlabelled data.
result MixMOOD selects unlabelled data based on strong correlation with MixMatch accuracy.
Distributed computing offers a high degree of flexibility to accommodate modern learning constraints and the ever increasing size of datasets involved in massive data issues. Drawing inspiration from the theory of distributed computation models developed in the context of gradient-type optimization algorithms, we prese…
This paper speeds up inference in large hierarchical models.
problem Inference in large hierarchical models is slow and difficult.
method Amortized variational inference with shared parameters.
result Amortized inference is as accurate as a full-rank Gaussian but much faster.
GeoLifeCLEF 2020 dataset pairs species observations with environmental data.
problem Understanding geographic species distribution.
method Presented a dataset of species observations with environmental features.
result Advances in location-based species recommendation.
Extends Shifts dataset for MS lesion segmentation and marine vessel power estimation.
problem Distributional shift in training and deployment data for ML models.
method Develops new datasets for high-risk industrial applications.
result Demonstrates robustness and uncertainty estimation in new industrial tasks.
One key use of k-means clustering is to identify cluster prototypes which can serve as representative points for a dataset. However, a drawback of using k-means cluster centers as representative points is that such points distort the distribution of the underlying data. This can be highly disadvantageous in problems wh…
Privacy is crucial in many applications of machine learning. Legal, ethical and societal issues restrict the sharing of sensitive data making it difficult to learn from datasets that are partitioned between many parties. One important instance of such a distributed setting arises when information about each record in t…
A new embedding method extracts dataset-scale metric distribution into vectorial representation for graph data.
problem Classifying graph-structured data based on overall dataset-scale discrepancies.
method MetricDistribution2vec embedding strategy.
result Significant improvement in supervised prediction tasks on real-world graph datasets.
Multi-instance learning (MIL) deals with tasks where data is represented by a set of bags and each bag is described by a set of instances. Unlike standard supervised learning, only the bag labels are observed whereas the label for each instance is not available to the learner. Previous MIL studies typically follow the …
Deep networks, composed of multiple layers of hierarchical distributed representations, tend to learn low-level features in initial layers and transition to high-level features towards final layers. Paradigms such as transfer learning, multi-task learning, and continual learning leverage this notion of generic hierarch…
Self-paced learning (SPL) mimics the cognitive process of humans, who generally learn from easy samples to hard ones. One key issue in SPL is the training process required for each instance weight depends on the other samples and thus cannot easily be run in a distributed manner in a large-scale dataset. In this paper,…