2023-01-24 18:57:18 +01:00
|
|
|
#ifndef MLPP_SVC_H
|
|
|
|
#define MLPP_SVC_H
|
|
|
|
|
2023-12-30 00:41:59 +01:00
|
|
|
/*************************************************************************/
|
|
|
|
/* svc.h */
|
|
|
|
/*************************************************************************/
|
|
|
|
/* This file is part of: */
|
|
|
|
/* PMLPP Machine Learning Library */
|
|
|
|
/* https://github.com/Relintai/pmlpp */
|
|
|
|
/*************************************************************************/
|
2023-12-30 00:43:39 +01:00
|
|
|
/* Copyright (c) 2023-present Péter Magyar. */
|
2023-12-30 00:41:59 +01:00
|
|
|
/* Copyright (c) 2022-2023 Marc Melikyan */
|
|
|
|
/* */
|
|
|
|
/* Permission is hereby granted, free of charge, to any person obtaining */
|
|
|
|
/* a copy of this software and associated documentation files (the */
|
|
|
|
/* "Software"), to deal in the Software without restriction, including */
|
|
|
|
/* without limitation the rights to use, copy, modify, merge, publish, */
|
|
|
|
/* distribute, sublicense, and/or sell copies of the Software, and to */
|
|
|
|
/* permit persons to whom the Software is furnished to do so, subject to */
|
|
|
|
/* the following conditions: */
|
|
|
|
/* */
|
|
|
|
/* The above copyright notice and this permission notice shall be */
|
|
|
|
/* included in all copies or substantial portions of the Software. */
|
|
|
|
/* */
|
|
|
|
/* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, */
|
|
|
|
/* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF */
|
|
|
|
/* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.*/
|
|
|
|
/* IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY */
|
|
|
|
/* CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, */
|
|
|
|
/* TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE */
|
|
|
|
/* SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */
|
|
|
|
/*************************************************************************/
|
2023-01-23 21:13:26 +01:00
|
|
|
|
|
|
|
// https://towardsdatascience.com/svm-implementation-from-scratch-python-2db2fc52e5c2
|
|
|
|
// Illustratd a practical definition of the Hinge Loss function and its gradient when optimizing with SGD.
|
|
|
|
|
2023-01-27 13:01:16 +01:00
|
|
|
#include "core/math/math_defs.h"
|
|
|
|
|
2023-04-28 20:37:44 +02:00
|
|
|
#include "core/object/resource.h"
|
2023-02-10 14:03:48 +01:00
|
|
|
|
|
|
|
#include "../lin_alg/mlpp_matrix.h"
|
|
|
|
#include "../lin_alg/mlpp_vector.h"
|
|
|
|
|
|
|
|
#include "../regularization/reg.h"
|
|
|
|
|
2023-04-28 20:37:44 +02:00
|
|
|
class MLPPSVC : public Resource {
|
|
|
|
GDCLASS(MLPPSVC, Resource);
|
2023-01-23 21:13:26 +01:00
|
|
|
|
2023-01-24 19:00:54 +01:00
|
|
|
public:
|
2023-04-28 20:37:44 +02:00
|
|
|
Ref<MLPPMatrix> get_input_set() const;
|
2023-02-10 14:03:48 +01:00
|
|
|
void set_input_set(const Ref<MLPPMatrix> &val);
|
|
|
|
|
2023-04-28 20:37:44 +02:00
|
|
|
Ref<MLPPVector> get_output_set() const;
|
2023-02-10 14:03:48 +01:00
|
|
|
void set_output_set(const Ref<MLPPMatrix> &val);
|
|
|
|
|
2023-04-28 20:37:44 +02:00
|
|
|
real_t get_c() const;
|
2023-02-10 14:03:48 +01:00
|
|
|
void set_c(const real_t val);
|
|
|
|
|
2023-04-28 20:37:44 +02:00
|
|
|
Ref<MLPPVector> data_z_get() const;
|
|
|
|
void data_z_set(const Ref<MLPPVector> &val);
|
|
|
|
|
|
|
|
Ref<MLPPVector> data_y_hat_get() const;
|
|
|
|
void data_y_hat_set(const Ref<MLPPVector> &val);
|
|
|
|
|
|
|
|
Ref<MLPPVector> data_weights_get() const;
|
|
|
|
void data_weights_set(const Ref<MLPPVector> &val);
|
|
|
|
|
|
|
|
real_t data_bias_get() const;
|
|
|
|
void data_bias_set(const real_t val);
|
|
|
|
|
2023-02-10 14:03:48 +01:00
|
|
|
Ref<MLPPVector> model_set_test(const Ref<MLPPMatrix> &X);
|
|
|
|
real_t model_test(const Ref<MLPPVector> &x);
|
|
|
|
|
2023-04-28 20:37:44 +02:00
|
|
|
void train_gradient_descent(real_t learning_rate, int max_epoch, bool ui = false);
|
|
|
|
void train_sgd(real_t learning_rate, int max_epoch, bool ui = false);
|
|
|
|
void train_mbgd(real_t learning_rate, int max_epoch, int mini_batch_size, bool ui = false);
|
2023-02-10 14:03:48 +01:00
|
|
|
|
2023-01-27 13:01:16 +01:00
|
|
|
real_t score();
|
2023-01-24 19:00:54 +01:00
|
|
|
|
2023-04-28 20:37:44 +02:00
|
|
|
bool needs_init() const;
|
2023-02-10 14:03:48 +01:00
|
|
|
void initialize();
|
|
|
|
|
|
|
|
MLPPSVC(const Ref<MLPPMatrix> &input_set, const Ref<MLPPVector> &output_set, real_t c);
|
|
|
|
|
|
|
|
MLPPSVC();
|
|
|
|
~MLPPSVC();
|
|
|
|
|
|
|
|
protected:
|
|
|
|
real_t cost(const Ref<MLPPVector> &z, const Ref<MLPPVector> &y, const Ref<MLPPVector> &weights, real_t c);
|
|
|
|
|
|
|
|
Ref<MLPPVector> evaluatem(const Ref<MLPPMatrix> &X);
|
|
|
|
Ref<MLPPVector> propagatem(const Ref<MLPPMatrix> &X);
|
|
|
|
|
|
|
|
real_t evaluatev(const Ref<MLPPVector> &x);
|
|
|
|
real_t propagatev(const Ref<MLPPVector> &x);
|
|
|
|
|
|
|
|
void forward_pass();
|
2023-02-10 09:12:56 +01:00
|
|
|
|
2023-02-10 14:03:48 +01:00
|
|
|
static void _bind_methods();
|
2023-01-24 19:00:54 +01:00
|
|
|
|
2023-02-10 14:03:48 +01:00
|
|
|
Ref<MLPPMatrix> _input_set;
|
|
|
|
Ref<MLPPVector> _output_set;
|
2023-04-28 20:37:44 +02:00
|
|
|
real_t _c;
|
2023-01-24 19:00:54 +01:00
|
|
|
|
2023-02-10 14:03:48 +01:00
|
|
|
Ref<MLPPVector> _z;
|
|
|
|
Ref<MLPPVector> _y_hat;
|
|
|
|
Ref<MLPPVector> _weights;
|
|
|
|
real_t _bias;
|
2023-01-24 19:00:54 +01:00
|
|
|
};
|
2023-01-24 19:20:18 +01:00
|
|
|
|
2023-01-23 21:13:26 +01:00
|
|
|
#endif /* SVC_hpp */
|