LFD Book Forum  

Go Back   LFD Book Forum > General > General Discussion of Machine Learning

Reply
 
Thread Tools Display Modes
  #1  
Old 08-28-2012, 11:52 AM
ramin ramin is offline
Junior Member
 
Join Date: Jul 2012
Posts: 6
Default computational complexity?

Hi,

Professor Abu-Mostafa at times mentions computational complexity of different learning tasks (for example,I think he mentioned general solution to RBF with the width parameters is NP hard?). In addition, he sometimes refers to function approximation formulations of certain problems. Are there good introductory references to these two topics ?
Reply With Quote
  #2  
Old 08-28-2012, 12:31 PM
yaser's Avatar
yaser yaser is offline
Caltech
 
Join Date: Aug 2009
Location: Pasadena, California, USA
Posts: 1,477
Default Re: computational complexity?

Since these are pretty standard terms nowadays, I suggest you start with wikipedia for an introduction and follow up the references as needed.
__________________
Where everyone thinks alike, no one thinks very much
Reply With Quote
  #3  
Old 08-28-2012, 09:34 PM
ramin ramin is offline
Junior Member
 
Join Date: Jul 2012
Posts: 6
Default Re: computational complexity?

Hi, sorry. I probably wasn't clear. I'm familiar with concepts of computational complexity but not with the proofs that are specific to the machine learning problems.
Reply With Quote
  #4  
Old 08-28-2012, 10:09 PM
yaser's Avatar
yaser yaser is offline
Caltech
 
Join Date: Aug 2009
Location: Pasadena, California, USA
Posts: 1,477
Default Re: computational complexity?

Quote:
Originally Posted by ramin View Post
Hi, sorry. I probably wasn't clear. I'm familiar with concepts of computational complexity but not with the proofs that are specific to the machine learning problems.
Got it. There is a book by Steven Judd in the 1980's that started this line of work. There are also more general results proving certain optimization problems are NP-hard. They are almost folklore now, but let me try to look up specific references.
__________________
Where everyone thinks alike, no one thinks very much
Reply With Quote
  #5  
Old 08-31-2012, 06:46 AM
vksheilds vksheilds is offline
Banned
 
Join Date: Aug 2012
Posts: 2
Default Re: computational complexity?

  • A resource for outstanding research in computational complexity
  • Covers models of computation, complexity bounds, complexity classes and more
  • Explores the structure of complexity classes, algebraic complexity, cryptography and issues in robotics, logic and distributed computing
Reply With Quote
Reply

Thread Tools
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off

Forum Jump


All times are GMT -7. The time now is 04:02 PM.


Powered by vBulletin® Version 3.8.3
Copyright ©2000 - 2019, Jelsoft Enterprises Ltd.
The contents of this forum are to be used ONLY by readers of the Learning From Data book by Yaser S. Abu-Mostafa, Malik Magdon-Ismail, and Hsuan-Tien Lin, and participants in the Learning From Data MOOC by Yaser S. Abu-Mostafa. No part of these contents is to be communicated or made accessible to ANY other person or entity.