On the public citation graph
Differentially private distributed online learning over time‐varying digraphs via dual averaging
0 signed · 73 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/rnc.3164openalex-snapshot
Gradient‐free method for distributed multi‐agent optimization via push‐sum algorithms
inferredcites →https://doi.org/10.1002/rnc.4547openalex-snapshot
Distributed continuous‐time algorithm for a general nonsmooth monotropic optimization problem
inferredcites →https://doi.org/10.1007/978-0-387-45528-0openalex-snapshot
Pattern Recognition and Machine Learning
inferredcites →https://doi.org/10.1007/s10107-007-0149-xopenalex-snapshot
Primal-dual subgradient methods for convex problems
inferredcites →https://doi.org/10.1016/j.automatica.2018.07.005openalex-snapshot
Privacy preserving distributed optimization using homomorphic encryption
inferredcites →https://doi.org/10.1016/j.automatica.2018.07.020openalex-snapshot
Distributed optimization over directed graphs with row stochasticity and constraint regularity
inferredcites →https://doi.org/10.1109/cdc.2013.6760868openalex-snapshot
Exponentially fast parameter estimation in networks using distributed dual averaging
inferredcites →https://doi.org/10.1109/msp.2014.2345536openalex-snapshot
Stochastic Approximation vis-a-vis Online Learning for Big Data Analytics [Lecture Notes]
inferredcites →https://doi.org/10.1109/tac.2010.2041686openalex-snapshot
Constrained Consensus and Optimization in Multi-Agent Networks
inferredcites →https://doi.org/10.1109/tac.2011.2161027openalex-snapshot
Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling
inferredcites →https://doi.org/10.1109/tac.2014.2364096openalex-snapshot
Distributed Optimization Over Time-Varying Directed Graphs
inferredcites →https://doi.org/10.1109/tac.2016.2525928openalex-snapshot
Online Distributed Convex Optimization on Dynamic Networks
inferredcites →https://doi.org/10.1109/tac.2016.2541298openalex-snapshot
Differentially Private Distributed Constrained Optimization
inferredcites →https://doi.org/10.1109/tac.2016.2615066openalex-snapshot
Distributed Subgradient Projection Algorithm Over Directed Graphs
inferredcites →https://doi.org/10.1109/tac.2017.2650563openalex-snapshot
Stochastic Dual Averaging for Decentralized Online Optimization on Time-Varying Communication Graphs
inferredcites →https://doi.org/10.1109/tac.2017.2690401openalex-snapshot
Fast Convergence Rates for Distributed Non-Bayesian Learning
inferredcites →https://doi.org/10.1109/tac.2017.2743462openalex-snapshot
Distributed Online Optimization in Dynamic Environments Using Mirror Descent
inferredcites →https://doi.org/10.1109/tac.2018.2860546openalex-snapshot
Individual Regret Bounds for the Distributed Online Alternating Direction Method of Multipliers
inferredcites →https://doi.org/10.1109/tac.2019.2930234openalex-snapshot
AsySPA: An Exact Asynchronous Algorithm for Convex Optimization Over Digraphs
inferredcites →https://doi.org/10.1109/tac.2019.2934216openalex-snapshot
Dual Averaging Push for Distributed Convex Optimization Over Time-Varying Directed Graph
inferredcites →https://doi.org/10.1109/tac.2020.3033712openalex-snapshot
Online Learning Over Dynamic Graphs via Distributed Proximal Gradient Algorithm
inferredcites →https://doi.org/10.1109/tcns.2015.2505149openalex-snapshot
Distributed Online Convex Optimization on Time-Varying Directed Graphs
inferredcites →https://doi.org/10.1109/tcns.2016.2614100openalex-snapshot
Differentially Private Distributed Convex Optimization via Functional Perturbation
inferredcites →https://doi.org/10.1109/tcns.2018.2873152openalex-snapshot
Enabling Privacy-Preservation in Decentralized Optimization
inferredcites →https://doi.org/10.1109/tcns.2020.2976273openalex-snapshot
Privacy-Preserving Distributed Online Optimization Over Unbalanced Digraphs via Subgradient Rescaling
inferredcites →https://doi.org/10.1109/tcyb.2020.2973221openalex-snapshot
Privacy Masking Stochastic Subgradient-Push Algorithm for Distributed Online Optimization
inferredcites →https://doi.org/10.1109/tetci.2018.2880771openalex-snapshot
Decentralized Online Learning Methods Based on Weight-Balancing Over Time-Varying Digraphs
inferredcites →https://doi.org/10.1109/tkde.2012.191openalex-snapshot
Distributed Autonomous Online Learning: Regrets and Intrinsic Privacy-Preserving Properties
inferredcites →https://doi.org/10.1109/tnse.2014.2363554openalex-snapshot
Distributed Online Convex Optimization Over Jointly Connected Digraphs
inferredcites →https://doi.org/10.1109/tsipn.2018.2797806openalex-snapshot
Differentially Private Distributed Online Algorithms Over Time-Varying Directed Networks
inferredcites →https://doi.org/10.1109/tsp.2018.2793878openalex-snapshot
Accelerated Distributed Dual Averaging Over Evolving Networks of Growing Connectivity
inferredcites →https://doi.org/10.1109/tsp.2020.2964200openalex-snapshot
Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
inferredcites →https://doi.org/10.1109/tsp.2020.2999671openalex-snapshot
Distributed Constrained Online Learning
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/rnc.5973openalex-snapshot
Learning‐based robust control methodologies under information constraints
inferred← citeshttps://doi.org/10.1002/rnc.7252openalex-snapshot
Privacy and security trade‐off in cyber‐physical systems: An information theory‐based framework
inferred← citeshttps://doi.org/10.1002/rnc.7330openalex-snapshot
Event‐triggered differential private distributed fusion estimation for sensor networks with unknown cross‐correlations
inferred← citeshttps://doi.org/10.1002/rnc.7789openalex-snapshot
Frequency Shaping for Improving a Trade‐Off Between Control and Privacy Performance: Beyond Differential Privacy
inferred← citeshttps://doi.org/10.1016/b978-0-44-333337-8.00011-1openalex-snapshot
Differentially private decentralized dual averaging algorithms for online optimization in directed networks
inferred← citeshttps://doi.org/10.1016/b978-0-44-333337-8.00012-3openalex-snapshot
Differentially private decentralized zeroth-order algorithms for online optimization in dynamic networks
inferred← citeshttps://doi.org/10.1016/b978-0-44-333337-8.00013-5openalex-snapshot
Privacy-preserving decentralized dual averaging push algorithms with correlated perturbations
inferred← citeshttps://doi.org/10.1016/b978-0-443-14081-5.00125-2openalex-snapshot
Privacy-Preserving Distributed Optimization and Learning
inferred← citeshttps://doi.org/10.1016/j.aei.2024.102662openalex-snapshot
Differential privacy distributed optimization algorithm against adversarial attacks for efficiency optimization of complex industrial processes
inferred← citeshttps://doi.org/10.1016/j.arcontrol.2023.100904openalex-snapshot
A survey on distributed online optimization and online games
inferred← citeshttps://doi.org/10.1016/j.automatica.2023.111150openalex-snapshot
Gradient-tracking based differentially private distributed optimization with enhanced optimization accuracy
inferred← citeshttps://doi.org/10.1016/j.automatica.2024.111514openalex-snapshot
Distributed empirical risk minimization with differential privacy
inferred← citeshttps://doi.org/10.1016/j.automatica.2024.112071openalex-snapshot
Privacy and security trade-off in interconnected systems with known or unknown privacy noise covariance
inferred← citeshttps://doi.org/10.1016/j.ifacol.2022.07.233openalex-snapshot
Private Stochastic Dual Averaging for Decentralized Empirical Risk Minimization
inferred← citeshttps://doi.org/10.1016/j.ins.2023.02.037openalex-snapshot
Distributed dynamic online learning with differential privacy via path-length measurement
inferred← citeshttps://doi.org/10.1016/j.ins.2023.119199openalex-snapshot
Achieving linear convergence for differentially private full-decentralized economic dispatch over directed networks
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2022.12.041openalex-snapshot
Two-stage continuous-time triggered algorithms for constrained distributed optimization over directed graphs
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2026.108688openalex-snapshot
Resilient distributed online nonconvex optimization algorithm against randomly corrupted attacks
inferred← citeshttps://doi.org/10.1016/j.neucom.2023.126531openalex-snapshot
Differentially private distributed online mirror descent algorithm
inferred← citeshttps://doi.org/10.1049/cth2.12548openalex-snapshot
Constrained distributed online convex optimization with bandit feedback for unbalanced digraphs
inferred← citeshttps://doi.org/10.1109/ccdc65474.2025.11090768openalex-snapshot
Differentially Private Distributed Online Optimization via Signs of Relative States
inferred← citeshttps://doi.org/10.1109/cdc56724.2024.10886177openalex-snapshot
Differentially Private Online Federated Learning with Correlated Noise
inferred← citeshttps://doi.org/10.1109/icnc64304.2024.10987847openalex-snapshot
Decentralized Online Dual Averaging Optimization Ensuring Differential Privacy and Expected Regret
inferred← citeshttps://doi.org/10.1109/icus66297.2025.11294883openalex-snapshot
Statistical Privacy-Preserving Online Nash Equilibrium Learning with Two-Point Bandit Feedback
inferred← citeshttps://doi.org/10.1109/jas.2024.124869openalex-snapshot
Privacy Distributed Constrained Optimization Over Time-Varying Unbalanced Networks and Its Application in Federated Learning
inferred← citeshttps://doi.org/10.1109/tac.2023.3264164openalex-snapshot
Statistical Privacy-Preserving Online Distributed Nash Equilibrium Tracking in Aggregative Games
inferred← citeshttps://doi.org/10.1109/tac.2024.3482977openalex-snapshot
Locally Differentially Private Distributed Online Learning With Guaranteed Optimality
inferred← citeshttps://doi.org/10.1109/tac.2025.3579218openalex-snapshot
Byzantine-Robust Distributed Stochastic Nonconvex Optimization in Adversarial Environments Over Unbalanced Networks
inferred← citeshttps://doi.org/10.1109/taes.2022.3219799openalex-snapshot
Guaranteeing Differential Privacy in Distributed Fusion Estimation
inferred← citeshttps://doi.org/10.1109/tase.2024.3440042openalex-snapshot
Privacy-Preserving State Estimation in the Presence of Eavesdroppers: A Survey
inferred← citeshttps://doi.org/10.1109/tcns.2022.3219765openalex-snapshot
Privacy-Preserving Distributed Online Stochastic Optimization With Time-Varying Distributions
inferred← citeshttps://doi.org/10.1109/tdsc.2025.3620745openalex-snapshot
Privacy Protection of Dual Averaging Push for Decentralized Optimization via Zero-Sum Structured Perturbations
inferred← citeshttps://doi.org/10.1109/tetci.2024.3393362openalex-snapshot
Zeroth-Order Decentralized Dual Averaging for Online Optimization With Privacy Consideration
inferred← citeshttps://doi.org/10.1109/tetci.2026.3692603openalex-snapshot
Distributed Online Learning for Constrained Nonseparable Problems With Privacy Preservation
inferred← citeshttps://doi.org/10.1109/ticps.2023.3291667openalex-snapshot
Privacy-Preserving Decentralized Dual Averaging for Online Optimization Over Directed Networks
inferred← citeshttps://doi.org/10.1109/tmlcn.2025.3625519openalex-snapshot
SD-PPDDA: A Privacy Efficient Decentralized Dual Averaging Algorithm Over Networks
inferred← citeshttps://doi.org/10.1109/tmlcn.2026.3737073openalex-snapshot
Privacy-Preserving Distributed Online Learning With Zeroth-Order Feedback Over Directed Networks
inferred← citeshttps://doi.org/10.1109/tnse.2022.3195953openalex-snapshot
Privacy-Protected Decentralized Dual Averaging Push With Edge-Based Correlated Perturbations Over Time-Varying Directed Networks
inferred← citeshttps://doi.org/10.1109/tnse.2023.3329832openalex-snapshot
Distributed Online Private Learning of Convex Nondecomposable Objectives
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.