New method tackles NP-hard diversity selection for large datasets

Researchers have developed a new method called Spectral DPPs via NEPv to address the NP-hard problem of selecting diverse, high-quality subsets from large datasets. This approach recasts the Determinantal MAP objective as a continuous optimization problem on the Stiefel manifold, leading to a Nonlinear Eigenvalue Problem with eigenvector dependency (NEPv). The proposed solver, OurMethod, offers a scalable solution that integrates with common machine learning kernels and scales near-linearly with the size of the candidate pool. AI

IMPACT This method could improve efficiency in data curation and subset selection for training large AI models.

RANK_REASON The cluster contains an academic paper detailing a new algorithmic method for data selection. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.LG →

• arXiv
• Determinantal MAP
• Hartree–Fock method
• Nepvant
• Nonlinear eigenvalue problems for even functionals
• OurMethod
• Richard Yi Da Xu
• Stiefel manifold

• paper
• other

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →