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

Trend · papers per month

306090120 · Jun 202019922001200920172026
48 results for Partial Participation

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.

Artemis framework improves distributed learning with bidirectional compression and partial participation.

problem Learning in distributed or federated settings with communication constraints and device partial participation.
method Artemis framework using bidirectional compression, memory mechanism, and Polyak-Ruppert averaging.
result Fast rates of convergence (linear up to a threshold) under weak assumptions on stochastic gradients.

FedAvg converges linearly to global minimum in federated learning with partial participation.

problem Challenges in federated learning with partial client participation.
method Federated averaging (FedAvg) method for over-parameterized neural networks.
result FedAvg converges to global minimum at a linear rate after t iterations.

FedSGM tackles constrained federated learning with unified framework.

problem Functional constraints, communication bottlenecks, local updates, and partial client participation in federated learning.
method Unified framework based on switching gradient method, incorporating bi-directional error feedback, and soft switching for stability.
result Achieves O(1/T)\boldsymbol{\mathcal{O}}(1/\sqrt{T}) convergence rate with high-probability bounds decoupling from sampling noise.

New framework provides privacy guarantees for practical federated learning.

problem Inadequate privacy guarantees for federated learning due to restrictive assumptions.
method Fed-α\alpha-NormEC, integrating multiple local updates, partial client participation, and standard assumptions.
result Provably convergent and differentially private federated learning framework.

This paper analyzes error feedback in compressed federated learning for non-convex optimization problems.

problem Reducing communication cost in federated learning with biased gradient compression.
method Proposes Fed-EF, a compressed federated learning scheme with error feedback, and analyzes its convergence rate and performance under partial client participation.
result Fed-EF can match the convergence rate of full-precision FL under data heterogeneity with a linear speedup and no extra slow-down factor due to stale error compensation.

A new method for efficient online federated learning reduces communication overhead.

problem Real-world limitations in online federated learning, such as heterogeneous client participation and communication delays.
method Proposes a communication-efficient asynchronous online federated learning (PAO-Fed) strategy.
result Achieves the same convergence properties as online federated stochastic gradient while reducing communication overhead by 98 percent.

Paper proposes SCALLION and SCAFCOM for compressed FL with reduced communication.

problem Reducing communication overhead in Federated Learning with data heterogeneity and partial participation.
method Revisit and simplify stochastic controlled averaging, proposing SCALLION and SCAFCOM for unbiased and biased compression.
result SCALLION and SCAFCOM outperform existing methods in communication and computation complexities.

We consider a financial market model with a single risky asset whose price process evolves according to a general jump-diffusion with locally bounded coefficients and where market participants have only access to a partial information flow. For any utility function, we prove that the partial information financial marke…

2013-02-18abs ↗pdf ↗

Unified analysis of Federated Averaging and Nesterov FedAvg for linear speedup.

problem Understanding convergence of FL algorithms under non-i.i.d. data and partial participation.
method Systematic study of convergence guarantees for FedAvg and Nesterov FedAvg under different conditions.
result Unified analysis of linear speedup for FedAvg and Nesterov FedAvg in various settings.

FedAVOT improves federated learning by aligning user distributions.

problem Partial client participation leads to biased and unstable updates in federated learning.
method Formulates aggregation as masked optimal transport to align availability and importance distributions.
result Achieves a standard O(1/√T) rate, independent of the number of participating users per round.

Federated learning enables a large amount of edge computing devices to jointly learn a model without data sharing. As a leading algorithm in this setting, Federated Averaging (\texttt{FedAvg}) runs Stochastic Gradient Descent (SGD) in parallel on a small subset of the total devices and averages the sequences only once …

2019-07-04abs ↗pdf ↗

Proposes SROF for row-wise fusion in federated learning for multivariate responses.

problem Heterogeneous client models with shared variable-level structure.
method Sparse Row-wise Fusion (SROF) regularizer and RowFed algorithm.
result Empirically shows consistent error reduction and stronger variable-level cluster recovery.

New algorithm reduces communication time in federated learning.

problem Intermittent connectivity and non-i.i.d. data slow federated learning convergence.
method Lyapunov optimization for efficient device scheduling.
result Significant reduction in communication time with improved convergence rates.

We propose a new optimization formulation for training federated learning models. The standard formulation has the form of an empirical risk minimization problem constructed to find a single global model trained from the private data stored across all participating devices. In contrast, our formulation seeks an explici…

2020-02-10abs ↗pdf ↗

Optimizes capital structure for life insurance companies with surplus participation.

problem Determining the optimal participation rate in life insurance contracts.
method Adapted Leland's dynamic capital structure model to life insurance context.
result Optimal participation rate is highly sensitive to contract duration and tax rate.

The paper uncovers two key laws of market impact influenced by volume and participation rate.

problem Understanding the roles of volume and participation rate in market price response.
method Extending the no arbitrage approach to include sophisticated market participants, deriving price dynamics from order flow dynamics.
result Recovery of two square root laws governing market impact.

Federated learning (FL) is a heavily promoted approach for training ML models on sensitive data, e.g., text typed by users on their smartphones. FL is expressly designed for training on data that are unbalanced and non-iid across the participants. To ensure privacy and integrity of the fedeated model, latest FL approac…

2020-02-12abs ↗pdf ↗

Federated learning (FL) is a privacy-preserving paradigm for training collective machine learning models with locally stored data from multiple participants. Vertical federated learning (VFL) deals with the case where participants sharing the same sample ID space but having different feature spaces, while label informa…

2020-01-30abs ↗pdf ↗

Oft-cited causes of mini-flash crashes include human errors, endogenous feedback loops, the nature of modern liquidity provision, fundamental value shocks, and market fragmentation. We develop a mathematical model which captures aspects of the first three explanations. Empirical features of recent mini-flash crashes ar…

2017-05-27abs ↗pdf ↗

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.

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.

The purpose of this article is to introduce, analyze and compare two performance participation methods based on a portfolio consisting of two risky assets: Option-Based Performance Participation (OBPP) and Constant Proportion Performance Participation (CPPP). By generalizing the provided guarantee to a participation in…

2013-02-21abs ↗pdf ↗

Extended model ensures long-term survival of traders in limited stock market participation.

problem Limited stock market participation and survival of traders over long periods.
method Extended Basak and Cuoco (1998) model with different time-preference coefficients.
result Parameter restrictions ensure long-term survival of traders.

Data poisoning attacks can severely degrade FL models, especially targeting specific classes.

problem Data poisoning attacks against federated learning systems.
method Demonstrated targeted attacks on FL systems, analyzed attack longevity, and proposed a defense strategy.
result Data poisoning attacks can cause substantial drops in classification accuracy and recall with a small percentage of malicious participants.

In the Pioneer 100 (P100) Wellness Project (Price and others, 2017), multiple types of data are collected on a single set of healthy participants at multiple timepoints in order to characterize and optimize wellness. One way to do this is to identify clusters, or subgroups, among the participants, and then to tailor pe…

2019-01-12abs ↗pdf ↗

Entropy regularization improves sparse model discovery in federated learning.

problem Sparse model discovery in federated learning with limited data.
method Entropy regularization of gate distributions for probabilistic sparse model exploration.
result Entropy regularization leads to better sparse model recovery and performance.

Neuroimaging studies produce gigabytes of spatio-temporal data for a small number of participants and stimuli. Rarely do researchers attempt to model and examine how individual participants vary from each other -- a question that should be addressable even in small samples given the right statistical tools. We propose …

2019-06-21abs ↗pdf ↗

Federated learning leaks participant dataset quality even with secure aggregation.

problem Leakage of participant dataset quality in federated learning with secure aggregation.
method Image recognition experiments to infer and attribute dataset quality.
result Relative quality ordering of participants can be inferred and used for various purposes.

New algorithm achieves linear speedup in non-i.i.d. federated bilevel learning.

problem Linear speedup in convergence for non-i.i.d. datasets in federated bilevel optimization.
method Proposes FedMBO with a novel client sampling scheme for non-i.i.d. datasets.
result Achieves a convergence rate of O(1/√(nK) + 1/K + √n/K³/²).

Mandatory emission trading schemes are being established around the world. Participants of such market schemes are always exposed to risks. This leads to the creation of an accompanying market for emission-linked derivatives. To evaluate the fair prices of such financial products, one needs appropriate models for the e…

2010-01-21abs ↗pdf ↗

A new federated learning framework ensures fairness and robustness.

problem Collaborative fairness and adversarial robustness in federated learning.
method RFFL framework with a reputation mechanism to identify and remove non-contributing or malicious participants.
result RFFL achieves high fairness and robustness to different types of adversaries.

Federated learning enables the creation of a powerful centralized model without compromising data privacy of multiple participants. While successful, it does not incorporate the case where each participant independently designs its own model. Due to intellectual property concerns and heterogeneous nature of tasks and d…

2019-10-08abs ↗pdf ↗

ADRL improves participant selection in MCS systems.

problem Designing a participant selection algorithm for different MCS systems with multiple goals.
method Auxiliary-task based deep reinforcement learning (ADRL) using transformers and pointer networks.
result ADRL outperforms other baselines in various MCS settings.

Study uses ML to predict non-participation in ELSA COVID-19 follow-up studies.

problem Predicting non-participation in follow-up surveys due to various factors.
method Used machine learning algorithms including KNN, RF, AdaBoost, logistic regression, NN, and SVC.
result Random Forest (RF) outperforms other models in balanced accuracy.

This paper addresses privacy in federated learning with wireless clients and base stations.

problem Privacy of clients' data in federated learning with hierarchical wireless architecture.
method Derives communication cost limits and introduces private aggregation schemes tailored for hierarchical wireless systems.
result Private aggregation schemes reduce communication costs by multiplicative factors compared to information-theoretic limits.