Proposes ACP for efficient inference in noisy-or models.
problem Efficient inference in noisy-or models.
method Hybrid approach combining classical and modern variational inference.
result ACP outperforms or matches other approaches in noisy-or models.
Paper learns noisy-or networks efficiently using tensor decomposition.
problem Efficiently learning noisy-or networks with tensor decomposition.
method Tensor decomposition for noisy-or networks, considering systematic error.
result Provable efficient learning algorithm for noisy-or networks.
Variational inference provides approximations to the computationally intractable posterior distribution in Bayesian networks. A prominent medical application of noisy-or Bayesian network is to infer potential diseases given observed symptoms. Previous studies focus on approximating a handful of complicated pathological…
This paper considers the problem of learning the parameters in Bayesian networks of discrete variables with known structure and hidden variables. Previous approaches in these settings typically use expectation maximization; when the network has high treewidth, the required expectations might be approximated using Monte…
pRSL combines probabilistic rules to improve multi-label classification.
problem Modeling the structure between multi-label classes for better performance.
method Uses probabilistic propositional logic rules and belief propagation to combine predictions from multiple classifiers.
result pRSL achieves state-of-the-art performance on various benchmark datasets.
We present the Infinite Latent Events Model, a nonparametric hierarchical Bayesian distribution over infinite dimensional Dynamic Bayesian Networks with binary state representations and noisy-OR-like transitions. The distribution can be used to learn structure in discrete timeseries data by simultaneously inferring a s…
The paper proposes a method to detect and filter noisy or mislabeled data using pointwise mutual information.
problem Detecting and filtering noisy or mislabeled data in deep learning models.
method A mutual information-based framework quantifying statistical dependencies between inputs and labels.
result The method effectively filters low-quality samples, improving classification accuracy by up to 15%.
The paper finds outliers in large matrices with noisy or missing data.
problem Locating outliers in large, noisy or incomplete matrices.
method Randomized two-step inference framework with sample complexity conditions.
result The proposed methods accurately locate outliers with high probability.
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr[childlparents] depend monotonically on weighted sums of the parents. In large networks where exact probabilistic inference is intractable, we show how to compute upper and lower bounds on many probabilities of intere…
Bayes by Hypernet improves neural network uncertainty measures.
problem Overconfidence and lack of meaningful uncertainty measures in neural networks.
method Bayes by Hypernet (BbH) uses implicit distributions and neural networks to model complex distributions.
result Bayes by Hypernet achieves competitive accuracies and predictive uncertainties on MNIST and CIFAR5 tasks.
Given a set of experiments in which varying subsets of observed variables are subject to intervention, we consider the problem of identifiability of causal models exhibiting latent confounding. While identifiability is trivial when each experiment intervenes on a large number of variables, the situation is more complic…
SDA method reduces memory and time for assimilating noisy geophysical data.
problem Challenges in identifying state trajectories of high-dimensional geophysical systems.
method Score-based data assimilation with modified score network architecture.
result Promising results for a two-layer quasi-geostrophic model.
Simultaneously estimates travel times and route choice model parameters.
problem Interdependent estimation of arc travel times and route choice model parameters.
method Maximum likelihood estimation for any differentiable route choice model.
result Strong performance in real-world data, even compared to arc travel time estimation methods.
GER learns particle dynamics from unpaired snapshots using physics-informed GANs.
problem Learning particle dynamics from unpaired snapshots with physics constraints.
method Physics-informed generative model to fit particle ensemble distributions.
result Inferred dynamics of particle ensembles governed by SODEs up to 100 dimensions.
New method reduces neural network memorization of noisy labels.
problem Neural networks memorize label noise, leading to poor generalization.
method Proposes an auxiliary network that predicts gradients without labels.
result Reduces memorization of label-noise, improving generalization.
In this paper, we study the information-theoretic limits of learning the structure of Bayesian networks (BNs), on discrete as well as continuous random variables, from a finite number of samples. We show that the minimum number of samples required by any procedure to recover the correct structure grows as Ω(m) and $Ω…
A novel method for estimating Bayesian network (BN) parameters from data is presented which provides improved performance on test data. Previous research has shown the value of representing conditional probability distributions (CPDs) via neural networks(Neal 1992), noisy-OR gates (Neal 1992, Diez 1993)and decision tre…
BIOMRC dataset improves MRC performance, especially for non-experts.
problem Improving machine reading comprehension in biomedical texts.
method Developed a new dataset and tested two neural models, along with a BERT-based model.
result BERT-based model outperforms all other methods and reaches expert-level accuracy.
Model detects patterns in noisy binary data, explaining neuron activity in terms of cell assemblies.
problem Detecting structure in noisy or approximate repeats of patterns in sparse binary data.
method Probabilistic binary latent variable model based on Noisy-OR model, inferring sparse activity in latent variables.
result Model successfully extracts and explains latent structure in spiking neural data.
When dealing with subjective, noisy, or otherwise nebulous features, the "wisdom of crowds" suggests that one may benefit from multiple judgments of the same feature on the same object. We give theoretically-motivated `feature multi-selection' algorithms that choose, among a large set of candidate features, not only wh…
A federated model learns shared archetypes from heterogeneous clients in continual learning.
problem Federated learning struggles with client heterogeneity and streaming distribution shifts.
method Clients encode their data as low-rank Hebbian operators, which are sent to a central server for aggregation and factorization into global archetypes.
result Improved global archetype reconstruction and associative retrieval in heterogeneous clients, drift, and novelty settings.
Study on reproducibility in optimization with bounds on limits.
problem Limits of reproducibility in noisy or error-prone optimization procedures.
method Defined a quantitative measure of reproducibility and analyzed convex optimization settings.
result Revealed a fundamental trade-off between computation and reproducibility.
We use a cluster ensemble to determine the number of clusters, k, in a group of data. A consensus similarity matrix is formed from the ensemble using multiple algorithms and several values for k. A random walk is induced on the graph defined by the consensus matrix and the eigenvalues of the associated transition proba…
New findings show learnable distributions remain learnable even with noisy or adversarial perturbations.
problem Learning from perturbed samples in high-dimensional spaces.
method Developed a perturbation-quantization framework to analyze additive noise and adversarial corruption models.
result Sample compressible families remain learnable even under noisy or adversarial perturbations.
Graph-based multimodal federated learning for HAR improves accuracy and privacy.
problem Challenges in HAR due to noisy data, incomplete measurements, and privacy concerns.
method Proposes GraMFedDHAR, a Graph-based Multimodal Federated Learning framework for HAR tasks, using modality-specific graphs, residual GCNs, and attention-based fusion.
result Experimental results show up to 13 percent performance improvement for MultiModalGCN under differential privacy constraints.
Empirical study shows overparameterization benefits unsupervised learning of latent variable models.
problem Improving optimization landscape in unsupervised learning with overparameterization.
method Synthetic and semi-synthetic experiments with various models and training algorithms.
result Overparameterization significantly increases the number of ground truth latent variables recovered.
SelectMix improves deep learning robustness against noisy labels.
problem Deep neural networks memorize noisy labels, degrading performance.
method Confidence-guided targeted sample mixing with soft labels.
result SelectMix consistently outperforms baseline methods on noisy label datasets.
DGM learns graph structure for better graph neural network performance.
problem Graphs are often unknown or noisy, limiting graph neural network performance.
method DGM learns graph structure from data, improving performance in transductive and inductive settings.
result DGM achieves state-of-the-art results across various domains.
Framework for reconstructing nonlinear systems from multi-modal time series data.
problem Reconstructing nonlinear dynamical systems from multi-modal time series data.
method Dynamic interpretable recurrent neural networks coupled with generalized linear models for multi-modal data integration.
result Framework efficiently compensates for noisy or missing information in one data channel using other channels.
The paper explains generalization in kernel regression and deep neural networks using spectral bias and task-model alignment.
problem Understanding generalization in machine learning models, especially deep neural networks.
method Analytical expression for generalization error derived from statistical mechanics, applied to various kernels and data distributions.
result Spectral bias and task-model alignment explain generalization in kernel regression and deep neural networks.
This paper examines the problem of locating outlier columns in a large, otherwise low-rank, matrix. We propose a simple two-step adaptive sensing and inference approach and establish theoretical guarantees for its performance; our results show that accurate outlier identification is achievable using very few linear sum…
Improved community detection in heterogeneous SBM with side information.
problem Misclassification in community detection with noisy labels.
method Optimal weighted message passing and minimum energy flow.
result Optimal weighting improves misclassification rate in heterogeneous SBM.
Efficient learning with robust gradient descent reduces resource usage.
problem Learning from noisy or heavy-tailed data requires many observations.
method Constructs a robust approximation of the risk gradient for iterative learning.
result Shows that the proposed procedure learns more efficiently with less resources.
Proposes a new objective function to learn robust deep features.
problem Learning robust deep representations of noisy or unavailable features.
method Maximizes mutual information of all subsets of features relative to supervising signal.
result Surrogate objective function encourages non-redundant and conditionally independent features.
PROFET builds DBNs from ODEs, handling uncertainty in data and models.
problem Handling uncertainty in both data and models for DBN construction.
method Automatic DBN construction from ODEs, adaptive-time particle filtering.
result PROFET automates DBN construction and inference from ODE models.
Boosting classifiers improve accuracy with noisy inputs.
problem Noisy communication or computation degrades boosting classifier accuracy.
method Optimize resource allocation for base classifiers based on importance metrics.
result Optimized noisy boosting classifiers are more robust than bagging.
Parallel sentences are a relatively scarce but extremely useful resource for many applications including cross-lingual retrieval and statistical machine translation. This research explores our methodology for mining such data from previously obtained comparable corpora. The task is highly practical since non-parallel m…
The paper compares and improves aggregators for relational probabilistic models.
problem Predicting gender from movie ratings is challenging due to varying numbers of movies per user and users per movie.
method The paper compares existing aggregators and proposes new ones, showing their empirical superiority.
result New aggregators and model modifications outperform existing ones.
Unified approach for learning with weak labels across various tasks.
problem Learning with noisy or incomplete labels in diverse machine learning settings.
method Implicit posterior models for joint label inference.
result Unified training objective for various machine learning tasks.
New method reduces bias in causal inference from noisy data.
problem Inaccuracies in noisy data affect causal inference conclusions.
method Proposes a novel approach to reduce bias in causal inference from noisy key variables.
result Reduces bias and avoids false causal inference conclusions in most cases.
LDLE embeds manifolds in lower dimensions with low distortion.
problem Embedding manifolds in lower dimensions with low distortion.
method Constructs local views using global eigenvectors of the graph Laplacian, registers them using Procrustes analysis, and tears manifolds apart for intrinsic dimension embedding.
result LDLE preserves distances up to a constant scale with low distortion.
Proposes a probabilistic model to improve hydrology predictions and trust.
problem Noisy or missing basin characteristics impact streamflow prediction.
method Probabilistic inverse modeling framework to reconstruct basin characteristics.
result 6% improvement in R2 for streamflow prediction, 17% reduction in uncertainty. A novel framework for consensus clustering is presented which has the ability to determine both the number of clusters and a final solution using multiple algorithms. A consensus similarity matrix is formed from an ensemble using multiple algorithms and several values for k. A variety of dimension reduction techniques …
New methods ensure fairness in noisy protected groups.
problem Noisy or biased protected group information complicates fairness audits.
method Robust optimization techniques to enforce fairness on true groups.
result Robust approaches achieve better true group fairness guarantees.
Bayesian optimization for expensive integrands achieves optimal performance.
problem Optimizing functions with expensive integrands in noisy conditions.
method Bayesian optimization with discretization-free value of information optimization.
result Achieves optimal performance in noisy and smooth conditions.
ScoreStop uses gradient tests to stop gradient boosting early.
problem Overfitting in gradient boosted decision trees.
method ScoreStop uses a functional score test based on gradients to stop boosting.
result ScoreStop is competitive with loss-based early stopping methods.
New oracles improve stochastic optimization with noisy or biased measurements.
problem Optimizing functions with noisy or biased measurements.
method Introduced biased gradient oracles for stochastic optimization, analyzed RSG and SGD algorithms with these oracles.
result Derived non-asymptotic bounds for convergence rates of algorithms with biased gradient oracles.
Scalable TS using sparse GPs improves efficiency without sacrificing performance.
problem Efficiently applying TS to complex, multi-modal problems.
method Sparse Gaussian Process models for scalable TS.
result Theoretical and empirical validation of scalable TS's effectiveness.