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

Trend · papers per month

53105158210 · Jun 202019922001200920172026
48 results for client size

This paper analyzes and improves convergence in federated learning with biased client selection.

problem Analyzing convergence in federated learning with biased client selection.
method First convergence analysis of federated optimization for biased client selection strategies, proposing Power-of-Choice framework.
result Power-of-Choice strategies converge up to 3 times faster and give 10% higher test accuracy than random selection.

pFedGP uses Gaussian processes for personalized federated learning with improved kernel learning.

problem Learning personalized models across clients with limited data.
method pFedGP uses Gaussian processes with deep kernel learning, including a shared neural network kernel and inducing points.
result pFedGP achieves well-calibrated predictions and significantly outperforms baseline methods.

Federated learning supports exact support recovery with minimal communication.

problem Learning the exact support of sparse linear regression in federated learning.
method One-shot communication algorithm for exact support recovery without optimization.
result Polynomial sample complexity and logarithmic number of clients required.

This paper develops a federated approach to learn Granger causality in interdependent industrial clients.

problem Detecting and quantifying interdependencies in large, complex industrial data.
method Linear state space system framework, federated learning, differential privacy.
result Federated Granger causality learning addresses bandwidth and computational limitations.

Boosting-inspired framework for federated learning with progressive model personalization.

problem Statistical heterogeneity across clients in federated learning.
method Construct an ensemble of personalized models, progressively increasing the depth of the personalized component while controlling its effective complexity.
result Consistently outperforms state-of-the-art PFL methods under heterogeneous data distributions.

Decentralized learning achieves centralized performance via Gibbs measures.

problem Achieving centralized performance in decentralized machine learning.
method ERM-RER learning framework with Gibbs measures and relative-entropy regularization.
result Achieving centralized performance with Gibbs measures and specific scaling of regularization factors.

SPIRE enables efficient federated learning for diffusion models by separating client-specific embeddings from a shared backbone.

problem Large diffusion models are impractical for federated learning due to their size.
method SPIRE separates the network into a global backbone and client-specific embeddings, enabling efficient finetuning.
result SPIRE achieves parameter-efficient finetuning, updating only a small fraction of weights.

Optimal privacy and accuracy in distributed mean estimation with compression.

problem Achieving optimal accuracy under privacy and communication constraints.
method Compression to reduce communication while maintaining privacy and accuracy.
result Achieves optimal error with significantly reduced communication.

Clust-PSI-PFL uses PSI to improve accuracy and fairness in federated learning.

problem Non-IID data biases federated learning performance.
method Clust-PSI-PFL uses clustering and PSI to form homogeneous groups of clients.
result Clust-PSI-PFL delivers up to 18% higher global accuracy and improves client fairness.

New bounds on learning shared representations improve model performance and efficiency.

problem Improving model performance and efficiency through shared representations across clients.
method Established new upper and lower bounds on statistical error, designed a spectral estimator for non-convex least-squares solutions.
result Optimal statistical rate achieved when shared representation is well covered across clients.

FedDuA adapts global learning rate for federated learning.

problem Slow convergence in federated learning due to dataset and parameter space heterogeneity.
method FedDuA uses mirror descent to adaptively select global learning rate based on inter-client and coordinate-wise heterogeneity.
result FedDuA achieves minimax optimal convergence for convex objectives and outperforms baselines in various settings.

Unfair stock trading strategies have been shown to be one of the most negative perceptions that customers can have concerning trading and may result in long-term losses for a company. Investment banks usually place trading orders for multiple clients with the same target assets but different order sizes and diverse req…

2019-12-14abs ↗pdf ↗

Paper analyzes Scaffold algorithm for federated learning, proving linear speed-up with stochastic gradients.

problem Understanding the impact of stochastic gradients on the Scaffold algorithm's performance.
method Proved linear speed-up in the number of clients using a Markov chain analysis of global parameters and control variates.
result Scaffold achieves linear speed-up in the number of clients up to higher-order terms in the step size, but retains a higher-order bias.

Federated learning (FL) allows model training from local data collected by edge/mobile devices while preserving data privacy, which has wide applicability to image and vision applications. A challenge is that client devices in FL usually have much more limited computation and communication resources compared to servers…

2019-09-26abs ↗pdf ↗

Client adaptation improves federated learning performance with non-IID data.

problem Improving model performance in federated learning with non-identically and non-independently distributed data.
method Simulates heterogeneous clients to learn client-specific conditioning using a conditional gated activation unit.
result Client adaptation enhances model performance across balanced and imbalanced data sets from audio and image domains.

FedSTaS stratifies and samples clients for efficient FL.

problem Inefficient client sampling in federated learning.
method Stratifies clients based on compressed gradients, uses Neyman allocation for sampling, and samples local data uniformly.
result FedSTaS achieves higher accuracy than FedSTS in fixed training rounds.

Federated MTL learns personalized models under mixed distributions.

problem Heterogeneity of local data distributions leads to poor global model performance.
method Proposes federated MTL under mixture of distributions, using penalized optimization and federated EM-like algorithms.
result Models with higher accuracy and fairness than state-of-the-art methods.

NAC-FL optimizes model updates in FL systems by adapting compression to network congestion.

problem Federated Learning systems face congestion and delays in data exchanges.
method NAC-FL dynamically adjusts client compression based on network congestion.
result NAC-FL reduces training time and achieves robust performance improvements.

This paper optimizes brokerage contracts for multiple clients trading a single asset.

problem Optimizing brokerage contracts for multiple clients trading a single asset.
method Endogenously determines clients' reservation values and strategically chooses clients. Characterizes optimal portfolios computationally.
result Characterizes optimal portfolios of clients and their profits, showing dependence on price impact coefficients.

We certify federated learning model performance under meta-distribution shifts.

problem Certifying model performance on unseen networks with heterogeneous distributions.
method Derive worst-case uniform guarantees for federated learning model's average loss and risk CDF.
result Asymptotically minimax optimal and privacy-preserving certification.

Personalized federated learning for diverse client objectives.

problem Training a single global model across diverse local datasets is not optimal.
method Efficiently calculates optimal weighted model combinations for each client based on their specific objectives.
result Our method outperforms existing alternatives and enables new personalized features.

With the wealth of information produced by social networks, smartphones, medical or financial applications, speculations have been raised about the sensitivity of such data in terms of users' personal privacy and data security. To address the above issues, Federated Learning (FL) has been recently proposed as a means t…

2019-08-20abs ↗pdf ↗

This paper improves bond market making by adjusting hit-ratios for client flow quality.

problem Economic misleading of raw hit-ratios in corporate bond market making.
method Stochastic-control framework with residual-quality-adjusted hit-ratio.
result Optimal quotes decompose into various components, improving service/economics frontier.

Federated learning is a recent advance in privacy protection. In this context, a trusted curator aggregates parameters optimized in decentralized fashion by multiple clients. The resulting model is then distributed back to all clients, ultimately converging to a joint representative model without explicitly having to s…

2017-12-20abs ↗pdf ↗

FedAMD framework improves federated learning with partial client participation.

problem Data heterogeneity and inactive client updates in partial client participation.
method Anchor sampling divides clients into anchor and miner groups, using large and small batches respectively.
result FedAMD achieves faster convergence and improved model performance compared to state-of-the-art methods.

Federated Learning allows for population level models to be trained without centralizing client data by transmitting the global model to clients, calculating gradients locally, then averaging the gradients. Downloading models and uploading gradients uses the client's bandwidth, so minimizing these transmission costs is…

2019-09-27abs ↗pdf ↗

Federated framework learns causal states to predict counterfactuals without centralizing data.

problem Decentralized counterfactual reasoning in coupled industrial systems with private data.
method Federated causal representation learning in state-space systems.
result Proves convergence to centralized oracle and provides privacy guarantees.

Unified Bayesian framework for clustered federated learning improves model performance.

problem Handling non-IID client data in federated learning.
method A unified Bayesian framework for clustered federated learning that associates clients to clusters and proposes practical algorithms for data associations.
result The proposed framework increases model performance by circumventing the need for unique client-cluster associations.

A novel hierarchical Bayesian approach to Federated Learning reduces data exposure and improves convergence rates.

problem Data privacy and convergence in Federated Learning.
method Hierarchical Bayesian modeling and block-coordinate descent optimization.
result The proposed algorithm converges to an optimal solution with a rate of O(1/t)O(1/\sqrt{t}) and guarantees vanishing generalization error.

FLowDUP trains personalized models with unlabeled clients in low dimensions.

problem Training personalized models on clients with only unlabeled data.
method FLowDUP uses a forward pass with unlabeled data and a transductive PAC-Bayesian bound to generate personalized models in a low-dimensional subspace.
result FLowDUP enables efficient communication and computation with personalized models generated from unlabeled data.

Federated learning algorithm improves with intermittent client availability.

problem Performance degradation in Federated Averaging due to client availability changes.
method Federated Latest Averaging (FedLaAvg) uses latest gradients from all clients, even when unavailable.
result FedLaAvg achieves sublinear speedup compared to classical Federated Averaging.

DFedAvgM is a decentralized FedAvg with momentum for privacy and communication efficiency.

problem Efficiently train models with privacy and communication efficiency in federated learning.
method Decentralized Federated Averaging with Momentum (DFedAvgM) on clients connected by an undirected graph, using stochastic gradient descent with momentum and quantization.
result DFedAvgM converges under trivial assumptions and can be improved with the PŁ property, numerically verified.

In federated learning systems, clients are autonomous in that their behaviors are not fully governed by the server. Consequently, a client may intentionally or unintentionally deviate from the prescribed course of federated model training, resulting in abnormal behaviors, such as turning into a malicious attacker or a …

2019-10-22abs ↗pdf ↗

Group personalization improves FL performance in heterogeneous client data.

problem Mitigating client drift in federated learning with heterogeneous data.
method Fine-tuning a global FL model over homogeneous groups of clients, then personalizing each group's model.
result The proposed method achieves superior personalization performance compared to other FL approaches.

FedACS uses attention to select clients with similar data for federated learning.

problem Non-IID data and data scarcity in federated learning.
method FedACS integrates an attention mechanism to prioritize clients with similar data distributions.
result FedACS improves federated learning performance by addressing non-IID data and data scarcity.

Study evaluates federated learning for ICU survival prediction using eICU data.

problem Training models on multi-center healthcare data without data sharing.
method Federated Averaging, varying hyper-parameters, analyzing client sizes.
result Optimal performance with a large number of local training epochs and reduced communication costs.

Optimal client sampling reduces communication in federated learning.

problem Efficiently aggregate model updates from distributed clients in federated learning.
method Model weights as an Ornstein-Uhlenbeck process to estimate uncommunicated updates; optimal client sampling strategy.
result Significant reduction in communication with competitive or superior performance.

This paper analyzes deep federated learning for low-dimensional data, revealing intrinsic dimensionality's role in convergence rates.

problem Insufficient investigation of generalization error in heterogeneous federated learning, especially for low-dimensional data.
method Statistical analysis of deep federated regression in a two-stage sampling model.
result Intrinsic dimensionality, characterized by entropic dimension, determines convergence rates for deep learners.