Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
D
D-Cliques
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Build
Pipelines
Jobs
Pipeline schedules
Artifacts
Deploy
Releases
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
SaCS
Distributed Machine Learning
D-Cliques
Commits
a257e5b6
Commit
a257e5b6
authored
3 years ago
by
aurelien.bellet
Browse files
Options
Downloads
Patches
Plain Diff
introduce label distribution skew in sec 2
parent
8c9e245a
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
mlsys2022style/setting.tex
+15
-4
15 additions, 4 deletions
mlsys2022style/setting.tex
with
15 additions
and
4 deletions
mlsys2022style/setting.tex
+
15
−
4
View file @
a257e5b6
...
@@ -11,8 +11,17 @@ labeled data point by a tuple $(x,y)$ where $x$ represents the data point
...
@@ -11,8 +11,17 @@ labeled data point by a tuple $(x,y)$ where $x$ represents the data point
Each
Each
node has
node has
access to a local dataset that
access to a local dataset that
follows its own local distribution
$
D
_
i
$
. The goal is to find the parameters
follows its own local distribution
$
D
_
i
$
which may differ from that of other
$
\theta
$
of a global model that performs well on the union of the local
nodes.
In this work, we focus on label distribution skew: denoting by
$
p
_
i
(
x,y
)=
p
_
i
(
x|y
)
p
_
i
(
y
)
$
the
probability of
$
(
x,y
)
$
under the local distribution
$
D
_
i
$
of node
$
i
$
, we
assume that
$
p
_
i
(
y
)
$
varies across nodes. We refer to
\cite
{
kairouz2019advances,quagmire
}
for concrete examples of problems
with label distribution skew.
The objective is to find the parameters
$
\theta
$
of a global model that performs well on the union of the local
distributions by
distributions by
minimizing
minimizing
the average training loss:
the average training loss:
...
@@ -26,8 +35,10 @@ function
...
@@ -26,8 +35,10 @@ function
on node
$
i
$
. Therefore,
$
\mathds
{
E
}_{
(
x
_
i,y
_
i
)
\sim
D
_
i
}
F
_
i
(
\theta
;x
_
i,y
_
i
)
$
on node
$
i
$
. Therefore,
$
\mathds
{
E
}_{
(
x
_
i,y
_
i
)
\sim
D
_
i
}
F
_
i
(
\theta
;x
_
i,y
_
i
)
$
denotes
denotes
the
the
expected loss of model
$
\theta
$
over the local data distribution
expected loss of model
$
\theta
$
over
$
D
_
i
$
.
$
D
_
i
$
.
To collaboratively solve Problem
\eqref
{
eq:dist-optimization-problem
}
, each
To collaboratively solve Problem
\eqref
{
eq:dist-optimization-problem
}
, each
node can exchange messages with its neighbors in an undirected network graph
node can exchange messages with its neighbors in an undirected network graph
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment