ID: 1905.02263

Learning Algebraic Structures: Preliminary Investigations

May 2, 2019

View on ArXiv

Similar papers 5

Supervised Classification: Quite a Brief Overview

October 25, 2017

82% Match
Marco Loog
Machine Learning
Computer Vision and Pattern ...
Machine Learning

The original problem of supervised classification considers the task of automatically assigning objects to their respective classes on the basis of numerical measurements derived from these objects. Classifiers are the tools that implement the actual functional mapping from these measurements---also called features or inputs---to the so-called class label---or output. The fields of pattern recognition and machine learning study ways of constructing such classifiers. The main ...

Find SimilarView on arXiv

Which Learning Algorithms Can Generalize Identity-Based Rules to Novel Inputs?

May 12, 2016

82% Match
Paul Tupper, Bobak Shahriari
Computation and Language

We propose a novel framework for the analysis of learning algorithms that allows us to say when such algorithms can and cannot generalize certain patterns from training data to test data. In particular we focus on situations where the rule that must be learned concerns two components of a stimulus being identical. We call such a basis for discrimination an identity-based rule. Identity-based rules have proven to be difficult or impossible for certain types of learning algorit...

Find SimilarView on arXiv

Learning Reductions that Really Work

February 9, 2015

82% Match
Alina Beygelzimer, Hal III Daumé, ... , Mineiro Paul
Machine Learning

We provide a summary of the mathematical and computational techniques that have enabled learning reductions to effectively address a wide class of problems, and show that this approach to solving machine learning problems can be broadly useful.

Find SimilarView on arXiv

A Theory of Machine Learning

July 8, 2024

82% Match
Jinsook Kim, Jinho Kang
Machine Learning
Machine Learning

We critically review three major theories of machine learning and provide a new theory according to which machines learn a function when the machines successfully compute it. We show that this theory challenges common assumptions in the statistical and the computational learning theories, for it implies that learning true probabilities is equivalent neither to obtaining a correct calculation of the true probabilities nor to obtaining an almost-sure convergence to them. We als...

Find SimilarView on arXiv

Revealing the hidden beauty of finite groups with Cayley graphs

February 29, 2024

82% Match
Matthew Macauley
History and Overview

Group theory involves the study of symmetry, and its inherent beauty gives it the potential to be one of the most accessible and enjoyable areas of mathematics, for students and non-mathematicians alike. Unfortunately, many students never get a glimpse into the more alluring parts of this field because "traditional" algebra classes are often taught in a dry axiomatic fashion, devoid of visuals. This article will showcase aesthetic pictures that can bring this subject to life....

Find SimilarView on arXiv
82% Match
Yang-Hui He, Kyu-Hwan Lee, Thomas Oliver
Number Theory
Machine Learning

We show that standard machine-learning algorithms may be trained to predict certain invariants of low genus arithmetic curves. Using datasets of size around one hundred thousand, we demonstrate the utility of machine-learning in classification problems pertaining to the BSD invariants of an elliptic curve (including its rank and torsion subgroup), and the analogous invariants of a genus 2 curve. Our results show that a trained machine can efficiently classify curves according...

Unsupervisedly Learned Representations: Should the Quest be Over?

January 21, 2020

82% Match
Daniel N. Nissensohn Nissani
Machine Learning
Artificial Intelligence

There exists a Classification accuracy gap of about 20% between our best methods of generating Unsupervisedly Learned Representations and the accuracy rates achieved by (naturally Unsupervisedly Learning) humans. We are at our fourth decade at least in search of this class of paradigms. It thus may well be that we are looking in the wrong direction. We present in this paper a possible solution to this puzzle. We demonstrate that Reinforcement Learning schemes can learn repres...

Find SimilarView on arXiv

Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges

April 27, 2021

82% Match
Michael M. Bronstein, Joan Bruna, ... , Veličković Petar
Machine Learning
Artificial Intelligence
Computational Geometry
Computer Vision and Pattern ...
Machine Learning

The last decade has witnessed an experimental revolution in data science and machine learning, epitomised by deep learning methods. Indeed, many high-dimensional learning tasks previously thought to be beyond reach -- such as computer vision, playing Go, or protein folding -- are in fact feasible with appropriate computational scale. Remarkably, the essence of deep learning is built from two simple algorithmic principles: first, the notion of representation or feature learnin...

Find SimilarView on arXiv

AI for Mathematics: A Cognitive Science Perspective

October 19, 2023

82% Match
Cedegao E. Zhang, Katherine M. Collins, ... , Tenenbaum Joshua B.
Neurons and Cognition
Artificial Intelligence

Mathematics is one of the most powerful conceptual systems developed and used by the human species. Dreams of automated mathematicians have a storied history in artificial intelligence (AI). Rapid progress in AI, particularly propelled by advances in large language models (LLMs), has sparked renewed, widespread interest in building such systems. In this work, we reflect on these goals from a \textit{cognitive science} perspective. We call attention to several classical and on...

Find SimilarView on arXiv

Review of Automaton Learning Algorithms with Polynomial Complexity -- Completely Solved Examples

April 17, 2024

82% Match
Farah Haneef
Formal Languages and Automat...
Computational Complexity

Automaton learning is a domain in which the target system is inferred by the automaton learning algorithm in the form of an automaton, by synthesizing a finite number of inputs and their corresponding outputs. Automaton learning makes use of a Minimally Adequate Teacher (MAT). The learner learns the target system by posing membership queries to the MAT. In this chapter, I have provided completely solved examples of automaton learning algorithms. According to the best of my kn...

Find SimilarView on arXiv