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,786 papers · 148 categories

Trend · papers per month

51102152203 · May 202619922001200920172026
48 results for global aggregation

Paper presents a novel approach for global feature aggregation in Graph Neural Networks.

problem Graphs lack a straightforward way to perform non-local feature aggregation like images and texts.
method Utilizes Latent Fixed Data Structure (LFDS) to aggregate feature vectors from local extraction.
result Proposed methods achieve competitive or better results with linear computational complexity.

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.

Improved local explainer aggregation for interpretable machine learning models.

problem Improving the interpretability of black box machine learning models.
method Non-convex optimization and integer optimization framework for local explainer aggregation.
result Our method outperforms existing methods in terms of coverage and fidelity, particularly in multi-class settings.

NormLIME improves feature importance explanations for deep neural networks.

problem Improving local feature explanations for deep learning models.
method NormLIME aggregates local models into global and class-specific interpretations.
result NormLIME outperforms other feature importance metrics in human user studies and numerical experiments.

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.

Aggregates models from different datasets using shared latent structures.

problem Aggregating models from heterogeneous datasets with shared latent structures.
method Bayesian nonparametrics for identifying correspondences among local model parameterizations.
result Framework successfully aggregates various model types across different applications.

Federated learning is protected against adversarial attacks with residual-based reweighting.

problem Adversarial attacks on federated learning's aggregation process.
method Residual-based reweighting combined with iteratively reweighted least squares.
result Our aggregation algorithm outperforms other methods in label-flipping and backdoor attacks.

Global pooling, such as max- or sum-pooling, is one of the key ingredients in deep neural networks used for processing images, texts, graphs and other types of structured data. Based on the recent DeepSets architecture proposed by Zaheer et al. (NIPS 2017), we introduce a Set Aggregation Network (SAN) as an alternative…

2018-10-03abs ↗pdf ↗

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 ↗

One-round FL method improves robustness and reduces communication rounds.

problem Making predictions robust and reducing FL communication rounds in heterogeneous data.
method Bayesian predictive space aggregation of client posteriors in one round.
result One-round FL method outperforms other techniques on heterogeneous settings.

Study uses echo-sounder buoys to analyze tuna schools' association with dFADs globally.

problem Understanding temporal trends of tuna schools' association to drifting objects.
method Applied Machine Learning to examine binary and regression outputs of tuna schools' colonization and disaggregation times.
result Median colonization and disaggregation times varied by ocean, with Pacific having longest soak and colonization times.

Current approaches for explaining machine learning models fall into two distinct classes: antecedent event influence and value attribution. The former leverages training instances to describe how much influence a training point exerts on a test point, while the latter attempts to attribute value to the features most pe…

2019-01-20abs ↗pdf ↗

While a typical supervised learning framework assumes that the inputs and the outputs are measured at the same levels of granularity, many applications, including global mapping of disease, only have access to outputs at a much coarser level than that of the inputs. Aggregation of outputs makes generalization to new in…

2018-05-22abs ↗pdf ↗

Study shows safely discarding features based on aggregate SHAP values is sound.

problem Discarding features based on aggregate SHAP values without proper justification.
method Investigated the soundness of discarding features based on aggregate SHAP values, proposing to aggregate SHAP values over the extended support.
result A small aggregate SHAP value implies safely discarding the corresponding feature.

A new federated learning method clusters users into multiple models for better data distribution handling.

problem Non-IID data from heterogeneous sources in federated learning.
method Proposes a multi-center aggregation mechanism to learn multiple global models and optimally match users to centers.
result Our method outperforms existing federated learning methods on benchmark datasets.

Secure federated learning framework resists adversarial users.

problem Resilience against adversarial (Byzantine) users in federated learning.
method Integrated stochastic quantization, verifiable outlier detection, and secure model aggregation.
result First single-server Byzantine-resilient secure aggregation framework (BREA) for secure federated learning.

A note on learning with agents having global perspectives and a principal optimizing their performance.

problem Learning with dynamic-optimizing principal-agent setting, where agents have global views and the principal optimizes performance.
method Empirical-likelihood estimator under conditional moment restrictions model, considering agents' out-of-sample and private dataset performances.
result A coherent mathematical argument for the learning process in this framework.

We present one-shot federated learning, where a central server learns a global model over a network of federated devices in a single round of communication. Our approach - drawing on ensemble learning and knowledge aggregation - achieves an average relative gain of 51.5% in AUC over local baselines and comes within 90.…

