Improved aggregation methods learn from all ICU events without preprocessing for better patient risk analysis.
problem Lack of efficient methods to dynamically assess patient status in ICU.
method Improved aggregation methods for a deep learning architecture that learns from all events without preprocessing.
result Models achieve strong performance (AUROC 0.87) in patient mortality classification.
Improved meta-learning for dynamics using additional structured knowledge.
problem Meta-learning for dynamics with limited raw observations.
method Extended Neural ODE Process model to use privileged information.
result Improved accuracy and calibration on simulated dynamics tasks.
Flexible device participation improves federated learning convergence.
problem Strict device participation limits federated learning reach.
method Analytical results and new aggregation scheme for flexible participation.
result Convergence improved with flexible device participation.
Paper analyzes sparse aggregation in GLMs with Kullback-Leibler risk bounds.
problem Sparse aggregation in GLMs for parameter approximation.
method Exponential weighted aggregation scheme with Kullback-Leibler risk bounds.
result Sharp oracle inequality for Kullback-Leibler risk with leading constant 1 and minimax-optimal rate of aggregation.
SACP aggregates nonconformity scores from multiple predictors to create more efficient uncertainty sets.
problem Combining predictive uncertainties from multiple models for efficient and reliable uncertainty quantification.
method SACP (Symmetric Aggregated Conformal Prediction) aggregates nonconformity scores using a flexible symmetric aggregation function.
result SACP consistently improves efficiency and often outperforms state-of-the-art model aggregation baselines.
Aggregates predictions from multiple regression models using random projections and kernel methods.
problem Combining predictions from multiple regression models to improve accuracy.
method Random projection of high-dimensional feature space, followed by kernel-based consensual aggregation.
result The aggregation scheme performs similarly to using the original high-dimensional features, with high probability.
A new method for faster prediction in distributed Gaussian processes.
problem Inefficient aggregation of distributed Gaussian processes with correlations.
method Proposes a novel approach for aggregated prediction in distributed GPs that incorporates correlations among experts.
result Results in more stable predictions in less time compared to state-of-the-art methods.
Paper tightens statistical aggregation results using local complexity.
problem Combining predictors to achieve nearly optimal predictions.
method Replacing global complexity with local complexity, using PAC-Bayes localization.
result Localized versions of classical aggregation bounds proven, improving previous results.
Partial fusion combines neural networks to balance accuracy and efficiency.
problem Balancing accuracy and computational cost in neural networks.
method Extending weight aggregation methods based on neuron-level similarity, using partial optimal transport to match similar neurons.
result Achieves a flexible tradeoff between computational cost and performance.
A winning method for day-ahead electricity demand forecasting during and after the COVID-19 pandemic.
problem Day-ahead electricity demand forecasting during and after the COVID-19 pandemic.
method Online forecast combination of multiple point prediction models with a holiday adjustment procedure and smoothed Bernstein Online Aggregation (BOA).
result Excellent forecasting performance, particularly due to the holiday adjustment procedure and fully adaptive smoothed BOA approach.
We use online convex optimization (OCO) for setpoint tracking with uncertain, flexible loads. We consider full feedback from the loads, bandit feedback, and two intermediate types of feedback: partial bandit where a subset of the loads are individually observed and the rest are observed in aggregate, and Bernoulli feed…
Data aggregation improves HAC for resource-constrained systems.
problem Resource constraints in embedded systems limit HAC's applicability.
method Data aggregation with BETULA algorithm reduces memory and runtime requirements.
result HAC can be applied to large datasets on resource-constrained systems.
This work improves multi-modal generative models by using permutation-invariant neural networks.
problem Improving multi-modal generative models with tighter variational objectives.
method Developed more flexible aggregation schemes based on permutation-invariant neural networks.
result Our variational objective and flexible aggregation models can better approximate the true joint distribution.
New model improves inference on asset market durations.
problem Statistical artifacts in trade aggregation.
method Flexible stochastic duration model with uncertainty in related trades.
result Conditional hazard function varies less than previous studies.
The ability to adequately model risks is crucial for insurance companies. The method of "Copula-based hierarchical risk aggregation" by Arbenz et al. offers a flexible way in doing so and has attracted much attention recently. We briefly introduce the aggregation tree model as well as the sampling algorithm proposed by…
Optimal transport aggregation combines distributed MoE models efficiently.
problem Combining local MoE models trained on distributed datasets.
method Optimal transport for minimizing divergence between local and global estimators, with MM algorithm for optimization.
result Aggregated estimator achieves performance comparable to centralized training but with reduced computation time.
We improve prediction set coverage by assigning weights to individual sets.
problem Aggregating multiple prediction sets weakens overall coverage guarantee.
method Propose a framework for weighted aggregation of prediction sets.
result Achieve tighter coverage bounds that interpolate between 1−2α and 1−α guarantees. 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…
Flexible Hawkes model with Gaussian process self-effects for time-dependent data.
problem Modeling time-dependent point processes with history dependence and self-effects.
method Extended Hawkes process with Gaussian process self-effects for both excitatory and inhibitory types, using Bayesian inference and mean-field variational approximation.
result Efficient approximate Bayesian inference achieved via data augmentation and mean-field variational approach.
Unified approach for federated learning using MM optimization.
problem Scaling stochastic optimization to federated learning.
method Unified Majorize-Minimize (MM) framework for stochastic optimization, extended to federated learning.
result Unified algorithm \QSMM\ for federated learning that aggregates surrogate majorizing functions.
GraLSP improves graph neural networks by incorporating local structural patterns.
problem GNNs struggle with identifying common structural patterns in graphs.
method GraLSP uses random anonymous walks to capture local graph structures and incorporates these into feature aggregation mechanisms.
result GraLSP outperforms other models in various prediction tasks on multiple datasets.
How can we estimate the importance of nodes in a knowledge graph (KG)? A KG is a multi-relational graph that has proven valuable for many tasks including question answering and semantic search. In this paper, we present GENI, a method for tackling the problem of estimating node importance in KGs, which enables several …
Graph Convolution Networks (GCNs) are becoming more and more popular for learning node representations on graphs. Though there exist various developments on sampling and aggregation to accelerate the training process and improve the performances, limited works focus on dealing with the dimensional information imbalance…
Deep learning has shown its great promise in various biomedical image segmentation tasks. Existing models are typically based on U-Net and rely on an encoder-decoder architecture with stacked local operators to aggregate long-range information gradually. However, only using the local operators limits the efficiency and…
The financial crisis has dramatically demonstrated that the traditional approach to apply univariate monetary risk measures to single institutions does not capture sufficiently the perilous systemic risk that is generated by the interconnectedness of the system entities and the corresponding contagion effects. This has…
Learning nonlinear dynamics from diffusion data is a challenging problem since the individuals observed may be different at different time points, generally following an aggregate behaviour. Existing work cannot handle the tasks well since they model such dynamics either directly on observations or enforce the availabi…
A new method for distributed PCA using matrix β-mean.
problem Efficiently aggregating PCA results across multiple machines with reduced computational overhead.
method Proposes a novel DPCA method that incorporates eigenvalue information using the matrix β-mean.
result The matrix β-mean method improves robustness and stability of eigenvector ordering.
Federated learning improves by training central model with client model outputs.
problem Direct averaging of client models is limited in FL.
method Ensemble distillation for model fusion.
result Central model trained faster with fewer communication rounds.
Federated Learning speeds up speech recognition training by 7x and reduces error rate by 6%.
problem Training acoustic models for speech recognition tasks in a federated manner.
method Hierarchical optimization and dynamic gradient aggregation methods.
result Significant improvement in training convergence speed and model performance.
A new method reduces complexity in estimating dynamic choice models.
problem Estimating structural parameters in dynamic discrete choice models using behavioral data.
method Two-stage approach: inverse reinforcement learning for Q-function estimation, state selection via clustering, and maximum likelihood estimation with nested fixed-point algorithm.
result The method mitigates the curse of dimensionality and provides finite-sample bounds on estimation error.
SimFBO simplifies FBO, making it more efficient and flexible.
problem Complex nested optimization in machine learning and edge computing.
method Proposes SimFBO, a simple and flexible FBO framework with improved communication efficiency.
result SimFBO and ShroFBO achieve linear convergence speedup and improved sample and communication complexities.
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.
Paper offers a simpler solution for managing complex financial options.
problem Managing a large number of financial assets with diverse dynamics.
method Developed a simple analytical approximation for market making.
result Shows significant flexibility over existing market making strategies.
Paper tackles federated learning with personalised bandit algorithms.
problem Optimizing local and global objectives in a heterogeneous environment.
method Surrogate objective function combining client preferences and global knowledge; phase-based elimination algorithm.
result Achieves sublinear regret with logarithmic communication overhead.
Improves quantile regression models by aggregating multiple models.
problem Quantifying uncertainty and modeling diverse populations in predictions.
method Flexible model aggregation using weighted ensembles and modern deep learning.
result Improves accuracy and robustness of quantile predictions.
PEARL combines multiple representation learning methods to enhance model performance.
problem Different representation learning methods extract distinct data aspects, potentially missing important insights.
method Combines multiple representation learning approaches using surrogate loss functions for efficient weight estimation.
result Asymptotically achieves optimal performance in downstream tasks, assigning nonzero weights to correctly specified models.
We develop the setting of sequential prediction based on shifting experts and on a "smooth" version of the method of specialized experts. To aggregate experts predictions, we use the AdaHedge algorithm, which is a version of the Hedge algorithm with adaptive learning rate, and extend it by the meta-algorithm Fixed Shar…
Copula models for sovereign ratings improved by incorporating climate risk.
problem Modeling nonlinear dependence and clustering in sovereign rating migrations.
method Mixed-difference transformation, MAGMAR(1,1) copula process, consistent and asymptotically normal estimators.
result Gumbel MAGMAR(1,1) specification outperforms other models in empirical performance.
PTBCC improves accuracy in multi-class annotation aggregation by learning from prototype confusion matrices.
problem Inaccurate and insufficient confusion matrices for annotators in multi-class classification tasks.
method PTBCC (ProtoType learning-driven Bayesian Classifier Combination) uses prototype confusion matrices to capture annotator expertise.
result PTBCC achieves up to 15% accuracy improvement and 3% higher average accuracy compared to existing methods.
Variational Auto-encoders (VAEs) have been very successful as methods for forming compressed latent representations of complex, often high-dimensional, data. In this paper, we derive an alternative variational lower bound from the one common in VAEs, which aims to minimize aggregate information loss. Using our lower bo…
We propose learning flexible but interpretable functions that aggregate a variable-length set of permutation-invariant feature vectors to predict a label. We use a deep lattice network model so we can architect the model structure to enhance interpretability, and add monotonicity constraints between inputs-and-outputs.…
Recent studies have shown that the aggregated dynamic flexibility of an ensemble of thermostatic loads can be modeled in the form of a virtual battery. The existing methods for computing the virtual battery parameters require the knowledge of the first-principle models and parameter values of the loads in the ensemble.…
New method converts p-values to e-values for more efficient CP and aggregation.
problem Limitations of existing p-to-e calibrators in CP setting.
method Proposes a novel P2E calibrator for set-preserving calibration.
result Significant efficiency gains over existing p-to-e calibrators.
Graph edges, along with their labels, can represent information of fundamental importance, such as links between web pages, friendship between users, the rating given by users to other users or items, and much more. We introduce LEAP, a trainable, general framework for predicting the presence and properties of edges on…
We propose dynamical systems trees (DSTs) as a flexible class of models for describing multiple processes that interact via a hierarchy of aggregating parent chains. DSTs extend Kalman filters, hidden Markov models and nonlinear dynamical systems to an interactive group scenario. Various individual processes interact a…
flexBART improves BART for categorical predictors by creating flexible tree partitions.
problem Limitation of BART in handling categorical predictors with one-hot encoding.
method flexBART re-implements BART with regression trees that can assign multiple levels to both branches of a decision tree node, and proposes a new decision rule prior for spatial data.
result flexBART often yields improved predictive performance and scales better to larger datasets than existing BART implementations.
Study counterfactuals in combinatorial choice using a representative agent model.
problem Analyzing decision-making from aggregated binary polytope data.
method Nonparametric approach based on a representative agent model, solving polynomial and mixed-integer convex programs.
result Developed a method for counterfactual prediction that works even under model misspecification.
Masked LARk prevents cross-site tracking while training models.
problem Cross-site tracking of user data through third-party cookies.
method Secure multi-party compute (MPC) protocol with masking.
result Prevents cross-site tracking and maintains model training flexibility.