![Computational learning theory studies the
time complexity and feasibility of learning
In computational learning theory, a computation is considered feasible if it can be
done in polynomial time. There are two kinds of time complexity results:
Positive results – Showing that a certain class of functions is learnable in
polynomial time.
Negative results – Showing that certain classes cannot be learned in polynomial
time.
Negative results often rely on commonly believed, but yet unproven
assumptions,[citation needed] such as:
Computational complexity – P ≠ NP (the P versus NP problem);
Cryptographic – One-way functions exist.](https://image.slidesharecdn.com/computationallearningtheoryppt-240502180755-dbe12cf8/85/Computational-Learning-Theory-ppt-pptxhhhh-4-320.jpg)
Computational Learning Theory ppt.pptxhhhh
- 1. Computational Learning theory By: Zoobia Rana Cms ID: 2977-2023
- 2. What is Computational Learning Theory? Computational Learning Theory (CoLT) is a field of AI research studying the design of machine learning algorithms to determine what sorts of problems are “learnable.” The ultimate goals are to understand the theoretical underpinnings of deep learning programs, what makes them work or not, while improving accuracy and efficiency. This research field merges many disciplines, such as probability theory, statistics, programming optimization, information theory, calculus and geometry
- 3. Machine Learning (ML) is the scientific study of algorithms and statistical models that computer systems use to perform a specific task without using explicit instructions, relying on patterns and inference instead. It is seen as a subset of artificial intelligence. Machine learning algorithms build a mathematical model based on sample data, known as "training data", in order to make predictions or decisions without being explicitly programmed to perform the task.[ Machine learning algorithms are used in a wide variety of applications, such as email filtering and computer vision, where it is difficult or infeasible to develop a conventional algorithm for effectively performing the task.
- 4. Computational learning theory studies the time complexity and feasibility of learning In computational learning theory, a computation is considered feasible if it can be done in polynomial time. There are two kinds of time complexity results: Positive results – Showing that a certain class of functions is learnable in polynomial time. Negative results – Showing that certain classes cannot be learned in polynomial time. Negative results often rely on commonly believed, but yet unproven assumptions,[citation needed] such as: Computational complexity – P ≠ NP (the P versus NP problem); Cryptographic – One-way functions exist.
- 5. The goal of computing theory To make explicit relevant aspects of the learner and the environment To identify easy and hard learning problems (and the precise conditions under which they are easy or hard) To guide the design of learning systems To help analyze the performance of learning system To shed light on natural learning systems To develop and analyze models
- 6. Computational Models of Learning • Mistake bound model • The Halving Algorithms • PAC (Probably Approximately Correct) model • Occam Algorithm • VC Dimension and Sample Complexity • Kolmogorov Complexity • VC Dimension and Sample Complexity
- 7. PAC stands for Probably Approximately Correct It mean that machine learning approaches offer a probability solution for a given problem and this solution tends to be approximaltely correct
- 8. What are learning systems? Pattern recognizers, adaptive control systems, adaptive intelligent agents, etc. Examples 02 Systems that improve their performance one or more tasks with experience in their environment It is 01
- 9. Theories of Learning: What are they good for?
- 10. Mistake Bound model Given an arbitrary, noise-free sequence of label examples of an unknown binary conjunctive concept C over {0,1} N, the learner's task is to predict C(X) for a given X. Mistake bound Model • Initialize H ={X 1; ~X 1, ~X 2, ~X 3, ...} • Predict according to match between an instance and the conjunction of literals in H • Whenever a mistake is made on a positive example, drop the offending literals from Hs Figure: Diagram
- 11. PAC Learning Consider: >An instance space X >A concept space C = { C:X → {0,1}} >A hypothesis space H= { H:X → {0.1}} >An unknown, arbitrary, not necessarily computable, stationary probability distribution D over the instance space X
- 12. PAC Learning The oracle samples the instance space according to D and provides labeled examples of an unknown concept C to the learner. The learner is tested on samples drawn from the instance space according to the same probability distribution D . The learner's task is to output a hypothesis h from H that closely approximates the unknown concept C based on the examples it has encountered
- 13. In the PAC setting, exact learning (zero error approximation) cannot be guaranteed In the PAC setting, even approximate learning (with bounded non-zero error) cannot be guaranteed 100% of the time PAC Learning
- 14. is a measure of the capacity of a space of functions that can be learned by a statistical classification algorithm. VC Dimension Vapnik–Chervonenkis Dimension
- 15. Shattering A hypothesis class H can shatter N data points for which we can find a hypothesis H that separates the positive examples from negative for every problem, then we say H shatters N points.
- 16. THANK YOU