Answers.Body: <p>This is precisely the optimal transportation problem. If both vectors are defined on the same space, you are trying to minimize the Wasserstein distance (which I think is equivalent to what N. Kiefer suggested). Associated to the Wasserstein distance / optimal transport cost is an optimal transport plan, which tells you how to transport the mass from vector 2 onto vector 1.</p>
  <p>Optimal transport has become fairly popular in ML, check the WGAN for example.</p>
  
Answers.ContentLicense: CC BY-SA 4.0
Answers.CreationDate: 2021-06-02T14:24:33.910Z
Answers.LastActivityDate: 2021-06-02T14:24:33.910Z
Answers.UserDisplayName: harwiltz
Body: <p>Assume we have <strong>two vectors</strong>, containing random samples (maybe audio data?). Their distribution can be approximated to a normal distribution, so we can calculate their mean and standard deviation.</p>
  <ul>
  <li><p>I am looking for a way to &quot;fit&quot; the <strong>second vector</strong>'s samples, in a way that their mean and standard deviation correspond to the <strong>first vector</strong>'s mean and standard deviation.</p>
  </li>
  <li><p>Also, I am looking for a way to do this by &quot;moving the second vector's samples the least possible&quot;. This is because, an easy way to solve this problem could be to replace the second vector's data, with random samples that fit the first vector's parameters. This solution is easy, but not interesting.</p>
  </li>
  </ul>
  <h1>Questions</h1>
  <ul>
  <li><p>Is this kind of problem correlated with machine learning in general? If yes &quot;how&quot;?</p>
  </li>
  <li><p>Is there a way to perform this kind of operation with some kind of neural network? If yes, how could it be modelled?</p>
  </li>
  </ul>
  
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2021-06-01T07:15:37.800Z
Comments.Text: The earth mover's distance could be a relevant keyword here, I think that is what you're trying to do.
Comments.UserDisplayName: N. Kiefer
Comments.ContentLicense: CC BY-SA 4.0
Comments.CreationDate: 2021-06-01T16:34:48.330Z
Comments.Text: Thanks, seems to be the right path. Is this earth mover's distance correlated or used in machine Learning?
Comments.UserDisplayName: Barsaas
Tags: <machine-learning><definitions><algorithm-request>
Title: Fitting a Gaussian distribution into another distribution
UserDisplayName: Barsaas
ThreadText: # Fitting a Gaussian distribution into another distribution
  
  (Asked by: username_0 on 2021-05-31)
  
  Assume we have **two vectors**, containing random samples (maybe audio data?). Their distribution can be approximated to a normal distribution, so we can calculate their mean and standard deviation.
  
  * I am looking for a way to "fit" the **second vector**'s samples, in a way that their mean and standard deviation correspond to the **first vector**'s mean and standard deviation.
  * Also, I am looking for a way to do this by "moving the second vector's samples the least possible". This is because, an easy way to solve this problem could be to replace the second vector's data, with random samples that fit the first vector's parameters. This solution is easy, but not interesting.
  
  # Questions
  
  * Is this kind of problem correlated with machine learning in general? If yes "how"?
  * Is there a way to perform this kind of operation with some kind of neural network? If yes, how could it be modelled?
  
  **Tags:** machine-learning, definitions, algorithm-request
  
  > **Comments:**
  > **username_1**: The earth mover's distance could be a relevant keyword here, I think that is what you're trying to do.  
  > **username_0**: Thanks, seems to be the right path. Is this earth mover's distance correlated or used in machine Learning?  
  
  ---
  
  ## 1 answers
  
  ### Answer by username_2 on 2021-06-02. Score: 0 | Accepted answer
  
  This is precisely the optimal transportation problem. If both vectors are defined on the same space, you are trying to minimize the Wasserstein distance (which I think is equivalent to what username_1 suggested). Associated to the Wasserstein distance / optimal transport cost is an optimal transport plan, which tells you how to transport the mass from vector 2 onto vector 1.
  
  Optimal transport has become fairly popular in ML, check the WGAN for example.
  
  
  ---
  
  