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

50100149199 · Jun 202019922001200920172026
48 results for client needs

A simple strategy optimizes broker-client trading, reducing price discounts for informed traders.

problem Optimizing broker-client trading to balance client flow and informed trader losses.
method Modelled as a stochastic control problem, derived optimal strategy in closed form, introduced algorithm.
result Optimal strategy reduces price discounts for informed traders, balancing client flow and informed trader losses.

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.

Locally adaptive federated learning improves convergence in distributed machine learning.

problem Balancing local updates in federated learning leads to slow convergence.
method Locally adaptive federated learning algorithms that use uncoordinated stepsizes based on local geometric information.
result Locally adaptive methods can be particularly efficient in overparameterized settings and outperform standard federated algorithms.

New method improves FL efficiency by shuffling data, balancing privacy and accuracy.

problem Balancing privacy, communication, and accuracy in federated learning.
method Developed communication-efficient schemes for private mean estimation, combining privacy amplification and shuffled data.
result Achieved same privacy, optimization performance with lower communication cost.

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.

Federated learning framework improves model generalization and privacy.

problem Communication overhead and statistical heterogeneity in FL.
method Prototypes and lightweight adapters for local model refinement.
result Improves classification accuracy over baseline algorithms.

Secure submodel learning protects privacy in federated learning.

problem Efficiency and privacy in federated learning for resource-constrained clients.
method Designing a secure federated submodel learning scheme with randomized response, secure aggregation, and Bloom filter.
result Demonstrated the feasibility and scalability of the scheme with practical evaluations.

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.

Federated Learning prioritizes client data contributions for better model quality.

problem Privacy concerns and reluctance to share private data in machine learning.
method Prioritizes client data contributions in Federated Learning by assigning scores based on defined criteria.
result The proposed approach yields a higher quality global model compared to standard Federated Learning.

Paper tackles unknown participation in FL, proposing FedAU for better performance.

problem Unknown participation statistics in federated learning impact performance.
method Adapting aggregation weights in FedAvg based on participation history.
result FedAU converges to optimal solution and has desirable properties.

Bank behaviour is important for pricing XVA because it links different counterparties and thus breaks the usual XVA pricing assumption of counterparty independence. Consider a typical case of a bank hedging a client trade via a CCP. On client default the hedge (effects) will be removed (rebalanced). On the other hand, …

2018-03-09abs ↗pdf ↗

Bayesian approach reduces FL communication cost by one-shot.

problem High communication cost in optimization-based FL for high-dimensional models.
method Bayesian pseudocoresets and function-space inference for one-shot FL.
result Achieves prediction performance competitive to state-of-the-art with up to 2 orders of magnitude reduction in communication cost.

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.

A machine learning environment for detecting autonomous vehicle corner cases.

problem Testing autonomous driving software in the real world is difficult.
method Connecting CARLA simulation software to TensorFlow and custom AI client software.
result The system can identify situations where AI software fails to understand the scenario.

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.

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.

Active Federated Learning selects clients to maximize efficiency.

problem Minimizing bandwidth usage and maximizing model accuracy in federated learning.
method Clients are selected with a probability conditioned on the current model and client data to maximize efficiency.
result Reduces the number of required training iterations by 20-70% while maintaining the same model accuracy.

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.

This work detects anomalous clients in federated learning to prevent their adverse impacts.

problem Detecting and preventing anomalous client behaviors in federated learning systems.
method Generates low-dimensional surrogates of model weight vectors and uses them for anomaly detection.
result The proposed detection-based approach significantly outperforms conventional defense-based methods.

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 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.

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.

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.

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.

A new framework for federated continual learning reduces interference and improves performance.

problem Learning from a sequence of tasks with limited data from each client.
method Federated Weighted Inter-client Transfer (FedWeIT) framework.
result FedWeIT significantly outperforms existing methods with reduced communication cost.

This paper reviews statistical and machine learning methods for anti-money laundering.

problem Lack of scientific literature on statistical and machine learning methods for anti-money laundering.
method Client risk profiling and suspicious behavior flagging.
result Client risk profiling involves diagnostics, while suspicious behavior flagging involves non-disclosed features and hand-crafted risk indices.

New method for semi-supervised learning in federated learning with and without labels at clients.

problem Training federated learning models with partially or completely unlabeled data.
method Federated Matching (FedMatch) with inter-client consistency loss and disjoint learning.
result FedMatch outperforms local semi-supervised learning and naive federated learning combinations.