Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
tw1010
on Jan 24, 2018
|
parent
|
context
|
favorite
| on:
Non-Convex Optimization for Machine Learning
This is a really great observation. A lot of the time when people say "but that problem is NP!" is it still likely that you'd be able to solve it by exploiting some structural properties of the specifics.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: