Greedy Column Subset Selection: New Bounds and Distributed Algorithms.
Jason AltschulerAditya BhaskaraGang FuVahab S. MirrokniAfshin RostamizadehMorteza ZadimoghaddamPublished in: ICML (2016)
Keyphrases
- subset selection
- hill climbing
- worst case
- theoretical analysis
- distributed systems
- orders of magnitude
- computationally efficient
- neural network
- error bounds
- computational efficiency
- upper bound
- search space
- computational complexity
- data structure
- feature selection
- computational cost
- cooperative
- data mining algorithms
- distributed environment
- convergence rate
- learning algorithm
- data sets
- pac bayesian
- worst case bounds