Subset Selection under Noise
Chao Qian, Jing-Cheng Shi, Yang Yu, Ke Tang, Zhi-Hua Zhou
–Neural Information Processing Systems
Since it is generally NPhard [7], much effort has been devoted to the design of polynomial-time approximation algorithms. The greedy algorithm is most favored for its simplicity, which iteratively chooses one item with the largest immediate benefit. Despite the greedy nature, it can perform well in many cases.
Neural Information Processing Systems
Nov-21-2025, 13:07:10 GMT
- Country:
- Asia > China
- Anhui Province (0.04)
- Guangdong Province > Shenzhen (0.04)
- Jiangsu Province > Nanjing (0.04)
- North America > United States
- California
- Los Angeles County > Long Beach (0.04)
- Santa Clara County > Palo Alto (0.04)
- California
- Asia > China
- Technology: