Research
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

105211316421 · Jun 202019922001200920172026
48 results for Aggregation Techniques

Proposes a method for private aggregation in heterogeneous federated learning.

problem Ensuring resilience to Byzantine clients and maintaining client data privacy in federated learning with heterogeneous data.
method Careful co-design of verifiable secret sharing, secure aggregation, and private information retrieval scheme.
result Achieves information-theoretic privacy guarantees and Byzantine resilience under data heterogeneity.

Turbo-Aggregate reduces secure aggregation time from quadratic to nearly linear.

problem Quadratic overhead in secure model aggregation for federated learning.
method Multi-group circular strategy, additive secret sharing, and coding techniques.
result Achieves O(NlogN)O(N\log{N}) overhead, compared to O(N2)O(N^2), for up to 50% user dropout.

Using Monte Carlo simulation to calculate the Value at Risk (VaR) as a possible risk measure requires adequate techniques. One of these techniques is the application of a compound distribution for the aggregates in a portfolio. In this paper, we consider the aggregated loss of Gamma distributed severities and estimate …

2017-02-14abs ↗pdf ↗

The paper evaluates various forecasting methods for inflation, finding ML models superior.

problem Forecasting inflation using disaggregated data and machine learning.
method Examines traditional and machine learning models, including random forest, for disaggregated and aggregated inflation forecasts.
result Aggregating disaggregated forecasts performs similarly to survey-based expectations and aggregate models.

This paper explores methods for combining predictions in multilabel classification.

problem Lack of formal framework for aggregation in multilabel ensembles.
method Introduces two approaches: 'predict then combine' (PTC) and 'combine then predict' (CTP).
result Standard voting techniques are outperformed by tailored instantiations of CTP and PTC.

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.

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.

We propose three new robust aggregation rules for distributed synchronous Stochastic Gradient Descent~(SGD) under a general Byzantine failure model. The attackers can arbitrarily manipulate the data transferred between the servers and the workers in the parameter server~(PS) architecture. We prove the Byzantine resilie…

2018-02-27abs ↗pdf ↗

U-aggregation combines multiple models without labels for better risk prediction.

problem Challenges in selecting best model for new populations due to limited data and lack of true labels.
method U-aggregation, an unsupervised model aggregation method that integrates pre-trained models without observed labels.
result U-aggregation improves genetic risk prediction of complex traits using publicly available models.

The paper quantifies uncertainty in aggregated machine learning metrics.

problem Uncertainty in summarizing model performance across multiple tasks.
method Statistical methodologies including bootstrapping and Bayesian modeling.
result Insights into model performance dominance for specific tasks.

We propose a novel robust aggregation rule for distributed synchronous Stochastic Gradient Descent~(SGD) under a general Byzantine failure model. The attackers can arbitrarily manipulate the data transferred between the servers and the workers in the parameter server~(PS) architecture. We prove the Byzantine resilience…

2018-05-23abs ↗pdf ↗

Study online learning in MDPs with aggregate bandit feedback, achieving low regret in both stochastic and adversarial settings.

problem Online learning in finite-horizon episodic MDPs with aggregate bandit feedback.
method Best-of-both-worlds (BOBW) algorithms using FTRL over occupancy measures, self-bounding techniques, and new loss estimators.
result First BOBW algorithms for episodic tabular MDPs with aggregate bandit feedback achieving O(logT)O(\log T) regret in stochastic and O(T){O}(\sqrt{T}) regret in adversarial settings.

We develop a secure aggregation protocol for federated learning that reduces communication and computation costs.

problem Expensive communication and privacy concerns in federated learning.
method Adapting compression-based federated techniques to additive secret sharing.
result Our protocol achieves high accuracy with low communication costs and is more efficient than prior work.

New methods reduce private federated learning communication automatically.

problem Reducing communication in private federated learning.
method Automatic compression rate adjustment based on training error, using secure aggregation and differential privacy.
result Provable instance-optimal for mean estimation, achieving favorable compression rates.

New method improves forecast accuracy using CRPS for probabilistic predictions.

problem Improving forecast accuracy for probabilistic predictions, especially in the tails of distributions.
method Introduces a new weighting method for pointwise CRPS learning, optimizing across quantiles.
result Proposed fully adaptive Bernstein online aggregation (BOA) method for pointwise CRPS online learning has optimal convergence properties.

Optimal risk sharing without convex preferences using aggregate convexity.

problem Risk sharing among non-convex preferences.
method Aggregate convexity principles and Lyapunov convexity, combined with approximation arguments for law invariant risk measures.
result Derivation of a computationally tractable formula for the conjugate of the value function.

Stochastic simulation techniques employed for the analysis of portfolios of insurance/reinsurance risk, often referred to as `Aggregate Risk Analysis', can benefit from exploiting state-of-the-art high-performance computing platforms. In this paper, parallel methods to speed-up aggregate risk analysis for supporting re…

2013-08-12abs ↗pdf ↗

A new method sorts projects using Quicksort and Bradley-Terry model for uncertain long-term benefits.

problem Selecting projects with uncertain long-term benefits.
method Combining Quicksort and Bradley-Terry model for ranking projects based on uncertain long-term benefits.
result Proposed methods outperform existing aggregation methods and can be combined with sampling techniques.

Paper introduces WWAggr for ensemble CPD, improving accuracy and decision threshold selection.

problem Challenges in detecting abrupt distribution shifts in high-dimensional data streams.
method Introduces WWAggr, a novel task-specific ensemble aggregation method based on Wasserstein distance.
result Demonstrates WWAggr outperforms standard aggregation techniques and decision threshold selection.

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…

2016-05-14abs ↗pdf ↗

UTOPIA aggregates multiple prediction intervals efficiently.

problem Constructing optimal prediction intervals for various real-world data problems.
method UTOPIA is a universally trainable strategy using linear or convex programming.
result UTOPIA constructs prediction intervals with small average width and high coverage probability.

In many applications, the training data for a machine learning task is partitioned across multiple nodes, and aggregating this data may be infeasible due to communication, privacy, or storage constraints. Existing distributed optimization methods for learning global models in these settings typically aggregate local up…

2018-05-20abs ↗pdf ↗

Proposes a new risk model using stable laws to manage company-wide losses.

problem Managing aggregate risks and pricing policies in the presence of systematic risk.
method Develops a modified risk model using multivariate stable distributions to account for various risk phenomena.
result Computes the Tail Conditional Expectation of aggregate risks and corresponding allocations.

Improved sales forecasting at various levels using ensemble methods.

problem Enhancing sales forecasting accuracy at different levels of e-commerce data.
method Hierarchical robust aggregation of sales forecasts using exponential smoothing and Holt's linear trend method.
result Better forecasts at subsubfamily, subfamily, and family levels compared to individual techniques.

Study benchmarks label noise detection methods, identifying best practices.

problem Label noise in real-world datasets affects model performance and evaluation reliability.
method Decomposed detection methods into label agreement, aggregation, and information gathering components; introduced a unified benchmark task and novel metric.
result In-sample probability aggregation with logit margin label agreement function achieves best results across scenarios.

A new framework for neural network classification using vector quantization.

problem Learning a neural network classifier under the IB principle.
method Aggregated Learning framework, combining vector quantization and variational techniques.
result The effectiveness of Aggregated Learning verified through experiments.