Random Feature Methods
Overview
Random feature methods replace expensive kernel computations or trained hidden layers with finite sets of randomized functions, making learning more scalable. Approaches include random Fourier and spectral features, structured projections, graph-based features, and adaptive or learned feature distributions, often paired with ridge regression or least-squares readouts. They are studied in kernel regression and classification, graph learning, PDE solving, time-series modeling, and attention, with theory covering approximation, learning rates, and robustness. A central challenge is balancing feature count and computational cost against accuracy and numerical conditioning, especially when data are misspecified or have exploitable structure.
Latest papers
46 papers11 papers in the last four weeks, up 83% on the four weeks before. 0.1% of all new papers.