Classifications

• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
  • G06N20/00—Machine learning
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
  • G06N3/00—Computing arrangements based on biological models
  • G06N3/02—Neural networks
  • G06N3/08—Learning methods
  • G06N3/082—Learning methods modifying the architecture, e.g. adding, deleting or silencing nodes or connections
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
  • G06N3/00—Computing arrangements based on biological models
  • G06N3/02—Neural networks
  • G06N3/04—Architecture, e.g. interconnection topology
  • G06N3/048—Activation functions
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
  • G06N3/00—Computing arrangements based on biological models
  • G06N3/02—Neural networks
  • G06N3/08—Learning methods
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
  • G06N3/00—Computing arrangements based on biological models
  • G06N3/02—Neural networks
  • G06N3/08—Learning methods
  • G06N3/09—Supervised learning
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
  • G06N3/00—Computing arrangements based on biological models
  • G06N3/02—Neural networks
  • G06N3/08—Learning methods
  • G06N3/092—Reinforcement learning
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
  • G06N3/00—Computing arrangements based on biological models
  • G06N3/02—Neural networks
  • G06N3/08—Learning methods
  • G06N3/0985—Hyperparameter optimisation; Meta-learning; Learning-to-learn
• • G—PHYSICS
  • G06—COMPUTING OR CALCULATING; COUNTING
  • G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
  • G06N5/00—Computing arrangements using knowledge-based models
  • G06N5/01—Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound

Definitions

• the invention relates generally to a method for improving machine-learning, and more specifically, to a computer-implemented method for improving fairness and reducing discriminatory bias in a supervised machine-learning model (SML).
• SML supervised machine-learning model
• the invention relates further to a related fairness improvement system for improving fairness in a supervised machine-learning model, and a computer program product.
• AI is certainly one of the key drivers in the current development of the IT (information technology) industry. But it may only exploit this opportunity if the about 70 known fairness metrics and about 10 known state-of-the-art bias mitigation approaches may find its way from research into practical applications and actual practice of domains as wide-ranging as finance, human capital management, healthcare, and education. [0005] There are several disclosures related to a computer-implemented method for controlling a supervised machine-learning model:
• Document US 9,008,840 B 1 discloses a framework for transferring knowledge from an external agent to a robotic controller.
• the controller may be configured to determine a teaching signal based on a sensory input, the teaching signal conveying information associated with target action consistent with a sensory input, wherein the sensory input is indicative of the
• Document US 2018/0012137 A1 discloses a control system and method for controlling a system which employs a dataset representing a plurality of states and associated trajectories of an environment of the system. It iteratively determines an estimate of an optimal control policy for the system.
• a disadvantage of known solutions may be that they stay in the boundaries of their own setup so as to be flexible only within a given set of parameters.
• a computer-implemented method for improving fairness and reducing discriminatory bias in a supervised machine learning model may be provided.
• the method may comprise linking the supervised machine-learning model to a reinforcement learning meta model, selecting a list of hyper parameters and parameters of the supervised machine-learning model, and controlling by the at least one aspect of the supervised machine-learning model by adjusting hyper parameters values and parameter values of the list of hyper-parameters and parameters of the supervised machine-learning model by a reinforcement learning engine relating to the reinforcement learning meta model by calculating a reward function based on multiple conflicting objective functions.
• a related fairness improvement system for improving fairness and reducing discriminatory bias in a supervised machine-learning model.
• the system may comprise a linking component adapted for linking the supervised machine-learning model to a reinforcement learning meta model, a selector unit adapted for selecting a list of hyper-parameters and parameters of the supervised machine-learning model, and a controller adapted for controlling at least one aspect of the supervised machine-learning model by adjusting hyper-parameters values and parameter values of the list of hyper-parameters and parameters of the supervised machine-learning model by a reinforcement learning engine relating to the reinforcement learning meta model by calculating a reward function based on multiple conflicting objective functions.
• the method may also comprise interrupting the repeating if a fairness value is greater than a predefined fairness threshold value and a performance value is greater than a predefined performance threshold value.
• a fairness value is greater than a predefined fairness threshold value and a performance value is greater than a predefined performance threshold value.
• FIG. 1 shows a flowchart of an embodiment of the inventive computer- implemented method for improving fairness and reducing discriminatory bias in a supervised machine-learning model.
• Fig. 2 shows a block diagram of unwanted bias.
• FIG. 3 shows a block diagram of a comprehensive flowchart summarizing the proposed concept on a high level.
• Fig. 4 shows a block diagram of an embodiment of a landscape of different machine-learning model types and/or different model parameters.
• FIG. 5 shows a flowchart of a set of interacting components.
• Fig. 6 shows a flowchart, as an example, a credit scoring algorithm which may not have any gender bias.
• Fig. 7 shows a block diagram of an embodiment of the fairness improvement system for improving fairness and reducing discriminatory bias in a supervised machine learning model.
• Fig. 8 shows a block diagram of an embodiment of a computing system comprising the system according to Fig. 7.
• fairness' - expressed as fairness value - may denote in the context of this document that predictions of machine-learning systems and related algorithms may be unbiased in respect to specific protected attributes.
• these protected attributes e.g., segmented relevant sub-groups, etc.
• the output generated shall be balanced, i.e., more or less equal.
• increasing a fairness value may also be interpreted as decreasing a bias value of an output of a machine-learning system.
• the term 'supervised machine-learning model' may denote a model with related parameters as generated through a training process in which a machine-learning system“may learn” and optimize parameters of functions and weighing factors between the functions.
• the model can be seen as a set of parameters describing the setting of a specific machine-learning system.
• Such a machine-learning system may be trained by a training dataset comprising examples according to which the model is developed or develops itself in them machine-learning system. It may also be noted that the examples of the training dataset are annotated denoting what is expected as output value for the given input value from the machine-learning system. This way, also unknown data used as input to the machine learning system may be categorized according to the derived model (during the training phase).
• the term 'reinforcement learning meta model' may denote - beside supervised machine-learning and unsupervised machine-learning - a third type of AI systems. It aims at using observations gathered from interactions with its environment to take actions that would maximize a reward function or minimize a given risk function.
• reinforcement learning algorithm - typically implemented as an agent - may continuously learn from its environment using iterations.
• the iterations are performed regarding changes to parameters and hyper-parameters of the supervised machine-learning model, whereas the reward function may be seen as a combination of the constrains, i.e., a fairness value being greater than a predefined threshold and a minimum performance of the machine-learning system.
• the term 'parameters' may denote describing variables of a given machine learning algorithm or related system.
• the weighing factors between the artificial neurons of different layers as well as activation functions and offsets may be seen as parameters.
• hyper-parameters may describe the machine-learning model itself.
• the hyper parameters may describe the architecture of the machine-learning model, whereas the parameters of the same machine-learning model describe internal variables that may be adapted during the training process.
• the term 'reward function' may denote - depending on the problem at hand - a function that may be maximized or minimized in a learning process of a reinforcement machine-learning system.
• the agent - which may try to optimize the reward function - of the reinforcement machine-learning system may also be responsible for“experimenting” (i.e., interacting with its environment by changing parameters) iteratively with
• these environmental parameters may be the parameters of the machine-learning model as well as related hyper-parameters.
• the term 'conflicting objective functions' may denote a performance value and a fairness value fairness which should be optimized the same time. Also at least a third variable - e.g., a preciseness of the machine-learning model - may also be taken into account as objective function. Thus, the performance value as well as the fairness value should each reach a minimum threshold value during a given maximum number of iterations.
• the term 'F-score algorithm' - also FI score - may denote a measure of a test’s accuracy. It may consider both, the precision and the recall of the test to compute the score. Thereby, the precision may denote the number of correct positive results divided by the number of all positive results returned by a classifier, wherein the recall value is the number of correct positive results divided by the number of all relevant samples (all samples that should have been identified as positive).
• the F-score may also be seen as the harmonic average of the precision and recall, were an F-score reaches its best value at 1 (perfect position and perfect recall) and worst at 0.
• the term 'algorithmic bias' may denote a bias for which the selected algorithm may be responsible. It may also reflect implicit values of the programmers who are involved in coding, collecting, selecting or using it in the data for a training of the machine-learning algorithm.
• sample bias' may denote a bias given through the data said being used for a training of a machine-learning model. If the dataset may comprise 90% of data relating to men and only 10% of data relating to women, it may be obvious that the sample is biased in respect to data regarding men.
• the term 'prejudicial bias' may somehow relate to the 'sample bias' and may denote a conscious manipulation of sample data for a training of a machine-learning system due to unproven assumptions of a programmer, a developer or a human trainer of a supervised machine-learning model.
• the term 'measurement bias' may denote a systematic error that may skew all data due to faulty measurements, and its results in a systematic distortion of data.
• the term 'reinforcement learning cycle' may denote here a training cycle of the supervised machine-learning model and an assessment of the related reward function.
• the reinforcement learning system may change parameters, and/or hyper-parameters of the underlying supervised machine-learning model to be optimized.
• the term 'reinforcement agent' may denote one implementation option for a reinforcement machine-learning system.
• the reinforcement agent may change parameters and/or hyper-parameters of the supervised machine-learning model in order to optimize this.
• the environment of the reinforcement learning model may be the supervised machine-learning model.
• the term 'neural network' may denote a brain-inspired network of artificial neurons connected by edges having a weight.
• a neural network may be organized as a number of layers of neurons - an input layer, a plurality of hidden layers and an output layer - wherein each artificial neuron may comprise an activation function.
• the neural network may adapt its parameters - i.e., weighing factors and activation function variables - in order to deliver output values based on an unknown input dataset according to the model which has been determined during the training phase.
• logistic regression model' may denote the widely used statistical model that, in its basic form, may use a logistic function to model a binary dependent variable; many more complex extensions exist.
• logistic regression (or logit regression) may estimate the parameters of a logistic model; it is a form of binomial regression.
• a binary logistic model has a dependent variable with two possible values, such as pass/fail, win/lose, alive/dead or healthy/sick; these are represented by an indicator variable, where the two values are labeled "0" and "1".
• the log-odds (the logarithm of the odds) for the value labeled "1" is a linear combination of one or more independent variables ("predictors"); the independent variables can each be a binary variable (two classes, coded by an indicator variable) or a continuous variable (any real value).
• the corresponding probability of the value labeled "1” can vary between 0 (certainly the value "0") and 1 (certainly the value " 1"), hence the labeling; the function that converts log-odds to probability is the logistic function, hence the name.
• the term 'random forest model' may denote the known machine-learning method for classification, regression and other tasks that operate by constructing a multitude of decision trees at learning time and outputting the class that is the mode of the classes (classification) or mean prediction (regression) of the individual trees.
• the term 'support-vector machine' may denote the known supervised machine learning model with its associated machine-learning algorithm that may analyze data used for classification and regression analysis.
• a support-vector machine model may be understood as a representation of the examples as points in space mapped, so that the examples of the separate categories are divided by a clear gap that is as wide as possible. New examples may then be mapped into the same space and predicted to belong to a category based on which side of the gap they fall.
• the term 'protected attribute' may denote a variable in a dataset (either training dataset or query dataset) in which respect the supervised machine-learning model should be neutral, i.e., unbiased.
• a dataset either training dataset or query dataset
• the supervised machine-learning model should be neutral, i.e., unbiased.
• One example may be the gender of a group of people (e.g., segmented relevant sub-groups, etc.). Output values of the machine-learning model should be roughly the same for different genders.
• Fig. 1 shows a block diagram of an embodiment of the computer-implemented method 100 for improving fairness and reducing discriminatory bias in a supervised machine-learning model.
• the method comprises linking, 102, the supervised machine learning model (MLM) to a reinforcement learning meta-model (RLMM), selecting, 104, a list of hyper-parameters and parameters of the supervised machine-learning model which may be seen as the initial setting of supervised machine-learning model. In some embodiments the selection of parameters may be done randomly.
• the RLMM controls and configures the supervised MLM.
• linking i.e., control and configure
• the supervised machine-learning model by the reinforcement learning meta model involves at least two factors, a configuration and a read out.
• a configuration involves the system tuning and adjusting various parameters on the model.
• a read out involves system observing the prediction and calculating the reward optimally.
• hyper parameters as the“outer variables or parameters” of a machine-learning mode, defining characteristics like - for a neural network - the type of activation function, the number of nodes per layer, the number of layers in case of a neural network, or the machine-learning model itself, and parameters for the supervised-leaming model like the learned variables, in particular weighing factor of edges linking the artificial neurons, as well as activation functions and offsets (internal variables or parameters).
• the method 100 may also comprise controlling, 106, at least one aspect - in particular relating to one protected value - of the supervised machine-learning model by adjusting hyper-parameters values and parameter values of the list of hyper-parameters and parameters of the supervised machine-learning model by a reinforcement learning engine relating to the reinforcement learning meta model by calculating a reward function based on multiple conflicting objective functions.
• the reward function may be a metric specifying how good that reinforcement engine reaches its target which may be defined by a performance metric, a preciseness metric, and a fairness metric.
• the method 100 comprises an iterative repetition of the steps of selecting and controlling for improving a fairness value of the supervised machine learning model. For this purpose, a determination 108 is made whether the target fairness value (controlled by a defined threshold value) and the target performance value are acceptable in combination. It is noted that a YES (not shown) branch of step 108 would indicated that step 108 has achieved the target fairness value that is acceptable based on the threshold and target performance value. Otherwise, a“NO” branch of step 108 would repeat back to step 104.
• the method may comprise of receiving an original version of machine learn receiving an original version of a machine learning model (MLM) including a plurality of parameter values, a plurality of hyperparameter values and an original fairness value that reflects fairness with respect to segmented relevant sub groups. Furthermore, in the same alternate embodiment, the method may adjust at least some of the parameter values and/or at least some of the hyperparameter values of the original version of the MLM to create a provisional version of the MLM.
• MLM machine learning model
• the method may determine a fairness value for the provisional version of the MLM by operations including the following: receiving a reinforcement learning meta model (RLMM) that defines a plurality of fairness related objectives and a reward function reflecting the plurality of fairness related objectives; operating the provisional version of the MLM; during the operation of the provisional version of the MLM, calculating, by the RLMM, reward values based on the reward function; and determining a provisional fairness value for the provisional version of the MLM based upon the reward values.
• the method can determine that the provisional fairness value is greater than the original fairness value and replace the original version of the MLM with the provisional version of the MLM and replacing the original fairness value with the provisional fairness value.
• Fig. 2 shows a block diagram of unwanted bias. Assuming that the rectangle 200 represents a data-lake, a machine-learning model should be trained having not any bias, as shown by the dashed lines. If 202 may represent a male population of the data-lake 200 and 204 represents a female population of the data-lake, an ideally trained system may return as many male predictions as female predictions, i.e., according to the vertical line between the areas 202 and 204. [0049] Generally, in supervised machine-learning, a model is trained based on a dataset in order to optimize some performance metric such as F-score or the area under the receiver operation characteristic (ROC) curve.
• performance metric such as F-score or the area under the receiver operation characteristic (ROC) curve.
• Testing for bias could then be accomplished by taking a subset of the data and checking whether any unwanted preference is given to a certain sub-group. In the illustration of Fig. 2, this testing would be accomplished, e.g., by considering the male and female subset. Thereby, it is assumed that the standard machine learning practice is to partition the dataset into training, testing, and validation datasets. However, this general approach has no impact on the here presented idea.
• the bias metric could be included in addition to the performance metric(s) in the optimization process. However, such multi-target optimization can be complex and time-consuming.
• Fig. 3 shows a block diagram of a comprehensive flowchart 300 summarizing the proposed concept on a high level.
• the supervised machine-learning model is trained. It is then tested, 304 bias and performance, after which a determination 306 is made whether the determined bias at determined performance values are acceptable and within predetermined limits. If that is the case - case“Y” - the process ends and the supervised machine-learning model is trained.
• FIG. 4 shows a block diagram of an embodiment of a landscape 400 of different machine-learning model types and/or different model parameters.
• the landscape 400 is shown as an x-y-chart.
• machine-learning model types are shown (non limiting), e.g., a neural network, a logistic regression engine, a random forest engine and a support-vector machine.
• Each of these machine-learning models may have parameter and/or hyper-parameter datasets (not to be confused with the training dataset), exemplary denoted as“alpha”,“beta” and“gamma”.
• the agent navigates this landscape, making suitable exploit-explore decisions, in a reinforcement learning setting.
• This setting includes an optimization of at least one target parameter, such as F-score, and a bias target threshold.
• the final machine-learning model should perform as well as possible while not exhibiting bias beyond a certain threshold.
• an iteration step may lead to a neural network with parameter and/or hyper-parameter dataset beta (404), an SVM with parameter and/or hyper-parameter dataset, beta (406) or gamma (408).
• any other machine learning model with any other suitable set of parameter and/or hyper-parameter dataset may be chosen.
• This approach has the advantage that a large space of possible machine-learning model types and parameters/hyper-parameters can be efficiently explored in order to arrive at a machine-learning model that is performance-metric optimized and within the accepted bias metric range.
• Fig. 5 shows a block diagram 500 of a set of interacting components which fall into three phases/three categories: controlling, training, and evaluation.
• the controlling portion is symbolized by the blocks 514 and 516.
• a reinforcement learning (RL) engine 516 which is tasked with controlling a supervised machine-learning model to optimize both, fairness and performance.
• the RL engine navigates the space of possible machine-learning models (compare Fig. 4) and model parameters as well as hyper-parameters by calculating a reward which is based both, on performance and fairness of the predictions by the supervised machine learning model.
• the reinforcement learning engine 516 will iteratively optimize this reward function value by exploring several different configurations of the supervised machine-learning model, and the termination engine 514 determines that a suitable predictor has been found based on the convergence of the reward function.
• the termination engine 514 may also have other explicit criteria that must be fulfilled before termination occurs, e.g., constraints on the achieved fairness. If the reward function outcomes have converged and the supervised machine-learning model meets the pre specified performance and fairness requirements, the optimized supervised machine learning model (SML) is presented as a result, 518 (and the maximum number of allowed iterations has not been exceeded). Otherwise, it is assumed that no suitable model could be found, 520. Thus, at this point, the model is not optimized (fairness or performance are not acceptable but a maximum number of iterations has been reached).
• SML supervised machine learning model
• the training portion is symbolized by the block 502.
• the output of the reinforcement learning engine 516 determines the configuration of a supervised machine-learning (SML) model, i.e., the type of the model as well as its parameters and hyper-parameters.
• the resulting supervised machine-learning model is then trained using a set of attributes with corresponding labels, referred to as the training dataset.
• the supervised machine-learning model performs a three-step process consisting of pre-processing, training and post-processing. All three of these steps are configurable by the reinforcement learning engine 516.
• pre-processing includes transformation of the training dataset, e.g., through normalization, rebalancing or the mentioned nullity reduction.
• the training phase then aims at learning the parameters of the SML model to enable a prediction of the labels from the output of the pre-processing step. Any algorithm that is suitable for finding the model parameters may be used. Finally, the predictions generated by the model can be subject to post-processing steps such as scaling,
• thresholding or combinations thereof. It may be noted that the training of this model to learn its parameters, which in itself is often an iterative process, represents one step of the controlling reinforcement learning engine.
• the evaluation portion may be symbolized by the blocks 504, 506, 508, 510,
• a performance metric is F-score.
• a fairness metric is the average relative difference between data samples that only differ on protected attributes. This may be done by splitting a test dataset of pre-selected critical/protected features, 506, and by evaluating a fairness measurement on each of the subsets, 508.
• a part of the evaluation phase may also be a consolidation of the different fairness measures (e.g., max-function, median, etc.). Both metrics - i.e., performance and fairness - are then used as input into a reward function, 512. This may be an F-score function with heavy penalty if a fairness measurement is too low.
• fairness measures e.g., max-function, median, etc.
• Fig. 6 shows the general approach, as discussed in the context of Fig. 5, implemented as an example for a credit scoring algorithm 600 which must not have a gender bias (in the following called protected parameters). There are, however, multiple other attributes such as income, wealth, and others that are expected to have a significant effect on the assignment of a credit score.
• NN neural network
• hyper parameters that define the model (e.g., the number of layers, the amount of oversampling, the learning rate, etc.).
• the type of model itself can also be a hyper-parameter.
• the hyper parameters are initialized randomly, and the model is trained, 602, using training data (stunner training process of the SML algorithm).
• the performance metric of the model is evaluated, 604, by computing the F- score on the test dataset. To illustrate the example, an F-score of 0.8 is assumed for this iteration.
• the bias on the protected metric e.g., gender
• a fair evaluation 608 would require each pair to have a similar credit score, any differences are summarized, 610 into the fairness metric.
• the fairness metric is calculated as the average relative difference between all pairs. In any other method of measuring bias is acceptable as well. To illustrate the example, a fairness metric value of 10% (average relative difference) is assumed.
• a reward function is computed, 612, which is a combination of performance and bias. In this example, this is given by the sum of the F-score and bias metric.
• the bias metric is in this example defined as
• a termination engine 614 uses the computed reward to decide if any iteration is to be initiated. It terminates the process if a defined maximum number of iterations is reached or if the reward is not improving anymore (no convergence). It may also be specified that the fairness metric must be lower than 0.1% to terminate. In case of the discussed example, it is also assumed that the termination engine initiates a further iteration; thus, the SML model can be further optimized. Thus, the termination engine 614 determines that an optimized SML - e.g., an optimized support-vector machine (SVM) or neural network (NN) has been found, 618, or not, 620, within the predefined number of allowed iterations.
• SVM support-vector machine
• N neural network
• the RL engine 616 therefore finds an optimal combination of parameters and/or hyper-parameters that decreases the bias under the specified threshold while maintaining a high performance which results in a fair credit scoring across gender.
• the RL engine uses the computed reward to efficiently optimize the parameters and/or hyper-parameters of the SML model.
• Optimizing for a reward leads to a minimization of the bias as measured by the fairness metric, and/or an improvement of the model performance as measured by the F-score.
• the RL model can be a multi-layer neural network that uses the reward to tune the supervised network hyper-parameters (for example by changing its number of layers, the amount of oversampling, the learning rate, etc.).
• Fig. 7 shows a block diagram of an embodiment of the fairness improvement system for improving fairness and reducing discriminatory bias in a supervised machine-learning model.
• the system comprises a linking component 702 adapted for linking the supervised machine-learning model to a reinforcement learning meta model, a selector unit 704 adapted for selecting a list of parameters of the supervised machine-learning model, and a controller 706 adapted for controlling at least one aspect of the supervised machine-learning model by adjusting parameter values of the list of parameters of the supervised machine-learning model by calculating a reward function based on multiple conflicting objective functions.
• a repetition unit 708 is adapted for triggering the selector unit and the controller iteratively for an improvement of a fairness value of the supervised machine-learning model.
• Embodiments of the invention may be implemented together with virtually any type of computer, regardless of the platform being suitable for storing and/or executing program code.
• Fig. 8 shows, as an example, a computing system 800 suitable for executing program code related to the proposed method.
• the computing system 800 is only one example of a suitable computer system, and is not intended to suggest any limitation as to the scope of use or functionality of embodiments of the invention described herein, regardless, whether the computer system 800 is capable of being implemented and/or performing any of the functionality set forth hereinabove.
• the computer system 800 there are components, which are operational with numerous other general purpose or special purpose computing system environments or configurations.
• Examples of well-known computing systems, environments, and/or configurations that may be suitable for use with computer system/server 800 include, but are not limited to, personal computer systems, server computer systems, thin clients, thick clients, hand-held or laptop devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputer systems, mainframe computer systems, and distributed cloud computing environments that include any of the above systems or devices, and the like.
• Computer system/server 800 may be described in the general context of computer system-executable instructions, such as program modules, being executed by a computer system 800.
• program modules may include routines, programs, objects, components, logic, data structures, and so on that perform particular tasks or implement particular abstract data types.
• Computer system/server 800 may be practiced in distributed cloud computing environments where tasks are performed by remote processing devices that are linked through a
• program modules may be located in both, local and remote computer system storage media, including memory storage devices.
• computer system/server 800 is shown in the form of a general-purpose computing device.
• the components of computer system/server 800 may include, but are not limited to, one or more processors or processing units 802, a system memory 804, and a bus 806 that couple various system components including system memory 804 to the one or more processors or processing units 802.
• Bus 806 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures.
• bus architectures include Industry Standard Architecture (ISA) bus, Micro Channel
• MCA Multimedia Architecture
• EISA Enhanced ISA
• VESA VESA local bus
• PCI Peripheral Component Interconnects
• Computer system/server 800 typically includes a variety of computer system readable media. Such media may be any available media that is accessible by computer
• system/server 800 includes both, volatile and non-volatile media, removable and non-removable media.
• the system memory 804 may include computer system readable media in the form of volatile memory, such as random access memory (RAM) 808 and/or cache memory 810.
• Computer system/server 800 may further include other removable/non removable, volatile/non-volatile computer system storage media.
• a storage system 812 may be provided for reading from and writing to a non-removable, non-volatile magnetic media (not shown and typically called a 'hard drive').
• a magnetic disk drive for reading from and writing to a removable, non-volatile magnetic disk (e.g., a 'floppy disk'), and an optical disk drive for reading from or writing to a removable, non-volatile optical disk such as a CD-ROM, DVD-ROM or other optical media may be provided.
• each can be connected to bus 806 by one or more data media interfaces.
• memory 804 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.
• the program/utility having a set (at least one) of program modules 816, may be stored in memory 804 by way of example, and not limiting, as well as an operating system, one or more application programs, other program modules, and program data. Each of the operating systems, one or more application programs, other program modules, and program data or some combination thereof, may include an implementation of a networking environment.
• Program modules 816 generally carry out the functions and/or methodologies of embodiments of the invention, as described herein.
• the computer system/server 800 may also communicate with one or more external devices 818 such as a keyboard, a pointing device, a display 820, etc.; one or more devices that enable a user to interact with computer system/server 800; and/or any devices (e.g., network card, modem, etc.) that enable computer system/server 800 to communicate with one or more other computing devices. Such communication can occur via one or more external devices 818 such as a keyboard, a pointing device, a display 820, etc.; one or more devices that enable a user to interact with computer system/server 800; and/or any devices (e.g., network card, modem, etc.) that enable computer system/server 800 to communicate with one or more other computing devices. Such communication can occur via one or more external devices 818 such as a keyboard, a pointing device, a display 820, etc.; one or more devices that enable a user to interact with computer system/server 800; and/or any devices (e.g., network card, modem, etc.) that enable
• I/O interfaces 814 may communicate with one or more networks such as a local area network (LAN), a general wide area network (WAN), and/or a public network (e.g., the Internet) via network adapter 822.
• network adapter 822 may communicate with the other components of the computer system/server 800 via bus 806.
• bus 806 It should be understood that, although not shown, other hardware and/or software components could be used in conjunction with computer system/server 800. Examples, include, but are not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data archival storage systems, etc.
• the fairness improvement system 700 for improving fairness in a supervised machine-learning model may be attached to the bus 806.
• the descriptions of the various embodiments of the present invention have been presented for purposes of illustration, but are not intended to be exhaustive or limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skills in the art without departing from the scope and spirit of the described embodiments. The terminology used herein was chosen to best explain the principles of the embodiments, the practical application or technical improvement over technologies found in the marketplace, or to enable others of ordinary skills in the art to understand the embodiments disclosed herein.
• the present invention may be embodied as a system, a method, and/or a computer program product.
• the computer program product may include a computer readable storage medium (or media) having computer readable program instructions thereon for causing a processor to carry out aspects of the present invention.
• the medium may be an electronic, magnetic, optical, electromagnetic, infrared or a semi-conductor system for a propagation medium.
• Examples of a computer-readable medium may include a semi-conductor or solid state memory, magnetic tape, a removable computer diskette, a random access memory (RAM), a read-only memory (ROM), a rigid magnetic disk and an optical disk.
• Current examples of optical disks include compact disk- read only memory (CD-ROM), compact disk-read/write (CD-R/W), DVD and Blu-Ray- Disk.
• the computer readable storage medium can be a tangible device that can retain and store instructions for use by an instruction execution device.
• the computer readable storage medium may be, for example, but is not limited to, an electronic storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing.
• a non- exhaustive list of more specific examples of the computer readable storage medium includes the following: a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), a static random access memory (SRAM), a portable compact disk read-only memory (CD-ROM), a digital versatile disk (DVD), a memory stick, a floppy disk, a mechanically encoded device such as punch-cards or raised structures in a groove having instructions recorded thereon, and any suitable combination of the foregoing.
• a computer readable storage medium, as used herein, is not to be construed as being transitory signals per se, such as radio waves or other freely propagating
• electromagnetic waves electromagnetic waves propagating through a waveguide or other transmission media (e.g., light pulses passing through a fiber-optic cable), or electrical signals transmitted through a wire.
• Computer readable program instructions described herein can be downloaded to respective computing/processing devices from a computer readable storage medium or to an external computer or external storage device via a network, for example, the Internet, a local area network, a wide area network and/or a wireless network.
• the network may comprise copper transmission cables, optical transmission fibers, wireless transmission, routers, firewalls, switches, gateway computers and/or edge servers.
• a network adapter card or network interface in each computing/processing device receives computer readable program instructions from the network and forwards the computer readable program instructions for storage in a computer readable storage medium within the respective computing/processing device.
• Computer readable program instructions for carrying out operations of the present invention may be assembler instructions, instruction-set-architecture (ISA) instructions, machine instructions, machine dependent instructions, microcode, firmware instructions, state-setting data, or either source code or object code written in any combination of one or more programming languages, including an object-oriented programming language such as Smalltalk, C++ or the like, and conventional procedural programming languages, such as the "C" programming language or similar programming languages.
• the computer readable program instructions may execute entirely on the user's computer, partly on the user's computer as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server.
• the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
• electronic circuitry including, for example, programmable logic circuitry, field-programmable gate arrays (FPGA), or programmable logic arrays (PLA) may execute the computer readable program instructions by utilizing state information of the computer readable program instructions to personalize the electronic circuitry, in order to perform aspects of the present invention.
• These computer readable program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
• These computer readable program instructions may also be stored in a computer readable storage medium that can direct a computer, a programmable data processing apparatus, and/or other devices to function in a particular manner, such that the computer readable storage medium having instructions stored therein comprises an article of manufacture including instructions which implement aspects of the function/act specified in the flowchart and/or block diagram block or blocks.
• the computer readable program instructions may also be loaded onto a computer, other programmable data processing apparatuses, or another device to cause a series of operational steps to be performed on the computer, other programmable apparatus or other device to produce a computer implemented process, such that the instructions which execute on the computer, other programmable apparatuses, or another device implement the functions/acts specified in the flowchart and/or block diagram block or blocks.
• each block in the flowchart or block diagrams may represent a module, segment, or portion of instructions, which comprises one or more executable instructions for implementing the specified logical function(s).
• the functions noted in the block may occur out of the order noted in the figures.
• two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved.
• discriminatory bias in a supervised machine-learning model comprising - linking the supervised machine-learning model to a reinforcement learning meta model
• the supervised machine-learning model is selected out of the group comprising a neural network, a logistic regression model, a random forest model, a model of a support-vector machine, and a decision tree model.
• the conflicting objective functions comprise at least two selected out of the group comprising a performance metric, a preciseness metric or a fairness metric.
• the fairness value is determined by an average relative difference between sample data that only differ in values of a protected attribute.
• a fairness improvement system for improving fairness and reducing discriminatory bias in a supervised machine-learning model, the system comprising
• a linking component adapted for linking the supervised machine-learning model to a reinforcement learning meta model
• a selector unit adapted for selecting a list of hyper-parameters and parameters of the supervised machine-learning model
• controller adapted for controlling at least one aspect of the supervised machine learning model by adjusting hyper-parameters values and parameter values of the list of hyper-parameters and parameters of the supervised machine-learning model by a reinforcement learning engine relating the reinforcement learning meta model by calculating a reward function based on multiple conflicting objective functions
• a determination unit adapted for determining the prediction quality value using F- score, recall and precision and/or accuracy.
• the supervised machine-learning model is selected out of the group comprising a neural network, a logistic regression model, a random forest model, a model of a support-vector machine, and a decision tree model.
• the conflicting objective function comprise at least two selected out of the group comprising a performance metric, a preciseness metric or a fairness metric.
• the fairness value is determined by an average relative difference between sample data that only differ in values of a protected attribute.
• the repetition unit is adapted for:
• a computer program product for improving fairness in a supervised machine learning model comprising a computer readable storage medium having program instructions embodied therewith, the program instructions being executable by one or more computing systems or controllers to cause the one or more computing systems to

Landscapes

• Engineering & Computer Science (AREA)
• Theoretical Computer Science (AREA)
• Physics & Mathematics (AREA)
• Software Systems (AREA)
• Computing Systems (AREA)
• Artificial Intelligence (AREA)
• Mathematical Physics (AREA)
• General Physics & Mathematics (AREA)
• Data Mining & Analysis (AREA)
• Evolutionary Computation (AREA)
• General Engineering & Computer Science (AREA)
• Biomedical Technology (AREA)
• Molecular Biology (AREA)
• General Health & Medical Sciences (AREA)
• Computational Linguistics (AREA)
• Biophysics (AREA)
• Life Sciences & Earth Sciences (AREA)
• Health & Medical Sciences (AREA)
• Computer Vision & Pattern Recognition (AREA)
• Medical Informatics (AREA)
• Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
• Management, Administration, Business Operations System, And Electronic Commerce (AREA)
• Acyclic And Carbocyclic Compounds In Medicinal Compositions (AREA)

Priority Applications (4)

Applications Claiming Priority (2)

Publications (1)

Family

ID=72663093

Family Applications (1)

Country Status (6)

Families Citing this family (28)

Citations (2)

Family Cites Families (8)

• 2019
  • 2019-04-08 US US16/377,727 patent/US20200320428A1/en not_active Abandoned
• 2020
  • 2020-03-18 WO PCT/IB2020/052465 patent/WO2020208444A1/en not_active Ceased
  • 2020-03-18 CN CN202080027018.4A patent/CN113692594A/zh active Pending
  • 2020-03-18 DE DE112020000537.2T patent/DE112020000537T5/de not_active Withdrawn
  • 2020-03-18 JP JP2021558964A patent/JP2022527536A/ja active Pending
  • 2020-03-18 GB GB2115858.9A patent/GB2597406A/en not_active Withdrawn

Patent Citations (2)

Non-Patent Citations (2)

Also Published As

Similar Documents

Legal Events