New algorithm for aggregate inference in HMMs with continuous observations.
problem Inference in large populations with indistinguishable individuals and continuous measurements.
method Continuous observation collective forward-backward algorithm extending existing discrete case algorithm.
result Efficacy demonstrated through numerical experiments.
A new algorithm estimates aggregate marginals from noisy data in an online manner.
problem Estimating aggregate marginals of a Markov chain from noisy aggregate observations.
method Sliding window Sinkhorn belief propagation (SW-SBP) algorithm.
result Demonstrated improved performance on inferring population flow.
Adaptive Bayesian learning aggregates experts to improve performance.
problem Bayesian online learning's performance depends on inferential choices.
method Treat Bayesian update rules as experts and aggregate them based on sequential predictive losses.
result The aggregate competes with the best expert in hindsight at a low aggregation cost.
New method produces coherent forecasts for long-range data.
problem Inaccurate and non-coherent forecasts on long-horizon data.
method Probabilistic forecasting with KL-divergence for coherent aggregates.
result Improves forecast performance across base levels and aggregates.
Federated learning leaks participant dataset quality even with secure aggregation.
problem Leakage of participant dataset quality in federated learning with secure aggregation.
method Image recognition experiments to infer and attribute dataset quality.
result Relative quality ordering of participants can be inferred and used for various purposes.
Early-stopped aggregation improves computational efficiency in adaptive statistical inference.
problem Computational inefficiency in model selection and aggregation for adaptive inference.
method Early-stopped aggregation (ESA) framework: compute only a few simpler models using early-stopping criteria.
result ESA achieves optimal adaptive contraction rates in variational Bayes and frequentist settings.
New algorithm for collective Gaussian hidden Markov models inference.
problem Inference of collective Gaussian hidden Markov models from aggregate data.
method Collective Gaussian forward-backward algorithm, extending Sinkhorn belief propagation.
result Convergence guarantee and applicability to single individual Kalman filter.
New algorithm for efficient inference over tree-structured graphs.
problem Inference over probabilistic graphical models with aggregate data.
method Optimal transport theory, Sinkhorn/iterative scaling algorithm, belief propagation.
result Global convergence and polynomial computational complexity.
This paper tackles hidden state inference for HMMs using particle filtering.
problem Inference for hidden states under HMMs is challenging due to unavailable true labels.
method Adaptive conformal inference framework using particle filtering.
result The framework produces prediction sets with specific aggregated coverage levels.
Model infers functions for attributes using multi-aggregate datasets with knowledge transfer.
problem Modeling aggregate data with varying granularities and spatial supports.
method Multi-output Gaussian process (MoGP) with linear mixing of independent latent GPs, aggregation process, and prior distribution of mixing weights.
result Proposed model outperforms in refining coarse-grained aggregate data.
FedBE aggregates local models into a robust global model via Bayesian inference.
problem Challenges in aggregating non-i.i.d. local models into a global model in federated learning.
method FedBE uses Bayesian inference to sample and combine higher-quality global models from local models.
result FedBE leads to more robust aggregation of local models into a global model, especially when data is non-i.i.d.
Noisy labeled data is more a norm than a rarity for crowd sourced contents. It is effective to distill noise and infer correct labels through aggregation results from crowd workers. To ensure the time relevance and overcome slow responses of workers, online label aggregation is increasingly requested, calling for solut…
The unprecedented demand for large amount of data has catalyzed the trend of combining human insights with machine learning techniques, which facilitate the use of crowdsourcing to enlist label information both effectively and efficiently. The classic work on crowdsourcing mainly focuses on the label inference problem …
We develop an extension of the Knockoff Inference procedure, introduced by Barber and Candes (2015). This new method, called Aggregation of Multiple Knockoffs (AKO), addresses the instability inherent to the random nature of Knockoff-based inference. Specifically, AKO improves both the stability and power compared with…
In order to scale standard Gaussian process (GP) regression to large-scale datasets, aggregation models employ factorized training process and then combine predictions from distributed experts. The state-of-the-art aggregation models, however, either provide inconsistent predictions or require time-consuming aggregatio…
Log-Loss scores expose membership privacy breaches.
problem Privacy leakage from statistical aggregates like Log-Loss scores.
method Proved that Log-Loss scores enable full accuracy membership inference in a single query.
result Complete membership privacy breach is possible with Log-Loss scores.
Aggregate network properties such as cluster cohesion and the number of bridge nodes can be used to glean insights about a network's community structure, spread of influence and the resilience of the network to faults. Efficiently computing network properties when the network is fully observed has received significant …
STAG injects noise into graph neural networks to improve performance.
problem Graph neural networks suffer from over-smoothing and limited discrimination.
method Introduces a stochastic aggregation framework (STAG) with adaptive noise injection.
result STAG models correct both over-smoothing and discrimination issues.
Adaptive Conformal Inference improves time series forecasting uncertainty.
problem Uncertainty quantification in time series models with dependency.
method AgACI, an adaptive method based on online expert aggregation.
result AgACI provides efficient prediction intervals for day-ahead electricity price forecasting.
Multilayer networks are attracting growing attention in many fields, including finance. In this paper, we develop a new tractable procedure for multilayer aggregation based on statistical validation, which we apply to investor networks. Moreover, we propose two other improvements to their analysis: transaction bootstra…
Databases in domains such as healthcare are routinely released to the public in aggregated form. Unfortunately, naive modeling with aggregated data may significantly diminish the accuracy of inferences at the individual level. This paper addresses the scenario where features are provided at the individual level, but th…
Enhances survival analysis by separating population behavior from individual dynamics.
problem Improving the training and inference of survival analysis models for sparsely occurring events.
method Decouples survival analysis into an aggregated baseline hazard and independent survival scores.
result Achieves competitive performance and robust results without fine-tuning.
In many contexts, we have access to aggregate data, but individual level data is unavailable. For example, medical studies sometimes report only aggregate statistics about disease prevalence because of privacy concerns. Even so, many a time it is desirable, and in fact could be necessary to infer individual level chara…
Fishnets improve set and graph learning with scalable, robust aggregation.
problem Learning informative embeddings for sets and graphs with scalable and robust aggregation.
method Proposes Fishnets, a new aggregation strategy for set-based learning.
result Fishnets achieve state-of-the-art performance on graph datasets with fewer parameters and faster training.
Graph convolutional neural networks (GCNNs) have been attracting increasing research attention due to its great potential in inference over graph structures. However, insufficient effort has been devoted to the aggregation methods between different convolution graph layers. In this paper, we introduce a graph attribute…
VFG model embeds flow-based models with hierarchical structures using variational inference.
problem Flow-based models struggle with high-dimensional latent spaces and lack of tractable inference for graphical structures.
method Integrates flow-based functions through variational inference with aggregation nodes for hierarchical information integration.
result VFG models achieve improved ELBO and likelihood values on multiple datasets.
A general graph-structured neural network architecture operates on graphs through two core components: (1) complex enough message functions; (2) a fixed information aggregation process. In this paper, we present the Policy Message Passing algorithm, which takes a probabilistic perspective and reformulates the whole inf…
FABLE incorporates instance features into PWS label models for improved performance.
problem Lack of instance features in existing label models limits their performance.
method FABLE uses a mixture of Bayesian label models and a Gaussian Process classifier to incorporate instance features.
result FABLE achieves the highest averaged performance across nine baselines on benchmark datasets.
Federated Learning enables mobile devices to collaboratively learn a shared inference model while keeping all the training data on a user's device, decoupling the ability to do machine learning from the need to store the data in the cloud. Existing work on federated learning with limited communication demonstrates how …
Bayesian method improves Federated Learning robustness against corrupted updates.
problem Adversarial attacks on Federated Learning models with unknown number of compromised clients.
method Adaptive Bayesian aggregation based on likelihood of clients being honest.
result Consistently achieves state-of-the-art performance across various attack types.
DAGgr aggregates multiple DAGs to stabilize causal structure learning.
problem Stability in learning causal structure from data.
method Model averaging of candidate DAGs weighted by predictive likelihood, with acyclicity enforced.
result DAGgr consistently outperforms individual DAGs and bootstrap-aggregation baselines.
Noise-aware Bayesian inference framework for locally private data collection.
problem Privacy-preserving data collection with non-trustworthy aggregators.
method Noise-aware probabilistic modeling framework for Bayesian inference under LDP.
result Demonstrated efficacy in parameter estimation for various distributions and regression models.
Aggregation defenses improve deep learning models' robustness against data poisoning attacks.
problem Data poisoning attacks manipulate deep learning models with malicious training samples.
method Deep Partition Aggregation, efficiency improvements, data-to-complexity ratio, poisoning overfitting phenomenon.
result Aggregation defenses boost poisoning robustness through the poisoning overfitting phenomenon.
We propose a probabilistic model to aggregate the answers of respondents answering multiple-choice questions. The model does not assume that everyone has access to the same information, and so does not assume that the consensus answer is correct. Instead, it infers the most probable world state, even if only a minority…
Graph Neural Networks (GNNs) are based on repeated aggregations of information across nodes' neighbors in a graph. However, because common neighbors are shared between different nodes, this leads to repeated and inefficient computations. We propose Hierarchically Aggregated computation Graphs (HAGs), a new GNN graph re…
New model improves multimodal autoencoders by learning joint and conditional distributions.
problem Limitations in recent multimodal autoencoders restrict their quality on complex datasets.
method Proposes a multistage training process with variational inference and Normalizing Flows, leveraging shared modality information.
result Achieves state-of-the-art results on benchmark datasets.
Proposes a new method for deep ensembles that improves accuracy and calibration.
problem Improving accuracy and calibration of deep ensembles.
method Estimates confusion matrices of ensemble members and weighs them according to their inferred performance.
result Empirically shows superiority of soft Dawid Skene over ensemble averaging.
Bayesian mixture models inference in federated learning
problem Inference of Bayesian mixture models in federated learning
method Consensus Monte Carlo approach
result Recovery of small clusters with greater accuracy than standard MCMC
A conformal procedure improves CoT reasoning by aggregating reasoning paths and calibrating abstention rules.
problem Aggregation uncertainty in chain-of-thought reasoning makes correct answers less reliable.
method Introduces a conformal procedure for CoT reasoning that uses weighted score aggregation and abstention rules.
result Achieves higher selective accuracy with abstention, reducing confident-error rate.
JADAI optimizes design and inference for parameter estimation.
problem Parameter estimation with active optimization of design variables.
method Jointly trains a policy, history network, and inference network to minimize posterior error.
result Achieves superior or competitive performance across benchmarks.
Many real world problems can now be effectively solved using supervised machine learning. A major roadblock is often the lack of an adequate quantity of labeled data for training. A possible solution is to assign the task of labeling data to a crowd, and then infer the true label using aggregation methods. A well-known…
Infer-AVAE infers missing user attributes from incomplete data using a novel adversarial approach.
problem Incomplete user attributes in social networks.
method Infer-AVAE combines MLP and GNNs with adversarial training to infer missing attributes.
result Infer-AVAE outperforms baselines by 7.0% in accuracy on real-world datasets.
FedLog reduces communication in federated learning by sharing data summaries.
problem Significant communication overhead in federated learning with large model parameters.
method Shares minimal sufficient statistics via Bayesian inference and differential privacy.
result High learning accuracy with low communication overhead.
New method improves MAP inference for CGMs on path graphs, avoiding approximation and maintaining integrality.
problem Improving MAP inference for aggregated count data in CGMs with small values.
method Formulated as a minimum cost flow problem, solved using DCA with efficient subroutines.
result Outputs higher quality solutions than conventional methods.
A new method combines Gaussian graphical models for better distributed Gaussian process predictions.
problem Poor results from traditional DGP due to violated conditional independence assumption.
method Proposes using Gaussian graphical models to aggregate local predictions from subsets of data.
result Our method outperforms other state-of-the-art DGP approaches on both synthetic and real datasets.
Distillation is an effective knowledge-transfer technique that uses predicted distributions of a powerful teacher model as soft targets to train a less-parameterized student model. A pre-trained high capacity teacher, however, is not always available. Recently proposed online variants use the aggregated intermediate pr…
This work analyzes aggregation strategies for Bayesian deep learning models in federated learning.
problem Improper aggregation of Bayesian deep learning models in federated learning leads to sub-optimal performance.
method Six aggregation strategies for Bayesian deep learning models are analyzed using CIFAR-10 dataset and a fully variational ResNet-20 architecture.
result Aggregation strategy is a key hyperparameter affecting accuracy, calibration, uncertainty quantification, training stability, and client compute requirements.
We present a new modeling technique for solving the problem of ecological inference, in which individual-level associations are inferred from labeled data available only at the aggregate level. We model aggregate count data as arising from the Poisson binomial, the distribution of the sum of independent but not identic…