2 writes to _simplexVertices
Microsoft.ML.Sweeper (2)
Algorithms\NelderMead.cs (2)
119_simplexVertices = new SortedList<IRunResult, float[]>(new SimplexVertexComparer()); 355_simplexVertices = newSimplexVertices;
19 references to _simplexVertices
Microsoft.ML.Sweeper (19)
Algorithms\NelderMead.cs (19)
127int numSweeps = Math.Min(maxSweeps, _dim + 1 - _simplexVertices.Count); 137if (_simplexVertices.Count == _dim + 1) 140if (!_simplexVertices.ContainsKey(run)) 141_simplexVertices.Add(run, ParameterSetAsFloatArray(run.ParameterSet)); 143if (_simplexVertices.Count == _dim + 1) 147if (_simplexVertices.Count < _dim + 1) 149numSweeps = Math.Min(maxSweeps, _dim + 1 - _simplexVertices.Count); 301Contracts.Assert(_simplexVertices.Count == _dim + 1); 303_simplexVertices.Remove(_worst.Key); 304_simplexVertices.Add(newVertexResult, newVertex); 311_worst = _simplexVertices.ElementAt(0); 312_secondWorst = _simplexVertices.ElementAt(1); 313_best = _simplexVertices.ElementAt(_simplexVertices.Count - 1); 321var simplexVertices = _simplexVertices.ToArray(); 385for (int i = 1; i < _simplexVertices.Count; i++) 386VectorUtils.AddMult(_simplexVertices.ElementAt(i).Value, centroid, scale); 402var sortedVertices = _simplexVertices.ToArray(); 403for (int i = 0; i < _simplexVertices.Count - 1; i++)