This repository has been archived by the owner on Nov 19, 2020. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 2k
/
ProbabilisticNewtonMethod.cs
436 lines (387 loc) · 16.3 KB
/
ProbabilisticNewtonMethod.cs
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
// Accord Statistics Library
// The Accord.NET Framework
// http://accord-framework.net
//
// Copyright © César Souza, 2009-2017
// cesarsouza at gmail.com
//
// This library is free software; you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public
// License as published by the Free Software Foundation; either
// version 2.1 of the License, or (at your option) any later version.
//
// This library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
// Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public
// License along with this library; if not, write to the Free Software
// Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
//
// Copyright (c) 2007-2011 The LIBLINEAR Project.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
//
// 1. Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//
// 2. Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
//
// 3. Neither name of copyright holders nor the names of its contributors
// may be used to endorse or promote products derived from this software
// without specific prior written permission.
//
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
namespace Accord.MachineLearning.VectorMachines.Learning
{
using System;
using System.Threading;
using Accord.Math.Optimization;
using Accord.Statistics.Links;
using System.Diagnostics;
using Accord.Statistics.Kernels;
using Accord.Math;
using Statistics.Models.Regression;
using Statistics.Models.Regression.Fitting;
/// <summary>
/// L2-regularized L2-loss logistic regression (probabilistic
/// support vector machine) learning algorithm in the primal.
/// </summary>
///
/// <remarks>
/// <para>
/// This class implements a L2-regularized L2-loss logistic regression (probabilistic
/// support vector machine) learning algorithm that operates in the primal form of the
/// optimization problem. This method has been based on liblinear's <c>l2r_lr_fun</c>
/// problem specification, optimized using a <see cref="TrustRegionNewtonMethod">
/// Trust-region Newton method</see>.</para>
/// </remarks>
///
/// <para>
/// Liblinear's solver <c>-s 0</c>: <c>L2R_LR</c>. A trust region newton
/// algorithm for the primal of L2-regularized, L2-loss logistic regression.
/// </para>
///
/// <examples>
/// <para>
/// Probabilistic SVMs are exactly the same as logistic regression models
/// trained using a large-margin decision criteria. As such, any linear SVM
/// learning algorithm can be used to obtain <see cref="LogisticRegression"/>
/// objects as well.</para>
///
/// <para>
/// The following example shows how to obtain a <see cref="LogisticRegression"/>
/// from a probabilistic linear <see cref="SupportVectorMachine"/>. It contains
/// exactly the same data used in the <see cref="IterativeReweightedLeastSquares"/>
/// documentation page for <see cref="LogisticRegression"/>.</para>
///
/// <code source="Unit Tests\Accord.Tests.MachineLearning\VectorMachines\Probabilistic\ProbabilisticNewtonMethodTest.cs" region="doc_logreg"/>
/// </examples>
///
/// <seealso cref="SequentialMinimalOptimization{TKernel}"/>
/// <seealso cref="LinearDualCoordinateDescent"/>
///
public class ProbabilisticNewtonMethod :
BaseProbabilisticNewtonMethod<SupportVectorMachine, Linear, double[]>,
ILinearSupportVectorMachineLearning
{
/// <summary>
/// Obsolete.
/// </summary>
[Obsolete("Please do not pass parameters in the constructor. Use the default constructor and the Learn method instead.")]
public ProbabilisticNewtonMethod(SupportVectorMachine model, double[][] input, int[] output)
: base(model, input, output)
{
}
/// <summary>
/// Creates an instance of the model to be learned. Inheritors
/// of this abstract class must define this method so new models
/// can be created from the training data.
/// </summary>
protected override SupportVectorMachine Create(int inputs, Linear kernel)
{
return new SupportVectorMachine(inputs) { Kernel = kernel };
}
/// <summary>
/// Initializes a new instance of the <see cref="ProbabilisticNewtonMethod"/> class.
/// </summary>
public ProbabilisticNewtonMethod()
{
}
}
/// <summary>
/// L2-regularized L2-loss logistic regression (probabilistic
/// support vector machine) learning algorithm in the primal.
/// </summary>
///
/// <remarks>
/// <para>
/// This class implements a L2-regularized L2-loss logistic regression (probabilistic
/// support vector machine) learning algorithm that operates in the primal form of the
/// optimization problem. This method has been based on liblinear's <c>l2r_lr_fun</c>
/// problem specification, optimized using a <see cref="TrustRegionNewtonMethod">
/// Trust-region Newton method</see>.</para>
/// </remarks>
///
/// <para>
/// Liblinear's solver <c>-s 0</c>: <c>L2R_LR</c>. A trust region newton
/// algorithm for the primal of L2-regularized, L2-loss logistic regression.
/// </para>
///
/// <examples>
/// <para>
/// Probabilistic SVMs are exactly the same as logistic regression models
/// trained using a large-margin decision criteria. As such, any linear SVM
/// learning algorithm can be used to obtain <see cref="LogisticRegression"/>
/// objects as well.</para>
///
/// <para>
/// The following example shows how to obtain a <see cref="LogisticRegression"/>
/// from a probabilistic linear <see cref="SupportVectorMachine"/>. It contains
/// exactly the same data used in the <see cref="IterativeReweightedLeastSquares"/>
/// documentation page for <see cref="LogisticRegression"/>.</para>
///
/// <code source="Unit Tests\Accord.Tests.MachineLearning\VectorMachines\Probabilistic\ProbabilisticNewtonMethodTest.cs" region="doc_logreg"/>
/// </examples>
///
/// <seealso cref="SequentialMinimalOptimization{TKernel}"/>
/// <seealso cref="LinearDualCoordinateDescent"/>
///
public class ProbabilisticNewtonMethod<TKernel> :
BaseProbabilisticNewtonMethod<SupportVectorMachine<TKernel>, TKernel, double[]>
where TKernel : struct, ILinear<double[]>
{
/// <summary>
/// Creates an instance of the model to be learned. Inheritors
/// of this abstract class must define this method so new models
/// can be created from the training data.
/// </summary>
protected override SupportVectorMachine<TKernel> Create(int inputs, TKernel kernel)
{
return new SupportVectorMachine<TKernel>(inputs, kernel);
}
}
/// <summary>
/// L2-regularized L2-loss logistic regression (probabilistic
/// support vector machine) learning algorithm in the primal.
/// </summary>
///
/// <remarks>
/// <para>
/// This class implements a L2-regularized L2-loss logistic regression (probabilistic
/// support vector machine) learning algorithm that operates in the primal form of the
/// optimization problem. This method has been based on liblinear's <c>l2r_lr_fun</c>
/// problem specification, optimized using a <see cref="TrustRegionNewtonMethod">
/// Trust-region Newton method</see>.</para>
/// </remarks>
///
/// <para>
/// Liblinear's solver <c>-s 0</c>: <c>L2R_LR</c>. A trust region newton
/// algorithm for the primal of L2-regularized, L2-loss logistic regression.
/// </para>
///
/// <examples>
/// <para>
/// Probabilistic SVMs are exactly the same as logistic regression models
/// trained using a large-margin decision criteria. As such, any linear SVM
/// learning algorithm can be used to obtain <see cref="LogisticRegression"/>
/// objects as well.</para>
///
/// <para>
/// The following example shows how to obtain a <see cref="LogisticRegression"/>
/// from a probabilistic linear <see cref="SupportVectorMachine"/>. It contains
/// exactly the same data used in the <see cref="IterativeReweightedLeastSquares"/>
/// documentation page for <see cref="LogisticRegression"/>.</para>
///
/// <code source="Unit Tests\Accord.Tests.MachineLearning\VectorMachines\Probabilistic\ProbabilisticNewtonMethodTest.cs" region="doc_logreg"/>
/// </examples>
///
/// <seealso cref="SequentialMinimalOptimization{TKernel}"/>
/// <seealso cref="LinearDualCoordinateDescent"/>
///
public class ProbabilisticNewtonMethod<TKernel, TInput> :
BaseProbabilisticNewtonMethod<SupportVectorMachine<TKernel, TInput>, TKernel, TInput>
where TKernel : ILinear<TInput>
{
/// <summary>
/// Creates an instance of the model to be learned. Inheritors
/// of this abstract class must define this method so new models
/// can be created from the training data.
/// </summary>
protected override SupportVectorMachine<TKernel, TInput> Create(int inputs, TKernel kernel)
{
return new SupportVectorMachine<TKernel, TInput>(inputs, kernel);
}
}
/// <summary>
/// Base class for probabilistic Newton Method learning.
/// </summary>
///
public abstract class BaseProbabilisticNewtonMethod<TModel, TKernel, TInput> :
BaseSupportVectorClassification<TModel, TKernel, TInput>
where TKernel : ILinear<TInput>
where TModel : SupportVectorMachine<TKernel, TInput>
{
TrustRegionNewtonMethod tron;
private double[] z;
private double[] D;
private double[] g;
private double[] Hs;
private int biasIndex;
private double tolerance = 0.01;
private int maxIterations = 1000;
/// <summary>
/// Constructs a new Newton method algorithm for L2-regularized logistic
/// regression (probabilistic linear SVMs) primal problems (-s 0).
/// </summary>
///
public BaseProbabilisticNewtonMethod()
{
}
/// <summary>
/// Convergence tolerance. Default value is 0.01.
/// </summary>
///
/// <remarks>
/// The criterion for completing the model training process. The default is 0.01.
/// </remarks>
///
public double Tolerance
{
get { return tolerance; }
set { tolerance = value; }
}
/// <summary>
/// Gets or sets the maximum number of iterations that should
/// be performed until the algorithm stops. Default is 1000.
/// </summary>
///
public int MaximumIterations
{
get { return maxIterations; }
set { maxIterations = value; }
}
private double objective(double[] w)
{
int[] y = Outputs;
Xv(w, z);
double f = 0;
for (int i = 0; i < w.Length; i++)
f += w[i] * w[i];
f /= 2.0;
for (int i = 0; i < y.Length; i++)
{
double yz = y[i] * z[i];
if (yz >= 0)
f += C[i] * Math.Log(1 + Math.Exp(-yz));
else
f += C[i] * (-yz + Math.Log(1 + Math.Exp(yz)));
}
return f;
}
private double[] gradient(double[] w)
{
int[] y = Outputs;
for (int i = 0; i < y.Length; i++)
{
z[i] = 1 / (1 + Math.Exp(-y[i] * z[i]));
D[i] = z[i] * (1 - z[i]);
z[i] = C[i] * (z[i] - 1) * y[i];
}
XTv(z, g);
for (int i = 0; i < w.Length; i++)
g[i] = w[i] + g[i];
return g;
}
private double[] hessian(double[] s)
{
double[] wa = new double[Inputs.Length];
Xv(s, wa);
for (int i = 0; i < wa.Length; i++)
wa[i] = C[i] * D[i] * wa[i];
XTv(wa, Hs);
for (int i = 0; i < Hs.Length; i++)
Hs[i] = s[i] + Hs[i];
return Hs;
}
private void Xv(double[] v, double[] Xv)
{
for (int i = 0; i < Inputs.Length; i++)
Xv[i] = Kernel.Function(v, Inputs[i]) + v[biasIndex];
}
private void XTv(double[] v, double[] XTv)
{
for (int i = 0; i < XTv.Length; i++)
XTv[i] = 0;
for (int i = 0; i < Inputs.Length; i++)
{
Kernel.Product(v[i], Inputs[i], accumulate: XTv);
XTv[biasIndex] += v[i];
}
}
/// <summary>
/// Runs the learning algorithm.
/// </summary>
///
protected override void InnerRun()
{
int samples = Inputs.Length;
int parameters = Kernel.GetLength(Inputs) + 1;
this.z = new double[samples];
this.D = new double[samples];
this.g = new double[parameters];
this.Hs = new double[parameters];
this.biasIndex = parameters - 1;
tron = new TrustRegionNewtonMethod(parameters)
{
Function = objective,
Gradient = gradient,
Hessian = hessian,
Tolerance = tolerance,
MaxIterations = maxIterations,
Token = Token
};
for (int i = 0; i < tron.Solution.Length; i++)
tron.Solution[i] = 0;
tron.Minimize();
// Get the solution found by TRON
double[] weightsWithBias = tron.Solution;
// Separate the weights and the bias coefficient
double[] weights = weightsWithBias.Get(0, -1);
double bias = weightsWithBias[biasIndex];
Debug.Assert(weights.Length == parameters - 1);
// Create the machine
Model.NumberOfInputs = weights.Length;
Model.SupportVectors = new[] { Kernel.CreateVector(weights) };
Model.Weights = new[] { 1.0 };
Model.Threshold = bias;
Model.IsProbabilistic = true;
}
/// <summary>
/// Obsolete.
/// </summary>
///
protected BaseProbabilisticNewtonMethod(TModel model, TInput[] input, int[] output)
: base(model, input, output)
{
}
}
}