A Novel Machine Learning Method for Preference Identification
- URL: http://arxiv.org/abs/2010.13517v2
- Date: Wed, 25 Nov 2020 00:22:47 GMT
- Title: A Novel Machine Learning Method for Preference Identification
- Authors: Azlan Iqbal
- Abstract summary: We propose a computational method that is able to learn from existing databases of 'liked' and 'disliked' compositions.
The experimental results showed that the method was able to sort a new and unseen collection of compositions such that, on average, over 70% of the preferred compositions were in the top half of the collection.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Human preference or taste within any domain is usually a difficult thing to
identify or predict with high probability. In the domain of chess problem
composition, the same is true. Traditional machine learning approaches tend to
focus on the ability of computers to process massive amounts of data and
continuously adjust 'weights' within an artificial neural network to better
distinguish between say, two groups of objects. Contrasted with chess
compositions, there is no clear distinction between what constitutes one and
what does not; even less so between a good one and a poor one. We propose a
computational method that is able to learn from existing databases of 'liked'
and 'disliked' compositions such that a new and unseen collection can be sorted
with increased probability of matching a solver's preferences. The method uses
a simple 'change factor' relating to the Forsyth-Edwards Notation (FEN) of each
composition's starting position, coupled with repeated statistical analysis of
sample pairs from both databases. Tested using the author's own collections of
computer-generated chess problems, the experimental results showed that the
method was able to sort a new and unseen collection of compositions such that,
on average, over 70% of the preferred compositions were in the top half of the
collection. This saves significant time and energy on the part of solvers as
they are likely to find more of what they like sooner. The method may even be
applicable to other domains such as image processing because it does not rely
on any chess-specific rules but rather just a sufficient and quantifiable
'change' in representation from one object to the next.
Related papers
- What to Do When Your Discrete Optimization Is the Size of a Neural
Network? [24.546550334179486]
Machine learning applications using neural networks involve solving discrete optimization problems.
classical approaches used in discrete settings do not scale well to large neural networks.
We take continuation path (CP) methods to represent using purely the former and Monte Carlo (MC) methods to represent the latter.
arXiv Detail & Related papers (2024-02-15T21:57:43Z) - Context-Aware Ensemble Learning for Time Series [11.716677452529114]
We introduce a new approach using a meta learner that effectively combines the base model predictions via using a superset of the features that is the union of the base models' feature vectors instead of the predictions themselves.
Our model does not use the predictions of the base models as inputs to a machine learning algorithm, but choose the best possible combination at each time step based on the state of the problem.
arXiv Detail & Related papers (2022-11-30T10:36:13Z) - Deep Learning to Jointly Schema Match, Impute, and Transform Databases [19.200830026362425]
Joining data from multiple origins with unmapped and only partially overlapping features is a prerequisite to developing robust, generalizable algorithms.
We develop two novel procedures to address this problem.
In synthetic and real-world experiments using two electronic health record databases, our algorithms outperform existing baselines for matching variable sets.
arXiv Detail & Related papers (2022-06-22T21:25:59Z) - Three approaches to supervised learning for compositional data with
pairwise logratios [0.0]
Common approach to compositional data analysis is to transform the data by means of logratios.
Logratios between pairs of compositional parts (pairwise logratios) are the easiest to interpret in many research problems.
We present three alternative stepwise supervised learning methods to select the pairwise logratios that best explain a dependent variable in a generalized linear model.
arXiv Detail & Related papers (2021-11-17T07:51:20Z) - Determining Chess Game State From an Image [19.06796946564999]
This paper puts forth a new dataset synthesised from a 3D model that is an order of magnitude larger than existing ones.
A novel end-to-end chess recognition system is presented that combines traditional computer vision techniques with deep learning.
The described system achieves an error rate of 0.23% per square on the test set, 28 times better than the current state of the art.
arXiv Detail & Related papers (2021-04-30T13:02:13Z) - Differentiable Multi-Granularity Human Representation Learning for
Instance-Aware Human Semantic Parsing [131.97475877877608]
A new bottom-up regime is proposed to learn category-level human semantic segmentation and multi-person pose estimation in a joint and end-to-end manner.
It is a compact, efficient and powerful framework that exploits structural information over different human granularities.
Experiments on three instance-aware human datasets show that our model outperforms other bottom-up alternatives with much more efficient inference.
arXiv Detail & Related papers (2021-03-08T06:55:00Z) - Multi-task Supervised Learning via Cross-learning [102.64082402388192]
We consider a problem known as multi-task learning, consisting of fitting a set of regression functions intended for solving different tasks.
In our novel formulation, we couple the parameters of these functions, so that they learn in their task specific domains while staying close to each other.
This facilitates cross-fertilization in which data collected across different domains help improving the learning performance at each other task.
arXiv Detail & Related papers (2020-10-24T21:35:57Z) - Continual Learning using a Bayesian Nonparametric Dictionary of Weight
Factors [75.58555462743585]
Naively trained neural networks tend to experience catastrophic forgetting in sequential task settings.
We propose a principled nonparametric approach based on the Indian Buffet Process (IBP) prior, letting the data determine how much to expand the model complexity.
We demonstrate the effectiveness of our method on a number of continual learning benchmarks and analyze how weight factors are allocated and reused throughout the training.
arXiv Detail & Related papers (2020-04-21T15:20:19Z) - Unsupervised Person Re-identification via Softened Similarity Learning [122.70472387837542]
Person re-identification (re-ID) is an important topic in computer vision.
This paper studies the unsupervised setting of re-ID, which does not require any labeled information.
Experiments on two image-based and video-based datasets demonstrate state-of-the-art performance.
arXiv Detail & Related papers (2020-04-07T17:16:41Z) - Learn to Predict Sets Using Feed-Forward Neural Networks [63.91494644881925]
This paper addresses the task of set prediction using deep feed-forward neural networks.
We present a novel approach for learning to predict sets with unknown permutation and cardinality.
We demonstrate the validity of our set formulations on relevant vision problems.
arXiv Detail & Related papers (2020-01-30T01:52:07Z) - Optimal Clustering from Noisy Binary Feedback [75.17453757892152]
We study the problem of clustering a set of items from binary user feedback.
We devise an algorithm with a minimal cluster recovery error rate.
For adaptive selection, we develop an algorithm inspired by the derivation of the information-theoretical error lower bounds.
arXiv Detail & Related papers (2019-10-14T09:18:26Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.