2019-02-28abs ↗pdf ↗

Improves global counterfactual explanations for model recourse.

problem Inability to provide explanations beyond local instances.
method Investigates and improves Actionable Recourse Summaries (AReS) for global counterfactual explanations.
result Develops more efficient and interactive explainability tools.

Study uses RL to optimize global equity portfolios, finds mixed results.

problem Optimizing dynamic portfolio weights across diverse global markets.
method Deep reinforcement learning with Soft Actor-Critic, incorporating various constraints and reward formulations.
result RL strategies achieve competitive performance, but no strategy consistently outperforms Buy and Hold.

We propose a decentralized learning algorithm over a general social network. The algorithm leaves the training data distributed on the mobile devices while utilizing a peer to peer model aggregation method. The proposed algorithm allows agents with local data to learn a shared model explaining the global training data …

2019-05-24abs ↗pdf ↗

We investigate the community structure of the global ownership network of transnational corporations. We find a pronounced organization in communities that cannot be explained by randomness. Despite the global character of this network, communities reflect first of all the geographical location of firms, while the indu…

2013-01-11abs ↗pdf ↗

Rank aggregation systems collect ordinal preferences from individuals to produce a global ranking that represents the social preference. Rank-breaking is a common practice to reduce the computational complexity of learning the global ranking. The individual preferences are broken into pairwise comparisons and applied t…

2016-01-21abs ↗pdf ↗

FedCONST adapts update magnitudes to enhance feature generalization in FL.

problem Heterogeneous client data in FL leads to overfitting and distorted transferable features.
method FedCONST uses linear convex constraints to stabilize training and preserve generalization.
result FedCONST enhances feature transferability and robustness, achieving state-of-the-art performance.

Local adaptive methods in FL can accelerate convergence but introduce bias, which is corrected.

problem The effect of using adaptive optimization methods for local updates in federated learning.
method Proposed correction techniques to overcome the bias introduced by local adaptive methods.
result Correction techniques can achieve faster convergence and higher test accuracy than baseline methods.

A framework for federated adversarial learning with convergence analysis.

problem Unique vulnerabilities to adversarial attacks in federated learning.
method Formulates a general federated adversarial learning framework with inner and outer loops for client-side adversarial training and server-side model aggregation.
result The minimum loss under the proposed algorithm can converge to ε with chosen learning rate and communication rounds.

We consider the problem of analyzing the heterogeneity of clustering distributions for multiple groups of observed data, each of which is indexed by a covariate value, and inferring global clusters arising from observations aggregated over the covariate domain. We propose a novel Bayesian nonparametric method reposing …

2010-01-04abs ↗pdf ↗

The stringent requirements for low-latency and privacy of the emerging high-stake applications with intelligent devices such as drones and smart vehicles make the cloud computing inapplicable in these scenarios. Instead, edge machine learning becomes increasingly attractive for performing training and inference directl…

2018-12-31abs ↗pdf ↗

New method aggregates Gaussian experts by detecting conditional independence violations.

problem Aggregation of dependent Gaussian experts leads to sub-optimal solutions.
method Uses Gaussian graphical model to detect and correct conditional independence violations.
result Improves aggregation of Gaussian experts, outperforming SOTA DGP approaches.

Financial models are studied where each asset may potentially lose value relative to any other. Conditioning on non-devaluation, each asset can serve as proper numéraire and classical valuation rules can be formulated. It is shown when and how these local valuation rules can be aggregated to obtain global arbitrage-fre…

2015-11-13abs ↗pdf ↗

We analyze a fast incremental aggregated gradient method for optimizing nonconvex problems of the form minxifi(x)\min_x \sum_i f_i(x). Specifically, we analyze the SAGA algorithm within an Incremental First-order Oracle framework, and show that it converges to a stationary point provably faster than both gradient descent and s…

2016-03-19abs ↗pdf ↗

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.

New method ranks sectors and countries using local and aggregate I-O data.

problem Ranking sectors and countries in global value chains using incomplete I-O tables.
method Rank-11 approximation to I-O tables using local and aggregate information.
result Consistently good performance in reconstructing rankings of upstreamness and downstreamness.

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 finds conditions for global minimizers on curved manifolds with fast diffusion and nonlocal interactions.

problem Existence of global minimizers for a free energy functional on negatively curved manifolds.
method Investigation of Carlson-Levin type inequalities for Cartan-Hadamard manifolds.
result Establishes necessary and sufficient conditions for the existence of global energy minimizers.