Generalized ADMM in Distributed Learning via Variational Inequality

• URL: http://arxiv.org/abs/2104.12608v1
• Date: Mon, 26 Apr 2021 14:16:14 GMT
• Title: Generalized ADMM in Distributed Learning via Variational Inequality
• Abstract summary: Alternating Direction Method of Multipliers (ADMM) through the concept of consensus variables is a practical algorithm. In this paper, we study the effect of the local data sets of users in the distributed learning of ADMM.
• Score: 7.013072937051018
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Due to the explosion in size and complexity of modern data sets and privacy concerns of data holders, it is increasingly important to be able to solve machine learning problems in distributed manners. The Alternating Direction Method of Multipliers (ADMM) through the concept of consensus variables is a practical algorithm in this context where its diverse variations and its performance have been studied in different application areas. In this paper, we study the effect of the local data sets of users in the distributed learning of ADMM. Our aim is to deploy variational inequality (VI) to attain an unified view of ADMM variations. Through the simulation results, we demonstrate how more general definitions of consensus parameters and introducing the uncertain parameters in distribute approach can help to get the better results in learning processes.

Related papers

• Learning Invariant Modality Representation for Robust Multimodal Learning from a Causal Inference Perspective [6.3310165899037045]
  We propose a causal modality-invariant representation (CmIR) learning framework for robust multimodal learning.<n>CmIR ensures that the learned invariant representations retain stable predictive relationships with labels across different environments.<n>CmIR excels on out-of-distribution data and noisy data, confirming its robustness and generalizability.
  arXiv  Detail & Related papers  (2026-04-20T16:16:36Z)
• Unified modality separation: A vision-language framework for unsupervised domain adaptation [60.8391821117794]
  Unsupervised domain adaptation (UDA) enables models trained on a labeled source domain to handle new unlabeled domains.<n>We propose a unified modality separation framework that accommodates both modality-specific and modality-invariant components.<n>Our methods achieve up to 9% performance gain with 9 times of computational efficiencies.
  arXiv  Detail & Related papers  (2025-08-07T02:51:10Z)
• Diversity as a Reward: Fine-Tuning LLMs on a Mixture of Domain-Undetermined Data [54.3895971080712]
  Fine-tuning large language models (LLMs) using diverse datasets is crucial for enhancing their overall performance across various domains.<n>We propose a new method that gives the LLM a dual identity: an output model to cognitively probe and select data based on diversity reward, as well as an input model to be tuned with the selected data.
  arXiv  Detail & Related papers  (2025-02-05T17:21:01Z)
• Chain-of-Thought Prompting for Demographic Inference with Large Multimodal Models [58.58594658683919]
  Large multimodal models (LMMs) have shown transformative potential across various research tasks. Our findings indicate LMMs possess advantages in zero-shot learning, interpretability, and handling uncurated 'in-the-wild' inputs. We propose a Chain-of-Thought augmented prompting approach, which effectively mitigates the off-target prediction issue.
  arXiv  Detail & Related papers  (2024-05-24T16:26:56Z)
• MDDD: Manifold-based Domain Adaptation with Dynamic Distribution for Non-Deep Transfer Learning in Cross-subject and Cross-session EEG-based Emotion Recognition [11.252832459891566]
  We propose a novel non-deep transfer learning method, termed as Manifold-based Domain adaptation with Dynamic Distribution (MDDD) The experimental results indicate that MDDD outperforms traditional non-deep learning methods, achieving an average improvement of 3.54%. This suggests that MDDD could be a promising method for enhancing the utility and applicability of aBCIs in real-world scenarios.
  arXiv  Detail & Related papers  (2024-04-24T03:08:25Z)
• A robust assessment for invariant representations [10.949263264442349]
  We propose a novel method to evaluate invariant performance, specifically tailored for IRM-based methods. We establish a bridge between the conditional expectation of an invariant predictor across different environments through the likelihood ratio. Our proposed criterion offers a robust basis for evaluating invariant performance.
  arXiv  Detail & Related papers  (2024-04-07T20:05:49Z)
• Counterfactual Fairness through Transforming Data Orthogonal to Bias [7.109458605736819]
  We propose a novel data pre-processing algorithm, Orthogonal to Bias (OB) OB is designed to eliminate the influence of a group of continuous sensitive variables, thus promoting counterfactual fairness in machine learning applications. OB is model-agnostic, making it applicable to a wide range of machine learning models and tasks.
  arXiv  Detail & Related papers  (2024-03-26T16:40:08Z)
• MLNet: Mutual Learning Network with Neighborhood Invariance for Universal Domain Adaptation [70.62860473259444]
  Universal domain adaptation (UniDA) is a practical but challenging problem. Existing UniDA methods may suffer from the problems of overlooking intra-domain variations in the target domain. We propose a novel Mutual Learning Network (MLNet) with neighborhood invariance for UniDA.
  arXiv  Detail & Related papers  (2023-12-13T03:17:34Z)
• Meta-Causal Feature Learning for Out-of-Distribution Generalization [71.38239243414091]
  This paper presents a balanced meta-causal learner (BMCL), which includes a balanced task generation module (BTG) and a meta-causal feature learning module (MCFL) BMCL effectively identifies the class-invariant visual regions for classification and may serve as a general framework to improve the performance of the state-of-the-art methods.
  arXiv  Detail & Related papers  (2022-08-22T09:07:02Z)
• Provable Generalization of Overparameterized Meta-learning Trained with SGD [62.892930625034374]
  We study the generalization of a widely used meta-learning approach, Model-Agnostic Meta-Learning (MAML) We provide both upper and lower bounds for the excess risk of MAML, which captures how SGD dynamics affect these generalization bounds. Our theoretical findings are further validated by experiments.
  arXiv  Detail & Related papers  (2022-06-18T07:22:57Z)
• Expert-Guided Symmetry Detection in Markov Decision Processes [0.0]
  We propose a paradigm that aims to detect the presence of some transformations of the state-action space for which the MDP dynamics is invariant. The results show that the model distributional shift is reduced when the dataset is augmented with the data obtained by using the detected symmetries.
  arXiv  Detail & Related papers  (2021-11-19T16:12:30Z)
• Regularizing Variational Autoencoder with Diversity and Uncertainty Awareness [61.827054365139645]
  Variational Autoencoder (VAE) approximates the posterior of latent variables based on amortized variational inference. We propose an alternative model, DU-VAE, for learning a more Diverse and less Uncertain latent space.
  arXiv  Detail & Related papers  (2021-10-24T07:58:13Z)
• Understanding and Exploiting Dependent Variables with Deep Metric Learning [0.5025737475817937]
  Deep Metric Learning (DML) approaches learn to represent inputs to a lower-dimensional latent space. This paper investigates how the mapping element of DML may be exploited in situations where the salient features in arbitrary classification problems vary over time.
  arXiv  Detail & Related papers  (2020-09-08T15:30:45Z)
• Towards Plausible Differentially Private ADMM Based Distributed Machine Learning [27.730535587906168]
  We propose a novel (Improved) Plausible differentially Private ADMM algorithm, called PP-ADMM and IPP-ADMM. Under the same privacy guarantee, the proposed algorithms are superior to the state of the art in terms of model accuracy and convergence rate.
  arXiv  Detail & Related papers  (2020-08-11T03:40:55Z)
• Accounting for Unobserved Confounding in Domain Generalization [107.0464488046289]
  This paper investigates the problem of learning robust, generalizable prediction models from a combination of datasets. Part of the challenge of learning robust models lies in the influence of unobserved confounders. We demonstrate the empirical performance of our approach on healthcare data from different modalities.
  arXiv  Detail & Related papers  (2020-07-21T08:18:06Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.